Something the computer scientists of Hackernews might not realise is that most mathematicians are by nature Platonists, even if they would not try to defend that position when pressed.
Mathematicians begrudgingly retreat to formalism and foundations when pressed because its easier to defend, but the day-to-day of contemporary mathematics is much more an explorative process of a "real" mathematical landscape. They aren't concerned with foundations because it "feels" self-evident that the mathematics they are discovering is true (because their means of discovery, rigour and proof, "guarantee" it to be so).
A lot of the comments here are making false assumptions like "but surely mathematicians all know that their field is ultimately justified as a symbol-pushing game from some axiomatic system right?" in the same way one might say "surely all computer scientists know that every language ultimately compiles down to 1s and 0s processed by a CPU" but that is not at all how most mathematicians think about doing mathematics.
IMO it's not far off how most python or javascript devs don't care about registers or cache misses. Someone's thought deeply about those things so you don't have to.
Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study). For example, Wiles' initial proof of Fermat's last theorem used quite exotic machinery called "inaccessible cardinals", which lie outside of ZFC. Subsequent work showed they weren't needed.
Another good example of mathematicians caring which 'house of cards' their results are built on is the search for an "elementary" proof of the prime number theorem (i.e. showing it doesn't rely on complex analysis).
> Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study). For example, Wiles' initial proof of Fermat's last theorem used quite exotic machinery called "inaccessible cardinals", which lie outside of ZFC. Subsequent work showed they weren't needed.
In a way mathematicians can afford to do this more readily than people in software development, because if something is actually proven, then you can 100% rely on that. With software not so much. Or rather: Software usually is not proven to be correct, because that's usually expensive. In mathematics they don't have to consider the runtime of an algorithm, when they "merely" need to prove correctness. The time it needs to run is irrelevant for its correctness. And so they can stack and stack and stack, provided that each piece is proven correct, and it won't have negative consequences. Well, almost. There is some negative consequence in that another human being, wanting to understand a proof, needs to know perhaps many concepts and other proofs, in order to be able to do so. But that's probably the only reason to pursue simplicity in mathematics.
> Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study).
I'd be careful about generalizing that to all or most 'mathematicians'. E.g., people working in a lot of fields won't bat an eye at invoking the real numbers when the rational or algebraic numbers would do.
I'm sure some python devs care about cache misses too. I guess my point was that the big results will be picked over again and again to understand _exactly_ which conditions are needed for them to hold.
This seems to me to be the same as saying that mathematicians do not care about the meaning of their theorems. That they are only playing a game. They care about consistency only because inconsistency means one can cheat in their game.
I know TFA says that the purpose of foundations is to find a happy home (frame) for the mathematicians intuition. But choosing foundation has real implications on the mathematics. You can have a foundation where every total function on the real numbers is continuous. Or one where Banach–Tarski is just false. So, unless they are just playing a game, the mathematicians should care!
I'd say that I care deeply about the meaning behind theorems, but just find results which swing widely based on foundational quirks to be less interesting from an aesthetic standpoint. I see the most interesting structures as the ones that are preserved across different reasonable foundations. This is speaking as someone who was trained as a pure mathematician, moved on to other things, but tries to keep up with pure math as a hobby.
Yes, but most mathematicians do not seem to make this distinction between sturdy and flimsy truths. Which puzzles me. Are they unaware? If so, would they care if educated? Or do they fully commit to classical logic and the axiom of choice if pushed? I can see it go either way, depending on the psychology of the individual mathematician.
I don't think they usually make the distinction in a formal sense, but I think most are aware. The space of explorable mathematics is vastly larger than what the community of mathematicians is capable of collectively thinking about, so a lot of aesthetic judgment goes into deciding what is and what isn't interesting to work on. Mathematicians differ in their tastes too. A sense of sturdiness vs flimsiness is something that might inform this aesthetic judgment, but isn't really something most mathematicians would make part of the mathematics. Often, ones interest isn't the result itself, but some proof technique that brings some sense of insight and understanding, and exploring that often doesn't make much contact with foundational matters.
No one not working on foundations has any problem with axiom of choice. It has weird implications but so what? Banach Tarski just means physical shapes aren't arbitrarily subdividable.
AC makes things much easier as it allows to play God powers. Negating AC is not significantly different from constructing mathematics that avoids AC (no assumption about validity of AC). And that makes things way harder with longer proofs and only in sub-cases of classical theorems.
Simply assuming the negation of AC is boring, as negations often are. But there are stronger statements, implying the negation of AC which might be as useful. I think for instance one could assume all subsets of the plane to be measurable. Seems convenient to me.
Same with law of the excluded middle. Tossing it out we can assume all functions are computable and all total functions in the real are continuous. Seems nice and convenient too!
To be fair, in some fields I've seen arguments between "a widget should be defined as ABC" vs. "a widget should be defined as XYZ", to the point that I wonder how they're able to read papers about widgets at all. (If I had to guess, likely by focusing on the 'happy path' where the relevant properties hold, filling in arguments according to their favored viewpoint, and tacitly cutting out edge cases where the definitions differ.)
So if many mathematicians can go without fixed definitions, then they can certainly go without fixed foundations, and try to 'fix everything up' if something ever goes wrong.
In my experience those debates are usually between experts who deeply understand the difference between ABC and XYZ widgets (the example I'm thinking of in my head is whether manifolds should be paracompact). The decision between the two is usually an aesthetic one. For example, certain theorems might be streamlined if you use the ABC definition instead of the XYZ one, at the cost of generality.
But the key is that proponents of both definitions can convert freely between the two in their understandings.
Try to be charitable. Remember, research mathematicians aren't HN commenters. They're forced to live within their intellectual limitations, however narrow those may be.
The foundations have real implications on very little of the mathematics. Say I'm working in differential equations in vector spaces. I really do not care whether the axiom of choice is true or false. I'm not building up my functions of multiple real parameters out of sets.
You say you have a foundation where that is in fact what I am doing? Great, if that floats your boat. I don't care. That's several layers of abstraction away from what I'm doing. I pretty much only care about stuff at my layer, and maybe one layer above or below.
Very little of mathematics, like analysis? I am sure the analyst will care about all functions on the reals suddenly turning continuous. (Or rather losing the discontinuous ones)
Or what of commutative algebra and their beloved existence of maximal ideals!
you're kind of coming at this backwards. it's not that someone doing analysis doesn't care about whether all functions on reals is continuous, it's that if you hand them a foundation where that's true, they'll disagree with whether your foundation is correctly modeling functions/real numbers.
It is nicer to state theorems that hold for all vector spaces, so mathematicians like to invoke AoC. However, in any applications that are practically relevant, you can obtain a basis without invoking AoC.
Something the computer scientists of Hackernews might not realise is that most mathematicians are by nature Platonists, even if they would not try to defend that position when pressed.
most mathematicians act as though they are Platonists, even though, if pressed to defend the position carefully, they may retreat to formalism https://en.wikipedia.org/wiki/Mathematical_Platonism
Mathematicians begrudgingly retreat to formalism and foundations when pressed because its easier to defend, but the day-to-day of contemporary mathematics is much more an explorative process of a "real" mathematical landscape. They aren't concerned with foundations because it "feels" self-evident that the mathematics they are discovering is true (because their means of discovery, rigour and proof, "guarantee" it to be so).
A lot of the comments here are making false assumptions like "but surely mathematicians all know that their field is ultimately justified as a symbol-pushing game from some axiomatic system right?" in the same way one might say "surely all computer scientists know that every language ultimately compiles down to 1s and 0s processed by a CPU" but that is not at all how most mathematicians think about doing mathematics.
IMO it's not far off how most python or javascript devs don't care about registers or cache misses. Someone's thought deeply about those things so you don't have to.
Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study). For example, Wiles' initial proof of Fermat's last theorem used quite exotic machinery called "inaccessible cardinals", which lie outside of ZFC. Subsequent work showed they weren't needed.
Another good example of mathematicians caring which 'house of cards' their results are built on is the search for an "elementary" proof of the prime number theorem (i.e. showing it doesn't rely on complex analysis).
Edit: here's a great related discussion on MathOverflow, bringing in analogies from CS: https://mathoverflow.net/questions/90820/set-theories-withou...
> Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study). For example, Wiles' initial proof of Fermat's last theorem used quite exotic machinery called "inaccessible cardinals", which lie outside of ZFC. Subsequent work showed they weren't needed.
In a way mathematicians can afford to do this more readily than people in software development, because if something is actually proven, then you can 100% rely on that. With software not so much. Or rather: Software usually is not proven to be correct, because that's usually expensive. In mathematics they don't have to consider the runtime of an algorithm, when they "merely" need to prove correctness. The time it needs to run is irrelevant for its correctness. And so they can stack and stack and stack, provided that each piece is proven correct, and it won't have negative consequences. Well, almost. There is some negative consequence in that another human being, wanting to understand a proof, needs to know perhaps many concepts and other proofs, in order to be able to do so. But that's probably the only reason to pursue simplicity in mathematics.
> Mathematicians do care about how much "black magic" they're invoking, and like to use simple constructions where possible (the field of reverse mathematics makes the central object of study).
I'd be careful about generalizing that to all or most 'mathematicians'. E.g., people working in a lot of fields won't bat an eye at invoking the real numbers when the rational or algebraic numbers would do.
I'm sure some python devs care about cache misses too. I guess my point was that the big results will be picked over again and again to understand _exactly_ which conditions are needed for them to hold.
This seems to me to be the same as saying that mathematicians do not care about the meaning of their theorems. That they are only playing a game. They care about consistency only because inconsistency means one can cheat in their game.
I know TFA says that the purpose of foundations is to find a happy home (frame) for the mathematicians intuition. But choosing foundation has real implications on the mathematics. You can have a foundation where every total function on the real numbers is continuous. Or one where Banach–Tarski is just false. So, unless they are just playing a game, the mathematicians should care!
I'd say that I care deeply about the meaning behind theorems, but just find results which swing widely based on foundational quirks to be less interesting from an aesthetic standpoint. I see the most interesting structures as the ones that are preserved across different reasonable foundations. This is speaking as someone who was trained as a pure mathematician, moved on to other things, but tries to keep up with pure math as a hobby.
Yes, but most mathematicians do not seem to make this distinction between sturdy and flimsy truths. Which puzzles me. Are they unaware? If so, would they care if educated? Or do they fully commit to classical logic and the axiom of choice if pushed? I can see it go either way, depending on the psychology of the individual mathematician.
I don't think they usually make the distinction in a formal sense, but I think most are aware. The space of explorable mathematics is vastly larger than what the community of mathematicians is capable of collectively thinking about, so a lot of aesthetic judgment goes into deciding what is and what isn't interesting to work on. Mathematicians differ in their tastes too. A sense of sturdiness vs flimsiness is something that might inform this aesthetic judgment, but isn't really something most mathematicians would make part of the mathematics. Often, ones interest isn't the result itself, but some proof technique that brings some sense of insight and understanding, and exploring that often doesn't make much contact with foundational matters.
No one not working on foundations has any problem with axiom of choice. It has weird implications but so what? Banach Tarski just means physical shapes aren't arbitrarily subdividable.
Banach Tarski is not about physical shapes.
The thing is, the foundations negating axiom of choice are just as consistent as those with. So, how do mathematicians justify their faith in AC?
AC makes things much easier as it allows to play God powers. Negating AC is not significantly different from constructing mathematics that avoids AC (no assumption about validity of AC). And that makes things way harder with longer proofs and only in sub-cases of classical theorems.
Simply assuming the negation of AC is boring, as negations often are. But there are stronger statements, implying the negation of AC which might be as useful. I think for instance one could assume all subsets of the plane to be measurable. Seems convenient to me.
Same with law of the excluded middle. Tossing it out we can assume all functions are computable and all total functions in the real are continuous. Seems nice and convenient too!
To be fair, in some fields I've seen arguments between "a widget should be defined as ABC" vs. "a widget should be defined as XYZ", to the point that I wonder how they're able to read papers about widgets at all. (If I had to guess, likely by focusing on the 'happy path' where the relevant properties hold, filling in arguments according to their favored viewpoint, and tacitly cutting out edge cases where the definitions differ.)
So if many mathematicians can go without fixed definitions, then they can certainly go without fixed foundations, and try to 'fix everything up' if something ever goes wrong.
In my experience those debates are usually between experts who deeply understand the difference between ABC and XYZ widgets (the example I'm thinking of in my head is whether manifolds should be paracompact). The decision between the two is usually an aesthetic one. For example, certain theorems might be streamlined if you use the ABC definition instead of the XYZ one, at the cost of generality.
But the key is that proponents of both definitions can convert freely between the two in their understandings.
Try to be charitable. Remember, research mathematicians aren't HN commenters. They're forced to live within their intellectual limitations, however narrow those may be.
The foundations have real implications on very little of the mathematics. Say I'm working in differential equations in vector spaces. I really do not care whether the axiom of choice is true or false. I'm not building up my functions of multiple real parameters out of sets.
You say you have a foundation where that is in fact what I am doing? Great, if that floats your boat. I don't care. That's several layers of abstraction away from what I'm doing. I pretty much only care about stuff at my layer, and maybe one layer above or below.
Very little of mathematics, like analysis? I am sure the analyst will care about all functions on the reals suddenly turning continuous. (Or rather losing the discontinuous ones)
Or what of commutative algebra and their beloved existence of maximal ideals!
you're kind of coming at this backwards. it's not that someone doing analysis doesn't care about whether all functions on reals is continuous, it's that if you hand them a foundation where that's true, they'll disagree with whether your foundation is correctly modeling functions/real numbers.
At which point we would have an interesting debate! I could tell them all about how this foundation will give them a more nuanced view on continuity!
Do you not care if your vector space has a basis?
It is nicer to state theorems that hold for all vector spaces, so mathematicians like to invoke AoC. However, in any applications that are practically relevant, you can obtain a basis without invoking AoC.