Combinatorial proof of a Non-Renormalization Theorem
arXiv:2408.03192 · doi:10.1007/JHEP05(2025)120
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 , we associate to each vertex a position and to each edge the combination , where are the positions of the two end vertices of , and is a Schwinger parameter. The "topological propagator" includes a part proportional to and a part proportional to . Integrating the product of all over positions produces a differential form in the variables . We derive an explicit combinatorial formula for , and we prove that .
42 pages