Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Koebe's distortion theorem

Statement

If fS and z=r<1, then

1r(1+r)3f(z)1+r(1r)3.

Facts & Assumptions

Given: A function fS and a point zD with z=r<1.

[L1]

For each aD, the Blaschke factor φa is a disc automorphism (Blaschke factors are automorphisms of the disc).

[L2]

If g(ζ)=ζ+Aζ2+ lies in S, then A2 (The second coefficient of a normalized univalent function has modulus at most two).

Proof

technique · direct
1.1

By rotating the source and target, it is enough to treat the case z=r[0,1). Define ψr(ζ):=ζ+r1+rζ,g(ζ):=f(ψr(ζ))f(r)(1r2)f(r). Fact [L1] makes ψr an automorphism of D, so gS.

L1givenalgebra
2.1

Differentiate twice at 0. Since ψr(0)=1r2 and ψr(0)=2r(1r2), one gets g(0)=(1r2)f(r)f(r)2r. Because gS, [L2] gives g(0)4. Therefore f(r)f(r)2r1r241r2.

L2step 1.1algebra
3.1

Put H(r):=log ⁣((1r2)f(r)), choosing a continuous branch along [0,r] since f never vanishes on D for univalent f. Then step 2.1 yields H(t)=f(t)f(t)2t1t241t2(0t<1).

step 2.1algebra
4.1

Integrating step 3.1 from 0 to r and using f(0)=1 gives H(r)0r41t2dt=2log1+r1r. Exponentiating and dividing by 1r2 yields 1r(1+r)3f(r)1+r(1r)3.

step 3.1algebra
5.1

The argument of steps 1.1 through 4.1 applies after rotation to every point of modulus r, so the same bounds hold for the original z.

step 1.1step 4.1

Depends on

Used by

Dependency tree · two levels

9 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