Unit-interval edge weights in a partite simplex system
DefinitionGreenTaoPort_Wikipedia_SzemeredisTheorem_Transference_SimplexCountingarithmetic-progressionscombinatoricsgreen-tao-port-8822
For a weighted partite simplex system , the unit-interval predicate requires
for every edge colour and every assignment on the other vertex parts. The vertex types may be arbitrary; finiteness is not part of this pointwise predicate. This is the boundedness condition used in the later stability estimates for normalized simplex counts.
Definition code
import Mathlib.Algebra.Order.BigOperators.Expect
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_Simplex
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
/-!
# Stable weighted simplex counts
Relative counting will eventually use cut discrepancy and densification.
This file records the elementary endpoint: uniformly close edge weights in
`[0,1]` have close simplex counts. The proof is the finite telescoping
estimate for products, followed by averaging.
-/
namespace Wikipedia.SzemeredisTheorem
open scoped BigOperators
/-- Every edge weight of `H` lies in the unit interval. -/
def EdgeWeightsInUnitInterval {k : ℕ} {V : Fin k → Type*}
(H : WeightedSimplexSystem V) : Prop :=
∀ j x, 0 ≤ H.edgeWeight j x ∧ H.edgeWeight j x ≤ 1
end Wikipedia.SzemeredisTheorem
Source