Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§2, (1.10) — the equidistant locus is a sphere having LrL_rLr​ as its axis

Proved
RelaxationMethod.LowDim.axisSphere_eq

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

affine-subspaceorthogonal-projectionp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1sphere

Let LLL be a nonempty flat of EnE_nEn​ with direction space VVV, and let p∉Lp \notin Lp∈/L. Let bbb be the orthogonal projection of ppp onto LLL and X={x:∣x−a∣=∣p−a∣ for every a∈L}X = \{x : |x - a| = |p - a| \text{ for every } a \in L\}X={x:∣x−a∣=∣p−a∣ for every a∈L} the locus (1.10). Then:

  1. XXX is the sphere, inside the flat through bbb normal to LLL, with centre bbb passing through ppp:
X={x:x−b∈V⊥, ∣x−b∣=∣p−b∣};X = \{x : x - b \in V^{\perp},\ |x - b| = |p - b|\};X={x:x−b∈V⊥, ∣x−b∣=∣p−b∣};
  1. LLL is exactly the set of points equidistant from all points of XXX:
L={a:∣x−a∣=∣p−a∣ for every x∈X}.L = \{a : |x - a| = |p - a| \text{ for every } x \in X\}.L={a:∣x−a∣=∣p−a∣ for every x∈X}.

This is the claim of §2 that justifies calling XXX a spherical surface Sn−r−1S_{n-r-1}Sn−r−1​ with axis LLL; it identifies the set on which Theorem 2, Case 2 places the tail of a reflexion sequence.

Formalization Note The flat is an arbitrary nonempty AffineSubspace ℝ (EuclideanSpace ℝ (Fin n)); the paper's 0⩽r⩽n−10 \leqslant r \leqslant n-10⩽r⩽n−1 follows from p∉Lp \notin Lp∈/L. The orthogonal projection is Mathlib's EuclideanGeometry.orthogonalProjection, and "the (n−r)(n-r)(n−r)-flat normal to LrL_rLr​ at bbb" is written as x−b∈V⊥x - b \in V^{\perp}x−b∈V⊥. The dimension count n−r−1n - r - 1n−r−1 of the sphere is not part of the statement.

Preamble
import Mathlib
import Definitions.Def_RelaxationMethod_LowDim_AxisSphere
Formal statement
namespace RelaxationMethod.LowDim

/-- §2, p. 395: for a flat `L` and a point `p ∉ L`, with `b` the orthogonal projection of `p`
onto `L`, the locus (1.10) is the sphere of the flat through `b` normal to `L`, centred at `b`
and passing through `p`; and `L` is exactly the set of points equidistant from all points of
that sphere. -/
theorem axisSphere_eq {n : ℕ} (L : AffineSubspace ℝ (EuclideanSpace ℝ (Fin n))) [Nonempty L]
    (p : EuclideanSpace ℝ (Fin n)) (hp : p ∉ L) :
    axisSphere L p =
        {x | x -ᵥ (EuclideanGeometry.orthogonalProjection L p : EuclideanSpace ℝ (Fin n)) ∈
              L.directionᗮ ∧
            dist x (EuclideanGeometry.orthogonalProjection L p : EuclideanSpace ℝ (Fin n)) =
              dist p (EuclideanGeometry.orthogonalProjection L p : EuclideanSpace ℝ (Fin n))} ∧
      (L : Set (EuclideanSpace ℝ (Fin n))) =
        {a | ∀ x ∈ axisSphere L p, dist x a = dist p a} := by sorry

end RelaxationMethod.LowDim
Source
Motzkin and Schoenberg, The relaxation method for linear inequalities, Canad. J. Math. 6 (1954), DOI 10.4153/CJM-1954-038-x, p. 395, §2, (1.10)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Work in Rn\mathbb{R}^nRn with Euclidean distance.

  • LLL is a nonempty affine subspace of Rn\mathbb{R}^nRn, with direction (linear subspace) L⃗\vec LL.
  • p∈Rnp\in\mathbb{R}^np∈Rn is a point with p∉Lp\notin Lp∈/L.
  • bbb is the orthogonal projection of ppp onto LLL.
  • For any affine subspace MMM and point ccc, write
S(M,c)={x:∣x−a∣=∣c−a∣ ∀a∈M}.S(M,c)=\{x: |x-a|=|c-a|\ \forall a\in M\}.S(M,c)={x:∣x−a∣=∣c−a∣ ∀a∈M}.

Claim. Both of the following hold.

  1. The locus is a sphere in the normal flat through bbb:
S(L,p)={x∈Rn:x−b∈L⃗⊥  and  ∣x−b∣=∣p−b∣}.S(L,p)=\{x\in\mathbb{R}^n : x-b\in \vec L^{\perp}\ \text{ and }\ |x-b|=|p-b|\}.S(L,p)={x∈Rn:x−b∈L⊥  and  ∣x−b∣=∣p−b∣}.

This is the set of points xxx such that x−bx-bx−b is orthogonal to every direction vector of LLL, and xxx is at the same distance from bbb as ppp is. 2. LLL can be recovered from the locus:

L={a∈Rn:∣x−a∣=∣p−a∣ for every x∈S(L,p)}.L=\{a\in\mathbb{R}^n : |x-a|=|p-a| \text{ for every } x\in S(L,p)\}.L={a∈Rn:∣x−a∣=∣p−a∣ for every x∈S(L,p)}.

Degenerate cases:

  • L=RnL=\mathbb{R}^nL=Rn is impossible. The hypothesis p∉Lp\notin Lp∈/L rules it out, so in particular n≥1n\ge 1n≥1.
  • LLL empty is excluded by hypothesis.
  • LLL a single point {b}\{b\}{b}. Then L⃗={0}\vec L=\{0\}L={0} and L⃗⊥=Rn\vec L^\perp=\mathbb{R}^nL⊥=Rn, so the right side of part 1 is the full sphere of radius ∣p−b∣>0|p-b|>0∣p−b∣>0 about bbb.
  • LLL a hyperplane. L⃗⊥\vec L^\perpL⊥ is a line, so the right side of part 1 consists of exactly two points.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me