LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11

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.

Coefficientwise sums and convolution products of finitely supported sequences are finitely supported

Statement

If $a, b ⁣ : N \to R$ have finite support, then their coefficientwise sum and convolution product have finite support.

Facts & Assumptions

Given: A commutative ring $R$ and finitely supported coefficient sequences $a, b \in R [x]$ .

[L1]

A coefficient sequence has finite support when it vanishes beyond some natural-number bound; addition is coefficientwise and multiplication is convolution (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

Proof

technique · direct

1.1

Choose $M, N \in N$ such that $a_{i} = 0$ for $i > M$ and $b_{j} = 0$ for $j > N$ .

givenL1choose

2.1

If $k > \max {M, N}$ then $(a + b)_{k} = 0$ , and if $k > M + N$ then every pair $i + j = k$ has $i > M$ or $j > N$ , so every summand $a_{i} b_{j}$ in $(a b)_{k}$ is zero; hence both sequences have finite support.

step 1.1L1algebra∎

Depends on

The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution

Used by

Polynomial convolution makes R[x] a commutative ring containing R as its constant subring Theorem

Cited to discharge well-definedness by The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution.

Dependency tree · two levels

3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Neil Donaldson, Math 120B Notes, Section 22 (standard reference, not scraped)