Idempotent base weights and edge factors on duplicated bundles
DefinitionGreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleIndicatorDuplicationarithmetic-progressionscombinatoricsgreen-tao-port-8822hypergraph-regularity
A base-edge weight family is idempotent on a base hypergraph when for every base edge and assignment. Real zero–one indicator families satisfy this condition.
The bundle also supplies the membership-subtype equivalence induced by equality of two finite sets, and the weight of an actual edge in a duplicated occurrence bundle at a fixed doubled assignment. The latter uses the duplicated bundle's projection to pull back the original base-edge weights. These definitions keep exact finite-edge identities available during the indicator-duplication argument.
Definition code
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleDuplication
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Indicator weights on a duplicated hypergraph bundle
The source-indexed doubled product retains both labelled copies of every
remaining occurrence edge. The ordinary duplicated bundle instead stores
the image of the source-edge map, so it identifies the two copies of an edge
contained in the shared edge. For pulled-back zero--one base weights this
identification does not change the product: the only lost multiplicity is a
repeated idempotent factor.
-/
namespace Wikipedia.SzemeredisTheorem
open scoped BigOperators
namespace HypergraphBundle
variable {J K G : Type*}
[DecidableEq J] [DecidableEq K]
{H : Finset (Finset J)}
/-- Pointwise idempotence of a base-edge weight family on the base
hypergraph. Real-valued indicator families satisfy this condition. -/
def BaseWeightsIdempotent
(H : Finset (Finset J))
(A : BaseEdgeWeight J G) : Prop :=
∀ e ∈ H, ∀ y, A e y * A e y = A e y
/-- Equality of finite sets transports their membership subtypes. -/
def finsetMembershipEquivOfEq
{α : Type*} {s t : Finset α} (h : s = t) :
{a : α // a ∈ s} ≃ {a : α // a ∈ t} :=
Equiv.cast
(congrArg (fun u : Finset α => {a : α // a ∈ u}) h)
/-- The weight of an actual doubled occurrence edge at a fixed doubled
assignment. -/
noncomputable def doubledBundleEdgeFactor
(B : HypergraphBundle J K H) (g₀ : Finset K)
(A : BaseEdgeWeight J G)
(x : DoubledOccurrenceVertex g₀ → G)
(d : Finset (DoubledOccurrenceVertex g₀)) : ℝ :=
(B.duplicateOutside g₀).pullbackBaseEdgeWeight A d
(edgeTuple d x)
end HypergraphBundle
end Wikipedia.SzemeredisTheorem
Source