Pairwise shared-item cap
DefinitionSparseDisc_Supplement_PairwiseSharedCapdiscrepancyp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy
Declared supports satisfy the pairwise shared-item cap when for every two distinct functions .
Definition code
import Mathlib
namespace SparseDisc.Supplement
/-- Any two distinct functions share at most `s` declared support items, the hypothesis of
Theorems 1.10 and 8.37 (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive Functions*, STOC
2027 submission manuscript (sha256 0f09ec60…25b81), pp.5,46). -/
def PairwiseSharedCap {V ι : Type} [DecidableEq ι]
(U : V → Finset ι) (s : ℕ) : Prop :=
∀ u v, u ≠ v → ((U u) ∩ (U v)).card ≤ s
end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), Theorems 1.10 and 8.37, pp.5,46