automated-theory-construction-lean

Policy for non-semantic refactors that keep math meaning unchanged while making Lean/Mathlib code easier to review and harder to break: minimal imports, scoped assumptions, localized `classical`, proof tidying, lint fixes, perf/typeclass risk control, and PR splitting.

Mathlib usage principles (imports, search, existence checks, confirmation) for all `.lean` files in this repo.

I/O contract for proof/counterexample/stuck attempts and post-attempt new-problem proposals.

Rules to apply this repo's Lean workflow (plan → skeleton → error-driven iteration → mathlib search → minimal diffs) consistently across all `.lean` files.