Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every level of the BCR space family is taut

Proved
KServer.bcrLevel2_taut

by Gabewhigham · Sep 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

k-serverlower-boundsmetric-geometryonline-algorithms

Every point of a level of the corrected BCR space family lies on a shortest path between the marked points.

The space family of the Bubeck--Coester--Rabani lower bound is built by iterated theta gluing: level 000 is the path of β+1\beta+1β+1 equally spaced points with the endpoints marked, and level w+1w+1w+1 glues two chains of three copies of level www along their shared endpoints. The marked points of level www are at distance β 3w\beta\,3^{w}β3w.

A metric space with marked points s≠ts \ne ts=t is taut when

d(s,x)+d(x,t)  =  d(s,t)for every point x,d(s,x) + d(x,t) \;=\; d(s,t) \qquad \text{for every point } x,d(s,x)+d(x,t)=d(s,t)for every point x,

that is, when every point lies on a geodesic from sss to ttt. The statement asserts that every level of the family is taut. At level 000 this is the identity x+(β−x)=βx + (\beta - x) = \betax+(β−x)=β on the path; at level w+1w+1w+1 both glued chains have length 3 dw(sw,tw)3\,d_w(s_w,t_w)3dw​(sw​,tw​), which is exactly the new distance between the marked points, so tautness is inherited from the level below.

Role. Tautness is a standing hypothesis of the level step of the construction, KServer.level_step_sturdy and KServer.level_step_full: it is what makes the escape price comparable with the distance and lets the geometric estimates of the race argument be carried out on the chain. Any recursion over the space family has to discharge it at every level, and this statement does so once and for all.

Preamble
import Mathlib
import Definitions.Def_KServer_chunk_system
import Definitions.Def_KServer_cycle_glue
import Definitions.Def_KServer_bcr_space
import Definitions.Def_KServer_glue2
import Definitions.Def_KServer_theta_dists
import Definitions.Def_KServer_race_geo
import Definitions.Def_KServer_bcr_space2
Formal statement
namespace KServer

theorem bcrLevel2_taut (β : ℕ) (hβ : 0 < β) (w : ℕ) (x : (bcrLevel2 β hβ w).carrier) :
    dist (bcrLevel2 β hβ w).s x + dist x (bcrLevel2 β hβ w).t
      = dist (bcrLevel2 β hβ w).s (bcrLevel2 β hβ w).t := by sorry

end KServer
Source
S. Bubeck, C. Coester, Y. Rabani, 'The randomized k-server conjecture is false!', STOC 2023, https://arxiv.org/abs/2211.05753, Section 4 (the space M_w is a union of two geodesics between s_w and t_w); tautness hypothesis of the platform theorems KServer.level_step_sturdy and KServer.level_step_full, for the space family bcrLevel2.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me