Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle - Centre de Mathématiques Appliquées
Journal Articles Revista Matemática Iberoamericana Year : 2024

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.
Fichier principal
Vignette du fichier
SetDecompositionOfGChains_revised.pdf (422.19 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03890958 , version 1 (08-12-2022)
hal-03890958 , version 2 (13-06-2023)
hal-03890958 , version 3 (03-11-2024)

Identifiers

Cite

Michael Goldman, Benoît Merlet. Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle. Revista Matemática Iberoamericana, 2024, 40 (6), pp.2073-2094. ⟨10.4171/RMI/1504⟩. ⟨hal-03890958v3⟩
82 View
44 Download

Altmetric

Share

More