Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3 — Opt(σ)≤Q\mathrm{Opt}(\sigma) \le QOpt(σ)≤Q

Proved
CachingML.PredMarker.opt_le_cleanCount

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

cachingcompetitive-analysisonline-algorithmsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k≥1k \ge 1k≥1 be the cache size, σ\sigmaσ a request sequence, Q(σ)Q(\sigma)Q(σ) the number of clean elements of its Marker phases, and Opt(σ)\mathrm{Opt}(\sigma)Opt(σ) the least number of misses of any eviction schedule starting from the empty cache. Then

Opt(σ)≤Q(σ).\mathrm{Opt}(\sigma) \le Q(\sigma).Opt(σ)≤Q(σ).

The paper uses this inequality, without a separate statement, in the last sentence of the proof of Theorem 3.3, to pass from the accuracy condition η≤ϵ Opt(σ)\eta \le \epsilon\,\mathrm{Opt}(\sigma)η≤ϵOpt(σ) to the per-chain average η/Q≤ϵ\eta / Q \le \epsilonη/Q≤ϵ. Together with Claim 1 it pins Opt(σ)\mathrm{Opt}(\sigma)Opt(σ) between Q/2Q/2Q/2 and QQQ.

Preamble
import Mathlib
import Definitions.Def_CachingML_PredMarker_opt
import Definitions.Def_CachingML_PredMarker_cleanCount
Formal statement
namespace CachingML.PredMarker

/-- The step `Opt(σ) ≤ Q` of the proof of Theorem 3.3 (Lykouris–Vassilvitskii, arXiv:1802.05399v4,
p. 16, last sentence of the proof): the offline optimum suffers at most as many cache misses as there
are clean elements. -/
theorem opt_le_cleanCount {α : Type*} [DecidableEq α] (k : ℕ) (hk : 1 ≤ k) (σ : List α) :
    opt k σ ≤ cleanCount k σ := by sorry

end CachingML.PredMarker
Source
Lykouris, Vassilvitskii, Competitive Caching with Machine Learned Advice, arXiv:1802.05399v4, p. 16, proof of Theorem 3.3, last sentence ("since Opt(σ) ≤ Q")
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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