Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

The product ring R×SR \times S with componentwise operations, its identity (1R,1S)(1_R, 1_S) and its units R××S×R^{\times} \times S^{\times}

Definition

Let RR and SS be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides). The product ring R×SR \times S is the cartesian product of the underlying sets with the componentwise operations

(a,b)+(a,b):=(a+a,  b+b),(a,b)(a,b):=(aa,  bb),(a,b) + (a',b') := (a + a',\; b + b'), \qquad (a,b)\cdot(a',b') := (aa',\; bb'),

and the distinguished elements

0R×S:=(0R,0S),1R×S:=(1R,1S).0_{R \times S} := (0_R, 0_S), \qquad 1_{R \times S} := (1_R, 1_S).

These data make R×SR \times S a ring. Both rules take a pair of elements of R×SR \times S to an element of R×SR \times S, so each is a binary operation. Every ring axiom is an equation between elements of R×SR \times S, and two such elements are equal exactly when their components are; so each axiom holds componentwise from the corresponding axiom in RR and in SS. Explicitly: (R×S,+,(0R,0S))(R \times S, +, (0_R,0_S)) is an abelian group with (a,b)=(a,b)-(a,b) = (-a,-b); multiplication is associative with two-sided identity (1R,1S)(1_R,1_S); and both distributive laws hold.

Units. An element (u,v)(u,v) is a unit of R×SR \times S if and only if uu is a unit of RR and vv is a unit of SS, in which case (u,v)1=(u1,v1)(u,v)^{-1} = (u^{-1}, v^{-1}). Indeed, if uu=1R=uuuu' = 1_R = u'u and vv=1S=vvvv' = 1_S = v'v then (u,v)(u,v)=(1R,1S)=(u,v)(u,v)(u,v)(u',v') = (1_R,1_S) = (u',v')(u,v); conversely, if (u,v)(u,v)=(1R,1S)=(u,v)(u,v)(u,v)(u',v') = (1_R,1_S) = (u',v')(u,v) then reading each component gives uu=1R=uuuu' = 1_R = u'u and vv=1S=vvvv' = 1_S = v'v. So

(R×S)×=R××S×,(R \times S)^{\times} = R^{\times} \times S^{\times},

and by The units of a ring are the invertible elements of its multiplicative monoid, and R×R^{\times} is a group under multiplication; 0R×0 \in R^{\times} only in the zero ring that set is a group under multiplication (Left inverse, right inverse, and invertible element of a monoid).

Commutativity. R×SR \times S is commutative (Commutative ring) if and only if both RR and SS are. If both are, the componentwise product is commutative. Conversely, if R×SR \times S is commutative then for a,aRa, a' \in R, (aa,1S)=(a,1S)(a,1S)=(a,1S)(a,1S)=(aa,1S)(aa', 1_S) = (a,1_S)(a',1_S) = (a',1_S)(a,1_S) = (a'a, 1_S), so aa=aaaa' = a'a; the same argument in the second component settles SS.

Zero divisors. If 1R0R1_R \ne 0_R and 1S0S1_S \ne 0_S, then R×SR \times S has zero divisors and is therefore never an integral domain (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors), whatever RR and SS are. Indeed (1R,0S)(1_R, 0_S) and (0R,1S)(0_R, 1_S) are both nonzero, and

(1R,0S)(0R,1S)  =  (1R0R,  0S1S)  =  (0R,0S),(1_R,0_S)\cdot(0_R,1_S) \;=\; (1_R 0_R,\; 0_S 1_S) \;=\; (0_R, 0_S),

using x0=0=0xx \cdot 0 = 0 = 0 \cdot x (In any ring 0a=a0=00 \cdot a = a \cdot 0 = 0, (a)b=a(b)=(ab)(-a)b = a(-b) = -(ab), (a)(b)=ab(-a)(-b) = ab, (1)a=a(-1)a = -a and a(bc)=abaca(b - c) = ab - ac).

Remarks

  • The product of two domains is never a domain, by the zero-divisor computation above, since a domain has 101 \ne 0 by definition. This is the cleanest source of zero divisors available at this point, and the companion page records the instance Z×Z\mathbb{Z} \times \mathbb{Z}.

  • The two projections are ring homomorphisms; the standard injections need not be, and fail when the other factor is nonzero. The maps (a,b)a(a,b) \mapsto a and (a,b)b(a,b) \mapsto b satisfy (RH1), (RH2) and (RH3) of Ring homomorphism: additive, multiplicative, and required to send 11 to 11. The map a(a,0S)a \mapsto (a, 0_S) satisfies (RH1) and (RH2) but sends 1R1_R to (1R,0S)(1_R, 0_S), which is not the identity of R×SR \times S when 1S0S1_S \ne 0_S; the companion page uses exactly that map to show (RH3) is not redundant.

  • Only the product of two rings is defined here, which is all this page and its companion use. Nothing below needs an indexed family.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 18 results over 13 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