Dirichlet's approximation theorem
ProvedFamousTheorems.exists_norm_nsmul_lemathlibnumber-theory
Dirichlet's approximation theorem. For any real and any there is with , distance measured to the nearest integer. Equivalently every irrational admits infinitely many rationals with . The proof is the pigeonhole principle applied to the fractional parts of , Dirichlet's original use of that principle in 1842. The exponent 2 is essentially optimal: Hurwitz sharpened the constant, and Liouville's theorem shows algebraic numbers cannot be approximated much better, which is where transcendence proofs begin. Formalization note. Stated on AddCircle, where the norm is distance to the nearest integer multiple. The result is Mathlib's AddCircle.exists_norm_nsmul_le.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
universe u_1 u_2 u_3 u_4 u_5 u_6 u_7 u_8 u_9 u_10 u_11 u_12 u_13 u_14 u_15 u_16 u_17 u_18 u_19 u_20 u_21 u_22 u_23 u_24 u_25
open Filter Set Topology DirectSum
theorem exists_norm_nsmul_le :
∀ {T : ℝ} [hT : Fact (0 < T)] (ξ : AddCircle T) {n : ℕ},
0 < n → ∃ j ∈ Icc 1 n, ‖j • ξ‖ ≤ T / ↑(n + 1) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests; formalized in Mathlib. Proof here reduces to the corresponding Mathlib result.