Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17
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.

Universal property of a polynomial ring on an arbitrary family of indeterminates

Statement

Let R,S be commutative rings, let φ:R→S be a ring homomorphism, and let (si)i∈I be a family in S. There is a unique ring homomorphism

Φ:R[xi:i∈I]⟶S

whose restriction to R is φ and which satisfies Φ(xi)=si for every i∈I.

Facts & Assumptions

Given: Commutative rings R,S, a ring homomorphism φ:R→S, and a family (si)i∈I in S.

[L1]

The finite convolution construction is a commutative ring containing R (Finite convolution makes R[xi:i∈I] a commutative ring containing R).

[L2]

A ring homomorphism preserves addition, multiplication, and the multiplicative identity (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

Proof

technique · direct
1.1L1construct

For a∈M(I) define sa:=∏i∈supp⁡(a)siai, and for c=∑acaxa define Φ(c):=∑aφ(ca)sa; both expressions are finite and the empty product is 1S.

2.1step 1.1L3algebra

Pointwise addition gives Φ(c+d)=Φ(c)+Φ(d), while sa+b=sasb and finite reindexing give Φ(cd)=Φ(c)Φ(d).

3.1step 1.1step 2.1L2

The zero monomial gives Φ(1)=1, constants give Φ(r)=φ(r), and the one-supported exponent family gives Φ(xi)=si; hence Φ is the required ring homomorphism by [L2].

4.1step 1.1L2∎

Any ring homomorphism with these values must send caxa to φ(ca)sa and therefore, by finite additivity, must equal the formula in step 1.1.

Depends on

Used by

Dependency tree · two levels

14 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