Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am not able to prove that this set is dense in $\mathbb{R}$. Will be pleased if you help in a easiest way, $\{a+b\alpha: a,b\in \mathbb{Z}\}$ where $\alpha\in\mathbb{Q}^c$ is a fixed irrational.

share|cite|improve this question

closed as off-topic by user26857, Claude Leibovici, Jonas, choco_addicted, HK Lee Mar 23 at 12:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user26857, Claude Leibovici, Jonas, choco_addicted, HK Lee
If this question can be reworded to fit the rules in the help center, please edit the question.

    
This is Kronecker's approximation theorem. – Rudy the Reindeer Apr 25 '12 at 7:06
    
@Matt, the link is actually to a proof of a much stronger result, namely, to the uniform distribution (modulo $1$) of the sequence of multiples of an irrational. – Gerry Myerson Feb 14 '13 at 3:49
    
@GerryMyerson Is it confusing and therefore unhelpful? I'm happy to delete it if you think so. – Rudy the Reindeer Feb 16 '13 at 16:37
    
@Matt, I wouldn't worry about it. – Gerry Myerson Feb 16 '13 at 23:00
up vote 13 down vote accepted

I will write $\{x\}$ to mean the fractional part of $x$, i.e. for $x$ minus the floor of $x$. What we need to show is that we can get arbitrarily close to $0$ by taking $\{m\alpha\}$ for varying integers $m$. Note that, because $\alpha$ is irrational, $\{m\alpha\} \neq \{m'\alpha\}$ for $m \neq m'$.

Let's show that we can get within $1/n$ of $0$ for an arbitrary positive integer $n$. Divide up the interval $[0, 1]$ into $n$ closed intervals of length $1/n$. We have $n+1$ distinct quantities $0, \{\alpha\}, \{2\alpha\}, \ldots, \{n\alpha\}$.

By the pigeonhole principle, two of these, say $\{i\alpha\}$ and $\{j\alpha\}$ with $i > j$, lie in the same closed interval $[k/n, (k+1)/n]$, and so their difference, which is $\{(i - j)\alpha\}$, is closer than $1/n$ to $0$; as $n$ was arbitrary, we're done.

share|cite|improve this answer
3  
Could their difference be negative? – André Nicolas Apr 25 '12 at 18:37
    
This proof needs a bit more work. The difference can be negative, and the proof only shows the existence of one limit point. It is a good start though. My comment is late; I know. I came here from another question that got marked as duplicate of this. – Ayman Hourieh Jun 24 '13 at 0:57

Considering user29743's proof, after getting two such $i,j$ we can tell exist some $m\in\mathbb{Z}$ such that $m-\frac{1}{n}<(i-j)\alpha=k\alpha <m+\frac{1}{n}$. So now we can say for any $n$ exist $m,k \in \mathbb{Z}$ such that $|p-k\alpha|<\frac{1}{n}$. Now basically $n>k$. So from here we can conclude there exists infinitely many $q$'s such that $|\alpha-p/q|<1/q^2 \implies |q\alpha-p|<\frac{1}{q}$.

Now note as there are infinitely many $q$ so we can say partition $a,2a,3a,....,[\frac{1}{a}]a$ covers entire $(0,1)$ with length of each part being smaller enough, and any of $ia$ can be taken as a term of desired sequence. So around any ball of any $r\in (0,1)$ we'll get infinitely many terms, as a consequence its dense in $(0,1)$ as well as in $\mathbb{R}$

share|cite|improve this answer

Now I'll prove a general result.

Claim: Any additive subgroup of $\mathbb{R}$ is either discrete or dense in $\mathbb{R}$

Proof: Let $V$ be a discrete subgroup of $\mathbb{R}$. So there is a interval of form $(-a,+a)$ which contains finitely many points of $V$. So there exist a $v\in V$ such that $|v|\leq |x|$ for all $x\in V$.

So now, $v\mathbb{Z} \subset V$. Suppose there exist $c\in V$ but not in $v\mathbb{Z}$.Then after dividing $c$ by $v$ we'll get remainder of smaller mod value than $v$. Which contradicts property of $v$. So, $V=v\mathbb{Z}$. Hence we can say any discrete subgroup of $\mathbb{R}$ is of form $v\mathbb{Z}$.

So any non discrete subgroup is of form $\sum_{i=1}^{n} v_i \mathbb{Z}$. Now we need to show this is dense in $\mathbb{R}$.

This is equivalent to show $\mathbb{Z}+\sum_{i=2}^{n} v_i\mathbb{Z}$ is dense. And this clearly follows from above result, i.e $\mathbb{Z}+\alpha \mathbb{Z}$ is dense in $\mathbb{R}$

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.