45
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 03 Feb 2026
45 points (95.9% liked)
Asklemmy
52774 readers
333 users here now
A loosely moderated place to ask open-ended questions
If your post meets the following criteria, it's welcome here!
- Open-ended question
- Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
- Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
- Not ad nauseam inducing: please make sure it is a question that would be new to most members
- An actual topic of discussion
Looking for support?
Looking for a community?
- Lemmyverse: community search
- sub.rehab: maps old subreddits to fediverse options, marks official as such
- !lemmy411@lemmy.ca: a community for finding communities
~Icon~ ~by~ ~@Double_A@discuss.tchncs.de~
founded 6 years ago
MODERATORS
Our current system? So ZFC?
We move to a different, probably weaker system. Certain mathematicians studying hyper-infinite monstrosities like Banach spaces will be sad. Life will go on, though.
Existing applied math should all work purely in the Von Neumann universe of finite sets. Saying there's actually an infinite number of points in a line is a kind of luxury; it's just one that feels right to most mathematicians. A number that's simply much larger than is worth bothering with can work the same way. In the same spirit, you can probably get rid of most of the Von Neumann universe without breaking practical things.
If you mean actual practical math breaks, I dunno. In any reasonably complex inconsistent formal system, all statements can be proven true. Like 10 = 20. So, can I just grow more fingers somehow?
Edit: Since this is Lemmy, it's worth pointing out that Godel's incompleteness theorem has a kind of interchangeability with the fact some questions are undecidable by Turing machine.
Godel's theorem has a kind of salacious, clickbait quality to it. Laymen will interpret all kinds of things into it. I've literally heard "so, math is useless then". But, if you know algorithms, you know that saying they can't determine if a loop ends is nowhere close to saying they're going to stop working, or that they aren't really good at what they can do.
A banach space is just a vector space with a norm, there are many many weirder examples of spaces in topology. You're thinking of the banach-tarski paradox I think
It wasn't a mistake. Usually you're talking about an infinite-dimensional TVS when you say Banach space - as in it's just Banach, that's the most you can say about it. I don't mean R^3^.
Stuff like the axiom of choice has a way of coming up in functional analysis. Sure, there's weirder spaces, like from general topology or TVS theory in general, but Banach spaces are an example that are pretty widely used and studied. It seems like going with some pathological object I have to search around for would make the point less clear.
The Banach-Tarski paradox wouldn't work either without the AoC, but it's just a specific counterexample, and Banach and Tarski's careers will be fine since they both died decades ago.