SearcharxivSearch

arXiv · 1103.1998

On Malliavin's proof of Hörmander's theorem

Abstract

The aim of this note is to provide a short and self-contained proof of Hörmander's theorem about the smoothness of transition probabilities for a diffusion under Hörmander's "brackets condition". While both the result and the technique of proof are well-known, the exposition given here is novel in two aspects. First, we introduce Malliavin calculus in an "intuitive" way, without using Wiener's chaos decomposition. While this may make it difficult to prove some of the standard results in Malliavin calculus (boundedness of the derivative operator in $L^p$ spaces for example), we are able to bypass these and to replace them by weaker results that are still sufficient for our purpose. Second, we introduce a notion of "almost implication" and "almost truth" (somewhat similar to what is done in fuzzy logic) which allows, once the foundations of Malliavin calculus are laid out, to give a very short and streamlined proof of Hörmader's theorem that focuses on the main ideas without clouding it by technical details.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Hairer. 2011-03-10. On Malliavin's proof of Hörmander's theorem. https://arxiv.org/abs/1103.1998

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR