You are currently browsing the category archive for the ‘math.AP’ category.
This post was inspired by some recent discussions with Bjoern Bringmann.
Symbolic math software packages are highly developed for many mathematical tasks in areas such as algebra, calculus, and numerical analysis. However, to my knowledge we do not have similarly sophisticated tools for verifying asymptotic estimates – inequalities that are supposed to hold for arbitrarily large parameters, with constant losses. Particularly important are functional estimates, where the parameters involve an unknown function or sequence (living in some suitable function space, such as an space); but for this discussion I will focus on the simpler situation of asymptotic estimates involving a finite number of positive real numbers, combined using arithmetic operations such as addition, multiplication, division, exponentiation, and minimum and maximum (but no subtraction). A typical inequality here might be the weak arithmetic mean-geometric mean inequality
where are arbitrary positive real numbers, and the
here indicates that we are willing to lose an unspecified (multiplicative) constant in the estimates.
I have wished in the past (e.g., in this MathOverflow answer) for a tool that could automatically determine whether such an estimate was true or not (and provide a proof if true, or an asymptotic counterexample if false). In principle, simple inequalities of this form could be automatically resolved by brute force case splitting. For instance, with (1), one first observes that is comparable to
up to constants, so it suffices to determine if
Next, to resolve the maximum, one can divide into three cases: ;
; and
. Suppose for instance that
. Then the estimate to prove simplifies to
and this is (after taking logarithms) a positive linear combination of the hypotheses ,
. The task of determining such a linear combination is a standard linear programming task, for which many computer software packages exist.
Any single such inequality is not too difficult to resolve by hand, but there are applications in which one needs to check a large number of such inequalities, or split into a large number of cases. I will take an example at random from an old paper of mine (adapted from the equation after (51), and ignoring some epsilon terms for simplicity): I wanted to establish the estimate
for any obeying the constraints
where ,
, and
are the maximum, median, and minimum of
respectively, and similarly for
,
, and
, and
. This particular bound could be dispatched in three or four lines from some simpler inequalities; but it took some time to come up with those inequalities, and I had to do a dozen further inequalities of this type. This is a task that seems extremely ripe for automation, particularly with modern technology.
Recently, I have been doing a lot more coding (in Python, mostly) than in the past, aided by the remarkable facility of large language models to generate initial code samples for many different tasks, or to autocomplete partially written code. For the most part, I have restricted myself to fairly simple coding tasks, such as computing and then plotting some mildly complicated mathematical functions, or doing some rudimentary data analysis on some dataset. But I decided to give myself the more challenging task of coding a verifier that could handle inequalities of the above form. After about four hours of coding, with frequent assistance from an LLM, I was able to produce a proof of concept tool for this, which can be found at this Github repository. For instance, to verify (1), the relevant Python code is
a = Variable("a")
b = Variable("b")
c = Variable("c")
assumptions = Assumptions()
assumptions.can_bound((a * b * c) ** (1 / 3), max(a, b, c))
and the (somewhat verbose) output verifying the inequality is
Checking if we can bound (((a * b) * c) ** 0.3333333333333333) by max(a, b, c) from the given axioms.
We will split into the following cases:
[[b <~ a, c <~ a], [a <~ b, c <~ b], [a <~ c, b <~ c]]
Trying case: ([b <~ a, c <~ a],)
Simplify to proving (((a ** 0.6666666666666667) * (b ** -0.3333333333333333)) * (c ** -0.3333333333333333)) >= 1.
Bound was proven true by multiplying the following hypotheses :
b <~ a raised to power 0.33333333
c <~ a raised to power 0.33333333
Trying case: ([a <~ b, c <~ b],)
Simplify to proving (((b ** 0.6666666666666667) * (a ** -0.3333333333333333)) * (c ** -0.3333333333333333)) >= 1.
Bound was proven true by multiplying the following hypotheses :
a <~ b raised to power 0.33333333
c <~ b raised to power 0.33333333
Trying case: ([a <~ c, b <~ c],)
Simplify to proving (((c ** 0.6666666666666667) * (a ** -0.3333333
333333333)) * (b ** -0.3333333333333333)) >= 1.
Bound was proven true by multiplying the following hypotheses :
a <~ c raised to power 0.33333333
b <~ c raised to power 0.33333333
Bound was proven true in all cases!
This is of course an extremely inelegant proof, but elegance is not the point here; rather, that it is automated. (See also this recent article of Heather Macbeth for how proof writing styles change in the presence of automated tools, such as formal proof assistants.)
The code is close to also being able to handle more complicated estimates such as (3); right now I have not written code to properly handle hypotheses such as that involve complex expressions such as
, as opposed to hypotheses that only involve atomic variables such as
,
, but I can at least handle such complex expressions in the left and right-hand sides of the estimate I am trying to verify.
In any event, the code, being a mixture of LLM-generated code and my own rudimentary Python skills, is hardly an exemplar of efficient or elegant coding, and I am sure that there are many expert programmers who could do a much better job. But I think this is proof of concept that a more sophisticated tool of this form could be quite readily created to do more advanced tasks. One such example task was the one I gave in the above MathOverflow question, namely being able to automatically verify a claim such as
for all . Another task would be to automatically verify the ability to estimate some multilinear expression of various functions, in terms of norms of such functions in standard spaces such as Sobolev spaces; this is a task that is particularly prevalent in PDE and harmonic analysis (and can frankly get somewhat tedious to do by hand). As speculated in that MO post, one could eventually hope to also utilize AI to assist in the verification process, for instance by suggesting possible splittings of the various sums or integrals involved, but that would be a long-term objective.
This sort of software development would likely best be performed as a collaborative project, involving both mathematicians and expert programmers. I would be interested to receive advice on how best to proceed with such a project (for instance, would it make sense to incorporate such a tool into an existing platform such as SageMATH), and what features for a general estimate verifier would be most desirable for mathematicians. One thing on my wishlist is the ability to give a tool an expression to estimate (such as a multilinear integral of some unknown functions), as well as a fixed set of tools to bound that integral (e.g., splitting the integral into pieces, integrating by parts, using the Hölder and Sobolev inequalities, etc.), and have the computer do its best to optimize the bound it can produce with those tools (complete with some independently verifiable proof certificate for its output). One could also imagine such tools having the option to output their proof certificates in a formal proof assistant language such as Lean. But perhaps there are other useful features that readers may wish to propose.
I recently returned from the 2025 Annual Meeting of the “Localization of Waves” collaboration (supported by the Simons Foundation, with additional related support from the NSF), where I learned (from Svitlana Mayboroda, the director of the collaboration as well as one of the principal investigators) of a remarkable statistic: net electricity consumption by residential customers in the US has actually experienced a slight decrease in recent years:

The decrease is almost entirely due to gains in lighting efficiency in households, and particularly the transition from incandescent (and compact fluorescent) light bulbs to LED light bulbs:


Annual energy savings from this switch to consumers in the US were already estimated to be $14.7 billion in 2020 – or several hundred dollars per household – and are projected to increase, even in the current inflationary era, with the cumulative savings across the US estimated to reach $890 billion by 2035.
What I also did not realize before this meeting is the role that recent advances in pure mathematics – and specifically, the development of the “landscape function” that was a primary focus of this collaboration – played in accelerating this transition. This is not to say that this piece of mathematics was solely responsible for these developments; but, as I hope to explain here, it was certainly part of the research and development ecosystem in both academia and industry, spanning multiple STEM disciplines and supported by both private and public funding. This application of the landscape function was already reported upon by Quanta magazine at the very start of this collaboration back in 2017; but it is only in the last few years that the mathematical theory has been incorporated into the latest LED designs and led to actual savings at the consumer end.
LED lights are made from layers of semiconductor material (e.g., Gallium nitride or Indium gallium nitride) arranged in a particular fashion. When enough of a voltage difference is applied to this material, electrons are injected into the “n-type” side of the LED, while holes of electrons are injected into the “p-type” side, creating a current. In the active layer of the LED, these electrons and holes recombine in the quantum wells of the layer, generating radiation (light) via the mechanism of electroluminescence. The brightness of the LED is determined by the current, while the power consumption is the product of the current and the voltage. Thus, to improve energy efficiency, one seeks to design LEDs to require as little voltage as possible to generate a target amount of current.
As it turns out, the efficiency of an LED, as well as the spectral frequencies of light they generate, depend in many subtle ways on the precise geometry of the chemical composition of the semiconductors, the thickness of the layers, the geometry of how the layers are placed atop one another, the temperature of the materials, and the amount of disorder (impurities) introduced into each layer. In particular, in order to create quantum wells that can efficiently trap the electrons and holes together to recombine to create light of a desired frequency, it is useful to introduce a certain amount of disorder into the layers in order to take advantage of the phenomenon of Anderson localization. However, one cannot add too much disorder, lest the electron states become fully bound and the material behaves too much like an insulator to generate appreciable current.
One can of course make empirical experiments to measure the performance of various proposed LED designs by fabricating them and then testing them in a laboratory. But this is an expensive and painstaking process that does not scale well; one cannot test thousands of candidate designs this way to isolate the best performing ones. So, it becomes desirable to perform numerical simulations of these designs instead, which – if they are sufficiently accurate and computationally efficient – can lead to a much shorter and cheaper design cycle. (In the near future one may also hope to accelerate the design cycle further by incorporating machine learning and AI methods; but these techniques, while promising, are still not fully developed at the present time.)
So, how can one perform numerical simulation of an LED? By the semiclassical approximation, the wave function of an individual electron should solve the time-independent Schrödinger equation
where is the wave function of the electron at this energy level, and
is the conduction band energy. The behavior of hole wavefunctions follows a similar equation, governed by the valence band energy
instead of
. However, there is a complication: these band energies are not solely coming from the semiconductor, but also contain a contribution
that comes from electrostatic effects from the electrons and holes, and more specifically by solving the Poisson equation
where is the dielectric constant of the semiconductor,
are the carrier densities of electrons and holes respectively,
,
are further densities of ionized acceptor and donor atoms, and
are physical constants. This equation looks somewhat complicated, but is mostly determined by the carrier densities
, which in turn ultimately arise from the probability densities
associated to the eigenfunctions
via the Born rule, combined with the Fermi-Dirac distribution from statistical mechanics; for instance, the electron carrier density
is given by the formula
with a similar formula for . In particular, the net potential
depends on the wave functions
, turning the Schrödinger equation into a nonlinear self-consistent Hartree-type equation. From the wave functions one can also compute the current, determine the amount of recombination between electrons and holes, and therefore also calculate the light intensity and absorption rates. But the main difficulty is to solve for the wave functions
for the different energy levels of the electron (as well as the counterpart for holes).
One could attempt to solve this nonlinear system iteratively, by first proposing an initial candidate for the wave functions , using this to obtain a first approximation for the conduction band energy
and valence band energy
, and then solving the Schrödinger equations to obtain a new approximation for
, and repeating this process until it converges. However, the regularity of the potentials
plays an important role in being able to solve the Schrödinger equation. (The Poisson equation, being elliptic, is relatively easy to solve to high accuracy by standard methods, such as finite element methods.) If the potential
is quite smooth and slowly varying, then one expects the wave functions
to be quite delocalizated, and for traditional approximations such as the WKB approximation to be accurate.
However, in the presence of disorder, such approximations are no longer valid. As a consequence, traditional methods for numerically solving these equations had proven to be too inaccurate to be of practical use in simulating the performance of a LED design, so until recently one had to rely primarily on slower and more expensive empirical testing methods. One real-world consequence of this was the “green gap“; while reasonably efficient LED designs were available in the blue and red portions of the spectrum, there was not a suitable design that gave efficient output in the green spectrum. Given that many applications of LED lighting required white light that was balanced across all visible colors of the spectrum, this was a significant impediment to realizing the energy-saving potential of LEDs.

Here is where the landscape function comes in. This function started as a purely mathematical discovery: when solving a Schrödinger equation such as
(where we have now suppressed all physical constants for simplicity), it turns out that the behavior of the eigenfunctions at various energy levels
is controlled to a remarkable extent by the landscape function
, defined to be the solution to the equation
As discussed in this previous blog post (discussing a paper on this topic I wrote with some of the members of this collaboration), one reason for this is that the Schrödinger equation can be transformed after some routine calculations to
thus making an effective potential for the Schrödinger equation (and
also being the coefficients of an effective geometry for the equation). In practice, when
is a disordered potential, the effective potential
tends to be behave like a somewhat “smoothed out” or “homogenized” version of
that exhibits superior numerical performance. For instance, the classical Weyl law predicts (assuming a smooth confining potential
) that the density of states up to energy
– that is to say, the number of bound states up to
– should asymptotically behave like
. This is accurate at very high energies
, but when
is disordered, it tends to break down at low and medium energies. However, the landscape function makes a prediction
for this density of states that is significantly more accurate in practice in these regimes, with a mathematical justification (up to multiplicative constants) of this accuracy obtained in this paper of David, Filoche, and Mayboroda. More refined predictions (again with some degree of theoretical support from mathematical analysis) can be made on the local integrated density of states, and with more work one can then also obtain approximations for the carrier density functions
mentioned previously in terms of the energy band level functions
,
. As the landscape function
is relatively easy to compute (coming from solving a single elliptic equation), this gives a very practical numerical way to carry out the iterative procedure described previously to model LEDs in a way that has proven to be both numerically accurate, and significantly faster than empirical testing, leading to a significantly more rapid design cycle.
In particular, recent advances in LED technology have largely closed the “green gap” by introducing designs that incorporate “-defects”:
-shaped dents in the semiconductor layers of the LED that create lateral carrier injection pathways and modify the internal electric field, enhancing hole transport into the active layer. The ability to accurately simulate the effects of these defects has allowed researchers to largely close this gap:

My understanding is that the major companies involved in developing LED lighting are now incorporating landscape-based methods into their own proprietary simulation models to achieve similar effects in commercially produced LEDs, which should lead to further energy savings in the near future.
Thanks to Svitlana Mayboroda and Marcel Filoche for detailed discussions, comments, and corrections of the material here.
Given a smooth compact Riemannian manifold , the incompressible Euler equations can be written in abstract index notation as
Conjecture 1 (Finite time blowup) There exists a manifoldand a smooth solution
to the Euler equations that blows up at some finite time
.
This remains open, however there has been progress on rougher versions of this problem. For instance, there is the well-known result of Elgindi (discussed in this previous post) that when and
is sufficiently small, there exists a
solution
to the Euler equations on
that blows up in finite time. There has also been progress in establishing various “universality” properties of the Euler flow on manifolds (which informally state that “fluid computers” are possible); see for instance this recent survey of Cardona, Miranda, and Peralta-Salas. Unfortunately, these “fluid computers” do not combine well with scaling symmetries, and so thus far have not been able to produce (finite energy) blowups.
I have been playing with one approach to this conjecture, which reduces to solving a certain underdetermined system of partial differential equations, and then establishing some stability result for the resulting solution. However, I have not been able to make headway on solving this latter system despite its underdetermined nature; so I thought I would record my partial attempt here in case anyone is interested in pursuing it further (and also to contribute to the practice of sharing unsuccessful attempts to solve a problem, which is still quite infrequently done in our community).
To avoid technicalities let us simplify the problem by adding a forcing term :
Theorem 2 (Finite time blowup for the forced equation) There exists a smooth solution to the forced Euler equations onthat exhibits finite time blowup, in which the forcing term
stays uniformly bounded in
for any
.
Roughly speaking, their argument proceeds by a multiscale construction, in which the solution is set up to eventually have some presence at a spatial scale , which is conducive to generating an exponential “stretching” of a small forcing term at a much higher spatial scale
, which one then introduces to then set up the solution for the next scale.
As a model problem, I tried to reproduce this type of result from a more geometric perspective, trying to aim for a more “self-similar” blowup than a “multi-scale” one, in the hope that this latter type of blowup might be more tractable to analyze and eventually resolve Conjecture 1. I didn’t fully succeed; but I think the approach I outline below is in principle feasible.
The manifold I will work on is a cylinder , where
is a smooth compact manifold, and the metric on
is just the sum of the standard metric
on the first coordinate and
:
If we now use Greek indices to only denote coordinates in the “vertical” coordinate , the velocity field
now becomes
, and the Euler equations now split as
It is now tempting to try to set up an approximately scale-invariant blowup solution. It seems that the first step in this is to construct a “soliton” type localized steady state solution, that is a solution ,
to the equation
Analytically, this is not a particularly pleasant equation to try to solve; one can substitute the second equation into the first to obtain a single equation
Nevertheless, one can still attempt to solve this equation by separation of variables. If one makes the ansatz
The metric is hidden in this system through the covariant derivative
. To eliminate the metric, we can lower indices to write
Remark 3 One can also try to directy create a self-similar blowup to (1), (2), for instance by making the ansatz
for
and some fields
and
. This particular ansatz seems consistent with all known conservation laws; however it works out to basically be ten vector equations (plus some additional scalar constraints) on ten vector field unknowns, so is just barely overdetermined. I have not been able to locate a self-similar blowup ansatz that is underdetermined.
Marcel Filoche, Svitlana Mayboroda, and I have just uploaded to the arXiv our preprint “The effective potential of an -matrix“. This paper explores the analogue of the effective potential of Schrödinger operators
provided by the “landscape function”
, when one works with a certain type of self-adjoint matrix known as an
-matrix instead of a Schrödinger operator.
Suppose one has an eigenfunction
When the potential is very “rough”, as occurs for instance in the random potentials arising in the theory of Anderson localisation, the Agmon bounds, while still true, become very weak because the wells
are dispersed in a fairly dense fashion throughout the domain
, and the eigenfunction can tunnel relatively easily between different wells. However, as was first discovered in 2012 by my two coauthors, in these situations one can replace the rough potential
by a smoother effective potential
, with the eigenfunctions typically localised to a single connected component of the effective wells
. In fact, a good choice of effective potential comes from locating the landscape function
, which is the solution to the equation
with reasonable behavior at infinity, and which is non-negative from the maximum principle, and then the reciprocal
of this landscape function serves as an effective potential.
There are now several explanations for why this particular choice is a good effective potential. Perhaps the simplest (as found for instance in this recent paper of Arnold, David, Jerison, and my two coauthors) is the following observation: if
is an eigenvector for
with energy
, then
is an eigenvector for
with the same energy
, thus the original Schrödinger operator
is conjugate to a (variable coefficient, but still in divergence form) Schrödinger operator with potential
instead of
. Closely related to this, we have the integration by parts identity
, thus again highlighting the emergence of the effective potential
.
These particular explanations seem rather specific to the Schrödinger equation (continuous or discrete); we have for instance not been able to find similar identities to explain an effective potential for the bi-Schrödinger operator .
In this paper, we demonstrate the (perhaps surprising) fact that effective potentials continue to exist for operators that bear very little resemblance to Schrödinger operators. Our chosen model is that of an -matrix: self-adjoint positive definite matrices
whose off-diagonal entries are negative. This model includes discrete Schrödinger operators (with non-negative potentials) but can allow for significantly more non-local interactions. The analogue of the landscape function would then be the vector
, where
denotes the vector with all entries
. Our main result, roughly speaking, asserts that an eigenvector
of
will then be exponentially localised to the “potential wells”
, where
denotes the coordinates of the landscape function
. In particular, we establish the inequality
Our approach is based on Agmon’s methods, which we interpret as a double commutator method, and in particular relying on exploiting the negative definiteness of certain double commutator operators. In the case of Schrödinger operators , this negative definiteness is provided by the identity
, where we view
(like
) as a multiplier operator. To exploit this, we use the commutator identity
It turns out that this argument extends without much difficulty to the -matrix setting. The analogue of the crucial double commutator identity (2) is
Numerically we have also found some aspects of the landscape theory to persist beyond the -matrix setting, even though the double commutators cease being negative definite, so this may not yet be the end of the story, but it does at least demonstrate that utility the landscape does not purely rely on identities such as (1).
In contrast to previous notes, in this set of notes we shall focus exclusively on Fourier analysis in the one-dimensional setting for simplicity of notation, although all of the results here have natural extensions to higher dimensions. Depending on the physical context, one can view the physical domain
as representing either space or time; we will mostly think in terms of the former interpretation, even though the standard terminology of “time-frequency analysis”, which we will make more prominent use of in later notes, clearly originates from the latter.
In previous notes we have often performed various localisations in either physical space or Fourier space , for instance in order to take advantage of the uncertainty principle. One can formalise these operations in terms of the functional calculus of two basic operations on Schwartz functions
, the position operator
defined by
and the momentum operator , defined by
(The terminology comes from quantum mechanics, where it is customary to also insert a small constant on the right-hand side of (1) in accordance with de Broglie’s law. Such a normalisation is also used in several branches of mathematics, most notably semiclassical analysis and microlocal analysis, where it becomes profitable to consider the semiclassical limit
, but we will not emphasise this perspective here.) The momentum operator can be viewed as the counterpart to the position operator, but in frequency space instead of physical space, since we have the standard identity
for any and
. We observe that both operators
are formally self-adjoint in the sense that
for all , where we use the
Hermitian inner product
Clearly, for any polynomial of one real variable
(with complex coefficients), the operator
is given by the spatial multiplier operator
and similarly the operator is given by the Fourier multiplier operator
Inspired by this, if is any smooth function that obeys the derivative bounds
for all and
(that is to say, all derivatives of
grow at most polynomially), then we can define the spatial multiplier operator
by the formula
one can easily verify from several applications of the Leibniz rule that maps Schwartz functions to Schwartz functions. We refer to
as the symbol of this spatial multiplier operator. In a similar fashion, we define the Fourier multiplier operator
associated to the symbol
by the formula
For instance, any constant coefficient linear differential operators can be written in this notation as
however there are many Fourier multiplier operators that are not of this form, such as fractional derivative operators for non-integer values of
, which is a Fourier multiplier operator with symbol
. It is also very common to use spatial cutoffs
and Fourier cutoffs
for various bump functions
to localise functions in either space or frequency; we have seen several examples of such cutoffs in action in previous notes (often in the higher dimensional setting
).
We observe that the maps and
are ring homomorphisms, thus for instance
and
for any obeying the derivative bounds (2); also
is formally adjoint to
in the sense that
for , and similarly for
and
. One can interpret these facts as part of the functional calculus of the operators
, which can be interpreted as densely defined self-adjoint operators on
. However, in this set of notes we will not develop the spectral theory necessary in order to fully set out this functional calculus rigorously.
In the field of PDE and ODE, it is also very common to study variable coefficient linear differential operators
where the are now functions of the spatial variable
obeying the derivative bounds (2). A simple example is the quantum harmonic oscillator Hamiltonian
. One can rewrite this operator in our notation as
and so it is natural to interpret this operator as a combination of both the position operator
and the momentum operator
, where the symbol
this operator is the function
Indeed, from the Fourier inversion formula
for any we have
and hence on multiplying by and summing we have
Inspired by this, we can introduce the Kohn-Nirenberg quantisation by defining the operator by the formula
whenever and
is any smooth function obeying the derivative bounds
for all and
(note carefully that the exponent in
on the right-hand side is required to be uniform in
). This quantisation clearly generalises both the spatial multiplier operators
and the Fourier multiplier operators
defined earlier, which correspond to the cases when the symbol
is a function of
only or
only respectively. Thus we have combined the physical space
and the frequency space
into a single domain, known as phase space
. The term “time-frequency analysis” encompasses analysis based on decompositions and other manipulations of phase space, in much the same way that “Fourier analysis” encompasses analysis based on decompositions and other manipulations of frequency space. We remark that the Kohn-Nirenberg quantization is not the only choice of quantization one could use; see Remark 19 below.
In principle, the quantisations are potentially very useful for such tasks as inverting variable coefficient linear operators, or to localize a function simultaneously in physical and Fourier space. However, a fundamental difficulty arises: map from symbols
to operators
is now no longer a ring homomorphism, in particular
in general. Fundamentally, this is due to the fact that pointwise multiplication of symbols is a commutative operation, whereas the composition of operators such as and
does not necessarily commute. This lack of commutativity can be measured by introducing the commutator
of two operators , and noting from the product rule that
(In the language of Lie groups and Lie algebras, this tells us that are (up to complex constants) the standard Lie algebra generators of the Heisenberg group.) From a quantum mechanical perspective, this lack of commutativity is the root cause of the uncertainty principle that prevents one from simultaneously localizing in both position and momentum past a certain point. Here is one basic way of formalising this principle:
Exercise 2 (Heisenberg uncertainty principle) For any
and
, show that
(Hint: evaluate the expression
in two different ways and apply the Cauchy-Schwarz inequality.) Informally, this exercise asserts that the spatial uncertainty
and the frequency uncertainty
of a function obey the Heisenberg uncertainty relation
.
Nevertheless, one still has the correspondence principle, which asserts that in certain regimes (which, with our choice of normalisations, corresponds to the high-frequency regime), quantum mechanics continues to behave like a commutative theory, and one can sometimes proceed as if the operators (and the various operators
constructed from them) commute up to “lower order” errors. This can be formalised using the pseudodifferential calculus, which we give below the fold, in which we restrict the symbol
to certain “symbol classes” of various orders (which then restricts
to be pseudodifferential operators of various orders), and obtains approximate identities such as
where the error between the left and right-hand sides is of “lower order” and can in fact enjoys a useful asymptotic expansion. As a first approximation to this calculus, one can think of functions as having some sort of “phase space portrait”
which somehow combines the physical space representation
with its Fourier representation
, and pseudodifferential operators
behave approximately like “phase space multiplier operators” in this representation in the sense that
Unfortunately the uncertainty principle (or the non-commutativity of and
) prevents us from making these approximations perfectly precise, and it is not always clear how to even define a phase space portrait
of a function
precisely (although there are certain popular candidates for such a portrait, such as the FBI transform (also known as the Gabor transform in signal processing literature), or the Wigner quasiprobability distribution, each of which have some advantages and disadvantages). Nevertheless even if the concept of a phase space portrait is somewhat fuzzy, it is of great conceptual benefit both within mathematics and outside of it. For instance, the musical score one assigns a piece of music can be viewed as a phase space portrait of the sound waves generated by that music.
To complement the pseudodifferential calculus we have the basic Calderón-Vaillancourt theorem, which asserts that pseudodifferential operators of order zero are Calderón-Zygmund operators and thus bounded on for
. The standard proof of this theorem is a classic application of one of the basic techniques in harmonic analysis, namely the exploitation of almost orthogonality; the proof we will give here will achieve this through the elegant device of the Cotlar-Stein lemma.
Pseudodifferential operators (especially when generalised to higher dimensions ) are a fundamental tool in the theory of linear PDE, as well as related fields such as semiclassical analysis, microlocal analysis, and geometric quantisation. There is an even wider class of operators that is also of interest, namely the Fourier integral operators, which roughly speaking not only approximately multiply the phase space portrait
of a function by some multiplier
, but also move the portrait around by a canonical transformation. However, the development of theory of these operators is beyond the scope of these notes; see for instance the texts of Hormander or Eskin.
This set of notes is only the briefest introduction to the theory of pseudodifferential operators. Many texts are available that cover the theory in more detail, for instance this text of Taylor.
Just a brief post to record some notable papers in my fields of interest that appeared on the arXiv recently.
- “A sharp square function estimate for the cone in
“, by Larry Guth, Hong Wang, and Ruixiang Zhang. This paper establishes an optimal (up to epsilon losses) square function estimate for the three-dimensional light cone that was essentially conjectured by Mockenhaupt, Seeger, and Sogge, which has a number of other consequences including Sogge’s local smoothing conjecture for the wave equation in two spatial dimensions, which in turn implies the (already known) Bochner-Riesz, restriction, and Kakeya conjectures in two dimensions. Interestingly, modern techniques such as polynomial partitioning and decoupling estimates are not used in this argument; instead, the authors mostly rely on an induction on scales argument and Kakeya type estimates. Many previous authors (including myself) were able to get weaker estimates of this type by an induction on scales method, but there were always significant inefficiencies in doing so; in particular knowing the sharp square function estimate at smaller scales did not imply the sharp square function estimate at the given larger scale. The authors here get around this issue by finding an even stronger estimate that implies the square function estimate, but behaves significantly better with respect to induction on scales.
- “On the Chowla and twin primes conjectures over
“, by Will Sawin and Mark Shusterman. This paper resolves a number of well known open conjectures in analytic number theory, such as the Chowla conjecture and the twin prime conjecture (in the strong form conjectured by Hardy and Littlewood), in the case of function fields where the field is a prime power
which is fixed (in contrast to a number of existing results in the “large
” limit) but has a large exponent
. The techniques here are orthogonal to those used in recent progress towards the Chowla conjecture over the integers (e.g., in this previous paper of mine); the starting point is an algebraic observation that in certain function fields, the Mobius function behaves like a quadratic Dirichlet character along certain arithmetic progressions. In principle, this reduces problems such as Chowla’s conjecture to problems about estimating sums of Dirichlet characters, for which more is known; but the task is still far from trivial.
- “Bounds for sets with no polynomial progressions“, by Sarah Peluse. This paper can be viewed as part of a larger project to obtain quantitative density Ramsey theorems of Szemeredi type. For instance, Gowers famously established a relatively good quantitative bound for Szemeredi’s theorem that all dense subsets of integers contain arbitrarily long arithmetic progressions
. The corresponding question for polynomial progressions
is considered more difficult for a number of reasons. One of them is that dilation invariance is lost; a dilation of an arithmetic progression is again an arithmetic progression, but a dilation of a polynomial progression will in general not be a polynomial progression with the same polynomials
. Another issue is that the ranges of the two parameters
are now at different scales. Peluse gets around these difficulties in the case when all the polynomials
have distinct degrees, which is in some sense the opposite case to that considered by Gowers (in particular, she avoids the need to obtain quantitative inverse theorems for high order Gowers norms; which was recently obtained in this integer setting by Manners but with bounds that are probably not strong enough to for the bounds in Peluse’s results, due to a degree lowering argument that is available in this case). To resolve the first difficulty one has to make all the estimates rather uniform in the coefficients of the polynomials
, so that one can still run a density increment argument efficiently. To resolve the second difficulty one needs to find a quantitative concatenation theorem for Gowers uniformity norms. Many of these ideas were developed in previous papers of Peluse and Peluse-Prendiville in simpler settings.
- “On blow up for the energy super critical defocusing non linear Schrödinger equations“, by Frank Merle, Pierre Raphael, Igor Rodnianski, and Jeremie Szeftel. This paper (when combined with two companion papers) resolves a long-standing problem as to whether finite time blowup occurs for the defocusing supercritical nonlinear Schrödinger equation (at least in certain dimensions and nonlinearities). I had a previous paper establishing a result like this if one “cheated” by replacing the nonlinear Schrodinger equation by a system of such equations, but remarkably they are able to tackle the original equation itself without any such cheating. Given the very analogous situation with Navier-Stokes, where again one can create finite time blowup by “cheating” and modifying the equation, it does raise hope that finite time blowup for the incompressible Navier-Stokes and Euler equations can be established… In fact the connection may not just be at the level of analogy; a surprising key ingredient in the proofs here is the observation that a certain blowup ansatz for the nonlinear Schrodinger equation is governed by solutions to the (compressible) Euler equation, and finite time blowup examples for the latter can be used to construct finite time blowup examples for the former.
Let be a divergence-free vector field, thus
, which we interpret as a velocity field. In this post we will proceed formally, largely ignoring the analytic issues of whether the fields in question have sufficient regularity and decay to justify the calculations. The vorticity field
is then defined as the curl of the velocity:
(From a differential geometry viewpoint, it would be more accurate (especially in other dimensions than three) to define the vorticity as the exterior derivative of the musical isomorphism
of the Euclidean metric
applied to the velocity field
; see these previous lecture notes. However, we will not need this geometric formalism in this post.)
Assuming suitable regularity and decay hypotheses of the velocity field , it is possible to recover the velocity from the vorticity as follows. From the general vector identity
applied to the velocity field
, we see that
and thus (by the commutativity of all the differential operators involved)
Using the Newton potential formula
and formally differentiating under the integral sign, we obtain the Biot-Savart law
This law is of fundamental importance in the study of incompressible fluid equations, such as the Euler equations
since on applying the curl operator one obtains the vorticity equation
and then by substituting (1) one gets an autonomous equation for the vorticity field . Unfortunately, this equation is non-local, due to the integration present in (1).
In a recent work, it was observed by Elgindi that in a certain regime, the Biot-Savart law can be approximated by a more “low rank” law, which makes the non-local effects significantly simpler in nature. This simplification was carried out in spherical coordinates, and hinged on a study of the invertibility properties of a certain second order linear differential operator in the latitude variable ; however in this post I would like to observe that the approximation can also be seen directly in Cartesian coordinates from the classical Biot-Savart law (1). As a consequence one can also initiate the beginning of Elgindi’s analysis in constructing somewhat regular solutions to the Euler equations that exhibit self-similar blowup in finite time, though I have not attempted to execute the entirety of the analysis in this setting.
Elgindi’s approximation applies under the following hypotheses:
- (i) (Axial symmetry without swirl) The velocity field
is assumed to take the form
for some functionsof the cylindrical radial variable
and the vertical coordinate
. As a consequence, the vorticity field
takes the form
whereis the field
- (ii) (Odd symmetry) We assume that
and
, so that
.
A model example of a divergence-free vector field obeying these properties (but without good decay at infinity) is the linear vector field
which is of the form (3) with and
. The associated vorticity
vanishes.
We can now give an illustration of Elgindi’s approximation:
Proposition 1 (Elgindi’s approximation) Under the above hypotheses (and assuing suitable regularity and decay), we have the pointwise bounds
for any
, where
is the vector field (5), and
is the scalar function
Thus under the hypotheses (i), (ii), and assuming that is slowly varying, we expect
to behave like the linear vector field
modulated by a radial scalar function. In applications one needs to control the error in various function spaces instead of pointwise, and with
similarly controlled in other function space norms than the
norm, but this proposition already gives a flavour of the approximation. If one uses spherical coordinates
then we have (using the spherical change of variables formula and the odd nature of
)
where
is the operator introduced in Elgindi’s paper.
Proof: By a limiting argument we may assume that is non-zero, and we may normalise
. From the triangle inequality we have
and hence by (1)
In the regime we may perform the Taylor expansion
Since
we see from the triangle inequality that the error term contributes to
. We thus have
where is the constant term
and are the linear term
By the hypotheses (i), (ii), we have the symmetries
The even symmetry (8) ensures that the integrand in is odd, so
vanishes. The symmetry (6) or (7) similarly ensures that
, so
vanishes. Since
, we conclude that
Using (4), the right-hand side is
where . Because of the odd nature of
, only those terms with one factor of
give a non-vanishing contribution to the integral. Using the rotation symmetry
we also see that any term with a factor of
also vanishes. We can thus simplify the above expression as
Using the rotation symmetry again, we see that the term
in the first component can be replaced by
or by
, and similarly for the
term in the second component. Thus the above expression is
giving the claim.
Example 2 Consider the divergence-free vector field
, where the vector potential
takes the form
for some bump function
supported in
. We can then calculate
and
In particular the hypotheses (i), (ii) are satisfied with
One can then calculate
If we take the specific choice
where
is a fixed bump function supported some interval
and
is a small parameter (so that
is spread out over the range
), then we see that
(with implied constants allowed to depend on
),
and
which is completely consistent with Proposition 1.
One can use this approximation to extract a plausible ansatz for a self-similar blowup to the Euler equations. We let be a small parameter and let
be a time-dependent vorticity field obeying (i), (ii) of the form
where and
is a smooth field to be chosen later. Admittedly the signum function
is not smooth at
, but let us ignore this issue for now (to rigorously make an ansatz one will have to smooth out this function a little bit; Elgindi uses the choice
, where
). With this ansatz one may compute
By Proposition 1, we thus expect to have the approximation
We insert this into the vorticity equation (2). The transport term will be expected to be negligible because
, and hence
, is slowly varying (the discontinuity of
will not be encountered because the vector field
is parallel to this singularity). The modulating function
is similarly slowly varying, so derivatives falling on this function should be lower order. Neglecting such terms, we arrive at the approximation
and so in the limit we expect obtain a simple model equation for the evolution of the vorticity envelope
:
If we write for the logarithmic primitive of
, then we have
and hence
which integrates to the Ricatti equation
which can be explicitly solved as
where is any function of
that one pleases. (In Elgindi’s work a time dilation is used to remove the unsightly factor of
appearing here in the denominator.) If for instance we set
, we obtain the self-similar solution
and then on applying
Thus, we expect to be able to construct a self-similar blowup to the Euler equations with a vorticity field approximately behaving like
and velocity field behaving like
In particular, would be expected to be of regularity
(and smooth away from the origin), and blows up in (say)
norm at time
, and one has the self-similarity
and
A self-similar solution of this approximate shape is in fact constructed rigorously in Elgindi’s paper (using spherical coordinates instead of the Cartesian approach adopted here), using a nonlinear stability analysis of the above ansatz. It seems plausible that one could also carry out this stability analysis using this Cartesian coordinate approach, although I have not tried to do this in detail.
I’ve just uploaded to the arXiv my paper “Quantitative bounds for critically bounded solutions to the Navier-Stokes equations“, submitted to the proceedings of the Linde Hall Inaugural Math Symposium. (I unfortunately had to cancel my physical attendance at this symposium for personal reasons, but was still able to contribute to the proceedings.) In recent years I have been interested in working towards establishing the existence of classical solutions for the Navier-Stokes equations
that blow up in finite time, but this time for a change I took a look at the other side of the theory, namely the conditional regularity results for this equation. There are several such results that assert that if a certain norm of the solution stays bounded (or grows at a controlled rate), then the solution stays regular; taken in the contrapositive, they assert that if a solution blows up at a certain finite time , then certain norms of the solution must also go to infinity. Here are some examples (not an exhaustive list) of such blowup criteria:
- (Leray blowup criterion, 1934) If
blows up at a finite time
, and
, then
for an absolute constant
.
- (Prodi–Serrin–Ladyzhenskaya blowup criterion, 1959-1967) If
blows up at a finite time
, and
, then
, where
.
- (Beale-Kato-Majda blowup criterion, 1984) If
blows up at a finite time
, then
, where
is the vorticity.
- (Kato blowup criterion, 1984) If
blows up at a finite time
, then
for some absolute constant
.
- (Escauriaza-Seregin-Sverak blowup criterion, 2003) If
blows up at a finite time
, then
.
- (Seregin blowup criterion, 2012) If
blows up at a finite time
, then
.
- (Phuc blowup criterion, 2015) If
blows up at a finite time
, then
for any
.
- (Gallagher-Koch-Planchon blowup criterion, 2016) If
blows up at a finite time
, then
for any
.
- (Albritton blowup criterion, 2016) If
blows up at a finite time
, then
for any
.
My current paper is most closely related to the Escauriaza-Seregin-Sverak blowup criterion, which was the first to show a critical (i.e., scale-invariant, or dimensionless) spatial norm, namely , had to become large. This result now has many proofs; for instance, many of the subsequent blowup criterion results imply the Escauriaza-Seregin-Sverak one as a special case, and there are also additional proofs by Gallagher-Koch-Planchon (building on ideas of Kenig-Koch), and by Dong-Du. However, all of these proofs rely on some form of a compactness argument: given a finite time blowup, one extracts some suitable family of rescaled solutions that converges in some weak sense to a limiting solution that has some additional good properties (such as almost periodicity modulo symmetries), which one can then rule out using additional qualitative tools, such as unique continuation and backwards uniqueness theorems for parabolic heat equations. In particular, all known proofs use some version of the backwards uniqueness theorem of Escauriaza, Seregin, and Sverak. Because of this reliance on compactness, the existing proofs of the Escauriaza-Seregin-Sverak blowup criterion are qualitative, in that they do not provide any quantitative information on how fast the
norm will go to infinity (along a subsequence of times).
On the other hand, it is a general principle that qualitative arguments established using compactness methods ought to have quantitative analogues that replace the use of compactness by more complicated substitutes that give effective bounds; see for instance these previous blog posts for more discussion. I therefore was interested in trying to obtain a quantitative version of this blowup criterion that gave reasonably good effective bounds (in particular, my objective was to avoid truly enormous bounds such as tower-exponential or Ackermann function bounds, which often arise if one “naively” tries to make a compactness argument effective). In particular, I obtained the following triple-exponential quantitative regularity bounds:
Theorem 1 If
is a classical solution to Navier-Stokes on
with
and
for
and
.
As a corollary, one can now improve the Escauriaza-Seregin-Sverak blowup criterion to
for some absolute constant , which to my knowledge is the first (very slightly) supercritical blowup criterion for Navier-Stokes in the literature.
The proof uses many of the same quantitative inputs as previous arguments, most notably the Carleman inequalities used to establish unique continuation and backwards uniqueness theorems for backwards heat equations, but also some additional techniques that make the quantitative bounds more efficient. The proof focuses initially on points of concentration of the solution, which we define as points where there is a frequency
for which one has the bound
for a large absolute constant , where
is a Littlewood-Paley projection to frequencies
. (This can be compared with the upper bound of
for the quantity on the left-hand side that follows from (1).) The factor of
normalises the left-hand side of (2) to be dimensionless (i.e., critical). The main task is to show that the dimensionless quantity
cannot get too large; in particular, we end up establishing a bound of the form
from which the above theorem ends up following from a routine adaptation of the local well-posedness and regularity theory for Navier-Stokes.
The strategy is to show that any concentration such as (2) when is large must force a significant component of the
norm of
to also show up at many other locations than
, which eventually contradicts (1) if one can produce enough such regions of non-trivial
norm. (This can be viewed as a quantitative variant of the “rigidity” theorems in some of the previous proofs of the Escauriaza-Seregin-Sverak theorem that rule out solutions that exhibit too much “compactness” or “almost periodicity” in the
topology.) The chain of causality that leads from a concentration (2) at
to significant
norm at other regions of the time slice
is somewhat involved (though simpler than the much more convoluted schemes I initially envisaged for this argument):
- Firstly, by using Duhamel’s formula, one can show that a concentration (2) can only occur (with
large) if there was also a preceding concentration
at some slightly previous point
in spacetime, with
also close to
(more precisely, we have
,
, and
). This can be viewed as a sort of contrapositive of a “local regularity theorem”, such as the ones established by Caffarelli, Kohn, and Nirenberg. A key point here is that the lower bound
in the conclusion (3) is precisely the same as the lower bound in (2), so that this backwards propagation of concentration can be iterated.
- Iterating the previous step, one can find a sequence of concentration points
with the
propagating backwards in time; by using estimates ultimately resulting from the dissipative term in the energy identity, one can extract such a sequence in which the
increase geometrically with time, the
are comparable (up to polynomial factors in
) to the natural frequency scale
, and one has
. Using the “epochs of regularity” theory that ultimately dates back to Leray, and tweaking the
slightly, one can also place the times
in intervals
(of length comparable to a small multiple of
) in which the solution is quite regular (in particular,
enjoy good
bounds on
).
- The concentration (4) can be used to establish a lower bound for the
norm of the vorticity
near
. As is well known, the vorticity obeys the vorticity equation
In the epoch of regularity
, the coefficients
of this equation obey good
bounds, allowing the machinery of Carleman estimates to come into play. Using a Carleman estimate that is used to establish unique continuation results for backwards heat equations, one can propagate this lower bound to also give lower
bounds on the vorticity (and its first derivative) in annuli of the form
for various radii
, although the lower bounds decay at a gaussian rate with
.
- Meanwhile, using an energy pigeonholing argument of Bourgain (which, in this Navier-Stokes context, is actually an enstrophy pigeonholing argument), one can locate some annuli
where (a slightly normalised form of) the entrosphy is small at time
; using a version of the localised enstrophy estimates from a previous paper of mine, one can then propagate this sort of control forward in time, obtaining an “annulus of regularity” of the form
in which one has good estimates; in particular, one has
type bounds on
in this cylindrical annulus.
- By intersecting the previous epoch of regularity
with the above annulus of regularity, we have some lower bounds on the
norm of the vorticity (and its first derivative) in the annulus of regularity. Using a Carleman estimate first introduced by Escauriaza, Seregin, and Sverak, as well as a second application of the Carleman estimate used previously, one can then propagate this lower bound back up to time
, establishing a lower bound for the vorticity on the spatial annulus
. By some basic Littlewood-Paley theory one can parlay this lower bound to a lower bound on the
norm of the velocity
; crucially, this lower bound is uniform in
.
- If
is very large (triple exponential in
!), one can then find enough scales
with disjoint
annuli that the total lower bound on the
norm of
provided by the above arguments is inconsistent with (1), thus establishing the claim.
The chain of causality is summarised in the following image:

It seems natural to conjecture that similar triply logarithmic improvements can be made to several of the other blowup criteria listed above, but I have not attempted to pursue this question. It seems difficult to improve the triple logarithmic factor using only the techniques here; the Bourgain pigeonholing argument inevitably costs one exponential, the Carleman inequalities cost a second, and the stacking of scales at the end to contradict the upper bound costs the third.
Let be some domain (such as the real numbers). For any natural number
, let
denote the space of symmetric real-valued functions
on
variables
, thus
for any permutation . For instance, for any natural numbers
, the elementary symmetric polynomials
will be an element of . With the pointwise product operation,
becomes a commutative real algebra. We include the case
, in which case
consists solely of the real constants.
Given two natural numbers , one can “lift” a symmetric function
of
variables to a symmetric function
of
variables by the formula
where ranges over all injections from
to
(the latter formula making it clearer that
is symmetric). Thus for instance
and
Also we have
With these conventions, we see that vanishes for
, and is equal to
if
. We also have the transitivity
if .
The lifting map is a linear map from
to
, but it is not a ring homomorphism. For instance, when
, one has
In general, one has the identity
for all natural numbers and
,
, where
range over all injections
,
with
. Combinatorially, the identity (2) follows from the fact that given any injections
and
with total image
of cardinality
, one has
, and furthermore there exist precisely
triples
of injections
,
,
such that
and
.
Example 1 When
, one has
which is just a restatement of the identity
Note that the coefficients appearing in (2) do not depend on the final number of variables . We may therefore abstract the role of
from the law (2) by introducing the real algebra
of formal sums
where for each ,
is an element of
(with only finitely many of the
being non-zero), and with the formal symbol
being formally linear, thus
and
for and scalars
, and with multiplication given by the analogue
of (2). Thus for instance, in this algebra we have
and
Informally, is an abstraction (or “inverse limit”) of the concept of a symmetric function of an unspecified number of variables, which are formed by summing terms that each involve only a bounded number of these variables at a time. One can check (somewhat tediously) that
is indeed a commutative real algebra, with a unit
. (I do not know if this algebra has previously been studied in the literature; it is somewhat analogous to the abstract algebra of finite linear combinations of Schur polynomials, with multiplication given by a Littlewood-Richardson rule. )
For natural numbers , there is an obvious specialisation map
from
to
, defined by the formula
Thus, for instance, maps
to
and
to
. From (2) and (3) we see that this map
is an algebra homomorphism, even though the maps
and
are not homomorphisms. By inspecting the
component of
we see that the homomorphism
is in fact surjective.
Now suppose that we have a measure on the space
, which then induces a product measure
on every product space
. To avoid degeneracies we will assume that the integral
is strictly positive. Assuming suitable measurability and integrability hypotheses, a function
can then be integrated against this product measure to produce a number
In the event that arises as a lift
of another function
, then from Fubini’s theorem we obtain the formula
is an element of the formal algebra , then
Note that by hypothesis, only finitely many terms on the right-hand side are non-zero.
Now for a key observation: whereas the left-hand side of (6) only makes sense when is a natural number, the right-hand side is meaningful when
takes a fractional value (or even when it takes negative or complex values!), interpreting the binomial coefficient
as a polynomial
in
. As such, this suggests a way to introduce a “virtual” concept of a symmetric function on a fractional power space
for such values of
, and even to integrate such functions against product measures
, even if the fractional power
does not exist in the usual set-theoretic sense (and
similarly does not exist in the usual measure-theoretic sense). More precisely, for arbitrary real or complex
, we now define
to be the space of abstract objects
with and
(and
now interpreted as formal symbols, with the structure of a commutative real algebra inherited from
, thus
In particular, the multiplication law (2) continues to hold for such values of , thanks to (3). Given any measure
on
, we formally define a measure
on
with regards to which we can integrate elements
of
by the formula (6) (providing one has sufficient measurability and integrability to make sense of this formula), thus providing a sort of “fractional dimensional integral” for symmetric functions. Thus, for instance, with this formalism the identities (4), (5) now hold for fractional values of
, even though the formal space
no longer makes sense as a set, and the formal measure
no longer makes sense as a measure. (The formalism here is somewhat reminiscent of the technique of dimensional regularisation employed in the physical literature in order to assign values to otherwise divergent integrals. See also this post for an unrelated abstraction of the integration concept involving integration over supercommutative variables (and in particular over fermionic variables).)
Example 2 Suppose
is a probability measure on
, and
is a random variable; on any power
, we let
be the usual independent copies of
on
, thus
for
. Then for any real or complex
, the formal integral
can be evaluated by first using the identity
(cf. (1)) and then using (6) and the probability measure hypothesis
to conclude that
For
a natural number, this identity has the probabilistic interpretation
whenever
are jointly independent copies of
, which reflects the well known fact that the sum
has expectation
and variance
. One can thus view (7) as an abstract generalisation of (8) to the case when
is fractional, negative, or even complex, despite the fact that there is no sensible way in this case to talk about
independent copies
of
in the standard framework of probability theory.
In this particular case, the quantity (7) is non-negative for every nonnegative
, which looks plausible given the form of the left-hand side. Unfortunately, this sort of non-negativity does not always hold; for instance, if
has mean zero, one can check that
and the right-hand side can become negative for
. This is a shame, because otherwise one could hope to start endowing
with some sort of commutative von Neumann algebra type structure (or the abstract probability structure discussed in this previous post) and then interpret it as a genuine measure space rather than as a virtual one. (This failure of positivity is related to the fact that the characteristic function of a random variable, when raised to the
power, need not be a characteristic function of any random variable once
is no longer a natural number: “fractional convolution” does not preserve positivity!) However, one vestige of positivity remains: if
is non-negative, then so is
One can wonder what the point is to all of this abstract formalism and how it relates to the rest of mathematics. For me, this formalism originated implicitly in an old paper I wrote with Jon Bennett and Tony Carbery on the multilinear restriction and Kakeya conjectures, though we did not have a good language for working with it at the time, instead working first with the case of natural number exponents and appealing to a general extrapolation theorem to then obtain various identities in the fractional
case. The connection between these fractional dimensional integrals and more traditional integrals ultimately arises from the simple identity
(where the right-hand side should be viewed as the fractional dimensional integral of the unit against
). As such, one can manipulate
powers of ordinary integrals using the machinery of fractional dimensional integrals. A key lemma in this regard is
Lemma 3 (Differentiation formula) Suppose that a positive measure
on
depends on some parameter
and varies by the formula
for some function
. Let
be any real or complex number. Then, assuming sufficient smoothness and integrability of all quantities involved, we have
for all
that are independent of
. If we allow
to now depend on
also, then we have the more general total derivative formula
again assuming sufficient amounts of smoothness and regularity.
Proof: We just prove (10), as (11) then follows by same argument used to prove the usual product rule. By linearity it suffices to verify this identity in the case for some symmetric function
for a natural number
. By (6), the left-hand side of (10) is then
Differentiating under the integral sign using (9) we have
and similarly
where are the standard
copies of
on
:
By the product rule, we can thus expand (12) as
where we have suppressed the dependence on for brevity. Since
, we can write this expression using (6) as
where is the symmetric function
But from (2) one has
and the claim follows.
Remark 4 It is also instructive to prove this lemma in the special case when
is a natural number, in which case the fractional dimensional integral
can be interpreted as a classical integral. In this case, the identity (10) is immediate from applying the product rule to (9) to conclude that
One could in fact derive (10) for arbitrary real or complex
from the case when
is a natural number by an extrapolation argument; see the appendix of my paper with Bennett and Carbery for details.
Let us give a simple PDE application of this lemma as illustration:
Proposition 5 (Heat flow monotonicity) Let
be a solution to the heat equation
with initial data
a rapidly decreasing finite non-negative Radon measure, or more explicitly
for al
. Then for any
, the quantity
is monotone non-decreasing in
for
, constant for
, and monotone non-increasing for
.
Proof: By a limiting argument we may assume that is absolutely continuous, with Radon-Nikodym derivative a test function; this is more than enough regularity to justify the arguments below.
For any , let
denote the Radon measure
Then the quantity can be written as a fractional dimensional integral
Observe that
and thus by Lemma 3 and the product rule
where we use for the variable of integration in the factor space
of
.
To simplify this expression we will take advantage of integration by parts in the variable. Specifically, in any direction
, we have
and hence by Lemma 3
Multiplying by and integrating by parts, we see that
where we use the Einstein summation convention in . Similarly, if
is any reasonable function depending only on
, we have
and hence on integration by parts
We conclude that
and thus by (13)
The choice of that then achieves the most cancellation turns out to be
(this cancels the terms that are linear or quadratic in the
), so that
. Repeating the calculations establishing (7), one has
and
where is the random variable drawn from
with the normalised probability measure
. Since
, one thus has
This expression is clearly non-negative for , equal to zero for
, and positive for
, giving the claim. (One could simplify
here as
if desired, though it is not strictly necessary to do so for the proof.)
Remark 6 As with Remark 4, one can also establish the identity (14) first for natural numbers
by direct computation avoiding the theory of fractional dimensional integrals, and then extrapolate to the case of more general values of
. This particular identity is also simple enough that it can be directly established by integration by parts without much difficulty, even for fractional values of
.
A more complicated version of this argument establishes the non-endpoint multilinear Kakeya inequality (without any logarithmic loss in a scale parameter ); this was established in my previous paper with Jon Bennett and Tony Carbery, but using the “natural number
first” approach rather than using the current formalism of fractional dimensional integration. However, the arguments can be translated into this formalism without much difficulty; we do so below the fold. (To simplify the exposition slightly we will not address issues of establishing enough regularity and integrability to justify all the manipulations, though in practice this can be done by standard limiting arguments.)
I was recently asked to contribute a short comment to Nature Reviews Physics, as part of a series of articles on fluid dynamics on the occasion of the 200th anniversary (this August) of the birthday of George Stokes. My contribution is now online as “Searching for singularities in the Navier–Stokes equations“, where I discuss the global regularity problem for Navier-Stokes and my thoughts on how one could try to construct a solution that blows up in finite time via an approximately discretely self-similar “fluid computer”. (The rest of the series does not currently seem to be available online, but I expect they will become so shortly.)


Recent Comments