Nash embedding theorem


The Nash embedding theorems, named after John Forbes Nash, state that every Riemannian manifold can be isometrically embedded into some Euclidean space. Isometric means preserving the length of every path. For instance, bending without stretching or tearing a page of paper gives an isometric embedding of the page into Euclidean space because curves drawn on the page retain the same arclength however the page is bent.
The first theorem is for continuously differentiable embeddings and the second for analytic embeddings or embeddings that are smooth of class Ck, 3 ≤ k ≤ ∞. These two theorems are very different from each other. The first theorem has a very simple proof but leads to some counterintuitive conclusions, while the second theorem has a technical and counterintuitive proof but leads to a less surprising result.
The C1 theorem was published in 1954, the Ck-theorem in 1956. The real analytic theorem was first treated by Nash in 1966; his argument was simplified considerably by. In the real analytic case, the smoothing operators in the Nash inverse function argument can be replaced by Cauchy estimates. Nash's proof of the Ck- case was later extrapolated into the h-principle and Nash–Moser implicit function theorem. A simplified proof of the second Nash embedding theorem was obtained by who reduced the set of nonlinear partial differential equations to an elliptic system, to which the contraction mapping theorem could be applied.

Nash–Kuiper theorem (''C''1 embedding theorem)

Theorem. Let be a Riemannian manifold and ƒ: Mm → Rn a short C∞-embedding into Euclidean space Rn, where n ≥ m+1. Then for arbitrary ε > 0 there is an embedding ƒε: Mm → Rn which is
In particular, as follows from the Whitney embedding theorem, any m-dimensional Riemannian manifold admits an isometric C1-embedding into an arbitrarily small neighborhood in 2m-dimensional Euclidean space.
The theorem was originally proved by John Nash with the condition n ≥ m+2 instead of n ≥ m+1 and generalized by Nicolaas Kuiper, by a relatively easy trick.
The theorem has many counterintuitive implications. For example, it follows that any closed oriented Riemannian surface can be C1 isometrically embedded into an arbitrarily small ε-ball in Euclidean 3-space. And, there exist C1 isometric embeddings of the hyperbolic plane in R3.

''C''''k'' embedding theorem

The technical statement appearing in Nash's original paper is as follows: if M is a given m-dimensional Riemannian manifold, then there exists a number n /2 if M is a compact manifold, or n ≤ m and an injective map ƒ: M → Rn such that for every point p of M, the derivative dƒp is a linear map from the tangent space TpM to Rn which is compatible with the given inner product on TpM and the standard dot product of Rn in the following sense:
for all vectors u, v in TpM. This is an undetermined system of partial differential equations.
In a later , Nash mentioned of a fault in the original argument in deriving the sufficing value of the dimension of the embedding space for the case of non-compact manifolds.
The Nash embedding theorem is a global theorem in the sense that the whole manifold is embedded into Rn. A local embedding theorem is much simpler and can be proved using the implicit function theorem of advanced calculus in a coordinate neighborhood of the manifold. The proof of the global embedding theorem relies on Nash's far-reaching generalization of the implicit function theorem, the Nash–Moser theorem and Newton's method with postconditioning. The basic idea of Nash's solution of the embedding problem is the use of Newton's method to prove the existence of a solution to the above system of PDEs. The standard Newton's method fails to converge when applied to the system; Nash uses smoothing operators defined by convolution to make the Newton iteration converge: this is Newton's method with postconditioning. The fact that this technique furnishes a solution is in itself an existence theorem and of independent interest. There is also an older method called Kantorovich iteration that uses Newton's method directly.