Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No collapse in a c0c_0c0​ sum of finite-dimensional blocks with strict coverage, displacement and pins

Proved
Plasticity.C0Sum.eq_zero_of_map_eq_zero.of_blocks

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 (zero blocks allowed), and write DiD_iDi​ for the closed unit ball of EiE_iEi​ and ext⁡Di\operatorname{ext}D_iextDi​ for its extreme points. Assume that every block has the following three properties.

  1. Strict coverage: every nonzero b∈Dib\in D_ib∈Di​ has ∥b−e∥<1\|b-e\|<1∥b−e∥<1 for some e∈ext⁡Die\in\operatorname{ext}D_ie∈extDi​.
  2. Displacement: if b,z∈Eib,z\in E_ib,z∈Ei​ satisfy ∥b∥≤1\|b\|\le1∥b∥≤1, ∥z∥≤12\|z\|\le\tfrac12∥z∥≤21​, and ∥z−w∥≤1\|z-w\|\le1∥z−w∥≤1 for every w∈ext⁡Diw\in\operatorname{ext}D_iw∈extDi​ with ∥b−w∥≤1\|b-w\|\le1∥b−w∥≤1, then ∥b−2z∥≤1\|b-2z\|\le1∥b−2z∥≤1.
  3. Pins: whenever q,x∈Eiq,x\in E_iq,x∈Ei​ satisfy ∥q∥≤1\|q\|\le1∥q∥≤1, ∥q−2x∥≤1\|q-2x\|\le1∥q−2x∥≤1 and ∥q−x∥=1\|q-x\|=1∥q−x∥=1, there are w∈ext⁡Diw\in\operatorname{ext}D_iw∈extDi​ with ∥w−2x∥≤1\|w-2x\|\le1∥w−2x∥≤1 and t0>0t_0>0t0​>0 such that for every 0<t<t00<t<t_00<t<t0​, writing bt=(1−2t)x+twb_t=(1-2t)x+twbt​=(1−2t)x+tw, there is ρ>0\rho>0ρ>0 such that all β,y∈Ei\beta,y\in E_iβ,y∈Ei​ with ∥β∥≤∥bt∥\|\beta\|\le\|b_t\|∥β∥≤∥bt​∥, ∥β−w∥≤1−t\|\beta-w\|\le1-t∥β−w∥≤1−t, ∥y−bt∥<ρ\|y-b_t\|<\rho∥y−bt​∥<ρ, and ∥β−ω∥≤max⁡{1,∥y−ω∥}\|\beta-\omega\|\le\max\{1,\|y-\omega\|\}∥β−ω∥≤max{1,∥y−ω∥} for every ω∈ext⁡Di\omega\in\operatorname{ext}D_iω∈extDi​, satisfy ∥q−y∥≤1−t\|q-y\|\le1-t∥q−y∥≤1−t.

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, and let F ⁣:X→XF\colon X\to XF:X→X map BBB bijectively onto BBB, be 111-Lipschitz on BBB, and satisfy, for every x∈Bx\in Bx∈B and i∈Ii\in Ii∈I, ∥F(x)i∥≤∥xi∥\|F(x)_i\|\le\|x_i\|∥F(x)i​∥≤∥xi​∥, and xi=F(x)ix_i=F(x)_ixi​=F(x)i​ whenever F(x)i∈ext⁡DiF(x)_i\in\operatorname{ext}D_iF(x)i​∈extDi​. Then F(x)i=0F(x)_i=0F(x)i​=0 implies xi=0x_i=0xi​=0 for every x∈Bx\in Bx∈B and i∈Ii\in Ii∈I.

Preamble
import Definitions.Def_Plasticity_C0Sum
import Mathlib.Analysis.Convex.Extreme
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.Topology.EMetricSpace.Lipschitz
Formal statement
namespace Plasticity.C0Sum.eq_zero_of_map_eq_zero
theorem of_blocks {ι : Type*}
    (E : ι → Type*) [∀ i, NormedAddCommGroup (E i)] [∀ i, NormedSpace ℝ (E i)]
    [∀ i, FiniteDimensional ℝ (E i)]
    (hcov : ∀ i, ∀ b : E i, ‖b‖ ≤ 1 → b ≠ 0 →
      ∃ e ∈ Set.extremePoints ℝ (Metric.closedBall (0 : E i) 1), ‖b - e‖ < 1)
    (hdisp : ∀ i, ∀ b z : E i, ‖b‖ ≤ 1 → ‖z‖ ≤ 1 / 2 →
      (∀ w ∈ Set.extremePoints ℝ (Metric.closedBall (0 : E i) 1), ‖b - w‖ ≤ 1 → ‖z - w‖ ≤ 1) →
      ‖b - (2 : ℝ) • z‖ ≤ 1)
    (hpin : ∀ i, ∀ q x : E i, ‖q‖ ≤ 1 → ‖q - (2 : ℝ) • x‖ ≤ 1 → ‖q - x‖ = 1 →
      ∃ w ∈ Set.extremePoints ℝ (Metric.closedBall (0 : E i) 1), ‖w - (2 : ℝ) • x‖ ≤ 1 ∧
        ∃ t₀ > 0, ∀ t : ℝ, 0 < t → t < t₀ → ∃ ρ > 0, ∀ β y : E i,
          ‖β‖ ≤ ‖(1 - 2 * t) • x + t • w‖ → ‖β - w‖ ≤ 1 - t →
          ‖y - ((1 - 2 * t) • x + t • w)‖ < ρ →
          (∀ ω ∈ Set.extremePoints ℝ (Metric.closedBall (0 : E i) 1),
            ‖β - ω‖ ≤ max 1 ‖y - ω‖) →
          ‖q - y‖ ≤ 1 - t)
    (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))
    (hnorm : ∀ x ∈ Metric.closedBall (0 : c0Sum E) 1, ∀ i,
      ‖(F x : lp E ⊤) i‖ ≤ ‖(x : lp E ⊤) i‖)
    (hext : ∀ x ∈ Metric.closedBall (0 : c0Sum E) 1, ∀ i,
      (F x : lp E ⊤) i ∈ Set.extremePoints ℝ (Metric.closedBall (0 : E i) 1) →
        (x : lp E ⊤) i = (F x : lp E ⊤) i)
    (x : c0Sum E) (hx : x ∈ Metric.closedBall (0 : c0Sum E) 1) (i : ι)
    (hFx : (F x : lp E ⊤) i = 0) : (x : lp E ⊤) i = 0 := by sorry
end Plasticity.C0Sum.eq_zero_of_map_eq_zero
Source
This repository: claim CUB100 (claims/cub.md), Proposition 5.1 in expositions/c0_one_general_plane.md §5, with the block geometry it uses isolated as three hypotheses

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