Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-11-05 (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.

Novikov convolution is a filtered ring operation

Statement

For a field k, an additive abelian group Γ, a homomorphism ν:Γ→R, and the completion Λν,k defined in Universal Novikov completion and energy filtration, coefficientwise addition and convolution multiplication are well-defined, make Λν,k a commutative ring, and satisfy v(ab)≥v(a)+v(b) and v(a+b)≥min⁡(v(a),v(b)). The full ring and its nonnegative-valuation subring are complete in their energy-filtration topologies.

Facts & Assumptions

Given: The Novikov completion data and definitions above.

[F1]

Universal Novikov completion and energy filtration: a series has finite support below every real energy cutoff, monomials multiply by addition of exponents, and Fc consists of series of valuation at least c.

Proof

1.1givenF1algebra

If a support S is nonempty, choose one γ0∈S. The set S∩{γ:ν(γ)<ν(γ0)+1} is finite by [F1] and contains γ0, so it has a least valuation ℓS. Every support element outside that finite set has valuation at least ν(γ0)+1>ℓS. Thus S has a finite lower bound and its valuation infimum is attained; the empty support is the zero series.

2.1givenF1step 1.1algebra

If either factor has empty support, its product is zero. Otherwise let ℓT be the attained minimum valuation of the second support from step 1.1. For fixed γ∈Γ, a nonzero product coefficient at qγ can involve only γ1 in the first support with ν(γ1)≤ν(γ)−ℓT. This weak sublevel set is finite because it lies strictly below the cutoff ν(γ)−ℓT+1 in [F1]; then γ2=γ−γ1 is fixed, so the coefficient is a finite sum. For each cutoff C, any supported product term with valuation below C has ν(γ1)<C−ℓT; there are finitely many such first factors, and for each, finitely many second factors below C−ν(γ1). Thus the product has finite support below C.

3.1F1step 1.1step 2.1algebra∎

Support of a sum is contained in the union of the two supports, giving v(a+b)≥min⁡(v(a),v(b)). Every supported product exponent is a sum of one exponent from each factor, so its valuation is at least v(a)+v(b); cancellation only removes terms. If any of the three factors is zero, both bracketings are zero. Otherwise their supports S1,S2,S3 have minimum valuations ℓ1,ℓ2,ℓ3 by step 1.1. For a fixed exponent γ, every raw contributing triple γ1+γ2+γ3=γ satisfies ν(γ1)≤ν(γ)−ℓ2−ℓ3. There are finitely many such γ1∈S1, using the strict cutoff one unit larger. For each, ν(γ2)≤ν(γ)−ν(γ1)−ℓ3 leaves finitely many γ2∈S2, and γ3=γ−γ1−γ2 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 k prove associativity of convolution. The same finite-coefficient argument proves distributivity, and q0 is a unit. In the topology with zero-neighbourhoods FC, a Cauchy net (ai) has an eventually constant coefficient at each γ: use a cutoff C>ν(γ), for which ai−aj∈FC forces the coefficients at qγ to agree on a tail. Let aγ be this unique eventual value. For any cutoff C, choose i0 so that ai−aj∈FC for all i,j≥i0. Then a and ai0 agree at every exponent of valuation below C, so the support of a below C is finite; hence a∈Λν,k. The same tail condition shows that every ai with i≥i0 agrees with a below C, so ai−a∈FC and the net converges. If the net lies in Λν,k0, every stabilized coefficient with negative valuation is zero, so a∈Λν,k0 and the same argument proves completeness in its induced topology.

Depends on

Dependency tree · 2 levels

Sources