2000 character limit reached
Path-connectedness of incompressible Euler solutions
Published 29 Apr 2025 in math.AP | (2504.20737v1)
Abstract: We study the incompressible Euler equation and prove that the set of weak solutions is path-connected. More precisely, we construct paths of H\"older regularity $C{1/2}$, valued in $C0_{t, loc} L2_x$ endowed with the strong topology. The main result relies on a convex integration construction adapted from the seminal work of De Lellis and Sz\'ekelyhidi [14, The Euler equations as a differential inclusion], extending it to a more broader geometric framework, replacing balls with arbitrary convex compact sets.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.