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.
A smooth map with everywhere smooth local inverses is a local diffeomorphism
Statement
Let be a smooth map of smooth manifolds. Assume that for every there are open neighbourhoods of and of together with a smooth map such that
Then is a local diffeomorphism.
Facts & Assumptions
Given: A smooth map satisfying the local inverse hypothesis of the Statement.
A diffeomorphism is a bijective smooth map with smooth inverse, and a local diffeomorphism is a map that restricts near every point to a diffeomorphism onto an open subset of the target (Diffeomorphisms and local diffeomorphisms of manifolds).
Identity maps and composites of smooth maps are smooth (Identity maps and composites of smooth maps are smooth).
Proof
Fix and choose the neighbourhoods , , and the smooth map [given, choose] from the hypothesis. The identities and show that the restriction is bijective with inverse .
The restriction is smooth because it is the same map as with [F1, F2, step 1.1] a smaller domain, and is smooth by hypothesis. Therefore step 1.1 makes a diffeomorphism by [F1].
Since is open in by hypothesis, step 2.1 exhibits in an open [F1, step 2.1] neighbourhood on which is a diffeomorphism onto an open subset of . By [F1] this is exactly the local-diffeomorphism condition.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- Rob van der Vorst, Introduction to differentiable manifolds, §2 (standard reference, not scraped)
- Nigel Hitchin, Differentiable Manifolds, §2.4 (standard reference, not scraped)