Advanced_Complex_Analysis_Notes (6)
Advanced_Complex_Analysis_Notes (6)
Preliminaries
These notes roughly correspond to the course V5B1 - Advanced Topics in
Complex Analysis taught by Prof. Ingo Lieb at the Universität Bonn in the
Winter 2024/25 semester. These notes are LATEX-ed after the fact with significant
alteration and are subject to misinterpretation and mistranscription. Use with cau-
tion. Any errors are undoubtedly my own and any virtues that could be ascribed
to these notes ought be attributed to the instructor and not the typist.
1
2 WERN JUIN GABRIEL ONG
Contents
Preliminaries 1
1. Lecture 1 – 11th October 2024 3
2. Lecture 2 – 15th October 2024 6
3. Lecture 3 – 17th October 2024 10
4. Lecture 4 – 22nd October 2024 13
5. Lecture 5 – 24th October 2024 17
6. Lecture 6 – 29th October 2024 19
7. Lecture 7 – 31st October 2024 21
8. Lecture 8 – 5th November 2024 26
9. Lecture 9 – 7th November 2024 29
10. Lecture 10 – 12th November 2024 34
11. Lecture 11 – 14th November 2024 38
12. Lecture 12 – 19th November 2024 42
13. Lecture 13 – 21st November 2024 45
14. Lecture 14 – 26th November 2024 48
15. Lecture 15 – 28th November 2024 51
16. Lecture 16 – 3rd December 2024 52
17. Lecture 17 – 5th December 2024 54
18. Lecture 18 – 10th December 2024 58
19. Lecture 19 – 12th December 2024 59
Appendix A. Basic Results in Complex Analysis 61
References 62
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 3
where (z0 , z1 , z2 ) ∼ (z0′ , z1′ , z2′ ) if and only if there exists λ ∈ C∗ such that z0 =
λz0′ , z1 = λz1′ , z2 = λz2′ .
We will write these equivalence classes as [z0 : z1 : z2 ].
There is a map ι0 : C2 → CP2 by (u, v) 7→ [1 : u : v] realizing CP2 as ι0 (C2 )∪{z0 =
0}, that is, by adjoining a CP1 at infinity. The closure of image Q b of Q under ι
2 2 2
consists of z0 = z1 + z2 where we have Q = ι0 (Q) ∪ {[0 : 1 : ±i]} which also extends
b
to a rational parametrization by [t0 : t1 ] 7→ [t20 + t21 : −2t0 t1 : t20 − t21 ] rendering the
diagram
C Q C2
CP1 Q
b CP2
commutative. We have the following.
Proposition 1.7. The map [t0 : t1 ] 7→ [t20 + t21 : −2t0 t1 : t20 − t21 ] defines a homeo-
Proposition 1.4 morphism CP1 → Q.
b
b the map admits an inverse [z0 : z1 : z2 ] 7→ [−z0 − z2 : z1 ].
Proof. On Q ■
This shows that Q
b is topologically a sphere.
We now consider the case of cubics.
Definition 1.2 Definition 1.8 (Affine Regular Cubic). An affine regular cubic is a set
K = {(u, v) ∈ C2 : v 2 = f (u)} ⊆ C2
where f (u) is a univariate polynomial of degree 3 with disctinct zeroes.
This too admits a normal form.
Proposition 1.9. There exists a linear change of coordinates such that K is given
by the set {(u, v) ∈ C2 : v 2 = 4u3 − g2 u − g3 } with 4u3 − g2 u − g3 having three
distinct roots.
Proof. Suppose f (u) = a3 u3+ a2 u2 + a1 u + a0 . The desired transformation is given
q
a2
by u 7→ 3 14 · √1
3a + √
3 2
. ■
3 3 a3
This defines an elliptic curve which is a well-studied object in number theory and
arithmetic geometry.
Analogously to the case of quadrics, we can pass to the projective closure K
b given
2 3 2 3
by the equation z0 z2 = 4z1 − g2 z0 z1 − g3 z0 which is a homogeneous polynomial
obtained as the one-point compactification of the regular affine cubic K at the point
[0 : 1 : 0].
This hints at a more general problem of finding rational parametrizations of in-
teresting subsets of Cn which as Galois theory suggests is not possible in general,
nor is it so in the case of cubics. Though the study of cubics will give rise to the
theory of elliptic functions.
As before, we can define a quartic.
Definition 1.10 (Affine Regular Quartic). An affine regular quartic is a set Definition 1.3
H = {(u, v) ∈ C2 : v 2 = f (u)} ⊆ C2
where f (u) is a univariate polynomial of degree 4 with disctinct zeroes.
Without loss of generality, we can take f (u) to be monic and of the form u 4i=2 (u−
Q
Note that since ω1 , ω2 are R-linearly independent, any complex number can be
written as an R-linear combination of ω1 , ω2 . For z ∈ C expressed as z = λ1 ω1 +λ2 ω2
with λ1 , λ2 ∈ R, take m1 m2 ∈ Z such that |λ1 − m1 |, |λ2 − m2 | ≤ 21 . In particular,
for z ∈ G possibly not in Z · ω1 ⊕ Z · ω2 we have that z ′ = z − m1 ω1 − m2 ω2 ∈ G as
well, but
1 1
|z ′ | = |(λ1 − m1 )ω1 + (λ2 − m2 )ω2 | < |ω1 | + |ω2 | ≤ |ω2 |
2 2
where the strictness of the middle inequality follows from R-linear independence
of ω1 , ω2 and the second inequality from 12 |ω1 | ≤ 12 |ω2 | by minimality of |ω1 | in
Br (0)∩G. Now noting that |ω2 | was minimal among G\Z·ω1 , we have that z ′ ∈ Z·ω1
so for z ′ = nω1 we can rewrite z = (n + m1 )ω1 + m2 ω2 showing z ∈ Z · ω1 ⊕ Z · ω2 ,
giving the claim. ■
We can now show that periods form an additive subgroup as follows.
Proposition 2.5. Let f (z) be a meromorphic function on C. If f is not constant,
then the periods of f form a discrete additive subgroup Ω of C.
Proof. Let ω, ω ′ be periods and −ω the additive inverse of ω in C. We can compute
f (z + (ω + ω ′ )) = f ((z + ω) + ω ′ ) = f (z + ω ′ ) = f (z)
f (z − ω) = f ((z + ω) − ω) = f (z)
showing that periods are closed under addition and inversion, and contain zero per
Remark 2.3. Associativity follows from associativity on the group additive group of
complex numbers, showing that the periods form a subgroup.
It remains to show discreteness. Let ω be a period and consider Br (ω) the open
ball of radius r with r chosen small enough that f is analytic on Br (ω). Suppose to
the contrary for each n ∈ N there exists a period ωn ∈ Br/n (ω). Then |ω − ωn | < nr
showing that the sequence ωn → ω as n → ∞. By the identity theorem Theorem A.1,
f is constant on Br (ω), a contradiction, as f is non-constant. ■
Elliptic functions are defined in terms of their period group.
Definition 2.6 (Elliptic Function). A meromorphic function f (z) is elliptic if its
period group contains a lattice.
Remark 2.7. Elliptic functions are often also known as doubly periodic functions.
Remark 2.8. Defining elliptic functions in terms of their period group containing a
lattice allows constant functions to be elliptic – since constant functions have period
group C.
Elliptic functions are determined by their values on their open period parallelo-
gram since for Ω a lattice, we can define an equivalence relation z ∼ z ′ if z − z ′ ∈ Ω.
Definition 2.9 (Period Parallelogram). Let Ω = {a1 ω1 + a2 ω2 : a1 , a2 ∈ Z} ⊆ C be
a lattice. The period parallelogram is given by
PΩ = {t1 ω1 + t2 ω2 : 0 ≤ t1 , t2 < 1} ⊆ C.
8 WERN JUIN GABRIEL ONG
Under the equivalence relation described above, the quotient space C/Ω is an
additive group where each point of the period parallelogram is a representative of
the quotient. Moreover, this can be seen to be a complex torus using the standard
cut-and-paste diagram for a torus in topology which is a compact topological space,
and in fact a compact Riemann surface. As such, any Ω-periodic meromorphic
function is determined by its values on the torus.
We now consider a general property of lattices before returning to a discussion of
periodic functions.
Proof. Denote Pℓ the parallelogram given by the lattice points of the convex hull
of ±ℓω1 , ±ℓω2 and ∂Pℓ its boundary. We have that |∂Pℓ | = 8ℓ and for C =
maxω∈∂P1 |ω| and that (ℓC)k ≤ |ω|k for ω ∈ ∂Pℓ . We can compute
∞ X
X 1 X 1
=
|ω|k |ω|k
ω\{0} ℓ=1 ω∈∂Pℓ
∞ ∞
X 8ℓ 8 X 1
≤ =
(ℓC)k Ck ℓk−1
ℓ=1 ℓ=1
Proof. Double periodicity is preserved under sums, products, differences, and quo-
tients, and the operations distribute in the expected way. Preservation under dif-
ferentiation follows from the chain rule. ■
Proof. The closure of the open period parallelogram PΩ is compact on which |f (z)|
admits a maximum. By periodicity, f (z) is a bounded holomorphic function on C,
from which the claim follows by Liouville’s theorem A.2. ■
Generalizing our discussion to elliptic functions with poles, we can show the
following.
Proof. Without loss of generality, we can take the poles to lie in the interior of the
1
R
open period parallelogram. By Cauchy’s residue theorem, we have 2πi ∂PΩ (z) =
f
Pm
i=1 reszi f . Denoting [a, b] the oriented straight line path from a to b we compute
Z Z Z
1
f (z)dz = f (z)dz + f (z)dz
2πi ∂PΩ [0,ω1 ] [ω1 ,ω1 +ω2 ]
Z Z
+ f (z)dz + f (z)dz
[ω1 +ω2 ,ω2 ] [ω2 ,0]
Z Z !
= f (z)dz − f (z)dz +
[0,ω1 ] [ω2 ,ω1 +ω2 ]
Z Z !
f (z)dz − f (z)dz
[ω1 ,ω1 +ω2 ] [0,ω2 ]
Proof. Without loss of generality, we can take these zeroes and poles to lie in the
′ (z)
interior of the period parallelogram. Consider the function g(z) = z · ff (z) which
has simple poles at both the poles and zeroes of f with Rresidues mi ai and −mi ai ,
1
respectively. In particular, the sum of (3.1) is given by 2πi ∂PΩ g(z)dz. Decomposing
this as an integral over segments as in Proposition 2.13, we have
Z Z Z Z Z
g(z)dz = g(z)dz + g(z)dz + g(z)dz + g(z)dz.
∂PΩ [0,ω1 ] [ω1 ,ω1 +ω2 ] [ω1 +ω2 ,ω2 ] [ω2 ,0]
Considering the integral over the oriented segments [0, ω1 ] and [ω1 + ω2 , ω2 ] we can
write this integral
Z Z Z Z
g(z)dz + g(z)dz = g(z)dz − g(z)dz
[0,ω1 ] [ω1 +ω2 ,ω2 ] [0,ω1 ] [ω2 ,ω1 +ω2 ]
zf ′ (z) (z + ω2 )f ′ (z + ω2 )
Z Z
= dz − dz
[0,ω1 ] f (z) [0,ω1 ] f (z + ω2 )
f ′ (z)
Z
= ω2 dz
[0,ω1 ] f (z)
where we know that f (z) = f (z + ω2 ), f ′ (z) = f ′ (z + ω2 ) with f ′ (z) elliptic by
Proposition 2.11. In particular, this an integer multiple of ω2 . Arguing similarly,
we can see that
f ′ (z)
Z Z Z
g(z)dz + g(z)dz = ω1 dz
[ω1 ,ω1 +ω2 ] [ω2 ,0] [0,ω2 ] f (z)
C : |z| < 2r} and note that |Ω ∩ B2r | < ∞ by discreteness of Ω. For any z with
|z| < r and ω with |ω| > 2r we have |ω|
2 ≤ |ω| − |z| ≤ |ω − z| so we have
X 1 k
X 1
k
≤ 2
|z − ω| |ω|k
|ω|≥2r ω∈Ω\{0}
Thus, repeating this process finitely many times, we eventually arrive at a constant
function where we can arrive at the desired claim by multiplying the expressions by
℘(z)2n to clear denominators. ■
Using the above lemma, we can in fact show that it suffices to use a rational
function in ℘(z) multiplied by ℘′ (z).
Proposition 3.6. Let Ω be a lattice and f (z) elliptic with respect to Ω. Then f (z)
Proposition 3.2 can be written as the product of ℘′ (z) and a rational function in ℘(z).
Proof. Note that if f (z) is an elliptic function of odd order, then f (z)/℘(z) is an
elliptic function of even order. So to prove the claim, it suffices to treat the case of
f (z) an elliptic function of even order.
Let f (z) be even with poles a1 , . . . , an in PΩ \ {0}. Noting that ℘(z) − ℘(ai )
vanishes for all ai , the function (℘(z) − ℘(ai ))mi f (z) willQhave pole nowhere in
PΩ \ {0} for ni sufficiently large. Then observing that f (z) ni=1 (℘(z) − ℘(ai ))mi is
an even elliptic function with poles only at lattice points. Thus by Lemma 3.5, it
can be written as a polynomial in Q℘(z) allowing us to rewrite f (z) as the quotient of
this polynomial by the product ni=1 (℘(z) − ℘(ai ))mi , that is, as a rational function
in ℘(z). ■
Remark 3.7. The expression of an ellitpic function in terms of ℘(z), ℘′ (z) is not
unique.
Consider the elliptic function ℘′ (z)2 . This is an even elliptic function of order 6
with poles on Ω. By Lemma 3.5, we can write this as a degree 3 polynomial in ℘(z),
say a0 + a1 ℘(z) + a2 ℘(z)2 + a3 ℘(z)3 with ai ∈ C. The coefficients ai , however, are
in fact highly structured and can be deduced from the lattice.
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 13
Continuing along this line, we consider the the primitive of log ζ(z).
Lemma 4.6. Let Ω be a lattice. The function
z2
Y z z
f (z) = z 1− exp +
ω ω 2ω 2
ω∈Ω\{0}
Definition 4.1 Definition 4.7 (Weierstrass σ-Function). Let Ω be a lattice. The Weierstrass σ-
function of Ω is given by
z2
Y z z
σ(z) = z 1− exp + .
ω ω 2ω 2
ω∈Ω\{0}
Lemma 6.3. Let q ∈ C× with 0 < |q| < 1 and f (z) meromorphic on C× such that
f (z) = f (qz) for all z ∈ C× . Then f assumes all values in C
b already in the annulus
Aq,r . Furthermore, if f is holomorphic on Aq,r then f is constant.
Proof. If it does not assume all values of C
b then it is bounded on the closure of the
annulus and hence constant by Liouville’s theorem Theorem A.2. ■
We can thus form the torus T = C× /⟨q⟩ where ⟨q⟩ is the subgroup of C× generated
by multiples of q. This is a torus with fundamental domain represented by the
annulus, identifying the inner boundary circle with the outer.
Lemma 6.4. Let f be holomorphic on C× such that there is a constant c ̸= 0
satisfying f (qz) = c · f (z). Then c = q k for some k ∈ Z and f (z) = f (1) · z k .
P∞ n
Proof. Consider the Laurent series expansion of f (z) given by n=−N an z for
N ∈ N. We can compare coefficients
X∞ X∞
n
can z = an q n z n
n=−N n=−N
20 WERN JUIN GABRIEL ONG
which are necessarily equal for all n, and which holds if and only if an = 0 for all
but one n = k at which we have cak z k = ak q k z k with the coefficent ak recovered as
f (1), giving the claim. ■
The subsequent lemma allows us to produce a class of meromorphic functions on
C× that are invariant under q-multiplication.
Lemma 6.5. Let q ∈ C× with 0 < |q| < 1. Then the function
∞
! ∞ !
Y Y q n
p(z) = (1 − q n z) 1−
z
n=1 n=0
Remark 7.2. ζ(s) converges for Re(s) > 1: n−s = e−s log(n) here taking the real
logarithm, so |n−s | = n−Re(s) and the series converges – in fact, uniformly – on
Re(s) > 1.
We now define the Mellin transform which will be a crucial construction, which
will be justified by the following lemma.
Lemma 7.3. Let f : [1, ∞) → R be a locally integrable function
R∞ such that |f (x)| ≤
C · x for some constant C and k ∈ N. Then the integral 1 f (x)x−s−1 dx exists for
k
Re(s) > k.
Proof. For s such that Re(s) > k we have that |f (x)|x−s−1 ≤ C · xk−s−1 where
Re(k − s − 1) < 0 so the function is bounded above by C, giving the claim. ■
Remark 7.4. Recall that a locally integrable function is a function where the
integral over any finite interval exists.
Definition 7.5 (Mellin Transform). Let f : [1, ∞) → R be a locally integrable
function such that |f (x)| ≤ C · xk for some constant C and k ∈ N. The Mellin
transform of f is given by
Z ∞
Mf (s) = s f (x)x−s−1 dx.
1
The Mellin transform for the function x and the Gauss bracket will play a key
role in estimating the distribution of primes.
1
Lemma 7.6. The Mellin transform of f (x) = x is given by 1 + s−1 .
Proof. We compute
Z ∞ Z ∞
−s−1
s x·x dx = s x−s dx
1 1
s
= .
s−1
■
We now define the Gauss bracket and compute its Mellin transform.
Definition 7.7 (Gauss Bracket). The Gauss bracket [x] is given by the largest
integer at most x.
22 WERN JUIN GABRIEL ONG
Lemma 7.8. The Mellin transform of the Gauss bracket f (x) = [x] is given by the
Riemann zeta function ζ(s).
Proof. We compute
Z ∞ ∞
X Z n+1
s [x]x−s−1 dx = s [x]x−s−1 dx
1 n=1 n
X∞ Z n+1
= ns x−s−1 dx
n=1 n
∞
x−s n+1
X
= ns |
−s x=n
n=1
X∞
= n(n−s − (n + 1)−s )
n=1
note the series covnerges for Re(s) > 2 where we decompose the sum
∞
X ∞
X ∞
X
n(n−s − (n + 1)−s ) = n1−s − (n + 1 − 1)(n + 1)−s
n=1 n=1 n=1
X∞ X∞ ∞
X
= n 1−s
− n 1−s
+ n−s
n=1 n=2 n=2
= 1 + (ζ(s) − 1)
= ζ(s)
as desired. ■
The Riemann zeta function admits an alternative description via infinite products.
Theorem 7.10. The Riemann zeta function ζ(s) is equal to the infinite product
Q 1
Theorem 2 p prime 1−p−s for Re(s) > 1.
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 23
Remark 7.11. This already implies that there are infinitely many primes, since if
not we would have a finite product equalling a divergent harmonic series, a contra-
diction.
We also show the following structure result for zeroes of the Riemann zeta function
of real part 1.
Theorem 7.12. The Riemann zeta function ζ(s) has no zeroes with Re(s) = 1. Theorem 3
Proof. Suppose to the contrary there is a zero s with Re(s) = 1, say of the form
1 + ti. Consider the function
Observe that if ζ(1 + it) = 0 then at the pole of ζ(s) at s = 1 is canceled by the zero
of order four in the second factor. The function F (s) thus vanishes at s = 1 and is
holomorphic in a neighborhood around that point. Passing to logarithms, we have
that lims→1 log |F (s)| = −∞.
Now consider the product expression of Theorem 7.10 where we compute
X
log |ζ(s)| = Re log(1 − p−s )−1
p prime
∞
X X 1
= Re
n · pns
p prime n=1
∞
!
X an
= Re
ns
n=1
log |F (s)| = 3 log |ζ(s)| + 4 log |ζ(s + ti)| + log |ζ(s + 2ti)|
∞
X
an Re 3n−s + 4n−s−ti + n−s−2ti
=
n=1
∞
X an
= (3 + 4cos(t · log(n)) + cos(2t · log(n)))
ns
n=1
an
where we note that ns ≥ 0 and
Definition 7.13 (Prime Counting Function). The prime counting function π(x) is
the number of primes at most x.
The prime number theorem concerns the asymptotics of π(x), though it is often
easier to consider ϑ(x). These are linked by the following result.
π(x) log(x) ϑ(x)
x ≤ x Conversely, we can estimate for 1 < y < x
X
π(x) = π(y) + 1
p prime, y<p≤x
1 X
≤ π(y) + log(p)
log(y)
p prime, y<p≤x
1
y+ ϑ(x).
log(y)
We now have
π(x) log(x) y log(x) log(x) ϑ(x)
≤ + .
x x log(y) x
x
Taking y = (log(x))2
we yield
π(x) log(x) 1 log(x) ϑ(x)
≤ +
x log(x) log(x) − 2 log(log(x)) x
where we have
1
lim =0
x→∞ log(x)
log(x)
lim =1
x→∞ log(x) − 2 log(log(x))
by summing inequalities of the above form. Noting for any x ∈ R≥0 an ℓ such that
2ℓ−1 < x ≤ 2ℓ we have
X
ϑ(x) ≤ log(p)
p≤2ℓ
≤ 2ℓ+1 log(2)
≤ 4x log(2)
ϑ(x)
giving x ≤ 4 log(2) hence the claim. ■
Recalling the construction of the Mellin transform from Definition 7.5, we show
the following.
Lemma 8.2. The Mellin transform Mϑ(x) (s) of the Theta function ϑ(x) is given
by
X log(p) ζ ′ (s) X log(p)
Mϑ(x) (s) = s
= − −
p ζ(s) p (ps − 1)
s
p prime p prime
Proof. We compute
Z ∞
Mϑ(x) (s) = s ϑ(x)x−s−1 dx
1
∞
X Z n+1
= s ϑ(x)x−s−1 dx ϑ constant on interval
n=1 n
X∞ Z n+1
= sϑ(n) x−s−1 dx ϑ(x) = ϑ(n) on interval [n, n + 1]
n=1 n
∞
x−s n+1
X
= sϑ(n) |
−s s=n
n=1
X∞
ϑ(n) n−s − (n + 1)−s
=
n=1
where we note this is convergent for Re(s) > 1. Taking Re(s) > 2 we can decompose
the sum
X∞ X∞
= ϑ(n)n−s − ϑ(n)(n + 1)−s
n=1 n=1
X∞ X∞
= ϑ(n)n−s − ϑ(n − 1)n−s changing index of summation in 2nd sum
n=1 n=2
X∞
= (ϑ(n) − ϑ(n − 1))n−s
n=1
but noting (
log(n) n prime
ϑ(n) − ϑ(n − 1) =
0 otherwise
P log(p)
the above expression simplifies to p prime ps . Since this also converges for
Re(s) > 1, the identity theorem Theorem A.1 allows us to extend this function
to agree with Mϑ(x) (s) on this halfspace.
For the second equality, we consider the logarithmic derivative of ζ(s) as an Euler
product in Theorem 7.10 to observe
ζ ′ (s) X p−s log(p)
− =
ζ(s) 1 − p−s
p prime
X log(p)
=
ps − 1
p prime
with
X log(p) X log(p) X log(p)
− =
ps − 1 ps (ps − 1) ps
p prime p prime p prime
giving the claim. ■
28 WERN JUIN GABRIEL ONG
s=1
γ1
δ R
γ2
′
The segments γ2+ , γ2− have length at most πδ2 so since |µRe(s)−1 | ≤ 1 we have
1 s−1 1 1 δ1 A
F (s) + µs−1 ds ≤ · πδ ′ A(R, δ) = .
2πi γ2′ R2 s−1 2π 2
Now for ε > 0 we can take R = 1ε and δ sufficiently small such that each of
the first two summands of (9.1) is less than ε by taking µ large and for the third
summand taking δ ′ small such that the integral over γ2′ and the sum of integrals
on γ2+ , γ2− are both at most ε by taking µ large and δ ′ small. In sum we have that
|F (1) − Fµ (1)| ≤ 4ε bounded by a function decreasing in µ, giving the claim. ■
The prime number theorem is a consequence of Proposition 9.1 and the following
lemma.
Lemma 9.2. Let f : [1, ∞) → R be a nondecreasing function such that
Z µ
f (x) 1
lim − dx
µ→∞ 1 x2 x
f (x)
exists. Then limx→∞ x = 1.
Proof. Suppose to the contrary that the limit is not 1, then for η > 0 there is
an increasing sequence {xn }n≥0 such that | f (x n)
xn − 1| ≥ η in which case we can
assume, by rearranging the equation, that f (xn ) ≥ (1 + η)xn for all n by passing to
1+η
a subsequence. Taking ρ = 1+η/2 we have for xn ≤ x ≤ ρxn that
η
1+ x ≤ (1 + η)xn ≤ f (xn ) ≤ f (x)
2
with the last inequality by f increasing. So integrating on the interval [xn , ρxn ] we
get Z ρxn
η log(ρ) f (x) 1
0< ≤ − dx
2 xn x2 x
a contradiction to existence fo the improper integra. ■
The above suffices to prove the prime number theorem.
Theorem 9.3 (Prime Number Theorem). Let π(x) be the prime counting function.
Then
π(x) · log(x)
lim = 1.
x→∞ x
Proof. By Proposition 7.15 it suffices to show limx→∞ ϑ(x) ϑ(x)
x = 1. Let f (x) = x − 1
and
Z ∞ Z ∞
ϑ(x)
F (s) = s − 1 x−s dx = s (ϑ(x) − x)x−s−1 dx = Mϑ(x)−x (s)
1 x 1
which admits a holomorphic extension to a neighborhood of the closed halfspace
Re(s) ≥ 1 by Proposition 8.3. Further noting ϑ(x) x is bounded by Lemma 8.1 and
is locally integrable, Proposition 9.1 applies and we have existence of the improper
integral Fµ (1) and the conclusion follows by Lemma 9.2. ■
32 WERN JUIN GABRIEL ONG
Then
1
∂zj f (z) = ∆j (z) = ∂xj f (z) − i · ∂yj f (z)
2
and
1
∂zj f (z) = Ej (z) = ∂xj f (z) + i · ∂yj f (z) .
2
Proof. Suppsose z1 = τ1 , . . . , zj−1 = τj−1 , zj+1 = τj+1 , . . . , zn = τn so f ′ (z) =
limzj →τj f (z)−f (τ )
zj −τj = ∆j (τ ), the second equality in the first line follows from the first
by applying the chain rule, and the second set of equalities follows by an analogous
computation. ■
As such, we can show the following theorem.
Theorem 10.2. Let U ⊆ Cn be an open set and f : U → C a function. f is
complex holomorphic if and only if it is real differentiable and satisfies the system
of partial differential equations
∂z1 f (z) = · · · = ∂zn f (z) = 0.
Proof. Proposition 10.1 expresses ∂zj f (z) in terms of Ej (z) which vanish identically
for a holomorphic function by Definition 9.14. ■
Remark 10.3. Evidently a holomoprhic function is holomorphic in each variable.
That is, for f : U → C holomorphic, the function f (τ1 , . . . , τj−1 , zj , τj+1 , . . . , τn ) is
a univariate holomorphic function in zj . Furthermore, while in real analysis there
exist functions that are differentiable in each variable but are not even continuous,
differentiability in each variable implies global differentiability in complex analysis
by Hartogs’ theorem. This is highly subtle and is beyond the scope of the course,
and an account can be found in the text of Hörmander [H90].
We can show that holomorphic functions on a domain behave well algebraically
and form a ring.
Proposition 10.4. Let U ⊆ Cn be open. The set of holomorphic functions OU is
a C-algebra that contains C[z1 , . . . , zn ].
Proof. Elements of C[z1 , . . . , zn ] are holomorphic on Cn and hence on U , and the
constants are holomorphic on U . Complex differentiable functions are preserved
sums and products, and thus so too are holomorphic functions. ■
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 35
We now state and prove the Cauchy integral formula for functions of several
complex variables. To do so, we will define integrals over the distinguished boundary
of a polydisc.
Definition 10.5 (Distinguished Boundary of Polydisc). Let Dr (τ ) be a polydisc of
polyradius r around τ . The distinguished boundary Tr (τ ) of Dr (τ ) is given by
{z ∈ Cn : |zj − τj | = rj }.
Remark 10.6. The distinguished boundary is the product of n copies of the topo-
logical circle S 1 , that is, is of real dimension n.
We can now turn to a discussion of the multivariate Cauchy integral formula.
Theorem 10.7 (Multivariate Cauchy Integral). Let U ⊆ Cn be an open set and
f : U → C a holomorphic function. If Dr (τ ) ⊆ U is a polydisc with distinguished
boundary Tr (τ ) then for all α ∈ U
Z
1 f (z)
f (α) = n
dz.
(2πi) Tr (τ ) (z1 − α1 ) . . . (zn − αn )
Proof. The n = 1 case is the univariate Cauchy integral formula. We proceed by
induction on n, supposing it holds for the case k. Consider the case k + 1 with a
function f (z1 , . . . , zk+1 ). Let g(z1 ) = f (z1 , α2 , . . . , αk+1 ) be a univariate function.
By Cauchy’s integral formula in one dimension, we have
Z
g(z1 )
f (α) = f (α1 , . . . , αk+1 ) = dw.
Tr1 (τ1 ) z1 − α1
But by the induction hypothesis, for fixed w, we have
Z
f (z1 , z2 , . . . , zn )
f (z1 , α2 , . . . , αk+1 ) =
T(r ,...,r ) ((τ2 ,...,τk+1 ))
(z 2 − α2 ) . . . (zn − αn )
2 k+1
Proof. Differentiating the Cauchy kernel under the integral sign, we have
Z
ν ν1 ! . . . νn ! f (w)
∂z Cf (z) = dw . . . dwn
(2πi) n
Tr (τ ) (w1 − z1 )
ν 1 +1 . . . (wn − zn )νn +1 1
giving the claim. ■
We will now consider analogues of key results in complex analysis in the multi-
variate setting. This discussion will require the following lemma which often allows
us to reduce to the single variable case.
Lemma 10.11. Let α, β ∈ Cn and λ : C 7→ Cn by t 7→ α + tβ. If f is holomorphic
on U ⊆ Cn open then f ◦ λ is holomorphic on λ−1 (U ).
Proof. We compute
n
d X
(f ◦ λ)(t) = ∂zj (λ(t))βj
dt
j=1
which is a βj -weighted sum of holomorphic functions and hence holomorphic on
λ−1 (U ) = f |L . ■
We can now prove the multivariate analogues of the identity theorem and maxi-
mum principle.
Theorem 10.12 (Multivariate Identity). Let f be holomorphic on a domain G and
Theorem 1.5 identically zero on a nonempty open subset U of G. Then f ≡ 0 on G.
Proof. Let L be a line the image of λ through G and consider f ◦ λ the induced
holomorphic function of one variable. By the identity theorem in one variable Theo-
rem A.1, f is identically zero on all of L. Writing G as the union of all lines passing
through it gives the claim. ■
Theorem 10.13 (Multivariate Maximum Modulus). Let f be holomophric on a
Theorem 1.6 domain G and |f | has local maximum at τ ∈ G. Then f (z) = f (τ ) is constant.
Proof. Arguing as before, let L be a line the image of λ through G and consider
f ◦ λ the induced holomorphic function of one variable. By the maximum maximum
modulus principle in one variable, f is constant on all of L. Writing G as the union
of all lines passing through it gives the claim. ■
We now turn to a consequence of Theorem 10.7 and some surprising consequences.
Proposition 10.14. Let Dr (τ ) ⊆ Cn for n ≥ 2. If f is holomorphic in a punctured
neighborhood of the origin in Dr (τ ), then f is holomorphic on Dr (τ ).
Proof. By translation, it suffices to consider the case of a function f holomorphic on
D1 (0) \ D1/2 (0) in Cn , here considering polydiscs of fixed radius. By the univariate
Cauchy integral formula we have
Z
1 f (z)
f (α) = dz
(2πi)n Tr (τ ) (z1 − α1 ) . . . (zn − αn )
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 37
but fixing any αj the Cauchy integral formula in one variable holds but αj is arbi-
trary so the function extends in each variable to all of D1 (0) and so it does over-
all. ■
This implies that holomorphic functions have zeroes and thus poles along a subset
of Cn of codimension at least 1.
Corollary 10.15. Let f be a holomorphic function on U ⊆ Cn open. Then {z ∈
Cn : f (z) = 0} and {z ∈ Cn : f (z) = ∞} are non-isolated.
Proof. The poles of f are non-isolated by Proposition 10.14 and thus so too zeroes
are non-isolated under passage to 1/f (z). ■
With the language of holomorphic functions in hand, we can discuss holomorphic
maps.
Definition 10.16 (Holomorphic Map). Let U ⊆ Cn , V ⊆ Cm be open sets and
f = (f1 , . . . , fm ) : U → V be a continuous function. f is a holomorphic map if each
component function fk : U → C is holomorphic.
The chain rule generalizes to the multivariate setting.
Proposition 10.17 (Multivariate Chain Rule). Let U ⊆ Cn , V ⊆ Cm be open sets
and f = (f1 , . . . , fm ) : U → V and g : V → C holomorphic functions. Then
m
X ∂g ∂f
∂zj (g ◦ f ) = .
∂wk ∂zj
k=1
Proof. This is immediate from the chain rule and the Cauchy-Riemann equations.
■
38 WERN JUIN GABRIEL ONG
as desired. ■
Proof. Note that JfR (z) is everywhere regular showing the existence of a real dif-
ferentiable inverse f −1 by the implicit function theorem. It remains to show f −1
is
holomorphic.
We can compute the complex Jacobian of f −1 which we write as
A B
and since f is holomorphic we have that its complex Jacobian is block
C D
M 0
diagonal , we have the product
0 M
M 0 A B
= id
0 M C D
showing B, C = 0 and thus f −1 is holomorphic. ■
40 WERN JUIN GABRIEL ONG
n
Vp 1 Let M ⊆ R be open. A differential p-form
Definition 12.9 (Differential p-Form).
p
on M is an element of E (M ) = E (M ).
Note a p-form can be written as
X
fi1 ,...,ip · dxi1 ∧ dxi2 ∧ · · · ∧ dxip
1≤i1 <i2 <···<ip ≤n
with fi1 ,...,ip ∈ E 0 (M ) so we can define the differential of a p-form as the p + 1-form
X
dfi1 ,...,ip · dxi1 ∧ dxi2 ∧ · · · ∧ dxip .
1≤i1 <i2 <···<ip ≤n
and X
g◦f = (gi1 ,...,ip ◦ f ) · dgi1 ∧ dgi2 ∧ · · · ∧ dgip .
0≤i1 <i2 <···<ip ≤m
If f and the gi1 ,...,ip are differentiable then d(g) ◦ f = d(g ◦ f ).
Of special concern to us will be differential n-forms in n-dimensional objects.
Definition 12.11 (Integration over Differential Form). Let f be an n-form on a
measurable subset M of Rn . Then
Z Z
f= f1,...,n (x)dx
M M
where f = f1,...,n (x) · dx1 ∧ dx2 ∧ · · · ∧ dxn .
44 WERN JUIN GABRIEL ONG
In the complex setting the constructions and results carry over verbatim. How-
ever, instead of merely treating differentiable functions, we also consider holomor-
phic functions and thus holomorphic differential forms. These are defined as follows.
Definition 12.12 (Holomorphic Differential Form). Let U ⊆ Cn be open. A dif-
ferential 1-form f on U is holomorphic if ∂zj f · dzj = 0 for all j and
n
X n
X
f= ∂zj f · dzj + ∂zj dzj .
j=1 j=1
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 45
1 P (z−τ )α
Proof. We have that z 7→ w−z can be written as a geometric series α∈Zn (w−τ )α+1
≥0
which is uniformly convergent for w on the boundary of a proper sub-polydisc by
Proposition 13.7. Now applying Cauchy’s integral formula Theorem 10.7, we can
interchange integration and summation to yield
Z !
X 1 f (w)
f (z) = n α+1
dw (z − τ )α
n
(2πi) ∂Tr′ (τ ) (w − τ )
α∈Z≥0
but the integral is precisely the partial derivative, which was the claim. ■
We now build up to the definition of the structure sheaf on Cn .
Definition 13.9 (Germ of Functions). Let z ∈ Cn . The ring of germs Oz at z
is given by equivalence classes of functions f holomorphic in a neighborhood of z
under the pointwise operations where f ∼ g if and only if there exists an open set
V ⊆ Uf ∩Ug of the neighborhoods Uf , Ug on which f, g are holomorphic, respectively,
Definition 3.3 on which f |V = g|V .
We can define the structure sheaf as the disjoint union of these rings.
Definition
` 13.10 (Structure Sheaf). The structure sheaf O on Cn is given by
Definition 3.4 & 3.6 z∈Cn Oz .
There is an evident map p : O → Cn by (f, z) 7→ z.
Definition 13.11 (Continuous Section of Structure Sheaf). Let U ⊆ C. A contin-
uous section of O over U is a continuous function σ : U → O such that σ(z) ∈ Oz
Definiton 3.5 and there exists a holomorphic function f on U such that σ(z) = fz for all z ∈ U .
Remark 13.12. The definition above allows us to endow O with the structure of
a topological space with basis elements given by σ(U ) for U ⊆ Cn
Let us return to more general considerations of holomorphic functions.
Proposition 13.13. Let U ⊆ Cn be open, K ⊆ C an annulus around the origin
of internal and external radii r, R, respectively, and f : U × K → C a holomorphic
function. There exist unique holomorphic functions f0 on U × DR (0) and f∞ on
Proposition 4.1 U × (C \ Dr (0)) such that f = f0 + f∞ and limw→∞ f∞ (z, w) = 0.
Proof. We can write
Z Z
1 f (z, u) 1 f (z, u)
f (z, w) = du − du
2πi |u|=R′ u−w 2πi |u|=r′ u−w
for r′ < |w| < R′ which are holomorphic in z and w in |w| < R′ and |w| > r′ ,
respectively. We can take
(
f0 (z, w) |w| < R
fe(z) =
−f∞ (z, w) |w| > r
which is an entire function that goes to 0 as w → ∞. Thus fe is an entire function
limiting to 0 as w → ∞ showing uniqueness. ■
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 47
The Weierstrass theorem shows that zeroes of holomorphic functions are highly
structured.
Lemma 14.3. If f a holomorphic function on an open neighborhood U around
the origin and vanishing at the origin in Cn+1 , then there exists a linear change of
coordinates T such that f ◦ T is zn regular of some order. Lemma 4.5
Proof. Consider a complex line L on which f is not identically zero. Setting this
line L as the w-coordinate, we get that f vanishes at w = 0. ■
Example 14.4. f (z1 , z2 ) is neither z1 nor z2 -regular. But under the transformation
z1 = u1 , z2 = u1 + u2 , we have that f (u1 , u2 ) = u21 + u1 u2 is u1 -regular of order 2.
Lemma 14.5. Let f be a zn -regular function of order k. There are constants
0 < r′ , 0 < r < R such that f converges on Dr′ (0) × DR (0) ⊆ Cn−1 × C, has no
zeroes outside the disc Dr′ (0) × Dr (0) ⊆ Cn−1 × C, and f (z ′ , zn ) is of order k with
respect to zn . Lemma 4.6
Proof. This is a direct application of Theorem 14.1 as the function f (0, zn ) has an
order k zero at the origin. ■
More generally, we can define Weierstrass polynomials as follows.
Definition 14.6 (Weierstrass Polynomial). A Weierstrass polynomial of order k is
a function in (z1 , . . . , zn−1 , zn ) = (z ′ , zn ) given by
ω(z ′ , zn ) = znk + ak−1 (z ′ )znk−1 + · · · + a1 (z ′ )zn + a0 (z ′ )
where ak (0) = 0.
We will require the following result about zn -regular functions of order k in the
following exposition.
Theorem 14.7 (Weierstrass Formal). Let f be a zn -regular function of order k.
For each g ∈ C{z1 , . . . , zn }, there exists a unique decomposition g = qf + r where
q ∈ C{z1 , . . . , zn } and r ∈ C{z1 , . . . , zn−1 }[zn ] of degree smaller than k in zn . Theorem 4.8
Proof. By the Weierstrass preparation theorem, we can write f = eω for ω a
Weierstrass polynomial of order k. Up to setting g = g/e, we can take f to be
a Weierstrass polynomial. Now consider g/ω and let r, R, r′ be such that g/ω
is holomorphic on Dr′ (0) × K(r, R), the product of a disc and annulus. By the
Laurent decomposition proposition 13.13, we can write ωg = q + h where q, h are
holomorphic in Dr′ (0) × DR (0) and Dr′ (0) × K(r, R), respectively. Now recall-
ing ω is given k
P∞ as zn + ak−1 (z ′ )znk−1 + · · · + a1 (z ′ )zn + a0 (z ′ ), we have that for Once again denot-
h(z , zn ) = m=1 cm (z )zn−m , the product ωh is given by
′ ′ ing z ′ for the coordi-
∞ nates z1 , . . . , zn−1 .
X
′ ′
ωh = b1 (z )znk−1 + · · · + b0 (z ) + bm (z ′ )zn−m .
m=1
P∞
Writing r(z ′ , zn ) = b1 (z ′ )znk−1 + · · · + b0 (z ′ ), R(z ′ , zn ) = m=1 bm (z
′ )z −m ,
we have
n
g = qω + r(z ′ , zn ) + R(z ′ , zn ) and it remains to show the latter summand vanishes.
50 WERN JUIN GABRIEL ONG
Remark 16.9. That is, in the expression of Definition 16.8, the wedge-factor dwj
is omitted, making the Bochner-Martinelli kernel a form of type (n, n − 1, 0, 0) in
the dw, dw, dz, dz’s, respectively.
We prove an elementary property of the Bochner-Martinelli kernel.
Lemma 16.10. Let U ⊆ Cn be a bounded open set with smooth boundary and τ ∈
U and f continuously differentiable on ∂U . Then d(f (w)β(w, z)) = ∂f (w) ∧ β(w, z).
Proof. Note that f (w)β(w, τ ) contain the holomorphic forms dwj so we can compute
d(f (w)β(w, τ )) = ∂(f (w)β(w, τ ))
= ∂f (w) ∧ β(w, τ )
n
wj − τj
(n − 1)! X
+ f (w) ∂ w j
dw1 ∧ dw1 ∧ · · · ∧ dwn ∧ dwn
(2πi)n j=1 ∥w − τ ∥2n
but
n n
|wj − τj |2
X wj − τj X 1
∂wj = − n
∥w − τ ∥2n ∥w − z∥2n ∥w − τ ∥2n+2
j=1 j=1
=0
giving the claim. ■
54 WERN JUIN GABRIEL ONG
n
(n − 1)!
Z X
= (wj − zj )dw1 ∧ dw1 ∧ · · · ∧ dwj−1 ∧ dwj ∧ dwj+1 ∧ · · · ∧ dwn ∧ dwn
r2n (2πi)n ∂Br (τ ) j=1
n
(n − 1)!
Z X
= 2n d (wj − zj )dw1 ∧ dw1 ∧ · · · ∧ dwj−1 ∧ dwj ∧ dwj+1 ∧ · · · ∧ dwn ∧ dwn
r (2πi)n Br (τ ) j=1
(n − 1)!
Z
= n · dw1 ∧ dw1 ∧ · · · ∧ dwj ∧ dwj+1
r2n (2πi)n Br (τ )
(n − 1)!
Z
= n(2i)n dV
r2n (2πi)n Br (τ )
=1
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 55
(n − 1)!
Z X
+ 2n ∂wj f (w)(wj − τj ) · dw1 ∧ dw1 ∧ · · · ∧ dwn ∧ dwn .
r (2πi)n Br (τ ) j=1
Proof. We compute
Z
∂ z F (z) = f (w)∂ z B(w, z)
∂G
Z
=− f (w)∂ w β1 (w, z)
Z∂G
=− ∂ w (f (w)β1 (w, z))
∂G
Z
=− dw (f (w)β1 (w, z))
∂G
=0
as desired. ■
In turn:
56 WERN JUIN GABRIEL ONG
A proof of Proposition 17.9 can be found in [Lee13, §2]. Note in particular that
holomorphic phenomena are in particular smooth which justifies their use in what
follows.
Proposition 17.10. Let U ⊆ Cn be open and {(Ui , fi )}i∈I , {(Vj , gj )}j∈J be Cousin-
I distributions such that their union is a Cousin-I distribution. If f ∈ K(U ) is a
solution to the Cousin-I distribution {(Ui , fi )}i∈I then f is a solution to the Cousin-I
distribution {(Vj , gj )}j∈J as well.
Proof. Let f ∈ K(U ) be a solution to the Cousin-I problem for the distribution
{(Ui , fi )}i∈I and {ψj }j∈J be a partition of unity subordinate to the cover {Vj }j∈J .
We want to show that f |Vj − gj ∈ O(Vj ) for all j ∈ J. For this, we note that
Vj admits a cover by {Ui ∩ Vj }i∈I on which fi |Ui ∩Vj − gj |Ui ∩Vj is holomorphic so
fi ψj − gj is holomorphic on all Vj and similarly f − fi |Ui ∩Vj is holomorphic for all
Ui ∩Vj and all i ∈ I with fixed j ∈ J which extends holomorphically to f |Vj −fi ψj on
Vj But their sum is f |Vj − gj and holomorphic as it is the finite sum of holomorphic
functions by local finiteness of the cover. ■
This motivates the following definition.
Definition 17.11 (Equivalent Cousin-I Distributions). Let U ⊆ Cn be open and
{(Ui , fi )}i∈I , {(Vj , gj )}j∈J be Cousin-I distributions. {(Ui , fi )}i∈I , {(Vj , gj )}j∈J are
equivalent Cousin-I distributions if their union is a Cousin-I distribution.
This reduces solving the Cousin-I problem to the following.
Proposition 17.12. Let U ⊆ Cn be open and f ∈ C ∞ (U ), f = nj=1 fj dzj , and
P
there exists u a smooth function such that ∂u = f and ∂f = 0. Then the Cousin-I
problem admits a solution. Proposition 1
P
Proof. Let {(Ui , fi )}i∈I be a Cousin-I distribution as above and set gi = j∈I ϕj fji
which is defined on Ui . Note that on Uik the difference gi − gk is given by fik as
expected and that ∂gi − ∂gj = 0. We can define function f as in the hypothesis of
the theorem by taking f |Ui = ∂gi which statisfies the hypothesis by inspection and
admits a solution u to the Cousin-I problem. ■
58 WERN JUIN GABRIEL ONG
We induct over k.
Note if f ∈ E0 then f is identically 0 and each form lies in En . For the base case,
observe that if f is a (0, 1)-form on Dr′ (τ ) with ∂f = 0 wtih f ∈ E0 we are done.
Now suppose the assumption holds for Ek−1 where we can write
X
f= fJ dz J = dzk ∧ g + h
|J|=s
and compute
n
X X
∂e
g= ∂zl geT · dzl ∧ dz T
|T |=s−1 l=1
= h1 + ∂zk ∧ g
with g, h ∈ Ek−1 so taking u such that ∂u = h − h1 we have f = ∂g + ∂u as
desired. ■
We can now show the Dolbeault lemma in general.
Theorem 19.3 (Dolbeault Lemma). Let Dr (τ ) ⊆ Cn be a polydisc, f a smooth
(0, q)-form on Dr (τ ) such that ∂f = 0. Then there exists a smooth (0, q − 1)-form
Theorem 3.3 u on Dr (τ ) such that ∂u = f .
Proof. Let Dr0 (τ ) ⊆ Dr1 (τ ) ⊆ . . . be a sequence of polydiscs each Drt (τ ) having
compact closure in Drt+1 (τ ) and Dr (τ ) = ∞
S
t=0 rt ). We proceed by induction on
D (τ
the index t.
By Lemma 19.2, there exist functions u0 smooth on Dr0 (τ ) satisfying ∂u0 = f on
Dr0 (τ ). Now suppose that there are functions u0 , . . . , ul which are (0, q − 1)-forms
on Drλ (τ ) for 0 ≤ λ ≤ l such that ∂uλ = f on Drλ (τ ) and uλ = uλ−1 on Drλ−2 (τ ).
We can then construct u′l+1 on Drl+1 (τ ) such that ∂u′l+1 = f, ∂(u′l+1 − ul ) = 0 on
Drl (τ ).
We can thus find h on Drl−1 (τ ) such that ∂h = u′l+1 +ul with h smooth on Drl+1 (τ )
and taking ul+1 = u′l+1 − ∂h we have ∂ul+1 = f . We can then take u = liml→∞ ul
which is a solution on all of Dr (τ ). The case q = 1 follows by estimating using the
Taylor development and bounding the growth differences on polydiscs. ■
ADVANCED TOPICS IN COMPLEX ANALYSIS – BONN, WINTER 2024/25 61
References
[Ahl79] Lars Ahlfors. Complex analysis. An introduction to the theory of analytic functions
of one complex variable. English. 3rd edition, reprint of the 1979 edition. Vol. 385.
AMS Chelsea Publ. Providence, RI: American Mathematical Society (AMS), 2021.
isbn: 978-1-4704-6767-8.
[H90] Lars Hörmander. An introduction to complex analysis in several variables. English.
3rd revised ed. Vol. 7. North-Holland Math. Libr. Amsterdam etc.: North-Holland,
1990. isbn: 0-444-88446-7.
[Lee24] John M. Lee. Introduction to complex manifolds. English. Vol. 244. Grad. Stud.
Math. Providence, RI: American Mathematical Society (AMS), 2024. isbn: 978-
1-4704-7695-3; 978-1-4704-7782-0; 978-1-4704-7781-3. doi: 10.1090/gsm/244.
[Lee13] John M. Lee. Introduction to smooth manifolds. English. 2nd revised ed. Vol. 218.
Grad. Texts Math. New York, NY: Springer, 2013. isbn: 978-1-4419-9981-8; 978-
1-4419-9982-5. doi: 10.1007/978-1-4419-9982-5.
[Ran86] R. Michael Range. Holomorphic functions and integral representations in several
complex variables. English. Vol. 108. Grad. Texts Math. Springer, Cham, 1986.
[SS03] Elias M. Stein and Rami Shakarchi. Complex analysis. English. Vol. 2. Princeton
Lect. Anal. Princeton, NJ: Princeton University Press, 2003. isbn: 0-691-11385-8.
Universität Bonn, Bonn, D-53113
Email address: [email protected]
URL: https://wgabrielong.github.io/