Theorem 1.2 — exact values through
OpenSparseDisc.Supplement.theorem_1_2computer-assisteddiscrepancyp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-discrepancy
Let be the supremum of the discrepancies of all finite instances with arbitrary odd -Lipschitz functions. Then
The upper bounds and are computer-assisted and use exact arithmetic. These values provide the sharp benchmark used by the acyclic-pattern theorems.
Differences from the source:
- encoding: is the supremum over finite instances with any positive number of items →
K nis a realsSupof finite-instance discrepancies, each expressed as thesInfof attainable thresholds; reason: Lean representation preserves both suprema and does not assume attainment
Preamble
import Mathlib import Definitions.Def_SparseDisc_Supplement_K
Formal statement
namespace SparseDisc.Supplement
/-- **Theorem 1.2** (Zeng–Cao–Dai–Wang–Liao, *Sparse Discrepancy Beyond Additive Functions*, STOC
2027 submission manuscript (sha256 0f09ec60…25b81), p.3). The exact worst discrepancies of one
through four arbitrary 1-Lipschitz functions are `K₁ = 1`, `K₂ = K₃ = 2`, and `K₄ = 3`.
The upper bounds for `K₃` and `K₄` are computer-assisted and use exact arithmetic. -/
theorem theorem_1_2 :
K 1 = 1 ∧ K 2 = 2 ∧ K 3 = 2 ∧ K 4 = 3 := by sorry
end SparseDisc.Supplement
Source
Zeng–Cao–Dai–Wang–Liao, Sparse Discrepancy Beyond Additive Functions, STOC 2027 submission (manuscript sha256 0f09ec60…), Theorem 1.2, p.3