9 ms·
Mathematicians Measure Infinities, Find They’re Equal
- deleted 9y ago[deleted]
- zelah 9y agoI find Cantor's diagonal argument unconvincing. The claim is that there are more real numbers in the range from zero to one than there are natural numbers. To see that this is false simply realize that you don't actually have to write a decimal point to specify the real numbers in this range. Without the decimal point these real numbers just become natural numbers. Can a rational person believe that there are infinite sequences of digits in the form of real numbers but not infinite sequences of digits in the form of natural numbers? The natural numbers are just an infinite sequence of finite numbers. If you believe n is a natural number then you must also believe that n*10 is a natural number. One more digit! There is always one more digit (that is what infinity implies). If there really are an infinite number of natural numbers then some of them must be of a transfinite number of digits or else you would be including numbers in the list more than once. The problem with Cantor's argument comes down to the fact that the procedure he uses to find a number not in the set is essentially the same as the procedure he uses for creating the infinite set in the first place. The only difference is our understanding of randomness. His procedure for finding a number not in the set may not seem very random but it might be as random as any other. A truly random coin could theoretically come up heads every time. The important part of his argument is that the infinite list of real numbers has no repeats. The diagonalization procedure similarly ensures that there are no repeats. On the one hand he claims the infinite set of real numbers exists. On the other hand he argues that the diagonalization that yields a number not in the set has not already been done. He takes away infinity and then gives it back! There is only one infinity. It means "repeat". It is simply the interplay of finite state with process. You can think of it as an "infinite loop" in programming. To say that one infinity is smaller than another is to deny that the smaller is infinite. Infinite means without bound.
- ColinWright 9y agoSo if I understand you correctly, you find it unconvincing, and therefore generations of mathematicians who study these things must all be wrong. Perhaps you simply don't understand the argument in detail, and are relying on your intuition. And perhaps your intuition is faulty. Which seems more likely? So let me try to provide a better insight for you. Consider the collection of natural numbers, including 0. Call it N. We all agree that N, also described as the set of non-negative integers, is infinite. Now imagine flipping a coin at time t_0, t_1, t_2, etc. If you're worried that this will take infinite amounts of time, we can suppose that each flip - because we are practised - takes half the time of the previous flip, so all the flips can be done in finite time. However, we're in the realm of Pure Mathematics now, chasing the puzzle for its own sake, and not worrying about practicalities. So what might the result be? Well, you might get all heads, you might get all tails, you might get alternating heads and tail, in practice, of course, you'll get something that looks random. Let's think about all the possible results of flipping the coin. All possible results. Let's let F be the set of all possible results obtained from flipping the coin are each of t_0, t_1, t_2, and so on. We can think of F as functions from N to {H,T}. So we have F and N. Let's wonder if it's possible to have a function from N to F that hits every element of F. Suppose we can. So we have m:N -> F, and for every f in F, there is an n in N such that m(n)=f. Do you think that's possible? Because hundreds of thousands of mathematicians say that it's not possible.
- zelah 9y agoIt is possible. The inverse of m is called q. The function q takes an infinite sequence of coin flips and one by one changes every heads to 1 and every tails to 0. The infinite string of zeros and ones is then prepended with a 1 and interpreted as a transfinite natural number in binary notation. This will not take forever because each change will only take half as long as the previous one. A transfinite natural number can exist since there are an infinite number of natural numbers. If we stop at 1-bit numbers then the natural numbers are not an infinite set. Likewise, if we stop at 2-bit numbers then the natural numbers are not an infinite set. Our only option is to concede that transfinite natural numbers do actually exist and that they can be put into correspondence with all sequences of coin flips. Hundreds of thousands of mathematicians are wrong.
- xamuel 9y agoActual article: https://arxiv.org/pdf/1208.5424.pdf https://arxiv.org/pdf/1208.5424.pdf Great results within a very narrow field, which quantamagazine leverages into a clickbaity title.
- burkaman 9y agoWhy do you think this is clickbait? The headline accurately describes the content of the article, which as far as I can tell accurately describes one result of this paper. Clickbait doesn't mean any interesting headline, it means a misleading and purely attention-grabbing headline.
- xamuel 9y agoIt's like if someone proved P=NP and the magazine title was: "Mathematicians Measure Difficulty Levels, Find They're Equal."
- l3k 9y agoMaybe I misread, but I feel like solving P=NP would be closer to solving the continuum hypothesis whereas the article describes solving a related problem which could have disproved the hypothesis should it have been found that the two sets were not equal.
- burkaman 9y agoThat's not a good headline, but it's not clickbait. If P vs. NP were a fairly obscure problem with little immediate impact outside of academia, that would be a fine layperson headline. What would you have titled this Quanta article?
- SilasX 9y agoClickbait refers to vague titles that also overhype the story. Your example, if anything, underhypes it.
- jtanderson 9y agoI was very confused by this. The paper linked by OP (the one I also had in mind when I started the article) is from 2012, but the article is written as if the results are recent (specifically it says from 2016! Admittedly, only five years for such a big result in that field is probably still "recent" to experts; but probably not to the "pop science" readers. Furthermore, the lack of an actual citation was very disturbing, since if anybody did want to read the actual paper, they had to google for terms that would lead to basically incomprehensible search results.
- thriftwy 9y agoSo they basically found a way to represent any real number as an unique sequence of bits? Doesn't sound too hard when spelled like that. I could probably do that, win some prize (not anymore). Do they have anything else like that?
- v64 9y agoIf you've got some free time, can you look into whether or not the real part of every non-trivial zero of the Riemann zeta function is 1/2?
- thriftwy 9y agoCan you reword this one as a discrete math primer either?
- v64 9y agoLet d(n) be the sum of the divisors of n (for example, d(6) = 12 because 1, 2, 3, and 6 divide 6 and 1+2+3+6 = 12). Let h(n) be the nth harmonic number, that is, h(n) = 1 + 1/2 + 1/3 + ... + 1/n. Let ln(x) be the natural logarithm and let e be, well, e. Show that the inequality: d(n) <= h(n) + (ln(h(n)) * e^(h(n))) holds for all n >= 1. Best I can do, hope that works! [1] [1] http://www.theoremoftheday.org/NumberTheory/RobinLagarias/TotDRobinLagarias.pdf http://www.theoremoftheday.org/NumberTheory/RobinLagarias/To...
- deckar01 9y agoI did not know that this was an unsolved problem. It is quite paradoxical. You can map the subset of rational numbers in the range [0, 1) to the set of natural numbers, so there are an infinite number of disjoint subsets of the rational numbers that map to the natural numbers. Intuitively a 2nd dimension of infinity should be bigger, but the count of a set is defined to be one dimensional regardless of the dimensionality of the members. Edit: real -> rational
- threatofrain 9y agoAnother thing which has bothered me in the past was that a set of 2-tuple integers could be mapped by a set of 1-tuple integers, seemingly without any information loss.
- semi-extrinsic 9y agoSee Cantor's diagonalization argument for exactly how to do this mapping.
- rhart92 9y agoI am not sure if you have heard of them, but space-filling curves are a way to demonstrate this. This is a great video on the Hilbert curve https://www.youtube.com/watch?v=3s7h2MHQtxc https://www.youtube.com/watch?v=3s7h2MHQtxc
- kgwgk 9y agoThe "seemingly" suggests that you remain unconvinced. If you define for example some kind of distance between an arbitrary (x,y) and (0,0), for any (x,y) you can easily count how many points are closer to the origin. There may be ties but it's easy to define a rule to break them. This means you can order all the pairs of integers: (0,0), (1,0), (0,1), (-1,0), (0, -1), (1,1), (1,-1), (-1,-1), (-1,1), (2,0),....
- deleted 9y ago[deleted]
- 9y ago
- lngnmn 9y agoOh, more than one infinity in the same reality and no contradiction? What a wonderful world we live in.. More than one zero, more than one infinity, why not? More than on nothingness, more than one everything..
- abnry 9y agoI am having trouble grasping the result. As far as I understand it, any proof of any result has to be with respect to some axiom system. The continuum hypothesis result is that you cannot prove a infinity exists between the naturals and the real numbers under the usual axiom system A. How that was proved, I don't know, and I also don't know what axiom system was used in that proof. If the axiom system was also A, then it seems to me that it follows we cannot have p<t, and hence p=t, because otherwise by staying in the same axiom system A you violate the unprovability of the continuum hypothesis in A. This supplies a proof in A that p=t. But this seems trivial. So the axiom system used to prove that "the continuum hypothesis is unsolvable in A" must be a larger system A+. I think in A+ we again have p=t. The question this paper answers is whether we can prove "you cannot prove p=t using A" or "you can prove p=t using A". The latter means there is a straight up proof. Any people who really know this stuff can you comment if I got the gist right?
- v64 9y agoDisclaimer: I have a math background, but this isn't my field. The continuum hypothesis was proved to be independent of ZFC. From glancing at the first few paragraphs of the actual paper [2], it's been established for decades that the following inequality holds: aleph_1 <= p <= t, and that aleph_1 = p can be shown to imply aleph_1 = t. Note that the inequalities aren't strict inequalities, and this proof is essentially saying that they were equivalent all along. [1] https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_t... [2] https://arxiv.org/pdf/1208.5424.pdf https://arxiv.org/pdf/1208.5424.pdf
- clintonc 9y agoThe article is misleading on this point. The Continuum Hypothesis says that it is undecidable in the standard axioms whether there is a cardinality between countable and the continuum (i.e., the cardinality of the real). This work shows that p and t are different, which also means that t is of greater cardinality than the reals.
- samoright 9y agoWhat is p and t? You say that this work shows that p and t are different. What two entities are proven to be equal then in this work?
- arstin 9y agoI only had one one set theory course so can't vouch for the details, but this seemed like a well done article on a subject that could easily have been more eyeglazingly superficial or obscure.
- joshumax 9y agoMuch of my research on number theory and primality relies on a deep understanding in axiomatic set theory. Based on other news sites I've read that attempt to cover naive set theory, I was pleasantly surprised at the article's fairly decent coverage on the topic.
- thriftwy 9y agoBTW: Why then does wikipedia say that the cardinality of the set of all real numbers (denoted c and called cardinality of the continuum) is strictly greater than the cardinality of the set of all natural numbers (denoted ℵ 0 'aleph-naught')? UPD: I get it, they are actually talking about a third set in the article in a way that's not immediately apparent.
- schoen 9y agoThree things: First, this research didn't show that all infinities are equal, it just showed that two particular ones are equal. Indeed, in Cantor's formulation, the powerset of any set is larger than the original set, which immediately shows that there is no largest infinite set. Second, this research wasn't about ℵ₀ and c at all, but about another pair. Third, the issue about ℵ₀ and c isn't about whether they're equal, but whether there is or isn't a third infinity that's larger than ℵ₀ and smaller than c. It's already known that both answers (yes and no) are consistent with standard mathematical axioms. Edit: this result does have some connection with the continuum hypothesis, but I don't know exactly what that connection is. However, these researchers definitely didn't claim either to prove or disprove the continuum hypothesis.
- gwf 9y agoThe cardinality of the reals has been known to be strictly greater than the cardinality of the naturals since Cantor. What the Continuum Hypothesis considers is the cardinality of the reals and the cardinality of the power set of the naturals. The power set of another set is the set of unique subsets of the first set. If the first set has cardinality of N, then the power set has cardinality 2^N. Thus, the reals can be considered to be exponentially more dense than the naturals. Some intuition: while there may be N unique stocks on the NYSE, there could in theory be 2^N unique mutual funds that are based on the different combinations of stocks.
- samoright 9y agoCan you simplify for us what exactly have the mathematicians in this article proven? I get that they have proven some infinity A = some infinity B but can you tell us what these A and B are. Also, isn't the cardinality of reals equinumerous with that of the cardinality of the power set of naturals?
- samoright 9y ago> In a breakthrough that disproves decades of conventional wisdom, two mathematicians have shown that two different variants of infinity are actually the same size I thought there are only two types of infinity and Cantor already proved that they are different. * Uncountable infinity which is the cardinality of the set of real numbers * Countable infinity which is the cardinality of the set of integers Cantor has already proved that uncountable infinity is larger than countable infinity. Is this article claiming that mathematicians have proved that these two infinities are equal now? Doesn't that contradict Cantor's proof? What's going on here? Is the Cantor's proof flawed or have we introduced a contradiction to mathematics?
- bjl 9y agoNot all uncountable infinities are the same cardinality.
- samoright 9y agoSo does this article prove that two uncountable infinities are equal? Can you tell us precisely what two entities have been proven equal in this article? I understand aleph-0, aleph-1 and 2^aleph-0 and I also understand that if continuum hypothesis is true, then aleph-1 = 2^aleph-0. Is this what these mathematicians have proven, or have they proven something else?
- bjl 9y agoThe paper proves that the smallest cardinality of a set of integers (such that every finite subset has infinite intersections and has no almost-intersections) is equal to the smallest cardinality of a tower.
- abnry 9y agoIf you take the power set of an infinite set, you /always/ get a cardinality bigger than the original set. So there are an infinite number of infinities.
- 9y ago
- davidivadavid 9y agoIs it me or they forgot a step in the diagonalization argument? (adding/subtracting 1)
- ColinWright 9y agoThey say to change every number, and that's enough. Although they don't explicitly say so you can change each number in (nearly) any way you like.
- deleted 9y ago[deleted]
- davidivadavid 9y agoMy bad, skipped that part somehow.
- zelah 9y agoPlease answer me this one question: What is the average number of bits that are necessary to represent an arbitrary natural number? If the average number of bits is finite then I will shut up!
- adenadel 9y agoThis is equivalent to asking what is the average number of digits necessary to represent an arbitrary natural number. If you assume that this is a finite number you can quickly arrive at a contradiction.
- zelah 9y agoSo there are natural numbers with an infinite number of digits and that is my point. The average can't be larger than the largest number.
- ars 9y ago> necessary to represent an arbitrary natural number What makes you think this number exists? Infinities can not be added and divided this way. > The average can't be larger than the largest number. But it can be equal to it. You mistake is not realizing that infinity minus 1 = infinity. So the average is "smaller" than the largest, and yet equal to it. Because like I said at the start, you can not just add infinities in the normal way you can manipulate finite numbers.
- adenadel 9y agoThe only way to reason about this is as a limit. lim n->infty sum(1..n)/n. This limit diverges. Your intuition is breaking down. It might be useful for your understanding to study real analysis where these sorts of questions are handled rigorously.
- deifact 9y agoThe average of an infinite set isn't necessarily a meaningful thing to consider. For example, what is the average integer? Well, you could argue that the answer is 0 because you can pair off the positives and the negatives. On the other hand, you could also say it's 1: pair off 0 and 2, -1 and 3, -2 and 4, etc. Instead, the rigorous way to generalize the average is essentially to assign a probability to each member of the set, and compute the sum over the set of (n * p(n)), where p(n) is the probability of picking n, and the sum of all of the p(n) is 1. This is generally known as the 'expected value', and it has the property you want that the expected value of a set given a probability distribution is less than or equal to the maximum of the set. On the other hand, you can't set p(n) to the same value for every natural number, since the sum of p(n) has to be 1 (because it's a probability). But the sum of infinitely many copies of the same number between 0 and 1 is either 0 or infinite. So instead, you have to have some varying probability. For example, you might say you have have probability 1/2 of picking 1, 1/4 of picking 2, 1/8 of picking 3, and so on, halving the probability each time. And in that case, the average number of bits works out to be about 1.7. In fact, you can show that for any way of picking a natural number at random, the expected number of bits to represent it will be finite.
- gumby 9y agoPhotos of humans in an article about math are pretty useless but nevertheless I find it interesting that the article included a photo of the male collaborator, Saharon Shelah, and another male mathematician, but not one of the female collaborator, Maryanthe Malliaris.
- jkaoiyssrz 9y agoThere's no photo (of her) on her academic homepage or her own Web articles either. The obvious inference is that she doesn't supply photos to journalists.
- zimpenfish 9y agoThere’s a comment from the author below to say she specifically requested no photo.
- gumby 9y agoThanks, I overlooked that.
- deleted 9y ago[deleted]