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.

Schottky's theorem

Statement

For every R>0 and every 0<r<1 there exists a constant C(R,r)>0 such that every holomorphic map f:D→C∖{0,1} with ∣f(0)∣≤R satisfies

∣f(z)∣≤C(R,r)(∣z∣≤r).

Facts & Assumptions

Given: Real numbers R>0 and 0<r<1, and a holomorphic map f:D→C∖{0,1} with ∣f(0)∣≤R.

[L1]

The functions f and 1−f admit holomorphic logarithms on D (Disc functions omitting 0 and 1 admit holomorphic logarithms for f and 1-f).

[L3]

Bloch's theorem gives an absolute lower bound b:=1/48 for normalized Bloch discs (Bloch's theorem).

Proof

technique · direct
1.1L1L2givenconstruct

By [L1], choose h with e2πih=f. Since f omits 1, the function h omits every integer. In particular h and h−1 are nowhere zero, so [L2] gives holomorphic u,v on D with u2=h and v2=h−1. Then (u−v)(u+v)=1, so u−v is nowhere zero, and [L2] gives a holomorphic g with eg=u−v.

2.1L4step 1.1algebra

Using [L4] and (u−v)(u+v)=1, one gets u+v=e−g and hence 2u=eg+e−g=2cosh⁡g. Therefore u=cosh⁡g, h=u2=cosh⁡2g=(1+cosh⁡(2g))/2, and f=e2πih=−eπicosh⁡(2g).

2.2step 1.1choosealgebra

Put R0:=max⁡{2,R}. First suppose R0−1≤∣f(0)∣≤R0. In step 1.1 choose the logarithm h so that ∣Re⁡h(0)∣≤1/2, which is possible because h is determined up to an integer. Since ∣f(0)∣=e−2πIm⁡h(0), this also gives ∣Im⁡h(0)∣≤(log⁡R0)/(2π) and hence ∣h(0)∣≤H(R0) for a fixed bound H(R0). Now ∣u(0)∣=∣h(0)∣ and ∣v(0)∣=∣h(0)−1∣, so for P(R0):=H(R0)+H(R0)+1 one has ∣u(0)−v(0)∣≤P(R0). Because (u−v)(u+v)=1 and ∣u(0)+v(0)∣≤P(R0), one also has ∣u(0)−v(0)∣≥P(R0)−1. Finally choose the logarithm g of u−v so that ∣Im⁡g(0)∣≤π; then ∣Re⁡g(0)∣≤log⁡P(R0) and therefore ∣g(0)∣≤A(R0):=log⁡P(R0)+π.

3.1step 2.1algebra

Let αn:=12arcosh⁡(2n+1) for n≥0, and set E:={ ±αn+mπi:n≥0, m∈Z }∪{ ±αn+(m+12)πi:n≥0, m∈Z }. If g(z)=ζ∈E, then cosh⁡(2ζ) is an odd integer, so step 2.1 gives f(z)=1, impossible. Hence g(D)∩E=∅. The horizontal gaps between consecutive αn are less than 1, and the two vertical translates reduce the vertical gap to π/2, so every open Euclidean disc of radius 2 in C meets E.

4.1L3step 3.1assume-contradischarge-contradiction

Fix w∈D and rescale g from the disc D(w,1−∣w∣) to the unit disc. If ∣g′(w)∣>2/(b(1−∣w∣)), then [L3] would produce a schlicht disc of radius greater than 2 inside g(D), contradicting step 3.1. Therefore ∣g′(w)∣≤2/(b(1−∣w∣)) for every w∈D.

5.1step 2.1step 4.1step 2.2casesalgebra∎

If ∣f(0)∣≥R0−1, integrate step 4.1 radially and use step 2.2 to get ∣g(z)∣≤A(R0)+(2/b)log⁡ ⁣(1/(1−r)) for ∣z∣≤r. The formula in step 2.1 then bounds ∣f(z)∣ by a constant depending only on R and r. If ∣f(0)∣<R0−1≤1/2, apply the same construction to 1−f: its center value lies between 1/2 and 3/2, so the preceding case with center parameter 2 uniformly bounds ∣1−f(z)∣ and hence ∣f(z)∣≤1+∣1−f(z)∣. Taking the larger of the two bounds gives the required C(R,r).

Depends on

Used by

Dependency tree · two levels

55 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