In my previous post, I briefly discussed the work of the four Fields medalists of 2010 (Lindenstrauss, Ngo, Smirnov, and Villani). In this post I will discuss the work of Dan Spielman (winner of the Nevanlinna prize), Yves Meyer (winner of the Gauss prize), and Louis Nirenberg (winner of the Chern medal). Again by chance, the work of all three of the recipients overlaps to some extent with my own areas of expertise, so I will be able to discuss a sample contribution for each of them. Again, my choice of contribution is somewhat idiosyncratic and is not intended to represent the “best” work of each of the awardees.
— 1. Dan Spielman —
Dan Spielman works in numerical analysis (and in particular, numerical linear algebra) and theoretical computer science. Here I want to talk about one of his key contributions, namely his pioneering work with Teng on smoothed analysis. This is about an idea as much as it is about a collection of rigorous results, though Spielman and Teng certainly did buttress their ideas with serious new theorems.
Prior to this work, there were two basic ways that one analysed the performance (which could mean run-time, accuracy, or some other desirable quality) of a given algorithm. Firstly, one could perform a worst-case analysis, in which one assumed that the input was chosen in such an “adversarial” fashion that the performance was as poor as possible. Such an analysis would be suitable for applications such as certain aspects of cryptography, in which the input really was chosen by an adversary, or in high-stakes situations in which there was zero tolerance for any error whatsoever; it is also useful as a “default” analysis for when no realistic input model is available.
At the other extreme, one could perform an average-case analysis, in which the input was chosen in a completely random fashion (e.g. a random string of zeroes and ones, or a random vector whose entries were all distributed according to a Gaussian distribution). While such input models were usually not too realistic (except in situations where the signal-to-noise ratio was very low), they were usually fairly simple to analyse (using tools such as concentration of measure).
In many situations, the worst-case analysis is too conservative, and the average-case analysis is too optimistic or unrealistic. For instance, when using the popular simplex method to solve linear programming problems, the worst-case run-time can be exponentially large in the size of the problem, whereas the average-case run-time (in which one is fed a randomly chosen linear program as input) is polynomial. However, the typical linear program that one encounters in practice has enough structure to it that it does not resemble a randomly chosen program at all, and so it is not clear that the average-case bound is appropriate for the type of inputs one has in practice. At the other extreme, the exponentially bad worst-case inputs were so rare that they never seemed to come up in practice either.
To obtain a better input model, Spielman and Teng considered a smoothed-case model, in which the input was the sum of a deterministic (and possibly worst-case) input, and a small noise perturbation, which they took to be Gaussian to simplify their analysis. This reflected the presence of measurement error, roundoff error, and similar sources of noise in real-life applications of numerical algorithms. Remarkably, they were able to analyse the run-time of the simplex method for this model, concluding (after a lengthy technical argument) that under reasonable choices of parameters, the run time was polynomial time in the length, thus explaining the empirically observed phenomenon that the simplex method tended to run a lot better in practice than its worst-case analysis would predict, even if one started with extremely ill-conditioned inputs, provided that there was a bit of noise in the system.
One of the ingredients in their analysis was a quantitative bound on the condition number of an arbitrary matrix when it is perturbed by a random gaussian perturbation; the point being that random perturbation can often make an ill-conditioned matrix better behaved. (This is perhaps analogous in some ways to the empirical experience that some pieces of machinery work better after being kicked.) Recently, new tools from additive combinatorics (in particular, inverse Littlewood-Offord theory) have enabled Rudelson-Vershynin, Vu and myself, and others to generalise this bound to other noise models, such as random Bernoulli perturbations, which are a simple model for modeling digital roundoff error.
— 2. Yves Meyer —
Yves Meyer has worked in many fields over the years, from number theory to harmonic analysis to PDE to signal processing. As the Gauss prize is concerned with impact on fields outside of mathematics, Meyer’s major contributions to the theoretical foundations of wavelets, which are now a basic tool in signal processing, were undoubtedly a major consideration in awarding this prize. But I would like to focus here on another of Yves’ contributions, namely the Coifman-Meyer theory of paraproducts developed with Raphy Coifman, which is a cornerstone of the para-differential calculus that has turned out to be an indispensable tool in the modern theory of nonlinear PDE.
Nonlinear differential equations, by definition, tend to involve a combination of differential operators and nonlinear operators. The simplest example of the latter is a pointwise product of two fields and . One is thus often led to study expressions such as or for various differential operators .
For first order operators , we can handle derivatives using the product rule (or Leibniz rule) from freshman calculus:
We can then iterate this to handle higher order derivatives. For instance, we have
and so forth, assuming of course that all functions involved are sufficiently regular so that all expressions make sense. For inverse derivative expressions such as , no such simple formula exists, although one does have the very important integration by parts formula as a substitute. And for fractional derivatives such as with a non-integer, there is also no closed formula of the above form.
Note how the derivatives on the product get distributed to the individual factors , with absorbing all the derivatives in one term, absorbing all the derivatives in another, and the derivatives being shared between and in other terms. Within the usual confines of differential calculus; we cannot pick and choose which of the terms we like to keep, and which ones to discard; we must treat every single one of the terms that arise from the Leibniz expansion. This can cause difficulty when trying to control the product of two functions of unequal regularity – a situation that occurs very frequently in nonlinear PDE. For instance, if is (once continuously differentiable), and is (three times continuously differentiable), then the product is merely rather than ; intuitively, we cannot “prevent” the three derivatives in the expression from making their way to the factor, which is not prepared to absorb all of them. However, it turns out that if we split the product into paraproducts such as the high-low paraproduct and the low-high paraproduct, we can effectively separate these terms from each other, allowing for a much more flexible analysis of the situation.
The concept of a paraproduct can be motivated by using the Fourier transform. For simplicity let us work in one dimension, with being the usual differential operator . Using a Fourier expansion (and assuming as much regularity and integrability as is needed to justify the formal manipulations) of into components of different frequencies, we have
(here we use the usual PDE normalisation in which we try to hide the factor) and similarly
and thus, by differentiating under the integral sign
In contrast, we have
thus, the iterated Leibnitz rule just becomes the binomial formula
after taking Fourier transforms.
Now, it is certainly true that when dealing with an expression such as , all three terms need to be present. But observe that when dealing with a “high-low” frequency interaction, in which is much larger in magnitude than , then the first term dominates: . Conversely, with a “low-high” frequency interaction, in which is much larger in magnitude than , we have . (There are also “high-high” interactions, in which and are comparable in magnitude, and can be significantly smaller than either or , but for simplicity of discussion let us ignore this case.) It then becomes natural to try to decompose the product into “high-low” and “low-high” pieces (plus a “high-high” error), for instance by inserting suitable cutoff functions or in (1) to the regions or to create the paraproducts
Such paraproducts were first introduced by Calderón, and more explicitly by Bony. Heuristically, is the “high-low” portion of the product , in which the high frequency components of are “allowed” to interact with the low frequency components of , but no other frequency interactions are permitted, and similarly for . The para-differential calculus of Bony, Coifman, and Meyer then allows one to manipulate these paraproducts in ways that are very similar to ordinary pointwise products, except that they behave better with respect to the Leibniz rule or with more exotic differential or integral operators. For instance, one has
for differential operators (and more generally for pseudodifferential operators such as , or integral operators such as ), where we use the symbol loosely to denote “up to lower order terms”. Furthermore, many of the basic estimates of the pointwise product, in particular Hölder’s inequality, have analogues for paraproducts; this is a special case of what is now known as the Coifman-Meyer theorem, which is fundamental in this subject, and is proven using Littlewood-Paley theory. The same theory in fact gives some estimates for paraproducts beyond what are available for products. For instance, if is in and is in , then the paraproduct is “almost” in (modulo some technical logarithmic divergences which I will not elaborate on here), in contrast to the full product which is merely in .
Paraproducts also allow one to extend the classical product and chain rules to fractional derivative operators, leading to the fractional Leibniz rule
and fractional chain rule
— 3. Louis Nirenberg —
Louis Nirenberg has made an amazing number of contributions to analysis, PDE, and geometry (e.g. John-Nirenberg inequality, Nirenberg-Treves conjecture (recently solved by Dencker), Newlander-Nirenberg theorem, Gagliardo-Nirenberg inequality, Caffarelli-Kohn-Nirenberg theorem, etc.), while also being one of the nicest people I know. I will mention only two results of his here, one of them very briefly.
Among other things, Nirenberg and Kohn introduced the pseudo-differential calculus which, like the para-differential calculus mentioned in the previous section, is an extension of differential calculus, but this time focused more on generalisation to variable coefficient or fractional operators, rather than in generalising the Leibniz or chain rules. This calculus sits at the intersection of harmonic analysis, PDE, von Neumann algebras, microlocal analysis, and semiclassical physics, and also happens to be closely related to Meyer’s work on wavelets; it quantifies the positive aspects of the Heisenberg uncertainty principle, in that one can observe position and momentum simultaneously so long as the uncertainty relation is respected. But I will not discuss this topic further today.
Instead, I would like to focus here instead on a gem of an argument of Gidas, Ni, and Nirenberg, which is a brilliant application of Alexandrov’s method of moving planes, combined with the ubiquitous maximum principle. This concerns solutions to the ground state equation
where is a smooth positive function that decays exponentially at infinity, is an exponent, and is the Laplacian. This equation shows up in a number of contexts, including the nonlinear Schrödinger equation and also, by coincidence, in connection with the best constants in the Gagliardo-Nirenberg inequality. The existence of ground states can be proven by the variational principle. But one can say much more:
Lemma 1 (Gidas-Ni-Nirenberg) All ground states are radially symmetric with respect to some origin.
To show this radial symmetry, a small amount of Euclidean geometry shows that it is enough to show that there is a lot of reflection symmetry:
Lemma 2 (Gidas-Ni-Nirenberg, again) If is a ground state and is a unit vector, then there exists a hyperplane orthogonal to with respect to which is symmetric.
To prove this lemma, we use the moving planes method, sliding in a plane orthogonal to from infinity. More precisely, for each , let be the hyperplane , let be the associated half-space , and let be the function , where
is the reflection through ; thus is the difference between and its reflection in . In particular, vanishes on the boundary of the half-space .
Intuitively, the argument proceeds as follows. It is plausible that is going to be positive in the interior of for large positive , but negative in the interior of for large negative . Now imagine sliding down from to until one reaches the first point where ceases to be positive in the interior of , then it attains its minimum at some zero in the interior of . But by playing around with (2) (using the Lipschitz nature of the map when is bounded) we know that obeys an elliptic constraint of the form . Applying the maximum principle, we can then conclude that vanishes identically in , which gives the desired reflectoin symmetry.
(Now it turns out that there are some technical issues in making the above sketch precise, mainly because of the non-compact nature of the half-space , but these can be fixed with a little bit of fiddling; see for instance Appendix B of my PDE textbook.)