6.6 Rings and fields 6.6.1 Rings 6 Definition 21: A ring is an Abelian group r,+ with an additional associative binary operation (denoted such that for all a, b, CER, (1)a·(b+c)=a·b+a·c, (2)(b+c)·a=b·a+c·a We write oER for the identity element of the group R,+ t Fora eR. we write -a for the additive inverse of a o Remark: Observe that the addition operation is always commutative while the multiplication need not be e Observe that there need not be inverses for multiplication
6.6 Rings and fields 6.6.1 Rings Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that for all a, b, cR, (1) a · (b + c) = a · b + a · c, (2) (b + c) · a = b · a + c · a. We write 0R for the identity element of the group [R, +]. For a R, we write -a for the additive inverse of a. Remark: Observe that the addition operation is always commutative while the multiplication need not be. Observe that there need not be inverses for multiplication
Example: The sets Z,Q, with the usual operations of multiplication and addition form rings, [Z;+,×],Q+,× are rings Let m=((aiinxnlai is real number, Then M; +, x is a ring ◆ Example:S≠,P(S):,n], ◆ Commutative ring
Example: The sets Z,Q, with the usual operations of multiplication and addition form rings, [Z;+,],[Q;+,] are rings Let M={(aij)nn |aij is real number}, Then [M;+,]is a ring Example: S,[P(S);,∩], Commutative ring
Definition 23: A ring r is a commutative ring if ab= ba for all a, bER. A ring r is an unitary ring if there is lER such that la= al a for all aeR. Such an element is called a multiplicative identity
◆Definition 23: A ring R is a commutative ring if ab = ba for all a, bR . A ring R is an unitary ring if there is 1R such that 1a = a1 = a for all aR. Such an element is called a multiplicative identity
x Example: IfR is a ring, then rix denotes the set of polynomials with coefficients in R. We shall not give a formal definition of this set, but it can be thought of as: rx= a0+ajx+ a2x +…+anx叫n∈Z,a∈R} a Multiplication and addition are defined in the usual manner: if f(x)=∑a, c and g(x)=∑ bx' then max( n, m) f(x)+g(x)=∑(+b)xf(x)*g(x)=∑∑(ab,)x k=0计+j=k One then has to check that these operations define a ring The ring is called polynomial ring
Example: If R is a ring, then R[x] denotes the set of polynomials with coefficients in R. We shall not give a formal definition of this set, but it can be thought of as: R[x] = {a0 + a1x + a2x 2 + …+ anx n |nZ+ , aiR}. Multiplication and addition are defined in the usual manner; if = = = = m i i i n i i i f x a x and g x b x 0 0 ( ) ( ) then = + = + max{ , } 0 ( ) ( ) ( ) n m i i i i f x g x a b x + = + = = n m k k i j i j k f x g x a b x 0 ( ) ( ) ( ) One then has to check that these operations define a ring. The ring is called polynomial ring
t Theorem 6.26: Let r be a commutative ring. Then for all a, bER, (a+b)=∑C(n)ab ◆ where n∈Z+
Theorem 6.26: Let R be a commutative ring. Then for all a,bR, where nZ+ . = − + = n i n i n i a b C n i a b 0 ( ) ( , )