Prime support of a paired divisor least common multiple
ProvedWikipedia.SzemeredisTheorem.SmoothSieveCutoff.primeFactors_pairedDivisorLcm_subset_primesLEadditive-combinatoricsgreen-tao-port-8822number-theory
Let be a finite index set, a natural number, and an admissible smooth divisor-family choice at scale . Suppose is squarefree as a paired divisor choice. Every prime factor of its paired-divisor least common multiple is at most :
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_LinearForms_Geometry import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Independence import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_ReducedResidues import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Primes_WTrick import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryBlockBoundary import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryBlockEulerBridge import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryDivisorExpansion import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryFourierBridge import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryFourierTailBound import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCarryHarmonicLcmEulerBound import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_CFZCongruenceBoundary import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ComplexEulerProductComparison import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ComplexLocalFactorControl import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ComplexZetaModelComparison 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_GoodPrimeAffineRank import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_GoodPrimeLocalFactorBound 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_PairedDivisibilityCRT import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_PairedLocalFactors 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_WTrickedGoodPrime import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_WTrickedLocalFactors import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ZetaEulerProductIdentification import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ZetaNearOne import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.GCDMonoid.FinsetLemmas import Mathlib.Algebra.Order.BigOperators.Group.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.Log.Summable import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Combinatorics.Pigeonhole import Mathlib.Data.Fintype.BigOperators import Mathlib.Data.Fintype.Card import Mathlib.Data.Fintype.Pi import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Lemmas import Mathlib.Data.Nat.GCD.Prime import Mathlib.Data.Nat.Squarefree import Mathlib.Data.Nat.Totient import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.QuotientRing 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.Divisors import Mathlib.NumberTheory.EulerProduct.DirichletLSeries import Mathlib.NumberTheory.Harmonic.ZetaAsymp import Mathlib.NumberTheory.LSeries.Dirichlet import Mathlib.NumberTheory.Primorial import Mathlib.NumberTheory.SumPrimeReciprocals import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # A finite Euler majorant for the carry harmonic LCM mass The divisor cutoff in `smoothDivisorFamilyChoices κ R` is imposed on every individual divisor. It therefore couples the prime choices and does not give an exact Euler product. This file uses only the honest one-sided comparison: a squarefree paired divisor family is injected into the larger space in which, independently for every prime `p ≤ R`, an arbitrary subset of the `2 * card κ` divisor occurrences may contain `p`. The empty subset has weight one. Every nonempty subset has weight `p⁻¹`, because `p` then occurs in the global LCM. Summing over the unrestricted assignment space gives the finite product `∏ p ∈ Nat.primesLE R, (1 + (2 ^ (2 * card κ) - 1) / p)`. Only the injection into that space is used; no false equality with the coordinatewise-truncated divisor family is asserted. -/ open Wikipedia.SzemeredisTheorem open scoped ArithmeticFunction.Moebius BigOperators open Wikipedia.SzemeredisTheorem.SmoothSieveCutoff /-! ## Prime-occurrence assignments -/ /-! ## The unrestricted assignment sum -/ /-! ## Encoding supported divisor families -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.SmoothSieveCutoff.primeFactors_pairedDivisorLcm_subset_primesLE
{κ : Type*} [Fintype κ] [DecidableEq κ]
{R : ℕ} {z : κ → ℕ × ℕ}
(hzR : z ∈ smoothDivisorFamilyChoices κ R)
(hz : SquarefreePairedDivisorChoice z) :
(pairedDivisorLcm z).primeFactors ⊆ Nat.primesLE R := by sorry
Source