Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 33 — online rounding with exact marginals

Proved
PagingDelay.PMD.corollary_33

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

delayonline-algorithmsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1paging

For dyadic page weights and an initial cache O0O_0O0​ of exactly kkk pages, there is one randomized rounding rule defined on all valid fractional cache histories, chosen before the history is supplied. Write C(ν)=R(y(0),…,y(ν))C^{(\nu)}=R(y^{(0)},\ldots,y^{(\nu)})C(ν)=R(y(0),…,y(ν)). The rule depends only on this prefix and its seed; every membership event is measurable. It satisfies C(0)=O0C^{(0)}=O_0C(0)=O0​ and ∣C(ν)∣=k|C^{(\nu)}|=k∣C(ν)∣=k, and

Pr⁡[i∈C(ν)]=yi(ν),E ⁣[∑i∈C(ν+1)∖C(ν)wi]≤5∑iwi∣yi(ν+1)−yi(ν)∣.\Pr[i\in C^{(\nu)}]=y_i^{(\nu)},\qquad \mathbb E\!\left[\sum_{i\in C^{(\nu+1)}\setminus C^{(\nu)}}w_i\right]\le5\sum_iw_i|y_i^{(\nu+1)}-y_i^{(\nu)}|.Pr[i∈C(ν)]=yi(ν)​,E​i∈C(ν+1)∖C(ν)∑​wi​​≤5i∑​wi​∣yi(ν+1)​−yi(ν)​∣.

This is the rounding theorem to be proved; no BBN07 assumption is made.

Differences from the source:

  • encoding: pages indexed by 1 through n → pages indexed by Fin n; reason: a bijective reindexing of the same finite page universe
  • encoding: online random cache choices for vectors arriving one at a time → one probability space and a measurable prefix map R, selected before every finite history; reason: the full random tape is the seed; a prefix map cannot depend on future vectors, and its jointly defined outputs retain transition correlations
Preamble
import Definitions.Def_PagingDelay_PMD_Rounding
Formal statement
namespace PagingDelay.PMD
open scoped BigOperators

/-- Julian Born, Yann Disser, Linda Thelen, Tight weighted paging with delay via mirror descent, STOC 2027 submission #453 (October 2026), Corollary 33 — online rounding with exact marginals, p. 26. -/
theorem corollary_33 (n k : ℕ) (hk : 1 ≤ k) (hkn : k ≤ n)
    (w : Fin n → ℝ) (hw : DyadicWeights w)
    (O₀ : Finset (Fin n)) (hO₀ : O₀.card = k) :
    ∃ R : OnlineRounding n,
      (∀ ω, R.choose ω [indicator O₀] = O₀) ∧
      (∀ ys, CacheHistory k O₀ ys →
        (∀ ω, (R.choose ω ys).card = k) ∧
        (∀ i, roundingMarginal R ys i = ENNReal.ofReal (ys.getLastD (indicator O₀) i)) ∧
        (∀ y, FractionalCache k y → roundingFetch w R ys y ≤
          ENNReal.ofReal (5 * ∑ i, w i * |y i - ys.getLastD (indicator O₀) i|))) := by sorry

end PagingDelay.PMD
Source
Julian Born, Yann Disser, Linda Thelen, Tight weighted paging with delay via mirror descent, STOC 2027 submission #453 (October 2026), Corollary 33 — online rounding with exact marginals, p. 26. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/453.pdf
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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