1509 — Site-Energy Decay Is Valence Plus One at Every Loop Order
Status
General proof extending Entry 1500 from trees to finite conformal scalar graphs at arbitrary loop order. Entry 1507 supplies an exhaustive small-graph audit.
Source recursion
The time-translation identity of Arkani-Hamed, Benincasa, and Postnikov, arXiv:1709.02813, Eq. (2.41), has the schematic form
Deleting shifts the endpoint energies by . If deletion disconnects the graph, the right-hand object is the product of the two component integrands. If it does not, it is the corresponding lower-loop integrand. The identity is therefore an induction on edge count valid on both sides of the tree/loop boundary.
Induction
Fix a vertex of valence , and assume the result for graphs with fewer edges.
If is incident to , then
The induction hypothesis gives
because the finite endpoint shift does not change the large- exponent.
If is not incident to , its deletion leaves the valence equal to , so that term is
Finally,
Hence incident-edge terms contribute at order , while nonincident-edge terms begin one order later.
In the positive-energy chamber the recursion has a common positive orientation and the lower-edge integrands are positive. The leading incident-edge coefficients therefore cannot cancel. The edgeless base case is .
Thus, by induction on ,
for every finite source graph in this calculus, including multiedges but excluding undeclared self-loop conventions.
Consequences
- Loop order does not enter the exponent.
- Global topology affects finite poles and coefficients, but site infinity sees only the local incidence star.
- A sector weight produces no infinity boundary whenever
The borderline gives a possible logarithmic boundary, and larger weights require explicit subtraction or relative support. 4. The de Sitter mass insertion has , so its Kummer pushforward is canonically convergent at infinity at every loop order.
Architectural meaning
This is a universal carrier law rather than a cosmology-only coefficient fact:
Sector-specific weights then decide whether infinity is silent, logarithmic, or requires a supported boundary object.
Durable evidence
- Arkani-Hamed, Benincasa, and Postnikov, arXiv:1709.02813, Eqs. (2.37)–(2.41);
research/nima/check_loop_site_valence_falloff.sage;research/nima/check_lollipop_trivalent_loop_falloff.sage;research/nima/check_all_small_graph_site_falloff.sage;- allocator claim
seqclaim-5015358d6cb0021a31a3220b.