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

We introduce the notion of set-decomposition of a normal G -flat chain A in \mathbb{R}^{n} as a sequence A_{j}=A\,\text{\Large{$\llcorner$}}S_{j} associated to a Borel partition S_{j} of \mathbb{R}^{n} such that \mathbb{N}(A)=\sum \mathbb{N}(A_{j}) . 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.

Authors

Institutions

Publication Details

Journal
Revista Matemática Iberoamericana
Published
2024-10-03
DOI
https://doi.org/10.4171/rmi/1504
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Michael D. Goldman, Benoît Merlet
Revista Matemática Iberoamericana
Point processes and geometric inequalities
article

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

Michael D. Goldman, Benoît Merlet
article en

Abstract

We introduce the notion of set-decomposition of a normal G -flat chain A in \mathbb{R}^{n} as a sequence A_{j}=A\,\text{\Large{$\llcorner$}}S_{j} associated to a Borel partition S_{j} of \mathbb{R}^{n} such that \mathbb{N}(A)=\sum \mathbb{N}(A_{j}) . 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.

Revista Matemática IberoamericanaVol. 40(6)
École Polytechnique (FR), Université de Lille (FR), Prediction Systems (United States) (US), Centre de Mathématiques Appliquées de l'École polytechnique (FR), Institut Polytechnique de Paris (FR), Laboratoire Paul Painlevé (FR)
Institut national de recherche en informatique et en automatique (INRIA), Agence Nationale de la Recherche
Openalex Percentile: Top 99%
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Set-decomposition of normal rectifiable $G$-chains via an abstract decomposition principle — Michael D. Goldman, Benoît Merlet · Revista Matemática Iberoamericana (2024) | TGRS Research Map | TGRS