A bounded source-full schedule admits a certificate
ProvedWikipedia.SzemeredisTheorem.SourceFullCoarseTargetSchedule.Bounded.certificate_nonemptyadditive-combinatoricsgreen-tao-port-8822number-theory
Let be finite and nonempty with decidable equality, and let a bounded source-full coarse-target schedule have parameters , an initial complexity-bound array, a natural growth function, and a scale floor. For every initial ordered partition complex whose partition complexities satisfy that array at every rank and face, there exists a certificate for the schedule and initial complex.
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_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_HypergraphBundleCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleDuplication import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleFiltration import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleGeneralizedCounting import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleIndicatorDuplication 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_OrderedRemoval import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_OrderedRemovalParameters import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_PreliminaryOrderedRegularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_RankwiseBundleEnvelopeSelection 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_SourceFullBundleRemovalParameters 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 /-! # Ambient-independent source-full bundle-removal parameters This file packages two pieces of the final numerical diagonal. * `sourceBundleDensity δ m = δ / (m + 1)` pays for a coarse upper partition of complexity at most `m` without choosing a global complexity window. * `sourceBundleDefectScale δ η N m = η * sourceBundleDensity δ m ^ N` is small relative to every density power up to the fixed finite bundle horizon `N`. The polynomial growth function ``` F(m) = Q * (m + 1)^N + (m + 1) ``` then makes both the common preliminary-regularity tolerance and the rankwise source energy gaps small at the *same selected scale*. This is the pointwise choice which removes the apparent global complexity fixed point. The last section retains the uniform ceiling supplied by `SourceFullCoarseTargetSchedule.Bounded` when realizing the numerical plan over an ambient finite type. The older `certificate_nonempty` theorem forgets the landing and hence cannot expose this ceiling to the uniform count threshold. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators /-! ## Scale-dependent density and defect parameters -/ /-! ## Rankwise schedules attached to a selected scale hierarchy -/ /-! ## Polynomial pointwise growth -/ /-! ## Finite-horizon normalized counting bounds -/ /-! ## A bounded realized certificate -/ open Wikipedia.SzemeredisTheorem.SourceFullCoarseTargetSchedule.Bounded
Formal statement
theorem Wikipedia.SzemeredisTheorem.SourceFullCoarseTargetSchedule.Bounded.certificate_nonempty
{G : Type*} [Fintype G] [DecidableEq G] [Nonempty G]
{k r : ℕ}
{initialBound : Fin (r + 1) → ℕ}
{F : NatGrowthFunction}
{scaleFloor : ℕ}
(S : SourceFullCoarseTargetSchedule.Bounded
k r initialBound F scaleFloor)
(initial : OrderedPartitionComplex G k r)
(hinitial :
∀ (q : Fin (r + 1)) (e : OrderedFace k q.1),
FacePartition.complexity
(initial.partition q e) ≤
initialBound q) :
Nonempty (Certificate S initial) := by sorry
Source