Alphabeta Math
LemmaStatement: 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.

Controlled derivative oscillation forces injectivity on a fixed subdisc

Statement

Let g be holomorphic on D with g(0)=0, g′(0)=1, and ∣g′(w)∣≤2 on D. Then g is univalent on D(0,1/6) and

D(0,1/12)⊂g(D(0,1/6)).

Facts & Assumptions

Given: A holomorphic map g:D→C with g(0)=0, g′(0)=1, and ∣g′∣≤2 on D.

[L1]

If h:D→D is holomorphic and h(0)=0, then ∣h(w)∣≤∣w∣ (Schwarz lemma with the equality cases).

[L2]

Rouche's theorem preserves zero count under a strict boundary perturbation (Rouche's theorem in the classical strict-inequality form).

Proof

technique · direct
1.1L1givenalgebra

Define h(w):=(g′(w)−1)/3. Then h is holomorphic on D, h(0)=0, and ∣h(w)∣≤(∣g′(w)∣+1)/3≤1. Hence [L1] gives ∣g′(w)−1∣≤3∣w∣ for every w∈D.

2.1step 1.1algebra

If ∣w∣≤1/6, step 1.1 gives ∣g′(w)−1∣≤1/2. For w1,w2∈D(0,1/6), one has g(w1)−g(w2)=∫[w2,w1]g′(ζ) dζ, so ∣g(w1)−g(w2)−(w1−w2)∣≤∣w1−w2∣/2. Therefore ∣g(w1)−g(w2)∣≥∣w1−w2∣/2, which shows injectivity on D(0,1/6).

2.2L2step 1.1algebra

On ∣w∣=1/6, one has ∣g(w)−w∣≤∫01∣g′(tw)−1∣ ∣w∣ dt≤3∣w∣2/2=1/24<1/6=∣w∣. Fix ξ with ∣ξ∣<1/12. Then on ∣w∣=1/6, ∣(g(w)−ξ)−w∣≤∣g(w)−w∣+∣ξ∣<1/24+1/12=1/8<1/6=∣w∣. Rouche [L2] gives the same zero count for g(w)−ξ and w, so g(w)=ξ has exactly one solution in D(0,1/6).

3.1step 2.1step 2.2∎

Step 2.2 shows every ∣ξ∣<1/12 lies in g(D(0,1/6)), and step 2.1 shows the restriction there is univalent.

Depends on

Used by

Dependency tree · two levels

13 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