5 ms·
X^2 is the sum of three periodic functions
- nmc 13y agoFun fact about considering R as a vector space over Q: the Hamel basis A mentioned in the post is not only infinite, but even uncountable.
- scotty79 13y agoI can see now why some mathematicians would like to do without axiom of choice.
- ColinWright 13y agoConsider the product of two sets, A and B: A x B = { (a,b): a in A, b in B } Pretty obviously if A and B are both non-empty, the product is non-empty. The axiom of choice says that this is still true even when you take the product of infinitely many sets. Without the axiom of choice, the product of infinitely many non-empty sets could be empty. Is that a better choice?
- scotty79 13y agoInfinty is unreal. Any formal intuition we build around it is free to choose. If you can imagine base of R then surely you can imagine infinite number of nonempty sets that have empty cartesian product. They might all be not empty but be sort of asymptotically empty, like probably not empty but with that probabiliy going to zero as number of sets goes to infinity. The question is, does any good physics come from the axiom of choice?
- ColinWright 13y ago> If you can imagine base of R then surely you can > imagine infinite number of nonempty sets that have > empty cartesian product. So you think it's OK to have infinitely may sets and not be able to choose one from each of them, even though they're all non-empty? That's a choice you're free to make, of course, but to me it seems more perverse than the alternatives. > The question is, does any good physics come from > the axiom of choice? Does it matter? Once you're dealing with uncountable infinities you're already outside physics and pursuing things because they're interesting, not because they have immediate practical implications. Of course, bits of pure math has a tendency to crop up and be useful decades later, and you never know which bits that will be.
- scotty79 13y agoWeird things happen when you go from "every" to "all" for uncountable infinities. Loosing ability to pick elements wouldn't be the weirdest. Physics matters. But since math is purely intelectual thing of course you are welcomed to pursue both paths. After all physics is not the only game we play. If someting is not useful in the real world it can be useful in virtual worlds we construct. All math is eventually applied math is a self fullfilling prophecy. Most mathematitians choose to accept axiom of choice because it makes lots of things easier and lots even possible. It isn't better in any other sense than the oposite.
- Tloewald 13y agoHow do you feel about well ordering the reals? Because the Axiom of Choice gives you that too and so much more. I'm not a zealot one way or another, but don't argue for it based on intuition, it plays both ways.
- ColinWright 13y agoAs the old joke goes: We all know that the Axiom of Choice is true, Well-Ordering of the Reals is false, and who knows about Zorn's Lemma. I use AC when I need it, avoid it when I can do without it, and sometimes look at what it allows versus what it implies.
- thaumasiotes 13y agoI've never really understood why the well-ordering theorem is the version of the axiom of choice that's supposed to be "obviously false". It's pretty trivial to see how you get it from the AC, and since the AC is "obviously true" I've always felt the well-ordering theorem is intuitive as well. (Actually, my mental model of the process generally leads me to want to think "all sets are countable"... c'est la vie :/ ) The Banach-Tarski theorem, on the other hand, is much more robustly "obviously false".
- jerf 13y ago"So you think it's OK to have infinitely may sets and not be able to choose one from each of them, even though they're all non-empty?" There's a lot hidden behind the word "choose". Of course I have no objection to you just grabbing whatever out of each set, but when you "choose" by performing an arbitrarily unbounded computation, it sounds less un-perverse. I am aware I've implicitly used a constructivist formulation by reference any sort of "computation". Personally I'm ambivalent about the axiom itself, I just think it should always be clear whether or not you've chose it, which is generally itself not a problem, so, generally I'm happy either way. It is the case that when you use the Axiom of Choice, you've just irretrievably left the physical universe, which is fine, but worth being aware of.
- thaumasiotes 13y ago> The question is, does any good physics come from the axiom of choice? In the first place, this isn't the question. In the second place, obviously, no good physics comes from the axiom of choice, just as no good physics comes from denying the axiom of choice. If there were any known practical applications, they would be mentioned as soon as you heard of the thing.
- pfortuny 13y agoInfinity is unreal... Well, it allows quite a few arguments concerning asymptotics of algorithms, for example. The "reality" of a concept is something on which many litres of ink and blood have been shee.
- scotty79 13y agoYes. We reason about infinities. But when it comes to result we are always interested in with what's well before it.
- adsche 13y ago> Without the axiom of choice, the product of infinitely many non-empty sets could be empty. This sounds like a stupid question, but I can't really figure it out: How could it be empty, given your above formula? (Math level: Engineer) Edit: Wait, is it because every set contains the empty set? And without choosing you could end up with the empty set?
- ColinWright 13y agoThis is what the axiom of choice is about. It says: Given a collection of non-empty sets, there exists a "choice function" that chooses one element from each set. (AC) The problem is, AC can be used to prove all sorts of counter-intuitive results. The example that turns up here on HN all the time is Banach-Tarski[0][1], but this submission about x^2 being the sum of three periodic functions is another. AC has been proven to be independent of the usual axioms of set theory, so in some sense you can choose whether to believe it or not. If it's true then Banach-Tarski is true. If it's false then you can have infinitely many non-empty sets with an empty Cartesian product. (corrected to read "an empty" instead of the error "a non-empty" - thanks thaumasiotes) Pure math be crazy. And cool. [0] http://en.wikipedia.org/wiki/Banach%E2%80%93Tarski_paradox http://en.wikipedia.org/wiki/Banach%E2%80%93Tarski_paradox [1] https://www.hnsearch.com/search#request/all&q=banach+tarski https://www.hnsearch.com/search#request/all&q=banach+tarski ---- Edit: No, it's not because of your edit: > ... is it because every set contains the empty set? > And without choosing you could end up with the empty set? Not every set contains the empty set as an element, but every set has the empty set as a subset. We are talking about choosing elements, and the it that says "non-empty set" means that for every individual set we can choose one of its elements. The problem comes in that when there are infinitely many, including possibly uncountably infinitely many, we need to do all these choices "at once" (in some sense).
- thaumasiotes 13y ago> If it's false then you can have infinitely many non-empty sets with a non-empty Cartesian product. with an empty Cartesian product, I think?
- 13y ago
- CJefferson 13y agoAs a (beginner) constructionist, the problem is not that the product "could be empty", but just that the product can't be constructed. I view this in a similar way to Russell's Paradox (while I'm not claiming the axiom of choice leads to a contradiction) -- we can define how we can construct new objects, and we can say you can't invoke the axiom of choice, but have to give an explicit choice function.
- Grue3 13y agoThis easily follows from the fact that R itself is uncountable. Otherwise it's trivial to enumerate all real numbers based on their decomposition.
- baking 13y agoCan someone who understands this please make a graph? Pics or it didn't happen.
- username42 13y agoDisclosure: the full article is a joke.
- ColinWright 13y agoWhy do you say that? Disclosure - the article is not a joke, but exploits the fact that when you think you have a definition that captures some intuitive concept, sometimes it allows things you didn't expect.
- nmc 13y agoSadly, there is no known method of constructing such a Hamel basis — but we know there is one contained in the Cantor set [1]. [1] http://en.wikipedia.org/wiki/Cantor_set http://en.wikipedia.org/wiki/Cantor_set
- adsche 13y agoHeads up: In section "A polynomial of degree n is the sum of n+1 periodic functions" it says 'cdots' in two formulas. (Probably a backslash missing in the TeX(?) source.)
- jbert 13y agoI think the thing which is defeating my intuition here is the continuity issue. "If a periodic function is continuous and nonconstant, then it has a least period, and all other periods are positive integer multiples of the least period." I think my naive intuition is modelling "periodic function" as "continuous and periodic". Basically, I'm not exercising the the full freedom of the "it's periodic" concept. There's a good Feynman anecdote on this (from Surely You're Joking...): ------ "I had a scheme, which I still use today when somebody is explaining something that I'm trying to understand: I keep making up examples. For instance, the mathematicians would come in with a terrific theorem, and they're all excited. As they're telling me the conditions of the theorem, I construct something which fits all the conditions. You know, you have a set (one ball)-- disjoint (two balls). Then the balls turn colors, grow hairs, or whatever, in my head as they put more conditions on. Finally they state the theorem, which is some dumb thing about the ball which isn't true for my hairy green ball thing, so I say "False!" [and] point out my counterexample." ------ So I think it's useful to consider the most extreme thing which meets your criteria, instead of a "representative" example. To come back to tech I think a similar mindset is also useful for things like system failure mode analysis. "Yes, but what if that switch dies at the same time...?"
- thaumasiotes 13y agoThey point out early in the text that the Dirichlet function is periodic (indeed, periodic with every rational number as a period). Considering that might help?
- Tloewald 13y agoThe Axiom of Choice defeats all intuition.
- deleted 13y ago[deleted]
- losvedir 13y ago> It is clear that a non-constant polynomial cannot be expressed as a finite sum of continuous periodic functions, But it can be expressed as an infinite sum of continuous periodic functions, right? I seem to remember that you could use all the sine functions as bases for the vector space of functions and (almost?) any function could be expressed as an infinite sum of sines. It's been a while since I've thought about these things, is that recollection correct?
- drob 13y agoYup! This is the basis for Fourier analysis: http://en.wikipedia.org/wiki/Fourier_analysis http://en.wikipedia.org/wiki/Fourier_analysis
- kayescercle 13y agoExcept that the author is referring to the entire domain (where a polynomial cannot be represented as a countably infinite sum of periodic functions), while a Fourier transform of a function has to be taken over a finite region like [a,b].
- deleted 13y ago[deleted]
- deleted 13y ago[deleted]
- gustavn4345 13y agoI'm pretty sure a Fourier _transform_ is over the entire domain while a Fourier _series_ is over a periodic function or finite region.
- ot 13y agoYes, but only on a finite open interval, that is (a, b) with a, b real numbers. In the post the sum of periodic functions is equal to x^2 on the whole real line. This is impossible with sums of continuous periodic functions, such as Fourier series, because continuous periodic functions are bounded, while x^2 is unbounded.
- deleted 13y ago[deleted]
- simias 13y agoIt's very interesting but why isn't there any practical example? What are the equations of three periodic functions that would add up to y = x^2 for instance? How would one even construct those three equations? If I'm not mistaken TFA demonstrates that these functions exist, not how to find them. I wish I hadn't stopped with maths in high school...
- impendia 13y agoBrief answer: the author invokes the Axiom of Choice, so the three equations will be really screwball and there will be no way to write them down explicitly. This is, in some sense, regarded as cheating. (The Axiom of Choice is generally accepted as a legitimate mathematical axiom, but not universally.) http://en.wikipedia.org/wiki/Axiom_of_choice http://en.wikipedia.org/wiki/Axiom_of_choice
- nmc 13y agoYou are right, the demonstration is only partially constructive. The functions are well defined: they are the canonical projectors of the Hamel basis. The trick is, the basis itself is not constructible.
- ufo 13y agoThere are no practical examples. The solutions are unbounded, discontinuous functions (that wont have nice equations) and since the proof uses the axiom of choice it is fundamentally non constructive (meaning you would need a totally different proof technique to be able to build a concrete solution)
- thaumasiotes 13y agoI can't quite follow your thinking here? > If I'm not mistaken TFA demonstrates that these functions exist, not how to find them. Completely correct. > why isn't there any practical example? You answer this yourself... the article demonstrates that the functions exist. It can't demonstrate the functions themselves; no one can do that.
- impendia 13y agoAnother fun (and seemingly nonsensical) thing you can prove if you use the Axiom of Choice: http://en.wikipedia.org/wiki/Banach-Tarski_paradox http://en.wikipedia.org/wiki/Banach-Tarski_paradox
- bitL 13y agoWhat is a neat characteristics of N^2 where N is integer is that its value is the sum of the first N odd integers. 1^2 = 1 2^2 = 1 + 3 = 4 3^2 = 1 + 3 + 5 = 9 4^2 = 1 + 3 + 5 + 7 = 16 ... I am wondering if there is a relation of this to the article.
- ufo 13y agoNot really. First of all, the article is about real-valued functions while your fact is only interesting for integers. Secondly, the article is about polynomials in general, meaning that the proof still works if you multiply everything by a constant factor and add terms of a lower degree. The reason this matters is that sum(i^k for i from 1 to N) will always be a polynomial of degree (k+1) and the only special thing about your sum in this case (not having a constant factor or lower order tems) is not something tha the proof in the article cares about.
- ColinWright 13y agoI hesitate to say this, but ... If you think this belongs on the front page of HN then you need to up-vote it. Any moment now it will trigger the flame-war detector, get a penalty in the ranking score, and disappear without trace. Anything with 40 comments and fewer points than comments gets such a penalty, and while it's a good proxy for flame-war detection, is does get quite a lot of false positives. If you want this to avoid that fate, you need to up-vote it. If you don't really care, then that's fine. I think it's interesting, but not everyone does. Added in edit - something has giving this item a penalty[0] - maybe there are people who've flagged it as inappropriate. Certainly it doesn't seem to have tripped the "flame-war" detector, but who can tell. [0] http://hnrankings.info/7056295/ http://hnrankings.info/7056295/
- thaumasiotes 13y ago> Anything with 40 comments and fewer points than comments gets such a penalty, and while it's a good proxy for flame-war detection Is this really true? There's a strong implication there that the typical HN account is more likely to upvote an article than to comment on one. I upvote comments all the time, and comment frequently, but I almost never upvote articles (though I did find this one to be a great mix of interestingness with accessibility).
- ColinWright 13y agoSee the section "Controversy" in this article: http://www.righto.com/2013/11/how-hacker-news-ranking-really-works.html http://www.righto.com/2013/11/how-hacker-news-ranking-really... Discussed at length here: https://news.ycombinator.com/item?id=6799854 https://news.ycombinator.com/item?id=6799854 One side-effect is that it's starting to stifle genuine discussion, as people decline to comment/reply for fear of an interesting item getting penalized off the front page.
- duaneb 13y agoI'm guilty of almost never upvoting articles—it's because I'm too lazy. Also the voting buttons are tiny. I actually do appreciate the reminder.
- 13y ago
- gpvos 13y agoIt was when the article introduced "Lebesgue measurable periodic functions" without any explanation whatsoever that I realized that I was not going to understand this article at all (at least not without spending a day on Wikipedia).
- pcvarmint 13y ago"By repeating this, we find that e^x is the sum of 1 periodic function. But this is absurd." No, it's not absurd. e^x is periodic with period 2 Pi I. Maybe the article was limiting itself to real functions and the existence thereof, but this example raised eyebrows.
- DerekL 13y agoThe first sentence: "A real function is said to be periodic if there exists a real number P > 0 so that f(x+P) = f(x) for all x." Complex numbers aren't mentioned at all.