(no title)
sibrahim | 1 month ago
Given a formal statement of what you want, Lean can validate that the steps in a (tedious) machine-readable purported proof are valid and imply the result from accepted axioms. This is not AI, but a tiny, well reviewed kernel that only accepts correct formal logic arguments.
So, if you have a formal statement that you've verified to represent what you are interested in by some other means, Lean can tell you whether the proof created by genAI is correct. Basically, there is a nigh infallible checker that won't accept incorrect hallucinations.
mjevans|1 month ago
ndriscoll|1 month ago
> Let C>0 and ϵ>0 be sufficiently small. Are there infinitely many integers a,b,n with a≥ϵn and b≥ϵn such that a!b!∣n!(a+b−n)! and a+b>n+Clogn?
Which seems like it's the type of thing you give as a homework problem to state formally in an intro class.
johncolanduoni|1 month ago
saghm|1 month ago
digikata|1 month ago
Also, on the verification side - there could also be a window of failure that Lean itself has a hidden bug in it too. And with automated systems that seek correctness, it is slightly elevated that some missed crack of a bug becomes exploited in the dev-check-dev loop run by the AI.
unknown|1 month ago
[deleted]
mrtesthah|1 month ago
threatofrain|1 month ago
luckydata|1 month ago
oh_my_goodness|1 month ago
Sure. But it's fair to ask how to validate that assumption.
fsmv|1 month ago
f1shy|1 month ago
A little bit nitpicking, but according to books like AIMA that is indeed AI. In the first chapter even any control system is classified as AI.
Because of the reasons stated in the 1st chapter, I totally agree with the authors.
The whole system is AI. That part is a verifier in a chain of “suggestions/instict -> verifier” like used in neurosymbolic systems for automated driving, for example.
exe34|1 month ago
1. you write a proof in English that there is an infinite number of primes. 2. the llm writes 2+2=4 in lean. 3. lean confirms that this is correct and it's impossible that this proof is wrong.
NetMageSCW|1 month ago
The question is in the person (or AI) creating the formal problem statement - how do you know it represents the problem the proof is supposed to be for? And the answer is for people in the field, in this case, formalizing the problem and verifying the formalization is easy. It is like generating an public key versus factoring it.
heroprotagonist|1 month ago
Someone|1 month ago
davidwritesbugs|1 month ago
bee_rider|1 month ago
If it is easier to convert backwards, maybe the AI can at least describe what the equations mean…
rurban|1 month ago
Aristotle is doing the matching AI part, the modern LLM approach, previously called fuzzy logic.
Both are AI.
teiferer|1 month ago