Remix.run Logo
▲ hoppp a day ago

Thats a lot of lean. Can anyone comprehend how it works in it's entirety?

▲rcxdude a day ago | parent | next [-]

There's a top level sketch of the proof in the paper from the guy who's claiming the proof. It seems like he feels he understands it, at least.

▲abm53 a day ago | parent | prev | next [-]

In one sense, it doesn’t matter, as long as we comprehend enough to be sure the lean proof encodes the hypothesis and all axioms correctly.

But in another sense, such as whether it adds to our understanding, of course it does matter.

▲glial a day ago | parent [-]

> be sure the lean proof encodes the hypothesis and all axioms correctly

This is not my field, but surely this has already been done before today?

▲kadoban a day ago | parent [-]

My understanding is that there is no central, agreed, library of lean formulations of hypothese+axioms for big open problems. So it's not like, when proving one of these you necessarily just take the lean-encoded problem off the shelf and add the "i proved it" parts.

First step seems to be you encode the problem according to your whims. So there's some checking to be done in terms of "does this actually encode the problem?"

For pro mathematicians I wouldn't expect that that's where they run into trouble in things like this, but still needs a look-over.

▲raincole 11 hours ago | parent | next [-]

Claude's proof just uses Mathlib's formalization of Riemann's Hypothesis. It's the closest thing you can find to an "agreed" one. It's not like that Claude tried to formalize it from human language from scratch.

▲twothreeone 21 hours ago | parent | prev [-]

Often (most?) of the time "solving" a hard problem is partly taking it apart into separate pieces and phrasing those pieces in various novel ways that allow one to tackle them individually and then at the end it all magically falls into place (in this case after 900 pages).

▲epolanski 9 hours ago | parent | prev | next [-]

It's quite interesting that we're heading very quickly into accepting we cannot comprehend ourselves the work that AI can prove to be correct.

▲jordemort a day ago | parent | prev [-]

at what point does this become functionally equivalent to coming down from a mountain with a couple of stone tablets and saying "God says"?

▲noosphr a day ago | parent | next [-]

If we can trust payroll to a database instead of insisting someone do all the calculations by hand there is no reason to expect other forms of symbolic manipulation to be vastly different.

▲wpietri a day ago | parent | next [-]

That's actually a great example of something where we don't and shouldn't trust computers. E.g.: https://www.kqed.org/news/12051862/sf-teachers-are-yet-again...

We can and should trust computers for the straightforward, boring parts. But there's a huge gulf between the people who think, "how hard could payroll be?" and actually making a system that handles all the interacting complexity of real-world problems.

▲wvenable 20 hours ago | parent | next [-]

All the problems with that payroll system are caused by humans, not computers.

The odds that computer is making a mistake in a calculation is near zero (although not impossible). Instead it's doing exactly what it is told to do.

▲wpietri 19 hours ago | parent | next [-]

All the problems with computers are caused by humans, not computers.

▲aorloff 20 hours ago | parent | prev [-]

I guess you never heard of the pentium bug ?

Edit : and more generally - math has infinite resolution, whereas computers have a finite resolution, and cannot be more precise than that

▲fluidcruft 2 hours ago | parent | next [-]

Humans doing payroll by hand are not using infinite resolution.

And to the extent they are there are always big math, rational and decimal math systems.

▲zamadatix 18 hours ago | parent | prev | next [-]

Computers have no more or less a finite resolution problem than humans - it just seems to be far larger than what is practically needed in both cases. I.e. problems can be encoded symbically or numerically and the maximum size of each (including the numerical precision of the latter) is bound by physical constraints. But just because computers use fixed sized numerical types does not mean they are unable to handle working with exact symbolic values or objects we use in math.

Regarding the Pentium bug, I think one has to agree when it stopped being up to the human introduction of the bug. I.e. sure, many think we have designed faulty CPUs before. Some feel computers have designed faulty computers, others feel it still comes back to the human definitions. At some point though, most seem to call human mistakes human mistakes rather than where they are derived from prior to humans. I just don’t think we’ve all reached agreement of when that boundary definition is is for mistakes from the computer.

▲hardbass 6 hours ago | parent | prev | next [-]

>computers have a finite resolution, and cannot be more precise than that

Yes and neither can us. We have never written infinite digits down of anything. We work in finite sets of fields.

The field of Q(pi) perfectly represents various expressions of pi for example.

▲aorloff 4 hours ago | parent [-]

You can just write Pi, which is precise, in math.

▲hardbass 3 hours ago | parent [-]

Yes pi, 4 atan(1), the ramanujan formula, a spigot program are all valid representatives for the same entity.

▲noosphr 16 hours ago | parent | prev | next [-]

The numbers you can talk about in mathematics are just as countable as the numbers you can talk about in computer science: https://en.wikipedia.org/wiki/Definable_real_number

This should be pretty clear unless you've never used arbitrary precision arithmetic.

▲aorloff an hour ago | parent [-]

Computer science is part of math. We are talking about math versus computing

▲wvenable 18 hours ago | parent | prev [-]

> I guess you never heard of the pentium bug ?

I was going to put that exact example in brackets after "although not impossible" but decided it was unnecessary.

▲fluidcruft 2 hours ago | parent | prev [-]

That a payroll system isn't implemented in Lean though

▲someothherguyy a day ago | parent | prev | next [-]

calculations and operations are transparent to a database, and they very easy for a human to understand and verify

▲noosphr a day ago | parent [-]

So is natural deduction when you treat quoted expressions as first class citizens.

The difficulty of doing proofs in mathematics is largely due to the fact that mathematicians refused to treat symbolic expressions as data and had to invent ever more complex paradigms to deal with them.

Lean being the final iteration of that trend.

When you add quotation and quasi quotation on top of Polish notation proofs become as mechanical as long division.

▲cowlevel 12 hours ago | parent | next [-]

idk what you're talking about. mathematicians treat symbolic expressions as data all the time. They apply a procedure to one expression to get another expression.

▲mypalmike a day ago | parent | prev | next [-]

Can you explain this further? Can you point the interested reader at books or papers that would help understand the approach you are advocating?

▲noosphr a day ago | parent [-]

If I ever get the time writing a book called the structure and interpretation of mathematical logic is on my to do list.

There are unfortunately no books on the topic currently, because very few people take syntax seriously enough. This is rather ironic as computer science is only possible because someone took syntax seriously enough to invent place value notation.

▲ a day ago | parent | prev | next [-]
[deleted]
▲catlifeonmars a day ago | parent | prev | next [-]

A LISP for symbol manipulation? I definitely don’t hate it.

▲someothherguyy a day ago | parent | prev | next [-]

i don't think mathematicians have avoided proof assistants, being that they have been around for over 50 years (https://en.wikipedia.org/wiki/Automath). however, as to my point, i would wager most payroll systems don't express a single verification as 400kloc of SQL statements.

https://principia-math.com/projects/d16ab288ed353bc5b10e292a...

▲noosphr a day ago | parent [-]

There are some mathematics who don't mind formal methods, but they are few and far between. A lot of them are closer to computer scientists than traditional mathematicians.

▲sand65469 3 hours ago | parent | prev [-]

or you know, you just use horn clauses so you dont have to staple ad hoc crap like quotation and quasiquotation on top of the language.

▲saghm 10 hours ago | parent | prev | next [-]

If I don't get my paycheck, I immediately notice and can complain, and a human will be able to rectify whatever issue caused it. If I literally never got a paycheck again, we have decidedly non-mathematical ways of dealing with it (a legal system).

I don't see the comparison here. Detecting issues in a 17 million line proof is not remotely trivial, if we accidentally build a bunch of math on a failed proof, we don't have a retroactive way of getting all of that time and effort back.

I'm not saying that automated proofs like this aren't worthwhile, but the parent comment did say "functionally equivalent". The level of trust that's needed in the people who used the system to produce the output is a pretty clear functional difference in my mind between payroll and huge generated proofs. I don't think I need as much trust in someone who produces an automated proof as someone who claims that god told them something directly (since that's a lot harder to believe in general), but I also don't have a particularly large amount of trust in the average employee of Anthropic making a bold claim either.

There have always been a large number of people in the world (and still are!) that believe any number of things on the basis on faith rather than evidence, and it's not crazy to draw a parallel between "that religious authority says so" and "that Anthropic employee says so"; for the overwhelming majority of people in the world, the claims are essentially both impossible to falsify, so at the end of the day we are still relying on trust (whether from that authority directly or from a consensus of other people we trust).

▲Lambdanaut a day ago | parent | prev | next [-]

Except databases are understood deterministically. The route an LLM will take, given an input, is not.

▲overboard2 a day ago | parent | next [-]

That's why LLMs are often made to generate proofs in Lean.

▲noosphr a day ago | parent | prev [-]

The post was about lean, not how the lean code was generated.

▲billyp-rva a day ago | parent | prev [-]

Everyone gets a line-by-line paystub every period that fits on, what, half a page? That's a far cry from 17 million lines of code.

▲noosphr a day ago | parent | next [-]

Depending on the company 17 million lines of expenses per month are either normal or a fraction of the total.

▲awb 16 hours ago | parent | prev [-]

Generating a paystub isn’t a Millennium Prize Problem.

Everyone has limits to their domain knowledge that makes understanding expert material challenging. I’m guessing that at the pinnacle of any field, there might only be a handful of people who fully understand the solutions to the most complex problems.

▲Lerc a day ago | parent | prev | next [-]

It does not. If after careful analysis people conclude that they cannot tell if it says what it claims to say, then then it can be considered not-a-proof until someone can demonstrate in a convincing manner that it is what it claims to be.

I can say god exists because 5>3. No matter how valid my claim is that five is in-fact greater than three, if I can't convince people of the connection it's a valid proof of something, just not what I say it is.

It might be true that if the Riemann hypothesis is false, leaves cannot fall to the ground. That would mean a falling leaf demonstrates the truth of the hypothesis. Without showing people why it must be the case in a way they understand it falls short of a genuine proof.

That would make proofs subjective, and I think that is true. To many people Pythagoras has not been proved, they just believe (correctly) there is a consensus amongst those who do understand the proofs.

▲interestingsir a day ago | parent | prev | next [-]

For the rest of us it already is like that..

▲MarcScott 16 hours ago | parent | prev | next [-]

For a lot of people there is no difference. I'm fairly well versed in physics for instance, but I quickly lose my ability to deeply understand what's going on when quantum mechanics is introduced. I can just about grasp the analogies, but that's the limit of my understanding. So the stone tablets have become YouTube videos and God has become the likes of Feynman.

▲bawolff 18 hours ago | parent | prev | next [-]

The point when we stop being able to dicipher it.

We are nowhere near that. Yes its getting harder, but i'm certain that within a year people will have this disciphered and translated into traditional math prose.

Keep in mind deciphering and validating traditional proofs is also quite hard. e.g. It took a long time to figure out if the proof for fermat's last theorem was valid

▲atmosx 11 hours ago | parent | prev | next [-]

I have heard that analogy in Greek and Italian already by a philosopher and a geopolitician, so it’s not far…

▲twoodfin a day ago | parent | prev | next [-]

It matters a great deal in several fundamental ways that Moses didn’t also have a valid Lean formalization.

▲epolanski 9 hours ago | parent | prev | next [-]

Well, technically it is more "God says and proves...".

▲Jyaif a day ago | parent | prev | next [-]

It doesn't really work because we are god, and the AIs are our creations.

▲CamperBob2 19 hours ago | parent | prev | next [-]

There was a great Twilight Zone original-series episode that was basically just that: https://en.wikipedia.org/wiki/The_Old_Man_in_the_Cave

Spoiler: it didn't end well for the clanker or the humans.

▲idiotsecant a day ago | parent | prev [-]

You not knowing how to interpret the results is not the same as nobody knowing how to interpret the results. Formal proofs with very dense lean implementations have been a thing for a long time, it wasn't 'god on the mountain' then, either.

▲jordemort 19 hours ago | parent [-]

I don’t think it is possible for any human to actually understand 17.9 million lines of code.

I don’t think that things humans can’t understand meaningfully advance human knowledge. Scientific progress is built on a foundation made of previous discoveries. What is there to build on here? An incomprehensible soup and a note from the computer that says “trust me”?

▲idiotsecant 7 hours ago | parent [-]

Lean is exactly the kind of thing a team of people can go through and miticulously understand 17 million lines of code.