Search arXivSearch

arXiv · 2212.04752

Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle

Abstract

We introduce the notion of set-decomposition of a normal G-flat chain. We show that any normal rectifiable $G$-flat chain admits a decomposition in set-indecomposable sub-chains. This generalizes the decomposition of sets of finite perimeter in their ``measure theoretic'' connected components due to Ambrosio, Caselles, Masnou and Morel. It can also be seen as a variant of the decomposition of integral currents in indecomposable components by Federer.As opposed to previous results, we do not assume that G is boundedly compact. Therefore we cannot rely on the compactness of sequences of chains with uniformly bounded N-norms. We deduce instead the result from a new abstract decomposition principle. As in earlier proofs a central ingredient is the validity of an isoperimetric inequality. We obtain it here using the finiteness of some h-mass to replace integrality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Goldman, Benoît Merlet. 2024-11-04. Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle. https://doi.org/10.4171/rmi%2F1504

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Two-layers neural networks for Schr{ö}dinger eigenvalue problems

The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of high-dimensional Schr{ö}dinger eigenvalue problems with smooth interaction potentials and Neumann boundary condition on the unit cube in any dimension. More precisely, any eigenfunction associated to the lowest eigenvalue of the Schr{ö}dinger operator is a unit L 2 norm minimizer of the associated energy. Using Barron's representation of the solution with a probability measure defined on the set of parameter values and following the approach initially suggested by Bach and Chizat [1], the energy is minimized thanks to a constrained gradient curve dynamic on the 2-Wasserstein space of the set of parameter values defining the neural network. We prove the existence of solutions to this constrained gradient curve. Furthermore, we prove that, if it converges, the represented function is then an eigenfunction of the considered Schr{ö}dinger operator. At least up to our knowledge, this is the first work where this type of analysis is carried out to deal with the minimization of non-convex functionals.

math.AP

Validity of Prandtl Expansion for Steady Compressible Navier-Stokes-Fourier Flows

Assume no-slip boundary conditions for the velocity field and either insulated or Dirichlet boundary conditions for the temperature field in a steady compressible fluid. In the inviscid limit $\v \rightarrow 0$, we develop a mathematical framework for the uniform-in-$\v$ remainder estimate for the linear steady compressible Navier-Stokes-Fourier equations around a Prandtl layer profile with both velocity and thermal layers, which leads to the validity of the Prandtl layer expansion.

math.AP

Long time behaviour of Mean Field Games with fractional diffusion

In this paper we study the long time behaviour of mean field games systems with fractional diffusion, modeling the case that the individual dynamics of the players is driven by independent jump processes and controlled through the drift term, while being confined by an external field in order to guarantee ergodicity. In the case of globally Lipschitz, locally uniformly convex Hamiltonian, and weakly coupled costs satisfying the Lasry-Lions monotonicity condition, we prove that there is a unique solution $(u_T,m_T)$ to the mean field game problem in $(0,T)$ and we show that, if $T$ is sufficiently large, $(u_T,m_T)$ satisfies the so-called turnpike property, namely it is exponentially close to the (unique) stationary ergodic state for any proportionally long intermediate time.

math.AP