In number theory, Dirichlet's theorem on Diophantine approximation, also called Dirichlet's approximation theorem, states that for any real numbers and , with , there exist integers and such that and
Here represents the integer part of .
This is a fundamental result in Diophantine approximation, showing that any real number has a sequence of good rational approximations: in fact an immediate consequence is that for a given irrational α, the inequality
is satisfied by infinitely many integers p and q. This shows that any irrational number has irrationality measure at least 2. This corollary also shows that the Thue–Siegel–Roth theorem, a result in the other direction, provides essentially the tightest possible bound, in the sense that the bound on rational approximation of algebraic numbers cannot be improved by increasing the exponent beyond 2. The Thue–Siegel–Roth theorem uses advanced techniques of number theory, but many simpler numbers such as the golden ratio can be much more easily verified to be inapproximable beyond exponent 2. This exponent is referred to as the irrationality measure.
The simultaneous version of the Dirichlet's approximation theorem states that given real numbers and a natural number then there are integers such that
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. The method extends to simultaneous approximation.
Proof outline: Let be an irrational number and be an integer. For every we can write such that is an integer and .
One can divide the interval into smaller intervals of measure . Now, we have numbers and intervals. Therefore, by the pigeonhole principle, at least two of them are in the same interval. We can call those such that . Now:
Dividing both sides by will result in:
And we proved the theorem.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number a/b is a "good" approximation of a real number α if the absolute value of the difference between a/b and α may not decrease if a/b is replaced by another rational number with a smaller denominator.
The main theme in Diopahntine approximation is to approximate a real number by a rational number with a certain denominator bound. The course covers the case of one real number, that is classical and
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
We cover the theory and applications of sparse stochastic processes (SSP). SSP are solutions of differential equations driven by non-Gaussian innovations. They admit a parsimonious representation in a
Many engineering fields rely on frequency-domain dynamical systems for the mathematical modeling of physical (electrical/mechanical/etc.) structures. With the growing need for more accurate and reliable results, the computational burden incurred by frequen ...
Signal processing tools are presented from an intuitive geometric point of view which is at the heart of all modern signal processing techniques. The student will develop the mathematical depth and rigour needed for the study of advanced topics in signal p ...
2021
, ,
This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...