< back to index

Ring

Definition

A ring (R,×,+)(R,\times,+) is a set equipped with two binary operations such that.

Properties

Anything multiplied by zero is zero: let aRa \in R, then 0a=(00)a=0a0a=00a = (0-0)a = 0a - 0a = 0 holds by the distributiivity laws.

The trivial ring {0}\{0\} is the only ring such that 0=10 = 1. Proof: suppose 0=10=1 in RR and aRa \in R. Then a=1a=0a=0a = 1a = 0a = 0.

Element types

If r,sR\{0}r, s \in R\setminus\{0\} s.t. sr=0sr=0 then we say r,sr,s are zero-divisors.

Types

If multiplication is commutative, we say R is commutative.

If R is commutative and has no zero-divisors, we say R is an integral domain.

If all ideals of RR are principal, we say R is a principal ideal domain.

Fields are Euclidean domains are principal ideal domains are unique factorisation domains are integral domains are commutative rings are rings.

Examples

,𝔽[t]\mathbb{Z}, \mathbb{F}[t] are a Euclidean domains.

The set of linear transformations T:VVT: V \to V, and more generally the set of endomorphisms of a module, is a non-commutative ring.

The set of continuous functions \mathbb{R} \to \mathbb{R} (with pointwise addition & multiplication) is a commutative ring but not an integral domain. The set of holomorphic functions UU \to \mathbb{C} (where UU is an open subset of \mathbb{C}) is an integral domain.

The Green Goose trans Best viewed with Firefox/Floorp/Icecat/Pale Moon/Tor Browser/Zen Browser MathML Now! LaTeX

all these pages adapted with probably insufficient credit from my university's lecture notes