13M LoC, are we sure it didn't exploit any latent issues in the lean proof system?
The AI labs have out considerable effort in trying to find and patch lean exploits. They explicitly set agents and have them try to prove false. > Daniel used OpenAI internal models to discover new soundness issues in the official Lean kernel and runtime https://leodemoura.github.io/blog/2026-8-24-postmortem-for-t... They found several bugs and they have patched them. Lots of work going into making sure lean is sound…
Formalizing Fermat's Last Theorem
451–460 of 527 posts
Re: Formalizing Fermat's Last Theorem
#452Re: Formalizing Fermat's Last Theorem
#453Earlier quoted context omitted.
encode mathematical reasoning in a way that can’t be fooled. I would be a bit careful asserting that in full generality, given https://github.com/James-Hanson/junk-theorems-in-lean
Some kind of linter should flag these with a warning, I think
Re: Formalizing Fermat's Last Theorem
#454I'm a mathematician and I'm not sure one should believe those results right now.. An automatic formalization requires a system of logic rules to be applied, which is not something LLMs are great at (remember the Apple paper a while ago?). I'm very curious to see how the community will react after the initial hype.. so far, it's being quite disappointing..
Re: Formalizing Fermat's Last Theorem
#455i find this and other efforts from anthropic somewhat antisocial. technically they have achieved their goal, but in a way which does not benefit mathematics or humanity. Kevin Buzzards headline goal was to formalise FLT, but i’m sure the real aim was to create a formalised library of mathematics which is comprehensible to humans. By solving these famous problems by brute force, they are disincentivising the important…
Re: Formalizing Fermat's Last Theorem
#456Earlier quoted context omitted.
coming back to your argument about peano being obtained from zfc, you obviously can't prove that it happened using purely zfc, and not some logical framework embedded into those proof assistants. I said I am not expert, I am indeed not expert in zfc and godel theorems, but I am an expert (phd) in actual formalization theory. Formal theory is very simple concept: its alphabet, set of formulas on top of this alphabet,…
Eh? Any first course in set theory will present ZFC as a one-sorted theory with ten axioms (/schemas) in first order logic (inheriting an equality symbol, forall, implies etc) with one binary predicate (namely set membership), or will present a theory that is equiconsistent with a usual ZFC presentation. Honestly I’m not sure how you simultaneously claim to be a PhD in formalisation and also not be aware of the exist…
I am aware, also I am not sure why you wrote all of this. Your unknown to me "first course" claims to be some authority of formalization purity?
Re: Formalizing Fermat's Last Theorem
#457i find this and other efforts from anthropic somewhat antisocial. technically they have achieved their goal, but in a way which does not benefit mathematics or humanity. Kevin Buzzards headline goal was to formalise FLT, but i’m sure the real aim was to create a formalised library of mathematics which is comprehensible to humans. By solving these famous problems by brute force, they are disincentivising the important…
Maybe society has the wrong values. Maybe society needs to rethink incentives. Maybe society is somewhat antisocial.
Re: Formalizing Fermat's Last Theorem
#458Earlier quoted context omitted.
zfc doesn't have functions, so you are building something new on top of it. Also, I am not sure successor function is enough for PA.
It simply does have functions. According to ZFC, a function is a set whose members are pairs, such that no two different pairs have the same first element. I mean this quite seriously: have you considered reading any first course in set theory?
Can you cite where did you get this?
Re: Formalizing Fermat's Last Theorem
#459Earlier quoted context omitted.
> interpreted its hard to me to tell what this means formally(as I said I am not expert). There is no "interpret" operator in zfc. I believe what it says if you add some robinson axioms + some logical rules on top of zfc, you can carry your results.
It's the same way you don't need to have GCD in stdlib to say that you can compute GCD in C++. You can make your own using parts given. You don't need to add any axioms, you just build some sets to represent numbers and make operations that act the same way as arithmetic, define some equality relations. Then you derive rules of arithmetic for your handcrafted arithmetic using ZF axioms and you're good. You get axioms…
which is already "just" some non trivial problem(there is no "operations" in set theory), and we are discussing if it is achievable.
Re: Formalizing Fermat's Last Theorem
#460Earlier quoted context omitted.
Amazon didn't make a profit because they were reinvesting money into starting new lines of business. Basically there was a choice between taking the money, and growing. They chose growth.
As opposed to...?