How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Kuratowski-Wojdyslawski embedding theorem
Statement
Let be a bounded nonempty metric space. Then there is a Banach space and an isometric embedding such that is closed in its algebraic convex hull.
Concretely, one may take with the supremum norm and for any basepoint .
Consequently, every metrizable space embeds homeomorphically as a closed subset of a convex subset of a Banach space.
Facts & Assumptions
Given: A bounded nonempty metric space , a basepoint , and the based Kuratowski map .
is an isometric embedding (The based Kuratowski distance map is an isometric embedding).
Uniform limits of continuous functions are continuous (A uniform limit of continuous functions is continuous, so is closed in under the uniform metric).
The metric is bounded and topologically equivalent to ( and are metrics uniformly equivalent to , so every metric space carries a bounded metric with the same topology, Topologically, uniformly and Lipschitz equivalent metrics on a set).
A metrizable space is one whose topology is induced by some metric (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).
Proof
The target is Banach for the supremum norm. Indeed, let be a Cauchy sequence in the supremum norm. Then each scalar sequence is Cauchy, so define . Fix with for ; letting gives for all , so is bounded. Given , fix with for ; letting yields for , so uniformly. By [L2], is continuous. Hence every Cauchy sequence converges in .
By [L1], is an isometric embedding of into the Banach space .
Let be a point of the algebraic convex hull of , so each and . Put If , then every pair with satisfies , hence all support points coincide and lies in the image.
Assume , and let . Evaluating at gives For each , the triangle inequality yields . Multiplying by and summing over gives Therefore Since this holds for every , the distance from to is at least . So no such lies in the closure of .
Steps 3.1 and 4.1 show that every point of the algebraic convex hull that lies in the closure of is already in . Thus is closed in its algebraic convex hull.
For the final claim, let be metrizable. If , the unique map into any Banach space is a homeomorphic embedding, and its image is closed in its algebraic convex hull. Assume now that . By [L4], choose a metric inducing . By [L3], the bounded metric induces the same topology. Applying steps 1.1 to 5.1 to gives an isometric embedding into a Banach space whose image is closed in its algebraic convex hull. Because and are topologically equivalent, that same map is a homeomorphic embedding for the original topology .
Remarks
- The closedness conclusion is relative to the algebraic convex hull. The proof above shows exactly why it need not be a statement about the whole Banach space.
Depends on
- The based Kuratowski distance map is an isometric embedding
- A uniform limit of continuous functions is continuous, so $C(X,Y)$ is closed in $Y^{X}$ under the uniform metric
- $\min(d,1)$ and $d/(1+d)$ are metrics uniformly equivalent to $d$, so every metric space carries a bounded metric with the same topology
- Topologically, uniformly and Lipschitz equivalent metrics on a set
- Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
48 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- James Dugundji, Topology (standard reference, not scraped)