An envelope lower bound for a full ordered configuration count
ProvedWikipedia.SzemeredisTheorem.one_sub_rankwiseEnvelope_mul_densityProduct_le_fullConfigurationCountadditive-combinatoricsgreen-tao-port-8822number-theory
Let be nonempty and finite, let be an ordered coarse/fine partition complex, and let be a closed coarse atom configuration. Suppose is source-full mixed good at the rankwise thresholds , every mixed preliminary-regularity tolerance is the same nonnegative , and satisfies the bundle-counting-envelope conditions for . Assume also and for every rank.
If is the initial ordered-configuration bundle and is the mixed coarse density at positive face , then
The inequality does not require the displayed error value to be below one.
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_SzemeredisTheorem_ArithmeticProgression_Count import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_APCorrespondence import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_AdaptiveCoarseTargetRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_BoundaryBernoulli import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_CoarseAtomBridge import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_CoarseConfigurationCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_CoarseTargetRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_ConditionalAverage import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Energy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FacePartition import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FullOrderedRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_GrowthFunctionRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleConfigurationBridge import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleConfigurationStep import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleDuplication import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleFiltration import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleFrozenCut import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleFrozenUniformity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleGeneralizedCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleIndicatorDuplication import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleRelativeCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleSourceGoodnessBridge import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedAtomEnergy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedBoundaryPartition import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedConfigurationCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedFullBoundary import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedGoodAtoms import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedPattern import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemoval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemovalParameters import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_PreliminaryOrderedRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Regularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Removal import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_SourceFullCoarseTargetRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_StrongOrderedComplexRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_TowerDominatingGrowth import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Unweighted import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_WeakCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_WeakRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_APCut import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_BooleanCutReduction import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutDiscrepancy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_CutTransport import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_DenseModel import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_GeneralizedConvolution import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_PolynomialApproximation import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexTelescoping import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Order.BigOperators.Expect import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Algebra.Order.Chebyshev import Mathlib.Analysis.LocallyConvex.Separation import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Fin.Tuple.Finset import Mathlib.Data.Finset.Max import Mathlib.Data.Fintype.Card import Mathlib.Data.Int.Lemmas import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.Units import Mathlib.Order.Partition.Finpartition import Mathlib.RingTheory.Int.Basic import Mathlib.Tactic import Mathlib.Topology.ContinuousMap.Weierstrass set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Rankwise source-full bundle counting The source full-regularity hierarchy supplies a different density and defect threshold at each positive rank, together with one common fine-boundary regularity error. This file assembles those data directly with the generalized bundle-counting envelope. Unlike `SourceFullBundleCounting`, no parameter is required to be constant in the rank. The final lower bound is quantitative: if the chosen envelope has error below one half, then every source-full good closed configuration has count at least one half of the product of its prescribed rankwise density floors. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators /-! ## The finite horizon of the initial configuration bundle -/ /-! ## The source-full regularity certificate as a counting input -/ /-! ## Rankwise base-density and one-edge inputs -/ /-! ## Relative counting with an arbitrary rankwise envelope -/ /-! ## Initial configuration and a uniform quantitative lower bound -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.one_sub_rankwiseEnvelope_mul_densityProduct_le_fullConfigurationCount
{G : Type*} [Fintype G] [DecidableEq G] [Nonempty G]
{k r : ℕ}
(P : OrderedCoarseFineComplex G k r)
(A : ClosedOrderedAtomConfiguration G k r P.coarse)
(α β μ : ℕ → ℝ) (τ : ℝ)
(E : ℕ → ℕ → ℝ)
(hαzero : α 0 ≤ 1)
(hβ : ∀ d, 0 ≤ β d)
(hτ : 0 ≤ τ)
(hgood : A.IsSourceFullMixedGood P α β)
(hregular :
IsFullyMixedPreliminaryOrderedRegular P (fun _ => τ))
(henvelope : IsBundleCountingEnvelope α β μ τ E) :
(1 - E
(orderedConfigurationInitialBundle k r).order
(orderedConfigurationInitialBundle k r).edges.card) *
(∏ e : PositiveOrderedFace k r,
mixedConfigurationCoarseDensity P A e) ≤
fullConfigurationCount A := by sorry
Source