Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A linear contraction between spaces of equal finite dimension whose image of the ball contains every extreme point of the target ball is an onto isometry

Proved
Plasticity.Plane.exists_linearIsometryEquiv_of_contraction_of_extremePoints

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

Let V,WV,WV,W be finite-dimensional real normed spaces of the same dimension, let A ⁣:V→WA\colon V\to WA:V→W be linear with ∥Av∥≤∥v∥\|Av\|\le\|v\|∥Av∥≤∥v∥ for every v∈Vv\in Vv∈V, and let g ⁣:W→Vg\colon W\to Vg:W→V satisfy

∥g(w)∥≤1andA(g(w))=w\|g(w)\|\le1\quad\text{and}\quad A(g(w))=w∥g(w)∥≤1andA(g(w))=w

for every extreme point www of the closed unit ball of WWW. Then AAA is a linear isometry of VVV onto WWW: there is a surjective linear isometry L ⁣:V→WL\colon V\to WL:V→W with Lv=AvLv=AvLv=Av for every v∈Vv\in Vv∈V. Only the values of ggg at extreme points enter; the hypothesis says that the image under AAA of the closed unit ball of VVV contains every extreme point of the closed unit ball of WWW.

Preamble
import Mathlib.Analysis.Convex.KreinMilman
import Mathlib.Analysis.Normed.Operator.LinearIsometry
import Mathlib.LinearAlgebra.Dimension.Finrank
Formal statement
namespace Plasticity.Plane
theorem exists_linearIsometryEquiv_of_contraction_of_extremePoints {V W : Type*}
    [NormedAddCommGroup V] [NormedSpace ℝ V] [NormedAddCommGroup W] [NormedSpace ℝ W]
    [FiniteDimensional ℝ V] [FiniteDimensional ℝ W]
    (hdim : Module.finrank ℝ V = Module.finrank ℝ W)
    (A : V →ₗ[ℝ] W) (hA : ∀ v, ‖A v‖ ≤ ‖v‖) (g : W → V)
    (hg : ∀ w ∈ Set.extremePoints ℝ (Metric.closedBall (0 : W) 1),
      ‖g w‖ ≤ 1 ∧ A (g w) = w) :
    ∃ L : V ≃ₗᵢ[ℝ] W, ∀ v, L v = A v := by sorry
end Plasticity.Plane
Source
This repository: closing step of claim CUB101 (claims/cub.md), Proposition 3.2 in expositions/c0_separated_edge_planes.md §3, also used for claims CUB106(3) and CUB108 (expositions/c0_planar_mixtures.md §§2, 4); with the Krein–Milman theorem

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