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 graph of a Euclidean map is a regular level set
Example
Let be , , and define by . Then is a regular value, is the graph of , and
Facts & Assumptions
Given: The map and the associated map .
Finite sums and scalar multiples of Euclidean maps are , coordinate maps are componentwise, and total-derivative algebra gives ( Euclidean maps are closed under componentwise algebra and composition, Euclidean maps and diffeomorphisms, Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives).
A regular level is locally a graph and has tangent space equal to the derivative kernel (A regular level set is locally a graph of dimension , The tangent space to a regular level set).
Verification
The equation is equivalent to , so is precisely the graph.
By [L1], for every , so is surjective at every point and is a regular value.
Solving gives , and [L2] identifies this kernel with the displayed tangent space.
The graph conclusion holds on the whole open set , including when is empty, in which case both sides are empty.
Depends on
- A regular level set is locally a $C^k$ graph of dimension $m-n$
- The tangent space to a regular level set
- $C^k$ Euclidean maps and diffeomorphisms
- $C^k$ Euclidean maps are closed under componentwise algebra and composition
- Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives
Used by
- A critical value can have a smooth level set Counterexample
- FALSE: a critical value must have a singular level set False statement
Dependency tree · two levels
26 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
- J. M. Lee, Introduction to Smooth Manifolds, graph and regular-level examples (standard reference, not scraped)
- L. W. Tu, An Introduction to Manifolds, Section 11.2 (standard reference, not scraped)