I tried this again 6 months later. Claude Code got *way* farther this time (though I did use Opus 5.x): github.com/vhxs/simplic... I have the simplicial approximation theorem. The definitions are compatible with already exists in Mathlib. It took shockingly little input from me...
Sonnet 4.5 got surprisingly far with proving the simplicial approximation theorem in Lean. I was trying to define combinatorial simplicial complexes in such a way that the geometric realization functor uses the existing definition of geometric complexes already in Lean’s mathlib.