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.
Contact equivalence is chart independent and an equivalence relation
Statement
The contact relation of Contact equivalence of smooth curves at a point is independent of the chart used and is an equivalence relation on smooth curves through .
Facts & Assumptions
Given: Smooth curves through a fixed point at time .
Contact equivalence is defined by equality of coordinate velocities in one chart (Contact equivalence of smooth curves at a point).
Each component of a smooth map on a Euclidean neighbourhood admits a first-order Hadamard factorization (First-order Hadamard factorization near a point).
Proof
Suppose in some chart around , and let be any other chart around . Write and . For each coordinate function , [L1] gives smooth functions near such that and . Substituting , dividing by , and letting shows Because the vectors and are equal, the right-hand sides agree for . Hence , so the relation is chart independent.
Reflexivity and symmetry are immediate from the defining equality in [F1], and transitivity holds because equality of coordinate velocity vectors in any chart is transitive.
Hence contact equivalence is a chart-independent equivalence relation.
Depends on
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by Contact equivalence of smooth curves at a point.
Dependency tree · two levels
5 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 (standard reference, not scraped)
- Will J. Merry, Differential Geometry (standard reference, not scraped)
- Nigel Hitchin, Differentiable Manifolds (standard reference, not scraped)