Positive prime progression mass
DefinitionGreenTaoPort_Wikipedia_GreenTao_Assemblyarithmetic-progressionsgreen-tao-port-8822number-theory
This predicate records the positive off-diagonal mass needed to extract prime progressions. For every integer length , it asks for natural parameters and a real scale with and , such that the -term off-diagonal progression mass of the corresponding -tricked prime weight on is positive.
The parameter specifies the affine values , and is a nonzero cyclic modulus. This predicate itself does not require the modulus to be prime or the residue to be coprime to ; those stronger properties belong to later sufficient conditions.
Definition code
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_CountExtraction
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_ArithmeticProgression_Basic
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_ShortInterval
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_WTrick
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_ArithmeticProgression_Basic
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Group.Indicator
import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Combinatorics.Pigeonhole
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Int.ModEq
import Mathlib.Data.Nat.Prime.Defs
import Mathlib.Data.Nat.Totient
import Mathlib.Data.Real.Archimedean
import Mathlib.Data.ZMod.Basic
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.Divisors
import Mathlib.NumberTheory.Primorial
import Mathlib.Order.LiminfLimsup
import Mathlib.Tactic
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Final elementary assembly
This file states the exact remaining analytic obligation in terms of the
W-tricked prime weight. Once positive off-diagonal mass is supplied for
every `k ≥ 3`, all conversion to the lean-eval statement is proved here.
-/
namespace Wikipedia.SzemeredisTheorem
/-- A compact interface for the combined relative-Szemerédi and sieve
layers. The modulus is written as `M + 1` so its nonzeroness is available
definitionally without carrying a typeclass through the existential. -/
def HasPrimeProgressionMass : Prop :=
∀ k : ℕ, 3 ≤ k →
∃ (M : ℕ) (α : ℝ) (W b : ℕ),
0 < α ∧ 0 < W ∧
0 <
cyclicAPOffDiagMass k (M + 1)
(wTrickedPrimeWeight α W b)
end Wikipedia.SzemeredisTheorem
Source