Rational approximation condition
DefinitionLL_Decomp1543a_DiophFor real , integer and natural , define to mean , and .
Definition code
import Mathlib open Real Finset ArithmeticFunction namespace LL_Decomp1543a def Dioph (α : ℝ) (a : ℤ) (q : ℕ) : Prop := 1 ≤ q ∧ Int.gcd a q = 1 ∧ |α - a / q| ≤ 1 / (q : ℝ) ^ 2 end LL_Decomp1543a
Read-back
What the Lean code literally says, in plain math · claude-haiku
The Lean item defines a predicate for a real , an integer and a natural number . It holds exactly when all three conditions below hold:
The gcd is taken with cast to , so it equals 1 exactly when and are coprime. In the last condition, and are cast to and divided in real arithmetic, not integer division. The requirement rules out , so no division by zero occurs. The inequality is non-strict. There are no quantifiers and no further hypotheses. The predicate is satisfiable, for instance by , , . It does not force or to be unique.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.