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 immersion and submersion loci are open
Statement
Let be a smooth map. The set of points where is an immersion is open in , and the set of points where is a submersion is open in .
Facts & Assumptions
Given: A smooth map .
is an immersion at exactly when , and it is a submersion at exactly when (Immersions, submersions, and constant-rank maps).
For a smooth Euclidean map, the locus where the differential has rank at least a fixed integer is open (Differential rank is lower semicontinuous).
Every manifold chart is a diffeomorphism onto an open Euclidean set (Chart maps are diffeomorphisms onto Euclidean open sets).
Proof
Fix an immersion point . Choose charts around and as in [L2], and let be the coordinate representative of . Then by [F1]. Since the differential of a map cannot have rank above , [L1] gives a Euclidean neighbourhood on which the rank stays at least , hence exactly .
The same argument with in place of shows that near any submersion point the rank stays equal to , so the submersion locus is open. Here the upper bound is the relevant maximal-rank bound.
Translating step 1.1 back through the source chart, every point of a smaller neighbourhood of is again an immersion point. Hence the immersion locus is open.
Steps 2.1 and 1.2 prove the two openness claims.
Depends on
Used by
- Local normal form for immersions Corollary
- Local normal form for submersions Corollary
Dependency tree · two levels
17 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, Ch. 4 (standard reference, not scraped)
- Will J. Merry, Differential Geometry, Definition 6.11 (standard reference, not scraped)