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.
The based Kuratowski distance map is an isometric embedding
Statement
Let be a nonempty metric space, fix , and let be the based Kuratowski distance map of The based Kuratowski distance map into bounded continuous functions. Then is an isometric embedding in the sense of Isometry, isometric embedding, and the subspace metric on a subset:
Facts & Assumptions
Given: A nonempty metric space , a basepoint , and the map .
For each , defines a bounded continuous function on (The based Kuratowski distance map into bounded continuous functions).
An isometric embedding preserves all distances (Isometry, isometric embedding, and the subspace metric on a subset).
Proof
By [L1], the map is well defined as a map into . For any , the triangle inequality gives so Taking the supremum over yields .
Evaluating at gives and evaluating at gives the same value. Therefore the supremum norm is at least .
Steps 1.1 and 2.1 give for all , which is exactly [L2]. Hence is an isometric embedding.
Remarks
- The proof is two lines long once the target is chosen correctly. The real work is the based definition, which keeps the functions bounded on unbounded metric spaces.
Depends on
Used by
Dependency tree · two levels
7 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)