Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

The punctured disc has infinite conformal parameter, unlike every finite annulus

Sources

  • Mikhail Lyubich, Conformal Geometry and Dynamics of Quadratic Polynomials, vol. I, Ch. 1 §§6.3.1 and 6.3.6, printed pp. 121–124. Proposition 6.6 and Corollaries 6.11–6.12 compute the annular family values; Corollary 6.20 records the degeneration of nested annuli.
  • Lars Ahlfors and Arne Beurling, Conformal Invariants and Function-Theoretic Null-Sets, §§4–5, printed pp. 115 and 119–121, for the extremal-distance computations and conformal invariance conventions.

Example

Assume Countable Choice and use the conformal parameter and path-family conventions of The conformal parameter of a round annulus is a complete invariant.

(a) For 0<r<R<∞, the round annulus A(r,R) has finite conformal parameter M(A(r,R))=12πlog⁡Rr, and its connecting-family modulus is μ(Γr,R)=2πlog⁡(R/r)>0.

(b) For the punctured disc D∗={0<∣z∣<1} and its puncture-to-outer-circle family ΓD∗, the conformal parameter is infinite: M(D∗)=λ(ΓD∗)=+∞,μ(ΓD∗)=0. For each integer n≥2, every path in ΓD∗ contains a subpath joining the circles ∣z∣=1/n and ∣z∣=1. Consequently the nested finite-annulus parameters force this divergence.

(c) There is no conformal equivalence between D∗ and any finite round annulus A(r,R), nor between D∗ and D or C; likewise C∗=C∖{0} is not conformally equivalent to a finite round annulus, by The conformal parameter of a round annulus is a complete invariant(iii).

(d) Quantitatively, on A(1/n,1) the density ρ(z)=1/(2π∣z∣) gives every path joining the two boundary circles length at least log⁡n/(2π) and has area log⁡n/(2π). Its extremal-length quotient is therefore at least log⁡n/(2π).

Facts & Assumptions

Given: Countable Choice, the punctured disc, the finite round annuli, and the density/length conventions.

[F1]

Extremal length is monotone under overflow: if each path in Γ0 contains a subpath in Γ1, then λ(Γ0)≥λ(Γ1). Extending densities by zero makes the family comparison independent of the ambient domain (Conformal invariance, monotonicity, and the series and parallel laws for extremal length, The rho-length and the extremal length are well defined).

[F2]

For every 0<r<R<∞, the connecting family of A(r,R) has λ(Γr,R)=12πlog⁡Rr,μ(Γr,R)=2πlog⁡(R/r). The density 1/(∣z∣log⁡(R/r)) gives the lower extremal-length bound, while weighted Cauchy–Schwarz on radial segments gives the upper bound (Extremal length of the rectangle and of the round annulus).

[F3]

The conformal parameter is the extremal length of the connecting family; the punctured-disc path family has endpoints at 0 and the unit circle and has interior in D∗; finite annuli have the values in [F2]; and the non-equivalence assertions in (c) are proved by winding families and the Liouville/logarithm obstructions (The conformal parameter of a round annulus is a complete invariant).

[F4]

For a rectifiable path crossing the boundary circles of A(r,R), ∫γ∣dz∣∣z∣≥log⁡(R/r), and polar change of variables gives ∫A(r,R)g dA=∫02π∫rRg(seiθ) s ds dθ for every nonnegative Borel g (Extremal length of the rectangle and of the round annulus).

Verification

technique · nested-annulus overflow, with the explicit radial extremal metric as a quantitative check
1.1F2F3

For 0<r<R<∞, clause (i) of [F3] and [F2] give M(A(r,R))=(2π)−1log⁡(R/r) and μ(Γr,R)=2π/log⁡(R/r). Since R/r>1, the logarithm is finite and positive, so the displayed parameter and reciprocal are finite and positive.

1.2F1F2F3given

Fix n≥2 and a path γ:[0,1]→C in ΓD∗, so γ(0)=0, ∣γ(1)∣=1, and 0<∣γ(t)∣<1 for 0<t<1. By continuity the set Tn={t∈[0,1]:∣γ(t)∣=1/n} is nonempty and compact; let tn=max⁡Tn. For every t∈(tn,1) one has ∣γ(t)∣>1/n: it cannot be smaller without a later intermediate hit of 1/n, and it is less than 1 by the path hypothesis. Thus γ∣[tn,1] is a subpath in the connecting family of A(1/n,1). Regard both families in the ambient plane; [F1] and [F2] give λ(ΓD∗)≥λ(Γ1/n,1)=log⁡n2π. As n→∞ the right side tends to +∞, hence M(D∗)=λ(ΓD∗)=+∞ and μ(ΓD∗)=0.

1.3F3

The finite-annulus, disc and plane non-equivalence claims, and the punctured-plane claim, are exactly clause (iii) of [F3], proved there using compact-trace winding families and the Liouville/logarithm obstructions.

2.1F2F4givenalgebra∎

On A(1/n,1), [F4] gives A(ρ)=∫02π∫1/n114π2s2s ds dθ=log⁡n2π. The crossing estimate in [F4] gives ℓρ(Γ1/n,1)≥log⁡n/(2π), so the quotient is at least (log⁡n/(2π))2/(log⁡n/(2π))=log⁡n/(2π). This is the quantitative lower bound used in step 1.2.

Depends on

Used by

Dependency tree · two levels

98 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