Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-24
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 X, let X be its finite-word monoid and let

Z(X)={α:XZ:α has finite support}.

With pointwise addition and convolution

(αβ)(w)=uv=wα(u)β(v),

this is a unital ring. Its multiplicative identity is the basis vector supported at the empty word. When X=, the construction is canonically Z.

Facts & Assumptions

Given: A set X, its finite-word monoid X, and the displayed convolution formula.

[L1]

The assignment XX is the finite-word monoid functor (The free-monoid functor is left adjoint to the underlying-set functor).

[L2]

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).

[L3]

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

technique · direct
1.1

Regard Z(X) as the free abelian group on the words. Define the product by bilinearly extending concatenation of basis words, equivalently by the displayed coefficient formula.

L1L2construct
2.1

A finite word w has only finitely many cuts w=uv, 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.

step 1.1L2L3
3.1

For α,β,γ, both coefficients of (αβ)γ and α(βγ) are the sum of α(u)β(v)γ(r) over triples with uvr=w. The two bracketings are bijective reindexings of the same finite set, so [L3] proves associativity.

step 2.1L1L3algebra
3.2

Splitting finite sums termwise proves (α+β)γ=αγ+βγ and α(β+γ)=αβ+αγ. Together with the pointwise abelian-group structure over Z, these are both distributive laws.

step 2.1L3algebra
4.1

Let δ[] be 1 on the empty word and 0 elsewhere. The only contributing cut with a nonzero δ[] factor is w=[]w or w=w[], so δ[]α=α=αδ[]. This verifies the multiplicative identity and all ring laws. If X=, then X={[]} and the coefficient at [] identifies the ring with Z.

step 3.1step 3.2L1algebra

Depends on

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