11 ms·
Logical difficulties in modern mathematics (2012)
- effie 8y agoIf real numbers get this guy's goat, I think he will go ballistic when he hears about bra-ket formalism that quantum theory instructors foist upon students of physics.
- agumonkey 8y ago#sedenions
- btilly 8y agoAccording to classical mathematics, only a countable number of finite definitions of numbers exist. And an uncountable number of real numbers exist. Therefore almost all real numbers that exist do not correspond to any possible finite definition of a number. Tell me. In what sense does an abstract concept exist that has no possible definition or unique description?
- panic 8y agoThe amount of paper in the universe is finite, not countably infinite, which means almost all natural numbers can't be written down either. But despite its philosophical dubiousness, the set of natural numbers is still useful. If we can prove things about all natural numbers, it doesn't matter how much paper we have; the things we prove will still be true for any individual natural number we can write. It's the same idea for the reals; we don't actually care about the vast majority of the real numbers, but since it's hard to know ahead of time which ones we will care about, we might as well prove things about all of them!
- deleted 8y ago[deleted]
- btilly 8y agoThe thing is that the useful things that we can prove about natural numbers are ones that can be proven about practical ones. We can, at least in principle, follow the construction and wind up with whatever exists. Now compare with the kinds of results that classical mathematics gives us. The Robertson-Seymour theorem (see https://en.wikipedia.org/wiki/Robertson%E2%80%93Seymour_theorem https://en.wikipedia.org/wiki/Robertson%E2%80%93Seymour_theo... for the theorem) says that certain classes of graphs are characterized by a finite forbidden set. This means that membership can be tested by a polynomial time algorithm. However the construction provides no way to actually find that finite set. It also provides no way to find how many members it has. It not only provides no way to prove that you actually have all of them for a given class of graphs, but there are classes of graphs which it is impossible for us to prove that we actually have a complete list. Not only in practice, but in principle. So the theorem asserts the existence of a finite set. But in what meaningful way does it exist, or is it finite?
- ginnungagap 8y agoSo you're arguing that a set can exist even if its elements don't? Because we can surely give a unique description of the set of real numbers (the unique complete ordered field up to iso) and this description forces it to be uncountable
- btilly 8y agoNo, I am not. Also the definition that you gave is complete nonsense to a Constructivist. And the reasoning that forces it to be uncountable in classical set theory requires reasoning that also makes implicit assumptions you are probably not aware of.
- ginnungagap 8y agoYou said "acccording to classical mathematics", which is not constructive so I assumed you were working in ZFC or some similar set theory. Also if we want to be precise I'd like to hear your definition of "finite definition", the only definition of "definability" I'm familiar with is relative to a model of a theory and if ZFC has models at all then it has countable pointwise definable models, but I guess that won't satisfy your idea of "finite definition"
- btilly 8y agoWhen I said "according to classical mathematics" I did mean according to the normal orthodoxy, which does indeed mean ZFC. By "finite definition" I mean a finite sequence of statements in first or second order logic which can be proven to define a unique real number. (Even if, as with Chaitin's Constant, we can't figure out what that number is.) The fact that this may not be a definition from my point of view is irrelevant - I was making a statement about what classical mathematics implies, and from the point of view of classical mathematics this is a perfectly reasonable definition. Since the number of such statements is countable, and only some of them define real numbers, the set of such real numbers is countable. Being countable it is a set of measure 0, and therefore the "almost all" that I stated follows immediately.
- aeneasmackenzie 8y agoHe hates Dedekind cuts, not real numbers. Real numbers exist all right, here are some: https://arxiv.org/abs/0805.2438 https://arxiv.org/abs/0805.2438
- btilly 8y agoThere is a distinction between analytically correct expositions, and ones which build on naive intuition to teach students. It is inappropriate to expect beginning students to follow a logically rigorous exposition. That said, there are philosophical questions about truth, infinity, unknowable statements and the like. Mathematicians have by and large settled on a set of answers to these. Every statement is true or false, regardless of whether we know the answer, or even whether we can know the answer. Infinite sets exist, and are described by a known set of axioms called ZFC. Almost all real numbers that exist can never, even in principle, be written down or described in any meaningful way. (In what sense do they exist again?) All of these statements are part of classical mathematics. Almost every elementary exposition will implicitly assume that they are try. Yet they can all be questioned, and their truth can never be settled in any absolute sense. However woe betide the student who dares question these in a math class.
- AlexCoventry 8y ago> Almost all real numbers that exist can never, even in principle, be written down or described in any meaningful way. I don't think many people see that as a matter of philosophy.
- btilly 8y agoMost people are uninformed. This question strikes at the heart of the debate between Constructivism and Formalism. A debate about what it means for things to exist, statements to be true, and so on. This is very much a matter of philosophy. To a Constructivist, most of classical mathematics is nonsense. And Constructivism is at least as logically consistent as classical mathematics. More precisely any contradiction found in Constructivism necessarily will lead to a contradiction in classical mathematics. The converse is only partially true. Gödel did prove that a logical contradiction in the classical handling of infinity will lead to a contradiction in Constructivism. But a flaw in a specific set of classical axioms, such as ZFC, need not lead to a flaw in usual Constructivism.
- AlexCoventry 8y ago
- roenxi 8y agoI know Norman; not personally. His real complaint as far as I've ever been able to determine is that he is a highly symbolic thinker; and because of that won't accept certain assumptions that everyone else takes as a given - usually what the Reals are. I'm very happy to accept than any length in geometry is a number by definition (hence sqrt(2), constructed by a 1-1-sqrt(2) triangle, is clearly a number corresponding to that length). He won't accept sqrt(2) as a number because it can't be represented in Hindu-Arabic notation. This isn't really a logical issue, he just won't use everyone else's definitions. He's worth listening too because he is good at maths despite that handicap and his perspective is interesting to provoke a bit of reflection on what your assumptions are and what does infinity really mean anyway. His complaints are otherwise unlikely to catch on.
- nokcha 8y ago>He won't accept sqrt(2) as a number because it can't be represented in Hindu-Arabic notation. You sure of that? Based on another of his other blog posts [1], his objection seems to be about uncomputable real numbers. Very roughly, a real number R is computable iff there exists a Turing machine that, given a natural number n on its initial tape, terminates with the nth digit of R. See [2] for a formal definition. Sqrt(2) and all familiar real numbers are computable. Of course, since there is only a countable infinity of Turing machines, but an uncountable infinity of reals, some reals must be uncomputable. Some versions of constructivist mathematics do differ from standard mathematics by rejecting the uncomputable reals and instead defining "real numbers" in such a way that they are essentially the computable reals. [1] https://njwildberger.com/2016/01/01/uncomputable-decimals-and-measure-theory-is-it-nonsense/ https://njwildberger.com/2016/01/01/uncomputable-decimals-an... [2] https://en.wikipedia.org/wiki/Computable_number#Formal_definition https://en.wikipedia.org/wiki/Computable_number#Formal_defin...
- roenxi 8y agoYeah, pretty confident. He doesn't like the computable or uncomputable reals; although I suspect he would like the uncomputables less. Eg, "These phoney real numbers that most of my colleagues pretend to deal with on a daily basis ... such as sqrt(2), and pi, and Euler’s number e." [0] Even in the article you cite, the irony of a pure mathematician of all people complaining that a concept has no tangible link to reality is a bit of a give away that he is speaking from the heart rather than the head. That isn't a valid complaint about pure mathematics; the point is patterns for patterns sake. So what if there are no known examples of your pattern? Study it anyway! Great case of the flaw maketh the masterpiece; apart from that one little quirk with infinite things he is a lovely character and a force to be reckoned with. And I expect his personality motivates a lot of interesting research from him regardless. [0] https://njwildberger.com/2014/10/06/the-infinitely-real-delusion-and-my-recent-debate-with-james-franklin/ https://njwildberger.com/2014/10/06/the-infinitely-real-delu...
- fanzhang 8y agoDid the guy ever deliver on his promise to create a better system? I thought the problems he was pointing out was motivation for a better system (that united the naive understanding and rigor better?), but the further into the article I got, the more it just seemed like a list of complaints. Having 1) studied "naive statistics" when I was young and 2) learning the full-on measure-theory version a la Bourbaki, and now 3) using applied statistics every day, I can say the naive version is the most useful by far. Yes, there is hand waving, but the hand waving works, and you really don't get into that much trouble unless you try to be pathological. I admit, it would be great to have a version where the naive intuition (many of which are motivated by empirics, physics, and real world situations) and the theoretical definition matched better. Even still, I don't think the formal treatment is appropriate as an introduction -- it's an unnecessary hazing on learning minds when they can get most of the value with a bit of hand waving.
- wjn0 8y agoInteresting that you chose statistics as your example. I've always considered statistics to be the one branch of math I've studied where intuition keeps pace with depth and rigour. The caveat being that I am by definition an amateur when it comes to any other branch of math.
- psykotic 8y ago"Measure theory a la Bourbaki" is probably not what you meant if you did probability theory and statistics. Bourbaki famously sidestepped classical measure theory with sigma algebras by constructing Radon measures as functionals via functional analysis. This is sufficient for many purposes but not for probability theory. First and foremost, sigma algebras in probability theory are not just a technical device to avoid paradoxes with unmeasurable sets. Sigma algebras play a starring role in conditional expectation, stochastic processes and martingale theory. The best way to appreciate the information-theoretic role of sigma algebras is to look at them in the simplest case, where you have a discrete-time, finite-valued process. Then a sigma algebra is equivalent to a partition of the state space and it represents the information that can be gained from an observation; it's like a random variable without specific values, just the discriminating information from different outcomes. To say that a random variable is measurable with respect to the sigma algebra is to say that its value may only depend on information that can be gained from an observation. A filtration of sigma algebras corresponds to a causal series of observations where the observer learns more information over time. The conditional expectation of a random variable with respect to a sigma algebra (or partition or other random variable) is another random variable that tells you the expectation over the states consistent with a given observation; this new random variable is measurable with respect to the sigma algebra you conditioned on, which as mentioned earlier means it only depends on the information gained from an observation. The conditional expectation is the best least-squares estimator given the information from an observation in the same way that the usual expectation is the best least-squares estimator given no information.
- spindle 8y agoThere are MANY foundations for set theory, some of them very different from each other. It's completely pointless to treat the subject as briefly as this post does.
- zzless 8y agoHe is obviously a well trained mathematician so reading his pieces (of which there are many) is akin to watching a tsunami come to shore---you cannot look away yet you know that this is a tragedy unfolding. This said, his complaints about set theory would have been (probably) more convincing if he stated the axioms correctly. The Infinite Set axiom does not simply say that some nebulous infinite set exists it states the existence of a set with some very specific properties. His complaints about the undefined nature of a 'property' are also not above criticism: GB theory (equivalent to ZF) eliminates it completely.
- gchpaco 8y agoIn general his complaints regarding logic are incoherent. A function is not a messy weird object in mathematics; it's a possibly infinite set of ordered pairs where there are no duplicates of the first element of the ordered pair. That's it all it is, formally. Or "class" is a concept that has highly specific meaning in NBG theory—in ZFC it's not a formal distinction and so there's a transformation that must be obeyed where "x \in Class" means "{ x | x satisfies class definition}"; which due to Foundation must be the subset of some other, preexisting, class (and thus is Russell's paradox defeated). Almost all of these things exist and are present and are extremely well defined in the theory, he just doesn't like them for some reason.
- unimployed 8y agoI'm curious to hear what this guy thinks of the esoteric math in higher level economics... how base assumptions there are built and extrapolated on to ultimately guide economic policy. He would have a field day with the assumptions used in DSGE (which there are empirics to contradict those assumptions, and economists keep using those assumptions anyway).
- steve76 8y agoI would start with identity, that's all everything boils down to, and that math is as much a language, a shorthand to express ideas and communicate across the world like some state department, as it is computational. Then I would explain that imaginary numbers mean harmonics. exponential functions give you a derivative, one function can serve as input to another, PID control, ... ... and that's about it.
- GolDDranks 8y agoAfter listening to Wildberger's rants – some of which are very educational and some of which are just rants, I keep thinking that his actual problem is that he doesn't seem to believe in the implications of the axiom of the excluded middle. He goes on about infinities and such, but the deeper issue seems to be that he thinks in a constructive, intuitionistic way whereas the majority of mathematics uses classical logic and even accept the axiom of choice. I wonder why he never talks about this – surely as a mathematician he should be aware of intuitionistic logic? (Or is it that as a computer science and linguistics wannabe, I am aware of it but many mathematicians aren't bothered to take a look?) If you stop thinking of axioms as value judgements and instead as definitions of formal systems (or adopt a more general system that encompasses others, such as Gentzen style sequent calculus with the only axiom being modus ponens), you achieve a piece of mind. But obviously his beef is not only that; he would like other people to admit the value of the thinking he prefers. And I agree with that.
- theaeolist 8y agoWhile reading his rant I kept thinking it's a pitch for HOTT or Univalent Math. Many of the motivations are similar.
- posterboy 8y agoIn what way can kinds of constructive logic play a role in linguistics, in your opinion?
- ZoltanAK 8y ago> I keep thinking that his actual problem is that he doesn't seem to believe in the implications of the axiom of the excluded middle. [...] I wonder why he never talks about this – surely as a mathematician he should be aware of intuitionistic logic? (Or is it that as a computer science and linguistics wannabe, I am aware of it but many mathematicians aren't bothered to take a look?) Heck, I know professional logicians (mostly model theorists) who have never seen intuitionistic logic, in any context, ever. That said, Norman does know a fair bit about intuitionistic logic and constructive mathematics, and even some type theory. He does not like the underlying philosophy any more than he likes classical mathematics. > Gentzen style sequent calculus with the only axiom being modus ponens Sidenote: a calculus where modus ponens is an axiom is definitely not a Gentzen-style sequent calculus.
- aragnoil 8y agoI'm not sure if he's a finitist or ultrafinitist [1] but the uncountable reals are clearly a problem for him. I'd like to argue for their usage from a "soft" point of view as opposed to just giving axioms. Mathematics and physics both began with the advent of astronomy: Babylonians and others were curious to trace star patterns and from there both physics and math developed in tandem and influenced each other greatly. Really, neither would have developed without the other. Calculus was invented for calculations in physics. This gave rise to differential equations which we use to model so many nontrivial things. The differential eqns describe flow and continuity and arguably reality. Differentiation and smoothness can't be defined over finite sets in the same way. My philosophical counter-argument to finitists is that clearly we're on the right path to understanding the universe and nature when using the reals. It seems foolish to shy from this because computers have trouble computing some functions. Statements like "there are only finitely many atoms in the universe" don't improve our understanding of much but PDEs explain. [1] https://en.wikipedia.org/wiki/Ultrafinitism https://en.wikipedia.org/wiki/Ultrafinitism
- kccqzy 8y agoA large part of his article seems concerned with the deficiencies and the lack of rigor in first year calculus textbooks. But I think, pedagogically, isn't it appropriate to introduce a subject intuitively and hand-wavingly, before proceeding to a more rigorous treatment? There's a reason students learn calculus before analysis.
- pron 8y agoWhen discussing a certain discipline, be it mathematics or any other, the issue of rigor and foundation are completely separate. Rigor is established if you are careful to always follow the axioms determined by the foundation. But the foundation, i.e. the choice of the axioms can only be established in another, lower level, discipline, which, in the case of mathematics is philosophy. In the early decades of the 20th century there were furious philosophical debates about the philosophy of the foundation of mathematics (between Brouwer's Intuitionism and Russell's Logicism, and also Hilbert's compromise of Formalism), but they all stemmed from an underlying assumption that mathematics gains its validity from some notion of philosophical truth. One could argue to no end on how the truth of mathematics is established, but a different perspective later emerged that avoids this debate altogether: that mathematics takes its validity not from truth but from utility (which is always relative to a specific task). We cannot say that one of those views is unacceptable, and if your position is that mathematical validity stems from utility, we cannot tell you that your foundation is shaky if its utility is established.
- MaxBarraclough 8y agoBut axioms aren't assertions of truth. They're not declarations from on high about universal truths, they're how mathematicians ensure they're talking about the same things. Mathematics is about exploring the consequences of your axioms. Axioms are chosen, not dictated by the universe. If your axioms turn out to be inconsistent, well, congratulations on successfully showing that consequence of those axioms. Case in point: the axiom of choice. There is no objective truth value to it. The physical world gives us no 'answer'. Mathematicians can choose to adopt it, or not, and then explore the consequences. ( https://en.wikipedia.org/wiki/Axiom_of_choice#Statements_consistent_with_the_negation_of_AC https://en.wikipedia.org/wiki/Axiom_of_choice#Statements_con... )
- pron 8y agoWell, that certainly was not the common perception in the philosophy of mathematics in the first half of the 20th century. Sure, they believed mathematics is an exploration of the axioms, but also that the axioms must be true in some deep philosophical sense. Brouwer wrote: [A]n incorrect theory, even if it cannot be inhibited by any contradiction that would refute it, is none the less incorrect,[1] and Russell believed that all of mathematics could be deduced from laws of logic that are true in the most absolute sense. It is also doubtful that this is the perception today. If we want to use mathematics to derive any result about the physical world -- and we most certainly do -- our axioms must be consistent with it. How do you ensure that that is the case? But such questions are not part of mathematics itself, just as the scientific method is not part of physics, but rather belong in a more fundamental discipline, called foundations of mathematics, or the philosophy of mathematics, which is usually studied by philosophers/logicians.[2] [1]: On the Significance of the Principle of Excluded Middle in Mathematics, 1923 [2]: https://plato.stanford.edu/entries/philosophy-mathematics/ https://plato.stanford.edu/entries/philosophy-mathematics/
- tome 8y agoDid anyone understand this bit? > The approaches using equivalence classes of Cauchy sequences ... suffer from an inability to identify when two “real numbers” are the same Perhaps there's no computable general method, but it seems like it highlights an even bigger problem which remained unspoken. There is an inability to tell when a sequence of numbers approaches zero!
- zozbot123 8y agoYup, you can define distinctness of constructive real numbers as two algorithms returning rationals that will differ by more than the approximation error ε they were given as input, for some arbitrarily small ε - but equality involves proving that two algorithms will never be apart in this way - and this cannot be done in general. As you say, even comparison with zero is problematic. So instead of equivalence relations, you need to define the apartness relation - the notion that a supposed equivalence between two such numerical algorithms can be constructively refuted. This is nothing new - it's a well-known part of constructive math, and is also the sensible way to formalize numerical analysis.
- quantum_state 8y agoTried watching his video on limit ... but what was said prevented me from wasting my time further. Contrary to the claim of math foundation, it is apparent that the guy does not understand math despite being a stats professor. It is not even wrong.