General -sparse family of set functions
DefinitionSparseDisc_Supplement_IsTSparsediscrepancyp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy
A finite family is -sparse when every item is relevant to at most functions:
This extends the published -sparse predicate without changing its conventions.
Definition code
import Mathlib
import Definitions.Def_SparseDisc_relevant
namespace SparseDisc.Supplement
/-- General `t`-sparsity for a family of set functions: every item is relevant to at most `t`
functions (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive Functions*, STOC 2027
submission manuscript (sha256 0f09ec60…25b81), p.1 and Definition 2.2, p.12).
**Formalization Note** Functions and items are indexed by finite types. This is exactly the
published `SparseDisc.IsTwoSparse` with the constant `2` replaced by the parameter `t`. -/
def IsTSparse {V ι : Type} [Fintype V] [Fintype ι] [DecidableEq ι]
(t : ℕ) (f : V → Finset ι → ℝ) : Prop :=
∀ j : ι, (Finset.univ.filter (fun v => j ∈ SparseDisc.relevant (f v))).card ≤ t
end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), p.1 and Definition 2.2, p.12