Every level of the BCR space family is taut
ProvedKServer.bcrLevel2_tautEvery 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 is the path of equally spaced points with the endpoints marked, and level glues two chains of three copies of level along their shared endpoints. The marked points of level are at distance .
A metric space with marked points is taut when
that is, when every point lies on a geodesic from to . The statement asserts that every level of the family is taut. At level this is the identity on the path; at level both glued chains have length , 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.
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
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