Alphabeta Math
Pipeline-generated
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.

All-order scalar causal extension and finite renormalization

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Off-shell local polynomial scalar functionals

Definition

Let M=R4 with coordinates x=(x0,x1,x2,x3), metric η=diag⁡(−1,1,1,1) and time orientation given by increasing x0. A field configuration is any smooth real function ϕ∈C∞(M;R); it is off shell, meaning that it is not required to satisfy a field equation. For an integer s≥0, its finite jet at x is the finite tuple jsϕ(x)=(∂αϕ(x))∣α∣≤s, with multi-index derivatives in these coordinates.

An off-shell local polynomial scalar functional is a finite sum F(ϕ)=c+∑a=1N∫Mfa(x) Pa(jsaϕ(x)) d4x, where c∈C, fa∈Cc∞(M;C), each Pa is a polynomial in the finitely many jet coordinates, and each sa is finite. Its support is contained in the compact set ⋃a=1Nsupp⁡fa. The collection of these functionals is denoted Flocpoly(M). The involution is F∗(ϕ)=F(ϕ)‾. No physical units or field equation are imposed.

Precisely, supp⁡F is the set of x∈M such that every neighborhood U of x contains the support of some h∈Cc∞(M;R) for which F(ϕ+h)≠F(ϕ) for some smooth configuration ϕ. It is closed and is contained in the displayed compact union, so it is compact. This definition is independent of the chosen finite presentation of F.

For r≥1, define the rth functional derivative by F(r)(ϕ)(h1,…,hr)=∂r∂t1⋯∂trF ⁣(ϕ+∑j=1rtjhj)∣t1=⋯=tr=0,hj∈Cc∞(M;R). The finite polynomial expansion makes this a symmetric multilinear form. Repeated integration by parts in each hj writes it as a compactly supported distribution kernel on the thin diagonal {(x,…,x):x∈M}⊂Mr. Integrals use the fixed Minkowski density d4x; all kernels are paired bilinearly with compactly supported smooth tests.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Local polynomial functionals are microcausal

Statement

For every F∈Flocpoly(M), every ϕ∈C∞(M;R) and every r≥1, the kernel F(r)(ϕ) satisfies WF⁡(F(r)(ϕ))⊆N∗Δr∖0, where Δr={(x,…,x):x∈M} and N∗Δr={(x,…,x;ξ1,…,ξr):ξ1+⋯+ξr=0}. Consequently F(r)(ϕ) avoids the all-future and all-past causal cotangent cones and F belongs to Fμcpoly(M).

Facts & Assumptions

Given: F∈Flocpoly(M), its finite-jet derivative kernels, and the (−,+,+,+) metric and future time orientation.

[F1]

Off-shell local polynomial scalar functionals: each F(r)(ϕ) is obtained by differentiating a finite polynomial in finitely many derivatives of ϕ, with compactly supported smooth coefficients.

[F2]

Local Fourier definition of a wavefront set: a localized Fourier transform that is rapidly decreasing in some conic neighborhood of a cotangent direction excludes that direction from the wavefront set.

[F3]

Compactly supported polynomial microcausal functionals: microcausality requires the wavefront set of every derivative kernel to avoid tuples all of whose entries are future causal, and tuples all of whose entries are past causal; zero entries are allowed but the tuple itself is nonzero.

[F4]

Wavefront and positive-frequency Hadamard data: the global wavefront set is the union of the local Fourier wavefront sets over all smooth charts, with covectors transported by the transpose chart differential. Future and past causal covectors are defined by metric duality from the two time-oriented causal cones for signature (−,+,+,+).

Proof

technique · finite diagonal kernels and direct nonstationary-phase estimates in every ambient chart

Given: [F1]–[F4].

1.1F1constructalgebra

Expand the finite polynomial in the definition of F after substituting ϕ+∑jtjhj and take the coefficient of t1⋯tr. Each resulting term is ∫a(x)∏j=1r∂αjhj(x) d4x, with a∈Cc∞(M). Write X=(x1,…,xr), i(x)=(x,…,x) and A=∑j∣αj∣. Its kernel is u=(−1)A∂x1α1⋯∂xrαr[a(xr)∏j<rδ(xj−xr)]: pairing it with a product test and using distributional differentiation gives the displayed integral. More generally its value on v(X)∣dX∣ is ∫a(x)(∂x1α1⋯∂xrαrv)(i(x)) d4x. Thus the complete kernel is a finite sum of finite derivatives of smooth compact diagonal distributions, supported on Δr. This includes r=1, with the empty delta product equal to 1, and gives the zero kernel above the finite polynomial degree. Derivatives of the relative deltas are retained; they cannot in general all be transferred to a.

2.1F1F2step 1.1constructalgebra

Fix an arbitrary smooth ambient chart ψ:O→V⊆R4r, a point q=i(x0)∈O, and a nonzero chart covector η0 with D(ψ∘i)(x0)Tη0≠0. Put f=ψ∘i on i−1(O). By continuity, there are a relatively compact neighborhood B of x0, an open cone C about η0, and c>0 such that ∣Df(x)Tη∣≥c∣η∣ on B‾×C. Indeed the left side divided by ∣η∣ is continuous in x and η/∣η∣ and positive at (x0,η0/∣η0∣); restrict to a small closed ball and a small closed spherical cap contained in that positive neighborhood. Choose χ∈Cc∞(V) equal to one near ψ(q), with i−1(ψ−1(supp⁡χ))⊂B. Such a localization is obtained by taking a sufficiently small chart ball inside ψ(O∩{X:xr∈B}). Smooth plateaus in nested balls follow explicitly from H(t)=0 for t≤0, H(t)=e−1/t for t>0: for radii 0<b<R, the ratio H(R2−∣y−y0∣2)/(H(R2−∣y−y0∣2)+H(∣y−y0∣2−b2)) is one on the smaller ball and zero outside the larger, and is smooth because all derivatives of H at zero vanish. No family of charts or localizations is selected. In the test-density convention underlying [F1]–[F2], put Jψ(X)=∣det⁡Dψ(X)∣. For a summand u from step 1.1 its chart Fourier pairing is ⟨uψ,χ(y)e−2πiy⋅η∣dy∣⟩=∫a(x)∂Xα ⁣[Jψ(X)χ(ψ(X))e−2πiη⋅ψ(X)]∣X=i(x)d4x. Here ∂Xα denotes the finite ambient derivative from step 1.1. The absolute Jacobian is smooth since the chart determinant never vanishes. Repeated product and chain rules make this a finite sum ∫Aβ(x,η)e−2πiη⋅f(x)d4x, where each amplitude is a polynomial in η of degree at most m:=∣α∣, with smooth coefficients supported in one compact K⊂B. The coefficients include every derivative of the Jacobian, localization and chart map. Consequently, for every integer k≥0, their derivatives satisfy max⁡∣γ∣≤ksup⁡x∣∂xγAβ(x,η)∣≤Ck(1+∣η∣)m. This follows by bounding the finitely many coefficient derivatives on K; no bound on a varying test function is asserted.

3.1F2step 2.1algebra

For η∈C, ∣η∣≥1, set Φη(x)=η⋅f(x), bη=∇Φη/∣∇Φη∣2, and Lη=−(2πi)−1bη⋅∇x. Then Lηe−2πiΦη=e−2πiΦη. Every derivative of ∇Φη is bounded by a constant times ∣η∣ on B‾, while its squared norm is at least c2∣η∣2. Differentiating the quotient therefore gives sup⁡B‾∣∂xγbη∣≤Cγ∣η∣−1: equivalently write bη=∣η∣−1bη/∣η∣, and differentiate the smooth rational expression on the compact base ball and closed spherical cap where its denominator is bounded below. The transpose for the bilinear integral is LηtA=(2πi)−1div⁡(bηA). Compact support of each amplitude eliminates boundary terms, so N integrations by parts give ∫Aβe−2πiΦη dx=∫(Lηt)NAβ e−2πiΦη dx,∣∫Aβe−2πiΦη dx∣≤CN∣η∣m−N. For completeness, induction on N expands (Lηt)NAβ into finitely many terms, each a derivative of Aβ of order at most N times N factors that are derivatives of components of bη of orders at most N. The bounds of step 2.1 and the preceding quotient bounds give the estimate, and integration over a fixed rectangle containing K supplies its finite volume factor. Integration by parts itself follows componentwise from the ordinary product rule and the fundamental theorem on that rectangle, with zero boundary products. For ∣η∣≤1 the original finite polynomial amplitudes give a uniform integral bound directly. Given any requested decay power p, choose a finite integer N≥p+max⁡∣α∣ over the finitely many kernel terms; the finite sum of all kernel terms then has (1+∣η∣)p times its localized Fourier pairing bounded throughout C.

4.1F2F4step 1.1step 3.1algebra

If q∉Δr, a localization disjoint from the closed diagonal makes the kernel zero by step 1.1. At a diagonal point, steps 2.1–3.1 exclude every chart direction for which Df(x0)Tη≠0. The intrinsic covector represented by η is ξ=DψqTη; the ordinary chain rule gives Df(x0)Tη=Dix0Tξ=∑jξj. Thus, in every arbitrary ambient chart, the only possible singular directions annihilate the tangent to the diagonal. Taking the all-chart union in [F4]'s wavefront convention therefore proves precisely WF⁡(F(r)(ϕ))⊆N∗Δr∖0. No chart-invariance theorem is invoked. For r=1, i is the identity and Dψ is invertible, so every nonzero direction has been excluded and the wavefront set is empty.

5.1F1F3F4step 4.1algebra∎

At a diagonal point, if ξ1,…,ξr are all future causal, their metric-dual time components have the same weak sign, and each nonzero causal covector has a strictly nonzero time component. Hence ∑jξj=0 forces every ξj=0; the same holds for the past cone. Step 4.1 therefore excludes every nonzero tuple in the forbidden cones of [F3]. The finite Taylor expansion of the original polynomial at ϕ=0 gives its symmetric compact coefficient kernels fm=F(m)(0)/m! (and its constant term), so it is also a polynomial functional in the kernel sense of [F3]. Its derivative kernels have the conormal bound just proved for every smooth ϕ and every r≥1. This proves the asserted membership in Fμcpoly(M). All localizations, finite expansions and integrations above were constructed for a fixed chart and direction; this proof adds no choice principle.

Remarks

The proof uses the thin-diagonal support of local functional derivatives and the pointedness of each Minkowski causal cone. It does not impose the free field equation on ϕ.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Balanced jets give unique local functional representatives

Statement

Assume Countable Choice. Set η=diag⁡(−1,1,1,1) and let SO+(1,3) consist of the matrices Λ∈GL4(R) satisfying ΛTηΛ=η, det⁡Λ=1, and preserving the future cone {v∈R4:v0≥∣v∣}. For a∈R4 and Λ∈SO+(1,3), let γ be the affine map x↦Λx+a and define (γ⋅ϕ)(x)=ϕ(Λ−1(x−a)),(γ⋅F)(ϕ)=F(γ−1⋅ϕ). Complex conjugation is F∗(ϕ)=F(ϕ)‾.

For field degree r≥1, let p1,…,pr∈R4 be formal commuting derivative variables, put P=∑apa and qa=pa−P/r, and let Br be the vector space of permutation-invariant polynomials in the qa, subject to ∑aqa=0. A balanced degree-r jet polynomial is Bb(ϕ)(x)=b(∂x1,…,∂xr)∏a=1rϕ(xa)∣x1=⋯=xr=x,b∈Br. Thus only relative derivative combinations occur in b. Choose a real homogeneous basis of each finite-degree part of Br. Every off-shell compactly supported local polynomial functional has a unique expression F(ϕ)=c+∑r≥1∑b∫fr,b(x)Bb(ϕ)(x) d4x, with c∈C, fr,b∈Cc∞(R4;C), and only finitely many nonzero coefficients. The union of the supports of these coefficient functions equals the functional support, apart from the constant c, whose support is empty. With each pa viewed as a column of coordinate derivative components, the induced Lorentz substitution is pa↦ΛTpa, so P and all qa transform by the same linear map. The balanced decomposition is equivariant for the translation/Lorentz action and complex conjugation specified above.

Distribution-valued multilinear coefficients prescribed linearly on balanced labels extend consistently to all polynomial jet labels by imposing, in each vertex entry, K(…,∂μA,…)=∂xiμK(…,A,…). After smearing, integration by parts therefore makes the resulting maps independent of the chosen local density presentation. Differentiation adds only a finite derivative order to any finite scaling upper bound.

Facts & Assumptions

Given: The off-shell polynomial class and the derivative-variable conventions in the Statement.

[A1]

Assume Countable Choice The Axiom of Countable Choice (ACω) for the Fourier inversion supplier.

[F1]

Off-shell local polynomial scalar functionals defines actual smooth off-shell configurations, finite polynomial jets, compact coefficient supports, functional support and intrinsic variational kernels.

[F2]

Fourier inversion on Schwartz space gives injectivity of the Fourier transform on compact smooth coefficient functions under [A1].

Proof

Given: [A1], [F1]–[F2] and the Statement's conventions.

1.1F1algebraconstruct

Polarize each homogeneous field-degree-r jet polynomial into r field slots. Commutativity of the scalar fields identifies it with a polynomial in the formal derivative variables pa, invariant under slot permutations. The invertible linear change pa=qa+P/r identifies the full polynomial algebra with C[P]⊗C[q1,…,qr]/(∑aqa). Slot permutations fix P and act only on the relative factor. Expanding in the independent monomials of P, invariance holds if and only if every relative coefficient is invariant. Thus the invariant space is exactly C[P]⊗Br. In each finite degree choose a basis by ordinary finite Gaussian elimination on the real coefficient polynomials; the monomial ordering gives compatible choices across degrees. The Leibniz rule identifies multiplication by Pμ with the total derivative ∂μ of the local field polynomial. This is a direct tensor decomposition, so has no hidden relations between total and balanced derivatives.

2.1A1F1F2step 1.1algebra

Expand a density using step 1.1 as a finite sum p(∂)Bb. In its integral against f, move p(∂) onto the compact coefficient by integration by parts, obtaining p(−∂)f multiplying Bb. This gives existence of the displayed representation and preserves compact support. Degree zero gives the scalar c=F(0) and is separated from the positive field degrees. To prove uniqueness, suppose a balanced expression represents zero. Separate its field degrees by replacing ϕ by tϕ, polarize, and evaluate its r slots on the smooth exponential fields e2πika⋅x; complex exponentials are permitted by complex multilinear extension from real configurations. The resulting identity is a finite sum of f^r,b(−∑aka) times the balanced polynomial b(2πik1,…,2πikr). For fixed total momentum, vary freely the relative momenta. Independence of the basis polynomials on ∑aqa=0 makes every coefficient Fourier transform zero at that total momentum. Since that momentum is arbitrary, [F2] gives every fr,b=0; also c=0.

3.1F1step 1.1step 2.1algebra

The same uniqueness is local. In center and relative coordinates for the polarized variational kernel on the thin diagonal, balanced differential operators differentiate only the relative delta variables; their coefficients are the fr,b in the center variable, up to fixed nonzero coordinate constants. Test with a center test times a relative monomial times a cutoff equal to one near the relative origin. Starting at the highest relative order and descending isolates every independent relative delta-jet coefficient. Thus vanishing of the kernel over an open center set forces each fr,b to vanish there. If F is unchanged by all variations supported in an open set U, its polarized kernels vanish where any one field slot lies in U; near their thin diagonal this is precisely the preceding situation. Conversely, if every coefficient vanishes on U, no variation supported in U changes F. This proves equality with the functional support. Under the action defined in the Statement, a Lorentz transformation substitutes pa↦ΛTpa and transforms each coefficient by f(x)↦f(Λ−1(x−a)); det⁡Λ=1 preserves d4x. Thus P and all qa transform by the same linear map and the tensor decomposition is preserved. Translations act on coefficients by the same formula with Λ=I, and, because the chosen basis is real, complex conjugation sends each coefficient to its complex conjugate. Hence the decomposition is equivariant as stated.

4.1F1step 1.1step 2.1step 3.1algebra∎

For a general polynomial label write its unique tensor decomposition as ∑β,bcβ,b∂βBb, and define its coefficient by ∑β,bcβ,b∂xiβK(…,Bb,…), independently in every entry. Commutativity of coordinate derivatives and the direct decomposition in step 1.1 make this consistent, linear, and the unique extension satisfying the displayed derivative identity. Smearing and integrating by parts gives exactly the coefficient normal form of step 2.1, so equivalent functional presentations yield the same map. The construction respects the equivariance and support statements of step 3.1. Finally, dilation of a distributional derivative gives (∂βT)ρ=ρ−∣β∣∂βTρ, so the added derivative increases a scaling upper bound by at most ∣β∣. All sums and derivative orders here are finite.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Positive scaling bounds for products transverse at the scaling center

Statement

Assume the Axiom of Choice and Countable Choice. Let D,r≥1 be integers, let u1,…,ur be distributions on a neighborhood of 0∈RD, already defined at 0, and let aj≥0 be finite real numbers such that sd⁡0(uj)≤aj. Here scaling tests may include the origin. Put Cj={ξ≠0:(0,ξ)∈WF⁡(uj)}. Suppose ξj∈Cj∪{0},∑j=1rξj=0⟹ξ1=⋯=ξr=0. Then ∏j=1ruj is defined on a sufficiently small neighborhood of 0 and sd⁡0 ⁣(∏j=1ruj)≤∑j=1raj. The condition is imposed at the scaling center, including the wavefront covectors of the already extended factors there; transversality only on a punctured set is insufficient for this conclusion.

Facts & Assumptions

Given: The distributions, nonnegative finite upper bounds and joint no-cancellation hypothesis in the Statement.

[A1]

Assume the Axiom of Choice The Axiom of Choice and Countable Choice The Axiom of Countable Choice (ACω). The published theorem AC implies DC implies countable choice proves in ZF that AC implies Dependent Choice, so its conclusion supplies the DC hypothesis of the Baire theorem in step 1.1. Countable Choice supplies the Fourier inversion clauses.

[F1]

Scaling degree and local extension space defines uρ(φ)=ρ−Du(φ(⋅/ρ)) also for distributions defined at the origin.

[F3]

Local Fourier definition of a wavefront set defines regular cones by rapid decay of localized Fourier transforms; Product and pullback under wavefront transversality gives localization, Fourier convolution, and products under the no-cancellation condition.

[F4]

Fourier transform of a compactly supported distribution is a smooth polynomially bounded multiplier gives polynomial Fourier bounds and differentiation in frequency for compactly supported distributions.

[F5]

Fourier transform acts continuously on Schwartz space and Fourier inversion on Schwartz space give the continuous Schwartz Fourier transform and its inverse, used below also by transposition on tempered distributions.

[F6]

Test function cutoffs and euclidean localization supplies smooth compact cutoffs and smooth partitions subordinate to finite chart covers.

Proof

Given: [A1], [F1]–[F6] and the Statement's hypotheses.

1.1A1F1F2F6construct

Fix one factor u and a positive exponent s>max⁡(0,sd⁡0(u)). Multiply u by a compact cutoff equal to one near zero and denote the result by v. Multiplication by this cutoff preserves the scaling upper bound: the tests acquire the factor ψ(ρx), a bounded smooth family on every fixed compact, and the uniform estimate established next applies to it. For any fixed compact test support K, the continuous linear functionals Lρ=ρsvρ, 0<ρ≤T<∞, are pointwise bounded: convergence at zero follows from [F1], and away from zero the dilation tests vary continuously on compact scale intervals. To justify the uniform estimate without assuming it, apply [F2] first to ρsuρ on a compact containing all small-scale supports. The closed sets EN={φ:sup⁡ρ∣Lρ(φ)∣≤N} cover the fixed-support space. One has interior, so subtracting two elements of that interior and rescaling gives ∣Lρ(φ)∣≤Cpm(φ) uniformly in ρ, with pm=max⁡∣α∣≤m∥∂αφ∥∞. The same argument then applies to v and to every fixed compact scale interval.

1.2F3F4F5F6givenconstruct

Choose slightly enlarged closed frequency cones Kj around the Cj such that the joint no-cancellation condition still holds for the Kj. This is possible by compactness of tuples with ∑j∣ξj∣=1: the set of tuples in ∏j(Cj∪{0}) is compact there and its sum stays away from zero. If Cj is empty use the empty cone. Closedness of the wavefront set permits localization to a sufficiently small common neighborhood so that all singular directions of each localized vj lie strictly inside Kj. Choose a smooth Fourier cutoff qj supported in Kj outside a bounded ball and equal to one around those singular directions at large frequencies. Then (1−qj)v^j is Schwartz. In fact [F3] gives rapid decay on its unbounded support, while each frequency derivative is a localized Fourier transform with a coordinate monomial inserted, so has the same regular-cone bounds by [F3]–[F4]. Bounded frequencies cause no problem. Thus vj=bj+cj, with bj Schwartz and the Fourier transform of cj supported in Kj together with a bounded ball.

2.1F1F5F6step 1.1algebra

The family Lρ=ρsvρ is uniformly bounded on Schwartz space by one Schwartz seminorm. Indeed, decompose a Schwartz test into a fixed ball and smooth dyadic annuli of radii R=2k≥1. On an annulus write φR(x)=θ(x/R)φ(x) with one fixed annular cutoff. Dilation gives ⟨ρsvρ,φR⟩=RD−s⟨(ρR)svρR,θ(y)φ(Ry)⟩. If supp⁡v⊂B(0,M), annuli with ρR>2M give zero, after increasing M to accommodate the fixed annular radii. For 0<ρR≤2M, step 1.1 on the one fixed annulus bounds this by CRD−s+m−LPm,L(φ), where Pm,L(φ)=max⁡∣α∣≤msup⁡x(1+∣x∣)L∣∂αφ(x)∣. Choose L>D−s+m+1; the geometric sum over R=2k is finite uniformly in ρ. The fixed ball is controlled by step 1.1. This proves ∣⟨Lρ,φ⟩∣≤C′Pm′,L′(φ) for fixed m′,L′,C′ independent of ρ. By transposition [F5] the Fourier transforms are likewise uniformly tempered.

3.1F1F3F4F5step 2.1step 1.2algebra

For sj>aj≥0, step 2.1 makes ρsj(vj)ρ uniformly tempered. The Schwartz part ρsj(bj)ρ is also uniformly tempered, since bj(ρx) and each of its derivatives are bounded uniformly for 0<ρ≤1, and its local smooth seminorms tend to zero. Consequently the Fourier family of ρsj(cj)ρ is uniformly tempered and supported in Kj together with a fixed bounded ball: dilation shrinks that ball in frequency. Let V be a closed cone disjoint from a slightly larger cone around Kj, and let χ be any fixed compact smooth test cutoff. Evaluate the localized Fourier transform by pairing this Fourier family with χ^(ξ−η) times a smooth cutoff equal to one on its support. On the unbounded conic support, separation gives ∣ξ−η∣≥c(∣ξ∣+∣η∣) for ξ∈V; on the bounded part use 1+∣ξ−η∣≥c′(1+∣ξ∣) for large ξ. Every Schwartz seminorm of this test kernel is therefore O((1+∣ξ∣)−N) for arbitrary N. The uniform tempered bound gives sup⁡0<ρ≤1sup⁡ξ∈V(1+∣ξ∣)N∣χρsj(vj)ρ^(ξ)∣<∞. The Schwartz part has the same estimate by integration by parts on the fixed support of χ. An intermediate exponent between aj and sj even makes each displayed seminorm tend to zero. Ordinary weak convergence follows from [F1]. Since vj=uj near zero, every fixed output localization uses these same dilates for all sufficiently small ρ. This proves the required directional control rather than inferring it from pointwise wavefront inclusion of the rescaled family.

4.1F1F3F4F5step 1.1step 1.2step 3.1algebra∎

Shrink the cones and localization neighborhoods as in step 1.2, retaining a little angular margin. The product exists there by [F3], iterated over the finitely many factors. For a fixed compactly supported test φ, its pairing with the product of the localized scaled factors is the absolutely convergent Fourier integral of φ^(−∑jηj) times the factor transforms. Here is a uniform integrable bound. Compactness of normalized frequency tuples and the joint no-cancellation condition imply that either ∣∑jηj∣≥c∑j∣ηj∣, or some ηj lies in a regular cone and ∣ηj∣≥c∑k∣ηk∣, for a fixed c>0, apart from bounded frequencies. In the first region the Schwartz decay of φ^ controls the total frequency size; in the second region step 3.1 supplies arbitrarily high decay from that factor. All other localized factor transforms have fixed uniform polynomial bounds by step 1.1 and [F4]. Choosing the decay power larger than the total polynomial degree plus Dr+1 gives an integrable majorant independent of ρ. Each localized factor transform tends pointwise to zero by weak convergence. Dominated convergence therefore proves ρ∑jsj∏j(uj)ρ→0. Dilation commutes with the locally defined product by the pullback formula [F3], so this is precisely the scaling estimate for the product. Let every sj decrease to aj to obtain the claimed bound.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Local scalar time-ordered product contract

Definition

Let M=R4 have metric η=diag⁡(−1,1,1,1), orientation dx0∧dx1∧dx2∧dx3, and future direction given by increasing x0. Use units c=1, so a mass parameter has inverse-length units. Define x∈J+(y) by x0−y0≥∣x−y∣ and x∈J−(y) by y0−x0≥∣y−x∣; for A⊆M, put J±(A)=⋃y∈AJ±(y). A field configuration is any smooth real function ϕ; it is off shell because no field equation is imposed. The allowed local interactions are compactly supported finite polynomial functionals of ϕ and finitely many coordinate derivatives, integrated against d4x. The support of a functional F is the closed set of points each of whose neighborhoods contains the support of a compactly supported variation that changes F for some configuration.

For Λ∈SO+(1,3), require ΛTηΛ=η, det⁡Λ=1, and preservation of the chosen future cone; SO+(1,3) denotes this identity component. The proper orthochronous Poincare group consists of γ=(a,Λ) with a∈M and Λ∈SO+(1,3). It acts by (γ⋅ϕ)(x)=ϕ(Λ−1(x−a)) and (γ⋅F)(ϕ)=F(γ−1⋅ϕ).

For a distribution on a coordinate chart, its wavefront set consists of the nonzero cotangent directions where every compact localization fails to have a rapidly decreasing Fourier transform in every conic neighborhood. Covectors are future or past causal when their metric-dual vectors are causal with the indicated time orientation; a nonzero causal covector has a nonzero time component. Write Δ={(x,x):x∈M} and N∗Δ={(x,ξ;x,−ξ):ξ≠0}. Write (x,ξ)∼(y,ζ) when both covectors are nonzero null and cotangent to the same null straight line, with parallel transport carrying ξ to ζ. Precisely, for x≠y there must be a future-directed nonconstant affinely parametrized null straight line γ and parameters s,t in either order with x=γ(s), y=γ(t) and a real λ≠0 such that ξ=λη(γ˙(s),⋅) and ζ=λη(γ˙(t),⋅). When x=y, require ξ=ζ and allow every nonzero null covector. This relation is unsigned: the future first-covector condition below selects λ>0, while the Feynman past branch selects λ<0. A fixed free scalar input consists of m≥0, a two-point distribution W satisfying PxW=PyW=0,P=−ηab∂a∂b+m2, and the positive-frequency null wavefront condition WF⁡(W)=C+:={(x,ξ;y,−η):(x,ξ)∼(y,η), ξ future null}. For a two-point distribution U, set UT(x,y)=U(y,x) and let U∗ be complex conjugation. Assume W is invariant under translations and SO+(1,3), satisfies W−WT=iE for a fixed distribution E supported where x−y is causal, and satisfies W∗=WT.

The prescribed scalar time-ordered contraction input is a symmetric distribution HF∈D′(M2) invariant under translations and SO+(1,3), equal to W(x,y) on the open set x0>y0 and to W(y,x) on y0>x0. The two prescriptions agree on spacelike-separated open supports because E is supported on causal pairs. Translation invariance gives HF(x,y)=hF(x−y) and W(x,y)=w(x−y). For a distribution T on R4, set Tρ(φ)=ρ−4T(φ(⋅/ρ)) and define sd⁡0(T) as the infimum of real ω for which ρωTρ→0 on each fixed test as ρ↓0. Require sd⁡0(hF),sd⁡0(w)≤2 and WF⁡(HF)⊆ΓF:=N∗Δ∪{(x,ξ;y,−η):x≠y, (x,ξ)∼(y,η), ξ future null if x∈J+(y), ξ past null if x∈J−(y)}. This is fixed conditional data: it does not claim existence of W or HF, and it does not define any singular restriction or product of HF on a diagonal.

For r≥1, F(r)(ϕ) denotes the distribution kernel on Mr of the mixed variation in r compactly supported smooth directions, and set F(0)(ϕ)=F(ϕ). Define deg⁡F as the largest positive r with F(r)≠0, or 0 if all positive-order derivative kernels vanish; in particular deg⁡0=0. The class Fμcpoly(M) consists of finite polynomial functionals with compactly supported derivative kernels such that every nonzero wavefront tuple of each derivative kernel avoids both the cone of tuples whose entries are all future causal and the cone of tuples whose entries are all past causal; zero entries in either cone are allowed. For F,G in this class, define F⋆WG=∑r=0min⁡(deg⁡F,deg⁡G)ℏrr!⟨F(r)(ϕ)⊗G(r)(ϕ),W⊗r⟩, using distribution products and pushforwards under the stated wavefront transversality conditions, with the r=0 pairing interpreted as the pointwise product F(ϕ)G(ϕ). Here ℏ is a formal indeterminate, and Countable Choice is assumed for the supplier theorem defining these contractions.

A scalar time-ordered system is a sequence of symmetric multilinear maps Tn:(Flocpoly(M))n⟶Fμcpoly(M)⟦ℏ⟧,T0=1,T1=id⁡. For I⊆{1,…,n} put SI=⋃i∈Isupp⁡Fi and FI=(Fi)i∈I. Causal factorization requires Tn(F1,…,Fn)=T∣I∣(FI)⋆WT∣Ic∣(FIc) for every nonempty proper I such that SI∩J−(SIc)=∅; an empty block is the unit.

Field independence means that each numerical graph distribution is independent of the background field ϕ; all ϕ-dependence enters through the vertex kernels Fi(r)(ϕ). In the graph expansion of Tn, vertices are labeled by 1,…,n and an edge between distinct vertices contracts one derivative slot at each endpoint by HF. A graph is a finite loopless multigraph, so parallel edges are allowed; if rij edges join vertices i and j, the Wick coefficient for that choice includes ℏ∑i<jrij/∏i<jrij!. Finite-order local jet derivatives may act on incident edge kernels. Each coefficient is a finite sum of such contractions, since every input has finite polynomial degree. No graph term uses a singular product at a diagonal before extension.

For n≥2, use relative coordinates zi=xi−xn (1≤i<n), so the total diagonal corresponds to 0∈R4(n−1). The relative scaling degree δΓ of a numerical graph distribution is defined by the same positive-dilation rule above in this relative dimension. The scaling condition is imposed compatibly with integration by parts in the local functionals. First write every local density in its unique balanced-jet representative, in which the derivative variables at a degree-r vertex are the relative combinations qa=pa−r−1∑bpb. At the extension stage, numerical coefficients on independent balanced labels admit extensions across the total diagonal preserving their actual scaling degree; the final normalization conditions below are imposed within the engineering upper bounds. General jet labels are recovered by total coordinate differentiation of the already extended full coefficients and by linearity; this includes differentiation of the remaining field jets. For a primitive differentiated graph the required upper scaling bound is the engineering degree BΓ=2∣E(Γ)∣+∑e∣αe∣. For a graph containing proper subgraphs, use a finite upper bound obtained by causal block induction from the edge degrees and the finite derivative orders of the chosen lower-order local counterterms; total derivatives add their orders to that bound. Any two extensions of a fixed punctured coefficient with upper bound BΓ differ by derivatives ∂βδ0 of order ∣β∣≤⌊BΓ−4(n−1)⌋ when BΓ≥4(n−1), and agree when BΓ<4(n−1). The allowed counterterms must also satisfy the stated linearity and derivative identities. Precisely, for an independent balanced punctured coefficient t∈D′(Rd∖{0}), d=4(n−1), of actual degree δ=sd⁡0(t)∈R, its degree-preserving extension family is Eδ(t)={T∈D′(Rd):T∣Rd∖{0}=t, sd⁡0(T)=δ}. For this family, δ replaces BΓ in the ambiguity bound. If sd⁡0(t)=−∞, degree preservation means sd⁡0(T)=−∞ and the ambiguity is zero. The analytic extension stage means this distribution-theoretic extension step; the contract imposes no additional dependence on a complex regularization parameter. A differentiated coefficient is not required to retain the exact scaling degree of a punctured linear combination that vanishes: total differentiation may force a contact term at the diagonal.

Covariance requires Tn(γ⋅F1,…,γ⋅Fn)=γ⋅Tn(F1,…,Fn) for each proper orthochronous Poincare transformation. Fix the Lorentz Lie-algebra convention [Ji,Jj]=ϵijkJk, [Ji,Kj]=ϵijkKj, and [Ki,Kj]=−ϵijkJi. For a formal coupling g, define coefficientwise Sg(V)=∑n=0∞(ig/ℏ)nn!Tn(V,…,V). The anti-time-ordered series is S‾g(V):=Sg(V)∗, where the involution conjugates scalar coefficients, fixes real g,ℏ, and reverses the order of factors; W∗=WT gives (F⋆WG)∗=G∗⋆WF∗. Formal unitarity requires S‾g(V)⋆WSg(V)=1 for every real V=V∗. At each g-order, coefficients are finite Laurent polynomials in ℏ before cancellation and are compared algebraically; there is no analytic convergence, positivity of formal coefficients, adiabatic limit, or gauge/Ward identity in this contract.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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 V={1,…,n}, n≥2, parallel edges allowed, and a finite multi-index derivative αe on each edge e. In this lemma a vertex subgraph is always the induced multigraph Γ[S] on a subset S⊆V: it retains all edges of Γ whose two endpoints lie in S, with their multiplicities and derivative labels. The associated partial diagonal is ΔS={(xi)i∈V∈(R4)V:xi=xj for all i,j∈S}; its codimension is 4(∣S∣−1), and ΔV is the total diagonal. Put i0=min⁡S and use (xi−xi0)i∈S∖{i0} as relative coordinates on the quotient by simultaneous translations. The scaling degree at ΔS means the scaling degree at the origin in these relative coordinates, using positive dilations as in the scaling-degree definition. For ∣S∣≥2, let tΓ[S] be the numerical coefficient on the complement of its total diagonal after the coefficients for all strictly smaller vertex subsets T⊊S, ∣T∣≥2, have been extended across their partial diagonals. Call Γ[S] divergent exactly when sd⁡0(tΓ[S])≥4(∣S∣−1); 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 S⊊V with ∣S∣≥2, the coefficient tΓ[S] 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 ∣S∣. Then the numerical graph distribution tΓ on the complement of the total diagonal has a finite upper scaling bound in the 4(n−1) relative coordinates. For a primitive graph, the bound is sd⁡0(tΓ)≤2∣E(Γ)∣+∑e∈E(Γ)∣αe∣. 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.

Facts & Assumptions

Given: A finite graph Γ, the scalar contraction kernels W,HF with relative scaling degree at most 2, finite edge derivative orders, and the lower-order translation-invariant graph extensions in the Statement.

[A1]

Assume the Axiom of Choice The Axiom of Choice for scaling-degree extensions and Countable Choice The Axiom of Countable Choice (ACω) for Fourier and product inputs.

[F1]

Local scalar time-ordered product contract fixes the translation-invariant kernels W(x,y)=w(x−y) and HF(x,y)=hF(x−y), their scaling bounds, the positive-frequency wavefront set of W, causal factorization, and the finite graph convention. On a causal split, a cross-block HF edge agrees with W oriented from the later block to the earlier block.

[F2]

Scaling degree and local extension space defines relative positive dilations and their scaling degree, including scaling for distributions already defined at the origin.

[F3]

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.

[F4]

Positive scaling bounds for products transverse at the scaling center: distributions already defined at the scaling center, with nonnegative upper scaling bounds aj and joint no-cancellation there, have a product of scaling degree at most ∑jaj.

[F5]

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.

[F6]

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

technique · causal block induction with transversality at the full scaling center

Given: [A1], [F1]–[F6] and the lower-order extensions in the Statement.

1.1F1F2F3algebra

Differentiation adds at most its order to a scaling upper bound: ⟨(∂αT)ρ,φ⟩=(−1)∣α∣ρ−∣α∣⟨Tρ,∂αφ⟩. A surjective linear pullback does not increase that bound: in coordinates (y,z) with y=Lx, L∗T=T(y)⊗1(z), and integration of a test in z 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 ∑iξi=0: 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 ∂αeW(xi,xj) has upper scaling bound 2+∣αe∣, while every lower-order block kernel has covectors whose sum within its block is zero.

2.1F1F3F4step 1.1constructalgebra

Fix a nontrivial partition I∣J of the vertices. The extended subgraph kernels tI and tJ 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 bI,bJ. Their covector tuples occupy disjoint blocks, so their product is their tensor product and [F4] bounds its degree by bI+bJ. A one-vertex block contributes the constant kernel and bound zero. Multiply this tensor product by all cross-edge kernels oriented as ∂αeW(xi,xj) with i∈I,j∈J. At a full-diagonal point every nonzero wavefront contribution from a cross edge places a future null covector at i and its negative at j. If the sum of all factor covectors were zero, summing its entries over I 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 W has the same orientation everywhere.

3.1F1F3F4step 1.1step 2.1algebra

By [F3] and step 2.1 the causal block expression BI=tI⊗tJ∏e=(i,j), i∈I, j∈J∂αeW(xi,xj) is a distribution even at the full diagonal. Apply [F4] there and step 1.1 to obtain the finite upper bound sd⁡0(BI)≤bI+bJ+∑e crossing I∣J(2+∣αe∣). All factors are already defined at the center where [F4] is used. This argument requires no product of coincident HF factors and no directional property of an arbitrary unextended punctured-stratum product. Translation invariance makes the full-coordinate estimate exactly the relative-coordinate estimate.

4.1F1F2F3F6step 3.1constructalgebra

The causal split sets CI={xi∉J−(xj):i∈I,j∉I} 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 fI there, subordinate to the cover, and extend it homogeneously by fI(ρz)=fI(z) to punctured relative space. On CI, [F1] and lower-order causal factorization identify the graph coefficient with BI. 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 W=WT. Hence the graph distribution is tΓ=∑IfIBI off zero. For a fixed punctured test φ, each fIφ is a fixed smooth compactly supported punctured test; homogeneity gives (fIBI)ρ(φ)=(BI)ρ(fIφ). The finite sum therefore has the maximum of the finite bounds in step 3.1.

5.1A1F2F5step 1.1step 2.1step 3.1step 4.1algebra∎

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 bI=∑e internal to I(2+∣αe∣) for a block I, and likewise for J. 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 sd⁡0(tΓ)≤2∣E(Γ)∣+∑e∣αe∣. 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.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Scalar Epstein–Glaser induction at finite perturbative order

Statement

Assume the Axiom of Choice and Countable Choice. Fix any admissible flat scalar free datum and local scalar polynomial class as defined by the local time-ordered product contract. Then there exists a sequence of symmetric multilinear maps Tn satisfying that contract at every finite perturbative order. At order n, each numerical graph distribution has a finite upper scaling bound in the 4(n−1) relative coordinates. At the analytic extension stage, independent balanced coefficients admit extensions preserving their actual scaling degree; total-derivative labels and the final local normalizations obey the engineering scaling upper bounds prescribed by the contract. For a fixed punctured coefficient with bound BΓ, the extension ambiguity is contained in the finite span of derivatives of the diagonal delta distribution of order at most ⌊BΓ−4(n−1)⌋ when BΓ≥4(n−1), and is zero when BΓ<4(n−1), subject also to the linearity and derivative identities. For the analytic degree-preserving extension family of an independent balanced coefficient, one can use its actual degree in place of BΓ. Thus the coefficients form a formal series only; no convergence in the coupling, adiabatic limit, positivity claim, or gauge/Ward identity is asserted.

Facts & Assumptions

Given: The admissible scalar data, finite-jet local functionals, and causal/time-ordering conventions of the definition.

[A1]

Assume the Axiom of Choice The Axiom of Choice and Countable Choice The Axiom of Countable Choice (ACω). AC is used in the finite-scaling-degree extension theorem and for recursive choices; it also implies dependent choice by AC implies DC implies countable choice.

[F1]

Local scalar time-ordered product contract: the free scalar datum fixes W, causal E, the time-ordered kernel HF with sd⁡0(HF)≤2, the ⋆W product, the graph convention, covariance and the formal unitarity contract.

[F2]

Off-shell local polynomial scalar functionals and Local polynomial functionals are microcausal: every input is a finite polynomial in a finite jet of an unconstrained smooth scalar field, and every local derivative kernel is compactly supported on the thin diagonal and is microcausal.

[F3]

Hadamard contractions preserve microcausal polynomial functionals: ⋆W is defined coefficientwise on the stated microcausal polynomial class by finitely many Hadamard contractions and preserves that class. Separately, Local scalar time-ordered product contract assumes W−WT=iE for a fixed E supported on causal pairs; this is a premise of the free datum, not a conclusion of the contraction lemma.

[F4]

Product and pullback under wavefront transversality: if opposite wavefront covectors are absent, the distribution product, diagonal pullback and the stated proper pushforward exist with the displayed wavefront bounds.

[F5]

Test function cutoffs and euclidean localization: every open cover of an open Euclidean set has a locally finite smooth partition of unity subordinate to that cover.

[F6]

Scalar graph coefficients have finite upper scaling bounds: a vertex subgraph on S is induced and retains all edges with both endpoints in S; its partial diagonal is ΔS={xi=xj:i,j∈S}, of relative codimension 4(∣S∣−1). It is divergent when its relative scaling degree is at least that codimension, and a graph is primitive when it has no proper divergent vertex subgraph. After these proper partial diagonals have been resolved at lower orders, every finite graph numerical distribution has a finite upper scaling bound at the remaining total diagonal, from full-center transverse causal block products.

[F7]

Scaling degree and local extension space and Every finite-scaling-degree punctured distribution has an exact-degree extension: in relative dimension d, a punctured distribution of finite real scaling degree δ has an extension of exactly degree δ under AC.

[F8]

Point-extension counterterms form a finite delta-jet space: same-degree extensions differ by a finite sum of ∂αδ0 with ∣α∣≤⌊δ−d⌋ for δ≥d, and agree uniquely for δ<d. The same point-support proof bounds the difference of two upper-degree-B extensions by order ⌊B−d⌋, since a nonzero point-supported sum of largest order k has degree d+k.

[F9]

Finite-dimensional Lorentz normalization cocycles split: every Lie-algebra 1-cocycle of the finite-dimensional Lorentz normalization module is a coboundary.

[F10]

Distributions supported at one point: a distribution supported at the relative origin is a finite sum of delta derivatives. A nonzero such sum has scaling degree d+m, where m is its largest nonzero derivative order, by testing against a matching monomial times a cutoff.

[F11]

Balanced jets give unique local functional representatives: every local functional has a unique finite balanced-jet representative, supported in its actual functional support; the statement specifies the proper-orthochronous Poincare action on fields and functionals and proves equivariance of the balanced decomposition. Extensions prescribed on balanced labels extend consistently to general jet labels by differentiation and integration by parts.

Proof

technique · direct induction on the number of local insertions, followed by finite local normalization

Given: [A1] and [F1]–[F12].

1.1givenF1F11construct

Set T0=1 and T1=id⁡, as required. Use the unique balanced representative [F11] in every positive field-degree entry; a constant entry is interpreted as the corresponding scalar times the lower multilinear map, consistently with its empty functional support. Perform the extension construction below first on balanced labels. Prescribe numerical coefficients at zero field on these labels and recover their total derivatives using [F11]. Reconstruct the full field dependence only by the single field-shift prescription below; do not choose separate corrections for its remaining field powers. The numerical derivative identities and that prescription will establish independence of the density presentation. Assume Tk has been constructed with all contract properties for every k<n, where n≥2.

1.2F1constructalgebra

In Mn let Δn={x1=⋯=xn}. For every nonempty proper I⊂{1,…,n} define CI={(x1,…,xn):xi∉J−(xj) for all i∈I, j∉I}. Each CI is open because the Minkowski causal relation is closed. To see these sets cover Mn∖Δn, choose two distinct coordinates p,q in a configuration. The open cone of past-timelike covectors cannot annihilate the nonzero displacement p−q, so choose a past-timelike covector τ with τ(p)≠τ(q). Choose s strictly between these values and different from the finitely many τ(xj), and put I={j:τ(xj)>s}. The hyperplane τ(x)=s is spacelike, and τ is strictly increasing on every future causal curve. Thus no xi with i∈I can lie in J−(xj) for j∉I, so the configuration lies in CI.

1.3F1F2F6

Expand the finite local polynomial derivatives in the graph convention of [F1]. For each fixed n, finite jet order and finite polynomial degree allow only finitely many labeled multigraphs, and every edge derivative order is finite. By [F6], after the already constructed proper subgraph extensions, each numerical coefficient tΓ on the punctured relative space R4(n−1)∖{0} has a finite upper scaling bound and scaling degree δΓ<+∞.

2.1F1F2F3F4step 1.1

On CI, define the lower-order product TnI=T∣I∣(FI)⋆WT∣Ic∣(FIc). The factors are microcausal by [F2] and the inductive hypothesis, so [F3] makes the product well-defined; each contraction in its finite graph expansion uses only the pullbacks and distribution products supplied by [F4]. The graph-kernel restriction on this stratum is therefore a distribution, and no separate product at the total diagonal is taken here.

3.1F1F3step 1.1step 2.1algebra

If CI and CJ overlap, put A=I∩J, B=I∖J, C=J∖I, and D=(I∪J)c. The defining inequalities give A later than or spacelike to B, C later than or spacelike to D, A later than or spacelike to C, and B later than or spacelike to D. They also imply that every point of B is spacelike to every point of C: neither causal ordering is possible. Lower-order causal factorization rewrites both local expressions as TA⋆WTB⋆WTC⋆WTD; associativity follows by indexing each finite contraction term by its three pairwise contraction counts. Since E is causally supported, W=WT on the spacelike-separated supports of B,C, so locality gives TB⋆WTC=TC⋆WTB. Thus the two local expressions agree on the overlap, including empty blocks interpreted as units.

4.1A1F5step 1.2step 3.1construct

Apply [F5] to the open cover {CI} of Mn∖Δn, and use [A1] to assign each partition function to one cover member containing its support. The sum of the corresponding partition functions times TnI is locally finite and defines a distribution Tn0 on the complement of Δn. Step 3.1 makes it independent of the partition choice locally; the cover is permutation-invariant, so a finite permutation average gives a symmetric extension on this complement. It satisfies causal factorization there by construction.

5.1F1F2F3F11step 1.1step 4.1constructalgebra

For a fixed smooth real function h define the field shift (τhF)(ψ)=F(ψ+h) and the directional variation DhF(ψ)=ddsF(ψ+sh)∣s=0. Both preserve the local polynomial class, and supp⁡(τhF)⊆supp⁡F. In addition to the contract, maintain inductively DhTk(F1,…,Fk)=∑iTk(F1,…,DhFi,…,Fk) for every smooth h; compact input supports make this meaningful without compact support of h. It holds for k=0,1. The finite contraction formula makes Dh a derivation of ⋆W, since W is field independent and directional variations commute with every input variation. Hence the causal block products, and then their glued distribution Tn0, obey the same identity off Δn. Applying it along s↦Tn0(τshF1,…,τshFn)(ψ−sh) gives zero derivative, so Tn0(τhF1,…,τhFn)(ψ)=Tn0(F1,…,Fn)(ψ+h). All expressions are finite polynomials in s, so this reasoning is algebraic. Put νn0=Tn0∣ψ=0, meaning the numerical density-label distributions with smearings away from Δn. They determine the full punctured product by the preceding shift identity, and satisfy the numerical total-derivative identities because evaluation at zero commutes with coordinate differentiation. During extension and Lorentz normalization make choices only for this numerical family; graphwise it consists of the fully contracted coefficients. Constant entries are fixed by the lower maps as in step 1.1.

6.1A1F1F4F5F7F8F10F11F12step 1.3step 5.1construct

For each tΓ in relative dimension d=4(n−1), proceed as follows. If δΓ=−∞, choose a compact cutoff χ=1 near zero and use the no-subtraction dyadic series T(φ)=t((1−χ)φ)+∑k≥0t((χ(2k⋅)−χ(2k+1⋅))φ). Fix a compact annulus K⊂Rd∖{0} and a real ω<d. On the complete fixed-support test space DK, put Lρ(ψ)=ρω(tΓ)ρ(ψ). Since sd⁡0(tΓ)=−∞, for every ω there is a decay exponent η<ω, so Lρ(ψ)→0 for each fixed ψ. On every compact scale interval [ϵ,1] the scaled tests vary continuously in one fixed-support test space, so sup⁡0<ρ≤1∣Lρ(ψ)∣<∞. The closed sets EN={ψ:sup⁡ρ∣Lρ(ψ)∣≤N} cover DK. Completeness and Baire under DC, supplied by the already assumed AC, give ψ0∈DK, an integer m≥0, and a>0 with ψ0+{ζ:pm(ζ)<a}⊂EN for some positive integer N. Subtraction gives ∣Lρ(ζ)∣≤2N there; scaling ζ=aψ/(2pm(ψ)) yields ∣Lρ(ψ)∣≤(4N/a)pm(ψ) when pm(ψ)>0, while pm(ψ)=0 implies ψ=0. Hence ∣(tΓ)ρ(ψ)∣≤Cρ−ωpm(ψ) uniformly. This is the fixed-annulus Baire proof, with the arbitrarily negative decay exponent replacing the finite-real-degree hypothesis. Its kth shell is bounded by Cφ2−k(d−ω), proving convergence and continuity. For the scaled test ρ−dφ(⋅/ρ) only shells of radius λ≤Cφρ occur, and their sum is O(ρ−ω). The same series is independent of ω, so arbitrarily low ω prove degree −∞; telescoping on punctured tests proves it extends t. Otherwise [F7] applies with its finite real degree. Choose the extension linearly on a basis of the balanced labels, and extend its total-derivative labels by [F11]. For any fixed finite jet order this uses a finite-dimensional polynomial space; compatible bases over all finite orders give a linear extension on their algebraic union. The graph and derivative bounds remain finite because total differentiation adds only its finite order. Descendant coefficients obey these engineering upper bounds, including any forced contact terms, rather than an incompatible requirement to preserve the exact degree of a vanished punctured derivative combination. The extension has degree δΓ on each freely extended balanced graph coefficient. For the independent balanced coefficients of finite real degree [F8] gives the stated finite-jet ambiguity; for degree −∞, [F10] implies uniqueness because a nonzero difference supported at zero would have degree at least d. Lift the chosen relative extension back to Mn by translation: in coordinates zi=xi−xn and y=xn, pair the relative distribution with z↦∫MΨ(y+z1,…,y+zn−1,y) d4y. The inner function is a compactly supported smooth test by differentiation under a compact integral. This defines a translation-covariant distribution extending the off-diagonal coefficient. Apply these extensions to the numerical family νn0 from step 5.1, obtaining a multilinear map νn1 from actual local functionals to C⟦ℏ⟧. Its density-label kernels satisfy the numerical derivative identities by construction; thus [F11] makes it well-defined on the quotient by integration by parts.

7.1F1F2F4F11step 5.1step 6.1constructalgebra

For any numerical multilinear family ν obtained here define its reconstruction by R(ν)(F1,…,Fn)(ϕ)=ν(τϕF1,…,τϕFn). This is a finite expression: for F=c+∫fP(jsψ), the shifted density is c+∫fP(jsψ+jsϕ), whose finite Taylor expansion has smooth compact coefficient functions f times products of jets of ϕ. Reduce each term by [F11] before applying ν. Equality of actual functionals is preserved by τϕ, so numerical presentation independence proves full presentation independence. Also τϕτth=τϕ+th; differentiating this finite expression gives DhR(ν)(F1,…,Fn)=∑iR(ν)(F1,…,DhFi,…,Fn). Thus every occurrence of a numerical sub-polynomial coefficient uses the same ν, including across input field degrees. Conversely, the shift calculation in step 5.1 proves that any family satisfying this identity equals R of its zero-field value. Set Tn1=R(νn1); step 5.1 shows that it extends Tn0. The Taylor factorials count the choices of uncontracted slots, leaving precisely the graph Wick factorials of [F1]; lower numerical field degrees supply all spectator-field terms, rather than new independent extensions. Total coordinate derivatives commute with field shifts at fixed ϕ when the derivatives act on the full shifted density; the finite Leibniz rule therefore differentiates both the numerical coefficient and its spectator jets. This proves the full derivative identity and its engineering bounds, with the possible contact terms already allowed in step 6.1. The numerical kernels are translation invariant, so all their wavefront tuples have total covector sum zero, including at the extended diagonals. Differentiating the finitely many field jets under the distribution pairing defines the output derivative kernels continuously, by attaching the remaining field slots to their vertex positions. In their Fourier phases the frequency at each vertex is the sum of the attached slot frequencies; jet derivatives add only polynomial factors. Multiplication by the smooth compact vertex coefficients preserves the numerical wavefront bound. Thus a nonzero output tuple in an all-future or all-past cone has nonzero total frequency, and rapid center-coordinate Fourier decay of the localized numerical distribution excludes it; the proper projection wavefront estimate [F4] expresses the same exclusion for integrated vertex variables. Thus the output belongs to the stated polynomial microcausal class, with compact support and finite polynomial degree inherited from the finitely many vertex terms.

7.2F1F11step 3.1step 4.1step 6.1constructalgebra

Keep together all components that mix under Lorentz transformations. At fixed input field degrees and homogeneous derivative degrees, take the finite-dimensional space L of balanced input-label tensors and put O=C, the trivial zero-field output representation. Enlarge L to contain its full Lorentz orbit. The substitution pa↦ΛTpa of [F11] defines RL, and set RO(Λ)=1; linear substitutions preserve field degree and homogeneous derivative degree, so these enlargements remain finite. In relative dimension d=4(n−1) put AΛ(z1,…,zn−1)=(Λz1,…,Λzn−1) and UΛ=(AΛ−1)∗⊗RO(Λ) on D′(Rd)⊗O. Regard the chosen zero-field numerical coefficients of νn1 collectively as t1∈Hom⁡C(L,D′(Rd)⊗O), with combined action (Λ⋅t)(b)=UΛt(RL(Λ)−1b). These are representations by the pullback and substitution laws. On the punctured relative space the collective coefficient t0 is fixed by this combined action: the free kernels are invariant, their differentiated components transform by the chain rule, and the already covariant lower-order products agree on the causal-cover overlaps. A fixed coordinate derivative component need not be scalar invariant.

8.1F8F9F10F11step 7.2algebra

For the finite block in step 7.2 choose a common finite engineering upper bound B compatible with its homogeneous label degrees and the finitely many lower-order counterterms. Linear coordinate changes commute with positive dilations and preserve these bounds. Put JN=span⁡C{∂αδ0:∣α∣≤N}, where N=⌊B−d⌋ when B≥d, and put JN=0 when B<d. The permitted local corrections form the invariant subspace V of Hom⁡C(L,JN⊗O) satisfying the labelwise engineering bounds and the linear identities of the balanced coefficients. This space is finite-dimensional. Lorentz substitutions preserve each homogeneous degree and delta-derivative order, while [F11] makes the derivative identities equivariant, proving invariance of this subspace. Differentiate the combined action to obtain ρ(X) and put c(X)=ρ(X)t1. Restriction commutes with the action, and step 7.2 gives ρ(X)t0=0, so c(X) is supported at the relative origin. It obeys the same engineering bounds and identities; [F8] and [F10] therefore place it in V. Smooth differentiation is justified by differentiating the transformed compact test densities in their fixed-support smooth topology; the finite-order distribution bound then permits pairing. The representation law gives c([X,Y])=ρ(X)c(Y)−ρ(Y)c(X), so c:so(1,3)→V is exactly a real-linear cocycle in the finite-dimensional complex module required by [F9].

9.1A1F1F8F9F11step 6.1step 7.1step 7.2step 8.1algebra

Apply [F9] to this module and cocycle to obtain v∈V with c(X)=ρ(X)v. Thus t1−v has zero infinitesimal combined defect, retains the engineering bounds, and agrees with t0 off the diagonal. Its combined orbit is constant along each one-parameter subgroup by the preceding smooth test-pairing argument. Along a smooth group path g(s) the orbit derivative is the transported infinitesimal action of g(s)−1g′(s) and hence is zero. In the identity component every point is reachable by a piecewise smooth path: the set reachable from the identity and its complement are open, using straight paths in coordinate balls. Connectedness therefore gives full SO+(1,3) covariance. Work separately in homogeneous balanced-label degrees, whose finite spaces are Lorentz invariant, and recover total-derivative descendants by [F11]; these specify one corrected numerical map νn2 on their algebraic direct sum. Use Tn2=R(νn2) for every field degree. Reconstruction commutes with Poincare transformations, since τγ⋅ϕ(γ⋅F)=γ⋅(τϕF) and the numerical family is equivariant; step 7.1 proves its field independence and representation independence. In particular a correction chosen on a numerical label is reused in all occurrences of that label as a sub-polynomial, never chosen again for each spectator-field degree. The choices of these finite-block corrections are permitted by [A1]. Translation covariance is retained because every correction is a relative delta jet lifted by the same center-coordinate integral as in step 6.1.

10.1A1F1F3F8F11step 3.1step 5.1step 7.1step 9.1algebra

Symmetrize the corrected numerical family over the finite permutation group and reconstruct, denoting the result again by Tn2; this preserves covariance, field independence and the finite scaling bounds. The following symmetric diagonal correction and its polarization impose unitarity. Let Dn(V) be the coefficient of gn in Sg(V)∗⋆WSg(V)−1 after the lower orders have been made unitary. Associativity and (F⋆WG)∗=G∗⋆WF∗ follow from the finite contraction formula and W∗=WT. On each causal cover set CI, factorization reduces the defect to products of lower-order unitary blocks, so Dn vanishes away from Δn. It is self-adjoint because the full product Sg(V)∗⋆WSg(V) is self-adjoint. The graphwise scaling bounds and [F8] place each diagonal part of Dn in a finite local jet space with the permitted derivative order. Define the correction by inℏnn! ΔTn(V,…,V)=−12Dn(V). This is an allowed formal correction: every order-n defect term has ℏ-degree at least −n, so multiplication by ℏn inverts the displayed prefactor without introducing negative powers of ℏ; polarization gives a symmetric diagonal n-linear map. To check compatibility with field independence, polarize Dn on real local inputs and extend complex multilinearly in its n inputs. Each term is a product of lower maps and the current Tn2, with every input occurring once, so the derivation identity of step 5.1 and step 7.1 imply DhDn(F1,…,Fn)=∑iDn(F1,…,DhFi,…,Fn). Involution also commutes with real field shifts. By the converse in step 7.1, Dn=R(dn) for dn=Dn∣ϕ=0. Consequently the displayed correction is exactly the reconstruction of the numerical correction −ℏnn!dn/(2in), with no independent field-degree choices. The numerical correction inherits the total-derivative identities, covariance and permutation symmetry from the defect; [F11] and step 7.1 transfer them to every functional presentation. In the order-n defect, this changes only the two terms paired with the unit coefficient, adding −Dn/2+(−Dn/2)∗=−Dn. Thus it cancels the defect, preserves the graph engineering upper bounds and covariance, and leaves all off-diagonal causal products unchanged. Formal unitarity holds through order n.

11.1A1F1F3step 1.1step 10.1∎

The construction at order n uses only finite graph sums, finite-dimensional jet corrections and the already constructed orders below n. The Axiom of Choice supplies dependent choice for the recursive order-by-order selections and Countable Choice for the microlocal contractions in [F3]. Induction therefore constructs the sequence for every finite order and verifies every clause of the system contract in [F1]. No limit in g is taken.

Remarks

The result is conditional on the fixed free scalar data in the definition. It constructs formal local time-ordered products and finite counterterms; it does not construct the free data, prove convergence, take an adiabatic limit, or impose a gauge identity.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Renormalization maps form a formal composition group

Statement

Assume Countable Choice. Put L=Flocpoly(M), A=Fμcpoly(M), and R=C⟦ℏ⟧. Write LR=L⟦ℏ⟧ and AR=A⟦ℏ⟧. Extend each time-ordered map coefficientwise and R-multilinearly to LRn→AR. All maps below are formal in the interaction degree: evaluation at λV, for a second formal indeterminate λ and V∈LR, is compared in AR⟦λ⟧. For two scalar time-ordered systems T and T′ satisfying the local scalar contract for the same free data and with T0=T0′=1, T1=T1′=id⁡, define their normalized formal S-maps by S(V)=∑n=0∞1n!Tn(V,…,V),S′(V)=∑n=0∞1n!Tn′(V,…,V). There is a unique formal map Z(V)=V+∑n≥2Zn(V)=V+O(V2), where Zn is the diagonal of a symmetric R-multilinear map LRn→LR and Z(λV)∈λLR⟦λ⟧ such that Z(0)=0, dZ0=id⁡, Z preserves supports and scalar Poincare covariance, and S′(V)=S(Z(V)) coefficientwise. Such maps compose, and each has a recursively defined formal inverse; hence they form a group under composition.

Facts & Assumptions

Given: The common admissible free scalar data, two time-ordered systems satisfying the stated contract, and Countable Choice.

[A1]

Assume Countable Choice The Axiom of Countable Choice (ACω) for the common microcausal contraction contract. The two time-ordered systems are supplied; no new graph extension or arbitrary family of extension choices is made here.

[F1]

The two time-ordered systems are given in the Statement, including their causal factorization, field independence, covariance, derivative compatibility and finite graph scaling upper bounds.

[F2]

Local scalar time-ordered product contract: T0=1, T1=id⁡; the formal S-map is coefficientwise and causal; the vertex functionals and support convention are those of Off-shell local polynomial scalar functionals.

[F3]

Distributions supported at one point: a distribution supported at one point is a unique finite sum of delta derivatives, in ZF. If its scaling upper bound is B in relative dimension d, the largest nonzero derivative order is at most ⌊B−d⌋, since a nonzero point-supported sum of largest order k has scaling degree d+k.

[F4]

Finite sums of product tests are dense on product open sets: finite sums of products of compactly supported smooth tests are dense in the test-function topology on any product of open Euclidean sets, with supports in one compact product.

[F5]

Test function cutoffs and euclidean localization supplies compact smooth cutoffs; normalizing a nonnegative nonzero one gives a compact smooth function of integral one.

Proof

technique · direct triangular recursion in formal degree

Given: [A1], two systems as in the Statement, and [F1]–[F5].

1.1givenF1F2construct

Use the two explicitly supplied systems [F1]; no existence theorem for constructing them is invoked. Introduce a formal degree parameter λ and write S(λV)=1+∑n≥1λnSn(V) and S′(λV)=1+∑n≥1λnSn′(V). Since T1=T1′=id⁡, the degree-one coefficients agree. Set Z1(V)=V.

2.1F1F2step 1.1algebra

Suppose homogeneous maps Zj are defined for 1≤j<n, with finite-jet kernels supported on the total diagonal and preserving supports and covariance, and S(Z<n(λV)) agrees with S′(λV) through degree n−1. In the degree-n coefficient of S(Z<n(λV)+λnZn(V)), the only occurrence of Zn is the linear term T1(Zn)=Zn: every term with Tk for k≥2 has k positive degrees summing to n, so each degree is at most n−1. Therefore there is exactly one choice of Zn, namely the degree-n residual of S′ minus the already known coefficient of S∘Z<n.

3.1A1F1F2F4step 2.1constructalgebra

Polarize the homogeneous residual from step 2.1 into its symmetric n-linear vertex kernel. Fix a point of a causal cover set CI and choose small coordinate neighborhoods of its n entries whose product lies in CI. For arbitrary fi∈Cc∞ in those neighborhoods, fix arbitrary polynomial jet labels Pi of finite order and take the local functionals Fi(ϕ)=∫fi(x)Pi(jsiϕ(x)) d4x; their supports satisfy the same causal split. Introduce independent formal variables t1,…,tn. Each lower map Zj, j<n, has a kernel supported on the total diagonal by the induction hypothesis in step 2.1; because the two block supports are disjoint, every mixed term of Zj(∑itiFi) containing variables from both blocks vanishes, so Zj splits as the sum of its block restrictions. The causal-factorization identity for S′ and for S∘Z<n then expresses the coefficient of t1⋯tn as a star product of block coefficients of degrees ∣I∣ and ∣Ic∣. Both degrees are strictly below n, so these coefficients agree by the induction hypothesis and the coefficient vanishes. For each of the arbitrary fixed polynomial jet labels, the corresponding numerical residual distribution therefore pairs to zero with every product test f1⊗⋯⊗fn in this neighborhood. Iterating [F4] over the n factors shows finite sums of these product tests are dense in its test-function space, so the residual distribution vanishes on the neighborhood. Since the causal cover sets cover the complement of the total diagonal, the residual kernel is supported on that diagonal.

4.1F1F5step 2.1step 3.1constructalgebra

Fix balanced input and remaining-field labels and one ℏ coefficient of the polarized residual in step 3.1, and call its numerical distribution Q. Its field-independent numerical coefficients are translation invariant by covariance in [F1]; lower-order counterterm insertions preserve that invariance by the induction hypothesis. In coordinates y=xn, zi=xi−xn, simultaneous translation acts only on y∈R4, and step 3.1 gives supp⁡Q⊆{z=0}. Translation invariance implies Q(∂yaΨ)=0 for every test Ψ, by differentiating its translated test curve in the fixed-support smooth topology. Choose η(y)=∏a=14ηa(ya) with ηa∈Cc∞(R) and ∫ηa=1, using [F5], and define q(ψ)=Q(η(y)ψ(z)). For any Ψ, replace its dependence on y1, then y2,y3,y4, by ηa(ya) times its integral in that coordinate. Each replacement difference has zero integral in that coordinate, so its primitive from −∞ is compactly supported and smooth, also in the remaining variables. Hence Ψ−η(y)∫Ψ(v,z) d4v is a sum of four y-derivatives of compact smooth tests. The derivative-annihilation identity yields Q(Ψ)=q(∫Ψ(y,z) d4y), that is, Q=1y⊗q. The map defining q is continuous on every fixed-support test space, and its support is contained in {0}⊂R4(n−1).

5.1A1F1F2F3step 2.1step 4.1constructalgebra

Now apply [F3] to q, not to Q: q=∑∣β∣≤mcβ∂zβδ0 with finite m. Its finite relative scaling bound comes from the finite graph bounds of the two supplied systems and the finitely many lower-order local insertions at this fixed input, interaction and ℏ degree. If that bound is B and d=4(n−1), [F3] gives ∣β∣≤⌊B−d⌋ for nonzero coefficients. In the original vertex coordinates the precise diagonal-jet formula is Q(Ψ)=∑βcβ(−1)∣β∣∫M(∂zβΨ)(y,0) d4y, with Ψ here written in the (y,z) coordinates. Pairing it with the finite local polynomial vertex kernels differentiates their compact smooth coefficients and remaining field jets only finitely many times, giving an integral of a finite polynomial in the field jets at y. Thus each coefficient of Zn belongs to L. Balanced representatives and derivative identities in [F1] make it independent of the density presentation. The diagonal formula confines its functional support to the intersection of the vertex supports, and covariance follows from covariance of the residual recursion. Therefore Zn has the required formal local, support-preserving and covariant coefficients.

6.1F2step 2.1step 5.1algebra∎

Induction defines every Zn uniquely by the displayed residual formula; ordinary recursion and Replacement collect these unique coefficients without an axiom of choice, and each coefficient of a composition uses only finitely many partitions of its total degree. If Z(V)=V+∑n≥2Zn(V), solve Z(X(V))=V recursively: the unknown degree-n term of X again occurs through the identity linear coefficient, while all other terms use lower degrees. This gives a unique formal inverse with local support-preserving coefficients. Formal composition is associative coefficientwise and preserves the identity linear term, so these maps form a group.

Remarks

Constructing the time-ordered systems is a separate theorem under its own Choice hypotheses. This comparison result takes the systems as input and selects no new extensions, so the Axiom of Choice is unnecessary here. Countable Choice remains part of the actual contraction contract.

5 · Examples, experiments and counterexamples

None yet.

Sources