B.Sc. III Year Mr. Shrimangale G.W.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

1 Lect. 12: Number Theory. Contents Prime and Relative Prime Numbers Modular Arithmetic Fermat’s and Euler’s Theorem Extended Euclid’s Algorithm.
Cryptography and Network Security
Basic properties of the integers
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
Groups TS.Nguyễn Viết Đông.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Introduction Polynomials
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Finite fields.
WHOLE NUMBERS; INTEGERS Whole numbers: Z 0,+ = the natural numbers  {0}. Integers:
Rings,Fields TS. Nguyễn Viết Đông Rings, Integral Domains and Fields, 2. Polynomial and Euclidean Rings 3. Quotient Rings 2.
Unit – IV Algebraic Structures
FINITE FIELDS 7/30 陳柏誠.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
By: Hector L Contreras SSGT / USMC
Numbers, Operations, and Quantitative Reasoning.
Groups Definition A group  G,  is a set G, closed under a binary operation , such that the following axioms are satisfied: 1)Associativity of  :
Order in the Integers Characterization of the Ring of Integers.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation(denoted · such that.
Great Theoretical Ideas in Computer Science.
Rational Numbers and Fields
Scott CH Huang COM5336 Cryptography Lecture 11 Euclidean Domains & Division Algorithm Scott CH Huang COM 5336 Cryptography Lecture 10.
Information Security Lab. Dept. of Computer Engineering 87/121 PART I Symmetric Ciphers CHAPTER 4 Finite Fields 4.1 Groups, Rings, and Fields 4.2 Modular.
Information and Coding Theory Cyclic codes Juris Viksna, 2015.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
SECTION 10 Cosets and the Theorem of Lagrange Theorem Let H be a subgroup of G. Let the relation  L be defined on G by a  L b if and only if a -1 b 
 Theorem 6.21: Let H be a subgroup of G. H is a normal subgroup of G iff g -1 hg  H for  g  G and h  H.  Proof: (1) H is a normal subgroup of G.
Divisibility and Modular Arithmetic
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
The Relation Induced by a Partition
Math 3121 Abstract Algebra I
Chapter4: Finite Fields
Discrete Math II Howon Kim
Unit-III Algebraic Structures
CS480 Cryptography and Information Security
Properties of Operations
Great Theoretical Ideas in Computer Science
Chapter 3 The Real Numbers.
Advanced Algorithms Analysis and Design
Groups and Applications
Great Theoretical Ideas In Computer Science
Math 3121 Abstract Algebra I
Chapter 3 The Real Numbers.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Foundations of Discrete Mathematics
Great Theoretical Ideas in Computer Science
Great Theoretical Ideas in Computer Science
Section 10.1 Groups.
B.Sc. III Year Mr. Shrimangale G.W.
I. Finite Field Algebra.
Theorem 6.29: Any Field is an integral domain
1.3 – AXIOMS FOR THE REAL NUMBERS
Rings,Fields TS. Nguyễn Viết Đông.
Algebraic Structures: Group Theory
For g2G2, (n)(N), g1G1 s.t (g1)=g2 ? surjection homomorphism.
2. From Groups to Surfaces
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Lecture 3 Strings and Things (Section 1.1)
Section 9.1 Groups.
Presentation transcript:

B.Sc. III Year Mr. Shrimangale G.W. Rings, Fields B.Sc. III Year Mr. Shrimangale G.W.

Rings, Integral Domains and Fields

Rings Rings A ring (R,+, ・) is a set R, together with two binary operations + and ・ on R satisfying the following axioms. For any elements a, b, c ∈ R, (i) (a + b) + c = a + (b + c). (associativity of addition) (ii) a + b = b + a. (commutativity of addition) (iii) there exists 0 ∈ R, called the zero, such that a + 0 = a. (existence of an additive identity) (iv) there exists (−a) ∈ R such that a + (−a) = 0.(existence of an additive inverse) (v) (a ・ b) ・ c = a ・ (b ・ c). (associativity of multiplication)

Rings (vi) there exists 1 ∈ R such that 1・ a = a ・ 1 = a. (existence of multiplicative identity) a ・ (b + c) = a ・ b + a ・ c and (b + c)・ a = b ・ a + c ・ a.(distributivity) Axioms (i)–(iv) are equivalent to saying that (R,+) is an abelian group. The ring (R,+, ・) is called a commutative ring if, in addition, (viii) a ・ b = b ・ a for all a, b ∈ R. (commutativity of multiplication)

Commutative Rings The integers under addition and multiplication satisfy all of the axioms above,so that (Z,+, ・) is a commutative ring. Also, (Q, +,・), (R,+, ・), and (C,+, ・) are all commutative rings. If there is no confusion about the operations, we write only R for the ring (R,+, ・). Therefore, the rings above would be referred to as Z,Q,R, or C. Moreover, if we refer to a ring R without explicitly defining its operations, it can be assumed that they are addition and multiplication. Many authors do not require a ring to have a multiplicative identity, and most of the results we prove can be verified to hold for these objects as well. We must show that such an object can always be embedded in a ring that does have a multiplicative identity.

Integral Domains and Fields One very useful property of the familiar number systems is the fact that if ab = 0, then either a = 0 or b = 0. This property allows us to cancel nonzero elements because if ab = ac and a  0, then a(b − c) = 0, so b = c. However, this property does not hold for all rings. For example, in Z4, we have [2] ・ [2] = [0], and we cannot always cancel since [2] ・ [1] = [2] ・ [3], but [1][3]. If (R,+, ・) is a commutative ring, a nonzero element a ∈ R is called a zero divisor if there exists a nonzero element b ∈ R such that a ・ b = 0. A nontrivial commutative ring is called an integral domain if it has no zero divisors.

Integral Domains and Fields A field is a ring in which the nonzero elements form an abelian group under multiplication. In other words, a field is a nontrivial commutative ring R satisfying the following extra axiom. (ix) For each nonzero element a ∈ R there exists a−1 ∈ R such that a ・ a−1 = 1. The rings Q,R, and C are all fields, but the integers do not form a field. Proposition:- Every field is an integral domain; that is, it has no zero divisors.

Integral Domains and Fields Theorem :- A finite integral domain is a field. Proof. Let D = {x0, x1, x2, . . . , xn} be a finite integral domain with x0 as 0 and x1 as 1. We have to show that every nonzero element of D has a multiplicative inverse. If xi is nonzero, we show that the set xiD = {xix0, xix1, xix2, . . . , xixn} is the same as the set D. If xixj = xixk, then, by the cancellation property, xj = xk.Hence all the elements xix0, xix1, xix2, . . . ,xixn are distinct, and xiD is a subset of D with the same number of elements. Therefore, xiD = D. But then there is some element, xj , such that xixj = x1 = 1. Hence xj = xi -1, and D is a fiel

Integral Domains and Fields Theorem :- Zn is a field if and only if n is prime. Proof. Suppose that n is prime and that [a] ・ [b] = [0] in Zn. Then n|ab. So n|a or n|b by Euclid’s Lemma . Hence [a] = [0] or [b] = [0], and Zn is an integral domain. Since Zn is also finite, it follows from previous theorem that Zn is a field. Suppose that n is not prime. Then we can write n = rs, where r and s are integers such that 1 < r < n and 1 < s < n. Now [r] = [0] and [s] = [0] but [r] ・ [s] = [rs] = [0]. Therefore, Zn has zero divisors and hence is not a field.

Rings, Integral Domains and Fields Example:- Is (Q(√2),+, ・) an integral domain or a field? Solution. From Example 1.1.2 we know that Q(√2) is a commutative ring. Let a + b√2 be a nonzero element, so that at least one of a and b is not zero. Hence a − b√2  0 (because √2 is not in Q), so we have This is an element of Q(√2), and so is the inverse of a + b√2. Hence Q(√2) is a field (and an integral domain).

Ideals and quotient rings

Ideals Ideals. A nonempty subset I of a ring R is called an ideal of R if the following conditions are satisfied for all x, y ∈ I and r ∈ R: (i) x − y ∈ I . (ii) x ・ r and r ・ x ∈ I . Condition (i) implies that (I,+) is a subgroup of (R,+). In any ring R, R itself is an ideal, and {0} is an ideal. Proposition. Let a be an element of commutative ring R. The set {ar|r ∈ R} of all multiples of a is an ideal of R called the principal ideal generated by a. This ideal is denoted by (a).

Ideals For example, (n) = nZ, consisting of all integer multiples of n, is the principal ideal generated by n in Z. The set of all polynomials in Q[x] that contain x2 − 2 as a factor is the principal ideal (x2 − 2) = {(x2 − 2) ・ p(x)|p(x) ∈ Q[x]} generated by x2 − 2 in Q[x]. The set of all real polynomials that have zero constant term is the principal ideal (x) = {x ・ p(x)|p(x) ∈ R[x]} generated by x in R[x]. It is also the set of real polynomials with 0 as a root. The set of all real polynomials, in two variables x and y, that have a zero constant term is an ideal of R[x, y]. However, this ideal is not principal

Quotient rings Quotient rings. Let I be an ideal in the ring R. Then the set of cosets forms a ring (R/I,+, ・) under the operations defined by (I + r1) + (I + r2) = I + (r1 + r2) and (I + r1)(I + r2) = I + (r1r2). This ring (R/I,+, ・) is called the quotient ring (or factor ring) of R by I

Thank you