English

Combinatorial proof of a Non-Renormalization Theorem

Mathematical Physics 2025-06-12 v2 High Energy Physics - Theory Combinatorics math.MP

Abstract

We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph Γ\Gamma, we associate to each vertex a position xvRx_v \in \mathbb R and to each edge ee the combination se=ae12(xe+xe)s_e = a_e^{-\frac 12} \left( x^+_e - x^-_e \right), where xe±x^\pm_e are the positions of the two end vertices of ee, and aea_e is a Schwinger parameter. The "topological propagator" Pe=ese2dseP_e = e^{-s_e^2}\text d s_e includes a part proportional to dxv\text d x_v and a part proportional to dae\text d a_e. Integrating the product of all PeP_e over positions produces a differential form αΓ\alpha_\Gamma in the variables aea_e. We derive an explicit combinatorial formula for αΓ\alpha_\Gamma, and we prove that αΓαΓ=0\alpha_\Gamma \wedge \alpha_\Gamma=0.

Cite

@article{arxiv.2408.03192,
  title  = {Combinatorial proof of a Non-Renormalization Theorem},
  author = {Paul-Hermann Balduf and Davide Gaiotto},
  journal= {arXiv preprint arXiv:2408.03192},
  year   = {2025}
}

Comments

42 pages

R2 v1 2026-06-28T18:05:25.992Z