Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Irrationality from small values of integer polynomials

Proved
Apery.irrational_of_eventually_exists_int_poly

by tomasz · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

formalizationirrationalitynumber-theoryzeta5-mo271

Let ξ∈R\xi\in\mathbb Rξ∈R, d:N→Nd:\mathbb N\to\mathbb Nd:N→N, and ε:N→R\varepsilon:\mathbb N\to\mathbb Rε:N→R. Assume that for every positive integer bbb,

bd(n)εn⟶0.b^{d(n)}\varepsilon_n\longrightarrow0.bd(n)εn​⟶0.

Suppose every sufficiently large nnn admits Q∈Z[X]Q\in\mathbb Z[X]Q∈Z[X] such that

deg⁡Q≤d(n),0<Q(ξ)≤εn.\deg Q\le d(n),\qquad 0<Q(\xi)\le\varepsilon_n.degQ≤d(n),0<Q(ξ)≤εn​.

Then ξ\xiξ 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.

Preamble
import Mathlib

open Polynomial Filter Topology MeasureTheory
Formal statement
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
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Criterion.lean#L40-L72
Read-back

What the Lean code literally says, in plain math · GPT-6 (Codex independent auditor)

For any real number ξ\xiξ, any function d:N→Nd:\mathbb N\to\mathbb Nd:N→N, and any function ε:N→R\varepsilon:\mathbb N\to\mathbb Rε:N→R, assume that for every positive natural number bbb the real sequence bd(n)ε(n)b^{d(n)}\varepsilon(n)bd(n)ε(n) tends to 000 as n→∞n\to\inftyn→∞, and assume that for every sufficiently large natural number nnn there exists a polynomial Q∈Z[x]Q\in\mathbb Z[x]Q∈Z[x] such that its natural degree is at most d(n)d(n)d(n) and 0<Q(ξ)≤ε(n)0<Q(\xi)\le\varepsilon(n)0<Q(ξ)≤ε(n), where evaluation embeds the integer coefficients in R\mathbb RR. Then ξ\xiξ is irrational, meaning that it is unequal to every rational number embedded in R\mathbb RR. The polynomial QQQ may depend on nnn. Natural degree is ordinary degree for a nonzero polynomial and is defined to be 000 for the zero polynomial; the strict positivity of Q(ξ)Q(\xi)Q(ξ) excludes that zero polynomial. If d(n)=0d(n)=0d(n)=0, an eligible QQQ must be a positive integer constant, so it cannot meet the inequalities when ε(n)<1\varepsilon(n)<1ε(n)<1. There is no separate sign hypothesis on ε\varepsilonε, although the eventual polynomial inequalities force ε(n)>0\varepsilon(n)>0ε(n)>0 for all sufficiently large nnn; the hypothesis for b=1b=1b=1 also requires ε(n)→0\varepsilon(n)\to0ε(n)→0. The quantifier on bbb excludes 000, and no polynomial condition is imposed on any particular finite initial segment of natural numbers.

Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tomasz · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me