Bounded ports in every lobe of a heavy function
DefinitionSparseDisc_Supplement_PortConditiondiscrepancyhypergraphsp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy
A function is heavy when it lies in more than bundle hyperedges. After deleting it, co-membership in the remaining hyperedges partitions its neighbours into lobes; the ports of a lobe are the original hyperedges containing the function and meeting that lobe. PortCondition requires every heavy function to have at most ports in each lobe.
Definition code
import Mathlib
import Definitions.Def_SparseDisc_Supplement_bundleEdges
namespace SparseDisc.Supplement
open Classical in
/-- The bounded-port hypothesis of Theorems 1.8 and 7.6. A function is heavy when it belongs to
more than `Δ` non-private bundle hyperedges. For each neighbour `u`, the relation generated by
co-membership in hyperedges after deleting `v` gives its lobe; the ports are the hyperedges
containing `v` and meeting that lobe (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive
Functions*, STOC 2027 submission manuscript (sha256 0f09ec60…25b81), Definition 7.1, p.26). -/
noncomputable def PortCondition {V ι : Type} [Fintype V] [DecidableEq V] [Fintype ι]
(U : V → Finset ι) (Δ : ℕ) : Prop :=
let E := bundleEdges U
let degree := fun v => (E.filter (fun e => v ∈ e)).card
∀ v, Δ < degree v → ∀ u, u ≠ v →
(∃ e ∈ E, v ∈ e ∧ u ∈ e) →
(E.filter (fun e => v ∈ e ∧ ∃ w ∈ e, w ≠ v ∧
Relation.ReflTransGen
(fun a b => a ≠ v ∧ b ≠ v ∧ ∃ e' ∈ E, a ∈ e' ∧ b ∈ e') u w)).card ≤ Δ
end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), Definition 7.1, p.26