Reindexing a CFZ certificate by a finite equivalence
ProvedWikipedia.SzemeredisTheorem.MajorizedCutSystem.HasCFZCertificate.reindexadditive-combinatoricsgreen-tao-port-8822number-theory
Let , fix and a distinguished face , and let be finite types. If a majorized cut system over has a CFZ certificate and is an equivalence, then the reindexed system has a CFZ certificate.
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_GreenTao_LinearForms_Condition import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Independence import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_BoxNorm import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_ConvolutionClosure import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_ConvolutionMoments import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_Densification import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_FaceMoments import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_GeneralRelativeSimplexStep import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_ProjectedFaceCutClosure import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_ProjectedMajorantExpansion import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_RecursiveRelativeSimplex import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_RelativeCountingCertificate import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_RelativeCountingDecoder import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_RelativeSimplexComparison import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_RelativeSimplexIteration import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_StrongLinearForms import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_WeightedStrongLinearForms import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Transference_WeightedStrongLinearFormsCS 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_ConditionalAverage import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Energy import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FacePartition import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Regularity import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex 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.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 /-! # Stage decoders for relative-counting Cauchy--Schwarz recursion Repeated applications of `MajorizedCutSystem.next` replace an external parameter `P` by the left-associated tower `(((P × (G × G)) × (G × G)) × ⋯)`. The declarations below give this tower a stable stage-indexed name and identify it with a base parameter together with a Boolean pair for every coordinate already eliminated. In the AP application the base parameter is itself a Boolean pair, belonging to the distinguished omitted face. Thus stage `r` is canonically a Boolean cube on `r + 1` axes. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators universe u /-! ## The nested parameter tower -/ /-! ## Boolean-axis form of the AP parameter -/ /-! ## Full AP cube decoder -/ /-! ## Expected CFZ selectors at a decoded stage -/ /-! ## Iterating `MajorizedCutSystem.next` -/ open Wikipedia.SzemeredisTheorem.MajorizedCutSystem
Formal statement
theorem Wikipedia.SzemeredisTheorem.MajorizedCutSystem.HasCFZCertificate.reindex
{k N : ℕ} [NeZero N]
{ν : ZMod N → ℝ} (j : Fin k)
{G : Type u} [Fintype G] :
∀ {P Q : Type u} [Fintype P] [Fintype Q]
{n : ℕ}
(S : MajorizedCutSystem P G n)
(e : Q ≃ P),
HasCFZCertificate ν j S →
HasCFZCertificate ν j (S.reindex e) := by sorry
Source