Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A support-preserving nonexpansive bijection of the ball of a c0c_0c0​ sum of finite-dimensional spaces is an isometry

Proved
Plasticity.C0Sum.isometryOn_of_support

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

Let (Ei)i∈I(E_i)_{i\in I}(Ei​)i∈I​ be a family of finite-dimensional real normed spaces over an arbitrary index set, and let X=c0(I;Ei)X=c_0(I;E_i)X=c0​(I;Ei​) carry the supremum block norm, with closed unit ball BBB. Let F ⁣:X→XF\colon X\to XF:X→X map BBB bijectively onto BBB, be 111-Lipschitz on BBB, and preserve supports: F(x)i=0F(x)_i=0F(x)i​=0 if and only if xi=0x_i=0xi​=0, for every x∈Bx\in Bx∈B and i∈Ii\in Ii∈I. Then

∥F(x)−F(y)∥=∥x−y∥(x,y∈B).\|F(x)-F(y)\|=\|x-y\|\qquad(x,y\in B).∥F(x)−F(y)∥=∥x−y∥(x,y∈B).
Preamble
import Definitions.Def_Plasticity_C0Sum
import Mathlib.LinearAlgebra.Dimension.Finrank
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.Topology.EMetricSpace.Lipschitz
Formal statement
namespace Plasticity.C0Sum
theorem isometryOn_of_support {ι : Type*}
    (E : ι → Type*) [∀ i, NormedAddCommGroup (E i)] [∀ i, NormedSpace ℝ (E i)]
    [∀ i, FiniteDimensional ℝ (E i)]
    (F : c0Sum E → c0Sum E)
    (hbij : Set.BijOn F (Metric.closedBall 0 1) (Metric.closedBall 0 1))
    (hlip : LipschitzOnWith 1 F (Metric.closedBall 0 1))
    (hsupp : ∀ x ∈ Metric.closedBall (0 : c0Sum E) 1, ∀ i,
      (F x : lp E ⊤) i = 0 ↔ (x : lp E ⊤) i = 0) :
    ∀ x ∈ Metric.closedBall (0 : c0Sum E) 1, ∀ y ∈ Metric.closedBall (0 : c0Sum E) 1,
      ‖F x - F y‖ = ‖x - y‖ := by sorry
end Plasticity.C0Sum
Source
This repository: claim CUB100 (claims/cub.md), the ending in expositions/c0_one_general_plane.md §6 before Mankiewicz's theorem, by the Freudenthal–Hurewicz theorem on finitely supported slices (card Plasticity.Ext.FreudenthalHurewicz)

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