Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-03
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 Euclidean inverse function theorem

Statement

Let n≥1, let U⊆Rn be open, let f:U→Rn be C1, and let a∈U. If Df(a) is invertible, then there are open sets V,W⊆Rn with a∈V⊆U and f(a)∈W such that f∣V:V→W is bijective. Its inverse g:W→V is C1, and

Dg(y)=Df(g(y))−1(y∈W).

Thus f is a local diffeomorphism at a.

Facts & Assumptions

Given: The dimensions, C1 map, point, and invertible derivative in the statement.

[L1]

The local Newton lemma supplies a closed ball, a uniform contraction constant, a bound for Df(a)−1, and invertibility of every nearby derivative with the uniform bound ∥Df(x)−1v∥2≤C(1−q)−1∥v∥2 (Newton maps are uniform contractions near a point with invertible derivative).

[L5]

Total differentiability means a linear approximation with an o(∥h∥2) remainder (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

Proof

technique · contraction
1.1

Take R,q,C from [L1], and write A:=Df(a), B:=A−1. Shrink R if needed without changing the estimates. Choose ε>0 so that Cε<(1−q)R, and put W:=B(f(a),ε). For y∈W and x∈B‾(a,R), ∥Ty(x)−a∥2≤q∥x−a∥2+∥B(y−f(a))∥2<R. Thus Ty maps the closed ball into itself.

L1algebra
2.1

The closed ball is nonempty and complete by [L2]. Hence [L3] gives a unique fixed point g(y) of Ty. The fixed-point equation is exactly f(g(y))=y, and the strict inequality in step 1.1 puts g(y) in the open ball.

step 1.1L2L3
3.1

If f(x)=f(z) for two points of the closed ball, then both are fixed by Tf(x); the contraction estimate forces x=z. Define V:=B(a,R)∩f−1[W]. It is open by [L4], contains a, and steps 2.1 and 3.1 show that f∣V:V→W is bijective with inverse g.

step 2.1L1L4
3.2

For y,z∈W, compare the fixed-point equations to obtain ∥g(y)−g(z)∥2≤q∥g(y)−g(z)∥2+C∥y−z∥2. Thus g is Lipschitz, hence continuous.

L1step 2.1algebra
4.1

Fix y∈W, put x:=g(y) and L:=Df(x). For small h, write g(y+h)=x+k. Step 3.2 gives ∥k∥2=O(∥h∥2), while differentiability of f gives h=Lk+r(k) with ∥r(k)∥2=o(∥k∥2). Since [L1] makes L invertible with locally uniform inverse bound, k=L−1h−L−1r(k)=L−1h+o(∥h∥2). Therefore Dg(y)=Df(g(y))−1.

step 3.2L1L5algebra
5.1

The entries of Df(g(y)) are continuous. The identity P−1−Q−1=P−1(Q−P)Q−1, together with the uniform inverse bound in [L1], shows that the entries of Dg are continuous. Hence g is C1.

step 3.2step 4.1L1algebra
6.1

Steps 3.1--5.1 give the required local C1 inverse and derivative formula, so the final local-diffeomorphism clause is exactly Continuously differentiable maps, local inverses, and local diffeomorphisms.

step 3.1step 3.2step 4.1step 5.1∎

Depends on

Used by

Dependency tree · two levels

62 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