Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A nonexpansive ball bijection that keeps the sphere is homogeneous at every preimage of a point of a finite-dimensional face

Proved
Plasticity.Faces.map_smul_of_map_mem_face

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

Let X,YX,YX,Y be real normed spaces and FFF a map that is nonexpansive and injective on BXB_XBX​, with BY⊆F(BX)B_Y\subseteq F(B_X)BY​⊆F(BX​) (so that FFF maps BXB_XBX​ bijectively onto BYB_YBY​) and F(SX)⊆SYF(S_X)\subseteq S_YF(SX​)⊆SY​. If CCC is a finite-dimensional face of BYB_YBY​ contained in the sphere and F(x)∈CF(x)\in CF(x)∈C for some x∈BXx\in B_Xx∈BX​, then F(tx)=tF(x)F(tx)=tF(x)F(tx)=tF(x) for every t∈[−1,1]t\in[-1,1]t∈[−1,1]. By induction on dim⁡C\dim CdimC: the face theorem gives the preimage face DDD and F(tD)=tCF(tD)=tCF(tD)=tC; boundary preimages are homogeneous by induction, so FFF is isometric between them (card Plasticity.BallMap.norm_map_sub_map_eq_of_map_smul), hence isometric on tDtDtD along chords, and F(tx)/tF(tx)/tF(tx)/t and F(x)F(x)F(x) have the same distances to every boundary point of CCC.

Preamble
import Definitions.Def_Plasticity_Faces
import Mathlib.Topology.EMetricSpace.Lipschitz
Formal statement
namespace Plasticity.Faces
theorem map_smul_of_map_mem_face {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))
    (hsphere : Set.MapsTo F (Metric.sphere (0 : X) 1) (Metric.sphere (0 : Y) 1))
    (C : Set Y) (hC : IsSphereFace C) (hfin : FiniteDimensional ℝ (vectorSpan ℝ C))
    (x : X) (hx : x ∈ Metric.closedBall (0 : X) 1) (hFx : F x ∈ C) :
    ∀ t ∈ Set.Icc (-1 : ℝ) 1, F (t • x) = t • F x := by sorry
end Plasticity.Faces
Source
C. Angosto, V. Kadets, O. Zavarzina, J. Math. Anal. Appl. 471 (2019), proof of Theorem 4.11 (arXiv:1808.08534), with the face theorem of claim F17 (card Plasticity.Faces.matchesFace_of_finiteDimensional) in place of their Theorems 4.8–4.9; expositions/faces/finite_faces_boundary_crossing.md §6
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 assumed complete or finite-dimensional. 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:

  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.) 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 to sphere.) ∥F(x)∥=1\|F(x)\|=1∥F(x)∥=1 whenever ∥x∥=1\|x\|=1∥x∥=1, that is, F(SX)⊆SYF(S_X)\subseteq S_YF(SX​)⊆SY​.
  5. C⊆YC\subseteq YC⊆Y is a set that is nonempty, convex, contained in SYS_YSY​, and an extreme subset of BYB_YBY​: 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.
  6. The linear subspace span⁡{c−c′:c,c′∈C}\operatorname{span}\{c-c':c,c'\in C\}span{c−c′:c,c′∈C} is finite-dimensional.
  7. x∈Xx\in Xx∈X satisfies ∥x∥≤1\|x\|\le 1∥x∥≤1.
  8. F(x)∈CF(x)\in CF(x)∈C.

Conclusion: for every real ttt with −1≤t≤1-1\le t\le 1−1≤t≤1,

F(tx)=t F(x).F(tx)=t\,F(x).F(tx)=tF(x).

The statement holds for every FFF, CCC and xxx meeting these hypotheses; nothing is said about FFF outside BXB_XBX​ (all points txtxtx in the conclusion lie in BXB_XBX​).

Flags

Lean conventions. None changes the meaning; the remarks on Set.SurjOn, LipschitzOnWith and vectorSpan made for the previous card apply here too. The conclusion is a universally quantified equation over t∈[−1,1]t\in[-1,1]t∈[−1,1], not a hypothesis.

Splitting the bijection (purpose note). The choice is correct, by the argument given for the previous card: hypotheses 2 and 3 give F(BX)⊆BYF(B_X)\subseteq B_YF(BX​)⊆BY​ and F(0)=0F(0)=0F(0)=0, so hypotheses 1 to 3 say exactly that FFF restricted to BXB_XBX​ is a nonexpansive bijection onto BYB_YBY​. Further consequences used below: every point of BXB_XBX​ that FFF sends into SYS_YSY​ lies in SXS_XSX​ (if F(p)=u∈SYF(p)=u\in S_YF(p)=u∈SY​ and F(q)=−uF(q)=-uF(q)=−u with q∈BXq\in B_Xq∈BX​, then 2≤∥p−q∥≤∥p∥+∥q∥2\le\|p-q\|\le\|p\|+\|q\|2≤∥p−q∥≤∥p∥+∥q∥), so hypotheses 7 and 8 force ∥x∥=1\|x\|=1∥x∥=1. With hypothesis 4 one also gets ∥F(z)∥=∥z∥\|F(z)\|=\|z\|∥F(z)∥=∥z∥ for all z∈BXz\in B_Xz∈BX​ (the bound ≤\le≤ from F(0)=0F(0)=0F(0)=0, the bound ≥\ge≥ from ∥F(z/∥z∥)∥=1\|F(z/\|z\|)\|=1∥F(z/∥z∥)∥=1 and ∥F(z/∥z∥)−F(z)∥≤1−∥z∥\|F(z/\|z\|)-F(z)\|\le 1-\|z\|∥F(z/∥z∥)−F(z)∥≤1−∥z∥).

Degenerate cases. If Y={0}Y=\{0\}Y={0} then SY=∅S_Y=\emptysetSY​=∅, so no nonempty C⊆SYC\subseteq S_YC⊆SY​ exists and the statement is vacuous. Faces of dimension 000 are the singletons {e}\{e\}{e} with eee an extreme point of BYB_YBY​; then hypothesis 6 holds trivially. The hypotheses are satisfiable, for example by F=idF=\mathrm{id}F=id on R\mathbb RR, C={1}C=\{1\}C={1}, x=1x=1x=1. Hypothesis 6 restricts only the one face CCC, not the rest of SYS_YSY​.

Hypotheses, one at a time.

  • Hypothesis 1: for singleton faces the statement stays true without it, provided hypothesis 4 is kept (argument below); for faces of positive dimension I cannot say.
  • Hypothesis 2 is needed: X=RX=\mathbb RX=R, Y=(R2,∥⋅∥∞)Y=(\mathbb R^2,\|\cdot\|_\infty)Y=(R2,∥⋅∥∞​), F(t)=(t,∣t∣)F(t)=(t,|t|)F(t)=(t,∣t∣), C={(1,1)}C=\{(1,1)\}C={(1,1)}, x=1x=1x=1 satisfies all other hypotheses, but F(−1)=(−1,1)≠−F(1)F(-1)=(-1,1)\ne-F(1)F(−1)=(−1,1)=−F(1).
  • Hypothesis 3 is needed: X=Y=RX=Y=\mathbb RX=Y=R, F(t)=t3F(t)=t^3F(t)=t3, C={1}C=\{1\}C={1}, x=1x=1x=1.
  • Hypothesis 4: for singleton faces the statement stays true without it, provided hypothesis 1 is kept (argument below); for faces of positive dimension I cannot say, and I know no argument deriving hypothesis 4 from hypotheses 1 to 3 in infinite dimensions. Since the previous card does not assume hypothesis 4, it may be removable here as well if the face argument does not use it.
  • Hypotheses 5 and 8 are not known to be removable. Dropping 5 allows C={F(x)}C=\{F(x)\}C={F(x)} for every x∈BXx\in B_Xx∈BX​, and dropping 8 leaves CCC unrelated to xxx; either way the statement would assert homogeneity on every diameter of BXB_XBX​, which together with card 3 makes every such FFF an isometry, an open statement in general.
  • Hypothesis 6 likewise: every point of SYS_YSY​ lies in a sphere face (its minimal face), so without 6 the statement together with card 3 would give the plasticity conclusion for every FFF satisfying 1 to 4, which is open.
  • Hypothesis 7 is needed: X=Y=RX=Y=\mathbb RX=Y=R, F(t)=tF(t)=tF(t)=t for ∣t∣≤1|t|\le 1∣t∣≤1 and F(t)=1F(t)=1F(t)=1 otherwise, C={1}C=\{1\}C={1}, x=2x=2x=2; then F(1)=1≠12F(2)F(1)=1\ne\tfrac12 F(2)F(1)=1=21​F(2).
  • Within hypothesis 5, nonemptiness follows from 8, the inclusion C⊆BYC\subseteq B_YC⊆BY​ from C⊆SYC\subseteq S_YC⊆SY​, and convexity can be dropped by applying the convex case to the minimal face of F(x)F(x)F(x), which lies in CCC; these redundancies are harmless.

The singleton case. Let C={e}C=\{e\}C={e}, so F(x)=eF(x)=eF(x)=e. For 0<a<10<a<10<a<1, ∥F(ax)∥≤a\|F(ax)\|\le a∥F(ax)∥≤a and ∥e−F(ax)∥≤1−a\|e-F(ax)\|\le 1-a∥e−F(ax)∥≤1−a, so e=a⋅F(ax)a+(1−a)⋅e−F(ax)1−ae=a\cdot\frac{F(ax)}{a}+(1-a)\cdot\frac{e-F(ax)}{1-a}e=a⋅aF(ax)​+(1−a)⋅1−ae−F(ax)​ is a convex combination of points of BYB_YBY​, and extremality gives F(ax)=aeF(ax)=aeF(ax)=ae. Choose v∈BXv\in B_Xv∈BX​ with F(v)=−eF(v)=-eF(v)=−e; then ∥x−v∥=2\|x-v\|=2∥x−v∥=2 and likewise F(av)=−aeF(av)=-aeF(av)=−ae for a∈[0,1]a\in[0,1]a∈[0,1]. For m=12(x+v)m=\tfrac12(x+v)m=21​(x+v), ∥F(m)−e∥≤1\|F(m)-e\|\le 1∥F(m)−e∥≤1 and ∥F(m)+e∥≤1\|F(m)+e\|\le 1∥F(m)+e∥≤1, so e=12(e+F(m))+12(e−F(m))e=\tfrac12(e+F(m))+\tfrac12(e-F(m))e=21​(e+F(m))+21​(e−F(m)) forces F(m)=0F(m)=0F(m)=0. Then m=0m=0m=0 follows either from injectivity and F(0)=0F(0)=0F(0)=0 or from norm preservation (which uses hypothesis 4), so v=−xv=-xv=−x and F(−ax)=−aF(x)F(-ax)=-aF(x)F(−ax)=−aF(x).

Name. map_smul_of_map_mem_face describes the statement accurately; it does not mention that the face is finite-dimensional or that ttt ranges over [−1,1][-1,1][−1,1], which is acceptable.

Truth. I believe the statement is true as written. I verified it fully for faces of dimension 000, and for X=YX=YX=Y finite-dimensional it follows from the classical fact that a nonexpansive bijection of a compact metric space onto itself is an isometry, combined with F(0)=0F(0)=0F(0)=0 and Mankiewicz's theorem. For faces of positive dimension in infinite-dimensional spaces, the elementary estimates only give F(tx)∈tCF(tx)\in tCF(tx)∈tC for t∈[0,1]t\in[0,1]t∈[0,1], and pinning F(tx)=tF(x)F(tx)=tF(x)F(tx)=tF(x) needs a further argument (presumably invariance of domain on the finite-dimensional face) that I did not reconstruct; I found no counterexample.

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