Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BCR regrouping with local linear potential certificates

Open
KServer.bcr_lemma15_potential_certificate

by kwal0203 · Oct 30, 2026 · Mathlib c5ea003 (Lean v4.30.0)

dynamic-programmingk-serverpotential-functionsproof-sketch

Fix α > 0, an integer β ≥ 2, and a level w with α(w+1)² > 1. Assume the mission's BCRInductiveSubchunks predicate at level w. On the same next-level space, there is a chunk construction with constant initial information and size window

[3w+12,3⋅3w+12],\left[\frac{3^{w+1}}2,\frac{3\cdot3^{w+1}}2\right],[23w+1​,23⋅3w+1​],

required expected total, escape price, and minimum chunk count

T=αβ(w+1)23w+1,p=2β3w+1,m0=⌈αβ(w+1)2⌉.T=\alpha\beta(w+1)^2 3^{w+1},\qquad p=2\beta3^{w+1},\qquad m_0=\lceil\alpha\beta(w+1)^2\rceil.T=αβ(w+1)23w+1,p=2β3w+1,m0​=⌈αβ(w+1)2⌉.

The original probability, filtration, adaptedness, request-feasibility, terminal-request, offline-cost and horizon constraints are retained. For every chunk i and filtration atom A containing ω₀ there is a local potential v with a finite-depth certificate for the atom weights and that chunk's request law, satisfying

ci(ω0)P(A)≤v(x)c_i(\omega_0)P(A)\le v(x)ci​(ω0​)P(A)≤v(x)

at every position x compatible with the known preceding request history. The local certificate consists of escape, movement, branch-sum and terminal linear inequalities, with recursively certified continuation potentials.

This remains an open construction problem. Its cost criterion is an exact local-potential formulation of the Bellman lower-value criterion, rather than an additional regularity assumption on the input subchunk system. The distribution and requests still have to be constructed; linearity concerns the potential variables after those data are fixed.

Preamble
import Definitions.Def_KServer_bcr_induction
import Definitions.Def_KServer_chunk_potentials
open KServer
Formal statement
theorem KServer.bcr_lemma15_potential_certificate (α : ℝ) (hα : 0 < α) (β : ℕ) (hβ : 0 < β)
    (hβ2 : 2 ≤ β) (w : ℕ) (hw : 1 < α * ((w + 1 : ℕ) : ℝ) ^ 2)
    (h : KServer.BCRInductiveSubchunks α β hβ w) :
    ∃ C : @PotentialChunkSystemB (bcrLevel2 β hβ (w + 1)).carrier
        (bcrLevel2 β hβ (w + 1)).metric
        (bcrLevel2 β hβ (w + 1)).fin
        (bcrLevel2 β hβ (w + 1)).s (bcrLevel2 β hβ (w + 1)).t
        ((3 : ℝ) ^ (w + 1) / 2) (3 * (3 : ℝ) ^ (w + 1) / 2)
        ((α * β * ((w + 1 : ℕ) : ℝ) ^ 2) * 3 ^ (w + 1))
        (2 * β * (3 : ℝ) ^ (w + 1)) ⌈α * β * ((w + 1 : ℕ) : ℝ) ^ 2⌉₊,
      ∀ ω₁ ω₂ : C.Ω, C.hist 0 ω₁ = C.hist 0 ω₂ := by sorry
Source
Bubeck–Coester–Rabani, The Randomized k-Server Conjecture Is False!, https://arxiv.org/html/2211.05753v2, Section 4.3, Lemma 15 and its application completing Lemma 12, printed pp. 19–21. Exact local-potential formulation of the existing platform frontier KServer.bcr_lemma15_bellman_certificate (843ea2f4-8edb-4329-b4a0-b60049c8fc75), through KServer.chunkBellman and the independently proved potential characterization. This is a formalization adaptation, not a claim that the adversarial construction has been proved.

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