News for hackers. Stuff that matters.
Re:New Foundations is consistent – a difficult mathematical ... by cwzwarich on Tuesday April 23, 2024 @10:26AM (#40132370)
If I’m not mistaken, this is the first use of a proof assistant to settle the status of a difficult proof that had been sitting in limbo for years. There were some previous projects (e.g. the Four Color Theorem in Coq) that validated existing proofs with a large computational element handled by untrusted software, but I think this is the first one where the epistemological status of the result was uncertain in the larger mathematical community.
Re:New Foundations is consistent – a difficult mathematical ... by hiker on Tuesday April 23, 2024 @10:58AM (#40132714)
Re:New Foundations is consistent – a difficult mathematical ... by Davidzheng on Tuesday April 23, 2024 @03:44PM (#40136340)
Disagree. That one was not in question for years. Only Peter Scholze proved it and said he's not completely sure
Re:New Foundations is consistent – a difficult mathematical ... by isaacfrond on Tuesday April 23, 2024 @10:41AM (#40132529)
Next up the abc-conjecture!

Claimed to be proven in 2012, and to 400+ page paper is online. But I don't many accept the proof.

Re:New Foundations is consistent – a difficult mathematical ... by nicklecompte on Tuesday April 23, 2024 @11:13AM (#40132875)
There is a major difference though: Holmes's proof was broadly comprehensible, just extremely complicated and easy to get lost in the details. In particular Holmes really tries to make the reader understand, with a fairly gentle/apologetic introduction.

But Mochizuki's "proof" is completely impenetrable even to experts on, like, page 3, and makes no effort to explain what is happening.

Another key difference is that New Foundations is a niche field, so there simply was not a huge amount of human effort spent reading Holmes's work. That's not the case with Mochizuki's proof. There's a big difference between "a small number of mathematicians didn't understand the proof but suspect it's correct" and "a large number of mathematicians didn't understand the proof and concluded it was incorrect."

And, most of all: Holmes's formulation of twisted type theory made the proof a natural candidate for dependently-typed formal verification. Mochizuki's proof is not type-theoretic and does not seem like a great candidate for the calculus of constructions - maybe it is! I actually have no idea. I suspect Mochizuki is the only person in the world who can answer that. But it's critical that Holmes did so much background work to simplify his proof and make this Lean program possible. Mochizuki should do the same.

AFAICT, both in terms of the "sociology of mathematics" and the amount of work required to even attempt a Lean formalization, trying to verify Mochizuki's proof is a waste of time.

Re:New Foundations is consistent – a difficult mathematical ... by ducttapecrown on Tuesday April 23, 2024 @02:17PM (#40135233)
Kirti Joshi from the IAS has made very serious attempts to patch up Mochizuki's work by developing new math and by making the exposition good. If you're an expert in arithmetic geometry presumably he's readable, if you're just interested, I found it fun to skim.
Re:New Foundations is consistent – a difficult mathematical ... by Davidzheng on Tuesday April 23, 2024 @05:47PM (#40137723)
No comments on the correctness of his work (plenty of discussions online e.g on MO) but why do you say he's from IAS?
Re:New Foundations is consistent – a difficult mathematical ... by ducttapecrown on Wednesday April 24, 2024 @04:31PM (#40149208)
I write about his work on this website to bring notice to his work, because I don't believe Scholze and I'm not going to read Mochizuki (If I did, it would be his original actual contribution to algebraic geometry (and I don't know why I don't read Scholze but its scary mmkay)). So I mentioned that Joshi was from the IAS for the same reason, to convince my readers to read his work.

Further edit: I guess he's at Arizona right now, but he was at IAS at some point....

Re:New Foundations is consistent – a difficult mathematical ... by alreadydone on Wednesday April 24, 2024 @12:53PM (#40146835)
Latest update here: https://www.math.columbia.edu/~woit/wordpress/?p=13895 Unfortunately it seems Mochizuki and Scholze reached consensus that a part of Joshi's argument cannot possibly work.
Re:New Foundations is consistent – a difficult mathematical ... by Ericson2314 on Wednesday April 24, 2024 @11:49AM (#40145840)
> And, most of all: Holmes's formulation of twisted type theory made the proof a natural candidate for dependently-typed formal verification.

I am not so sure about this, actually. "twisted type theory" looks like type theory more in the original Bertrand Russel sense than in the modern (Martin Loef, Jean-Yves Girard, etc.) sense.

Re:New Foundations is consistent – a difficult mathematical ... by alreadydone on Wednesday April 24, 2024 @12:50PM (#40146782)
I think TTT stands for "tangled type theory".
Re:New Foundations is consistent – a difficult mathematical ... by randallholmes on Wednesday April 24, 2024 @01:10PM (#40147054)
It does, but I rather like "twisted type theory" :-)
Re:New Foundations is consistent – a difficult mathematical ... by nicklecompte on Wednesday April 24, 2024 @01:22PM (#40147188)
Oops! Good catch. I'm not an expert - I read "tangled type theory" once and "TTT" about 75 times....
Re:New Foundations is consistent – a difficult mathematical ... by barfbagginus on Tuesday April 23, 2024 @12:33PM (#40133865)
I seriously doubt mochi's going to be any help for the lean formalization effort.

But a lean-assistive llm trained on mochi's work? Ahhh! What an intriguing possibility!

Re:New Foundations is consistent – a difficult mathematical ... by Chinjut on Tuesday April 23, 2024 @01:13PM (#40134394)
I do not imagine LLMs will be of any use here.
Re:New Foundations is consistent – a difficult mathematical ... by barfbagginus on Tuesday April 23, 2024 @01:39PM (#40134736)
Re:New Foundations is consistent – a difficult mathematical ... by Davidzheng on Tuesday April 23, 2024 @05:47PM (#40137732)
These llm's are usually only proving some trivial lemmas right now. Hopefully it changes soon but...
Re:New Foundations is consistent – a difficult mathematical ... by barfbagginus on Tuesday April 23, 2024 @07:53PM (#40138777)
Just bolting llms onto proof search improves the state of the art. So if you want to improve the state of the art of proof search, bolt some llms onto proof search, and enjoy!

As far as making LLMs understand mochi math... I'm going to go out on a limb and say it will probably take less time for us to build an AI that understands mochi than it would take to understand mochi ourselves.

Re:New Foundations is consistent – a difficult mathematical ... by dimask on Wednesday April 24, 2024 @05:12AM (#40142188)
I would bet for this use case LLMs to be worse than random walk, as they would probably disregard certain possibilities in crucial steps, unless we are talking about easier stuff.
Re:New Foundations is consistent – a difficult mathematical ... by barfbagginus on Thursday April 25, 2024 @09:46AM (#40157529)
LLMs are just fancy adaptive random walks, and they tend to pick more novel candidates, not less. To wit, proof search has done random walks for ages. But proof search accelerated with LLM oracles is pushing the state of the art for automated proof search.

The progress isn't insane or miraculous. But it's moving the needle in an otherwise somewhat stagnant area. And that means we need to pay attention and update our beliefs and working theories.

Re:New Foundations is consistent – a difficult mathematical ... by nextaccountic on Tuesday April 23, 2024 @12:19PM (#40133707)
There's a proposed proof of abc conjecture that is supposedly more readable. Here is a discussion thread about it:

https://www.reddit.com/r/math/comments/1bhiz0s/construction_...

It would be nice if this one were formalized in Lean (or Coq or HOL) though.

Re:New Foundations is consistent – a difficult mathematical ... by toneman on Tuesday April 23, 2024 @04:48PM (#40137078)
I have studied IUT since 2012, and it is indeed, totally baroque. However, Motizuki Theory, is totally rebased and admits results of much interest. I will write more on this matter if my claim is of mutual interest.

IRT, the topic and digression here, LLM and LEAN4 are of not much use for IUT.

IUT Theory is much easier understood by a hacker than by a math guy, eventually tho, monitors and tv's did kinda become the same thing but there are, some minor differences.

Re:New Foundations is consistent – a difficult mathematical ... by OscarCunningham on Tuesday April 23, 2024 @01:33PM (#40134658)
It's a similar situation to the Kepler Conjecture (https://en.m.wikipedia.org/wiki/Kepler_conjecture). The proof was already known, but people weren't sure it was correct until it was formalised.