https://adam.math.hhu.de/#/g/leanprover-community/nng4/
It's quite instructive.
If you're interested in learning more about Lean for writing proofs, I would recommend The Mechanics of Proof [0]. It strips out a lot of the convenience tactics in Mathlib to focus on the more primitive mechanisms Mathlib builds on.
The natural number's game is actually quite fun, and I did understand much better the language. And it's also interactive, so you can try your solutions, and there are hints when stuck.
For using Lean as a theorem prover, this book is pretty good: https://github.com/lean-forward/logical_verification_2024
Also, Lean is also remarkably usable as a programming language itself, which might give an easier onboarding ramp: https://lean-lang.org/functional_programming_in_lean/
In Rocq/Coq, I've found myself often lost in the weeds when exploring a problem just through tactics mode (half expecting it to handle the more boring machinery), and really do have to think pretty hard about how I get from A to B.
Some of this is, quite simply, me just walking in the wrong direction (if you have multiple things you can induct on, the choice can greatly affect how easy it is to move forward!). I just wish that the computer would be a bit better at helping me realize I'm in the wrong direction.
Stuff like Quickchick[0] helps, but just generally I would love the computer to more actively give me counterexamples to some extent.
I mention it in the blog post, but one project in that direction is Terence Tao's equational_theories project (https://teorth.github.io/equational_theories/), where it seems like a bunch of hobbyists and mathematicians are working together using Lean to prove new mathematics enabled by Lean.
I think this is all very exciting but I also think ergonomics will probably need to improve quite a bit before Lean will become mainstream in mathematics.
gnulinux•18h ago
[1] It's a personal preference but Agda is simply a much better language with almost limitless metaprogramming which allows me to write proofs close to as they'd appear in prose math papers. It has a smaller ecosystem though. I've never seen a proof in any other language I personally didn't think would be much more readable/simpler in Agda.
IngoBlechschmid•17h ago
https://lets-play-agda.quasicoherent.io/
gopiandcode•11h ago
e.g.:
- embedding a prolog/asp DSL: https://github.com/kiranandcode/cleango
- embedding a tex/latex DSL: https://github.com/kiranandcode/LeanTeX
yuppiemephisto•10h ago
m_j_g•9h ago