Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 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×S with componentwise operations, its identity (1R,1S) and its units R××S×

Definition

Let R and S 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×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′),

and the distinguished elements

0R×S:=(0R,0S),1R×S:=(1R,1S).

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

Units. An element (u,v) is a unit of R×S if and only if u is a unit of R and v is a unit of S, in which case (u,v)−1=(u−1,v−1). Indeed, if uu′=1R=u′u and vv′=1S=v′v then (u,v)(u′,v′)=(1R,1S)=(u′,v′)(u,v); conversely, if (u,v)(u′,v′)=(1R,1S)=(u′,v′)(u,v) then reading each component gives uu′=1R=u′u and vv′=1S=v′v. So

(R×S)×=R××S×,

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

Commutativity. R×S is commutative (Commutative ring) if and only if both R and S are. If both are, the componentwise product is commutative. Conversely, if R×S is commutative then for a,a′∈R, (aa′,1S)=(a,1S)(a′,1S)=(a′,1S)(a,1S)=(a′a,1S), so aa′=a′a; the same argument in the second component settles S.

Zero divisors. If 1R≠0R and 1S≠0S, then R×S has zero divisors and is therefore never an integral domain (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors), whatever R and S are. Indeed (1R,0S) and (0R,1S) are both nonzero, and

(1R,0S)⋅(0R,1S)  =  (1R0R,  0S1S)  =  (0R,0S),

using x⋅0=0=0⋅x (In any ring 0⋅a=a⋅0=0, (−a)b=a(−b)=−(ab), (−a)(−b)=ab, (−1)a=−a and a(b−c)=ab−ac).

Remarks

  • The product of two domains is never a domain, by the zero-divisor computation above, since a domain has 1≠0 by definition. This is the cleanest source of zero divisors available at this point, and the companion page records the instance Z×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 and (a,b)↦b satisfy (RH1), (RH2) and (RH3) of Ring homomorphism: additive, multiplicative, and required to send 1 to 1. The map a↦(a,0S) satisfies (RH1) and (RH2) but sends 1R to (1R,0S), which is not the identity of R×S when 1S≠0S; 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 · two levels

15 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