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.
Cauchy multiplication makes a commutative ring containing as the finitely supported subring
Statement
For every commutative ring , the coefficientwise sum and Cauchy product make a commutative ring. The coefficientwise inclusion
is an injective unital ring homomorphism, and its image is exactly the finitely supported formal series.
Facts & Assumptions
Given: The hypotheses and notation of the statement above.
Cauchy multiplication is the finite convolution (Formal power series over a commutative ring and the coefficient-extraction functional ).
A finite sum over equals either iterated finite sum, and finite sums are invariant under bijective reindexing (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).
Polynomial coefficientwise addition and convolution make a commutative ring, and the constant-polynomial map is an injective unital ring homomorphism (Polynomial convolution makes a commutative ring containing as its constant subring).
Proof
Coefficientwise addition inherits associativity, commutativity, zero, and additive inverses from . For multiplication, the coefficient of both and at is the finite sum by finite Fubini. Reindexing as gives commutativity, and splitting finite sums gives both distributive laws. The constant series is a multiplicative identity, since the only nonzero summand involving it occurs at index .
A product of finitely supported series is finitely supported, and its coefficient formula is exactly the published polynomial convolution. Hence preserves and multiplication, so it is a unital ring homomorphism; it is injective because equality of coefficient functions is literal equality. Its image consists precisely of the finitely supported functions.
Therefore is a commutative ring and identifies with its finitely supported subring.
Depends on
- Formal power series over a commutative ring and the coefficient-extraction functional $[x^n]$
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- Polynomial convolution makes $R[x]$ a commutative ring containing $R$ as its constant subring
- Ring homomorphism: additive, multiplicative, and required to send $1$ to $1$
Used by
- The formal derivative D(∑ aₙxⁿ)=∑_n≥1naₙxⁿ⁻¹ Definition
- Nonzero constant series can multiply to zero in (ℤ/4ℤ)llbracket x rrbracket Example
- Formal order is non-Archimedean under sums and additive under products over a domain Lemma
- Coefficient extraction is R-linear, separates formal series, shifts under multiplication by xᵏ, and converts products to finite convolution Proposition
- A formal power series is a unit exactly when its constant coefficient is a unit Theorem
- R llbracket x rrbracket is complete in the x-adic topology and R[x] is dense by truncation Theorem
- Substitution by a zero-constant series is a ring homomorphism, and composition is associative when both inner series have zero constant coefficient Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 48 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Benjamin Sambale, An Invitation to Formal Power Series (standard reference, not scraped)
- Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics (standard reference, not scraped)