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.
C² inverses and scalar return roots
Statement
Let be a map between open subsets of with invertible derivative at a point. Its local inverse is . If is near , and , then there is a unique local root , with and , evaluated at . No choice axiom is used.
Facts & Assumptions
Given: A map between open subsets of with invertible derivative at , and a function near with and .
If is open, is and is invertible, then is a local diffeomorphism at whose inverse is with (The Euclidean inverse function theorem).
For composable differentiable maps the total derivative of the composite is the composite of the total derivatives (The chain rule for total derivatives: ).
Proof
Let be at with invertible; by [F1] there are open sets with and with such that is a bijection with inverse satisfying .
The matrix is invertible throughout a neighbourhood of , and the entries of its inverse are quotients of polynomial functions of the entries of by the determinant, hence are functions of the entries of ; since is and is , [F2] shows that is , that is, is .
Apply step 1.1 to the map near : its derivative has determinant , which is nonzero at by hypothesis, so is invertible and has a local inverse by step 2.1.
Write the second component of that local inverse as with defined near ; then , that is , and the equality is unique among near because the local inverse of is a function.
Differentiating the identity in with [F2] gives at , hence wherever , which holds near .
Differentiating the same identity twice with [F2] gives at ; using and solving for because yields , and all steps used only the stated local inverse and chain rule, so no choice axiom is invoked.
Depends on
Used by
- A C² first-integral period annulus has a C² leaf product Lemma
- A C² product coordinate on a planar period annulus Lemma
- A characteristic disk with essential boundary data produces a vanishing cycle Lemma
- A finite characteristic circuit has C² regular port traces Lemma
- A fixed cap product glues by unique transverse flow roots Lemma
- A no-transversal leaf bounds a positive accessibility region with finite inward boundary Lemma
- A noncompact leaf of a compact C2 foliation meets a positive closed transversal Lemma
- A paired regular disk sweep is open across its base gluing Lemma
- A saddle polycycle has a smooth transverse family on either adjacent annulus Lemma
- An infinite cap-center trajectory has recurrent common plaque-interior patches Lemma
- C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade Lemma
- C² plaque transport and finite transverse fences preserve C² regularity Lemma
- Compact leaves near a compact reference leaf are one-sheeted collar graphs Lemma
- Finite cellulations of compact C² subsurfaces relative to an embedded graph Lemma
- Finite general position for a leafwise loop Lemma
- Finite surface normal forms, Jordan disks, and torsion control Lemma
- Finite tangent index count and inward boundary sum Lemma
- Fixed transverse fences and their finite crossing words Lemma
- Spherical leaf stability on a closed manifold needs only countable choice Lemma
- The canonical Jordan cap bundle develops coherently over every positive band Lemma
- The center-frontier selection and cancellation search has finite rank Lemma
- The primitive pi cap block embeds and gives the global Reeb model Lemma
Dependency tree · two levels
14 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
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems (standard reference, not scraped)