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.)
— 1. Equivalent forms of almost everywhere convergence of Fourier series —
A standard technique to prove almost everywhere convergence results is by first establishing a weak-type estimate of an associated maximal function. For instance, the Lebesgue differentiation theorem is usually established with the assistance of the Hardy-Littlewood maximal inequality; see for instance this previous blog post. A remarkable observation of Stein, known as Stein’s maximal principle, allows one to reverse this implication in certain cases by exploiting a symmetry of the problem. Here is the principle specialised to the application of pointwise convergence of Fourier series, and also combined with a transference principle of Kenig and Tomas:
Proposition 3 (Equivalent forms of almost everywhere convergence) Let. Then the following statements are equivalent:
- (i) For every
, one has
for almost every
.
- (ii) There does not exist
such that
for almost every
.
- (iii) One has the maximal inequality
for all smooth
, where the weak
norm is defined as
and
denotes the Lebesgue measure of a set
(which in this setting is a subset of the unit circle).
- (iv) One has the maximal inequality
for all smooth
, where
denotes the partial Fourier series
- (v) One has the maximal inequality
for all
, where
denotes the Fourier multiplier operator
Among other things, this proposition equates the qualitative property (i) of almost everywhere convergence to the quantitative property (iii) of a maximal inequality. This equivalence (first observed by Calderón) is similar in spirit to the uniform boundedness principle (see e.g. Corollary 1 of this previous blog post). The restriction is needed for just one implication (from (ii) to (iii)) in the arguments below, and arises due to the use of Khintchine’s inequality at one point. The equivalence of (iv) and (v) is part of a more general principle of transference that allows one to pass back and forth between periodic domains such as
with non-periodic domains such as
(or, on the Fourier side, between discrete domains
and continuous domains
) if the estimates in question enjoy suitable scaling symmetries. We will use the formulation (v), as it enjoys the most symmetries.
Proof: We first show that (iii) implies (i). If (1) holds for all smooth , then certainly for all finite
one has
Clearly (i) implies (ii). Now we assume that (iii) fails and use this to show that (ii) fails as well. From the failure of (iii) and monotone convergence, for any one can find
, a measurable subset
of
, a finite
, and
such that
Now consider the randomised linear combination
Now we study the behaviour of when
. Since
is a convolution operator, it commutes with translations, and hence
Applying this fact iteratively (each time choosing to be sufficiently large depending on all previous choices), we can construct a sequence of smooth functions
, finite
, and sets
for
such that
- (a)
for all
.
- (b)
for all
.
- (c) One has
for alland
(note that the right-hand side is finite since the
are smooth for
).
- (d)
for all
(note that the left-hand side is bounded by
).
Now we assume (iv) and work to establish (v). The idea here is to use a rescaling argument, viewing as the limit as
of the large circle
(in physical space) or the fine lattice
(in frequency space).
By limiting arguments we may assume that is compactly supported on some interval
. Let
be a large scaling parameter, and consider the periodic function
defined by
Finally, we assume (v) and establish (iv). By a limiting argument it suffices to establish (iv) for trigonometric polynomials , that is to say periodic functions whose Fourier coefficients are supported in
for some natural number
. Let
be a non-zero Schwartz function with
supported in
, and for a given scaling parameter
let
denote the Schwartz function
Exercise 4 For, let
denote the Fejér summation operators
- (i) For any
, establish the pointwise bound
where
is the Hardy-Littlewood maximal function
- (ii) Show that for
, one has
for almost all
.
Exercise 5 (Pointwise convergence of Fourier integrals) Letbe such that the conclusion of Theorem 3(v) holds. Show that for any
, one has
for almost all
, where
is defined for Schwartz functions
by the formula
and then extended to
by density.
Exercise 6 Let. Suppose that
is such that one has the restriction estimate
for all Schwartz functions
, where
denotes the surface measure on the sphere
. Conclude that
for all Schwartz functions
. (This observation is due to Bourgain.) In particular, by Marcinkiewicz interpolation,
implies
for all
. (Hint: adapt some parts of the argument used to get from (iii) to (i) in Proposition 3, using rotation invariance as a substitute for translation invariance. (But the translational symmetry of the restriction problem – more precisely, the ability to translate a function
in physical space without changing the absolute value of its Fourier transform – will also be useful.))
We are now ready to establish Kolmogorov’s theorem (Theorem 2(i)); our arguments are loosely based on the original construction of Kolmogorov (though he was not in possession at the time of the Stein maximal principle). In view of the equivalence between (ii) and (v) in Theorem 3, it suffices to show that the maximal operator
To motivate the construction, note from a naive application of the triangle inequality that
We turn to the details. Let be a large natural number, and then select
widely separated frequency scales
Now we estimate for
in the interval
for some natural number
; note the set of all such
has measure
. In this range we will test the maximal operator at the frequency cutoff
:
Remark 7 In 1926, Kolmogorov refined his construction to obtain a functionwhose Fourier sums
diverged everywhere (not just almost everywhere).
Exercise 8 (Rademacher-Menshov theorem)
- (i) Let
be some square-integrable functions on a probability space
, with
a power of two. By performing a suitable Whitney type decomposition (similar to that used in Section 3 of Notes 1), establish the pointwise bound
where for each
,
ranges over dyadic intervals of the form
with
. If furthermore the
are orthogonal to each other, establish the maximal inequality
- (ii) If
is a trigonometric polynomial with at most
non-zero coefficients for some
, use part (i) to establish the bound
- (iii) If
lies in the Sobolev space
for some
, use (ii) to show that
for almost every
.
— 2. Carleson’s theorem —
We now begin the proof of Carleson’s theorem (Theorem 2(ii)), loosely following the arguments of Lacey and Thiele (we briefly comment on other approaches at the end of these notes). In view of Proposition 3, it suffices to establish the weak-type bound
The next step is to dualise the weak norm to linearise the dependence on
even further:
Exercise 9 Let, let
be a
-finite measure space, let
be a measurable function, and let
. Show that the following claims are equivalent (up to changes in the implied constants in the asymptotic notation):
- (i) One has
.
- (ii) For every subset
of
of finite measure, the function
is absolutely integrable on
, and
In view of this exercise, we see that it suffices to obtain the bound
for all Schwartz
A notable feature of the estimate (12) is that it enjoys three different symmetries (or near-symmetries), each of which is “non-compact” in the sense that it is parameterised by a parameter taking values in a non-compact space such as or
:
- (i) (Translation symmetry) For any spatial shift
, both sides of (12) remain unchanged if we replace
by
, the set
by the translate
, and the function
by
.
- (ii) (Dilation symmetry) For any scaling factor
, both sides of (12) become multiplied by the same scaling factor
if we replace
by
,
by the dilate
, and the function
by
.
- (iii) (Modulation symmetry) For any frequency shift
, both sides of (12) remain (almost) unchanged if we replace
by
, do not modify the set
, and replace the function
by
. (Technically the left-hand side changes because of an additional factor of
, but this factor can be handled for instance by generalising the indicator function cutoff
to a subindicator function cutoff
that has the pointwise bound
; we will ignore this very minor issue here.)
Each of these symmetries corresponds to a different symmetry of phase space , namely spatial translation
, dilation
, and frequency translation
respectively. As a general rule of thumb, if one wants to prove a delicate estimate such as (12) that is invariant with respect to one or more non-compact symmetries, then one should use tools that are similarly invariant (or approximately invariant) with respect to these symmetries. Thus for instance Littlewood-Paley theory or Calderón-Zygmund theory would not be suitable tools to use here, as they are only invariant with respect to translation and dilation symmetry but absolutely fail to have any modulation symmetry properties (these theories prescribe a privileged role to the frequency origin, or equivalently they isolate functions of mean zero as playing a particularly important role).
Besides the need to respect the symmetries of the problem, one of the main difficulties in establishing (12) is that the expression , couples together the function
with the function
in a rather complicated way (via the frequency variable
). We would like to try to decouple this interaction by making
and
instead interact with simpler objects (such as “wave packets”), rather than being coupled directly to each other. To motivate the decomposition to use, we begin with a heuristic discussion. The first main idea is to temporarily work in the (non-invertible) coordinate system
of phase space rather than
in order to simplify the constraint
to the simple geometric region of a half-plane (this coordinate system is of course a terrible choice for most of the other parts of the argument, but is the right system to use for the frequency decompositions we will now employ). In analogy to the Whitney type decompositions used in Notes 1, one can split
We now make the above heuristic decomposition rigorous. For any dyadic interval , let
denote the left child interval, and
the right child interval. We fix a bump function
supported on
normalised to have
norm
; henceforth we permit all implied constants in the asymptotic notation to depend on
. For each interval
let
denote the rescaled function
Hence if we average over all in (say)
, we conclude that
It remains to prove (15). As in the heuristic discussion, we approximately decompose the convolution into a sum over tiles. We have
It remains to establish (17). It is convenient to introduce the sets
One advantage of this “model” formulation of the problem is that one can naturally build up to the full problem by trying to establish estimates of the form
where
The key problem here is that tiles have three degrees of freedom: scale, spatial location, and frequency location, corresponding to the three symmetries of dilation, spatial translation, and frequency modulation of the original estimate (12). But one can warm up by looking at families of tiles that only exhibit two or fewer degrees of freedom, in a way that slowly builds up the various techniques we will need to apply to establish the general case:
The case of a single tile We begin with the simplest case of a single tile (so that there are zero degrees of freedom):
On the one hand,
The case of separated tiles of fixed scale Now we let be a collection of tiles all of a fixed spatial scale
(so that
(so that we have the two parameters of spatial and frequency location, but not the scale parameter). Among other things, this makes the tiles
in
essentially disjoint (i.e., disjoint ignoring sets of measure zero). This disjointness manifests itself in two useful ways. Firstly, we claim that we can improve the trivial bound
Now let us see why (24) is true. To motivate the argument, suppose that had no tail outside of
, so that one could replace
to
in (22). Then would have
Now we prove (25). The intuition here is that the essential disjointness of the tiles make the
approximately orthogonal, so that (25) should be a variant of Bessel’s inequality. We exploit this approximate orthogonality by a
method, which we perform here explicitly. By duality we have
The case of a regular -tree
Now we attack some cases where the tiles can vary in scale. In phase space, a key geometric difficulty now arises from the fact that tiles may start partially overlapping each other, in contrast to the previous case in which the essential disjointness of the tile set was crucial in establishing the key estimates (24), (25). However, because we took care to restrict the intervals
of the tiles to be dyadic, there are only a limited number of ways in which two tiles can overlap. Given two rectangles
and
, we define the relation
if
and
; this is clearly a partial order on rectangles. The key observation is as follows: if two tiles
overlap, then either
or
. Similarly if
are replaced by their upper tiles
or by their lower tiles
. Note that if
are tiles with
, then one of
or
holds (and the only way both inequalities can hold simultaneously is if
).
As was first observed by Fefferman, a key configuration of tiles that needs to be understood for these sorts of problems is that of a tree.
Definition 10 Letbe a tile. A tree with top
is a collection
of tiles
with the property that
for all
. (For minor technical reasons it is convenient to not require the top
to actually lie in the tree
, though this is often the case.) We write
for the spatial support of the tree, and
for the frequency support of the tree top. If we in fact have
for all
, we say that
is a
-tree; similarly if
for all
, we say that
is a
-tree. (Thus every tree can be partitioned into a
-tree and a
-tree with the same top as the original tree.)
The tiles in a tree can vary in scale and in spatial location, but once these two parameters are given, the frequency location is fixed, so a tree can again be viewed as a “two-parameter” subfamily of the three-parameter family of tiles.
We now prove (19) in the case when is a
-tree
, thus
for all
. Here, the
factors will all “collide” with each other and there will be no orthogonality to exploit here; on the other hand, there will be a lot of “disjointness” in the
that can be exploited instead.
To illustrate the key ideas (and to help motivate the arguments for the general case) we will also make the following “regularity” hypotheses: there exists two quantities (which we will refer to as the energy and mass of the tree respectively) for which we have the upper bounds
We also assume that we have the reverse bounds for the tree top:
andWe will use (27), (28), (29) to establish the tree estimate
Note from (30) and Cauchy-Schwarz that
It remains to establish the tree estimate (32). It will be convenient to use the tree to partition the real line
into dyadic intervals
that are naturally “adapted to” the geometry of the tree (or more precisely to the spatial intervals
of the tree) in a certain way (in a manner reminiscent of a Whitney decomposition).
Exercise 11 (Whitney-type decomposition associated to a tree) Letbe a non-empty tree. Show that there exists a family
of dyadic intervals with the following properties:
(Hint: one can choose
- (i) The intervals
in
form a partition of
(up to sets of measure zero).
- (ii) For each
and any
with
, we have
.
- (iii) For each
, there exists
with
and
.
to be the collection of all dyadic intervals
whose dilate
does not contain any
, and which is maximal with respect to set inclusion.)
We can of course assume that the tree is non-empty, since (32) is trivial for empty sets of tiles. We apply the partition from Exercise 11. By the triangle inequality, we can bound the left hand side of (32) by
Now we consider the wide tiles in which . From Exercise 11(ii) this case is only possible if
and
. Thus the
are now restricted to an interval of length
, and it will suffice to establish the local estimate
The case of a regular -tree
We now complement the previous case by establishing (19) for (certain types of) -trees
. The situation is now reversed: there is a lot of “collision” in the
, but on the other hand there is now some “orthogonality” in the
that can be exploited.
As before we will assume some regularity on the -tree
, namely that there exist
for which one has the upper bounds
As before we will focus on establishing the tree estimate (32). From (31) and Cauchy-Schwarz as before we have
Exercise 12 (Almost orthogonality) For any-tree
, show that
for all complex numbers
, and use this to deduce the Bessel-type inequality
From this exercise and (34) we see that
In this case it will be convenient to linearise the sum to remove the absolute value signs; more precisely, to show (32) it suffices to show that
The main difficulty here is the dependence of on
. We rewrite
Exercise 13 Establish the pointwise estimatefor all
where
ranges over all intervals (not necessarily dyadic) containing
.
From (29) and Exercise 11(iii) as before we have
The general case
We are now ready to handle the general case of an arbitrary finite collection of tiles. Motivated by the previous discussion, we define two quantities:
Definition 14 (Energy and mass) For any non-empty finite collectionof tiles, we define the energy
to be the quantity
where
ranges over all
-trees in
, and the mass
to be the quantity
where
is the set
(thus for instance
). By convention, we declare the empty set of tiles to have energy and mass equal to zero.
Note here that the definition of mass has been modified slightly from previous arguments, in that we now use instead of
. However, this turns out to be an acceptable modification, in the sense that we still continue to have the analogue of (32):
Exercise 15 (Tree estimate) Ifis a tree, show that
Since has an
norm of
, we also have the trivial bound
The strategy is now to try to partition an arbitrary family of tiles into collections of disjoint trees
(or “forests”, if you will) whose energy
, mass
, and spatial scale
are all under control, apply Exercise 15 to each tree, and sum. To do this we rely on two key selection results, which are vaguely reminiscent of the Calderón-Zygmund decomposition:
Proposition 16 (Energy selection) Letbe a finite collection of tiles with
for some
. Then one can partition
into a collection
of disjoint trees
with
together with a remainder set
with
Proposition 17 (Mass selection) Letbe a finite collection of tiles with
for some
. Then one can partition
into a collection
of disjoint trees
with
together with a remainder set
with
(In these propositions, “disjoint” means that any given tile belongs to at most one of the trees
in
; but the tiles in one tree are allowed to overlap the tiles in another tree.)
Let us assume these two propositions for now and see how these (together with Exercise 15) establishes the required estimate (19) for an arbitrary collection of tiles. We may assume without loss of generality that
and
are non-zero. Rearranging the above two propositions slightly, we see that if
is a finite collection of tiles such that
It remains to establish the energy and mass selection lemmas. We begin with the mass selection claim, Proposition 17. Let denote the set of all tiles
with
for some
and such that
Unfortunately, the are no longer disjoint. However, by the greedy algorithm (repeatedly choosing maximal tiles (in the tile ordering)), we can find a collection
such that
- (i) All the dilated tree tops
are essentially disjoint.
- (ii) For every
with
, there is
such that
intersects
and
.
From property (i) and (45) we have
Finally, we prove the energy selection claim, Proposition 16. The basic idea is to extract all the high-energy trees from in such a way that the
-tree component of those trees are sufficiently “disjoint” from each other that a useful Bessel inequality, generalising Exercise 12, may be deployed. Implementing this strategy correctly turns out however to be slightly delicate. We perform the following iterative algorithm to generate a partition
- Step 1. Initialise
and
.
- Step 2. If
then STOP. Otherwise, go on to Step 3.
- Step 3. Since we now have
,
contains a
-tree
for which
Among all such, choose one for which the midpoint
of the frequency is minimal. (The reason for this rather strange choice will be made clearer shortly.)
- Step 4. Add
to
, add the larger tree
(with the same top
as
) to
, then remove
from
. We also remove the adjacent trees
and
from
and also place them into
. Now return to Step 2.
This procedure terminates in finite time to give a partition (46) with , and with the trees
coming in triplets
all associated to a
-tree
in
with the same spatial scale as
, with all the
-trees
disjoint and obeying the estimates
Now we make a crucial observation: not only are the trees in
disjoint (in the sense that no tile
belongs to two of these trees), but the lower tiles
are also essentially disjoint. Indeed we claim an even stronger disjointness property: if
,
are such that
, then
is not only disjoint from the larger dyadic interval
, but is in fact disjoint from the even larger interval
. To see this, suppose for contradiction that
and
. There are three possibilities to rule out:
-
is equal to
. This can be ruled out because any two lower frequency intervals
associated to a
-tree are either equal or disjoint.
-
was selected after
was. To rule this out, observe that
contains the parent
of
, and hence
,
, or
. Thus, when
was selected,
should have been placed with one of the three trees
associated to
and would therefore not have been available for inclusion into
, a contradiction.
-
was selected before
was. If this case held, then the midpoint of
would have to be greater than or equal to that of
, otherwise
would not have a minimal midpoint at the time of its selection. But
is contained in
, which is contained in
, which lies below
, which contains
, which contains the midpoint of
; thus the midpoint of
lies strictly below that of
, a contradiction.
If the were perfectly orthogonal to each other, this disjointness would be more than enough to establish (49). Unfortunately we only have imperfect orthogonality, and we have to work a little harder. As usual, we turn to a
type argument. We can write the left-hand side of (49) as
First let us consider the contribution of . Using Young’s inequality
and symmetry, we may bound this contribution by
Now we deal with the case when , which by the preceding discussion implies that
and
lies outside of
. Here we use (37) to bound
and then we can bound this contribution by
Remark 18 The Lacey-Thiele proof of Carleson’s theorem given above relies on a decomposition of a tileset in a way that controls both energy and mass. The original proof of Carleson dispenses with mass (or with the function), and focuses on controlling maximal operators that (in our notation) are basically of the form
To control such functions, one iterates a decomposition similar to Proposition 16 to partition
into trees with good energy control, and establishes pointwise control of the contribution of each tree outside of an exceptional set. See Section 4 of this article of Demeter for an exposition in the simplified setting of Walsh-Fourier analysis. The proof of Fefferman takes the opposite tack, dispensing with energy and focusing on bounding the operator norm of the linearised operator
Roughly speaking, the strategy is to iterate a version of Proposition 16 for partition
into “forests” of disjoint trees, though in Fefferman’s argument some additional work is invested into obtaining even better disjointness properties on these forests than is given here. See Section 5 of this article of Demeter for an exposition in the simplified setting of Walsh-Fourier analysis.
A modification of the above arguments used to establish the weak estimate can also establish restricted weak-type
estimates for any
:
Exercise 19 For any setsof finite measure, and any measurable function
, show that
for any
. (Hint: repeat the previous analysis with
, but supplement it with an additional energy bound
coming from a suitably localised version of Exercise 12.)
The bound (51) is also true for , yielding Hunt’s theorem, but this requires some additional arguments of Calderón-Zygmund type, involving the removal of an exceptional set
defined using the Hardy-Littlewood maximal function:
Exercise 20 (Hunt’s theorem) Letbe of finite non-zero measure, and let
be a measurable function. Let
be the exceptional set
for a large absolute constant
; note from the Hardy-Littlewood inequality that
if
is large enough.
- (i) If
be a finite collection of tiles with
for all
, show that
(Hint: By using (22) and the disjointness of the
when
is fixed, first establish the estimate
whenever
is a natural number and
is an interval with
and
.)
- (ii) If
be a finite collection of tiles with
for all
, show that
. (For a given tree
, one can introduce the dyadic intervals
as in Exercise 11, then perform a Calderón-Zygmund type decomposition to
, splitting it into a “good” function bounded pointwise by
, plus “bad functions” that are supported on the intervals
and have mean zero. See this paper of Grafakos, Terwilleger, and myself for details.)
- (iii) For any finite collection of tiles for all
![]()
- (iv) Show that (51) holds for all
, and conclude Theorem 2(iii).
Remark 21 The methods of time-frequency analysis given here can handle several other operators that, like the Carleson operator, exhibit scaling, translation, and frequency modulation symmetries. One model example is the bilinear Hilbert transformfor
. The methods in this set of notes were used by Lacey and Thiele to establish the estimates
for
with
(these estimates have since been strengthened and extended in a number of ways). We only give the briefest of sketches here. Much as how Carleson’s theorem can be reduced to a bound (19), the above estimates can be reduced to the estimation of a model sum
where
is a certain collection of triples
of tiles
with common spatial interval
and frequency intervals
varying along a certain one-parameter family for each fixed choice of spatial interval. One then uses a variant of Proposition 16 to partition
into “
-trees”, “
-trees”, and “
-trees”, the contribution of each of which can be controlled by the energies of
on such trees, times the length of the spatial support of the tree, in analogy with Exercise 15. See for instance the text of Muscalu and Schlag for more discussion and further results.
Remark 22 The concepts of mass and energy can be abstracted into a framework ofspaces associated to outer measures (as opposed to the classical setup of
spaces associated to countably additive measures), in which the mass and energy selection propositions can be viewed as consequences of an abstract Carleson embedding theorem, and the calculations establishing estimates such as (19) from such propositions and a tree estimate can be viewed as consequences of an “outer Hölder inequality”. See this paper of Do and Thiele for details.
104 comments
Comments feed for this article
3 June, 2020 at 4:50 pm
Alan Chang
It seems like there is currently a glitch with this blog post. Instead of seeing the class notes when I load this page, I see a copy of https://terrytao.wordpress.com/2009/03/07/infinite-fields-finite-fields-and-the-ax-grothendieck-theorem/
[Fixed, thanks – T.]
4 June, 2020 at 1:51 pm
Anonymous
LHS(49) =
?

My attempt:
[There was a misprint in the notes regarding a misplaced conjugation sign, which has now been fixed – T.]
5 June, 2020 at 10:45 am
Anonymous
For the tree estimate, you mentioned that the LHS is like the controlling the maximal Calderon Zygmund operator and maximal Hilbert transform. Could you elaborate on this? It wasn’t clear from the lecture.
[Added more comments to this effect – T.]
23 June, 2020 at 1:43 am
Xumin
Dear Prof. Tao, thank you for your nice notes on a.e. convergence of Fourier series. Recently, when my collaborators and I work on the almost uniform convergence (the noncommutative analogue of a.e. convergence) of noncommutative Fourier series, we are surprised to find some new results on the classical a.e. convergence of Fourier series.
We know that the symbols
associated to Fejér Fourier multipliers
on
are given by
where
. If we generalize this formula by setting
where
and
is an arbitrary convex body in
, then this kind of Fourier multipliers may give a kind of generalized Fejér Fourier series for functions in
. We find that the Fourier series
a.e. convergence to
as
for any
with
. Moreover, we find that for any sequence of positive (sending positive functions to positive functions) Fourier multipliers
on
with
pointwisely, we can always find a subsequence
such that
a.e. convergence to
for any
with
.
I would like to ask you if the above result is a new result or some mathematicians have already found some similar results before? Is such a result on a.e. convergence of Fourier series makes some new senses or not?
Thank you very much!
23 June, 2020 at 12:31 pm
Terence Tao
When
is smooth with nonvanishing curvature everywhere then the convolution kernel of these multipliers decays like
and one can use standard convergence theorems for approximate identities (E.g. Stein-Weiss page 13). For more general convex bodies the decay is more anisotropic but there are still integrated bounds on these kernels (e.g., https://mathscinet.ams.org/mathscinet-getitem?mr=328471 ) which may give results of this form. The multipliers are also very similar to Bochner-Riesz means adapted to convex bodies, for which there is a certain amount of literature, e.g., https://mathscinet.ams.org/mathscinet-getitem?mr=1827499 .
14 July, 2020 at 8:41 pm
Big Ideas in Applied Math: Smoothness and Degree of Approximation – Ethan Epperly
[…] sense, meaning that , where is the truncated Fourier series and is norm .2One may show with considerable analysis that Fourier series converges in others senses, for example almost everywhere convergence. We also […]
24 July, 2020 at 11:43 pm
tophythetoaster
A one line solution to the blue-eyed islanders puzzle:
Noam Chomsky and Terence Tao walk into a bar.
-A. JK
3 August, 2020 at 8:05 pm
Pointwise ergodic theorems for non-conventional bilinear polynomial averages | What's new
[…] on individual scales , and one can leverage this with a Rademacher-Menshov type argument (see e.g., this blog post) and some closer analysis of the bilinear Fourier symbol of to eventually handle all […]