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 tangent space of a regular level set is the kernel
Statement
Let be smooth, let be a regular value, and let . Then
Facts & Assumptions
Given: A smooth map , a regular value , and a point .
A regular value has only submersion points in its fibre (Regular and critical points and values).
The fibre is an embedded submanifold (A regular level set is an embedded submanifold).
Near a submersion point, suitable coordinates put into the form (Local normal form for submersions).
Chart maps are diffeomorphisms onto open Euclidean sets (Chart maps are diffeomorphisms onto Euclidean open sets).
Differentials satisfy the chain rule (The chain rule for differentials of smooth maps).
Proof
Because is a regular value and , [F1] makes a submersion at . Write , , and . By [L2], choose local coordinates near and in which the representative of is on , with and sent to the origins. Then the fibre is represented by the slice . By [L1], this is the embedded-submanifold structure on the fibre near , so its tangent vectors are exactly the vectors of the form .
Let be the coordinate projection. Step 1.1 makes near the distinguished point. By [L3], the differentials and are isomorphisms, and [L4] gives Because has kernel , one gets Step 1.1 identifies the same subspace with , so .
Therefore the intrinsic tangent space of the regular level set equals .
Depends on
Used by
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
- Will J. Merry, Differential Geometry, Proposition 6.15 (standard reference, not scraped)