4 ms·
Trapping A Transcendental - Finding numbers that aren't solutions to polynomials
- ColinWright 13y agoI've found at least one typo in this, there may be more. Before I fix it, what's the easiest way (other than BitCoin) to offer a reward to people who find errors?
- cperciva 13y agoI find that crediting bug bounties to Tarsnap accounts works well. ;-)
- ColinWright 13y ago<fx: grin /> Sadly, not everyone has a tarsnap account to which a bounty can be so credited. But nice try. On a different note, I'd be interested in your comments on this item (and others). If you would care to email me your thoughts I'd be grateful. I could even credit your tarsnap account ...
- samirmenon 13y agoThere is an issue here: "1.x-1=0 giving x=-1" Should be "giving x=1"
- ColinWright 13y agoFixed! Thank you. Now, how can I buy you a coffee? Added in edit: Downvote?!? Who would downvote this comment? Bizarre ... <fx: Departs, stage right, shaking head in confusion />
- goldenkey 13y agoJust be grateful. I don't think anyone here wants anything for trivial corrections, the fact that you posted an interesting article is more than enough fish for us to eat.
- ColinWright 13y agoExcept that where possible, I use this as an opportunity to meet interesting people. And it's not a question of people wanting anything in return for such corrections, it's more, for me, the point that I'm delighted when someone will interact with and actually help to improve the material. You might be right, but I still find it very very odd.
- samirmenon 13y agoNo coffee necessary, actually, but if you'd like to chat with me sometime, I could shoot you an email.
- ColinWright 13y agoHappy to be in touch. Cheers!
- spodek 13y agoNormally I wouldn't look for such things, but since you mention it, there is a period missing at the end of the bullet point "Then we need to know what we mean by "a sequence that looks like it should converge"" Also, at the end of "Later: Build a sequence" In later bullets too: "We can list them", for example.
- ColinWright 13y agoAll fixed - thank you. I wouldn't normally worry about every last detail of punctuation, especially in lists and/or bullet points, but your comment is perfectly valid, and of value. So, how can I buy you a coffee?
- deleted 13y ago[deleted]
- gjm11 13y agoTypo: "because there is only one soution" (should be "solution"). I don't like coffee, but you're welcome to buy me a glass of tap water the next time we meet :-).
- ColinWright 13y agoFixed - thanks. I've now lost the one I first saw, so there are more to be found.
- mnx 13y agoThe biggest problem I had with this, was convincing myself this method does list ALL the algebraics. Otherwise a great read.
- Tloewald 13y agoAll orderings of the rationals / algebraics / etc. are counterintuitive.
- deleted 13y ago[deleted]
- ColinWright 13y agoActually, the Calkin-Wilf tree[0] for enumerating the positive rationals is really very good. [0] http://en.wikipedia.org/wiki/Calkin%E2%80%93Wilf_tree http://en.wikipedia.org/wiki/Calkin%E2%80%93Wilf_tree
- Tloewald 13y agoCute yes. Clever yes. Intuitive?
- moomin 13y agoFor extra craziness: you can extend the list argument to list all (finite) programs that produce increasing but bounded sequences. We'll call this the computable numbers. The transcendental number described in the article is computable. But as I've just mentioned, the computable numbers are still countable. This really hurts my head. There's an uncountable set of numbers that aren't expressible in any closed form whatsoever. Continuous numbers get weirder the harder you look at them.
- ColinWright 13y agoProblem there is you have to list all finite terminating programs that produce increasing bu bounded sequences. Then you start to have to worry about being really, really careful in your definitions. See here: https://news.ycombinator.com/item?id=6967954 https://news.ycombinator.com/item?id=6967954 That's a classic "paradox" being created by having insufficient care in the definitions. But yes, most (in a technical sense) reals can't be described or computed, and yes, the reals get more and more weird the harder you look at them. In some sense you never really understand them, you just get used to them. Mostly.
- poizan42 13y agoI don't see the problem here. It shouldn't be a surprise that listing the computable numbers is itself uncomputable as it is equivalent to the halting problem - to determine whether an algorithm will either keep on producing new decimals or halt at some point is clearly undecidable. It's when you introduce things as constructible/defineable numbers that things gets hairy.
- Tloewald 13y agoUm, what? There are two well-known arguments from Cantor: http://en.wikipedia.org/wiki/Cantor's_first_uncountability_proof http://en.wikipedia.org/wiki/Cantor's_first_uncountability_p... http://en.wikipedia.org/wiki/Cantor's_diagonal_argument http://en.wikipedia.org/wiki/Cantor's_diagonal_argument Describing the sequence at the end as something that seems like it should converge is a bit unconvincing -- it's a sequence explicitly defined not to land on an algebraic number. So the argument is that if you assume you can always pick an interval that doesn't contain a specified algebraic you won't land on an algebraic. This is hardly surprising and kind of presupposes the result. And why divide the interval into thirds? This seems to be a result of confusing a different Cantor proof (that the measure of the rationals/algebraics in [0,1] is zero, which involves dividing things into thirds) with the first proof. If we accept the argument at all I don't see how it requires three intervals at each step. At most one interval can contain the posited nth algebraic, so you've always got the other interval. So it's like a mixture of two badly remembered proofs :-)
- backlava 13y agoThe proof constructs a monotone bounded sequence. It thus converges. Dividing into three intervals is to rule out the case where both (closed) intervals contain the point.
- Tloewald 13y agoRight. There's no reason for the intervals to be closed that I can see.
- ColinWright 13y agoYou're right, there isn't, but when you use open intervals you'd be surprised how many people get worked up over the fact that some of the points have been omitted. It's easier to avoid the question entirely. It tends only to be people who already know a lot about this that come up with the objections or comments you're making, and usually they realise that actually, yes, it all works.
- 13y ago
- graycat 13y agoSo, he likes what is known as the completeness property of the reals. Good. Glad he likes that! One remark is "Calculus is the elementary consequences of the completeness property of the reals.". And, yes, calculus is nice stuff. Newton did nice things with calculus but may not have understood the completeness property, i.e., just took it for granted that his derivatives and integrals did yield numbers. Some of what is true about the reals is bizarre, nearly beyond belief, e.g., as in Oxtoby, Measure and Category. The main reason for being careful with fine details going from the natural numbers to the integers, rationals, algebraics, and reals is a theme that started near 1900 of trying to clean up the logical basement of mathematics and, there, build everything on just sets so that, if believe in sets, then could believe in everything that could be based on sets, that is, hopefully all of mathematics. This goal seemed okay for about 10 minutes until B. Russell thought of the set A = {x|x is not an element of x} so that A is an element of A if and only it is not. Bummer. Seventy years later the gods of axiomatic set theory came out with a lot of work that made set theory look more solid. Okay, that's curious work, and on a good day with four quarters will cover a $1 cup of coffee.
- Tloewald 13y agoThere was an article linked yesterday (sorry, don't have the link) which discussed the Reals in considerably more detail and sidetracked into a reformulation of the Reals that rigorously allows for Newton's infinitesimals without being "complete" in the "least upper bound" sense (and indeed, depending on the classes of functions you care about, doesn't even require an uncountable set).
- graycat 13y agoMy view is that infinitesimals were a mistake, a long, festering sore in math and some of its applications. Can think intuitively about infinitesimals if you want, but I see no need to mess up the now very clean situation on the foundations of the reals. Indeed, as a grad student, I had some results and went to see a world famous prof to show him what I had and ask him if my work seemed new to him. At one point he suggested an improvement, and, curiously, as a high end pure mathematician in analysis did his first cut, intuitive reasoning in terms of infinitesimals! Fine. But Dedekind cuts, Cauchy sequences, etc. make a rock solid foundation for the reals, and now can we just get on with, say, Fourier theory and the rest of analysis and their applications?
- laurentoget 13y agoMaybe i am nitpicking but the existence of transcendentals was proven by Liouville 30 years before Cantor brought up the considerations about countability. (disclaimer liouville was the advisor of the advisor of the advisor of the advisor of the advisor of the advisor of my advisor) Also if you like that sort of things you would like http://amzn.com/0201038129 http://amzn.com/0201038129 Nearly 30 years ago, John Horton Conway introduced a new way to construct numbers. Donald E. Knuth, in appreciation of this revolutionary system, took a week off from work on The Art of Computer Programming to write an introduction to Conway's method. Never content with the ordinary, Knuth wrote this introduction as a work of fiction--a novelette. If not a steamy romance, the book nonetheless shows how a young couple turned on to pure mathematics and found total happiness.
- ColinWright 13y agoIndeed, Liouville proved the existence of transcendentals, exhibiting specific numbers as examples. That was around the 1840s. Cantor showed in 1874 that pretty much every real number is transcendental, and the linked article is a re-casting/adaptation of one version of that paper. Although it shows how to construct a transcendental, it really shows that every list of numbers is incomplete. Taking the algebraics as the list then gives the result. And I actually have a copy of "The Surreal Numbers". Still working on how it/they can be presented to a non-technical audience.
- stephencanon 13y agoBoth "Surreal Numbers" and "On Numbers and Games" do a not-terrible job of presenting surreal numbers to a (relatively) non-technical audience.
- ColinWright 13y agoNot convinced. I've tried to follow their presentations when talking about these topics with different audiences and found that people really just don't follow. There's a difference between teaching material and exposing people to it - both of those works try to teach the topic to people, which isn't really appropriate in a single lecture format, or a math club, or a masterclass.
- CurtMonash 13y agoIf all we want to do is prove the existence of transcendental numbers, rather than construct them, that follows as soon as we know: 1. Algebraic numbers are countable. 2. Real numbers aren't countable. #1 is easy -- the number of polynomials with rational coefficients is obviously countable, and they have finitely many real roots each. So pick your favorite proof of #2 and you're done.
- deleted 13y ago[deleted]
- ColinWright 13y agoTrue. And in truth, the linked article is my favorite proof of #2. And that's the point. This proof is really showing the uncountability of the reals - nowhere does it use any property of the algebraics other the fact that they're countable.
- CurtMonash 13y agoSpivak's Calculus contains a 3-page proof that e is transcendental. I didn't work through it, but it's unsurprisingly based on the famous series expansion of e.