Coding a continuous injective image of a closed subset of Baire space by a closed set of nonnegative unit vectors of
ProvedPlasticity.Ell1.exists_closed_code_setLet be a metric space, closed, and continuous on and bijective from onto . There are a closed set of nonnegative unit vectors of and a bijection with whenever .
import Mathlib.Analysis.Normed.Lp.lpSpace
namespace Plasticity
theorem Ell1.exists_closed_code_set {Y : Type*} [MetricSpace Y] (M : Set Y)
(C : Set (ℕ → ℕ)) (hC : IsClosed C)
(φ : (ℕ → ℕ) → Y) (hφ : ContinuousOn φ C) (hbij : Set.BijOn φ C M) :
∃ E : Set (lp (fun _ : ℕ => ℝ) 1), IsClosed E ∧ (∀ e ∈ E, ‖e‖ = 1 ∧ ∀ j, 0 ≤ e j) ∧
∃ lab : lp (fun _ : ℕ => ℝ) 1 → Y, Set.BijOn lab E M ∧
∀ e ∈ E, ∀ e' ∈ E, ‖e - e'‖ < 2 → dist (lab e) (lab e') ≤ ‖e - e'‖ / 4 := by sorry
end PlasticityRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a metric space (arbitrary universe) and . Let be closed in the product topology of Baire space, and let be continuous on (relative to ) and a bijection from onto (maps into , injective on , onto ). Write for the real sequences with , with this norm. The conclusion is that there exist a set and a map such that:
- is closed in the norm topology of ;
- every satisfies and for all ;
- is a bijection from onto ;
- for all with ,
For nonnegative unit vectors, always, with equality exactly when and have disjoint supports; so the last condition constrains exactly the pairs with overlapping supports, and in particular forces for such pairs. The values of off are unconstrained. The hypotheses do not say that is complete or separable, nor that is Borel; the only link between and the topology is the continuous bijection from the closed set .
Edge cases:
- If , then (bijection), and with any works.
- If is countable (finite or countably infinite), the conclusion holds trivially with a set of distinct standard unit vectors (pairwise distance , hence closed and with the distance condition vacuous); the hypotheses on and are not needed then.
- For uncountable , is uncountable, so supports must overlap and the distance condition is a genuine constraint.
- The hypotheses are always satisfiable (e.g. ), so the statement is not vacuous; its content lies in the uncountable case.