Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 34 — complete rounding-map properties

Proved
PagingDelay.PMD.lemma_34

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

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

Let k≥1k\ge1k≥1, δ=1/(2k+1)\delta=1/(2k+1)δ=1/(2k+1) and x∈[δ,1]nx\in[\delta,1]^nx∈[δ,1]n with ∑ixi≥n−k\sum_i x_i\ge n-k∑i​xi​≥n−k. Put ui=(1−xi)/(1−δ)u_i=(1-x_i)/(1-\delta)ui​=(1−xi​)/(1−δ) and zi=max⁡{0,2ui−1}z_i=\max\{0,2u_i-1\}zi​=max{0,2ui​−1}. Then

z∈[0,1]n,(xi=δ  ⟹  zi=1),∑izi≤k.z\in[0,1]^n,\quad (x_i=\delta\implies z_i=1),\quad\sum_i z_i\le k.z∈[0,1]n,(xi​=δ⟹zi​=1),i∑​zi​≤k.

The scalar map xi↦zix_i\mapsto z_ixi​↦zi​ is nonincreasing and 3-Lipschitz throughout [δ,1][\delta,1][δ,1]. All five conclusions of the lemma are included.

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: coordinatewise nonincreasing, 3-Lipschitz map on [δ,1] → AntitoneOn and LipschitzOnWith 3 on the closed interval; reason: these express the two scalar properties uniformly, rather than only at the supplied coordinates
Preamble
import Definitions.Def_PagingDelay_PMD_Path
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), Lemma 34 — complete rounding-map properties, p. 26. -/
theorem lemma_34 (n k : ℕ) (hk : 1 ≤ k) (x : Fin n → ℝ)
    (hx : ∀ i, delta k ≤ x i ∧ x i ≤ 1)
    (hmass : (n : ℝ) - k ≤ ∑ i, x i) :
    (∀ i, 0 ≤ roundingMap k (x i) ∧ roundingMap k (x i) ≤ 1) ∧
    (∀ i, x i = delta k → roundingMap k (x i) = 1) ∧
    (∑ i, roundingMap k (x i)) ≤ (k : ℝ) ∧
    AntitoneOn (roundingMap k) (Set.Icc (delta k) 1) ∧
    LipschitzOnWith 3 (roundingMap k) (Set.Icc (delta k) 1) := 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), Lemma 34 — complete rounding-map properties, 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