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 riemannian distance topology is the manifold topology
Statement
The topology of is the manifold topology on every connected Riemannian manifold.
Facts & Assumptions
Given: A point of a connected Riemannian manifold.
Riemannian distance is a metric: is a finite metric on a connected Riemannian manifold.
Local comparison of a riemannian metric with the euclidean metric: For a compact set contained in one coordinate chart of an -dimensional Riemannian manifold, there are such that for . The dimension-zero assertion is vacuous.
Proof
Choose a coordinate ball of radius centred at whose closed ball lies in a chart. The compact comparison gives constants . As in the metric theorem’s first-exit calculation, any path from to a point outside has length at least : restrict to its first exit and integrate the Euclidean displacement bound. Thus . Choosing the closed coordinate ball inside any given manifold neighbourhood proves that neighbourhood contains a metric neighbourhood.
Conversely, for in that convex coordinate ball the coordinate straight segment has length at most . Hence , so the coordinate ball of radius is inside . This proves the opposite neighbourhood inclusion. Half-balls are convex and give the same estimates at a boundary; a point or empty manifold has the unique topology.
Source locator
Lee, Chapter 13, pp.337–340, Proposition 13.25, Lemma 13.28 and Theorem 13.29; finite piecewise refinements and pauses are treated explicitly here.
Depends on
Used by
Dependency tree · two levels
12 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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)