Manuscript XVI-L@1 · XVI-L.tex · proposition · 35081099

Proposition: Graph factor for the complete source

L.2 Complete graph decomposition › Normalization gate · lines 559–582 · proof included or linked

XVI-L@1#prop:Lnorm, XVI-L@1#eq:L-factor

Back to manuscript

The combinatorial graph factor of the specified two-edge graph, with the complete source at and the full cubic vertex at , is

It carries no power of or . Coupling and loop weights are not determined in this note and are kept separate from (eq:L-factor).

Proof. Re-derive from the same first principles as XVI-I, without transferring XVI-K's factor as a black box.

  1. Two identical graviton edges. The sector joins the two tensor slots of to one compactly switched copy of by two graviton edges, each carrying (XVI-I, Proposition prop:sector). Fredenhagen–Rejzner, arXiv:1208.1428v2, equation (82), place in the denominator for lines between the same pair of vertices; here , so the coefficient is , declared once (XVI-I, Proposition prop:signs(6)).

  2. {Second variation of .} contributes the factor (XVI-I, eq:Dh): the count of the two identical tensor slots, not a hand-inserted normalization.

  3. Independence of the source completion. Replacing the selected source by the complete changes only the source-end contraction at . It does not change the number of edges, the identity of the two edges, or the second tensor derivative of . Hence neither factor in (eq:L-factor) is altered.

  4. The product is , as in XVI-I, Proposition prop:sector, and as used for the sector in XVI-K, Proposition prop:QK.

No coupling constant and no loop weight enters this count; if such weights are fixed later they multiply the whole amplitude and do not redefine (eq:L-factor).

Displayed formulas in this passage

  • XVI-L@1#eq:L-factor · line 562

Nearby in this section