Nash embedding theorems: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: url. URLs might have been anonymized. Add: jstor, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_toolbar
Cewbot (talk | contribs)
Line 21:
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 ''C''<sup>1</sup> isometrically embedded into an arbitrarily small [[ball (mathematics)|&epsilon;-ball]] in Euclidean 3-space (for small <math>\epsilon</math> there is no such ''C''<sup>2</sup>-embedding since from the [[Gaussian curvature#Alternative Formulasformulas|formula for the Gauss curvature]] an extremal point of such an embedding would have curvature ≥ &epsilon;<sup>−2</sup>). And, there exist ''C''<sup>1</sup> isometric embeddings of the hyperbolic plane in '''R'''<sup>3</sup>.
 
==''C''<sup>''k''</sup> embedding theorem==