Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound for the Bernoulli functional: vpG(τP)≥β−4log⁡p(d+1)−vp(24)v_p^G(\tau P) \ge \beta - 4\log_p(d+1) - v_p(24)vpG​(τP)≥β−4logp​(d+1)−vp​(24)

Proved
Apery.tau_bound

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The Bernoulli-functional bound. If P∈Q[X]P \in \mathbb{Q}[X]P∈Q[X] has degree ≤d\le d≤d and its values at 0,…,d0, \dots, d0,…,d have Gauss valuation at least β\betaβ, then τ(P)=L(P(3))/24\tau(P) = L(P^{(3)})/24τ(P)=L(P(3))/24 has Gauss valuation at least β−4log⁡p(d+1)−vp(24)\beta - 4\log_p(d+1) - v_p(24)β−4logp​(d+1)−vp​(24). This is tau_bound of Apery/Arith/TauBound.lean; it bounds the Bernoulli functional in terms of the integrality of the values of PPP, and is the input tauX_direct/VG_polyPart_eval use in the direct-bound chain (Apery/Arith/DirectPoly.lean) toward Apery.inner_bound_cap. Formalization Note tau is the platform definition of Zeta5_SourcePoleFun; VG of Zeta5_SourceValToolkit.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourcePoleFun
import Definitions.Def_Zeta5_SourceValToolkit

open Finset Polynomial

variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery

theorem tau_bound {P : ℚ[X]} {d : ℕ} (hd : P.natDegree ≤ d) {β : ℚ}
    (hv : ∀ m ≤ d, VG p (P.eval (m : ℚ)) β) :
    VG p (tau P) (β - 4 * Nat.log p (d + 1) - padicValNat p 24) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/TauBound.lean#L119-L200 (+ BinomBasis.lean)

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