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 be the isomorphism classes of finite nonempty rooted trees and their connected graded commutative Hopf algebra, graded by total vertices. Its coproduct is , where ranges over edge subsets meeting each root-to-leaf path at most once (including the empty cut), is the child-side forest, and is the root-side component; let be its antipode. Put . Let be a commutative unital -algebra, let be formal, and let split into strictly negative and nonnegative powers, with the projection onto . A character is a unital algebra homomorphism . For each positive-degree homogeneous , write and define recursively The sum is over the finite reduced coproduct and the recursion is degreewise finite. Define convolution by , where and are the multiplication and unit maps of , and put . Then and are characters, and , and the convolution inverse exists with This is an algebraic factorization for characters; it does not assert a graph-to-rooted-tree identification for actual Feynman graphs.
Statement references
Facts & Assumptions
Given: A character and the algebraic structures in the cited definitions and theorem.
Admissible-cut Hopf algebra for subdivergence forests: is the commutative polynomial algebra on finite rooted trees, graded by total vertices, with the admissible-cut coproduct.
Admissible cuts give a connected graded Hopf algebra and recursive antipode: is a connected graded Hopf algebra with antipode and finite reduced coproduct on every homogeneous element.
Laurent-series target and pole projection for subtraction: , projects onto the strictly negative Laurent powers, and is a subalgebra.
Proof
Given: [F1]–[F4] and a character .
For homogeneous of degree , every term in has both factors of positive degree strictly less than , because is connected and graded by [F2]. There are finitely many terms by [F1], so induction on defines and without circularity; extend linearly and set .
Let be positive-degree homogeneous elements with total degree , and assume inductively that whenever . Expand . In , every summand except the unique pair has left-factor product degree less than ; for those terms the induction hypothesis factors , while the character property factors . Thus these lower-degree summands agree term-by-term with those in . The only remaining terms are the top pair in the product and in the convolution of . Since and , subtracting the top pair gives The equality uses commutativity of .
If either or has degree zero, multiplicativity follows from . Otherwise write and . By the recursion and the identity in [F4], Thus degree induction proves that is a character on all of .
For positive-degree , expanding its full coproduct gives ; also . For , the character properties already proved and multiplicativity of give where commutativity of permits the middle factors to be regrouped. Thus is a character with the stated range.
For , multiplicativity and unitality of and the antipode identities in [F2] give and likewise Hence . From , associativity and cancellation by this inverse give .
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.