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.
Novikov convolution is a filtered ring operation
Statement
For a field , an additive abelian group , a homomorphism , and the completion defined in Universal Novikov completion and energy filtration, coefficientwise addition and convolution multiplication are well-defined, make a commutative ring, and satisfy and . The full ring and its nonnegative-valuation subring are complete in their energy-filtration topologies.
Statement references
Facts & Assumptions
Given: The Novikov completion data and definitions above.
Universal Novikov completion and energy filtration: a series has finite support below every real energy cutoff, monomials multiply by addition of exponents, and consists of series of valuation at least .
Proof
If a support is nonempty, choose one . The set is finite by [F1] and contains , so it has a least valuation . Every support element outside that finite set has valuation at least . Thus has a finite lower bound and its valuation infimum is attained; the empty support is the zero series.
If either factor has empty support, its product is zero. Otherwise let be the attained minimum valuation of the second support from step 1.1. For fixed , a nonzero product coefficient at can involve only in the first support with . This weak sublevel set is finite because it lies strictly below the cutoff in [F1]; then is fixed, so the coefficient is a finite sum. For each cutoff , any supported product term with valuation below has ; there are finitely many such first factors, and for each, finitely many second factors below . Thus the product has finite support below .
Support of a sum is contained in the union of the two supports, giving . Every supported product exponent is a sum of one exponent from each factor, so its valuation is at least ; cancellation only removes terms. If any of the three factors is zero, both bracketings are zero. Otherwise their supports have minimum valuations by step 1.1. For a fixed exponent , every raw contributing triple satisfies . There are finitely many such , using the strict cutoff one unit larger. For each, leaves finitely many , and is determined. Thus the raw triple sum is finite before any cancellation, and both bracketings may be expanded and regrouped as that same sum; associativity of addition in and multiplication in prove associativity of convolution. The same finite-coefficient argument proves distributivity, and is a unit. In the topology with zero-neighbourhoods , a Cauchy net has an eventually constant coefficient at each : use a cutoff , for which forces the coefficients at to agree on a tail. Let be this unique eventual value. For any cutoff , choose so that for all . Then and agree at every exponent of valuation below , so the support of below is finite; hence . The same tail condition shows that every with agrees with below , so and the net converges. If the net lies in , every stabilized coefficient with negative valuation is zero, so and the same argument proves completeness in its induced topology.