Extremal length
From Wikipedia, the free encyclopedia
In the mathematical theory of conformal and quasiconformal mappings, the extremal length of a collection of curves Γ is a conformal invariant of Γ. More specifically, suppose that D is an open set in the complex plane and Γ is a collection of paths in D and
is a conformal mapping. Then the extremal length of Γ is equal to the extremal length of the image of Γ under f. For this reason, the extremal length is a useful tool in the study of conformal mappings. Extremal length can also be useful in dimensions greater than two, but the following deals primarily with the two dimensional setting.
Contents |
[edit] Definition of extremal length
To define extremal length, we need to first introduce several related quantities. Let D be an open set in the complex plane. Suppose that Γ is a collection of rectifiable curves in D. If
is Borel-measurable, then for any rectifiable curve γ we let
denote the ρ-length of γ, where | dz | denotes the Euclidean element of length. (It is possible that
.) What does this really mean? If
is parameterized in some interval I, then
is the integral of the Borel-measurable function ρ(γ(t)) with respect to the Borel measure on I for which the measure of every subinterval
is the length of the restriction of γ to J. In other words, it is the Lebesgue-Stieltjes integral
, where lengthγ(t) is the length of the restriction of γ to
. Also set
The area of ρ is defined as
and the extremal length of Γ is
where the supremum is over all Borel-measureable
with
. If Γ contains some non-rectifiable curves and Γ0 denotes the set of rectifiable curves in Γ, then EL(Γ) is defined to be EL(Γ0).
The term modulus of Γ refers to 1 / EL(Γ).
The extremal distance in D between two sets in
is the extremal length of the collection of curves in D with one endpoint in one set and the other endpoint in the other set.
[edit] Examples
In this section the extremal length is calculated in several examples. The first three of these examples are actually useful in applications of extremal length.
[edit] Extremal distance in rectangle
Fix some positive numbers w,h > 0, and let R be the rectangle
. Let Γ be the set of all finite length curves
that cross the rectangle left to right, in the sense that
is on the left edge
of the rectangle, and
is on the right edge
. (The limits necessarily exist, because we are assuming that γ has finite length.) We will now prove that in this case
- EL(Γ) = w / h
First, we may take ρ = 1 on R. This ρ gives
and Lρ(Γ) = w. The definition of EL(Γ) as a supremum then gives
.
The opposite inequality is not quite so easy. Consider an arbitrary Borel-measurable
such that
. For
, let
(where we are identifying
with the complex plane). Then
, and hence
. The latter inequality may be written as
Integrating this inequality over
implies
.
Now a change of variable
and an application of the Cauchy-Schwarz inequality give
. This gives
.
Therefore,
, as required.
As the proof shows, the extremal length of Γ is the same as the extremal length of the much smaller collection of curves
.
It should be pointed out that the extremal length of the family of curves
that connect the bottom edge of R to the top edge of R satisfies
, by the same argument. Therefore,
. It is natural to refer to this as a duality property of extremal length, and a similar duality property occurs in the context of the next subsection. Observe that obtaining a lower bound on EL(Γ) is generally easier than obtaining an upper bound, since the lower bound involves choosing a reasonably good ρ and estimating Lρ(Γ)2 / A(ρ), while the upper bound involves proving a statement about all possible ρ. For this reason, duality is often useful when it can be established: when we know that
, a lower bound on
translates to an upper bound on EL(Γ).
[edit] Extremal distance in annulus
Let r1 and r2 be two radii satisfying
. Let A be the annulus
and let C1 and C2 be the two boundary components of A: C1: = {z: | z | = r1} and C2: = {z: | z | = r2}. Consider the extremal distance in A between C1 and C2; which is the extremal length of the collection Γ of curves
connecting C1 and C2.
To obtain an upper bound on EL(Γ), we take ρ(z) = 1 / | z | . Then for
oriented from C1 to C2
On the other hand,
We conclude that
We now see that this inequality is really an equality by employing an argument similar to the one given above for the rectangle. Consider an arbitrary Borel-measurable ρ such that
. For
let
denote the curve γθ(r) = eiθr. Then
We integrate over θ and apply the Cauchy-Schwarz inequality, to obtain:
Squaring gives
This implies the upper bound
. When combined with the lower bound, this yields the exact value of the extremal length:
[edit] Extremal length around an annulus
Let r1,r2,C1,C2,Γ and A be as above, but now let Γ * be the collection of all curves that wind once around the annulus, separating C1 from C2. Using the above methods, it is not hard to show that
This illustrates another instance of extremal length duality.
[edit] Extremal length of toplologically essential paths in projective plane
In the above examples, the extremal ρ which maximized the ratio Lρ(Γ)2 / A(ρ) and gave the extremal length corresponded to a flat metric. In other words, when the Euclidean Riemannian metric of the corresponding planar domain is scaled by ρ, the resulting metric is flat. In the case of the rectangle, this was just the original metric, but for the annulus, the extremal metric identified is the metric of a cylinder. We now discuss an example where an extremal metric is not flat. The projective plane with the spherical metric is obtained by identifying antipodal points on the unit sphere in
with its Riemannian spherical metric. In other words, this is the quotient of the sphere by the map
. Let Γ denote the set of closed curves in this projective plane that are not null-homotopic. (Each curve in Γ is obtained by projecting a curve on the sphere from a point to its antipode.) Then the spherical metric is extremal for this curve family[1]. (The definition of extremal length readily extends to Riemannian surfaces.) Thus, the extremal length is
.
[edit] Extremal length of paths containing a point
If Γ is any collection of paths all of which have positive diameter and containing a point z0, then
. This follows, for example, by taking
which satisfies
and
for every rectifiable
.
[edit] Elementary properties of extremal length
The extremal length satisfies a few simple monotonicity properties. First, it is clear that if
, then
. Moreover, the same conclusion holds if every curve
contains a curve
as a subcuve (that is, γ2 is the restriction of γ1 to a subinterval of its domain). Another sometimes useful inequality is
This is clear if EL(Γ1) = 0 or if EL(Γ2) = 0, in which case the right hand side is interpreted as 0. So suppose that this is not the case and with no loss of generality assume that the curves in
are all rectifiable. Let ρ1,ρ2 satisfy
for j = 1,2. Set ρ = max{ρ1,ρ2}. Then
and
, which proves the inequality.
[edit] Conformal invariance of extremal length
Let
be a conformal homeomorphism (a bijective holomorphic map) between planar domains. Suppose that Γ is a collection of curves in D, and let
denote the image curves under f. Then EL(Γ) = EL(Γ * ). This conformal invariance statement is the primary reason why the concept of extremal length is useful.
Here is a proof of conformal invariance. Let Γ0 denote the set of cuves
such that
is rectifiable, and let
, which is the set of rectifiable curves in Γ * . Suppose that
is Borel-measurable. Define
A change of variables w = f(z) gives
Now suppose that
is rectifiable, and set
. Formally, we may use a change of variables again:
To justify this formal calculation, suppose that γ is defined in some interval I, let
denote the length of the restriction of γ to
, and let
be similarly defined with γ * in place of γ. Then it is easy to see that
, and this implies
, as required. The above equalities give,
If we knew that each curve in Γ and Γ * was rectifiable, this would prove EL(Γ) = EL(Γ * ) since we may also apply the above with f replaced by its inverse and Γ interchanged with Γ * . It remains to handle the non-rectifiable curves.
Now let
denote the set of rectifiable curves in
such that
is non-rectifiable. We claim that
. Indeed, take
, where
. Then a change of variable as above gives
For
and
such that
is contained in {z: | z | < r}, we have
On the other hand, suppose that
is such that
is unbounded. Set
. Then Lρ(γ) is at least the length of the curve
(from an interval in
to
). Since
, it follows that
. Thus, indeed,
.
Using the results of the previous section, we have
.
We have already seen that
. Thus,
. The reverse inequality holds by symmetry, and conformal invariance is therefore established.
[edit] Some applications of extremal length
By the calculation of the extremal distance in an annulus and the conformal invariance it follows that the annulus {z:r < | z | < R} (where
) is not conformally homeomorphic to the annulus {w:r * < | w | < R * } if
.
[edit] Extremal length in higher dimensions
The notion of extremal length adapts to the study of various problems in dimensions 3 and higher, especially in relation to quasiconformal mappings.
| Please help improve this section by expanding it. Further information might be found on the talk page or at requests for expansion. |
[edit] Discrete extremal length
Suppose that G = (V,E) is some graph and Γ is a collection of paths in G. There are two variants of extremal length in this setting. To define the edge extremal length, originally introduced by R. J. Duffin[2], consider a function
. The ρ-length of a path is defined as the sum of ρ(e) over all edges in the path, counted with multiplicity. The "area" A(ρ) is defined as
. The extremal length of Γ is then defined as before. If G is interpreted as a resistor network, where each edge has unit resistance, then the effective resistance between two sets of veritces is precisely the edge extremal length of the collection of paths with one endpoint in one set and the other endpoint in the other set. Thus, discrete extremal length is useful for estimates in discrete potential theory.
Another notion of discrete extremal length that is appropriate in other contexts is vertex extremal length, where
, the area is
, and the length of a path is the sum of ρ(v) over the vertices visited by the path, with multiplicity.
[edit] Notes
[edit] References
- Ahlfors, Lars V. (1973), Conformal invariants: topics in geometric function theory, New York: McGraw-Hill Book Co., MR0357743
- Duffin, R. J. (1962), “The extremal length of a network”, Journal of Mathematical Analysis and Applications 5: 200–215
- Lehto, O. & Virtanen, K. I. (1973), Quasiconformal mappings in the plane (2nd ed.), Berlin, New York: Springer-Verlag




















![L_\rho(\gamma)\ge\inf\{h(s):s\in[0,r]\}\,\mathrm{length}(f\circ\gamma)=\infty.](../../../../math/8/5/3/853e2596d8d5824ceb4a703b48bbe33e.png)

