Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 17 — hit and miss potential changes

Proved
PagingDelay.PMD.proposition_17

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

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

For a critical path λx→p\lambda_{x\to p}λx→p​, keep the offline cache OOO fixed with exactly kkk pages and write ΔD=D(O∥λ(∣λ∣))−D(O∥x)\Delta D=D(O\Vert\lambda(|\lambda|))-D(O\Vert x)ΔD=D(O∥λ(∣λ∣))−D(O∥x). Both cases hold:

p∈O  ⟹  ΔD≤−fetch⁡(λ),p∉O  ⟹  ΔD≤2Lwp+Exc⁡(λ,O).p\in O\implies\Delta D\le-\operatorname{fetch}(\lambda),\qquad p\notin O\implies\Delta D\le2Lw_p+\operatorname{Exc}(\lambda,O).p∈O⟹ΔD≤−fetch(λ),p∈/O⟹ΔD≤2Lwp​+Exc(λ,O).

The excess is the sum of the path's level-WWW lengths for wp≤W<wmin⁡(O)w_p\le W<w_{\min}(O)wp​≤W<wmin​(O), with coefficient exactly one.

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: the first nonnegative hitting time |λ| and natural logarithm L → guarded real infimum and L = log(2k+1); reason: on the stated valid domain the hitting set is nonempty, bounded below and closed; k≥1 makes L positive
  • generalization: a positive-length critical service with x_p>δ → all valid states, also the zero-length boundary x_p=δ; reason: at the added boundary pathLength, ΔD, fetch and excess are zero, so both source inequalities still hold
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), Proposition 17 — hit and miss potential changes, p. 17. -/
theorem proposition_17 (n k : ℕ) (hk : 1 ≤ k) (hkn : k < n)
    (w : Fin n → ℝ) (hw : PMDWeights w)
    (x : Fin n → ℝ) (hx : StateValid k x)
    (p : Fin n) (O : Finset (Fin n)) (hO : O.card = k) :
    let Δ := potential w O (pathEnd k w x p) - potential w O x
    (p ∈ O → Δ ≤ -pathFetch k w x p) ∧
    (p ∉ O → Δ ≤ 2 * logFactor k * w p + serviceExcess k w x p O) := 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), Proposition 17 — hit and miss potential changes, p. 17. 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