Alphabeta Math
PropositionStatement: 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.

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.

Depends on

Dependency tree · 2 levels

Sources