theory-decompose

What problem does it solve?

Break down complex proof goals into discrete, verifiable sub-lemmas with a clear dependency roadmap, enabling structured progress.

Core Features & Use Cases

• Sub-lemma decomposition: Breaks the main claim into precisely stated sub-lemmas with defined difficulty levels (routine / moderate / hard / open).
• Dependency graph: Generates a text-based dependency graph showing inter-lemma relations and sequencing.
• Critical-path identification: Highlights the hardest sub-lemma and the path to completion.
• Roadmap persistence: Saves the roadmap to outputs/{topic}/roadmaps/ for later reference.

Quick Start

Provide a complex theorem and run the decomposition to reveal sub-lemmas, their dependencies, and a clear critical-path roadmap.