Chain rule symmetry for singular SPDEs from multi-indices to decorated trees
Abstract
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.
Related
- Invariant Manifolds and Stability for Singular SPDEs
- A general paracontrolled ansatz for singular SPDEs
- Unifying Transforms for Singular Cauchy Problems in Quantum Logistics, Supply Chain Resilience, and Energy Systems
- Radial Symmetry and Nondegeneracy for Singular Liouville Systems with Small Singular Exponents
- Radial Nodal Dirichlet Solutions of Singular Elliptic Equations: Global Branches, Endpoint Asymptotics, and Morse Indices
BibTeX
@misc{bruned2026chain,
title = {{Chain rule symmetry for singular SPDEs from multi-indices to decorated trees}},
author = {Yvain Bruned},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.07676},
eprint = {2609.07676},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.07676},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Chain rule symmetry for singular SPDEs from multi-indices to decorated trees
AU - Yvain Bruned
PY - 2026
DA - 2026/09/07
PB - arXiv
DO - 10.48550/arxiv.2609.07676
UR - https://arxiv.org/abs/2609.07676
AB - 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.
ER -