You are currently browsing the category archive for the ‘teaching’ category.
Almost 20 years ago, I wrote a textbook in real analysis called “Analysis I“. It was intended to complement the many good available analysis textbooks out there by focusing more on foundational issues, such as the construction of the natural numbers, integers, rational numbers, and reals, as well as providing enough set theory and logic to allow students to develop proofs at high levels of rigor.
While some proof assistants such as Coq or Agda were well established when the book was written, formal verification was not on my radar at the time. However, now that I have had some experience with this subject, I realize that the content of this book is in fact very compatible with such proof assistants; in particular, the ‘naive type theory’ that I was implicitly using to do things like construct the standard number systems, dovetails well with the dependent type theory of Lean (which, among other things, has excellent support for quotient types).
I have therefore decided to launch a Lean companion to “Analysis I”, which is a “translation” of many of the definitions, theorems, and exercises of the text into Lean. In particular, this gives an alternate way to perform the exercises in the book, by instead filling in the corresponding “sorries” in the Lean code. (I do not however plan on hosting “official” solutions to the exercises in this companion; instead, feel free to create forks of the repository in which these sorries are filled in.)
Currently, the following sections of the text have been translated into Lean:
- Section 2.1: The natural numbers
- Section 2.2: Addition
- Section 2.3: Multiplication
- Chapter 2 epilogue: Isomorphism with the Mathlib natural numbers
- Section 3.1: Basic set theory
- Section 4.1: The integers
The formalization has been deliberately designed to be separate from the standard Lean math library Mathlib at some places, but reliant on it at others. For instance, Mathlib already has a standard notion of the natural numbers . In the Lean formalization, I first develop “by hand” an alternate construction
Chapter2.Nat of the natural numbers (or just Nat, if one is working in the Chapter2 namespace), setting up many of the basic results about these alternate natural numbers which parallel similar lemmas about that are already in Mathlib (but with many of these lemmas set as exercises to the reader, with the proofs currently replaced with “sorries”). Then, in an epilogue section, isomorphisms between these alternate natural numbers and the Mathlib natural numbers are established (or more precisely, set as exercises). From that point on, the Chapter 2 natural numbers are deprecated, and the Mathlib natural numbers are used instead. I intend to continue this general pattern throughout the book, so that as one advances into later chapters, one increasingly relies on Mathlib’s definitions and functions, rather than directly referring to any counterparts from earlier chapters. As such, this companion could also be used as an introduction to Lean and Mathlib as well as to real analysis (somewhat in the spirit of the “Natural number game“, which in fact has significant thematic overlap with Chapter 2 of my text).
The code in this repository compiles in Lean, but I have not tested whether all of the (numerous) “sorries” in the code can actually be filled (i.e., if all the exercises can actually be solved in Lean). I would be interested in having volunteers “playtest” the companion to see if this can actually be done (and if the helper lemmas or “API” provided in the Lean files are sufficient to fill in the sorries in a conceptually straightforward manner without having to rely on more esoteric Lean programming techniques). Any other feedback will of course also be welcome.
[UPDATE, May 31: moved the companion to a standalone repository.]
A basic type of problem that occurs throughout mathematics is the lifting problem: given some space that “sits above” some other “base” space
due to a projection map
, and some map
from a third space
into the base space
, find a “lift”
of
to
, that is to say a map
such that
. In many applications we would like to have
preserve many of the properties of
(e.g., continuity, differentiability, linearity, etc.).
Of course, if the projection map is not surjective, one would not expect the lifting problem to be solvable in general, as the map
to be lifted could simply take values outside of the range of
. So it is natural to impose the requirement that
be surjective, giving the following commutative diagram to complete:
If no further requirements are placed on the lift , then the axiom of choice is precisely the assertion that the lifting problem is always solvable (once we require
to be surjective). Indeed, the axiom of choice lets us select a preimage
in the fiber of each point
, and one can lift any
by setting
. Conversely, to build a choice function for a surjective map
, it suffices to lift the identity map
to
.
Of course, the maps provided by the axiom of choice are famously pathological, being almost certain to be discontinuous, non-measurable, etc.. So now suppose that all spaces involved are topological spaces, and all maps involved are required to be continuous. Then the lifting problem is not always solvable. For instance, we have a continuous projection from
to
, but the identity map
cannot be lifted continuously up to
, because
is contractable and
is not.
However, if is a discrete space (every set is open), then the axiom of choice lets us solve the continuous lifting problem from
for any continuous surjection
, simply because every map from
to
is continuous. Conversely, the discrete spaces are the only ones with this property: if
is a topological space which is not discrete, then if one lets
be the same space
equipped with the discrete topology, then the only way one can continuously lift the identity map
through the “projection map”
(that maps each point to itself) is if
is itself discrete.
These discrete spaces are the projective objects in the category of topological spaces, since in this category the concept of an epimorphism agrees with that of a surjective continuous map. Thus can be viewed as the unique (up to isomorphism) projective object in this category that has a bijective continuous map to
.
Now let us narrow the category of topological spaces to the category of compact Hausdorff (CH) spaces. Here things should be better behaved; for instance, it is a standard fact in this category that continuous bijections are homeomorphisms, and it is still the case that the epimorphisms are the continuous surjections. So we have a usable notion of a projective object in this category: CH spaces such that any continuous map
into another CH space can be lifted via any surjective continuous map
to another CH space.
By the previous discussion, discrete CH spaces will be projective, but this is an extremely restrictive set of examples, since of course compact discrete spaces must be finite. Are there any others? The answer was worked out by Gleason:
Proposition 1 A compact Hausdorff spaceis projective if and only if it is extremally disconnected, i.e., the closure of every open set is again open.
Proof: We begin with the “only if” direction. Let was projective, and let
be an open subset of
. Then the closure
and complement
are both closed, hence compact, subsets of
, so the disjoint union
is another CH space, which has an obvious surjective continuous projection map
to
formed by gluing the two inclusion maps together. As
is projective, the identity map
must then lift to a continuous map
. One easily checks that
has to map
to the first component
of the disjoint union, and
ot the second component; hence
, and so
is open, giving extremal disconnectedness.
Conversely, suppose that is extremally disconnected, that
is a continuous surjection of CH spaces, and
is continuous. We wish to lift
to a continuous map
.
We first observe that it suffices to solve the lifting problem for the identity map , that is to say we can assume without loss of generality that
and
is the identity. Indeed, for general maps
, one can introduce the pullback space
So now we are trying to lift the identity map via a continuous surjection
. Let us call this surjection
minimally surjective if no restriction
of
to a proper closed subset
of
remains surjective. An easy application of Zorn’s lemma shows that every continuous surjection
can be restricted to a minimally surjective continuous map
. Thus, without loss of generality, we may assume that
is minimally surjective.
The key claim now is that every minimally surjective map into an extremally disconnected space is in fact a bijection. Indeed, suppose for contradiction that there were two distinct points
in
that mapped to the same point
under
. By taking contrapositives of the minimal surjectivity property, we see that every open neighborhood of
must contain at least one fiber
of
, and by shrinking this neighborhood one can ensure the base point is arbitrarily close to
. Thus, every open neighborhood of
must intersect every open neighborhood of
, contradicting the Hausdorff property.
It is well known that continuous bijections between CH spaces must be homeomorphisms (they map compact sets to compact sets, hence must be open maps). So is a homeomorphism, and one can lift the identity map to the inverse map
.
Remark 2 The property of being “minimally surjective” sounds like it should have a purely category-theoretic definition, but I was unable to match this concept to a standard term in category theory (something along the lines of a “minimal epimorphism”, I would imagine).
In view of this proposition, it is now natural to look for extremally disconnected CH spaces (also known as Stonean spaces). The discrete CH spaces are one class of such spaces, but they are all finite. Unfortunately, these are the only “small” examples:
Lemma 3 Any first countable extremally disconnected CH spaceis discrete.
Proof: If such a space were not discrete, one could find a sequence
in
converging to a limit
such that
for all
. One can sparsify the elements
to all be distinct, and from the Hausdorff property one can construct neighbourhoods
of each
that avoid
, and are disjoint from each other. Then
and then
are disjoint open sets that both have
as an adherent point, which is inconsistent with extremal disconnectedness: the closure of
contains
but is disjoint from
, so cannot be open.
Thus for instance there are no extremally disconnected compact metric spaces, other than the finite spaces; for instance, the Cantor space is not extremally disconnected, even though it is totally disconnected (which one can easily see to be a property implied by extremal disconnectedness). On the other hand, once we leave the first-countable world, we have plenty of such spaces:
Lemma 4 Letbe a complete Boolean algebra. Then the Stone dual
of
(i.e., the space of boolean homomorphisms
) is an extremally disconnected CH space.
Proof: The CH properties are standard. The elements of
give a basis of the topology given by the clopen sets
. Because the Boolean algebra is complete, we see that the closure of the open set
for any family
of sets is simply the clopen set
, which obviously open, giving extremal disconnectedness.
Remark 5 In fact, every extremally disconnected CH spaceis homeomorphic to a Stone dual of a complete Boolean algebra (and specifically, the clopen algebra of
); see Gleason’s paper.
Corollary 6 Every CH spaceis the surjective continuous image of an extremally disconnected CH space.
Proof: Take the Stone-Čech compactification of
equipped with the discrete topology, or equivalently the Stone dual of the power set
(i.e., the ultrafilters on
). By the previous lemma, this is an extremally disconnected CH space. Because every ultrafilter on a CH space has a unique limit, we have a canonical map from
to
, which one can easily check to be continuous and surjective.
Remark 7 In fact, to each CH spaceone can associate an extremally disconnected CH space
with a minimally surjective continuous map
. The construction is the same, but instead of working with the entire power set
, one works with the smaller (but still complete) Boolean algebra of domains – closed subsets of
which are the closure of their interior, ordered by inclusion. This
is unique up to homoeomorphism, and is thus a canonical choice of extremally disconnected space to project onto
. See the paper of Gleason for details.
Several facts in analysis concerning CH spaces can be made easier to prove by utilizing Corollary 6 and working first in extremally disconnected spaces, where some things become simpler. My vague understanding is that this is highly compatible with the modern perspective of condensed mathematics, although I am not an expert in this area. Here, I will just give a classic example of this philosophy, due to Garling and presented in this paper of Hartig:
Theorem 8 (Riesz representation theorem) Letbe a CH space, and let
be a bounded linear functional. Then there is a (unique) Radon measure
on
(on the Baire
-algebra, generated by
) such
for all
.
Uniqueness of the measure is relatively straightforward; the difficult task is existence, and most known proofs are somewhat complicated. But one can observe that the theorem “pushes forward” under surjective maps:
Proposition 9 Supposeis a continuous surjection between CH spaces. If the Riesz representation theorem is true for
, then it is also true for
.
Proof: As is surjective, the pullback map
is an isometry, hence every bounded linear functional on
can be viewed as a bounded linear functional on a subspace of
, and hence by the Hahn–Banach theorem it extends to a bounded linear functional on
. By the Riesz representation theorem on
, this latter functional can be represented as an integral against a Radon measure
on
. One can then check that the pushforward measure
is then a Radon measure on
, and gives the desired representation of the bounded linear functional on
.
In view of this proposition and Corollary 6, it suffices to prove the Riesz representation theorem for extremally disconnected CH spaces. But this is easy:
Proposition 10 The Riesz representation theorem is true for extremally disconnected CH spaces.
Proof: The Baire -algebra is generated by the Boolean algebra of clopen sets. A functional
induces a finitely additive measure
on this algebra by the formula
. This is in fact a premeasure, because by compactness the only way to partition a clopen set into countably many clopen sets is to have only finitely many of the latter sets non-empty. By the Carathéodory extension theorem,
then extends to a Baire measure, which one can check to be a Radon measure that represents
(the finite linear combinations of indicators of clopen sets are dense in
).
Previous set of notes: Notes 3. Next set of notes: 246C Notes 1.
One of the great classical triumphs of complex analysis was in providing the first complete proof (by Hadamard and de la Vallée Poussin in 1896) of arguably the most important theorem in analytic number theory, the prime number theorem:
Theorem 1 (Prime number theorem) Letdenote the number of primes less than a given real number
. Then
(or in asymptotic notation,
as
).
(Actually, it turns out to be slightly more natural to replace the approximation in the prime number theorem by the logarithmic integral
, which happens to be a more precise approximation, but we will not stress this point here.)
The complex-analytic proof of this theorem hinges on the study of a key meromorphic function related to the prime numbers, the Riemann zeta function . Initially, it is only defined on the half-plane
:
Definition 2 (Riemann zeta function, preliminary definition) Letbe such that
. Then we define
Note that the series is locally uniformly convergent in the half-plane , so in particular
is holomorphic on this region. In previous notes we have already evaluated some special values of this function:
The Riemann zeta function has several remarkable properties, some of which we summarise here:
Theorem 3 (Basic properties of the Riemann zeta function)
- (i) (Euler product formula) For any
with
, we have
where the product is absolutely convergent (and locally uniform in
) and is over the prime numbers
.
- (ii) (Trivial zero-free region)
has no zeroes in the region
.
- (iii) (Meromorphic continuation)
has a unique meromorphic continuation to the complex plane (which by abuse of notation we also call
), with a simple pole at
and no other poles. Furthermore, the Riemann xi function
is an entire function of order
(after removing all singularities). The function
is an entire function of order one after removing the singularity at
.
- (iv) (Functional equation) After applying the meromorphic continuation from (iii), we have
for all
(excluding poles). Equivalently, we have
for all
. (The equivalence between the (5) and (6) is a routine consequence of the Euler reflection formula and the Legendre duplication formula, see Exercises 26 and 31 of Notes 1.)
Proof: We just prove (i) and (ii) for now, leaving (iii) and (iv) for later sections.
The claim (i) is an encoding of the fundamental theorem of arithmetic, which asserts that every natural number is uniquely representable as a product
over primes, where the
are natural numbers, all but finitely many of which are zero. Writing this representation as
, we see that
The claim (ii) is immediate from (i) since the Euler product is absolutely convergent and all terms are non-zero.
We remark that by sending to
in Theorem 3(i) we conclude that
The meromorphic continuation (iii) of the zeta function is initially surprising, but can be interpreted either as a manifestation of the extremely regular spacing of the natural numbers occurring in the sum (1), or as a consequence of various integral representations of
(or slight modifications thereof). We will focus in this set of notes on a particular representation of
as essentially the Mellin transform of the theta function
that briefly appeared in previous notes, and the functional equation (iv) can then be viewed as a consequence of the modularity of that theta function. This in turn was established using the Poisson summation formula, so one can view the functional equation as ultimately being a manifestation of Poisson summation. (For a direct proof of the functional equation via Poisson summation, see these notes.)
Henceforth we work with the meromorphic continuation of . The functional equation (iv), when combined with special values of
such as (2), gives some additional values of
outside of its initial domain
, most famously
From Theorem 3 and the non-vanishing nature of , we see that
has simple zeroes (known as trivial zeroes) at the negative even integers
, and all other zeroes (the non-trivial zeroes) inside the critical strip
. (The non-trivial zeroes are conjectured to all be simple, but this is hopelessly far from being proven at present.) As we shall see shortly, these latter zeroes turn out to be closely related to the distribution of the primes. The functional equation tells us that if
is a non-trivial zero then so is
; also, we have the identity
Conjecture 4 (Riemann hypothesis) All the non-trivial zeroes oflie on the critical line
.
This conjecture would have many implications in analytic number theory, particularly with regard to the distribution of the primes. Of course, it is far from proven at present, but the partial results we have towards this conjecture are still sufficient to establish results such as the prime number theorem.
Return now to the original region where . To take more advantage of the Euler product formula (3), we take complex logarithms to conclude that
The series and
that show up in the above formulae are examples of Dirichlet series, which are a convenient device to transform various sequences of arithmetic interest into holomorphic or meromorphic functions. Here are some more examples:
Exercise 5 (Standard Dirichlet series) Letbe a complex number with
.
- (i) Show that
.
- (ii) Show that
, where
is the divisor function of
(the number of divisors of
).
- (iii) Show that
, where
is the Möbius function, defined to equal
when
is the product of
distinct primes for some
, and
otherwise.
- (iv) Show that
, where
is the Liouville function, defined to equal
when
is the product of
(not necessarily distinct) primes for some
.
- (v) Show that
, where
is the holomorphic branch of the logarithm that is real for
, and with the convention that
vanishes for
.
- (vi) Use the fundamental theorem of arithmetic to show that the von Mangoldt function is the unique function
such that
for every positive integer
. Use this and (i) to provide an alternate proof of the identity (8). Thus we see that (8) is really just another encoding of the fundamental theorem of arithmetic.
Given the appearance of the von Mangoldt function , it is natural to reformulate the prime number theorem in terms of this function:
Theorem 6 (Prime number theorem, von Mangoldt form) One has(or in asymptotic notation,
as
).
Let us see how Theorem 6 implies Theorem 1. Firstly, for any , we can write
Exercise 7 Show that Theorem 1 conversely implies Theorem 6.
The alternate form (8) of the Euler product identity connects the primes (represented here via proxy by the von Mangoldt function) with the logarithmic derivative of the zeta function, and can be used as a starting point for describing further relationships between and the primes. Most famously, we shall see later in these notes that it leads to the remarkably precise Riemann-von Mangoldt explicit formula:
Theorem 8 (Riemann-von Mangoldt explicit formula) For any non-integer, we have
where
ranges over the non-trivial zeroes of
with imaginary part in
. Furthermore, the convergence of the limit is locally uniform in
.
Actually, it turns out that this formula is in some sense too precise; in applications it is often more convenient to work with smoothed variants of this formula in which the sum on the left-hand side is smoothed out, but the contribution of zeroes with large imaginary part is damped; see Exercise 22. Nevertheless, this formula clearly illustrates how the non-trivial zeroes of the zeta function influence the primes. Indeed, if one formally differentiates the above formula in
, one is led to the (quite nonrigorous) approximation
Comparing Theorem 8 with Theorem 6, it is natural to suspect that the key step in the proof of the latter is to establish the following slight but important extension of Theorem 3(ii), which can be viewed as a very small step towards the Riemann hypothesis:
Theorem 9 (Slight enlargement of zero-free region) There are no zeroes ofon the line
.
It is not quite immediate to see how Theorem 6 follows from Theorem 8 and Theorem 9, but we will demonstrate it below the fold.
Although Theorem 9 only seems like a slight improvement of Theorem 3(ii), proving it is surprisingly non-trivial. The basic idea is the following: if there was a zero at , then there would also be a different zero at
(note
cannot vanish due to the pole at
), and then the approximation (9) becomes
In fact, Theorem 9 is basically equivalent to the prime number theorem:
Exercise 10 For the purposes of this exercise, assume Theorem 6, but do not assume Theorem 9. For any non-zero real, show that
as
, where
denotes a quantity that goes to zero as
after being multiplied by
. Use this to derive Theorem 9.
This equivalence can help explain why the prime number theorem is remarkably non-trivial to prove, and why the Riemann zeta function has to be either explicitly or implicitly involved in the proof.
This post is only intended as the briefest of introduction to complex-analytic methods in analytic number theory; also, we have not chosen the shortest route to the prime number theorem, electing instead to travel in directions that particularly showcase the complex-analytic results introduced in this course. For some further discussion see this previous set of lecture notes, particularly Notes 2 and Supplement 3 (with much of the material in this post drawn from the latter).
Previous set of notes: Notes 2. Next set of notes: Notes 4.
On the real line, the quintessential examples of a periodic function are the (normalised) sine and cosine functions ,
, which are
-periodic in the sense that
What about periodic functions on the complex plane? We can start with singly periodic functions which obey a periodicity relationship
for all
in the domain and some period
; such functions can also be viewed as functions on the “additive cylinder”
(or equivalently
). We can rescale
as before. For holomorphic functions, we have the following characterisations:
Proposition 1 (Description of singly periodic holomorphic functions)In both cases, the coefficients
- (i) Every
-periodic entire function
has an absolutely convergent expansion
where
is the nome
, and the
are complex coefficients such that
Conversely, every doubly infinite sequence
of coefficients obeying (2) gives rise to a
-periodic entire function
via the formula (1).
- (ii) Every bounded
-periodic holomorphic function
on the upper half-plane
has an expansion
where the
are complex coefficients such that
Conversely, every infinite sequence
obeying (4) gives rise to a
-periodic holomorphic function
which is bounded away from the real axis (i.e., bounded on
for every
).
can be recovered from
by the Fourier inversion formula
for any
in
(in case (i)) or
(in case (ii)).
Proof: If is
-periodic, then it can be expressed as
for some function
on the “multiplicative cylinder”
, since the fibres of the map
are cosets of the integers
, on which
is constant by hypothesis. As the map
is a covering map from
to
, we see that
will be holomorphic if and only if
is. Thus
must have a Laurent series expansion
with coefficients
obeying (2), which gives (1), and the inversion formula (5) follows from the usual contour integration formula for Laurent series coefficients. The converse direction to (i) also follows by reversing the above arguments.
For part (ii), we observe that the map is also a covering map from
to the punctured disk
, so we can argue as before except that now
is a bounded holomorphic function on the punctured disk. By the Riemann singularity removal theorem (Exercise 35 of 246A Notes 3)
extends to be holomorphic on all of
, and thus has a Taylor expansion
for some coefficients
obeying (4). The argument now proceeds as with part (i).
The additive cylinder and the multiplicative cylinder
can both be identified (on the level of smooth manifolds, at least) with the geometric cylinder
, but we will not use this identification here.
Now let us turn attention to doubly periodic functions of a complex variable , that is to say functions
that obey two periodicity relations
Within the world of holomorphic functions, the collection of doubly periodic functions is boring:
Proposition 2 Letbe an entire doubly periodic function (with periods
linearly independent over
). Then
is constant.
In the language of Riemann surfaces, this proposition asserts that the torus is a non-hyperbolic Riemann surface; it cannot be holomorphically mapped non-trivially into a bounded subset of the complex plane.
Proof: The fundamental domain (up to boundary) enclosed by is compact, hence
is bounded on this domain, hence bounded on all of
by double periodicity. The claim now follows from Liouville’s theorem. (One could alternatively have argued here using the compactness of the torus
.
To obtain more interesting examples of doubly periodic functions, one must therefore turn to the world of meromorphic functions – or equivalently, holomorphic functions into the Riemann sphere . As it turns out, a particularly fundamental example of such a function is the Weierstrass elliptic function
Previous set of notes: Notes 1. Next set of notes: Notes 3.
In Exercise 5 (and Lemma 1) of 246A Notes 4 we already observed some links between complex analysis on the disk (or annulus) and Fourier series on the unit circle:
- (i) Functions
that are holomorphic on a disk
are expressed by a convergent Fourier series (and also Taylor series)
for
(so in particular
), where
conversely, every infinite sequenceof coefficients obeying (1) arises from such a function
.
- (ii) Functions
that are holomorphic on an annulus
are expressed by a convergent Fourier series (and also Laurent series)
, where
conversely, every doubly infinite sequenceof coefficients obeying (2) arises from such a function
.
- (iii) In the situation of (ii), there is a unique decomposition
where
extends holomorphically to
, and
extends holomorphically to
and goes to zero at infinity, and are given by the formulae
whereis any anticlockwise contour in
enclosing
, and and
whereis any anticlockwise contour in
enclosing
but not
.
This connection lets us interpret various facts about Fourier series through the lens of complex analysis, at least for some special classes of Fourier series. For instance, the Fourier inversion formula becomes the Cauchy-type formula for the Laurent or Taylor coefficients of
, in the event that the coefficients are doubly infinite and obey (2) for some
, or singly infinite and obey (1) for some
.
It turns out that there are similar links between complex analysis on a half-plane (or strip) and Fourier integrals on the real line, which we will explore in these notes.
We first fix a normalisation for the Fourier transform. If is an absolutely integrable function on the real line, we define its Fourier transform
by the formula
will be a bounded continuous function; from the Riemann-Lebesgue lemma it also decays to zero as
. My choice to place the
in the exponent is a personal preference (it is slightly more convenient for some harmonic analysis formulae such as the identities (4), (5), (6) below), though in the complex analysis and PDE literature there are also some slight advantages in omitting this factor. In any event it is not difficult to adapt the discussion in this notes for other choices of normalisation. It is of interest to extend the Fourier transform beyond the
class into other function spaces, such as
or the space of tempered distributions, but we will not pursue this direction here; see for instance these lecture notes of mine for a treatment.
Exercise 1 (Fourier transform of Gaussian) Ifis a complex number with
and
is the Gaussian function
, show that the Fourier transform
is given by the Gaussian
, where we use the standard branch for
.
The Fourier transform has many remarkable properties. On the one hand, as long as the function is sufficiently “reasonable”, the Fourier transform enjoys a number of very useful identities, such as the Fourier inversion formula
with “dual” qualitative properties of its Fourier transform
; in particular, “decay” properties of
tend to be associated with “regularity” properties of
, and vice versa. For instance, the Fourier transform of rapidly decreasing functions tend to be smooth. There are complex analysis counterparts of this Fourier dictionary, in which “decay” properties are described in terms of exponentially decaying pointwise bounds, and “regularity” properties are expressed using holomorphicity on various strips, half-planes, or the entire complex plane. The following exercise gives some examples of this:
Exercise 2 (Decay ofimplies regularity of
) Let
be an absolutely integrable function.
Hint: to establish holomorphicity in each of these cases, use Morera’s theorem and the Fubini-Tonelli theorem. For uniqueness, use analytic continuation, or (for part (iv)) the Schwartz reflection principle.
- (i) If
has super-exponential decay in the sense that
for all
and
(that is to say one has
for some finite quantity
depending only on
), then
extends uniquely to an entire function
. Furthermore, this function continues to be defined by (3).
- (ii) If
is supported on a compact interval
then the entire function
from (i) obeys the bounds
for
. In particular, if
is supported in
then
.
- (iii) If
obeys the bound
for all
and some
, then
extends uniquely to a holomorphic function
on the horizontal strip
, and obeys the bound
in this strip. Furthermore, this function continues to be defined by (3).
- (iv) If
is supported on
(resp.
), then there is a unique continuous extension of
to the lower half-plane
(resp. the upper half-plane
) which is holomorphic in the interior of this half-plane, and such that
uniformly as
(resp.
). Furthermore, this function continues to be defined by (3).
Later in these notes we will give a partial converse to part (ii) of this exercise, known as the Paley-Wiener theorem; there are also partial converses to the other parts of this exercise.
From (3) we observe the following intertwining property between multiplication by an exponential and complex translation: if is a complex number and
is an absolutely integrable function such that the modulated function
is also absolutely integrable, then we have the identity
is a complex number such that at least one of the two sides of the equation in (7) is well defined. Thus, multiplication of a function by an exponential weight corresponds (formally, at least) to translation of its Fourier transform. By using contour shifting, we will also obtain a dual relationship: under suitable holomorphicity and decay conditions on
, translation by a complex shift will correspond to multiplication of the Fourier transform by an exponential weight. It turns out to be possible to exploit this property to derive many Fourier-analytic identities, such as the inversion formula (4) and the Poisson summation formula (6), which we do later in these notes. (The Plancherel theorem can also be established by complex analytic methods, but this requires a little more effort; see Exercise 8.)
The material in these notes is loosely adapted from Chapter 4 of Stein-Shakarchi’s “Complex Analysis”.
Previous set of notes: 246A Notes 5. Next set of notes: Notes 2.
— 1. Jensen’s formula —
Suppose is a non-zero rational function
, then by the fundamental theorem of algebra one can write
Exercise 1 Letbe a complex polynomial of degree
.
- (i) (Gauss-Lucas theorem) Show that the complex roots of
are contained in the closed convex hull of the complex roots of
.
- (ii) (Laguerre separation theorem) If all the complex roots of
are contained in a disk
, and
, then all the complex roots of
are also contained in
. (Hint: apply a suitable Möbius transformation to move
to infinity, and then apply part (i) to a polynomial that emerges after applying this transformation.)
There are a number of useful ways to extend these formulae to more general meromorphic functions than rational functions. Firstly there is a very handy “local” variant of (1) known as Jensen’s formula:
Theorem 2 (Jensen’s formula) Letbe a meromorphic function on an open neighbourhood of a disk
, with all removable singularities removed. Then, if
is neither a zero nor a pole of
, we have
where
and
range over the zeroes and poles of
respectively (counting multiplicity) in the disk
.
One can view (3) as a truncated (or localised) variant of (1). Note also that the summands are always non-positive.
Proof: By perturbing slightly if necessary, we may assume that none of the zeroes or poles of
(which form a discrete set) lie on the boundary circle
. By translating and rescaling, we may then normalise
and
, thus our task is now to show that
by the useful device of Blaschke products. Suppose for instance that
has a zero
inside the disk
. Observe that the function
on the unit circle
, equals
at the origin, has a simple zero at
, but has no other zeroes or poles inside the disk. Thus Jensen’s formula (4) already holds if
is replaced by
. To prove (4) for
, it thus suffices to prove it for
, which effectively deletes a zero
inside the disk
from
(and replaces it instead with its inversion
). Similarly we may remove all the poles inside the disk. As a meromorphic function only has finitely many poles and zeroes inside a compact set, we may thus reduce to the case when
has no poles or zeroes on or inside the disk
, at which point our goal is simply to show that
An important special case of Jensen’s formula arises when is holomorphic in a neighborhood of
, in which case there are no contributions from poles and one simply has
are non-negative; it can be viewed as a more precise assertion of the subharmonicity of
(see Exercises 60(ix) and 61 of 246A Notes 5). Here are some quick applications of this formula:
Exercise 3 Use (6) to give another proof of Liouville’s theorem: a bounded holomorphic functionon the entire complex plane is necessarily constant.
Exercise 4 Use Jensen’s formula to prove the fundamental theorem of algebra: a complex polynomialof degree
has exactly
complex zeroes (counting multiplicity), and can thus be factored as
for some complex numbers
with
. (Note that the fundamental theorem was invoked previously in this section, but only for motivational purposes, so the proof here is non-circular.)
Exercise 5 (Shifted Jensen’s formula) Letbe a meromorphic function on an open neighbourhood of a disk
, with all removable singularities removed. Show that
for all
in the open disk
that are not zeroes or poles of
, where
and
. (The function
appearing in the integrand is sometimes known as the Poisson kernel, particularly if one normalises so that
and
.)
Exercise 6 (Bounded type)
- (i) If
is a holomorphic function on
that is not identically zero, show that
.
- (ii) If
is a meromorphic function on
that is the ratio of two bounded holomorphic functions that are not identically zero, show that
. (Functions
of this form are said to be of bounded type and lie in the Nevanlinna class for the unit disk
.)
Exercise 7 (Smoothed out Jensen formula) Letbe a meromorphic function on an open set
, and let
be a smooth compactly supported function. Show that
where
range over the zeroes and poles of
(respectively) in the support of
. Informally argue why this identity is consistent with Jensen’s formula. (Note: as many of the functions involved here are not holomorphic, complex analysis tools are of limited use. Try using real variable tools such as Stokes theorem, Greens theorem, or integration by parts.)
When applied to entire functions , Jensen’s formula relates the order of growth of
near infinity with the density of zeroes of
. Here is a typical result:
Proposition 8 Letbe an entire function, not identically zero, that obeys a growth bound
for some
and all
. Then there exists a constant
such that
has at most
zeroes (counting multiplicity) for any
.
Entire functions that obey a growth bound of the form for every
and
(where
depends on
) are said to be of order at most
. The above theorem shows that for such functions that are not identically zero, the number of zeroes in a disk of radius
does not grow much faster than
. This is often a useful preliminary upper bound on the zeroes of entire functions, as the order of an entire function tends to be relatively easy to compute in practice.
Proof: First suppose that is non-zero. From (6) applied with
and
one has
Just as (3) and (7) give truncated variants of (1), we can create truncated versions of (2). The following crude truncation is adequate for many applications:
Theorem 9 (Truncated formula for log-derivative) Letbe a holomorphic function on an open neighbourhood of a disk
that is not identically zero on this disk. Suppose that one has a bound of the form
for some
and all
on the circle
. Let
be constants. Then one has the approximate formula
for all
in the disk
other than zeroes of
. Furthermore, the number of zeroes
in the above sum is
.
Proof: To abbreviate notation, we allow all implied constants in this proof to depend on .
We mimic the proof of Jensen’s formula. Firstly, we may translate and rescale so that and
, so we have
when
, and our main task is to show that
. Note that if
then
vanishes on the unit circle and hence (by the maximum principle) vanishes identically on the disk, a contradiction, so we may assume
. From hypothesis we then have
Suppose has a zero
with
. If we factor
, where
is the Blaschke product (5), then
Similarly, given a zero with
, we have
, so using Blaschke products to remove all of these zeroes also only affects the left-hand side of (8) by
(since the number of zeroes here is
), with
also modified by at most
. Thus we may assume in fact that
has no zeroes whatsoever within the unit disk. We may then also normalise
, then
for all
. By Jensen’s formula again, we have
Exercise 10
- (i) (Borel-Carathéodory theorem) If
is analytic on an open neighborhood of a disk
and
, show that
(Hint: one can normalise
,
,
, and
. Now
maps the unit disk to the half-plane
. Use a Möbius transformation to map the half-plane to the unit disk and then use the Schwarz lemma.)
- (ii) Use (i) to give an alternate way to conclude the proof of Theorem 9.
A variant of the above argument allows one to make precise the heuristic that holomorphic functions locally look like polynomials:
Exercise 11 (Local Weierstrass factorisation) Let the notation and hypotheses be as in Theorem 9. Then show thatfor all
in the disk
, where
is a polynomial whose zeroes are precisely the zeroes of
in
(counting multiplicity) and
is a holomorphic function on
of magnitude
and first derivative
on this disk. Furthermore, show that the degree of
is
.
Exercise 12 (Preliminary Beurling factorisation) Letdenote the space of bounded analytic functions
on the unit disk; this is a normed vector space with norm
- (i) If
is not identically zero, and
denote the zeroes of
in
counting multiplicity, show that
and
- (ii) Let the notation be as in (i). If we define the Blaschke product
where
is the order of vanishing of
at zero, show that this product converges absolutely to a holomorphic function on
, and that
for all
. (It may be easier to work with finite Blaschke products first to obtain this bound.)
- (iii) Continuing the notation from (i), establish a factorisation
for some holomorphic function
with
for all
.
- (iv) (Theorem of F. and M. Riesz, special case) If
extends continuously to the boundary
, show that the set
has zero measure.
Remark 13 The factorisation (iii) can be refined further, withbeing the Poisson integral of some finite measure on the unit circle. Using the Lebesgue decomposition of this finite measure into absolutely continuous parts one ends up factorising
functions into “outer functions” and “inner functions”, giving the Beurling factorisation of
. There are also extensions to larger spaces
than
(which are to
as
is to
), known as Hardy spaces. We will not discuss this topic further here, but see for instance this text of Garnett for a treatment.
Exercise 14 (Littlewood’s lemma) Letbe holomorphic on an open neighbourhood of a rectangle
for some
and
, with
non-vanishing on the boundary of the rectangle. Show that
where
ranges over the zeroes of
inside
(counting multiplicity) and one uses a branch of
which is continuous on the upper, lower, and right edges of
. (This lemma is a popular tool to explore the zeroes of Dirichlet series such as the Riemann zeta function.)
Just a short announcement that next quarter I will be continuing the recently concluded 246A complex analysis class as 246B. Topics I plan to cover:
- Schwartz-Christoffel transformations and the uniformisation theorem (using the remainder of the 246A notes);
- Jensen’s formula and factorisation theorems (particularly Weierstrass and Hadamard); the Gamma function;
- Connections with the Fourier transform on the real line;
- Elliptic functions and their relatives;
- (if time permits) the Riemann zeta function and the prime number theorem.
Notes for the later material will appear on this blog in due course.
Consider a disk in the complex plane. If one applies an affine-linear map
to this disk, one obtains
Theorem 1 (Holomorphic images of disks) Letbe a disk in the complex plane, and
be a holomorphic function with
.
- (i) (Open mapping theorem or inverse function theorem)
contains a disk
for some
. (In fact there is even a holomorphic right inverse of
from
to
.)
- (ii) (Bloch theorem)
contains a disk
for some absolute constant
and some
. (In fact there is even a holomorphic right inverse of
from
to
.)
- (iii) (Koebe quarter theorem) If
is injective, then
contains the disk
.
- (iv) If
is a polynomial of degree
, then
contains the disk
.
- (v) If one has a bound of the form
for all
and some
, then
contains the disk
for some absolute constant
. (In fact there is holomorphic right inverse of
from
to
.)
Parts (i), (ii), (iii) of this theorem are standard, as indicated by the given links. I found part (iv) as (a consequence of) Theorem 2 of this paper of Degot, who remarks that it “seems not already known in spite of its simplicity”; an equivalent form of this result also appears in Lemma 4 of this paper of Miller. The proof is simple:
Proof: (Proof of (iv)) Let , then we have a lower bound for the log-derivative of
at
:
The constant in (iv) is completely sharp: if
and
is non-zero then
contains the disk
Part (v) is implicit in the standard proof of Bloch’s theorem (part (ii)), and is easy to establish:
Proof: (Proof of (v)) From the Cauchy inequalities one has for
, hence by Taylor’s theorem with remainder
for
. By Rouche’s theorem, this implies that the function
has a unique zero in
for any
, if
is a sufficiently small absolute constant. The claim follows.
Note that part (v) implies part (i). A standard point picking argument also lets one deduce part (ii) from part (v):
Proof: (Proof of (ii)) By shrinking slightly if necessary we may assume that
extends analytically to the closure of the disk
. Let
be the constant in (v) with
; we will prove (iii) with
replaced by
. If we have
for all
then we are done by (v), so we may assume without loss of generality that there is
such that
. If
for all
then by (v) we have
Here is another classical result stated by Alexander (and then proven by Kakeya and by Szego, but also implied to a classical theorem of Grace and Heawood) that is broadly compatible with parts (iii), (iv) of the above theorem:
Proposition 2 Letbe a disk in the complex plane, and
be a polynomial of degree
with
for all
. Then
is injective on
.
The radius is best possible, for the polynomial
has
non-vanishing on
, but one has
, and
lie on the boundary of
.
If one narrows slightly to
then one can quickly prove this proposition as follows. Suppose for contradiction that there exist distinct
with
, thus if we let
be the line segment contour from
to
then
. However, by assumption we may factor
where all the
lie outside of
. Elementary trigonometry then tells us that the argument of
only varies by less than
as
traverses
, hence the argument of
only varies by less than
. Thus
takes values in an open half-plane avoiding the origin and so it is not possible for
to vanish.
To recover the best constant of requires some effort. By taking contrapositives and applying an affine rescaling and some trigonometry, the proposition can be deduced from the following result, known variously as the Grace-Heawood theorem or the complex Rolle theorem.
Proposition 3 (Grace-Heawood theorem) Letbe a polynomial of degree
such that
. Then
contains a zero in the closure of
.
This is in turn implied by a remarkable and powerful theorem of Grace (which we shall prove shortly). Given two polynomials of degree at most
, define the apolar form
by
Theorem 4 (Grace’s theorem) Letbe a circle or line in
, dividing
into two open connected regions
. Let
be two polynomials of degree at most
, with all the zeroes of
lying in
and all the zeroes of
lying in
. Then
.
(Contrapositively: if , then the zeroes of
cannot be separated from the zeroes of
by a circle or line.)
Indeed, a brief calculation reveals the identity
The same method of proof gives the following nice consequence:
Theorem 5 (Perpendicular bisector theorem) Letbe a polynomial such that
for some distinct
. Then the zeroes of
cannot all lie on one side of the perpendicular bisector of
. For instance, if
, then the zeroes of
cannot all lie in the halfplane
or the halfplane
.
I’d be interested in seeing a proof of this latter theorem that did not proceed via Grace’s theorem.
Now we give a proof of Grace’s theorem. The case can be established by direct computation, so suppose inductively that
and that the claim has already been established for
. Given the involvement of circles and lines it is natural to suspect that a Möbius transformation symmetry is involved. This is indeed the case and can be made precise as follows. Let
denote the vector space of polynomials
of degree at most
, then the apolar form is a bilinear form
. Each translation
on the complex plane induces a corresponding map on
, mapping each polynomial
to its shift
. We claim that the apolar form is invariant with respect to these translations:
Next, we see that the inversion map also induces a corresponding map on
, mapping each polynomial
to its inversion
. From (1) we see that this map also (projectively) preserves the apolar form:
Starting on Oct 2, I will be teaching Math 246A, the first course in the three-quarter graduate complex analysis sequence at the math department here at UCLA. This first course covers much of the same ground as an honours undergraduate complex analysis course, in particular focusing on the basic properties of holomorphic functions such as the Cauchy and residue theorems, the classification of singularities, and the maximum principle, but there will be more of an emphasis on rigour, generalisation and abstraction, and connections with other parts of mathematics. The main text I will be using for this course is Stein-Shakarchi (with Ahlfors as a secondary text), but I will also be using the blog lecture notes I wrote the last time I taught this course in 2016. At this time I do not expect to significantly deviate from my past lecture notes, though I do not know at present how different the pace will be this quarter when the course is taught remotely. As with my 247B course last spring, the lectures will be open to the public, though other coursework components will be restricted to enrolled students.
This set of notes discusses aspects of one of the oldest questions in Fourier analysis, namely the nature of convergence of Fourier series.
If is an absolutely integrable function, its Fourier coefficients
are defined by the formula
What if is not smooth, but merely lies in an
class for some
? The Fourier coefficients
remain well-defined, as do the partial summation operators
. The question of convergence in norm is relatively easy to settle:
Exercise 1
- (i) If
and
, show that
converges in
norm to
. (Hint: first use the boundedness of the Hilbert transform to show that
is bounded in
uniformly in
.)
- (ii) If
or
, show that there exists
such that the sequence
is unbounded in
(so in particular it certainly does not converge in
norm to
. (Hint: first show that
is not bounded in
uniformly in
, then apply the uniform boundedness principle in the contrapositive.)
The question of pointwise almost everywhere convergence turned out to be a significantly harder problem:
Theorem 2 (Pointwise almost everywhere convergence)
Note from Hölder’s inequality that contains
for all
, so Carleson’s theorem covers the
case of Hunt’s theorem. We remark that the precise threshold near
between Kolmogorov-type divergence results and Carleson-Hunt pointwise convergence results, in the category of Orlicz spaces, is still an active area of research; see this paper of Lie for further discussion.
Carleson’s theorem in particular was a surprisingly difficult result, lying just out of reach of classical methods (as we shall see later, the result is much easier if we smooth either the function or the summation method
by a tiny bit). Nowadays we realise that the reason for this is that Carleson’s theorem essentially contains a frequency modulation symmetry in addition to the more familiar translation symmetry and dilation symmetry. This basically rules out the possibility of attacking Carleson’s theorem with tools such as Calderón-Zygmund theory or Littlewood-Paley theory, which respect the latter two symmetries but not the former. Instead, tools from “time-frequency analysis” that essentially respect all three symmetries should be employed. We will illustrate this by giving a relatively short proof of Carleson’s theorem due to Lacey and Thiele. (There are other proofs of Carleson’s theorem, including Carleson’s original proof, its modification by Hunt, and a later time-frequency proof by Fefferman; see Remark 18 below.)


Recent Comments