A strict inverse-first-power bound for univalent functions

OpenAI

For normalized univalent disk maps, OpenAI proves M_{−1}[f′](r)≤C(1−r)^(−1/4+ε) for some ε>0 and all 1/2≤r<1. Thus the bounded-image universal spectrum B_b(−1)<1/4.

Sources for this record

What was already known

Kraetzer predicted B_b(p)=p²/4 for |p|≤2. Earlier rigorous upper bounds at p=−1 were 0.403 and 0.388, above 1/4.

AI involvement AI-led

OpenAI is credited as author and attributes the manuscript and Lean artifact to an internal model; individual human direction is not detailed.

The OpenAI-authored strict-bound manuscript and associated Lean theorem are identified as model-produced results in the release; no individual-session autonomy is established.

Importance Notable

The strict p=−1 bound contradicts the predicted universal formula.

Limitations

It does not determine the full spectrum or the p=1 value. The separate Brennan inverse-square endpoint is a different result.

Technical verification Formal (Lean 4)

The cited Lean main theorem states the uniform inverse-first-power estimate, B_b(−1)<1/4 and failure of the universal Kraetzer identity. The repository reports Lean formalizations as verification artifacts. This is source-reported machine checking; the project was not rebuilt here.

Formal checking

Lean theorem OAI.StrictInverseFirstPower.main assembled from formalized endpoint results

Checker
Lean 4 kernel, as reported by the OpenAI math release
Scope
A uniform inverse-first-power bound implying boundedSpectrum(−1)<1/4 and failure of Kraetzer's identity
Basis
Reported by the linked checker
Evidence source

Checking a formal statement does not establish that it matches the original problem.

Human understanding Few

No named person's explanation of the critical-point pairing and strictness argument is documented. Few is the evidence default, not a claim that experts cannot understand it.

Correction and publication history