Bundle structure
DefinitionSparseDisc_Supplement_IsBundleStructurediscrepancyhypergraphsp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy
A bundle structure consists of nonempty pairwise disjoint item sets and nonempty reader sets , such that every declared support item of lies in some with .
Definition code
import Mathlib
namespace SparseDisc.Supplement
/-- A bundle structure `(B_e,S_e)` for declared supports `U_v`: the item bundles are nonempty,
pairwise disjoint, the reader sets are nonempty, and every declared support item is covered by a
bundle whose reader set contains that function (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond
Additive Functions*, STOC 2027 submission manuscript (sha256 0f09ec60…25b81), Definition 5.1,
p.21). -/
def IsBundleStructure {V ι E : Type} (U : V → Finset ι)
(B : E → Finset ι) (S : E → Finset V) : Prop :=
(∀ e, (B e).Nonempty) ∧ (∀ e, (S e).Nonempty) ∧
(∀ e e', e ≠ e' → Disjoint (B e) (B e')) ∧
∀ v j, j ∈ U v → ∃ e, v ∈ S e ∧ j ∈ B e
end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), Definition 5.1, p.21