Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 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.

Depends on

Dependency tree · 2 levels

Sources