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 have finite support, then their coefficientwise sum and convolution product have finite support.
Facts & Assumptions
Given: A commutative ring and finitely supported coefficient sequences .
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
Choose such that for and for .
If then , and if then every pair has or , so every summand in is zero; hence both sequences have finite support.
Depends on
Used by
Cited to discharge well-definedness by The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 11 results over 6 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
- Neil Donaldson, Math 120B Notes, Section 22 (standard reference, not scraped)