Graph Parametrization of Continuous Mapping is Embedding


This article needs to be linked to other articles.
In particular: category
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.


Theorem

Let $U \subseteq \R^n$ be an open subset of $n$-dimensional Euclidean space.

Let $f : U \to \R^k$ be a continuous mapping.

Let $\map \Gamma f$ be the graph of $f$.

Let $\gamma_f : U \to \R^n \times \R^k$ be the graph parametrization of $\map \Gamma f$.


Then $\gamma_f$ is an embedding of $\R^n$ to $\R^{n + k}$.


Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Sources

  • 2011: John M. Lee: Introduction to Topological Manifolds (2nd ed.) ... (previous) ... (next): $\S 3$: New Spaces From Old: Subspaces. Topological Embeddings
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.