Remix.run Logo
▲ mlmonkey 7 hours ago

Out of curiosity: is it possible to take a frontier model and just let it loose on all math textbooks out there, converting each and every proof/theorem/lemma/etc. into Lean? A frontier model should be able to do that, right? And it's a one-time task: do it once and it's there for eternity, available as a library to be used in other proofs.

Maybe my understanding of Lean is wrong; I'm thinking of it as a programming language but for Math.

▲jonath_laurent 7 hours ago | parent | next [-]

Axiom MTS here. What you describe is pretty close to how we formalised this proof, which is scattered across more than 500 articles and books: a swarm of agents was tasked with going through all these sources.

One challenge is assembling everything into a coherent whole, since the same informal concept can be formalised in slightly different but incompatible ways.

▲p11p 2 hours ago | parent [-]

[flagged]

▲penteract 2 hours ago | parent [-]

Producing a formalized proof from a non-formalized proof in a paper or book should not be considered a violation of copyright.

▲pfdietz 2 hours ago | parent [-]

Indeed; one cannot copyright mathematical ideas, only their specific expressions. And the formalization is a different expression.

▲bananaflag 7 hours ago | parent | prev | next [-]

Yes, but thing is, for a lot of basic stuff there are myriad ways in which it is formulated, so humans have to decide which of them goes in the library. Of course you can include two or five or ten equivalent formulations (like textbooks sometimes do) but still, not everything under the sun.

Probably this will be done in some form in the coming months.

▲thaumasiotes 5 hours ago | parent [-]

> Of course you can include two or five or ten equivalent formulations (like textbooks sometimes do) but still, not everything under the sun.

Note that mathlib currently includes duplicates of many theorems; I believe deduplication is an active goal (if not one seeing much labor right now).

▲aureianimus 5 hours ago | parent | prev | next [-]

Yes and no. With enough compute, probably, but doing this does not necessarily yield a reusable library. See https://xenaproject.wordpress.com/2026/10/16/how-to-formaliz...

▲Someone 3 hours ago | parent | prev | next [-]

_If_ you have formalized a provable theorem in Lean, a simple bread-first search can prove it. It will take lots (and lots, and lots, and lots…) of time, though (https://en.wikipedia.org/wiki/General_Problem_Solver).

LLMs can do smarter searches, and will likely find proofs for most of them, but are not guaranteed to find a proof.

▲ 5 hours ago | parent | prev | next [-]
[deleted]
▲tyromaniac 7 hours ago | parent | prev | next [-]

Write a few proofs with it and then come back to this

▲QuesnayJr 6 hours ago | parent | prev [-]

I think people assume that it would end up not being usable by humans without a lot of hand-holding. Though maybe that's wrong, and somebody should try it.