Live data from Hacker News

A mathematical formalisation challenge by Peter Scholze

xenaproject.wordpress.com

11–20 of 26 posts

Re: A mathematical formalisation challenge by Peter Scholze

#11
post #6

This paragraph is paramount, coming from one of the youngest Fields Medalists and a truly trusted source. Truly honest and inspiring. “ I have occasionally been able to be very persuasive even with wrong arguments. (Fun fact: In the selection exams for the international math olympiad, twice I got full points for a wrong solution. Later, I once had a full proof of the weight-monodromy conjecture that passed the judgme…

[just to be clear here, I am the author of the Xena project blog and my current research is in formalising number theory; before formalisation I was working in Scholze's area.] Scholze's first application of the theory of perfectoid spaces was to prove weight-monodromy in many new cases (but not in all cases) -- this was his first breakthrough result really. Fun fact: in the first version of the post which he sent me…

When you get to the symbols, all becomes symbol manipulation, so why would computer proof verification systems not be up to the task?

Re: A mathematical formalisation challenge by Peter Scholze

#12

Earlier quoted context omitted.

[just to be clear here, I am the author of the Xena project blog and my current research is in formalising number theory; before formalisation I was working in Scholze's area.] Scholze's first application of the theory of perfectoid spaces was to prove weight-monodromy in many new cases (but not in all cases) -- this was his first breakthrough result really. Fun fact: in the first version of the post which he sent me…

When you get to the symbols, all becomes symbol manipulation, so why would computer proof verification systems not be up to the task?

Well, climbing Mt. Everest is also "just moving your arms and legs". But I'm not up to that task!

It's certainly possible in principle, but whether it's possible in practice is part of the challenge. You need enough people that understand the details of the proof, and know how to turn that into a formally verified proof. Such proofs can also become slow, so to keep things practical, you also need to take speed into account.

Re: A mathematical formalisation challenge by Peter Scholze

#13
post #6

This paragraph is paramount, coming from one of the youngest Fields Medalists and a truly trusted source. Truly honest and inspiring. “ I have occasionally been able to be very persuasive even with wrong arguments. (Fun fact: In the selection exams for the international math olympiad, twice I got full points for a wrong solution. Later, I once had a full proof of the weight-monodromy conjecture that passed the judgme…

[just to be clear here, I am the author of the Xena project blog and my current research is in formalising number theory; before formalisation I was working in Scholze's area.] Scholze's first application of the theory of perfectoid spaces was to prove weight-monodromy in many new cases (but not in all cases) -- this was his first breakthrough result really. Fun fact: in the first version of the post which he sent me…

Oh, many thanks for this explanation. Even more interesting.

Yes, Voedovsky’s abd Scholze’s candidness is encouraging and liberating. And a great call to responsibility for us reviewers.

And thanks for your work on formalization. Truly important in my view.

Re: A mathematical formalisation challenge by Peter Scholze

#14
Not sure if this question even makes sense, or if it sounds hopelessly naive to someone in the know, my maths education ended in undergrad -

can this type of push towards formalizing mathematical proofs be seen as a sort of continuation of Hilbert's program? If no, what's the difference? If yes, how are the fatal issues in that program avoided?

Re: A mathematical formalisation challenge by Peter Scholze

#15
post #14

Not sure if this question even makes sense, or if it sounds hopelessly naive to someone in the know, my maths education ended in undergrad - can this type of push towards formalizing mathematical proofs be seen as a sort of continuation of Hilbert's program? If no, what's the difference? If yes, how are the fatal issues in that program avoided?

It is essentially “the most one can do with Hilbert’s Programme”.

Actually Hilbert’s Programme was shattered when his great hope (the proof of the consistency and completeness of Mathematics FINITISTICALLY) was proved impossible (actually inconsistent).

But from the point of view of mechanizing Maths, it is more or less equivalent.

Re: A mathematical formalisation challenge by Peter Scholze

#16

Earlier quoted context omitted.

[just to be clear here, I am the author of the Xena project blog and my current research is in formalising number theory; before formalisation I was working in Scholze's area.] Scholze's first application of the theory of perfectoid spaces was to prove weight-monodromy in many new cases (but not in all cases) -- this was his first breakthrough result really. Fun fact: in the first version of the post which he sent me…

When you get to the symbols, all becomes symbol manipulation, so why would computer proof verification systems not be up to the task?

Remember Pentium’s division bug (on mobile so cannot cooy-paste). We need some king of certificate of proof, not just some black-box which answers “OK”, “NOT-OK”.

Re: A mathematical formalisation challenge by Peter Scholze

#17
post #14

Not sure if this question even makes sense, or if it sounds hopelessly naive to someone in the know, my maths education ended in undergrad - can this type of push towards formalizing mathematical proofs be seen as a sort of continuation of Hilbert's program? If no, what's the difference? If yes, how are the fatal issues in that program avoided?

It is essentially “the most one can do with Hilbert’s Programme”. Actually Hilbert’s Programme was shattered when his great hope (the proof of the consistency and completeness of Mathematics FINITISTICALLY) was proved impossible (actually inconsistent). But from the point of view of mechanizing Maths, it is more or less equivalent.

Yeah Hilbert’s Program wasn't actually set back by the incompleteness theorems in the first place, it was all FUD.

Re: A mathematical formalisation challenge by Peter Scholze

#18

Earlier quoted context omitted.

It is essentially “the most one can do with Hilbert’s Programme”. Actually Hilbert’s Programme was shattered when his great hope (the proof of the consistency and completeness of Mathematics FINITISTICALLY) was proved impossible (actually inconsistent). But from the point of view of mechanizing Maths, it is more or less equivalent.

Yeah Hilbert’s Program wasn't actually set back by the incompleteness theorems in the first place, it was all FUD.

Not sure what you mean by that: after Gödel, Hilbert essentially became hopeless.

Re: A mathematical formalisation challenge by Peter Scholze

#19

Earlier quoted context omitted.

[just to be clear here, I am the author of the Xena project blog and my current research is in formalising number theory; before formalisation I was working in Scholze's area.] Scholze's first application of the theory of perfectoid spaces was to prove weight-monodromy in many new cases (but not in all cases) -- this was his first breakthrough result really. Fun fact: in the first version of the post which he sent me…

Oh, many thanks for this explanation. Even more interesting. Yes, Voedovsky’s abd Scholze’s candidness is encouraging and liberating. And a great call to responsibility for us reviewers. And thanks for your work on formalization. Truly important in my view.

I feel like with 2 fields medalists on boards, the culture can finally shift. I'm really excited.

[It's not just about math, see https://hapgood.us/2015/10/17/the-garden-and-the-stream-a-te... for a great explanation of the type of labor that is mathlib is sorely lacking in just about every sector. I'm really hoping that mathematics can lead the way here.]

Re: A mathematical formalisation challenge by Peter Scholze

#20

Earlier quoted context omitted.

When you get to the symbols, all becomes symbol manipulation, so why would computer proof verification systems not be up to the task?

Remember Pentium’s division bug (on mobile so cannot cooy-paste). We need some king of certificate of proof, not just some black-box which answers “OK”, “NOT-OK”.

The theorem proves that are discussed here already do that.
Post reply on HN