|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Nash embedding theorem''
by matte on 2006-01-25 14:41:25 |
|
| An interesting PR stunt could be to type in Nash's proof of
the embedding theorem into PM. Of course, properly expanded
into a readable proof-tree of attached and autolinked entries
(or "de-linearized").
This could be a good way to showcase the ability of PM. For example,
it would be quite impressive in a demonstration or talk about PM.
From a more practical point of view, it is also a good way
to find missing results on PM.
As there are shorter ways to prove this result nowadays, it
might not be impossible to get official permission from Annals
for this. It would seem that the original article is more of
a historical value (?).
(I am not familiar with the proof, but I doubt that it
is completely straightforward :-) It might very well be that
it is too big a piece to handle. Maybe it would be easier to start
with a "big result" that is already in the public domain in some
old math book? That would give some experience in handling
bigger projects on PM.
|
| | [ reply | up ] | |
|
|
|
|
|
|
|
