Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Conformal invariance, monotonicity, and the series and parallel laws for extremal length

Sources

  • Christopher J. Bishop, Quasiconformal Mappings, Ch. 1 §1, printed pp. 2–4. Lemma 1.1 proves conformal invariance by transforming lengths and areas and then applying the inverse map; Lemma 1.2 proves overflow monotonicity; Lemma 1.3 and Corollary 1.4 give the disjoint-support modulus addition rule; Lemma 1.5 gives the series inequality.
  • Mikhail Lyubich, Conformal Geometry and Dynamics of Quadratic Polynomials, vol. I, Ch. 1 §§6.1–6.2, printed pp. 119–121. The definition identifies extremal width with the infimum of area over metrics whose length on every curve is at least one. The text then proves conformal invariance, the series law by normalizing two metrics to have equal length, area and extremal length, and the parallel law by restriction to disjoint supporting sets.
  • Lars Ahlfors and Arne Beurling, Conformal Invariants and Function-Theoretic Null-Sets, §4, printed p. 115. Lemmas 1–3 state overflow monotonicity, the series inequality, and the parallel harmonic-sum law. The arguments below retain the extended-value and finite-positive-area conventions of this library.

Statement

Assume Countable Choice, and let λ and μ be the extremal length and curve-family modulus of Extremal length and the curve-family modulus of a path family. Let Ω,Ω′⊆C be complex domains. A path family in a domain consists of paths whose full traces lie in that domain.

(a) Conformal invariance. If f:Ω→Ω′ is a biholomorphism (Biholomorphic maps between complex domains) and Γ is a path family in Ω, then fΓ:={f∘γ:γ∈Γ} satisfies λ(fΓ)=λ(Γ) and μ(fΓ)=μ(Γ). Thus these parameters are invariants of conformal equivalence (Conformal equivalence and the automorphism group of a domain).

(b) Monotonicity and overflow. If Γ⊆Γ′, then λ(Γ′)≤λ(Γ). If every γ∈Γ0 contains a subpath belonging to Γ1, then λ(Γ0)≥λ(Γ1) and μ(Γ0)≤μ(Γ1).

(c) Series law. Let Γ0,Γ1,Γ be path families in Ω. Suppose there are disjoint Borel sets E0,E1⊆Ω such that every path of Γj has trace in Ej, and every path in Γ has restrictions to two disjoint closed parameter intervals that belong respectively to Γ0 and Γ1. Then λ(Γ)≥λ(Γ0)+λ(Γ1).

(d) Parallel law (Grötzsch). If Γ0,Γ1 are path families in Ω and their traces lie respectively in disjoint Borel sets E0,E1⊆Ω, then μ(Γ0∪Γ1)=μ(Γ0)+μ(Γ1). Equivalently, λ(Γ0∪Γ1) is the harmonic sum of λ(Γ0) and λ(Γ1), where the harmonic sum of x,y∈[0,+∞] means 1/(1/x+1/y) with the reciprocal conventions of the definition.

All assertions use the extended-real conventions of Extremal length and the curve-family modulus of a path family, in particular λ(∅)=+∞, μ(∅)=0, and addition of +∞ to a nonnegative value gives +∞.

Facts & Assumptions

Given: Countable Choice, complex domains Ω,Ω′, the path families and the biholomorphism in the Statement.

[F1]

The path metric length is parameterization independent, is additive on disjoint subpath intervals, is monotone in the density, and has area additivity on disjoint Borel supports. The area-zero and density-scaling cases are also part of the well-definedness result (The rho-length and the extremal length are well defined).

[F3]

A C1 diffeomorphism satisfies the change-of-variables identity for every nonnegative Borel density, with equality of extended integrals and under Countable Choice (Borel change of variables from the compact-support formula and Radon uniqueness).

[F5]

Arc length is additive over adjacent parameter intervals; a Lipschitz map multiplies length by at most its Lipschitz constant, while a similarity multiplies length by its absolute scale (Arc length is additive across every subdivision point and decreases under restriction, A C-Lipschitz map multiplies path length by at most C; isometries preserve length and scalar dilation multiplies it by the absolute scale).

[F6]

The interval data (u,v]↦v−u determines Lebesgue measure uniquely among Borel measures finite on compact sets (The interval data on (a,b] determines the Borel measure uniquely).

[F8]

The supremum and reciprocal definitions of λ and μ include empty families, constant paths, zero and infinite values, and use Borel densities with finite positive area (Extremal length and the curve-family modulus of a path family).

Proof

technique · transport path metrics, then establish the two circuit laws from the metric definitions
1.1F2F5givenconstruct

Fix a rectifiable γ:[a,b]→Ω with positive length L, let α:[0,L]→Ω be its unit-speed arc-length parametrization, and put w(s)=∣f′(α(s))∣. By [F2], w is continuous and strictly positive. Define T(s) to be the arc length of f∘α on [0,s]. It is finite: locally on a convex disk around a point of the compact trace of α, boundedness of f′ makes f Lipschitz by the real one-variable mean-value theorem; finitely many such disks and a subdivision of [0,L] then give finite length. Arc-length additivity makes T(v)−T(u) the length of f∘α on [u,v].

1.2F2F5givenalgebra

Fix s0∈(0,L) and ε>0. Choose a convex disk D about α(s0) on which ∣f′(z)−f′(α(s0))∣<ε. On D, the map g(z)=f(z)−f′(α(s0))z is ε-Lipschitz by the real mean-value estimate applied along line segments. For u<v sufficiently close to s0, α([u,v])⊂D; polygonal sums and [F5] then give ∣T(v)−T(u)−w(s0)(v−u)∣≤ε(v−u), since α has length v−u on [u,v]. Hence T′(s0)=w(s0); as s0 varies this derivative is continuous.

1.3F2F5givenalgebra

On every interval [u,v]⊆[0,L], apply the real mean-value theorem to T on each interval of a partition. The resulting sums for T(v)−T(u) are Riemann sums for the continuous function w, so refinement gives T(v)−T(u)=∫uvw(s) ds. The positive continuous function w has a positive minimum on [0,L], so T is strictly increasing. Its range is [0,T(L)], and the arc-length parametrization of f∘γ is β=f∘α∘T−1.

1.4F1F8given

If Γ⊆Γ′, then for each Borel density ρ, ℓρ(Γ′)≤ℓρ(Γ), so each quotient for Γ′ is at most the corresponding quotient for Γ; taking suprema gives λ(Γ′)≤λ(Γ). If every path of Γ0 contains a subpath in Γ1, [F1] gives ℓρ(Γ0)≥ℓρ(Γ1) for every ρ, hence λ(Γ0)≥λ(Γ1). Reciprocal order gives μ(Γ0)≤μ(Γ1), including zero and infinite values.

1.5F1F7F8givenconstructalgebra

For a path family Γ, call a Borel density σ width-admissible when ℓσ(Γ)≥1, and let W(Γ) be the infimum of A(σ) over such densities. Then W(Γ)=μ(Γ). Indeed, if A(ρ)∈(0,∞) and 0<ℓρ(Γ)<∞, scaling by 1/ℓρ(Γ) gives a width-admissible density with area the reciprocal of its extremal-length quotient; if ℓρ(Γ)=+∞, arbitrary positive rescalings have areas tending to zero. Taking the supremum over ρ proves W(Γ)≤μ(Γ). Conversely, any width-admissible σ with finite positive area gives λ(Γ)≥1/A(σ), so μ(Γ)≤A(σ). If A(σ)=0, [F1] makes σ=0 almost everywhere; adding ε1Q for the rectangle in [F7] preserves width-admissibility and has area ε2∣Q∣, forcing λ(Γ)=+∞ and again μ(Γ)≤W(Γ). If λ(Γ)=0, no width-admissible density can have finite area by these same implications; thus W(Γ)=+∞=μ(Γ). These cases establish the claimed equality with all extended values.

2.1F1F4F6step 1.3given

For a nonnegative Borel function q on [0,T(L)], define ν(B)=∫T−1(B)w(s) ds. This is a finite Borel measure by [F4]. For 0≤u<v≤L, step 1.3 gives ν((T(u),T(v)])=T(v)−T(u); endpoint singletons have zero measure because w is bounded. The measure is supported on [0,T(L)]; clipping any half-open interval to this range and using the interval identity and the zero endpoint atoms shows that ν agrees with Lebesgue measure restricted to [0,T(L)] on every half-open interval in R. Hence [F6] gives equality of these two restricted measures on Borel sets. Indicators, simple functions and increasing simple approximations now yield ∫0T(L)q(t) dt=∫0Lq(T(s))w(s) ds. Taking q=ρ′∘β and using [F1] proves for every Borel ρ′:Ω′→[0,+∞] that ℓρ′(f∘γ)=ℓ(ρ′∘f)∣f′∣(γ).

2.2F1F7F8step 1.4step 1.5given

For the series law, if either λ(Γj)=0, overflow in step 1.4 gives the desired lower bound by the other term. If either value is +∞, the same overflow gives λ(Γ)=+∞. It remains to consider 0<λ(Γ0),λ(Γ1)<∞. Choose for each j a Borel density with finite positive area whose quotient qj is arbitrarily close from below to λ(Γj). Restrict it to Ej; its path infimum on Γj is unchanged, and its area can only decrease. The restricted area is positive, since zero area together with a positive path infimum would, by [F1] and the rectangle perturbation of step 1.5, force λ(Γj)=+∞. Thus the restricted quotient remains positive and finite.

2.3F1step 1.5given

For the parallel law, take any width-admissible density σ for Γ0∪Γ1. Its restrictions σj=σ1Ej remain width-admissible for Γj, since every path of Γj lies in Ej. By nonnegative-integral monotonicity and additivity on the disjoint sets [F1, F4], A(σ)≥A(σ0)+A(σ1)≥μ(Γ0)+μ(Γ1), using step 1.5. Taking the infimum over σ gives μ(Γ0∪Γ1)≥μ(Γ0)+μ(Γ1); if there is no width-admissible density the left side is +∞ and the inequality still holds.

3.1F1F2F5step 2.1

The same local Lipschitz estimate applies to f−1 on compact subsets of Ω′. Consequently f∘γ is rectifiable exactly when γ is rectifiable: each direction follows by covering the compact path trace with finitely many convex disks and subdividing its parameter interval. Nonrectifiable paths have infinite length by definition on both sides of the last identity, and a zero-length path is constant, for which both integrals vanish because the arc-length measure is zero. Thus the length identity holds for every path.

3.2F1step 2.2givenalgebra

Write Lj=ℓρj(Γj) and Aj=A(ρj) for the restricted densities in step 2.2, and replace ρj by (Lj/Aj)ρj. The scaling law [F1] makes both its path infimum and its area equal to qj=Lj2/Aj. Put ρ=ρ0+ρ1; its supports are disjoint, so [F1] gives A(ρ)=q0+q1. Each γ∈Γ contains subpaths from Γ0,Γ1 on disjoint parameter intervals. Subpath additivity and nonnegativity show ℓρ(γ)≥q0+q1, hence ℓρ(Γ)2/A(ρ)≥q0+q1. Letting the two quotients approach their suprema proves λ(Γ)≥λ(Γ0)+λ(Γ1).

3.3F1step 1.5step 2.3given

If both μ(Γj) are finite, choose width-admissible densities σj with areas arbitrarily close above their infima, restrict them to Ej, and put σ=σ0+σ1. Every path of either family has σ-length at least one, while disjoint area additivity gives A(σ)=A(σ0)+A(σ1). Therefore μ(Γ0∪Γ1)≤μ(Γ0)+μ(Γ1) by step 1.5 and passage to arbitrarily small errors. If either summand is infinite this upper bound is automatic in the extended order. Combined with step 2.3 this proves equality.

4.1F2F3F4F8step 3.1

Given a Borel ρ′ of finite positive area on Ω′, put ρ=(ρ′∘f)∣f′∣ on Ω. The function is Borel by [F2, F4], and [F3] with det⁡Df=∣f′∣2 (The Jacobian determinant of a holomorphic map is ∣f′∣2 and is positive exactly where f′≠0) gives AΩ(ρ)=AΩ′(ρ′). The two areas are therefore finite and positive, while step 3.1 gives ℓρ(Γ)=ℓρ′(fΓ). Hence the corresponding extremal-length quotients agree. Applying the same construction to f−1 shows λ(fΓ)=λ(Γ); taking reciprocals gives μ(fΓ)=μ(Γ). The definition of conformal equivalence then gives the stated invariance.

5.1F8step 4.1step 1.4step 3.2step 2.3step 3.3∎

By definition λ=1/μ with 1/0=+∞ and 1/(+∞)=0. Thus the reciprocal of μ(Γ0)+μ(Γ1) is the harmonic sum of λ(Γ0),λ(Γ1), including when either modulus is zero or infinite. Steps 4.1, 1.4, 3.2, 2.3 and 3.3 establish (a), (b), (c) and (d), respectively.

Depends on

Used by

Dependency tree · two levels

147 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