logoalt Hacker News

troupo • yesterday at 6:52 PM • 0 replies • view on HN

> No, to be clear, in Lean, it really can't

It can. For two reasons. One reason is that the proofs themselves depend on on unchecked and unverified definitions and statements:

--- start quote ---

An example of this right now is a PR to DeepMind’s Formal Conjectures repository containing a Lean formalisation of the statement of the Hodge conjecture. At the time of writing, the statement relies on over 10,000 lines of code sitting on top of Mathlib, because Mathlib does not yet have the definitions of things like the cycle class map needed to make the statement.

Another example is Axiom’s recent announcement of a formally-verified proof of the classification of finite simple groups. The statement which Axiom’s system proved is here in Tau Ceti, an AI-generated library of Lean code. The file containing the statement imports over 250K lines of Lean code in Tau Ceti (over 900 files). Of these, around 5600 lines of code are crucial because they contain all the relevant definitions

--- end quote ---

And the second reason is why `lake comparator` exists.