lean-homology

Prove a specific sorry'd lemma iteratively using Lean LSP tools.

Improve Claude Code workflow by updating assistants.md, skills, memory, or CLAUDE.md.

Fix warnings line by line and bring code into compliance with Mathlib style standards.

Improve an existing working proof for structural clarity, succinctness, or reusability.

Draft sorry'd theorem/lemma structure for a larger result from a proof sketch.

Fill a sorry one step at a time, directed by the user.

Read and discuss proofs, strategies, or math concepts without making any edits.

Find whether a theorem/concept exists in Mathlib and locate building blocks for a new theorem.