Combinatorial proof of a Non-Renormalization Theorem
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 xv ∈ R and to each edge e the combination se = ae- 12 ( x+e - x-e ), where xe are the positions of the two end vertices of e, and ae is a Schwinger parameter. The "topological propagator" Pe = e-se2 d se includes a part proportional to d xv and a part proportional to d ae. Integrating the product of all Pe over positions produces a differential form α in the variables ae. We derive an explicit combinatorial formula for α, and we prove that α α=0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.