Lean source theorem: primitive_zero_density_multiplier_irreducibility
ProvedErdosProblems.Erdos243.PaperCompleteR11.primitive_zero_density_multiplier_irreducibilityerdos-243support-lemma
For a positive natural scale m, an integer constant c and a primitive natural recurrence with positive tail denominators, if disagreements with m times the rising binomial coefficient plus c have zero lower density, then c=±1; every tail multiplier is coprime to its denominator; distinct tail multipliers are pairwise coprime; multipliers exceed 1 arbitrarily late; arbitrarily large primes divide arbitrarily late multipliers; and X³−X+6c/m is irreducible over ℚ.
Preamble
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR11_CubicSquareCoordinates
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR11_CubicFieldCoordinates
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR9_PolynomialCorrections
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR11_WindowIncidence
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR11_CubicIntegralNormalisation
import Definitions.Def_ErdosProblems_Erdos243_PaperCompleteR11_CubicZeroDensityShape
import Mathlib
import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset
import Mathlib.Algebra.Polynomial.SpecificDegree
import Mathlib.Algebra.Ring.Basic
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.Data.Fin.Pigeonhole
import Mathlib.Data.Int.GCD
import Mathlib.Data.Nat.ChineseRemainder
import Mathlib.Data.Nat.Choose.Basic
import Mathlib.Data.Nat.Find
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Rat.Defs
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.QuotientRing
import Mathlib.Order.Filter.AtTopBot.Basic
import Mathlib.RingTheory.PowerBasis
import Mathlib.Tactic
import Mathlib.Tactic.Ring
open ErdosProblems.Erdos243.PaperCompleteR11
Formal statement
theorem ErdosProblems.Erdos243.PaperCompleteR11.primitive_zero_density_multiplier_irreducibility
(a u v : ℕ → ℕ) (m : ℕ) (c : ℤ) (T : ℕ) (hm : 0 < m)
(hv : ∀ n, T ≤ n → 0 < v n)
(hnum : ∀ n, T ≤ n → u (n + 1) + v n = a n * u n)
(hden : ∀ n, T ≤ n → v (n + 1) = a n * v n)
(hcop : ∀ n, T ≤ n → Nat.Coprime (u n) (v n))
(hzero : ZeroLowerDensity {n : ℕ | (u n : ℤ) ≠ (m : ℤ) * risingBinomial n + c}) :
(c = 1 ∨ c = -1) ∧
(∀ n, T ≤ n → Nat.Coprime (a n) (v n)) ∧
(∀ i j, T ≤ i → T ≤ j → i ≠ j → Nat.Coprime (a i) (a j)) ∧
(∀ N, ∃ n, max T N ≤ n ∧ 1 < a n) ∧
(∀ B N, ∃ p j : ℕ, Nat.Prime p ∧ B < p ∧ max T N ≤ j ∧ p ∣ a j) ∧
Irreducible (cubicScalePolynomial (6 * (c : ℚ) / (m : ℚ))) := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/4fe59e0191169606942baae0949365070b7f419c/ErdosProblems/Erdos243/PaperCompleteR11/PrimitiveMultiplierSupply.lean#L206-L239
Related paper by Will Cook (CC-BY-4.0): https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/243/erdos-243-reciprocal-tail-rigidity.tex#L1-L58
Paper's AI-assistance disclosure: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/paper-house-style.sty#L180-L188
Original Erdős problem and Koizumi prior work are distinguished in the paper: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/243/erdos-243-reciprocal-tail-rigidity.tex#L57-L110