9 ms·
Mathematicians Bridge Finite-Infinite Divide
- okket 10y agoRelated (a bit of Cantor and Hilbert, no direct relation to Ramsey’s theorem): "How To Count Past Infinity" https://www.youtube.com/watch?v=SrU9YDoXE88 https://www.youtube.com/watch?v=SrU9YDoXE88
- avodonosov 10y agoHow do people produce videos like that? It must be very expensive: shooting, pictures, music, all these animations, montage. It can't be done a hobbyist?
- goldenkey 10y agoVsauce is a hobbyist. As he got more popular and ad revenue came in, he could afford better cameras, mics, and props. Hes actually the most successful of the VsauceX (X=1,2,3,4) channels but still keeps them as a network because they are all friends. Honestly, YouTubing like anything else, takes effort more than anything. Some of the most successful channels used a smartphone camera for well past a million subscribers. And part of the rub is that there are a ton of good channels with very little success. Good art and entertainment is borne out of desire to share, not desire to bear. At least in my opinion. Because there will always be garbage to cater to garbage. I should mention, most of the editing can be easily done in After Effects with a couple weeks of training. Its really amazing how accessible having your own syndication is these days. I am not interesting enough or entertaining enough so I leave it to those who are. Sticking to HN threads so I can hide my ugly mug ;-)
- egjerlow 10y ago>Whereas almost all theorems can be shown to be equivalent to one of a handful of major systems of logic — sets of starting assumptions that may or may not include infinity, and which span the finite-infinite divide — RT22 falls between these lines. Could anyone explain this statement? I feel like it's key for understanding the rest! How exactly does RT22 fall between 'these lines'?
- foota 10y agoI'm not entirely sure that I'm hitting the pin on the head with this, but it seems that it is saying that RT_2^2 is inherently an infinite concept but can be proven under a set of axioms that do not require acknowledging that infinite things exist? Ie, that the case for finite things implies the case for infinite things. And that this can then be used to say construct the natural numbers.
- Smaug123 10y agoNot quite, I think, although I haven't read the original paper. There are some mathematicians who doubt that there is an infinite object (we call such mathematicians "finitist"). For such mathematicians, there is a large chunk of the mathematical literature they just can't use, because it relies inherently on the existence of an infinite set. Ramsey's theorem for pairs looks like it relies on the existence of an infinite set; the surprising result described in this article is that while RT_2^2 talks about infinite objects, its proof doesn't actually rely on them. So finitists are free to use it. Even more, according to that article, the introduction of R_2^2 into a proof apparently doesn't break the property that "there is an algorithm to compute the construction the proof is doing". Previously it was thought that introducing R_2^2 to an otherwise "computable" proof (that is, one which carries out some computable operation) might stop it from being computable (that is, would make it so that no computer program corresponded to what the proof was doing: basically making it less constructive). It is now known that that is not the case.
- tnecniv 10y agoHow do these finitists handle things like the real numbers? Do they just not consider questions that require the notion of infinity?
- roywiggins 10y agoI gave it a google, and per Math StackOverflow: > One can make statements about π or any other explicitly defined real number, as theorems about a specific sequence of rational approximations https://math.stackexchange.com/questions/501/if-all-sets-were-finite-how-could-the-real-numbers-be-defined https://math.stackexchange.com/questions/501/if-all-sets-wer...
- robinhouston 10y agoI love the fact there's a long popular article devoted to the proof “that RT^2_2 is Π^0_3 conservative over IΣ^0_1”, as the abstract of the paper summarises it. Reverse mathematics is a fairly niche area even within mathematical logic. Kudos to Natalie Wolchover for taking it on.
- xviia 10y agoIt makes me curious how Quanta is funded. The journal is very high quality and in a niche market: pure science journalism. I can't imagine they make enough subscription revenue; maybe it's funded mostly through the Simons Foundation? Either way, glad it exists!
- defen 10y agoI believe it's funded by James Simons
- xviia 10y agoAh, now I understand. For others: Simons Foundations --> James Simons, who is a hedge fund mananger worth ~ $14billion. Excellent interview with Numberphile here: https://www.youtube.com/watch?v=QNznD9hMEh0 https://www.youtube.com/watch?v=QNznD9hMEh0
- antognini 10y agoIn addition, James Simons was a mathematician prior to his work in the finance industry, hence his partiality toward funding a magazine that often writes about pure mathematics.
- bradleyjg 10y agoI believe he is now back at Stony Brook in the mathematics department. Not full time, he has a lot going on, but some kind of affiliation.
- p4bl0 10y agoHere is a little anecdote: I met Ludovic Patey at the École normale supérieure that we both entered in 2009. Among our classmates, Ludovic was easily the best programmer and mastered a lot of different technologies (from advanced web stuff down to assembly languages), so we were all quite surprised when he chose to turn to pure mathematics… But then during his PhD he has been immensely successful (invited as keynote speaker to conferences, praised by peers, and an impressive list of journal publications). A few weeks ago, he has been ranked first in the CNRS 2016 recruitment competition, which is internationally competitive. When that competition started he hadn't even graduated from his PhD yet! Which means he (deservedly) bypassed the cumbersome post-doc phase by which virtually all young researchers must go through these days. This time, none of us were surprised :) !
- igravious 10y ago> The boundary does not pass between some huge finite number and the next, infinitely large one. Rather, it separates two kinds of mathematical statements: “finitistic” ones, which can be proved without invoking the concept of infinity, and “infinitistic” ones, which rest on the assumption — not evident in nature — that infinite objects exist. Let Y = some ridiculously huge finite number. The notion that ∞ = Y + 1 has to be one of the most insidious defects in reasoning. Even to acknowledge the defect by dismissing it is almost like saying things could have turned out that way when they _never_ could. Finite means limited or bounded or quantifiable. Infinite means unlimited or unbounded or unquantifiable. They are two wholly separate classes of things. Another way to say this is discrete versus continuous (in nature). Imagine I said that I could bridge the coloured/non-coloured divide. What could I possibly mean by that. It would mean that I have found a way to talk about both coloured things and non-coloured things that applies to both class of things. Put another way. Imagine I separate coloured things into green ones and not green ones. Both subclasses belong to the class of coloured things. What class then do the subclasses of finite things and non-finite things belong to? Negation constructs the distinction, negation _is_ the bridge in a way and all the could be said of both subclasses of things is that they are both things. (Which, to be clear, is not saying very much at all, is it?) If those things are numbers then all we are saying is that both things are numbers, if both things are procedures then all we are saying is that both things are procedures. And so on. If I'm thinking about this properly then the paper is trying to more precisely define the term "countably". That's as most as it can do. To say otherwise is not just vastly overstating what the paper is about but outright misleading.
- Smaug123 10y agoYou're not thinking about this properly. There are some facts about finite objects which simply cannot be proved without reasoning about infinite objects - for example, the well-definedness of the TREE function. These facts are true if you have access to infinite objects, but not necessarily if you don't. This paper shows that a certain class of statements about finite objects, which we knew were true by virtue of reasoning about a certain infinite object, in fact remain true if you're restricted only to reasoning about finite objects.
- auggierose 10y agoGreat article, very well written and actually understandable without hunting down mathematical definitions. I think it is quite cool that people are still hunting down the various different incarnations of infinity and are able to prove deep results like this. On the other hand, I don't think that these questions are as essential as they are made out to be. How do we know that everything finite is on unshakable foundations? Doesn't even thinking about what that statement means involve reasoning about infinities? Let's just accept that nothing ever is really unshakable and let's use the tools that will get the job at hand done.
- Smaug123 10y agoBut we can be more sure of things that are less shakeable. Additionally, these techniques sometimes give us more effective proofs: for example, if we know that A is true, that is less useful than knowing that A is true and that we can find a finite certificate of its truth. We can make computers verify finite certificates, for instance. A useful distinction to have in mind is: I know that the number 91 must have prime factors, because I can prove that all numbers have prime factors. But that's much less useful than knowing that its prime factors are 7 and 13. Similarly, if I could prove A using infinitistic methods, that's in some sense "a bit less useful" than a proof which uses finitistic and/or constructive methods.
- auggierose 10y agoMy point is that if you prove that 91 has as its prime factors 7 and 13, I don't care if you did that proof using infinite methods or not. In general, I am only proving theorems that are useful to me, so "a bit less useful" doesn't apply to these situations. If I needed that "bit more usefulness", I would go ahead and prove it (if I could). Your reasoning mostly only applies if you prove theorems for their own sake, and not because you already know what you want them for.
- Smaug123 10y agoIt's only an analogy. The analogy is meant to be "prove that 91 has prime factors" using infinitistic methods, and "prove that 91's prime factors are 7 and 13" using finitistic ones.
- scribu 10y agoAs a noob, I'm having a hard time grasping why the Ramsey pairing is interesting: If you pair up every member of an infinite set with every member of that same infinite set, of course you'll get an infinite subset for almost every predicate about a pairing, just by virtue of starting from an infinite superset. It seems like the theorem would be interesting if it said something about the "magnitude" of the subset, not just that it's infinite.
- n4r9 10y agoIt's hard to know what you're finding uninteresting/confusing from your description. Perhaps it would help to note that every possible pairing is given a colour, and in your infinite subset every possible pairing within that subset has the same colour. To me this is quite counter-intuitive. There is a somewhat enlightening comparison to be made between Ramsey on pairs and the result that every real sequence x_n has a monotonic subsequence. You get this result as a corollary by colouring a pair of natural numbers a<b red if x_a <= x_b and blue otherwise. Interestingly, the Ramsey theorem can be extended to three, four or any number of colours. I believe you can use this to show that any real sequence has either a convex or concave subsequence, but I'll omit the details :p There's also a delicate balance between the infinite and finite going on. Clearly, with an infinite number of colours you could get a colouring without a monochromatic subset. More surprisingly perhaps, if you colour the infinite subsets of the natural numbers red or blue, then there exist colourings for which there is no monochromatic subset.
- SilasX 10y agoI have the same confusion as the GP, so let me try to ask a clarifying question: Is the challenge to partition the pairs (of natural numbers) such that both partitions are infinite and monochromatic? Is that the hard thing that was proved here? If so, how about "color red if a = b-1, blue otherwise"? Then the infinite subset (0, 1), (1, 2), (2, 3), ... is monochromatic. What criterion did my partition there fail to satisfy?
- NotAPerson 10y ago
- arenaninja 10y agoSo if I get the gist of this correctly, this makes proofs that are applicable to finite sets/structures/objects easier to translate to a proof that's applicable to infinite sets?
- deleted 10y ago[deleted]
- Smaug123 10y agoI wrote a short note [1] to try and clear up some of the misconceptions in this thread. Feedback welcome; Hacker News thread for the short note at [2]. [1]: https://www.patrickstevens.co.uk/finitistic-reducibility/ https://www.patrickstevens.co.uk/finitistic-reducibility/ [2]: https://news.ycombinator.com/item?id=11769425 https://news.ycombinator.com/item?id=11769425
- wutf 10y agoThe book Where Mathematics Comes From demonstrates that the concept of infinity itself is finitistically reducible via conceptual metaphor. This really isn't that surprising though, is it? Our experience is grounded in the interaction of concrete, finite objects.
- sewercake 10y agodoes this 'heirarchy of logic' have any direct relationship to computational models, or do all (non-hyper) models fall under a single category?
- openasocket 10y agoI'm having trouble imagining what finitism actually is, based on what I remember from set theory. Is it equivalent to Zermelo-Frankel set theory without the axiom of infinity?
- pohl 10y agoI found this helpful: "The main idea of finitistic mathematics is not accepting the existence of infinite objects such as infinite sets. While all natural numbers are accepted as existing, the set of all natural numbers is not considered to exist as a mathematical object. Therefore quantification over infinite domains is not considered meaningful." https://en.wikipedia.org/wiki/Finitism https://en.wikipedia.org/wiki/Finitism
- jsprogrammer 10y agoYou may be interested in Wildberger's recent Math Foundations series lectures. 180 [* * ] may be a decent starting point. [ * *] https://youtu.be/LJR24_Povzw https://youtu.be/LJR24_Povzw