Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)
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 f be a C2 map between open subsets of Rn with invertible derivative at a point. Its local inverse is C2. If g(s,t) is C2 near (s0,t0), g(s0,t0)=0 and gt(s0,t0)≠0, then there is a unique local C2 root t=T(s), with T′=−gs/gt and T′′=−(gss+2gstT′+gtt(T′)2)/gt, evaluated at (s,T(s)). No choice axiom is used.

Facts & Assumptions

Given: A C2 map f between open subsets of Rn with invertible derivative at x0, and a C2 function g(s,t) near (s0,t0) with g(s0,t0)=0 and gt(s0,t0)≠0.

[F1]

If U⊆Rn is open, f:U→Rn is C1 and Df(a) is invertible, then f is a local diffeomorphism at a whose inverse g is C1 with Dg(y)=Df(g(y))−1 (The Euclidean inverse function theorem).

[F2]

For composable differentiable maps the total derivative of the composite is the composite of the total derivatives (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · direct
1.1givenF1

Let f be C2 at x0 with Df(x0) invertible; by [F1] there are open sets V with x0∈V and W with f(x0)∈W such that f∣V:V→W is a bijection with C1 inverse g:W→V satisfying Dg(y)=Df(g(y))−1.

2.1step 1.1F2

The matrix Df is invertible throughout a neighbourhood of g(W), and the entries of its inverse are quotients of polynomial functions of the entries of Df by the determinant, hence are C1 functions of the entries of Df; since f is C2 and g is C1, [F2] shows that y↦Dg(y)=Df(g(y))−1 is C1, that is, g is C2.

3.1step 1.1algebra

Apply step 1.1 to the C2 map G(s,t):=(s,g(s,t)) near (s0,t0): its derivative DG=(10gsgt) has determinant gt, which is nonzero at (s0,t0) by hypothesis, so DG(s0,t0) is invertible and G has a local C2 inverse by step 2.1.

4.1step 3.1

Write the second component of that local inverse as t=T(s) with T defined near s0; then G(s,T(s))=(s,0), that is g(s,T(s))=0, and the equality is unique among t near t0 because the local inverse of G is a function.

5.1step 4.1F2

Differentiating the identity g(s,T(s))=0 in s with [F2] gives gs+gtT′=0 at (s,T(s)), hence T′=−gs/gt wherever gt≠0, which holds near s0.

6.1F2step 5.1∎

Differentiating the same identity twice with [F2] gives gss+gstT′+gtT′′+(gts+gttT′)T′=0 at (s,T(s)); using gst=gts and solving for T′′ because gt≠0 yields T′′=−(gss+2gstT′+gtt(T′)2)/gt, and all steps used only the stated local inverse and chain rule, so no choice axiom is invoked.

Depends on

Used by

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