Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The pairing lemma: two remaining poles a,p−aa, p-aa,p−a give an integral contribution

Proved
Apery.pair_GV

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The pairing lemma (4.5). Let 3≤p3 \le p3≤p, 1≤a<p1 \le a < p1≤a<p with a≠p−aa \ne p - aa=p−a, let MMM be a multiset of integers containing every i∈[1,K]i \in [1, K]i∈[1,K] with i≠a, p−ai \ne a,\ p-ai=a, p−a, and suppose the residue resK(tpol M)(p−a)res_K(tpol\,M)(p-a)resK​(tpolM)(p−a) has valuation ≥−1\ge -1≥−1. Then resK(tpol M)(a)⋅poleValue(a)+resK(tpol M)(p−a)⋅poleValue(p−a)res_K(tpol\,M)(a)\cdot poleValue(a) + res_K(tpol\,M)(p-a)\cdot poleValue(p-a)resK​(tpolM)(a)⋅poleValue(a)+resK​(tpolM)(p−a)⋅poleValue(p−a) is ppp-integral in the Gauss valuation. This is pair_GV of Apery/Arith/OuterEntries.lean: the two remaining poles of the same class in the outer-range entry contribute an integral amount. It is used by the pole case analysis of Apery.outer_entry.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourceInner
import Definitions.Def_Zeta5_SourceOuter
import Definitions.Def_Zeta5_SourcePoleFun
import Definitions.Def_Zeta5_SourcePullback
import Definitions.Def_Zeta5_SourceValToolkit

open Finset Polynomial
Formal statement
namespace Apery

theorem pair_GV {p : ℕ} [hp : Fact p.Prime] (hp3 : 3 ≤ p) {K : ℕ} (M : Multiset ℤ) {a : ℕ}
    (ha1 : 1 ≤ a) (hap : a < p) (hne : a ≠ p - a) (haK : a ≤ K) (hbK : p - a ≤ K)
    (hroots : ∀ i ∈ Icc 1 K, i ≠ a → i ≠ p - a → (i : ℤ) ∈ M)
    (hres : VG p (res K (tpol M) (p - a)) (-1)) :
    GV p (C (res K (tpol M) a) * poleValue a +
      C (res K (tpol M) (p - a)) * poleValue (p - a)) 0 := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/OuterEntries.lean#L202-L279

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