On incompressible flows in discrete networks and Shnirelman's inequality
Abstract
Let f and g be two volume-preserving diffeomorphisms on the cube Q=[0,1], ≥ 3. We show that there is a divergence-free vector field v ∈ L1((0,1);Lp(Q)) such that v connects f and g through the corresponding flow and v L1t Lpx ≤ Cp, f- g Lpx. In particular we show Shnirelman's inequality, cf. [Shnirelman, Generalized fluid flows, their approximation and applications (1994)], for the optimal H\"older exponent α =1, thus proving that the metric on the group of volume-preserving diffeomorphisms of Q is equivalent to the L2-distance. To achieve this, we discretise our problem, use some results on flows in discrete networks and then construct a flow in non-discrete space-time out of the discrete solution.
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.