Prescribing images on closed code sets in the blocks of by a finite modification of a fixed injective map
ProvedPlasticity.Ell1C0.exists_tree_clamp_familyLet with blocks , , , and . There is a rule assigning to each family of sets and each label map a map such that, whenever each is a closed set of nonnegative unit vectors supported in and for with : (1) is nonexpansive; (2) on each ; (3) depends only on and for (for every other family ); (4) if ; (5) is finitely supported for .
import Definitions.Def_Plasticity_SeqSpace
namespace Plasticity
theorem Ell1C0.exists_tree_clamp_family :
∃ G : (ℕ → Set (lp (fun _ : ℕ × ℕ => ℝ) 1)) →
(lp (fun _ : ℕ × ℕ => ℝ) 1 → Metric.closedBall (0 : c0 ((ℕ × ℕ) × ℕ)) 1) →
Metric.closedBall (0 : lp (fun _ : ℕ × ℕ => ℝ) 1) 1 →
Metric.closedBall (0 : c0 ((ℕ × ℕ) × ℕ)) 1,
∀ (E : ℕ → Set (lp (fun _ : ℕ × ℕ => ℝ) 1))
(lab : lp (fun _ : ℕ × ℕ => ℝ) 1 → Metric.closedBall (0 : c0 ((ℕ × ℕ) × ℕ)) 1),
(∀ n, IsClosed (E n)) →
(∀ n, ∀ e ∈ E n, ‖e‖ = 1 ∧ ∀ j, 0 ≤ e j ∧ (j.1 ≠ n → e j = 0)) →
(∀ n, ∀ e ∈ E n, ∀ e' ∈ E n, ‖e - e'‖ < 2 → dist (lab e) (lab e') ≤ ‖e - e'‖ / 4) →
LipschitzWith 1 (G E lab) ∧
(∀ n (x : Metric.closedBall (0 : lp (fun _ : ℕ × ℕ => ℝ) 1) 1),
(x : lp (fun _ : ℕ × ℕ => ℝ) 1) ∈ E n → G E lab x = lab x) ∧
(∀ (E' : ℕ → Set (lp (fun _ : ℕ × ℕ => ℝ) 1))
(lab' : lp (fun _ : ℕ × ℕ => ℝ) 1 → Metric.closedBall (0 : c0 ((ℕ × ℕ) × ℕ)) 1)
(x : Metric.closedBall (0 : lp (fun _ : ℕ × ℕ => ℝ) 1) 1),
(∀ n, ‖(x : lp (fun _ : ℕ × ℕ => ℝ) 1)‖ / 4 <
∑' m, |(x : lp (fun _ : ℕ × ℕ => ℝ) 1) (n, m)| →
E' n = E n ∧ ∀ e ∈ E n, lab' e = lab e) →
G E' lab' x = G E lab x) ∧
(∀ (x : Metric.closedBall (0 : lp (fun _ : ℕ × ℕ => ℝ) 1) 1),
(∀ n, ∑' m, |(x : lp (fun _ : ℕ × ℕ => ℝ) 1) (n, m)| ≤
‖(x : lp (fun _ : ℕ × ℕ => ℝ) 1)‖ / 4) →
∀ i : (ℕ × ℕ) × ℕ, ((G E lab x : c0 ((ℕ × ℕ) × ℕ)) : Linf ((ℕ × ℕ) × ℕ)) i
= (2 : ℝ) ^ (-((i.2 : ℤ) + 2)) * (x : lp (fun _ : ℕ × ℕ => ℝ) 1) i.1) ∧
(∀ (x : Metric.closedBall (0 : lp (fun _ : ℕ × ℕ => ℝ) 1) 1),
(∀ n, (x : lp (fun _ : ℕ × ℕ => ℝ) 1) ∉ E n) →
{i : (ℕ × ℕ) × ℕ | ((G E lab x : c0 ((ℕ × ℕ) × ℕ)) : Linf ((ℕ × ℕ) × ℕ)) i
≠ (2 : ℝ) ^ (-((i.2 : ℤ) + 2)) * (x : lp (fun _ : ℕ × ℕ => ℝ) 1) i.1}.Finite) := by sorry
end PlasticityRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Notation. Let , real absolutely summable families with , and let be its closed unit ball with the induced metric. Call the mass of row (a convergent sum, since ). Let , and let be the real functions on tending to along the cofinite filter, as a subspace of with the supremum norm; let be its closed unit ball (sup norm ) with the induced metric. For define by
Statement. There exists a single operator which assigns to every sequence of sets , , and every map a map , with the following property. For all and that are admissible, meaning
- each is norm-closed in ;
- each has , for all , and whenever the row index (so lives on row );
- for each and with : ;
the following five conclusions hold.
- (a) is -Lipschitz from to .
- (b) For every and every with : .
- (c) Locality. For every sequence of sets , every map (no admissibility is assumed of or ), and every : if for every with ("heavy" rows of ) we have and for all , then .
- (d) For every with for all (no heavy row), coordinatewise on .
- (e) For every lying in no , the set of with is finite.
All types are concrete (universe ); no universe parameters occur.
On clause (c). Since and are arbitrary, clause (c) constrains also at inadmissible data, but only through admissible data agreeing with it on the heavy rows of . Clause (c) can still be satisfied: applied with admissible it says that, on admissible data, depends only on and for the heavy rows of . Given such an operator on admissible data, one may define for inadmissible data as for any admissible agreeing with it on the heavy rows of (arbitrary if none exists); this is well defined because two admissible data that both agree with on the heavy rows agree with each other there. So (c) is not contradictory by itself; it amounts to heavy-row locality of the admissible construction. At most three rows are heavy for , and no row is heavy for . Locality is compatible with (a)–(b) at the threshold: if row is not heavy for , with , then every has , so a construction must keep for each non-heavy row to remain -Lipschitz against every possible label on ; satisfies this since .
Edge cases:
- Admissible data exist (e.g. for all , any ); then (b) is vacuous and (d), (e) force off finitely many coordinates, with exactly at points with no heavy row.
- : no heavy row, so (d) gives , and (c) gives the same value for all data.
- Points of satisfy and for , so their only heavy row is , consistent with (b) and (c).
- and , so (d) is consistent with the codomain .
- (e) does not apply to points of ; there may differ from on infinitely many coordinates.
- is required to exist uniformly: one operator for all admissible data, chosen before the data.