You are currently browsing the tag archive for the ‘Whitney embedding theorem’ tag.

# Tag Archive

## Notes on the Nash embedding theorem

11 May, 2016 in expository, math.AP, math.DG, math.MG | Tags: Nash embedding theorem, Riemannian geometry, Whitney embedding theorem | by Terence Tao | 17 comments

Throughout this post we shall always work in the smooth category, thus all manifolds, maps, coordinate charts, and functions are assumed to be smooth unless explicitly stated otherwise.

A (real) manifold can be defined in at least two ways. On one hand, one can define the manifold *extrinsically*, as a subset of some standard space such as a Euclidean space . On the other hand, one can define the manifold *intrinsically*, as a topological space equipped with an atlas of coordinate charts. The fundamental *embedding theorems* show that, under reasonable assumptions, the intrinsic and extrinsic approaches give the same classes of manifolds (up to isomorphism in various categories). For instance, we have the following (special case of) the Whitney embedding theorem:

Theorem 1 (Whitney embedding theorem)Let be a compact manifold. Then there exists an embedding from to a Euclidean space .

In fact, if is -dimensional, one can take to equal , which is often best possible (easy examples include the circle which embeds into but not , or the Klein bottle that embeds into but not ). One can also relax the compactness hypothesis on to second countability, but we will not pursue this extension here. We give a “cheap” proof of this theorem below the fold which allows one to take equal to .

A significant strengthening of the Whitney embedding theorem is (a special case of) the Nash embedding theorem:

Theorem 2 (Nash embedding theorem)Let be a compactRiemannianmanifold. Then there exists a isometric embedding from to a Euclidean space .

In order to obtain the isometric embedding, the dimension has to be a bit larger than what is needed for the Whitney embedding theorem; in this article of Gunther the bound

is attained, which I believe is still the record for large . (In the converse direction, one cannot do better than , basically because this is the number of degrees of freedom in the Riemannian metric .) Nash’s original proof of theorem used what is now known as Nash-Moser inverse function theorem, but a subsequent simplification of Gunther allowed one to proceed using just the ordinary inverse function theorem (in Banach spaces).

I recently had the need to invoke the Nash embedding theorem to establish a blowup result for a nonlinear wave equation, which motivated me to go through the proof of the theorem more carefully. Below the fold I give a proof of the theorem that does not attempt to give an optimal value of , but which hopefully isolates the main ideas of the argument (as simplified by Gunther). One advantage of not optimising in is that it allows one to freely exploit the very useful tool of *pairing* together two maps , to form a combined map that can be closer to an embedding or an isometric embedding than the original maps . This lets one perform a “divide and conquer” strategy in which one first starts with the simpler problem of constructing some “partial” embeddings of and then pairs them together to form a “better” embedding.

In preparing these notes, I found the articles of Deane Yang and of Siyuan Lu to be helpful.

## Recent Comments