Nash's theorem via G\"unther's trick
classification
🧮 math.DG
math.AP
keywords
nashtheoremaccessibilityembeddingemphasisproofrigorsmooth
read the original abstract
We present a proof of Nash's smooth embedding theorem with an emphasis on accessibility and rigor.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.