Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No collapse at matched points

Proved
Plasticity.CUB37.no_collapse

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

Let XXX and X′X'X′ be spaces between c00(Γ)c_{00}(\Gamma)c00​(Γ) and c0(Γ)c_0(\Gamma)c0​(Γ), and let H ⁣:BX→BX′H\colon B_X\to B_{X'}H:BX​→BX′​ be a nonexpansive bijection that moves every coordinate inward: for every x∈BXx\in B_Xx∈BX​ and n∈Γn\in\Gamman∈Γ, H(x)nH(x)_nH(x)n​ lies between 000 and xnx_nxn​. Call xxx matched in X′X'X′ if some w∈X′w\in X'w∈X′ has wixi>0w_ix_i>0wi​xi​>0 for every iii with xi≠0x_i\ne0xi​=0. If x∈BXx\in B_Xx∈BX​ is matched and xn≠0x_n\ne0xn​=0, then H(x)n≠0H(x)_n\neq0H(x)n​=0.

This is the step that excludes the collapse of a coordinate; with it, finitely supported points keep their supports, and the finite cubes become invariant.

Formalization Note The normal form of this card is the one produced by Plasticity.CUB37.normal_form after composing with the inverse signed bijection.

Preamble
import Definitions.Def_Plasticity_SeqSpace
import Mathlib.Topology.EMetricSpace.Lipschitz
Formal statement
namespace Plasticity.CUB37
theorem no_collapse {Γ : Type*} (X X' : Submodule ℝ (Linf Γ))
    (hX0 : c00 Γ ≤ X) (hX1 : X ≤ c0 Γ) (hX'0 : c00 Γ ≤ X') (hX'1 : X' ≤ c0 Γ)
    (H : Linf Γ → Linf Γ)
    (hbij : Set.BijOn H (ballIn X) (ballIn X'))
    (hlip : LipschitzOnWith 1 H (ballIn X))
    (hN1 : ∀ x ∈ ballIn X, ∀ n, (0 ≤ x n → 0 ≤ H x n ∧ H x n ≤ x n) ∧
      (x n ≤ 0 → x n ≤ H x n ∧ H x n ≤ 0))
    (x : Linf Γ) (hx : x ∈ ballIn X)
    (hmatch : ∃ w ∈ X', ∀ i, x i ≠ 0 → 0 < w i * x i)
    (n : Γ) (hn : x n ≠ 0) :
    H x n ≠ 0 := by sorry
end Plasticity.CUB37
Source
This repository: expositions/c0_between_spaces.md §3, Proposition 2 (three points, base point and collision; invariance of domain on a finite cube)

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