Channel Scalar twice prime
ProvedErdosProblems.Erdos68.PaperComplete.channelScalar_twice_primeerdos-68factorial-momentformalization
At twice a prime p, the scalar equals minus twice the channel weight at divisor two.
Preamble
import Definitions.Def_ErdosProblems_Erdos68_FactorialChannelCertificate import Definitions.Def_ErdosProblems_Erdos68_DivisorChannelBasis import Definitions.Def_ErdosProblems_Erdos68_PaperCompleteMomentHorizon import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Finsupp.Basic import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.GCDMonoid.Finset import Mathlib.Combinatorics.Enumerative.Bell import Mathlib.Data.Finsupp.Basic import Mathlib.Data.Finsupp.SMul import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Choose.Multinomial import Mathlib.Data.Nat.GCD.Prime import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Rat.Lemmas import Mathlib.NumberTheory.Divisors import Mathlib.RingTheory.Coprime.Lemmas import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.NormNum.NatFactorial import Mathlib.Tactic.Ring /-! # The actual factorial specialisation of the quadratic tail-gcd theorem Short-note label: res:finite-channel-moment-certificate. This file does not assume a recurrence for an arbitrary sequence or assume unordered-block divisibility. It derives the recurrence for U_n(1) from the supplied definition and obtains the block identity from Mathlib's Nat.uniformBell_mul_eq. The gcd of an infinite family is represented by its universal property (all common divisors), avoiding an arbitrary choice of a generator in Z. This is the exact gcd assertion, not a weaker bound. STATUS: compiled proof candidate. No new axioms, no proof placeholders. -/ open scoped BigOperators open ErdosProblems.Erdos68.PaperComplete
Formal statement
theorem ErdosProblems.Erdos68.PaperComplete.channelScalar_twice_prime {p : ℕ} (hp : p.Prime) :
channelScalar (2 * p) = -2 * (channelWeight (2 * p) 2 : ℤ) := by sorry
Source
Pinned Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/fcb1eff5111efabc25fcf3dfcd6ec48d42ef345c/ErdosProblems/Erdos68/PaperCompleteMomentHorizon.lean#L108-L129
Correspondence: finite channel-moment analysis for Erdős #68. No novelty or whole-problem claim.