Metraipolis › archive › dc_65d3b09e8a5d
Chain rule symmetry for singular SPDEs from multi-indices to decorated trees — arXiv:2609.07676
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07676
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:32:38.208Z
- SHA-256 of the archived text
a11c1531cafb9af9baff5a6a71da9fa43b9f0cbf6c2eb7102121d38b31d2b02f- Stable URL of this page
https://metraipolis.com/documento/dc_65d3b09e8a5d
How to cite
Chain rule symmetry for singular SPDEs from multi-indices to decorated trees — arXiv:2609.07676 — arXiv (en), https://arxiv.org/abs/2609.07676 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65d3b09e8a5d (Metraipolis archive dc_65d3b09e8a5d, sha256 a11c1531cafb9af9baff5a6a71da9fa43b9f0cbf6c2eb7102121d38b31d2b02f)
BibTeX
@misc{dc65d3b09e8a5d,
title = {Chain rule symmetry for singular SPDEs from multi-indices to decorated trees — arXiv:2609.07676},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07676},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65d3b09e8a5d; sha256 a11c1531cafb9af9baff5a6a71da9fa43b9f0cbf6c2eb7102121d38b31d2b02f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07676. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In these lecture notes, we review the recent results around the chain rule for the generalised KPZ equation and the geometric KPZ equation. We introduce the main ideas of Regularity Structures via a B-series type expansion and the two main combinatorial sets for encoding this expansion: decorated trees and multi-indices. Then, we explain how the chain rule was first understood via integration by parts and diagrammatic computations. For the generalised KPZ equation, a scalar-valued equation, we use multi-indices to derive a characterisation in terms of iterations of covariant derivatives. The same characterisation for decorated trees is more involved and requires the use of operadic and homological tools. We summarise the main arguments of this proof. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR). Categorie arXiv: Probability (math.PR) ; Analysis of PDEs (math.AP); Rings and Algebras (math.RA). Pagina del lavoro: https://arxiv.org/abs/2609.07676 — 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-16T14:09:59.776Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).