Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 (Milman) — every ddd-dimensional normed space has a subspace with a quotient onto Rk\mathbb R^kRk, k≥d/2k\ge d/2k≥d/2, with B2k⊆Q(BE)⊆MB2kB_2^k\subseteq Q(B_E)\subseteq M B_2^kB2k​⊆Q(BE​)⊆MB2k​

Proved
CBCLowerBound.EveryNorm.lemma_10

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

asymptotic-geometric-analysisfunctional-analysisnormed-spacesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

There is a universal constant M≥1M\ge1M≥1 such that, for every ddd-dimensional real normed vector space XXX, there are a subspace E⊆XE\subseteq XE⊆X, an integer k≥d/2k\ge d/2k≥d/2 and a linear map Q:E→RkQ:E\to\mathbb R^kQ:E→Rk satisfying

B2k⊆Q(BE)⊆M⋅B2k,B_2^k\subseteq Q(B_E)\subseteq M\cdot B_2^k,B2k​⊆Q(BE​)⊆M⋅B2k​,

where BE={x∈E:∥x∥X≤1}B_E=\{x\in E:\|x\|_X\le1\}BE​={x∈E:∥x∥X​≤1} is the unit ball of EEE and B2kB_2^kB2k​ is the (closed) Euclidean unit ball of Rk\mathbb R^kRk.

This is Milman's quotient-of-a-subspace theorem (Proc. AMS 1985) in the form used by the paper: the first inclusion lifts Euclidean movements to EEE at no greater cost, the second bounds the cost of projecting a trajectory from EEE to Rk\mathbb R^kRk, which transfers the Euclidean case of Proposition 9 to an arbitrary norm.

Differences from the source:

  • encoding: ℝ^k with the Euclidean norm → EuclideanSpace ℝ (Fin k); reason: Mathlib's Euclidean space
  • encoding: "d-dimensional normed vector space" and "k ≥ d/2" → a finite-dimensional real normed space with d = finrank, and (finrank : ℝ)/2 ≤ k; reason: same spaces; the inequality is read over the reals
Preamble
import Mathlib
Formal statement
namespace CBCLowerBound.EveryNorm

/-- **Lemma 10** (Milman's quotient-of-a-subspace theorem, [Mil85]; Christianson, STOC 2027
#674, p.15). There is a universal constant `M ≥ 1` such that, for every finite-dimensional real
normed space `X` of dimension `d`, there are a subspace `E ⊆ X`, an integer `k ≥ d/2` and a
linear map `Q : E → ℝ^k` with `B₂ᵏ ⊆ Q(B_E) ⊆ M · B₂ᵏ`, where `B_E = {x ∈ E : ‖x‖_X ≤ 1}` and
`B₂ᵏ` is the closed Euclidean unit ball of `ℝ^k`. -/
theorem lemma_10 : ∃ M : ℝ, 1 ≤ M ∧
    ∀ (X : Type) [NormedAddCommGroup X] [NormedSpace ℝ X] [FiniteDimensional ℝ X],
      ∃ (E : Submodule ℝ X) (k : ℕ) (Q : E →ₗ[ℝ] EuclideanSpace ℝ (Fin k)),
        (Module.finrank ℝ X : ℝ) / 2 ≤ k ∧
        Metric.closedBall (0 : EuclideanSpace ℝ (Fin k)) 1 ⊆ Q '' {x : E | ‖x‖ ≤ 1} ∧
        Q '' {x : E | ‖x‖ ≤ 1} ⊆ Metric.closedBall (0 : EuclideanSpace ℝ (Fin k)) M := by sorry

end CBCLowerBound.EveryNorm
Source
Nicolas Christianson, A Linear Lower Bound for Convex Body Chasing in Every Norm, STOC 2027 submission #674 (October 2026), p.15, Lemma 10 (citing V. D. Milman, Proc. AMS 94(3):445–449, 1985), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/674.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