Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-07-28
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.

Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides

Definition

A ring is a set R carrying two binary operations (Binary operation on a set; associativity, commutativity, and a subset closed under the operation), addition + and multiplication ⋅, and two distinguished elements 0 and 1 of R, such that

  • (R1) (R,+,0) is an abelian group (Group and abelian group): addition is associative and commutative, 0+x=x=x+0 for every x∈R, and every x∈R has an additive inverse;
  • (R2) (R,⋅,1) is a monoid (Semigroup and monoid): multiplication is associative and 1⋅x=x=x⋅1 for every x∈R;
  • (R3) multiplication distributes over addition on both sides: for all x,y,z∈R,

x⋅(y+z)  =  x⋅y+x⋅z,(y+z)⋅x  =  y⋅x+z⋅x.

We write xy for x⋅y, call 0 the zero and 1 the identity (or unity) of R, write −x for the additive inverse of x, and abbreviate x−y:=x+(−y).

Why "the" zero, "the" identity and "the" additive inverse are legitimate. Each of 0 and 1 is a two-sided identity for its own operation, and a binary operation has at most one two-sided identity (A left identity and a right identity for the same binary operation are equal; hence there is at most one two-sided identity, Left identity, right identity, and two-sided identity for a binary operation), so each is determined by the operation and the notation is single-valued. An additive inverse of x is an inverse in the monoid (R,+,0) (Left inverse, right inverse, and invertible element of a monoid), and in a monoid an element has at most one inverse (In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided); so −x names one element, and a single equation y+x=0 already forces y=−x.

Convention: a ring has an identity. Axiom (R2) asks for a monoid, so the existence of 1 is part of the definition and is not an extra hypothesis to be carried around. This is the convention used throughout this library. A structure satisfying (R1), (R3) and the associativity half of (R2), but not required to have a multiplicative identity, is called a non-unital ring (also rng); it is not called a ring here, and where such a structure occurs it is named as a non-unital ring in as many words. The distinction has content: the companion page exhibits a subset of Z that is closed under addition, additive inverses and multiplication and is not a subring, precisely because it misses the identity.

Nothing above requires 1≠0. A ring in which 1=0 has exactly one element; the companion page records it as the zero ring. Definitions that need 1≠0 — integral domain, division ring, field — say so explicitly.

Remarks

Depends on

Used by

…and 21 more results.

Dependency tree · two levels

9 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