Smooth approximation of mappings with rank of the derivative at most 1
Abstract
It was conjectured that if f∈ C1(Rn,Rn) satisfies rank Df≤ m<n everywhere in Rn, then f can be uniformly approximated by C∞-mappings g satisfying rank Dg≤ m everywhere. While in general, there are counterexamples to this conjecture, we prove that the answer is in the positive when m=1. More precisely, if m=1, our result yields an almost-uniform approximation of locally Lipschitz mappings f:n, satisfying rank Df≤ 1 a.e., by C∞-mappings g with rank Dg≤ 1, provided ⊂Rn is simply connected. The construction of the approximation employs techniques of analysis on metric spaces, including the theory of metric trees (R-trees).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.