Every initial ordered-pattern partition has at most two atoms
ProvedWikipedia.SzemeredisTheorem.complexity_orderedPatternInitialComplex_le_twoadditive-combinatoricsgreen-tao-port-8822number-theory
For an ordered pattern over a nonempty finite vertex type, every partition in its canonical initial complex has complexity at most two, at every rank and ordered face. The lower layers are indiscrete, and the top layer is generated by one edge-membership predicate per face.
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_OrderedPatternPartition import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemoval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemovalParameters import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemovalTheorem 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_StrongOrderedComplexRegularity 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 /-! # Schedule-level assembly of ordered hypergraph removal The structural regularity theorem accepts a tolerance schedule, a weak-regularity budget at every stage, and one energy-selection length at every rank. `OrderedRemovalParameters` identifies the two numerical inequalities those schedules must satisfy. This file performs all remaining quantifier and semantic assembly. The main theorem is deliberately conditional on the existence of compatible ambient-independent schedules. It proves that such schedules imply `HasUniformOrderedPatternRemoval`; no fixed point or diagonal selector is assumed to have been constructed here. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators /-! ## The canonical pattern complex has complexity at most two -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.complexity_orderedPatternInitialComplex_le_two
{G : Type*} [Fintype G] [DecidableEq G] [Nonempty G]
{k r : ℕ} (H : OrderedPattern G k r) :
∀ (j : Fin (r + 1)) (e : OrderedFace k j.1),
FacePartition.complexity
((orderedPatternInitialComplex H).partition j e) ≤ 2 := by sorry
Source