News for hackers. Stuff that matters.
Re:Mathematicians welcome computer-assisted proof in ‘grand ... by kevinbuzzard on Saturday June 19, 2021 @01:27PM (#27562421)
I agree, but I think my statement is accurate today in 2021. I would love to see funds directed towards this sort of question. The big problem is that at high level so so much is skipped over, and you still sometimes have to struggle to put undergraduate-level mathematics into Lean -- this is why UG maths is such a good test case.
Re:Mathematicians welcome computer-assisted proof in ‘grand ... by mherrmann on Saturday June 19, 2021 @01:42PM (#27562551)
Very nice to see you here Kevin. We never interacted but I do still remember a lecture you gave at Imperial in '06 where you filled in for Prof. Liebeck and started with Lemma 1: "I am not Professor Liebeck" ;-) Thank you for the nice memory and your important work on / with Lean.
Re:Mathematicians welcome computer-assisted proof in ‘grand ... by ninguem2 on Monday June 21, 2021 @03:33PM (#27583270)
Did he prove the lemma or did he leave it as an exercise :-) ?
Re:Mathematicians welcome computer-assisted proof in ‘grand ... by zozbot234 on Saturday June 19, 2021 @03:12PM (#27563458)
> The big problem is that at high level so so much is skipped over

This is an issue, but there's an established practice of writing formal sketches where the gaps in the proof are explicitly marked, and future tooling might bring ways to address these gaps once a full formal context is provided.

One issue is that Lean has little or no support for declarative proof, which is by far the most natural setting for these "proof sketches", and also brings other advantages wrt. complex proofs. (Coq has the same issue; some code was written to support declarative proofs, but it was too buggy and bitrotted, so it got removed.)

Re:Mathematicians welcome computer-assisted proof in ‘grand ... by foooobar on Saturday June 19, 2021 @03:42PM (#27563749)
As far as I can tell, this is not quite true. Tactic proofs aside, you can also write functional term mode proofs and declarative "structured" proofs in the sense of Isar. Theorem Proving in Lean introduces that style, so most people who use Lean are familiar with it: E.g. https://leanprover.github.io/theorem_proving_in_lean/proposi...

Additionally, even in tactic proofs you can use tactics like `have`, `suffices`, etc. to manipulate the structure of the proof and make subgoals explicit like you would usually do in the structured style. In practice, people in Lean still prefer imperative tactic proofs with the option to write in a structured/declarative style where reasonable. The full "structured" mode does not see much use, since it is quite verbose. As a result, Lean 4 will not support this style out of the box anymore, but you could still add it yourself using the macro system.