A nonzero fine boundary weight determines the coarse boundary atom
ProvedWikipedia.SzemeredisTheorem.coarse_boundary_mem_of_boundary_weight_ne_zeroadditive-combinatoricsgreen-tao-port-8822number-theory
Let be an ordered coarse/fine complex on a finite vertex type and let be a closed configuration of its fine atoms. Choose a positive face of rank at least two and one of its immediate boundary faces. If the selected fine boundary-atom indicator is nonzero at the restriction of a full tuple , then that boundary tuple belongs to the same coarse boundary-face atom as the corresponding restriction of 's witness. The conclusion uses the coarse lower layer and the chosen coordinate deletion.
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_BoundaryBernoulli 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_HypergraphBundleCounting 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_OrderedGoodAtoms import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedPattern 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_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 /-! # Positive counts for good closed ordered configurations This file turns the local good-atom estimates into a direct positive-count recurrence. The edge index contains every positive-rank ordered face of an ordered partition complex. On downward-closed face families, the count is the normalized mean of the selected atom indicators. On other families we use the exact product of the coarse densities; this total extension lets us apply the finite abstract recurrence without asking localized estimates on families which omit their boundary. At a maximum-rank face, the remaining product contains every proper boundary factor. Thus it is supported on the canonical coarse boundary atom. The identity ```text 1_A = p + (E_fine 1_A - p) + (1_A - E_fine 1_A) ``` then gives the recurrence. The uniform term is tested against a bounded boundary product after freezing the outside variables. The defect term is bounded by localized Cauchy--Schwarz; the boundary support and unit bounds make its square at most the good-atom defect threshold. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators /-! ## Positive-rank faces and immediate downward closure -/ /-! ## Missing coordinates for lower-or-equal rank faces -/ /-! ## Selected atom weights and counts -/ /-! ## Freezing and grouping a maximum-rank remainder -/ /-! ## Coarse densities, defects, and boundary support -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.coarse_boundary_mem_of_boundary_weight_ne_zero
{G : Type*} [Fintype G] [DecidableEq G]
{k r : ℕ}
(P : OrderedCoarseFineComplex G k r)
(A : ClosedOrderedAtomConfiguration G k r P.fine)
(e : PositiveOrderedFace k r)
(hpos : 0 < e.lowerRank.1)
(i : Fin (e.lowerRank.1 + 1))
(x : Fin k → G)
(hweight :
configurationFaceWeight A (e.boundary hpos i)
(orderedFaceTuple (e.boundary hpos i).face x) ≠
0) :
eraseBoundaryCoordinate i (orderedFaceTuple e.face x) ∈
(positiveFaceLowerLayer P.coarse e
(eraseBoundaryFace e.face i)).part
(eraseBoundaryCoordinate i
(orderedFaceTuple e.face A.witness)) := by sorry
Source