How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Scalar graph coefficients have finite upper scaling bounds
Statement
Assume the Axiom of Choice and Countable Choice and fix admissible scalar free data as defined by the local time-ordered product contract. Fix a finite loopless multigraph with vertex set , , parallel edges allowed, and a finite multi-index derivative on each edge . In this lemma a vertex subgraph is always the induced multigraph on a subset : it retains all edges of whose two endpoints lie in , with their multiplicities and derivative labels. The associated partial diagonal is ; its codimension is , and is the total diagonal. Put and use as relative coordinates on the quotient by simultaneous translations. The scaling degree at means the scaling degree at the origin in these relative coordinates, using positive dilations as in the scaling-degree definition. For , let be the numerical coefficient on the complement of its total diagonal after the coefficients for all strictly smaller vertex subsets , , have been extended across their partial diagonals. Call divergent exactly when ; call primitive when none of its proper induced vertex subgraphs is divergent. A translation-invariant extension here is invariant under simultaneous translations of all vertices in the relevant subset.
Suppose for every proper subset with , the coefficient has already received a translation-invariant extension across its total diagonal, obeying the scaling upper bounds of the contract and agreeing on intersections, by induction on . Then the numerical graph distribution on the complement of the total diagonal has a finite upper scaling bound in the relative coordinates. For a primitive graph, the bound is For a graph with proper subgraphs, the same induction gives a finite bound obtained from this edge estimate and the finitely many derivative orders of its lower-order local counterterms.
Statement references
Facts & Assumptions
Given: A finite graph , the scalar contraction kernels with relative scaling degree at most , finite edge derivative orders, and the lower-order translation-invariant graph extensions in the Statement.
Assume the Axiom of Choice The Axiom of Choice for scaling-degree extensions and Countable Choice The Axiom of Countable Choice () for Fourier and product inputs.
Local scalar time-ordered product contract fixes the translation-invariant kernels and , their scaling bounds, the positive-frequency wavefront set of , causal factorization, and the finite graph convention. On a causal split, a cross-block edge agrees with oriented from the later block to the earlier block.
Scaling degree and local extension space defines relative positive dilations and their scaling degree, including scaling for distributions already defined at the origin.
Product and pullback under wavefront transversality defines products and pullbacks when their wavefront covectors cannot cancel, including at coincident points if that condition holds there.
Positive scaling bounds for products transverse at the scaling center: distributions already defined at the scaling center, with nonnegative upper scaling bounds and joint no-cancellation there, have a product of scaling degree at most .
Every finite-scaling-degree punctured distribution has an exact-degree extension supplies same-degree extensions under [A1]; Point-extension counterterms form a finite delta-jet space classifies their ambiguity as finitely many delta derivatives with bounded order.
Test function cutoffs and euclidean localization supplies smooth cutoffs and partitions subordinate to an open cover; restricting to coordinate patches of the relative unit sphere gives a finite smooth angular partition.
Proof
Given: [A1], [F1]–[F6] and the lower-order extensions in the Statement.
Differentiation adds at most its order to a scaling upper bound: . A surjective linear pullback does not increase that bound: in coordinates with , , and integration of a test in cancels the extra dilation Jacobian. The same observation shows that a translation-invariant kernel, written as a relative distribution tensored with a constant center coordinate, has the same full-coordinate and relative scaling bounds. Its wavefront covectors satisfy : with a product localization in center and relative coordinates the center Fourier transform decreases rapidly, and the convolution localization argument of [F3] gives the statement for arbitrary localizations. Thus every cross edge has upper scaling bound , while every lower-order block kernel has covectors whose sum within its block is zero.
Fix a nontrivial partition of the vertices. The extended subgraph kernels and are distributions on their entire separate coordinate blocks, including their own total diagonals. Lift the two kernels to the full vertex-coordinate space by tensoring with the constant distribution in the other block. Step 1.1 preserves their finite nonnegative upper scaling bounds . Their covector tuples occupy disjoint blocks, so their product is their tensor product and [F4] bounds its degree by . A one-vertex block contributes the constant kernel and bound zero. Multiply this tensor product by all cross-edge kernels oriented as with . At a full-diagonal point every nonzero wavefront contribution from a cross edge places a future null covector at and its negative at . If the sum of all factor covectors were zero, summing its entries over would give a sum of future null covectors equal to zero, because the internal block covectors sum to zero by step 1.1. The future causal cone is pointed, so every cross-edge covector must vanish. The two remaining block tuples occupy disjoint coordinate blocks, and hence must separately vanish. This proves joint no-cancellation at the full diagonal. It also proves it at other points, since the wavefront condition on has the same orientation everywhere.
By [F3] and step 2.1 the causal block expression is a distribution even at the full diagonal. Apply [F4] there and step 1.1 to obtain the finite upper bound All factors are already defined at the center where [F4] is used. This argument requires no product of coincident factors and no directional property of an arbitrary unextended punctured-stratum product. Translation invariance makes the full-coordinate estimate exactly the relative-coordinate estimate.
The causal split sets cover the complement of the total diagonal. Indeed, choose a timelike linear time function taking unequal values on two distinct entries of a configuration, then split the finitely many values at a level attained by none of them. These open sets are invariant under translations and positive relative dilations. Their intersections with the relative unit sphere form a finite open cover of that compact sphere. Using [F6] in its coordinate patches, choose a finite smooth partition there, subordinate to the cover, and extend it homogeneously by to punctured relative space. On , [F1] and lower-order causal factorization identify the graph coefficient with . The lower-order expressions agree on overlaps: refining two causal splits into their intersections expresses both as the same block product, and the two incomparable blocks are spacelike, where . Hence the graph distribution is off zero. For a fixed punctured test , each is a fixed smooth compactly supported punctured test; homogeneity gives . The finite sum therefore has the maximum of the finite bounds in step 3.1.
For a primitive graph, the definitions above mean every proper induced vertex subgraph lies below its divergence threshold. Induct on vertex number with the engineering upper bound for a block , and likewise for . For independent balanced subgraph coefficients choose same-degree extensions by [F5]; their total-derivative descendants and any allowed local normalizations retain the contract's engineering upper bounds. Thus the lower-order block kernels, including any permitted finite delta-derivative terms, have these nonnegative upper bounds, starting from the zero bound at one vertex. Step 3.1 then counts every edge exactly once and step 4.1 gives . If a proper vertex subgraph has a chosen local counterterm, [F5] makes it a finite sum of finite-order delta derivatives. Each has finite relative scaling degree equal to its relative dimension plus its derivative order. Its translation-invariant lift still has block momentum sum zero by step 1.1, so steps 2.1–4.1 apply with a finite nonnegative upper bound for that chosen block. There are only finitely many vertex subsets and finitely many counterterm jets at this fixed graph order. Taking their finite maximum proves the stated general finite upper bound.
Remarks
The argument uses transversality at the full scaling center for the causal block factors, not the false general inference from ordinary punctured scaling bounds and punctured transversality. In this translation-invariant setting, block momentum conservation and the pointed future cone provide exactly that stronger transversality. The scalar free-data contract is unchanged. The estimate asserts neither convergence of the perturbation series nor an adiabatic limit.
Depends on
Local scalar time-ordered product contract
Product and pullback under wavefront transversality
Positive scaling bounds for products transverse at the scaling center
Test function cutoffs and euclidean localization
Scaling degree and local extension space
Every finite-scaling-degree punctured distribution has an exact-degree extension
Point-extension counterterms form a finite delta-jet space
The Axiom of Choice
The Axiom of Countable Choice ()