Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Laurent subtraction factors a character into counterterm and finite characters

Statement

Let T be the isomorphism classes of finite nonempty rooted trees and H=Q[T] their connected graded commutative Hopf algebra, graded by total vertices. Its coproduct is Δ(t)=t⊗1+∑CPC(t)⊗RC(t), where C ranges over edge subsets meeting each root-to-leaf path at most once (including the empty cut), PC(t) is the child-side forest, and RC(t) is the root-side component; let S be its antipode. Put H+=⨁n>0Hn. Let K be a commutative unital Q-algebra, let ϵ be formal, and let A=K((ϵ))=A−⊕A+ split into strictly negative and nonnegative powers, with R the projection onto A−. A character is a unital algebra homomorphism ϕ:H→A. For each positive-degree homogeneous h, write Δ~(h)=Δ(h)−h⊗1−1⊗h and define recursively Bϕ(h)=ϕ(h)+∑Δ~(h)ϕ−(h(1))ϕ(h(2)),ϕ−(1)=1,ϕ−(h)=−RBϕ(h). The sum is over the finite reduced coproduct and the recursion is degreewise finite. Define convolution by f∗g=mA(f⊗g)Δ, where mA and uA are the multiplication and unit maps of A, and put ϕ+=ϕ−∗ϕ. Then ϕ− and ϕ+ are characters, ϕ−(H+)⊆A− and ϕ+(H)⊆A+, and the convolution inverse ϕ−−1=ϕ−∘S exists with ϕ=ϕ−−1∗ϕ+. This is an algebraic factorization for characters; it does not assert a graph-to-rooted-tree identification for actual Feynman graphs.

Facts & Assumptions

Given: A character ϕ:H→A and the algebraic structures in the cited definitions and theorem.

[F1]

Admissible-cut Hopf algebra for subdivergence forests: H is the commutative polynomial algebra on finite rooted trees, graded by total vertices, with the admissible-cut coproduct.

[F2]

Admissible cuts give a connected graded Hopf algebra and recursive antipode: H is a connected graded Hopf algebra with antipode S and finite reduced coproduct on every homogeneous element.

[F3]

Laurent-series target and pole projection for subtraction: A=A−⊕A+, R projects onto the strictly negative Laurent powers, and A+ is a subalgebra.

[F4]

Laurent pole projection satisfies the weight-minus-one identity: R(x)R(y)=R(R(x)y+xR(y)−xy) for all x,y∈A.

Proof

Given: [F1]–[F4] and a character ϕ:H→A.

1.1givenF1F2construct

For homogeneous h of degree n>0, every term h(1)⊗h(2) in Δ~(h) has both factors of positive degree strictly less than n, because H is connected and graded by [F2]. There are finitely many terms by [F1], so induction on n defines Bϕ(h) and ϕ−(h) without circularity; extend linearly and set ϕ−(1)=1.

2.1F1F2step 1.1algebra

Let x,y be positive-degree homogeneous elements with total degree d, and assume inductively that ϕ−(uv)=ϕ−(u)ϕ−(v) whenever deg⁡u+deg⁡v<d. Expand Δ(xy)=Δ(x)Δ(y). In (ϕ−∗ϕ)(x)(ϕ−∗ϕ)(y), every summand except the unique pair (x⊗1)(y⊗1) has left-factor product degree less than d; for those terms the induction hypothesis factors ϕ−(x(1)y(1)), while the character property factors ϕ(x(2)y(2)). Thus these lower-degree summands agree term-by-term with those in (ϕ−∗ϕ)(xy). The only remaining terms are the top pair ϕ−(x)ϕ−(y) in the product and ϕ−(xy) in the convolution of xy. Since Bϕ(xy)=(ϕ−∗ϕ)(xy)−ϕ−(xy) and (ϕ−∗ϕ)(x)=ϕ−(x)+Bϕ(x), subtracting the top pair gives Bϕ(xy)=(ϕ−∗ϕ)(x)(ϕ−∗ϕ)(y)−ϕ−(x)ϕ−(y)=ϕ−(x)Bϕ(y)+Bϕ(x)ϕ−(y)+Bϕ(x)Bϕ(y). The equality uses commutativity of A.

3.1F3F4step 2.1algebra

If either x or y has degree zero, multiplicativity follows from ϕ−(1)=1. Otherwise write X=Bϕ(x) and Y=Bϕ(y). By the recursion and the identity in [F4], ϕ−(xy)=−RBϕ(xy)=R(R(X)Y+XR(Y)−XY)=R(X)R(Y)=ϕ−(x)ϕ−(y). Thus degree induction proves that ϕ− is a character on all of H.

4.1F1F2F3step 3.1algebra

For positive-degree h, expanding its full coproduct gives (ϕ−∗ϕ)(h)=ϕ−(h)+Bϕ(h)=−RBϕ(h)+Bϕ(h)=(1−R)Bϕ(h)∈A+; also (ϕ−∗ϕ)(1)=1∈A+. For x,y∈H, the character properties already proved and multiplicativity of Δ give (ϕ−∗ϕ)(xy)=∑ϕ−(x(1))ϕ−(y(1))ϕ(x(2))ϕ(y(2))=(ϕ−∗ϕ)(x)(ϕ−∗ϕ)(y), where commutativity of A permits the middle factors to be regrouped. Thus ϕ+=ϕ−∗ϕ is a character with the stated range.

5.1F2step 4.1algebra∎

For h∈H, multiplicativity and unitality of ϕ− and the antipode identities in [F2] give ((ϕ−∘S)∗ϕ−)(h)=∑ϕ−(S(h(1)))ϕ−(h(2))=ϕ−(∑S(h(1))h(2))=ϕ−(uε(h))=uAε(h), and likewise (ϕ−∗(ϕ−∘S))(h)=∑ϕ−(h(1))ϕ−(S(h(2)))=ϕ−(∑h(1)S(h(2)))=uAε(h). Hence ϕ−−1=ϕ−∘S. From ϕ+=ϕ−∗ϕ, associativity and cancellation by this inverse give ϕ=ϕ−−1∗ϕ+.

Remarks

The preceding page qftx-causal-renormalization fixes a conditional scalar time-ordered-product contract. Applying this theorem to actual scalar graphs would additionally require a graph-to-forest map that preserves the insertion coproduct, symmetry factors, and the chosen regularization character. That interface is not supplied or proved here; the theorem establishes only the stated abstract character factorization.

Depends on

Dependency tree · 1 level

Sources