Bourbaki

Definition 1

Tag 05H2, permanent. Cite it as [Bourbaki, Tag 05H2].

Algebra, chapter I, § 8. Rings

A ring is a set A\mathbf{A} with two laws of composition called respectively addition and multiplication, satisfying the following axioms:

(AN I) Under addition A\mathbf{A} is a commutative group. (AN II) Multiplication is associative and possesses an identity element. (AN III) Multiplication is distributive with respect to addition. The ring A\mathbf{A} is said to be commutative if its multiplication is commutative.

In what follows, (x,y)↦x+y(x, y) \mapsto x + y denotes addition and (x,y)↦xy(x, y) \mapsto xy multiplication; 00 denotes the identity element for addition and 11 that for multiplication. Finally, −x-x denotes the negative of xx under addition. The axioms of a ring are therefore expressed by the following identities:

(1)x+(y+z)=(x+y)+z(associativity of addition)(2)x+y=y+x(commutativity of addition)(3)0+x=x+0=x(zero)(4)x+(−x)=(−x)+x=0(negative)(5)x(yz)=(xy)z(associativity of multiplication)(6)x.1=1.x=x(unit element)(7)(x+y).z=xz+yz(8)x.(y+z)=xy+xz(distributivity) \begin{array}{ll} (1) & x + (y + z) = (x + y) + z \quad \text{(associativity of addition)} \\ (2) & x + y = y + x \quad \text{(commutativity of addition)} \\ (3) & 0 + x = x + 0 = x \quad \text{(zero)} \\ (4) & x + (-x) = (-x) + x = 0 \quad \text{(negative)} \\ (5) & x(yz) = (xy)z \quad \text{(associativity of multiplication)} \\ (6) & x.1 = 1.x = x \quad \text{(unit element)} \\ (7) & (x + y).z = xz + yz \\ (8) & x.(y + z) = xy + xz \quad \text{(distributivity)} \end{array}

Finally the ring A\mathbf{A} is commutative if xy=yxxy = yx for x,yx, y in A\mathbf{A}.

With addition alone A\mathbf{A} is a commutative group called the additive group of A\mathbf{A}. For all x∈Ax \in \mathbf{A}, we define the left homothety γx\gamma_x and right homothety δx\delta_x by γx(y)=xy\gamma_x(y) = xy, δx(y)=yx\delta_x(y) = yx. By formulae (7) and (8), γx\gamma_x and δx\delta_x are endomorphisms of the additive group of A\mathbf{A} and thus map zero to zero and negative to negative. Therefore

(9)x.0=0.x=0(10)x.(−y)=(−x).y=−xy; \begin{align*} (9) & \quad x.0 = 0.x = 0 \\ (10) & \quad x.(-y) = (-x).y = -xy; \end{align*}
it follows that (−x)(−y)=−((−x).y)=−(−xy)(-x)(-y) = -((-x).y) = -(-xy), whence
(11)(−x)(−y)=xy.(11) \quad (-x)(-y) = xy.
Formulae (10) and (11) constitute the sign rule. It follows that
−x=(−1)x=x(−1)-x = (-1)x = x(-1)
and (−1)(−1)=1(-1)(-1) = 1.

From (11) it follows by induction on nn that

(12)(−x)n={xnif n is even−xnif n is odd.(12) \quad (-x)^n = \begin{cases} x^n & \text{if } n \text{ is even} \\ -x^n & \text{if } n \text{ is odd.} \end{cases}

When we speak of cancellable elements, invertible elements, permutable elements, central elements, centralizer or centre of a ring A\mathbf{A}, all these notions will refer to the multiplication on A\mathbf{A}. If x,y∈Ax, y \in \mathbf{A} and yy is invertible, the element xy−1xy^{-1} of A\mathbf{A} is also denoted by x/yx/y when A\mathbf{A} is commutative. The set of invertible elements of A\mathbf{A} is stable under multiplication. Under the law induced by multiplication it is a group called the multiplicative group of A\mathbf{A}, sometimes denoted by A∗\mathbf{A}^*.

Let x,yx, y be in A\mathbf{A}. xx is said to be a left (resp. right) multiple of yy if there exists y′∈Ay' \in \mathbf{A} such that x=y′yx = y'y (resp. x=yy′x = yy'); it is also said that yy is a right (resp.

left) divisor of x. When A is commutative, there is no need to distinguish between "left" and "right".

In conformity with the above terminology, every element y∈Ay \in \mathbf{A} would be considered as a right and left divisor of 0; but, by an abuse of language, in general the term "right (resp. left) divisor of 0" is reserved for elements yy such that there exists x≠0x \neq 0 in A satisfying the relation xy=0xy = 0 (resp. yx=0yx = 0). In other words, the right (resp. left) divisors of zero are the right (resp. left) non-cancellable elements.

Let x∈Ax \in \mathbf{A}. xx is called nilpotent if there exists an integer n>0n > 0 with xn=0x^n = 0. The element 1−x1 - x is then invertible, with inverse equal to

1+x+x2+⋯+xn−1. 1 + x + x^2 + \cdots + x^{n-1}.

As A is a commutative group under addition, the element nxnx for n∈Zn \in \mathbf{Z} and x∈Ax \in \mathbf{A} has been defined (§ 2, no. 8). As γx\gamma_x and δx\delta_x are endomorphisms of the additive group A, γx(ny)=nγx(y)\gamma_x(ny) = n\gamma_x(y) and δy(nx)=nδy(x)\delta_y(nx) = n\delta_y(x), whence

x.(ny)=(nx).y=n.(xy). x.(ny) = (nx).y = n.(xy).
In particular, nx=(n.1)xnx = (n.1)x.

A set A with addition and multiplication satisfying the axioms of a ring with the exception of that assuring the existence of the identity element under multiplication, is called a pseudo-ring.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Transcribed from the printed edition, 1998, Springer. Not translated.