Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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,VC be open, let f:UV be a bijection, and let g=f1:VU. Fix aU 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))/hf(a) through nonzero allowed increments (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

Proof

technique · direct
1.1

For wb near b, put z=g(w). Injectivity gives za, and g(w)g(b)wb=zaf(z)f(a)=(f(z)f(a)za)1.

givenalgebra
2.1

As wb, continuity of g gives za. By [F1], the parenthesized quotient in step 1.1 tends to the nonzero number f(a).

step 1.1givenF1
3.1

If qq00, then q1q01=(q0q)/(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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 36 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources