Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every c0c_0c0​ sum of spaces of dimension at most two is a c0c_0c0​ sum of lines and non-parallelogram planes

Proved
Plasticity.C0Sum.isometry_of_bijective_of_rank_le_two.reduction

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 real normed spaces over an arbitrary index set, each of dimension at most two (zero allowed). There are an index set JJJ and a family (Gj)j∈J(G_j)_{j\in J}(Gj​)j∈J​ of real normed spaces, each of dimension 111 or of dimension 222 with a closed unit ball that has more than four extreme points, such that c0(J;Gj)c_0(J;G_j)c0​(J;Gj​) and c0(I;Ei)c_0(I;E_i)c0​(I;Ei​), with the supremum block norms, are linearly isometric. The pieces come from dropping zero blocks and splitting each parallelogram block into two one-dimensional blocks.

Formalization Note "Dimension at most two" is Module.rank ℝ (E i) ≤ 2; the index type JJJ lives in the universe of III and the spaces GjG_jGj​ in that of the EiE_iEi​, and the isometry is a LinearIsometryEquiv from c0Sum G to c0Sum E.

Preamble
import Definitions.Def_Plasticity_C0Sum
import Mathlib.Analysis.Convex.Extreme
import Mathlib.Analysis.Normed.Operator.LinearIsometry
import Mathlib.Data.Set.Card
import Mathlib.LinearAlgebra.Dimension.Finrank
Formal statement
universe u v

namespace Plasticity.C0Sum.isometry_of_bijective_of_rank_le_two
theorem reduction {ι : Type u} (E : ι → Type v) [∀ i, NormedAddCommGroup (E i)]
    [∀ i, NormedSpace ℝ (E i)] (hE : ∀ i, Module.rank ℝ (E i) ≤ 2) :
    ∃ (J : Type u) (G : J → Type v) (_ : ∀ j, NormedAddCommGroup (G j))
      (_ : ∀ j, NormedSpace ℝ (G j)),
      (∀ j, Module.finrank ℝ (G j) = 1 ∨ (Module.finrank ℝ (G j) = 2 ∧
        4 < (Set.extremePoints ℝ (Metric.closedBall (0 : G j) 1)).encard)) ∧
      Nonempty (c0Sum G ≃ₗᵢ[ℝ] c0Sum E) := by sorry
end Plasticity.C0Sum.isometry_of_bijective_of_rank_le_two
Source
This repository: claim CUB109 (claims/cub.md), expositions/c0_planes_with_scalars.md §4 (dropping zero blocks and splitting each parallelogram block into two scalar blocks)

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