Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.37 — thin shared bundles for instances

Open
SparseDisc.Supplement.theorem_8_37

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

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

Let GGG be a finite instance with nnn functions in which any two declared supports share at most sss items.

  1. If GGG is 222-sparse, then
disc⁡(G)≤1+2⌈sn/2⌉.\operatorname{disc}(G)\le1+2\left\lceil\sqrt{sn/2}\right\rceil.disc(G)≤1+2⌈sn/2​⌉.

In particular, a simple item multigraph gives disc⁡(G)≤1+2⌈n/2⌉\operatorname{disc}(G)\le1+2\lceil\sqrt{n/2}\rceildisc(G)≤1+2⌈n/2​⌉. 2. If GGG is ttt-sparse, then

disc⁡(G)≤1+2st(t−1)n.\operatorname{disc}(G)\le1+2s\sqrt{t(t-1)n}.disc(G)≤1+2st(t−1)n​.

Differences from the source:

  • encoding: nnn functions and at most sss shared items → n is the cardinality of a finite function type and every intersection of two distinct declared supports has cardinality at most s; reason: Lean convention, preserving nonminimal supports
  • reading: simple item multigraph → pairwise declared-support intersections have cardinality at most one; reason: under 2-sparsity this is exactly absence of parallel non-private item edges
Preamble
import Mathlib
import Definitions.Def_SparseDisc_IsInstance
import Definitions.Def_SparseDisc_IsTwoSparseSupp
import Definitions.Def_SparseDisc_InstDiscLE
import Definitions.Def_SparseDisc_Supplement_IsTSparseSupp
import Definitions.Def_SparseDisc_Supplement_PairwiseSharedCap
Formal statement
namespace SparseDisc.Supplement

/-- **Theorem 8.37** (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive Functions*, STOC
2027 submission manuscript (sha256 0f09ec60…25b81), p.46). The instance-level pairwise shared-item
bounds are stated for both `t=2` and general `t`, including the simple-item-multigraph consequence. -/
theorem theorem_8_37 :
    (∀ (V ι : Type) [Fintype V] [DecidableEq V] [Fintype ι] [DecidableEq ι]
      (g : V → SparseDisc.Cube ι → ℝ) (U : V → Finset ι) (s : ℕ),
      SparseDisc.IsInstance g U → PairwiseSharedCap U s →
      SparseDisc.IsTwoSparseSupp U →
      SparseDisc.InstDiscLE g
        (1 + 2 * ((Nat.ceil (Real.sqrt (((s * Fintype.card V : ℕ) : ℝ) / 2)) : ℕ) : ℝ))) ∧
    (∀ (V ι : Type) [Fintype V] [DecidableEq V] [Fintype ι] [DecidableEq ι]
      (g : V → SparseDisc.Cube ι → ℝ) (U : V → Finset ι),
      SparseDisc.IsInstance g U → PairwiseSharedCap U 1 →
      SparseDisc.IsTwoSparseSupp U →
      SparseDisc.InstDiscLE g
        (1 + 2 * ((Nat.ceil (Real.sqrt ((Fintype.card V : ℝ) / 2)) : ℕ) : ℝ))) ∧
    (∀ (t s : ℕ), 1 ≤ t → ∀ (V ι : Type) [Fintype V] [DecidableEq V]
      [Fintype ι] [DecidableEq ι] (g : V → SparseDisc.Cube ι → ℝ)
      (U : V → Finset ι), SparseDisc.IsInstance g U → PairwiseSharedCap U s →
      IsTSparseSupp t U → SparseDisc.InstDiscLE g
        (1 + 2 * s * Real.sqrt ((t * (t - 1) * Fintype.card V : ℕ) : ℝ))) := by sorry

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

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