4 ms·
ProofWiki: Online compendium of mathematical proofs
- gdsimoes 3y agoWhat I like most about ProofWiki is its sometimes nonstandard notations. For example, the interval notation: https://proofwiki.org/wiki/Definition:Real_Interval/Notation https://proofwiki.org/wiki/Definition:Real_Interval/Notation
- dang 3y agoRelated: ProofWiki is an online compendium of mathematical proofs - https://news.ycombinator.com/item?id=31293073 https://news.ycombinator.com/item?id=31293073 - May 2022 (16 comments)
- alexmolas 3y agoThe featured proof about the sum of Fibonacci numbers divided by 2^n is beautiful. When I started reading the proof I thought it was a mistake, a mismatch between the theorem to proof and the linked proof. I didn't expect using Kolmogorov axioms to prove this kind of sums. I really enjoyed reading it. I just learned something new today, thanks!
- krackers 3y agoI found a more detailed explanation of that proof at https://www.youtube.com/watch?v=4ApWBYBsc9k https://www.youtube.com/watch?v=4ApWBYBsc9k It also wasn't immediately clear to me that this _is_ a valid sample space, the explanation in https://old.reddit.com/r/math/comments/18szn6y/anyone_use_proof_wiki/kfciwa8/ https://old.reddit.com/r/math/comments/18szn6y/anyone_use_pr... provides a more formal but still readable construction I especially like the "finite" variant/version of the proof which reframes this as a counting/combinatorial proof instead of a probability-based one.
- md224 3y ago> However, we also see that for only those combinations starting with a T (that is f(n - 1))... Why is that f(n - 1)?
- ihm 3y agoThe set of sequences of length n ending in HH (and with no earlier HH) and beginning with a T are in bijection with the set of sequences of length n-1 ending in HH (and with no earlier HH) by the bijection def f(s): assert(s[0] == 'T') return s[1:] whose inverse is def f_inverse(s): return 'T' + s
- hayd 3y agoAlso the bijection between sequence of length n ending in HH (and no earlier HH) and beginning with an H are a bijection with the set of sequences of length n-2 ending in HH (with no earlier HH) by the bijection: def f(s): assert(s[0] == 'H') assert(s[1] == 'T') # can't be another H! def f_inverse(s): return 'HT' + s Therefore, since sequences either begin with a T or an H, for n>=2 we see f(n) = f(n-1) + f(n-2).
- ivancho 3y agoTheir "proof" that there are only 12 solutions to 8 Mutually Non-Attacking Queens on Chessboard is just "That there are only these 12 can be proved by brute force." :/
- jusuhi 3y agoThe task proving some statement and the task of finding the shortest, or a "reasonably short" proof, are very different endeavours. The first is about certainty that a statement is valid ("true"). The other is about simplifying the understanding of _why_ it is valid. Most of the time, you don't care much about the latter.
- zamadatix 3y agoIt would be nice to have an reproducible example of how the result was achieved though. Otherwise it's a compendium of results, not proofs.
- ivancho 3y agoWhat is your certainty that that statement is true? What if it was a calculation which takes decades on a supercomputer?
- jusuhi 3y agoAt current rates, whatever is done on a supercomputer today is done by a cheap pocket-size device just decades later. So, I'm not too worried about this case. One of the first famous examples of this is the four-coloring theorem. I don't know any serious mathematician who is not certain of that result.
- geor9e 3y agoYou have proof in sarcasm quotes, but it counts https://en.wikipedia.org/wiki/Proof_by_exhaustion https://en.wikipedia.org/wiki/Proof_by_exhaustion In my university math departments putnam problem competition (they'd just be on the wall, prize was a $40 giant pizza each week) they would accept the most elegant solution, so if nobody else submitted something better I'd get a pizza for just running a few lines of python.
- westurner 3y agoFrom "Ask HN: Did studying proof based math topics make you a better programmer?" https://news.ycombinator.com/item?id=36463580 https://news.ycombinator.com/item?id=36463580 : > Lean mathlib was originally a type checker proof assistant, but now leanprover-community is implementing like all math as proofs in Lean in the mathlib project Lean Mathlib is composed of executable proofs written in Lean: https://leanprover-community.github.io/mathlib-overview.html https://leanprover-community.github.io/mathlib-overview.html
- eduhetxub 3y agoBe careful. While a proof in Lean is executable (it is a script, so to speak) it is conceptually a sequence of references to tactics. Writing a Lean proof does involve a highly specialised form of functional programming, but I wouldn't be at all sure that becoming an expert in Lean would improve your programming skills across the board. Your comment also reminds me of the people who claim that the Curry-Howard isomorphism means "programming is math". It's not a claim that anyone should really be making in good faith. There's a lot more to programming than the lambda calculus.
- westurner 3y agoVerbal skills are apparently more predictive of programming career success than math scores. Is Quantum Logic the correct propositional logic? Is Quantum Logic a sufficient logic for all things? I'd much rather work with machine-checkable proofs; though Lean is not what I've been taught math in either. Coq-HoTT is written in Coq, not Lean. A tool that finds the correspondence between proofs as presented and checkable proofs in a reasonable syntax would be helpful, I think. If I start with "Why is 2+2=4?" [in this finite ring], I'm not sure how to find the relevant Lean code in Mathlib to prove my bias inductively, deductively, or abductively
- 3abiton 3y ago> Verbal skills are apparently more predictive of programming career success than math scores. Curious about the references!
- photonthug 3y agoThe ads significantly impact credibility for a site like this IMHO.
- LeonB 3y agoAgree - and not simply the presence of ads, but the scammy, fraudulent type. I just saw the tiniest “X” to close an ad I’ve ever seen. And clicking it just opened the advertisers site anyway. That’s not a sustainable strategy, that’s just fraud.
- nextaccountic 3y agoFortunately I don't see any ad Indeed I was always very mystified when people complain about Youtube ads until Youtube started to mess with ad blockers. This made me consider stopping using Youtube altogether but fortunately uBlock Origin catched up.
- dwheeler 3y agoThe compendia of Metamath proofs us here https://us.metamath.org/ https://us.metamath.org/ All of theree are formally from axioms or other formal proofs that lead back to their axioms, without any gaps.
- westurner 3y ago"Stem Formulas" (2023) https://news.ycombinator.com/item?id=36817851#36839925 https://news.ycombinator.com/item?id=36817851#36839925
- ClassyJacket 3y agoIn https://proofwiki.org/wiki/Definition:Graham%27s_Number https://proofwiki.org/wiki/Definition:Graham%27s_Number it states "Amusingly, given that Graham's number is an upper bound, the actual solution to the problem in question, according to certain experts, may well be 6. " I cannot edit the page but I believe they're up to at least 13 now.
- artsi0m 3y agoI remember findind this site when solving exercise of creating sign function for Z with arithmetic operators only. I used this[1] page to cheat and reimplement mod in C (by default % is rem) with defined zero. Unfortunately it doesn't helped me yet, but I still like this site. [1]: https://proofwiki.org/wiki/Definition:Modulo_Operation/Modulo_Zero https://proofwiki.org/wiki/Definition:Modulo_Operation/Modul...