Documentation

LeanPool.Zeta32.PrimeEdge.Distribution

S2b-1: the proof notes, Lemma 1 / Corollary 2 (the p-adic distribution formula for U_r), in the truncated rational form used by §6.

Exact statement behind it (in ℚ_p): U_r(f) = p^{-2} Σ_{b<p} V_Y(g_b) with Y = p³X + C_p, C_p ∈ p³ℤ_p. Taking the X-free part, the difference between (Lfun r n A).coeff 0 and p^{-2} Σ_b discLocal r n p b A consists of

proof (files Dist/*). No ℚ_p constants are needed. Write t A = P · D_{5n} + ∑_j c_j D_{5n}/(t+j) (XA_pf); both sides are linear in the numerator.

theorem Zeta32.PrimeEdge.nearS_lt {p : ℕ} [hp : Fact (Nat.Prime p)] {n : ℕ} (hn : 5 * n < p ^ 2) (b m : ℕ) :
m ∈ nearSet n p b → m < p
theorem Zeta32.PrimeEdge.VG_inv_sub {p : ℕ} [hp : Fact (Nat.Prime p)] {j b : ℕ} (hb : b < p) (hjb : j % p ≠ b) :
Zeta5Irrational.VG p (↑j - ↑b)⁻¹ 0
theorem Zeta32.PrimeEdge.VG_Err_Ej {p : ℕ} [hp : Fact (Nat.Prime p)] {n : ℕ} (hn : 5 * n < p ^ 2) {r : ℚ} (hr : Zeta5Irrational.VG p r 0) {j : ℕ} (hj : j ∈ Finset.Icc 1 (5 * n)) :
Zeta5Irrational.VG p (Err r n p (Ej (Finset.Icc 1 (5 * n)) j)) (-2)

The error on one simple pole has valuation ≥ -2.

theorem Zeta32.PrimeEdge.distribution_trunc {p : ℕ} [Fact (Nat.Prime p)] {n : ℕ} (hn1 : 1 ≤ n) (hn : 5 * n < p ^ 2) {r : ℚ} (hr : Zeta5Irrational.VG p r 0) {A : Polynomial ℚ} {e : ZMod p → ℤ} (hA : Arith.Local.Adm p A e) (hdeg : A.natDegree + 2 ≤ 10 * n) (β : ℚ) (hβ : ∀ (γ : ZMod p), β ≤ (↑(e γ) + if γ = 0 then 1 else 0) - ↑(Arith.Local.plc p (Arith.Local.Pl5 n) γ).card) :
Zeta5Irrational.VG p ((Arith.Local.Lfun r n A).coeff 0 - ↑p ^ (-2) * ∑ b ∈ Finset.range p, discLocal r n p b A) (β - 1)

S2b-1 (truncated distribution formula). Hypotheses as in Lfun_GV.