Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Sphere covered by finite-dimensional faces, normed spaces: every nonexpansive bijection onto the ball is linear

Proved
Plasticity.Faces.exists_linearIsometryEquiv_of_sphere_covered_normedSpace

by scanstone · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let X,YX,YX,Y be real normed spaces, not necessarily complete, such that every point of the unit sphere of YYY lies in a finite-dimensional face of BYB_YBY​ contained in the sphere. Then every map FFF that is nonexpansive and injective on BXB_XBX​ with BY⊆F(BX)B_Y\subseteq F(B_X)BY​⊆F(BX​) (that is, every nonexpansive bijection of BXB_XBX​ onto BYB_YBY​; that FFF maps BXB_XBX​ into BYB_YBY​ follows) is the restriction of a surjective linear isometry T ⁣:X→YT\colon X\to YT:X→Y. This is the card Plasticity.Faces.exists_linearIsometryEquiv_of_sphere_covered without completeness: the proof ends as Angosto–Kadets–Zavarzina's Theorem 4.11, by homogeneity on every preimage face and the Mazur–Ulam theorem, instead of through the sphere-preservation theorem U10.

Preamble
import Definitions.Def_Plasticity_Faces
import Mathlib.Analysis.Normed.Operator.LinearIsometry
import Mathlib.Topology.EMetricSpace.Lipschitz
Formal statement
namespace Plasticity.Faces
theorem exists_linearIsometryEquiv_of_sphere_covered_normedSpace {X Y : Type*}
    [NormedAddCommGroup X] [NormedSpace ℝ X] [NormedAddCommGroup Y] [NormedSpace ℝ Y]
    (F : X → Y)
    (hinj : Set.InjOn F (Metric.closedBall (0 : X) 1))
    (hsurj : Set.SurjOn F (Metric.closedBall (0 : X) 1) (Metric.closedBall (0 : Y) 1))
    (hlip : LipschitzOnWith 1 F (Metric.closedBall (0 : X) 1))
    (hcover : ∀ y ∈ Metric.sphere (0 : Y) 1, ∃ C : Set Y,
      IsSphereFace C ∧ FiniteDimensional ℝ (vectorSpan ℝ C) ∧ y ∈ C) :
    ∃ T : X ≃ₗᵢ[ℝ] Y, Set.EqOn F T (Metric.closedBall (0 : X) 1) := by sorry
end Plasticity.Faces
Source
This repository: claim F17 (claims/f.md), expositions/faces/finite_faces_boundary_crossing.md §6; compare C. Angosto, V. Kadets, O. Zavarzina, J. Math. Anal. Appl. 471 (2019), Theorem 4.11
Read-back

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

Read-back

Let XXX and YYY be real normed spaces. Neither space is assumed complete or finite-dimensional, and they may live in different universes. Write BX={x∈X:∥x∥≤1}B_X=\{x\in X:\|x\|\le 1\}BX​={x∈X:∥x∥≤1} and SX={x∈X:∥x∥=1}S_X=\{x\in X:\|x\|=1\}SX​={x∈X:∥x∥=1}, and define BYB_YBY​ and SYS_YSY​ in the same way. Let F ⁣:X→YF\colon X\to YF:X→Y be an arbitrary function defined on all of XXX. Assume the following four hypotheses.

  1. (Injective on the ball.) For all x,x′∈BXx,x'\in B_Xx,x′∈BX​, F(x)=F(x′)F(x)=F(x')F(x)=F(x′) implies x=x′x=x'x=x′.
  2. (Onto the ball.) Every y∈BYy\in B_Yy∈BY​ equals F(x)F(x)F(x) for some x∈BXx\in B_Xx∈BX​, that is, BY⊆F(BX)B_Y\subseteq F(B_X)BY​⊆F(BX​); the inclusion F(BX)⊆BYF(B_X)\subseteq B_YF(BX​)⊆BY​ is not assumed.
  3. (Nonexpansive on the ball.) ∥F(x)−F(x′)∥≤∥x−x′∥\|F(x)-F(x')\|\le\|x-x'\|∥F(x)−F(x′)∥≤∥x−x′∥ for all x,x′∈BXx,x'\in B_Xx,x′∈BX​.
  4. (Sphere covered by finite-dimensional sphere faces.) For every y∈SYy\in S_Yy∈SY​ there is a set C⊆YC\subseteq YC⊆Y with y∈Cy\in Cy∈C such that: (a) CCC is nonempty; (b) CCC is convex; (c) C⊆SYC\subseteq S_YC⊆SY​; (d) CCC is an extreme subset of BYB_YBY​, meaning C⊆BYC\subseteq B_YC⊆BY​ and, whenever y1,y2∈BYy_1,y_2\in B_Yy1​,y2​∈BY​, c∈Cc\in Cc∈C and c=λy1+(1−λ)y2c=\lambda y_1+(1-\lambda)y_2c=λy1​+(1−λ)y2​ for some 0<λ<10<\lambda<10<λ<1, both y1y_1y1​ and y2y_2y2​ belong to CCC; (e) the linear subspace span⁡{c−c′:c,c′∈C}\operatorname{span}\{c-c' : c,c'\in C\}span{c−c′:c,c′∈C} (the direction space of the affine hull of CCC) is finite-dimensional.

Conclusion: there exists a map T ⁣:X→YT\colon X\to YT:X→Y that is linear, bijective and norm-preserving, ∥T(x)∥=∥x∥\|T(x)\|=\|x\|∥T(x)∥=∥x∥ for all x∈Xx\in Xx∈X, such that

F(x)=T(x)for every x∈BX.F(x)=T(x)\qquad\text{for every }x\in B_X.F(x)=T(x)for every x∈BX​.

Nothing is assumed or asserted about the values of FFF outside BXB_XBX​. No hypothesis says that FFF maps SXS_XSX​ into SYS_YSY​, and no covering hypothesis is made on SXS_XSX​.

Flags

Lean conventions. None changes the meaning. Set.SurjOn F B_X B_Y means BY⊆F(BX)B_Y\subseteq F(B_X)BY​⊆F(BX​), not a map into BYB_YBY​. LipschitzOnWith 1 is phrased with extended distances but is the ordinary inequality of hypothesis 3. vectorSpan ℝ C is the direction space of the affine hull, so (e) says the affine hull of CCC is finite-dimensional, which is equivalent to the linear span of CCC being finite-dimensional. X ≃ₗᵢ[ℝ] Y is a surjective linear isometry, so the conclusion includes that XXX and YYY are isometrically isomorphic.

Splitting the bijection (purpose note). The choice is correct. Hypotheses 2 and 3 alone give F(BX)⊆BYF(B_X)\subseteq B_YF(BX​)⊆BY​: if z∈BXz\in B_Xz∈BX​ had ∥F(z)∥>1\|F(z)\|>1∥F(z)∥>1, the point u=−F(z)/∥F(z)∥∈SYu=-F(z)/\|F(z)\|\in S_Yu=−F(z)/∥F(z)∥∈SY​ would have a preimage p∈BXp\in B_Xp∈BX​, and ∥F(z)−F(p)∥=∥F(z)∥+1>2≥∥z−p∥\|F(z)-F(p)\|=\|F(z)\|+1>2\ge\|z-p\|∥F(z)−F(p)∥=∥F(z)∥+1>2≥∥z−p∥ would contradict hypothesis 3. Hence hypotheses 1 to 3 together say exactly that the restriction of FFF to BXB_XBX​ is a nonexpansive bijection of BXB_XBX​ onto BYB_YBY​, with no loss against a bijection formulation. The same two hypotheses also give F(0)=0F(0)=0F(0)=0: if F(0)≠0F(0)\ne 0F(0)=0, a preimage p∈BXp\in B_Xp∈BX​ of −F(0)/∥F(0)∥-F(0)/\|F(0)\|−F(0)/∥F(0)∥ gives ∥F(0)−F(p)∥=1+∥F(0)∥>1≥∥p∥\|F(0)-F(p)\|=1+\|F(0)\|>1\ge\|p\|∥F(0)−F(p)∥=1+∥F(0)∥>1≥∥p∥.

Degenerate cases. If X=Y={0}X=Y=\{0\}X=Y={0} the statement holds trivially. If X={0}≠YX=\{0\}\ne YX={0}=Y, hypothesis 2 fails, and if Y={0}≠XY=\{0\}\ne XY={0}=X, hypothesis 1 fails, so both cases are vacuous. Hypothesis 4 holds automatically when YYY is finite-dimensional (take CCC to be the minimal face of BYB_YBY​ containing yyy) and when YYY is strictly convex (take C={y}C=\{y\}C={y}). The hypotheses are satisfiable, for example by F=idF=\mathrm{id}F=id on R\mathbb RR, so the statement is not vacuous.

Hypotheses, one at a time.

  • Hypothesis 1 is needed: X=(R2,∥⋅∥∞)X=(\mathbb R^2,\|\cdot\|_\infty)X=(R2,∥⋅∥∞​), Y=RY=\mathbb RY=R, F(z)=z1F(z)=z_1F(z)=z1​ satisfies 2 to 4 (faces {±1}\{\pm1\}{±1}), but no linear bijection R2→R\mathbb R^2\to\mathbb RR2→R exists.
  • Hypothesis 2 is needed: X=Y=RX=Y=\mathbb RX=Y=R, F(t)=t/2F(t)=t/2F(t)=t/2 satisfies 1, 3 and 4 but agrees with no isometry on [−1,1][-1,1][−1,1].
  • Hypothesis 3 is needed: X=Y=RX=Y=\mathbb RX=Y=R, F(t)=t3F(t)=t^3F(t)=t3 satisfies 1, 2 and 4.
  • Hypothesis 4 is not known to be removable: without it the statement asserts that every nonexpansive bijection between the unit balls of two real normed spaces is the restriction of a linear isometry, which contains the open plasticity conjecture.
  • Inside hypothesis 4, conjuncts (a), (b) and (c) are redundant: any extreme subset of BYB_YBY​ containing y∈SYy\in S_Yy∈SY​ contains the minimal face of yyy, which is nonempty, convex and contained in SYS_YSY​, so hypothesis 4 is equivalent to "the minimal face of every y∈SYy\in S_Yy∈SY​ has finite-dimensional affine hull". This redundancy is harmless.

Name. The name describes the statement only in part. exists_linearIsometryEquiv alone suggests merely that XXX and YYY are isometrically isomorphic, while the statement says that FFF itself coincides on BXB_XBX​ with such an isomorphism. sphere_covered does not say which sphere (it is SYS_YSY​) or by what (sphere faces with finite-dimensional affine hull). A name such as exists_linearIsometryEquiv_eqOn_closedBall_of_sphere_covered_by_finiteDimensional_faces would be more exact; this is a minor point.

Truth. I believe the statement is true as written. The route I see: card 2 applies to every x∈SXx\in S_Xx∈SX​ once F(SX)⊆SYF(S_X)\subseteq S_YF(SX​)⊆SY​ is known, homogeneity on diameters through sphere points then gives homogeneity on every diameter [−x,x][-x,x][−x,x] with x∈BXx\in B_Xx∈BX​, card 3 makes FFF an isometry of BXB_XBX​ onto BYB_YBY​ fixing 000, and Mankiewicz's extension theorem (valid in real normed spaces) turns it into a linear isometry TTT with T(BX)=BYT(B_X)=B_YT(BX​)=BY​, hence surjective. The steps I did not reconstruct independently are the derivation of F(SX)⊆SYF(S_X)\subseteq S_YF(SX​)⊆SY​ from hypothesis 4 and card 2 for faces of positive dimension, both of which appear to need a dimension argument on the finite-dimensional faces.

Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by scanstone · Oct 15, 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