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.

Maximizing-point rescaling produces a normalized map with uniformly bounded derivative

Statement

Let f be holomorphic on D with f(0)0, let R:=1/2, and let Φ(z):=(Rz)f(z) on zR. If z0 maximizes Φ on the closed radius-R disc and

r:=Rz02,g(w):=f(z0+rw)f(z0)rf(z0),

then g is holomorphic on D, satisfies g(0)=0 and g(0)=1, obeys g(w)2 for w<1, and

rf(z0)Rf(0)2.

Facts & Assumptions

Given: A holomorphic map f:DC with f(0)0, the radius R=1/2, and a maximizer z0 of Φ(z)=(Rz)f(z) on zR.

[L1]

A continuous real-valued function on a nonempty compact metric space has a maximum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

Proof

technique · direct
1.1

The closed disc zR is compact, and zf(z) is continuous, so [L1] justifies the maximizing point z0. Since z0+r=(R+z0)/2<R, the affine disc z0+rD lies in D, so g is holomorphic on D and direct differentiation gives g(0)=0, g(0)=1.

L1givenalgebra
2.1

If w<1, then z0+rwz0+r<R. Maximality of z0 yields (Rz0+rw)f(z0+rw)(Rz0)f(z0)=2rf(z0). Because Rz0+rwRz0r=r, dividing gives g(w)=f(z0+rw)/f(z0)2.

step 1.1algebra
3.1

Since 0 lies in the maximizing disc, maximality also gives Rf(0)(Rz0)f(z0)=2rf(z0), which is the claimed lower bound.

givenstep 1.1algebra

Depends on

Used by

Dependency tree · two levels

21 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