Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2 — arbitrary bundle structures

Open
SparseDisc.Supplement.theorem_5_2

by iris · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrepancyhypergraphsp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy

Let G=(gv,Uv)v∈VG=(g_v,U_v)_{v\in V}G=(gv​,Uv​)v∈V​ be an instance with bundle structure (Be,Se)e∈E(B_e,S_e)_{e\in E}(Be​,Se​)e∈E​, and suppose dv=∣{e:v∈Se}∣≥1d_v=|\{e:v\in S_e\}|\ge1dv​=∣{e:v∈Se​}∣≥1. Put

ke=∑v∈Semax⁡(1,2dv−2).k_e=\sum_{v\in S_e}\max(1,2^{d_v-2}).ke​=v∈Se​∑​max(1,2dv​−2).

Then there is a sign colouring xxx satisfying

∣gv(x)∣≤∑e∈N(v)min⁡(ke,∣Be∣)for every v.|g_v(x)|\le\sum_{e\in N(v)}\min(k_e,|B_e|)\qquad\text{for every }v.∣gv​(x)∣≤e∈N(v)∑​min(ke​,∣Be​∣)for every v.

In particular, if the structure is ttt-bounded and dv≤Δd_v\le\Deltadv​≤Δ for every vvv, then disc⁡(G)≤tΔmax⁡(1,2Δ−2)\operatorname{disc}(G)\le t\Delta\max(1,2^{\Delta-2})disc(G)≤tΔmax(1,2Δ−2).

Differences from the source:

  • encoding: finite bundle structure (Be,Se)(B_e,S_e)(Be​,Se​) → finite index types and Finset bundles with nonemptiness, pairwise disjointness and support coverage stated in IsBundleStructure; reason: Lean convention, matching Definition 5.1 clause by clause
Preamble
import Mathlib
import Definitions.Def_SparseDisc_IsInstance
import Definitions.Def_SparseDisc_InstDiscLE
import Definitions.Def_SparseDisc_Supplement_IsBundleStructure
Formal statement
namespace SparseDisc.Supplement

open Classical in
/-- **Theorem 5.2** (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive Functions*, STOC
2027 submission manuscript (sha256 0f09ec60…25b81), p.21). For an arbitrary bundle structure,
there is one colouring satisfying every per-function sum of `min(k_e,|B_e|)`; the exact
`tΔ max(1,2^(Δ-2))` consequence is included. -/
theorem theorem_5_2 :
    ∀ (V ι E : Type) [Fintype V] [DecidableEq V] [Fintype ι] [DecidableEq ι]
      [Fintype E] [DecidableEq E] (g : V → SparseDisc.Cube ι → ℝ)
      (U : V → Finset ι) (B : E → Finset ι) (S : E → Finset V),
      SparseDisc.IsInstance g U → IsBundleStructure U B S →
      let N := fun v => Finset.univ.filter (fun e => v ∈ S e)
      let d := fun v => (N v).card
      let k := fun e => ∑ v ∈ S e, max 1 (2 ^ (d v - 2))
      (∀ v, 1 ≤ d v) →
      (∃ x : SparseDisc.Cube ι, ∀ v,
        |g v x| ≤ ((∑ e ∈ N v, min (k e) (B e).card : ℕ) : ℝ)) ∧
      ∀ (t Δ : ℕ), (∀ e, (S e).card ≤ t) → (∀ v, d v ≤ Δ) →
        SparseDisc.InstDiscLE g ((t * Δ * max 1 (2 ^ (Δ - 2)) : ℕ) : ℝ) := by sorry

end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), Theorem 5.2, p.21

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me