Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13
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.

A continuous local inverse has derivative reciprocal to a nonzero complex derivative

Statement

Let U,V⊆C be open, let f:U→V be a bijection, and let g=f−1:V→U. Fix a∈U and put b=f(a). If f is complex differentiable at a, f′(a)≠0, and g is continuous at b, then g is complex differentiable at b and

g′(b)=1f′(a).

The existence or continuity of such an inverse is a hypothesis, not a consequence of f′(a)≠0 here.

Facts & Assumptions

Given: The open sets, bijection, inverse, points, differentiability, nonzero-derivative, and inverse-continuity hypotheses in the Statement.

[F1]

Complex differentiability at a means (f(a+h)−f(a))/h→f′(a) through nonzero allowed increments (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

Proof

technique · direct
1.1

For w≠b near b, put z=g(w). Injectivity gives z≠a, and g(w)−g(b)w−b=z−af(z)−f(a)=(f(z)−f(a)z−a)−1.

givenalgebra
2.1

As w→b, continuity of g gives z→a. By [F1], the parenthesized quotient in step 1.1 tends to the nonzero number f′(a).

step 1.1givenF1
3.1

If q→q0≠0, then q−1−q0−1=(q0−q)/(qq0)→0, with denominators nonzero near the limit by [L1]. Applying this to step 2.1 proves g′(b)=1/f′(a).

step 2.1L1algebra∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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