Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — (22) is a metric and AAA is 1-strongly Euclidean

Open
BourgainUnion.Euclidean.Supplement.lemma_6_2

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

discrete-geometryfunctional-analysisp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

For every integer m≥1m\ge1m≥1 and every real r>0r>0r>0, the distance (22) on the two-layer cube Xm=A∪BX_m=A\cup BXm​=A∪B is a metric: it vanishes exactly on the diagonal, is nonnegative and symmetric, and satisfies the triangle inequality. Moreover AAA is 1-strongly Euclidean in XmX_mXm​: AAA and A∪{x}A\cup\{x\}A∪{x}, for every x∈Xmx\in X_mx∈Xm​, embed isometrically into ℓ2\ell_2ℓ2​.

Differences from the source:

  • encoding: X_m = A ∪ B, two copies of {0,1}^m → Bool × (Fin m → Bool), with a_x = (false, x) and b_x = (true, x); reason: a relabeling of the points
  • encoding: (22) defines a metric on X_m → the raw distance satisfies the published IsPseudometric and separates points; reason: these are exactly the metric axioms
  • encoding: A is 1-strongly Euclidean in X_m → RawEuclidean of A and of A ∪ {x} for every x, for the raw distance (22); reason: this is OneStrong for the metric (22), stated without installing a metric instance before the metric axioms are proved
  • encoding: real ℓ₂ → square-summable real sequences H2 = lp (fun _ : ℕ => ℝ) 2; reason: H2 is real ℓ₂, the published target of the base mission
Preamble
import Mathlib
import Definitions.Def_BourgainUnion_Euclidean_GraphModel
import Definitions.Def_BourgainUnion_Euclidean_Supplement_CubeModel

set_option autoImplicit false
open scoped BigOperators ENNReal
noncomputable section
Formal statement
namespace BourgainUnion.Euclidean.Supplement

open BourgainUnion.Euclidean

/-- Lemma 6.2, p. 26: (22) is a metric on `X_m` and `A` is 1-strongly Euclidean in it, stated
for the raw distance (no metric instance is assumed). -/
theorem lemma_6_2 (m : ℕ) (hm : 1 ≤ m) (r : ℝ) (hr : 0 < r) :
    GeometryOfGraphs.FlowCut.IsPseudometric (cubeDist m r) ∧
    (∀ x y, cubeDist m r x y = 0 → x = y) ∧
    RawEuclidean (cubeDist m r) (layerA m) ∧
    ∀ x : Cube m, RawEuclidean (cubeDist m r) (layerA m ∪ {x}) := by sorry

end BourgainUnion.Euclidean.Supplement
Source
Dimitar Chakarov, Sepideh Mahabadi, Yury Makarychev, Ali Vakilian, Bourgain's Theorem for a Union of Euclidean Metric Spaces, STOC 2027 submission #699 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/699.pdf, PDF = printed p. 26, §6.1, Lemma 6.2, equation (22)

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