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 pullback of a riemannian metric by every smooth map is a riemannian metric
Statement
Every smooth map pulls a Riemannian metric back to a Riemannian metric.
Facts & Assumptions
Given: The proposed universal claim; take , , with target metric .
Pullback of a riemannian metric as a tensor: For smooth and a Riemannian metric on , its pullback tensor is . This is def-pullback-of-a-covariant-tensor-field for the tensor in def-riemannian-metric-and-riemannian-manifold. It is always symmetric and positive semidefinite; the name does not assert positive definiteness. Smoothness and the precise immersion criterion are established next.
Pullback of a riemannian metric is riemannian exactly for immersions: is Riemannian if and only if is an immersion. In general it is positive semidefinite, with radical at .
Refutation
The coordinate function of is constant, hence smooth with for every . The target quadratic form is for , so the target is Riemannian.
The pullback definition gives . Since , positive definiteness fails; equivalently this is not an immersion. Thus this smooth map refutes the claim.
Source locator
Lee, Introduction to Smooth Manifolds, 2nd ed., pp. 330–331, pullback metrics and Proposition 13.9; the constant-map computation above is explicit.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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)