About the service
I am a formalization engineer and write proofs in Lean 4 for research groups, textbook authors and teams who need machine-checked guarantees, not hand-wavy reasoning. Give me a theorem statement, a paper or a vague specification — I turn it into a compiling Lean project: careful definitions, thoughtful dependent types and proofs that the kernel accepts without leaving a single sorry. My main tool is mathlib. I understand how its algebraic hierarchy, order theory, topology and analysis are structured, so I reuse ready-made lemmas rather than reinventing them, and I know how to format a contribution to pass mathlib review: with proper names and documenting comments. What I typically deliver: formalization of a single lemma or an entire chapter of real or discrete mathematics; description of an inductive data type and proof of its properties by structural or well-founded recursion; verification that a small algorithm or protocol matches the specification; cleaning up tangled proofs so simp, omega and decide tactics do the heavy lifting. I write readable code both in term mode and tactics, comment subtle spots and hand over a project that builds with a fixed toolchain via Lake, so nothing breaks over time. Beyond the proofs themselves I help teams adopt the prover: I set up continuous integration that fails on any broken proof, explain the intuition of dependent types and translate informal arguments into machine-checkable form. Send me the hardest step where you're stuck and I'll formalize it from beginning to end.
