Cofinal progression count lower bounds imply positive mass
ProvedWikipedia.SzemeredisTheorem.HasCofinalPrimeWTrickedPrimeProgressionCountLower.toMassadditive-combinatoricsgreen-tao-port-8822number-theory
If the cofinal prime W-tricked prime-progression count-lower property holds, then the prime-progression mass property holds. Thus cofinal positive lower counts supply the positive off-diagonal progression mass used in the final extraction step.
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/ import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_ArithmeticProgression_Basic import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Assembly import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_CofinalPrimeModulusAssembly import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Geometry import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Independence import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Parameters import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_Chebyshev import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_ReducedResidues import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_WTrick import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_WTrickDensity import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CongruenceAverage import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CyclicMajorant import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ExceptionalPrimes import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_FourierZetaParameters import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_LinearFormsExpansion import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_LocalFactors import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_MultivariateFourierExpansion import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_SmoothCutoff import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_SmoothCutoffFourier import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_SmoothCutoffFourierProductTail import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_SmoothCutoffFourierTail import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_SmoothMajorant import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_TruncatedDivisorSum import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ZetaNearOne import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_Count import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_CountExtraction import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_ShortInterval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Statement import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.GCDMonoid.FinsetLemmas import Mathlib.Algebra.Group.Indicator import Mathlib.Algebra.Order.BigOperators.Group.Finset import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Analysis.Calculus.BumpFunction.InnerProduct import Mathlib.Analysis.Calculus.ContDiff.Deriv import Mathlib.Analysis.Calculus.Deriv.MeanValue import Mathlib.Analysis.Calculus.Deriv.Support import Mathlib.Analysis.Distribution.SchwartzSpace.Fourier import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Combinatorics.Pigeonhole import Mathlib.Data.Fintype.BigOperators import Mathlib.Data.Fintype.Card import Mathlib.Data.Fintype.Pi import Mathlib.Data.Int.Lemmas import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Prime.Defs import Mathlib.Data.Nat.Prime.Infinite import Mathlib.Data.Nat.Totient import Mathlib.Data.Real.Archimedean import Mathlib.Data.ZMod.Basic import Mathlib.GroupTheory.Index import Mathlib.LinearAlgebra.Pi import Mathlib.Logic.Equiv.Fin.Basic import Mathlib.MeasureTheory.Integral.Bochner.Set import Mathlib.MeasureTheory.Integral.IntegralEqImproper import Mathlib.MeasureTheory.Integral.Pi import Mathlib.MeasureTheory.Integral.Prod import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.NumberTheory.Chebyshev import Mathlib.NumberTheory.Divisors import Mathlib.NumberTheory.Harmonic.ZetaAsymp import Mathlib.NumberTheory.LSeries.Dirichlet import Mathlib.NumberTheory.Primorial import Mathlib.Order.LiminfLimsup import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Green--Tao assembly along cofinal prime moduli The transference layer uses invertibility of the nonzero progression coefficients and therefore naturally assumes that the cyclic modulus is coprime to `(k - 1)!`. Choosing an arbitrarily large prime modulus larger than `k` supplies that hypothesis. The previous assembly-facing predicate asked for a count lower bound at *every* sufficiently large modulus, which was stronger than both the proof and the transference theorem require. This file records the exact cofinal prime-modulus interface. Cofinality is enough for diagonal exclusion because the logarithmic diagonal estimate is eventual: simply choose the prime modulus after its threshold. The Chebyshev reduced-residue argument also holds at every sufficiently large modulus, so it restricts to the same cofinal prime family without loss. -/ open Wikipedia.SzemeredisTheorem open Filter /-! ## Cofinal prime count lower bounds -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.HasCofinalPrimeWTrickedPrimeProgressionCountLower.toMass
(hcount :
HasCofinalPrimeWTrickedPrimeProgressionCountLower) :
HasPrimeProgressionMass := by sorry
Source