Content deleted Content added
Citation bot (talk | contribs) Add: s2cid. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 370/493 |
m →Method of proof: Spelling/grammar/punctuation/typographical correction |
||
Line 17:
==Method of proof==
===Proof
This theorem is a consequence of the [[pigeonhole principle]]. [[Peter Gustav Lejeune Dirichlet]] who proved the result used the same principle in other contexts (for example, the [[Pell equation]]) and by naming the principle (in German) popularized its use, though its status in textbook terms comes later.<ref>http://jeff560.tripod.com/p.html for a number of historical references.</ref> The method extends to simultaneous approximation.<ref>{{Springer|id=d/d032940|title=Dirichlet theorem}}</ref>
'''Proof
One can divide the interval <math>[0, 1)</math> into <math>n</math> smaller intervals of measure <math>\frac{1}{n}</math>. Now, we have <math>n+1</math> numbers <math>x_0,x_1,...,x_n</math> and <math>n</math> intervals. Therefore, by the pigeonhole principle, at least two of them are in the same interval. We can call those <math>x_i,x_j</math> such that <math>i < j</math>. Now:
Line 31:
And we proved the theorem.
===Proof
Another simple proof of the Dirichlet's approximation theorem is based on [[Minkowski's theorem]] applied to the set
|