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.
Integer-valued finite formal sums of words form unital convolution rings
Statement
For a set , let be its finite-word monoid and let
With pointwise addition and convolution
this is a unital ring. Its multiplicative identity is the basis vector supported at the empty word. When , the construction is canonically .
Facts & Assumptions
Given: A set , its finite-word monoid , and the displayed convolution formula.
The assignment is the finite-word monoid functor (The free-monoid functor is left adjoint to the underlying-set functor).
Every element of a free module has a unique finite expression in its standard basis, including the empty-basis case (The free module on a set and its standard basis).
Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini formula (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).
Proof
Regard as the free abelian group on the words. Define the product by bilinearly extending concatenation of basis words, equivalently by the displayed coefficient formula.
A finite word has only finitely many cuts , and finite supports leave only finitely many nonzero summands. Hence every coefficient sum is finite, and the product has finite support contained in the finite set of concatenations of support words.
For , both coefficients of and are the sum of over triples with . The two bracketings are bijective reindexings of the same finite set, so [L3] proves associativity.
Splitting finite sums termwise proves and . Together with the pointwise abelian-group structure over , these are both distributive laws.
Let be on the empty word and elsewhere. The only contributing cut with a nonzero factor is or , so . This verifies the multiplicative identity and all ring laws. If , then and the coefficient at identifies the ring with .
Depends on
- The free-monoid functor is left adjoint to the underlying-set functor
- The free module on a set and its standard basis
- The integers form a commutative ring
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides
- Semigroup and monoid
Used by
Dependency tree · two levels
32 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
- E. Riehl, Category Theory in Context, 2nd ed., Corollary 5.5.3 (standard reference, not scraped)
- E. Riehl, Category Theory in Context, 2nd ed., Example 4.1.10(vi) (standard reference, not scraped)
- D. Mehrle, Category Theory Part III, Example 5.18 (standard reference, not scraped)