Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2022

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

Résumé

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.pdf (371.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03890958 , version 1 (08-12-2022)
hal-03890958 , version 2 (13-06-2023)

Identifiants

Citer

Michael Goldman, Benoît Merlet. Set-decomposition of normal rectifiable G-chains via an abstract decomposition principle. 2022. ⟨hal-03890958v1⟩
66 Consultations
27 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More