Irrationality from small values of integer polynomials
ProvedApery.irrational_of_eventually_exists_int_polyLet , , and . Assume that for every positive integer ,
Suppose every sufficiently large admits such that
Then is irrational. No coefficient-height bound or monotonicity hypothesis is imposed. The positive evaluation excludes the zero polynomial. This is the general criterion consumed by the project's final irrationality argument.
import Mathlib open Polynomial Filter Topology MeasureTheory
namespace Apery
theorem irrational_of_eventually_exists_int_poly (ξ : ℝ) (d : ℕ → ℕ) (ε : ℕ → ℝ)
(hε : ∀ b : ℕ, 0 < b → Tendsto (fun n => (b : ℝ) ^ d n * ε n) atTop (𝓝 0))
(h : ∀ᶠ n in atTop, ∃ Q : ℤ[X], Q.natDegree ≤ d n ∧ 0 < aeval ξ Q ∧ aeval ξ Q ≤ ε n) :
Irrational ξ := by sorry
end Apery
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex independent auditor)
For any real number , any function , and any function , assume that for every positive natural number the real sequence tends to as , and assume that for every sufficiently large natural number there exists a polynomial such that its natural degree is at most and , where evaluation embeds the integer coefficients in . Then is irrational, meaning that it is unequal to every rational number embedded in . The polynomial may depend on . Natural degree is ordinary degree for a nonzero polynomial and is defined to be for the zero polynomial; the strict positivity of excludes that zero polynomial. If , an eligible must be a positive integer constant, so it cannot meet the inequalities when . There is no separate sign hypothesis on , although the eventual polynomial inequalities force for all sufficiently large ; the hypothesis for also requires . The quantifier on excludes , and no polynomial condition is imposed on any particular finite initial segment of natural numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.