Math 2.0

statement theorem

Dirichlet's approximation theorem

Statement

Let α\alpha be a real number and let NN be a positive integer. Then there are integers pp and qq with 1≤q≤N1 \le q \le N and ∣qα−p∣≤1N+1.|q \alpha - p| \le \frac{1}{N + 1}.

Remarks

A corollary: if α\alpha is irrational, then ∣α−pq∣<1q2\left| \alpha - \frac{p}{q} \right| < \frac{1}{q^2} for infinitely many fractions p/qp / q. The proof uses the pigeonhole principle. Among the N+1N + 1 fractional parts of 0,α,2α,…,Nα0, \alpha, 2\alpha, \dots, N\alpha, two lie in one of N+1N + 1 intervals of length 1N+1\frac{1}{N + 1}. The convergents of the continued fraction of α\alpha give such fractions explicitly.

Explanations

L1 human

Each real number has fractions p/qp/q very close to it, with an error much smaller than 1/q1/q. The theorem gives the bound 1/q21/q^2 for infinitely many denominators when α\alpha is irrational.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Dirichlet%27s_approximation_theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Dirichlet%27s_approximation_theorem, Proof by the pigeonhole principle