Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prescribing the images of the unit vectors of ℓ1(J)\ell_1(J)ℓ1​(J) in c0(J×N)c_0(J\times\mathbb N)c0​(J×N) by a finite modification of a fixed injective map

Proved
Plasticity.Ell1C0.exists_clamp_family

by scanstone · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let JJJ be a set, I=J×NI=J\times\mathbb NI=J×N, eje_jej​ the unit vectors of ℓ1(J)\ell_1(J)ℓ1​(J) and H(x)(j,k)=2−(k+2)xjH(x)_{(j,k)}=2^{-(k+2)}x_jH(x)(j,k)​=2−(k+2)xj​. There is a family of maps Gy ⁣:Bℓ1(J)→Bc0(I)G_y\colon B_{\ell_1(J)}\to B_{c_0(I)}Gy​:Bℓ1​(J)​→Bc0​(I)​, indexed by label families y=(yj)j∈Jy=(y_j)_{j\in J}y=(yj​)j∈J​ in Bc0(I)B_{c_0(I)}Bc0​(I)​, such that for all yyy: (1) GyG_yGy​ is nonexpansive; (2) Gy(ej)=yjG_y(e_j)=y_jGy​(ej​)=yj​; (3) Gy(x)G_y(x)Gy​(x) depends only on the labels yjy_jyj​ with xj>∥x∥1/4x_j>\|x\|_1/4xj​>∥x∥1​/4; (4) if no xjx_jxj​ exceeds ∥x∥1/4\|x\|_1/4∥x∥1​/4 then Gy(x)=H(x)G_y(x)=H(x)Gy​(x)=H(x); (5) if xxx is not a unit vector eje_jej​, then Gy(x)G_y(x)Gy​(x) and H(x)H(x)H(x) differ at only finitely many coordinates.

Preamble
import Definitions.Def_Plasticity_SeqSpace
Formal statement
namespace Plasticity
theorem Ell1C0.exists_clamp_family (J : Type*) [DecidableEq J] :
    ∃ G : (J → Metric.closedBall (0 : c0 (J × ℕ)) 1) →
        Metric.closedBall (0 : lp (fun _ : J => ℝ) 1) 1 → Metric.closedBall (0 : c0 (J × ℕ)) 1,
      (∀ y, LipschitzWith 1 (G y)) ∧
      (∀ y j (x : Metric.closedBall (0 : lp (fun _ : J => ℝ) 1) 1),
        (x : lp (fun _ : J => ℝ) 1) = lp.single 1 j 1 → G y x = y j) ∧
      (∀ y y' (x : Metric.closedBall (0 : lp (fun _ : J => ℝ) 1) 1),
        (∀ j, ‖(x : lp (fun _ : J => ℝ) 1)‖ / 4 < (x : lp (fun _ : J => ℝ) 1) j → y j = y' j) →
        G y x = G y' x) ∧
      (∀ y (x : Metric.closedBall (0 : lp (fun _ : J => ℝ) 1) 1),
        (∀ j, (x : lp (fun _ : J => ℝ) 1) j ≤ ‖(x : lp (fun _ : J => ℝ) 1)‖ / 4) →
        ∀ i : J × ℕ, ((G y x : c0 (J × ℕ)) : Linf (J × ℕ)) i
            = (2 : ℝ) ^ (-((i.2 : ℤ) + 2)) * (x : lp (fun _ : J => ℝ) 1) i.1) ∧
      (∀ y (x : Metric.closedBall (0 : lp (fun _ : J => ℝ) 1) 1),
        (∀ j, (x : lp (fun _ : J => ℝ) 1) ≠ lp.single 1 j 1) →
        {i : J × ℕ | ((G y x : c0 (J × ℕ)) : Linf (J × ℕ)) i
            ≠ (2 : ℝ) ^ (-((i.2 : ℤ) + 2)) * (x : lp (fun _ : J => ℝ) 1) i.1}.Finite) := by sorry
end Plasticity
Source
Proof draft 'Three constructions of nonplastic Banach unit balls' (ChatGPT Pro, OpenAI, 18 November 2026), Lemma 2.1 and Construction A (prescribing images, finite dependence)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Data: an arbitrary type JJJ (any universe) with decidable equality.

Spaces and balls:

  • ℓ1(J)\ell_1(J)ℓ1​(J) is the space of real functions xxx on JJJ with ∥x∥1=∑j∣xj∣<∞\|x\|_1 = \sum_{j} |x_j| < \infty∥x∥1​=∑j​∣xj​∣<∞; B1B_1B1​ denotes its closed unit ball {x:∥x∥1≤1}\{x : \|x\|_1 \le 1\}{x:∥x∥1​≤1}, with the ℓ1\ell_1ℓ1​ metric.
  • c0(J×N)c_0(J \times \mathbb{N})c0​(J×N) is the subspace of ℓ∞(J×N)\ell_\infty(J \times \mathbb{N})ℓ∞​(J×N) of functions tending to 000 along the cofinite filter (for every ε>0\varepsilon > 0ε>0 only finitely many coordinates have absolute value ≥ε\ge \varepsilon≥ε), with the supremum norm; B0B_0B0​ denotes its closed unit ball, with the supremum metric.
  • ej∈ℓ1(J)e_j \in \ell_1(J)ej​∈ℓ1​(J) is the unit vector with 111 at jjj and 000 elsewhere.
  • For x∈ℓ1(J)x \in \ell_1(J)x∈ℓ1​(J) let Λx\Lambda xΛx be the function on J×NJ \times \mathbb{N}J×N given by (Λx)(j,n)=2−(n+2)xj(\Lambda x)(j,n) = 2^{-(n+2)} x_j(Λx)(j,n)=2−(n+2)xj​.

Conclusion: there is a map GGG which assigns to every family y=(yj)j∈Jy = (y_j)_{j \in J}y=(yj​)j∈J​ of points yj∈B0y_j \in B_0yj​∈B0​ a map Gy:B1→B0G_y : B_1 \to B_0Gy​:B1​→B0​, with the following five properties.

  1. For every yyy, GyG_yGy​ is 111-Lipschitz: ∥Gy(x)−Gy(x′)∥∞≤∥x−x′∥1\|G_y(x) - G_y(x')\|_\infty \le \|x - x'\|_1∥Gy​(x)−Gy​(x′)∥∞​≤∥x−x′∥1​ for all x,x′∈B1x, x' \in B_1x,x′∈B1​.
  2. For every yyy and every j∈Jj \in Jj∈J: Gy(ej)=yjG_y(e_j) = y_jGy​(ej​)=yj​.
  3. (Locality in yyy.) For all families y,y′y, y'y,y′ and every x∈B1x \in B_1x∈B1​: if yj=yj′y_j = y'_jyj​=yj′​ for every jjj with xj>∥x∥1/4x_j > \|x\|_1 / 4xj​>∥x∥1​/4, then Gy(x)=Gy′(x)G_y(x) = G_{y'}(x)Gy​(x)=Gy′​(x). The comparison xj>∥x∥1/4x_j > \|x\|_1/4xj​>∥x∥1​/4 uses the signed coordinate xjx_jxj​, not ∣xj∣|x_j|∣xj​∣.
  4. (Linear part.) For every yyy and every x∈B1x \in B_1x∈B1​ with xj≤∥x∥1/4x_j \le \|x\|_1 / 4xj​≤∥x∥1​/4 for all jjj (again signed coordinates), Gy(x)(j,n)=2−(n+2)xjG_y(x)(j,n) = 2^{-(n+2)} x_jGy​(x)(j,n)=2−(n+2)xj​ for all (j,n)(j,n)(j,n), that is, Gy(x)=ΛxG_y(x) = \Lambda xGy​(x)=Λx.
  5. (Finite deviation.) For every yyy and every x∈B1x \in B_1x∈B1​ that is not equal to any eje_jej​, the set {(j,n):Gy(x)(j,n)≠2−(n+2)xj}\{ (j,n) : G_y(x)(j,n) \ne 2^{-(n+2)} x_j \}{(j,n):Gy​(x)(j,n)=2−(n+2)xj​} is finite.

Edge cases:

  • If JJJ is empty, ℓ1(J)={0}\ell_1(J) = \{0\}ℓ1​(J)={0}, c0(J×N)={0}c_0(J \times \mathbb{N}) = \{0\}c0​(J×N)={0}, there is exactly one family yyy, and the statement reduces to Gy(0)=0G_y(0) = 0Gy​(0)=0; it holds trivially.
  • At x=0x = 0x=0 property 4 applies and forces Gy(0)=0G_y(0) = 0Gy​(0)=0 for every yyy.
  • For x=−ejx = -e_jx=−ej​ (all signed coordinates ≤1/4\le 1/4≤1/4) property 4 forces Gy(−ej)=Λ(−ej)G_y(-e_j) = \Lambda(-e_j)Gy​(−ej​)=Λ(−ej​), independently of yyy.
  • Property 2 and property 4 never apply to the same point, since eje_jej​ has a coordinate 1>1/41 > 1/41>1/4.
  • The statement is purely existential with no hypotheses beyond decidable equality on JJJ, so there is no vacuity; its content is the simultaneous compatibility of the Lipschitz bound with properties 2 to 5 for arbitrary families yyy.

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