Notes on Complex Analysis
Export PDFGitHub

§6.3 Analytic Capacity

6.3 Analytic Capacity

The theory of rational approximation is essentially built upon the concept of analytic capacity, which was introduced in 1940 by Finnish mathematician Lars Ahlfors. Our purpose here is to give a brief and elementary introduction. Despite its importance, still many trivially simple results remain conjecture.

The uses of analytic capacity are present in many other topics of complex analysis. Analytic capacity serves as a natural framework for general rational approximation theory. Our purpose here is to hint at how analytic capacity theory relates to the proof of Theorem 6.2.7Theorem 6.2.7Theorem 6.2.7 and pertinent problems in general.

Definition 6.3.1 (Analytic Capacity).

Let 𝐾⊆ℂ be compact. The analytic capacity of 𝐾 is defined as

𝛾(𝐾)=sup{|𝑓′(∞)|:[𝑓is holomorphic onℂ̂∖𝐾𝑓(ℂ̂∖𝐾)⊆𝔻‾𝑓(∞)=0]},(6.3.1)

where 𝑓′(∞) is defined as in (6.2.1)(6.2.1)(6.2.1). For an arbitrary set 𝑈⊆ℂ, we define

sup{𝛾(𝐾):𝐾⊆𝑈∧𝐾is compact}.

Intuitively, 𝛾 measures the extent to which bounded analytic functions outside 𝐾 can deviate from constancy. Generally, the “larger” 𝐾 is, the greater the capacity is.

Proposition 6.3.2.

If 𝐾⊂ℂ is a compact set of discrete points, then 𝜆(𝐾)=0.
Proof.For any 𝑓:ℂ̂∖𝐾→ℂ holomorphic with 𝑓(ℂ̂∖𝐾)⊆𝔻‾, since 𝑓 is bounded, the Riemann’s Theorem for removable singularities (Theorem 3.2.9Theorem 3.2.9Theorem 3.2.9) allows for an analytic continuation onto all of ℂ̂. Then Liouville’s Theorem (Theorem 3.2.5Theorem 3.2.5Theorem 3.2.5) implies that 𝑓 is constant and 𝑓′(∞)=0. Hence 𝛾(𝐾)=0. ⁠□

Theorem 6.3.3.

For 𝐾1⊆𝐾2 both compact in ℂ, 𝛾(𝐾1)≤𝛾(𝐾2).
Proof.This follows directly from the definition and the fact that any function holomorphic on ℂ̂∖𝐾1 is also holomorphic on ℂ̂∖𝐾2. ⁠□

The preceding results above hint at the monotonous behavior of capacity. However, currently it is not known whether a general subadditivity property holds for analytic capacity, or that

𝛾(𝐾1∪𝐾2)≤?𝛾(𝐾1)+𝛾(𝐾2).

Recent results hint the affirmative, as many special cases of the relation have been proved; the question of subadditivity has been proved in the affirmative for disjoint compact continua, and recent findings by Xavier Tolsa show that capacity is (countably) semi-(sub)additive (the existence of an absolute constant 𝐶 such that 𝛾(𝐾1∪𝐾2)≤𝐶[𝛾(𝐾1)+𝛾(𝐾2)]).

We now give some quantifying examples of how analytic capacity measures a type of “largeness” of compact sets, (rather much like area, which satisfies the subadditivity relation). First we define a specific classification of compact sets.

An alternative perspective of this “largeness” pertains to a certain removability of sets. A compact set 𝐾⊂ℂ is considered to be removable if every bounded holomorphic function on the complement can be extended to ℂ. For instance, the analytic capacity 𝛾({𝑎}) of any singleton {𝑎} (any singular point) or set of discrete points is 0, as evidenced by Proposition 6.3.2Proposition 6.3.2Proposition 6.3.2; and moreover, any singleton or compact set of discrete points is a removable set. In a heuristic sense, analytic capacity measures the irremovability of a set, and larger sets tend to be “less removable.”

A compact set 𝐾⋐ℂ is a continuum if it is connected, ℂ∖𝐾 is connected, and if it is not a singleton (𝐾 contains at least 2 distinct points).

Proposition 6.3.4.

Let 𝐾⋐ℂ be a continuum. Then 𝛾(𝐾)=|𝑓′(∞)| where 𝑓:ℂ̂∖𝐾→𝔻 is a biholomorphism satisfying 𝑓(∞)=0 (i. e. the maximal |𝑓′(∞)| in the supremum of the definition of analytic capacity is attained when 𝑓 is biholomorphic).
Proof.

Let 𝑓 be the biholomorphism, 𝑔:ℂ̂∖𝐾→𝔻 be holomorphic (not necessarily surjective) mapping ∞ to 0. Since ℎ≡𝑔∘𝑓−1:𝔻→𝔻 and maps 0 to 0, the Schwarz Lemma (Lemma 3.5.1Lemma 3.5.1Lemma 3.5.1) implies that

|ℎ(𝑧)|≤|𝑧|

for all 𝑧∈𝔻. Thus, |𝑔(𝑧)|≤|𝑓(𝑧)|, and

|𝑔′(∞)|=lim𝑧→∞|𝑧𝑔(𝑧)|≤lim𝑧→∞|𝑧𝑓(𝑧)|=|𝑓′(∞)|.□

Proposition 6.3.5.

The analytic capacity of any closed disk is the radius.
Proof.

Since 𝐷(𝑎,𝑟)‾ is a continuum, a biholomorphism 𝑓:ℂ̂∖𝐷(𝑎,𝑟)‾→𝔻 such that 𝑓(∞)=0. One such biholomorphism is given by

𝑓(𝑧)=𝑟𝑧−𝑎,𝑓′(∞)=lim𝑧→0dd𝑧(𝑟1𝑧−𝑎)=𝑟.
Hence, Proposition 6.3.4Proposition 6.3.4Proposition 6.3.4, gives that 𝛾(𝐷(𝑎,𝑟)‾)=𝑟. ⁠□

Proposition 6.3.6.

If 𝐾⊂ℂ is a continuum, then

diam𝐾4≤𝛾(𝐾)≤diam𝐾.
Proof.

Assume 𝑓:ℂ̂∖𝐾→𝔻 is a biholomorphism mapping ∞ to 0. The lower bound follows directly from Proposition 6.2.2Proposition 6.2.2Proposition 6.2.2. Let 𝑝∈𝐾 be arbitrary, then for any 𝑞∈𝐾, we obtain |𝑝−𝑞|≤diam𝐾, implying that 𝐾⊆𝐷(𝑝,diam𝐾)‾. By Proposition 6.3.5Proposition 6.3.5Proposition 6.3.5, we have 𝛾(𝐷(𝑝,diam𝐾)‾)=diam𝐾, and Theorem 6.3.3Theorem 6.3.3Theorem 6.3.3 consequently gives the upper bound of

𝛾(𝐾)≤diam𝐾.□

We outline the precise connections to rational approximation:

Theorem 6.3.7.

Let 𝐾⊆ℂ be compact such that ∃𝑐>0 such that ∀𝛿>0, ∀𝑝∈𝜕𝐾,

𝛾(𝐷(𝑝,𝛿)∖𝐾)≥𝑐𝛿.
Then ∀𝑓∈𝐶(𝐾) holomorphic on 𝐾⚬ can be uniformly and rationally approximated on 𝐾 with poles in ℂ̂∖𝐾.

Corollary 6.3.7.1.

Let 𝐾⊆ℂ be compact. If the connected components 𝑈𝑗 of ℂ̂∖𝐾 give the uniform existence of some 𝛿>0 such that ∀𝑗, diam𝑈𝑗≥𝛿, then ∀𝑓∈𝐶(𝐾) holomorphic on 𝐾⚬ can be uniformly and rationally approximated on 𝐾 with poles in ℂ̂∖𝐾.

Notice here that no restrictions are imposed on the finiteness of the number of connected components of the complement. The general conclusion given for Mergelyan’s Theorem is not true for more general compact sets.

The counterexample we now provide due to [1], we provide the construction of the compact set 𝐾.

Example 6.3.8.

There exists a compact set 𝐾⊆ℂ and 𝑓∈𝐶(𝐾), such that 𝑓 is holomorphic on 𝐾⚬ and cannot be rationally approximated on 𝐾.
Proof.

Let 𝑆={𝑠𝑘}𝑘∈ℕ be a countable dense set of points in 𝔻 (use a bijection ℕ→ℚ and Cantor’s pairing function ℕ→ℕ2 to get a surjection ℕ→ℚ2∩𝔻).

Fix 0<𝜀′<1. Let 𝑧1=𝑠1 and 𝑟1=𝜀2<𝜀′, 𝑟12<12. For each 𝑘∈ℕ, let 𝑧𝑘 be the first to be the first point in the dense sequence 𝑆 such that

𝑐𝑘∉⋃𝑗=1𝑘−1𝐷(𝑧𝑗,𝑟𝑗)‾.

Then choose 𝑟𝑘 such that 𝐷(𝑧𝑘,𝑟𝑘) lies in 𝔻 and does not intersect any previous 𝐷(𝑧𝑗,𝑟𝑗) for 𝑗<𝑘 (possible by the fact that each 𝑧𝑗 does not lie on the boundary of the previous disks) and so that

0<𝑟𝑘≤𝜀2−12∑𝑗=1𝑘−1𝑟𝑗<𝜀′−∑𝑗=1𝑘−1𝑟𝑗⟹∑𝑗=1𝑘<𝜀′

under the inductive hypothesis that ∑𝑗=1𝑘−1𝑟𝑗<𝜀′. Apply another bound, so that

0<𝑟𝑘2≤14−12∑𝑗=1𝑘−1𝑟𝑗2<12−∑𝑗=1𝑘−1𝑟𝑗2⟹∑𝑗=1𝑘𝑟𝑗2<12

under the additional assumption that ∑𝑗=1𝑘−1𝑟𝑗2<12. Repeat this process inductively for all 𝑘∈ℕ. Define

𝐾=𝔻‾∖⋃𝑗=1∞𝐷(𝑧𝑗,𝑟𝑗),

which is compact. For any point 𝑧∈𝐾, no disk centered at 𝑧 exists such that 𝐷(𝑧,𝛿) is contained in 𝐾, since a subsequence of 𝑆 accumulating to 𝑧 in 𝔻‾ is removed from 𝐾. Hence, 𝐾⚬=⌀. Hence, any 𝑓∈𝐶(𝐾) is holomorphic on the interior.

(This general construction of 𝐾 is known as the Swiss cheese set)

We now show that 𝑧↦𝑧‾ cannot be uniformly rationally approximated on 𝐾. By explicit calculation or Green’s Theorem (Theorem 3.1.2Theorem 3.1.2Theorem 3.1.2), we have

∮𝜕𝐷(𝑧𝑗,𝑟𝑗)𝑧‾d𝑧=∬𝐷(𝑧𝑗,𝑟𝑗)d(𝑧‾d𝑧)=2i∬𝐷(𝑧𝑗,𝑟𝑗)d𝑥∧d𝑦=2πi𝑟𝑗2⟹|∑𝑗=1∞∮𝜕𝐷(𝑧𝑗,𝑟𝑗)𝑧‾d𝑧|≤π,

and by similar reasoning

|∮𝜕𝔻𝑧‾d𝑧|=2π⟹|(∮𝜕𝔻−∑𝑗=1∞∮𝜕𝐷(𝑧𝑗,𝑟𝑗))𝑧‾d𝑧|≥π.

For any rational 𝜓 with poles off 𝐾,

(∮𝜕𝔻−∑𝑗=1∞∮𝜕𝐷(𝑧𝑗,𝑟𝑗))𝜓(𝑧)d𝑧=0

by Theorem 3.1.5Theorem 3.1.5Theorem 3.1.5. The summation’s convergence follows from |∑∮𝜕𝐷(𝑧𝑗,𝑟𝑗)𝜓(𝑧)d𝑧| being termwise absolutely bounded by ∑2π𝑀𝑟𝑗, which converges by construction. Now, if |𝑧‾−𝜓(𝑧)|<14 on 𝐾, then

π≤|(∮𝜕𝔻−∑𝑗=1∞∮𝜕𝐷(𝑧𝑗,𝑟𝑗))𝑧‾d𝑧|≤|∮𝜕𝔻−∑𝑗=1∞∮𝜕𝐷(𝑧𝑗,𝑟𝑗)||𝜓(𝑧)−𝑧‾||d𝑧|≤2π(1−∑𝑗=1∞𝑟𝑗)14≤π2,

which is impossible. ⁠□