2.3 Rings
Thus far, our journey in abstract algebra has primarily focused on groups, which are algebraic structures defined by a single operation. Our logical next step would be exploring entities with two operations, typically denoted by addition (+) and multiplication (⋅). The introduction of a second operation opens many possibilities in defining algebraic structures like rings, fields, modules, and vector spaces.
Among these, rings hold a place of special interest. What makes rings particularly intriguing is their ability to describe polynomial structures. The study of polynomial rings bridges the gap between algebra and geometry, playing a crucial role in algebraic geometry. Moreover, the manipulation and factorization of polynomials in rings are fundamental operations in number theory, calculus, and even in solving real-world problems. And of course, polynomials are central to the field of zero-knowledge cryptography.
Rings
def: Ring
Associativity:Distributivity:∢R∈G+A⋅:R×R→R∀x,y,z∈R:(x⋅y)⋅z=x⋅(y⋅z)∀x,y,z∈R:x⋅(y+z)=x⋅y+x⋅z∀x,y,z∈R:(x+y)⋅z=x⋅z+y⋅zR∈R(R is a ring)
Recall that we denote identity e for + by 0 and inverse element a−1 by −a.
Unlike groups, where we can use any symbol to denote group operation, for rings we will exclusively adhere to + and ⋅ notation.
def: Ring with identity
Identity:∢R∈R∃1∈R:∀x∈R:x⋅1=1⋅x=xR∈R1(R is a ring with identity)
Example: Rings of numbers
Z,Q,R,C with ordinary operations + and ⋅ are rings. It can be verified relatively easily by checking that these sets, along with these operations, satisfy the defining properties of a ring.
Example: Rings of polynomials
Let R∈R be a ring from the example above (one of Z,Q,R,C). We define the polynomial ring R[x]:={anxn+an−1xn−1+…+a1x+a0,n∈N0,ai∈R}.
This ring consists of polynomials with coefficients in R, and the operations of addition and multiplication are performed in the usual manner as they are with polynomials. For instance,
(x2+3x+1)+(2x−1)=x2+5x(x2+1)⋅(x2−1)=x4−1
We will establish that R[x] indeed forms a ring in the subsequent sections, providing a thorough exploration of its ring properties.
Proposition 2.3.1: Ring properties
∢R∈Ra0=0a=0a(−b)=(−a)b=−ab(−a)(−b)=ab(a)(b)(c)
Proof
a.
a0=a(0+0)=a0+a0⟹0=a0
b.
ab+a(−b)=a(b−b)=a0=0
c.
(−a)(−b)=−(a)(−b)=ab
□
Sometimes the notation R∈R,1=0 is used to define a non-trivial ring with identity. If we have 1=0 then ∀a∈R:a=a⋅1=a⋅0=(2.3.1)0, so the ring is trivial.
def: Ring characteristic
∢R∈RS:={n∈N:∀r∈R:nr=0}char R:={minS,0,S=∅S=∅
Proposition 2.3.2: Ring characteristic = identity order
∢R∈R1char R=ord (R,+)1
Proof
n:=ord (R,+)1∀r∈R:n⋅r=(n⋅1)⋅r=0
On the other hand ∀k<n,k⋅1=0, thus char R=n
Subrings
def: Subring
∢S1∈RS2⊆S1S2∈RS2⊆RS1(S2 is a subring of S1)
Proposition 2.3.3: Subring criterion
∢R∈RS⊆RS=∅∀r,s∈S:r−s∈S∀r,s∈S:rs∈S(a)(b)(c)S⊆RR
Proof
(a),(b)⟹(2.2.3)S⊆(G,+)R.
(c) implies that operation ⋅ is well-defined, thus it inherits associativity and distributivity property from R.
□
Example: A subring of integers
nZ:={nk,k∈Z}⊆RZ. Let's use criterion (2.3.3):
nZ=∅∀r1,r2:r1=nk1,r2=nk2⟹r1−r2=n(k1−k2)=nk3∈nZr1r2=nk1nk2=nk4∈nZ
Note that this ring is a ring without the identity.
Ideals and factor rings
The concept of an ideal in ring theory is analogous to that of a normal subgroup in group theory, particularly in the context of homomorphisms. Just as a normal subgroup is a subgroup that remains invariant under conjugation by any group element, an ideal is a special subset of a ring that is closed under the ring's addition and compatible with its multiplication. This similarity becomes especially visible when exploring homomorphisms, as ideals play a key role in the formation of factor rings, much like normal subgroups are used in the construction of factor groups.
def: Ideal
∢S∈RI⊆RS∀s∈S:sI⊆I,Is⊆II⊲RS,I−ideal in S
We only require that I⊆RS, but since a ring by definition is abelian in +, it follows from (2.2.20) that I⊲(G,+)S.
Example: Trivial ideals
{0} and R are trivial ideals in the ring R.
Example: An ideal in integers
nZ:={nk,k∈Z}⊲RZ. We already know that nZ⊆RZ. Now ∀s∈Z,r∈nZ:sr=snr1=nsr1=nk∈nZ⟹snZ⊆nZ, similarly nZs⊆nZ.
def: Sum and product of ideals
∢R∈RI⊲RRJ⊲RRI+J:={a+b,a∈I,b∈J}IJ:={i≤n∑aibi,∀n∈Z,ai∈I,bi∈J}(a)(b)
In contrast to the product concepts in set theory or group theory, the product of ideals in ring theory involves more than merely multiplying two elements together. Instead, the product of two ideals consists of all possible finite sums of products of elements from each ideal. This approach is necessary to ensure closure under the addition operation.
Many rings (inluding those that are of interest for us) are infinite and thus, their ideals are infinite as well. The study of infinite objects gives rise to a certain set of obstacles. Hoewever, we can simplify the study of ideals introducing the notion of finitely generated ideals.
def: Finitely generated ideal
∢R∈RS⊆R,S={a1,…,ak}⟨S⟩I:S⊆⟨S⟩I⊲RR∀I:S⊆I⊲RR:⟨S⟩I⊆I⟨S⟩I≡⟨a1,…,ak⟩I− finitely generated ideal
In other words finitely generated ideal for a set S is a minimal ideal containing this set.
Proposition 2.3.4: Ideal properties
∢R∈RI⊲RRJ⊲RRI+J⊲RRI+J=⟨I∪J⟩IIJ⊲RRIJ⊆RI∩J(a)(b)(c)(d)
Proof
a.
I+J=∅∀i1,i2∈I,j1,j2∈J:(i1+j1)−(i2+j2)=(i1−i2)+(j1−j2)∈I+J∀r∈R,i∈I,j∈J:r(i+j)=ri+rj∈I+J∀r∈R,i∈I,j