Metraipolis › archive › dc_f24cd779c6e6

Invariance is Compositional for Continuous-time Systems: From Sleekness to Lebesgue Density — arXiv:2609.36539

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36539
License (as archived)
CC0-1.0
Archived
2026-10-07T20:48:56.509Z
SHA-256 of the archived text
0460b7a666a311857d18b7a9e17b609a0f0f515a4e4753b5e015c5dcfc85039f
Stable URL of this page
https://metraipolis.com/documento/dc_f24cd779c6e6

How to cite

Invariance is Compositional for Continuous-time Systems: From Sleekness to Lebesgue Density — arXiv:2609.36539 — arXiv (en), https://arxiv.org/abs/2609.36539 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f24cd779c6e6 (Metraipolis archive dc_f24cd779c6e6, sha256 0460b7a666a311857d18b7a9e17b609a0f0f515a4e4753b5e015c5dcfc85039f)
BibTeX
@misc{dcf24cd779c6e6,
  title = {Invariance is Compositional for Continuous-time Systems: From Sleekness to Lebesgue Density — arXiv:2609.36539},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36539},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f24cd779c6e6; sha256 0460b7a666a311857d18b7a9e17b609a0f0f515a4e4753b5e015c5dcfc85039f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36539. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This work establishes the first bidirectional compositional invariance result: robust forward invariance of a global Cartesian product set is shown to be equivalent to robust forward invariance of each local subsystem under coupling inputs from its neighbors. To facilitate this, we introduce the notion of tangential Lebesgue-density, a new condition that is weaker than classical sleekness but sufficient to ensure that the product of individual tangent cones equals the tangent cone of the product set. This equivalence reduces the curse of dimensionality by allowing the verification of a high-dimensional global system to be decomposed into a series of local sub-checks. The framework's scalability is demonstrated through a DC microgrid numerical example, confirming that the verification complexity grows only linearly with the number of subsystems.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-30 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.36539 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T20:07:11.915Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).