Why doesn't mathematics collapse, though humans often make mistakes in proofs?
mathoverflow.net
mathoverflow.net
- Jean-Yves Girard, The Blind Spot
One recent example is Corollary 3.12 in Mochizuki's series of papers on Inter-universal Teichmüller Theory. This single corollary is the main topic of "Why abc is is still a conjecture" by Peter Scholze and Jakob Stix:
http://www.kurims.kyoto-u.ac.jp/~motizuki/SS2018-08.pdf
Quoting from the paper:
"We are going to explain where, in our opinion, the suggested proof has a problem, a problem so severe that in our opinion small modifications will not rescue the proof strategy."
An argument can be made that hence, this is no proof at all, and indeed that is the conclusion of the paper. However, mistakes in other suggested proofs were also found in the past, and they could sometimes be salvaged with significant new insights and additional work. An example for this is Andrew Wiles's proof of Fermat's Last Theorem. Quoting from https://en.wikipedia.org/wiki/Wiles%27s_proof_of_Fermat%27s_...:
Wiles states that on the morning of 19 September 1994, he was on the verge of giving up and was almost resigned to accepting that he had failed, and to publishing his work so that others could build on it and find the error. He states that he was having a final look to try and understand the fundamental reasons why his approach could not be made to work, when he had a sudden insight that ...
Quoting from https://en.wikipedia.org/wiki/Kepler_conjecture:
"The proof was praised by Encyclopædia Britannica and Science and Hsiang was also honored at joint meetings of AMS-MAA."
Which is followed, after a few sentences, by:
"The current consensus is that Hsiang's proof is incomplete."
[1] https://en.wikipedia.org/wiki/Italian_school_of_algebraic_ge...
What collapsed were the proofs, and some if not all of the ideas survived and got painted over with the new language. Sadly algebraic geometry has this bad reputation of being obtuse and opaque, that it has become devoid of geometry. Mathematics need to be more open about ideas that are not rigorous, not just left unspoken between the experts themselves.
No. Such errors may be discovered soon and taken down, or stand for decades, sometimes with lots of stuff built on top of it, and sometime parts will collapse, but the overall structure of the castle is sound, and, sooner or later, errors will be corrected.
And of course, sometimes, somebody decides to start building an entire new wing to the castle using new rules, as, for example, happened when non-Euclidean geometry was discovered/invented.
As such, mathematics doesn't have a solid foundation, and most contemporary mathematicians seem to be ok with that, as long as it works and they can get interesting results.
If this is indeed the case (as it seems to my unprofessional first glance to be) then mathematics does not in fact have a solid foundation, despite its appeal to ZFC.
I'd love to hear a professional logician weigh in on this, if there are any on here.
[1] - https://www.researchgate.net/profile/Costas_Drossos/post/Is_...
Godel's results also show that we cannot use ZFC to prove that ZFC is consistent. However, it is strongly suspected that ZFC is consistent.
In practice, very few of the results independent of ZFC affect day to day mathematical work unless you're a logician or set theorist (which honestly start to blend into each other).
This is why logicians will sometimes talk your ear off about how category theory is so much better as a foundational theory than set theory.
Again though, for the working mathematician, these flaws in ZFC as a foundation rarely matter.
The usual response is that it would be nice if the formal foundations of mathematics corresponded more closely to the informal intuitions of mathematicians, which is arguably not true of set theoretic foundations and perhaps is more true of category theory. Whether or not you agree about the correspondence or whether even if you agree you find it at all convincing is up to you.
The logical foundations of mathematics have always had a much smaller impact on the day to day lives of mathematicians than their foundational nature might suggest.
Nonetheless, it's perhaps surprising for a beginning student of pure mathematics when all they can see is the sky-high demand for rigor that "professional" pure mathematics is seemingly content to hand-wave its foundations. (For the most part this hand-waving is the postrigorous stage described by Terence Tao https://terrytao.wordpress.com/career-advice/theres-more-to-... rather than the pre-rigorous hand-waving of the student).
I'm not an engineer, but I imagine that even most professional electrical/electronic engineers do not understand transistor physics in full details. In engineering, a transistor is essentially treated as a blackbox, and its behavior is described and approximated by various small-signal and large-signal models (i.e. treated as a lumped component), with their parameters characterized empirically by vendors through experiments. How exactly things work at atomic or quantum level is essentially for a transistor to work, yet, a subject of study unrelated to electrical engineering.
On the other hand, I imagine there is no shortage of EEs who have studied a physics major, or EEs with a background of semiconductor physics - they can understand transistor physics really well.
So we can say the relation between EE and transistor physics sounds a lot similar to mathematicians and logicians, it's a good analogy.
As somebody once said, if we ever found a contradiction in the ZFC axioms, we wouldn't throw out math, we'd just throw out ZFC.
Web apps don't depend on transistor physics at all, though. An important consequence of Turing universality is that computer science is not a subfield of electrical engineering.
Also, mathematics underwent very dramatic transformations during the late 1800s and early 1900s alongside the early development of formal logic and set theory. To say that logicians were merely "formalizing the intuitions behind the math that people were already doing" strikes me as misguided at best. The mathematics that rose to prominence in that era was very different from what preceded it, often controversially so.
It's like saying: if we ever found a contradiction in the base case of a mathematical induction, we wouldn't throw out mathematical induction, we'd just throw out the base case. The indudction step remains sound.
The proof then remains a valid proof of something although not exactly a proof of everything its authors claim it to be a proof of.
An erroneous proof is also usually useful because it is not clearly wrong in most cases since nobody has come up with counter-examples so far that would prove the proof incorrect, yet.
I think it's more that the mathematician has a top-down way of reasoning, where they can see things like "I want to get from New York City to Los Angeles, so I have to board the bus, take a flight, and then take the bus from the airport at LA". There are certain parts where you basically know that a proof will be possible, because it seems true, like "I can get to LA's airport with public transit", so usually a specific hiccup, like a bus being delayed, won't prevent you from getting there.
So it may be true that math doesn't work like that, but I don't think it's obvious why. Many people have suggested that software would be better if habitually proved correct, but then, why is it not 100% necessary that proofs be perfect? Why should proofs be more resilient than software?
[1]https://gcn.com/articles/1998/07/13/software-glitches-leave-...
The idea was roughly:
A particular formalized proof (or lemma) is one of many ways of expressing/representing a more general concept that grounds some mathematical idea. It seems to mirror the way you could have the general concept of "having gone to the store and purchased bananas" in your head but express it many different ways through natural language.
If humans were doing mathematics by thinking purely in terms of the theorem space of some particular formal system, then 'collapses' should be expected after minor errors: if you take one wrong turn, your error should be compounded in any further progress.
But that does not appear to be how we do mathematics. Instead we're operating in a more general space of concepts, and we do not do math by proceeding linearly in our thoughts from the beginning of a proof to the final conclusion--we assemble the conception piecemeal until we get some feel for the sufficient overall integrity/coherence of a general conception, and then secure it by building up a kind of formal carapace around it. But if part of the proof/carapace is wrong, it's like a malformed section of armor that needs to be replaced: the whole structure isn't going to collapse because of it (not that that couldn't happen).
Thinking about things that way gave me a better view (I think) on how to use and think about formalizations when doing mathematics.
Mathematics doesn't collapse like a house of cards because the more "important" a proof is to the foundations of math, the more frequently it is tested. A counterexample to a proof is an easy way to find errors up the chain.
In the other direction is that many things that might be considered "errors" in the foundations could be looked at more like choices. Others mentioned Euclidian vs non-Euclidian geometry. There was a sort of error of the idea that Euclidian geometry was the only geometry which was fixed not by tearing it down but creating new geometries.
The two prerequisites are 1) making a fluid and intuitive interface for inputting proofs which can also display human readable proofs for any theorem known and 2) creating a database of all known mathematical proofs into which new results can be inserted.
Both tasks are ~50% complete. Metamath, for example, has all of mathematics formalised up to a basic undergraduate level. It has some reasonable editing software, but not close to good enough for mass adoption. There are also plenty of other systems being developed.
The time will come though relatively soon.
I'll take that bet. 1:1 odds, up to $50? Shall we say, every mathematician employed at an ivy league university math department (postdoc level or above) has published at least one paper which employs proof checking for at least some claim? (provided that they have published at all.) So I win if I can find at least one professor or postdoc employed at an ivy league university math department on August 18, 2029, who has published at least one mathematics paper, and who has not published any mathematics paper which contains any formal proof.
That's a much weaker claim than yours, so it ought to be pretty generous to you.
I imagine there will be hold outs who will never switch to formal proofs, though they may simply take on co-authors who are just "formalizers".
I also am probably being over confident with the time scales, I think a process with a tipping point, everyone will use it once everyone starts using it.
However when that tipping point will occur is probably hard to predict. I think it will be soon, but I'm broke and not that sure.
https://jiggerwit.wordpress.com/2018/04/14/the-architecture-...
They said the exact same thing 10 years ago - see e.g. https://www.vdash.org and the AMS Notices special issue on formal proof from around the same timeframe. Formal proofs are hard, sometimes tedious and not always very intuitive. They're slowly spreading out from the most "synthetic" subfields of math (the ones where you're basically working with unfamiliar "rules", but not with a huge library of proven results), but progress is really slow - definitely slower than many people would expect!
Regarding the topic, I'd say that mathematics, as a whole, is a set of intuitions and ideas, rather than strict proofs. I've spent a fair amount of time working my way through some of Kontsevich's ideas and attended many of his talks -- he rarely (if ever) gives any proofs, my educated guess is that he proposes some extremely profound ideas and his collaborators grind through the details (not always). And it still works just fine.
I remember Kenji Fukaya saying once, talking about a PDE-heavy theorem: "We are trying to keep the details of the proof under 500 pages and it's not sa easy". The main issue here is that people who don't do professional, academic research in mathematics are unaware of the complexity of modern maths. It has evolved immensely during last 50 years, the theories are just layers and layers of foundational work one has to assimilate before getting any work done. Rigorous verification takes years and no one in the academia is being offered a job for proof-reading of existing papers.
One should also remember that referees of the papers are not being paid, it's considered "work for the community" and it's hard to blame them for not reading the papers in detail.
Mathematics are anti-fragile.
My impression was: any result in modern mathematics critically depends on another result, and that result depends on some other result...
This is like how most large software systems depend on various 3rd party libraries.
I guess the answer for both questions is that the things we build, whether they be mathematics or software, work well enough most of the time that you don’t notice the problems unless you’re paying attention.
I mean, what does the student think will happen? We'll all realize that pi=4? Planes will fall out of the sky because physics finally caught up with a mistake in a proof?
The engineer thinks his equations approximate reality. The physicist thinks reality approximates his equations. The mathematician doesn't care.
A lemma is then like sub-routine.
If there is something wrong in the sub-routine it can often be fixed without requiring any changes to the callers of the sub-routine. It might be the case that the subroutine can never produce a value needed by its callers without changing the types of arguments fed to it, and in such a case it is not enough to fix the subroutine.
But in many cases just the lemma-subroutine needs to be corrected, and the rest of the program, rest of the proof can be used as is.
https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspon...
Things being proved in mathematics are unlikely to be wildly wrong even without proof. Fermat's theorem being an example of one that took a very long time to be proved and basically nothing changed when it was. We were already convinced it was true by brute force failure to find a counter example. This lack of proof but search for counter-example is basically the scientific method. Is A equivalent to B? Prove it? Or write a for-loop and test it for values you care about. If you think you've proved it you probably write the for loop anyway (where such a thing is feasible).
So do we actually /need/ proof in math at all or is it just good fun and properly satisfying for mathematicians? Perhaps these are two extremes and case-by-case we could plot them somehwere between the two. Some right up hard against one side or the other.
So is P=NP? There is no proof. You probably aren't going out on a massive limb to have a view on the matter without it.
[b * x_1 + (1 - b) * x_2] always being a member of C,
I presume that you mean that errors, namely those kind of errors that are the subject of this thread's discussion, in mathematics will always symbolically be elements of some solution set of a finite number of linear equalities and inequalities (or the intersection of a finite number of halfspaces and hyperplanes).
A hypertechnical article that gives the gist:
https://www.edge.org/conversation/nassim_nicholas_taleb-unde...
I find it hard to believe that Math is that different from physics or other sciences in its robustness.
Some advantages that math has had over other sciences is low resource consumption (pen and paper), easier reproducibility(thinking), and it has gotten a long head start of 2-3 thousand years.
It's more correct to think of axioms as being preconditions.
We say, "Here is what happens if these things are true", and then specify what happens, but that doesn't deprive us from independently checking whether those conditions are true. Just because something has been proven does not stop it from being an axiom. It's contextural.
I remember that in school teachers were often insisting about giving a proof to something, but to me it often made enough sense and it was often right, and it was often frustrating to have teachers tell you "no". It felt like a burden of proof.
Not saying proofs are not important, but it seems that proving a theorem is important at a higher levels of mathematics, not in high school or university.