Skip to main content

Rings

A ring is like a field, but where elements may not be invertible. Basically, it's a structure where we can

  • add

  • multiply

  • subtract

but not necessarily divide. If you know what polynomials are already, you can think of it as the minimal necessary structure for polynomials to make sense. That is, if RR is a ring, then we can define the set of polynomials R[x]R[x] (basically arithmetic expressions in the variable xx) and think of any polynomial fR[x]f \in R[x] giving rise to a function RRR \to R defined by substituting in for xx in ff and computing using ++ and \cdot as defined in RR.

So, in full, a ring RR is a set equipped with

  • (+) ⁣:R×RR(+) \colon R \times R \to R

  • () ⁣:R×RR(\cdot) \colon R \times R \to R

  • () ⁣:RR(-) \colon R \to R

  • 0R0 \in R

  • 1R1 \in R

such that

  • (+,0,)(+, 0, -) gives the structure of an abelian group

  • ()(\cdot) is associative and commutative with identity 11

  • ++ distributes over \cdot. I.e., x(y+z)=xy+xzx \cdot (y + z) = x\cdot y + x \cdot z for all x,y,zx, y, z.