Kodi Arfer / Wisterwood

A proof of Chris's signature

Topic List
#001 | Kodiologist |
From: UtarEmpire
x is an irrational number if and only if the set { nx mod 1 | n is a natural number } is dense in [0,1].

Let x be real and A = { nx mod 1 | n natural }.

Suppose x is rational. Then x = a/b for some integers a, b. Thus bx mod 1 = 0, so |A| <= b, so A is finite and hence can't be dense in [0, 1]. Contrapositively, if A is dense in [0, 1], x is irrational.

Suppose x is irrational and suppose for contradiction that A is not dense in [0, 1]. Then there exist y in [0, 1] and e > 0 such that the open e-ball about y is a subset of [0, 1] that's disjoint from A. Pick the least natural n such that nx > 1 and consider the sequence

y, (y - nx) mod 1, (y - 2nx) mod 1, (y - 3nx) mod 1, ...

(I define "p mod 1" for real p < 0 to mean "the least real z >= 0 such that a - z is an integer".) Clearly, the distance between each pair of adjacent elements (call it d) is the same. Then given a sufficiently long prefix of this sequence (say, of the first ceiling(1/min(e, d)) elements—don't make me calculate an exact length, just agree that it exists), the e-balls about the elements cover [0, 1]. Thus one of these balls includes x. But this contradicts the choice of e and y, since it implies that there exists m such that (mx mod 1) is in the open e-ball about y. Thus, A is dense in [0, 1]. QED.

So what do I win?

---
He lives in cyberspace and wants to destroy the network system.
#002 | Smithy04 |
*stares for a few minutes*

*begins a slow clap*
---
Smithy/Freepizza/Heydude/Monty/Shadowspy
#003 | HeyDude |
*builds clap up slightly*
#004 | UtarEmpire |
You win nothing. Proving things is its own reward.
---
x is an irrational number if and only if the set { nx mod 1 | n is a natural number } is dense in [0,1].
#005 | Kodiologist |
[This message was deleted at the request of the original poster]
#006 | Kodiologist |
Fair 'nuff. I just kept reading your signature and thinking "I ought to be able to prove that." I'm glad I finally got around to it.

I am curious to know how much your proof resembles mine. I had an awful lot of false starts before I came up with this method, but I imagine some of my original ideas (like seeing if, given the binary expansion of x, one can construct a new number with a given finite string of 0s and 1s using only the operations of left shift and adding x) would've worked if I'd known how to fully develop them.

---
He lives in cyberspace and wants to destroy the network system.