0
$\begingroup$

Let $x \in \mathbb{R} \backslash \mathbb{Q}, x>0$ and $q \in \mathbb{N}, q>0$, prove that there is an $r \in \mathbb{N}, r>0$ with: $r \cdot x - \left\lfloor r \cdot x \right\rfloor < \frac{1}{q}$ or $1-(r \cdot x - \left\lfloor r \cdot x \right\rfloor) < \frac{1}{q}.$

I was given the hint to divide the sequence $a_r := r \cdot x - \left\lfloor r \cdot x \right\rfloor \in [0,1)$ into q intervals $[0,\frac{1}{q}),[\frac{1}{q},\frac{2}{q}),\ldots,[\frac{q-1}{q},1)$ and use the pigeonhole principle, but I cannot see how this would help to the problem.

  • 0
    @TCL The notation $\lor$ means "or" (rather than "join" or "maximum").2010-11-15

2 Answers 2

2

Write $\{ x\}$ for $x-\lfloor x\rfloor$.

  1. Prove that $\{ rx\}$ for $r=0,1,\cdots,q$ are all distinct. (Here is where you use the condition that $x$ is irrational.)
  2. Using pigeonhole principle, find integers $r,s, 0\le r such that
    $\{ sx \},\{ rx\}$ belong to the same subinterval.
  3. Then prove that $s-r$ is your solution.
0

Let's use the notation $\{x\} = x - \lfloor x \rfloor$. We can think of $\{\cdot\}$ as a function $\mathbb{R} \longrightarrow \mathbb{R}/\mathbb{Z}$, indeed a homomorphism of groups (with addition as the group operator). That means that $\{x + y\} = \{x\} + \{y\}$, or what matters more in your case, $\{x - y\} = \{x\} - \{y\}$.

Now suppose $\{r_1x\},\{r_2x\}$ are close, what does this say about $\{(r_1-r_2)x\}$?

  • 0
    @user3123 All the computations are modulo 1. A small negative number is physically a number very close to 1.2010-11-15