Initial ordered partition complexes generated by a pattern
DefinitionGreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedPatternPartitionarithmetic-progressionscombinatoricsgreen-tao-port-8822hypergraph-regularity
For an ordered hypergraph pattern over a finite vertex type, each top-face edge predicate has a finite support. The partition generated by that support distinguishes membership in the edge set from nonmembership, with empty cells discarded by the finite-partition construction.
The bundle also defines the complex that is indiscrete at every face and rank. The canonical initial complex replaces its top layer by the pattern-generated partitions while leaving all lower layers indiscrete. This retains exactly the input edge information needed to start the regularity construction.
Definition code
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FullOrderedRegularity
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedGoodAtoms
import Lean
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.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
/-!
# Ordered pattern edge partitions
The top layer used in ordered removal must remember the original
hypergraph. For every top face we therefore generate a two-cell partition
from its edge set. Any later refinement of that layer has atoms which are
monochromatic for the original edge predicate.
The lower layers of `orderedPatternInitialComplex` are indiscrete. This is
the canonical starting complex for the all-rank regularity argument.
-/
namespace Wikipedia.SzemeredisTheorem
/-! ## Edge supports and their two-cell partitions -/
/-- The finite support of one ordered edge predicate. -/
noncomputable def OrderedPattern.edgeFinset
{G : Type*} [Fintype G] [DecidableEq G]
{k r : ℕ} (H : OrderedPattern G k r)
(e : OrderedFace k r) : Finset (Fin r → G) := by
classical
exact Finset.univ.filter (H.edge e)
/-- The two-cell top partition generated by the edge set on each ordered
top face. -/
noncomputable def orderedPatternTopPartition
{G : Type*} [Fintype G] [DecidableEq G]
{k r : ℕ} (H : OrderedPattern G k r) :
OrderedFacePartitionSystem G k r := by
classical
exact fun e =>
FacePartition.generatedBy ({H.edgeFinset e} :
Finset (Finset (Fin r → G)))
/-! ## Canonical initial complex -/
/-- The all-indiscrete ordered partition complex. -/
def indiscreteOrderedPartitionComplex
(G : Type*) [Fintype G] [DecidableEq G]
(k r : ℕ) : OrderedPartitionComplex G k r where
partition _ _ := FacePartition.indiscrete
/-- The canonical regularity input: indiscrete below the top, with the top
layer generated by the original ordered edge predicates. -/
noncomputable def orderedPatternInitialComplex
{G : Type*} [Fintype G] [DecidableEq G]
{k r : ℕ} (H : OrderedPattern G k r) :
OrderedPartitionComplex G k r :=
(indiscreteOrderedPartitionComplex G k r).withTopLayer
(orderedPatternTopPartition H)
/-! ## Closed configurations contained in the original pattern -/
end Wikipedia.SzemeredisTheorem
/- Materialize compiler-generated declarations promised by this bundle. -/
run_meta do
for requiredName in #[
`Wikipedia.SzemeredisTheorem.OrderedPattern.edgeFinset.eq_1,
`Wikipedia.SzemeredisTheorem.orderedPatternTopPartition.eq_1
] do
let actualName ← Lean.realizeGlobalConstNoOverloadCore requiredName
unless actualName == requiredName do
throwError "Generated companion resolved to an unexpected name"
Source