causal

Natural-language AI proofs cannot be trusted without formal checking

Kontorovich argues that AI natural-language proofs cannot be trusted because they are stochastic and may not reflect a model of mathematics; autoformalization into Lean code that builds on Mathlib is the way to confirm that a claimed proof is correct down to the axioms.

causalpending

Speaker

Alex Kontorovich

Evidence Quote

“they'll write a Lean code that builds on top of Mathlib ... and checks that it has indeed solved this problem down to the axioms”

Source

Lex Fridman Podcast #503 - AI Crisis in Math— Lex Fridman Podcast
Created: 11/17/2026, 6:25:32 AM

Your notes

Loading notes...