Mixed correlations for edge-by-edge simplex replacement
DefinitionGreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexTelescopingarithmetic-progressionscombinatoricsgreen-tao-port-8822
Let and be real-weighted partite simplex systems with edge colours. For a full vertex assignment , the mixed term at colour is
where deletes coordinate . Thus earlier colours use , later colours use , and colour contributes their difference. For finite vertex types, the mixed correlation is the normalized mean of this term. The correlation-bound predicate requires the absolute value of every mixed correlation to be at most a real parameter . These definitions impose no positivity or boundedness on the edge weights.
Definition code
import Mathlib.Algebra.BigOperators.Ring.Finset
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex
import Lean
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset
import Mathlib.Data.Fintype.Card
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Edge-by-edge telescoping for weighted simplex counts
The relative counting lemma compares two products by replacing one edge at a
time. This file isolates that exact finite algebra. No boundedness is
required: all analytic work is reduced to bounding one mixed correlation for
each edge colour.
-/
namespace Wikipedia.SzemeredisTheorem
open scoped BigOperators
/-- The mixed term produced while replacing edge colour `j`: earlier
colours come from `H`, later colours from `G`, and colour `j` contributes
their difference. -/
def mixedSimplexTerm {k : ℕ} {V : Fin k → Type*}
(H G : WeightedSimplexSystem V) (j : Fin k)
(x : (i : Fin k) → V i) : ℝ :=
(H.edgeWeight j (deleteCoordinate x j) -
G.edgeWeight j (deleteCoordinate x j)) *
(∏ i ∈ (Finset.univ : Finset (Fin k)) with i < j,
H.edgeWeight i (deleteCoordinate x i)) *
∏ i ∈ (Finset.univ : Finset (Fin k)) with j < i,
G.edgeWeight i (deleteCoordinate x i)
/-- The normalized mixed correlation attached to one edge replacement. -/
noncomputable def mixedSimplexCorrelation
{k : ℕ} {V : Fin k → Type*}
[∀ i, Fintype (V i)]
(H G : WeightedSimplexSystem V) (j : Fin k) : ℝ :=
mean (mixedSimplexTerm H G j)
/-- Every mixed edge-replacement correlation is at most `ε`. -/
def MixedSimplexCorrelationLe
{k : ℕ} {V : Fin k → Type*}
[∀ i, Fintype (V i)]
(H G : WeightedSimplexSystem V) (ε : ℝ) : Prop :=
∀ j, |mixedSimplexCorrelation H G j| ≤ ε
end Wikipedia.SzemeredisTheorem
/- Materialize compiler-generated declarations promised by this bundle. -/
run_meta do
for requiredName in #[
`Wikipedia.SzemeredisTheorem.mixedSimplexTerm.eq_1
] do
let actualName ← Lean.realizeGlobalConstNoOverloadCore requiredName
unless actualName == requiredName do
throwError "Generated companion resolved to an unexpected name"
Source