12 Algebraic Structure and Coding Theory
|
|
- Juliana Christine Stokes
- 5 years ago
- Views:
Transcription
1 12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b = b a. Def 2 Let S be a set and S S. Let be a binary operation on S and be an unary operation of S. Then 1. S is closed w.r.t., if a, b S, a b S. 1. S is closed w.r.t., if a S, a S Let us denote an algebra(algebraic system) (S, O, C) where (i) S is an underlying set, (ii) O is the set of operations, and (iii) C is the set of constants. 5/12/16 Kwang-Moo Choe 1
2 Def 3 Let A = (S, O, C) be an algebra. Then A = (S, O, C) is a subalgebra of A, if i) S S and ii) O O, o O : o is same as restricted to S. ( O s, t S s t S ) Ex. 7 (E, +, 0) is a subalgebra of (I, +, 0) but (O, +, 0) is not. Def 4 Let : S S S. An element e S is an identity(unit) element for the operation, if e s = s e = s, s S. An element 0 S is an zero element for the operation, if 0 s = s 0 = 0, s S. Exam. 9 0 Z is a identity element for the algebra (Z, +). 0 Z is a zero element and for the algebra (Z, ). 1 Z is a identity element for the algebra (Z, ). 5/12/16 Kwang-Moo Choe 2
3 Def 5 Let (S, ) be an algebra, e L S is a left identity element for the operation, if e L s = s, s S. 0 L S is a left zero element for the operation, if 0 L s = 0 L, s S. e R S is a right identity element for the operation, if s e R = s, s S. 0 R S is a right zero element for the operation, if s 0 R = s, s S. Thm1 Let : S S S with left identity e L and right identity e R. Then e L = e R and e = e L = e R is called as two-sided identity. proof e R = L e L e R = R e L. Thm 2 Let : S S S with left zero 0 R and right zero 0 R. Then 0 L =0 R and 0 = 0 L = 0 R is called as two-sided zero. proof 0 L = L 0 L 0 R = R 0 R. Cor 1 A two-sided identity(zero) for a binary operation is unique. 5/12/16 Kwang-Moo Choe 3
4 Def 6 Let : S S S and e S is an identity for the operation, if x y = e, then x is the left inverse of y and y is the right inverse of y w.r.t. the operation. If both x y = y x = e, x is the inverse of y(or two-sided inverse of y, y 1 ) w.r.t.. Thm. 3 If an element has both a left inverse and right inverse w.r.t. an associative operation : S S S. Then the the left and right inverse elements are equal. proof Let e be an identity element for the op.. Assume x S, y x = x z = e. y is a left inverse of x and z is an right inverse of x. y = y e = y (x z) = (y x) z = e z = z. 5/12/16 Kwang-Moo Choe 4
5 12.2 Semigroups, Monoids, and Groups Def. 0 Algebraic System: (S, ) is an algebra(or algebraic system), if 1. S is an closed w.r.t and ( 1, +) is an algrbra Def 1 Semigroup: (S, ) is a semigroup, if 1. S is an algebraic system and x, y S, x y S 2. is associative operation ( 1, +) is a semigroup (x y) z = x (y z) = x y z. ( ((a 1 a 2 ) a 3 ) a n-1 ) a n left associative = a 1 (a 2 ( (a n-1 a n ) )) right associative = a 1 a 2 a n-1 a n = a 1 a 2 a n = a 1 a 2 a n. infix prefix postfix a a a a a a = a a a = a n. : S n S is a n-ary operator(n 0) a 1 a 2 a n = i 1,n a i (prefix) indexed(i) set(n 1,n ) notation 5/12/16 Kwang-Moo Choe 5
6 Def 2 Monoid: (S,, e) is a monoid, if 2. (S, ) is a semigroup and 3. e S is an identity element. ( 1, +,?) is not a monoid! But ( 0, +, 0) is a monoid. Let V be a set of symbols called as vocabulary(or alphabet). We define strings over V of length n as V 0 = B { }. (or ; empty string, =0): x V * : x = x = x. V n = R V n-1 V. where AB = {ab a A, b B} We define the universe of strings over V: V * (all strings of length 0, 1, ) V * = n 0 V n. V + = n 1 V n strings of positive length We define concatenation( ) of two strings over V. : V * V * V * x, y V * : x y = xy. (V*,, ) is a (free) monoid generated by the vocabulary V 5/12/16 Kwang-Moo Choe 6
7 Def 3 Group: (S,, e) is a group, if ( 0, +, 0) is not a group 3. (S,, e) is a monoid and (Z, +, 0) is a group 4. x S, 1 x 1 S(unique inverse) w.r.t x x 1 = x 1 x = e. Let s define inverse of : 1 : S S S as x, y S, x 1 y = x y 1. We use to denote a group (S,, e, 1 ) instead of (S,, e) to specify the unique inverse x 1 and binary inverse operation 1. (, +, 0, ) is not a group but (Z, +, 0, ) is a group. x, y x y but x, y Z, x y Z. Ex. 3 R = {r 0, r 60, r 120, r 180, r 240, r 300 } and : R R R r 1 r 2 = r where = [ ] 360. (R,, r 0, 1 ) is a group. 6. : Rotate clackwise 1 : Rotate counter clockwise. 5/12/16 Kwang-Moo Choe 7
8 G = (S,, e, 1 ) is a group, if 1. S is an closed w.r.t, 2. is associative operation, 3. e S is an identity element for the operation, and 4. x S, 1unique inverse element x 1 S w.r.t. 4.5 x, y S, x 1 y = x y 1. Def. 3.5 Commutative (or Abelian) group 1. (S,, e, 1 ) is a group, and 2. is commutative. Ex. 4 (Z, +, 0, ) is a group. and (Z,, 1) is a monoid. Consider three operations on Z, 1 n, n, and n. n, 1 n, n : Z Z Z n where Z n = {0, 1,, n-1}, a n b = [a+b] n, a 1 n b = [a b] n, a n b = [a b] n. addi. mod. of n, inverse of addi...., multi. mod. of n 5/12/16 Kwang-Moo Choe 8
9 Consider a subalgebra (Z n, { n, n 1, n }, {0, 1}). 1. Z n is closed under n and n ; i.e. a, b Z: a n b, a n b Z n. 2. n is commutative and associative. 0 is an identity of. 6. If a Z n, inverse of a w.r.t n, a 1 1 = n n a Z n. 3. (Z n, n, 0, 1 n ) is a group. 4. n is closed, commutative and associative. 1 is an identity of n. 4. a Z n, \ a 1 Z inverse of a w.r.t n a n a 1 = (Z n, n, 1) is a monoid but not a group. 5. n distributes over n. a n (b n c) = (a n b) n (a n c). If n 2, then (Z n, n, 0, n 1 ) is a finite (n 2) homomorphic image of (Aberian) group (Z, +, 0, ). (Z n, n, 1) a finite homomorphic image of a monoid (Z,, 1). 5/12/16 Kwang-Moo Choe 9
10 Finite Groups ({a}, {(a a = a)}, a) a group of order 1 ({a, b},, a) a group of order 2 ({a, b, c},, a) a group of order 3 ({a, b, c, d},, a) two groups of order 4 ({a, b, c, d, e},, a)??? groups of order 5 Finite Subgroup Thm. 1 Let (T,, e) be a group and T T. If T is finite, then (T,, e) is a subgroup of (T,, e), if T is closed under. proof Let a T. Then ( is associative and closed) a 2, a 3, a 4, a n, T. Since T is finite, a n = a m for some n, m 0, n m. a n = a n a m-n, m n 0. e = a m-n is an identity and in T. 5/12/16 Kwang-Moo Choe 10
11 Two cases for identity, e = a m-n, since T is finite. (2) If m n = 1, a 1 = e, a n+1 = a n a 1 = a n e = a n = a a = a a = a 2. a is idendty and inverse of a and in T. T = {a}. T is a singleton set. (1) If m n 1, a m-n = a a m-n-1 = e. a m-n-1 (m - n - 1 0) is the inverse of a and in T. T = {a 1, a 2,, a m-n-1, a m-n,, a m-1 }. T 2. 5/12/16 Kwang-Moo Choe 11
12 Generators for a group Let (T, ) be an algebraic system, and S T. Let S 1 = S {a b A a, b S}. S 1 is called the set generated directly by S. S 2 = S 1 {a b A a, b S 1 } S i+1 = S i {a b A a, b S i } S * = S S 1 S 2 c S *, a, b S *. a b = c. x S *, x is said to be generated by S. S * T is the subsystem generated by S. (S *, ) is called the subsystem generated by S. If S * is finite, (S *, ) is the subgroup.(theorem ) 5/12/16 Kwang-Moo Choe 12
13 If B * = A, B is called a generating set or a set of generators of the algebraic system (A, ). A group that has generating consisting of a single element is called as a cyclic group. Let (A, ) be a cyclic group with generating set {a}. A = {a, a 2, a 3, } a i a j = a j a j = a i+j. associative Any cyclic group is commutative group Let B be a generating set of an algebraic system(a, ). For a A, r 1, and a r = a. a 1 a 2 a r generating sequence for a A 1 i r, j, k i a i = a j a k. 5/12/16 Kwang-Moo Choe 13
14 Example) (, +, 0) is an commutative cyclic group generated by {1} with the identity 0. (V *,, ) is a (free) monoid generated by V with identity. Example) Consider (I, +), B = {1}, and consider 9 addition chain original addition chain for 9(++) shorter addition chain for 9 (4+5) shorter addition chain for 9(3+2, 5+3) the shortest addition chain for 9(3+3, 3+6) The shortest addition chain Method 1. If n = p q. If p 1 p 2 p i-1 p is the shortest addition chain(i) for p and q 1 q 2 q j-1 q is the shortest addition chain(j) for q. Then q 1 q 2 q j-1 q q p 2 q p 3 q p i-1 q p or p 1 p 2 p i-1 p p q 2 p q 3 p q i-1 p q. the shortest addition chain(j+i 1 = i+j 1) for n=p q 5/12/16 Kwang-Moo Choe 14
15 45 = 5 9 5: 1, 2, 3, 5 9: 1, 2, 4, 8, 9 45: 1, 2, 4, 8, 9, 18, 27, 45 or 1, 2, 3, 5, 10, 20, 40, 45 Method 2 If n is even, determine addition chain for n/2, n. If n is odd, determine addition chain for (n-1)/2, (n-1), n. 45, 44, 22, 11, 10, 5, 4, 2, 1 1, 2, 4, 5, 10, 11, 22, 44, 45 Method 2 Method Method 2 is semi optimal! 5/12/16 Kwang-Moo Choe 15
16 Cosets and Lagrange s Theorem Let (T, ) be an algebraic system. and H T. Then Left coset of H w.r.t. a T, denoted as, a H = {a x x H}. Right coset of H w.r.t. a T, denoted as, H a = {x a x H}. Thm. 4 Let a H and H a be two cosets of H. Then a H = H a or a H H a = Thm. 5 (Lagrange s Theorem) The order of any subgroup of a finite group devides the order of the sybgroup. Thm. 6 Any group of prime order is cyclic and any element other than the identity is a generator. It also follows that it is abelian. 5/12/16 Kwang-Moo Choe 16
17 Isomorphism and Automorphism Two systems(algebra) (T, ) and (S, ) are isomorphic, if a bihective function f: T S, such that a, b T: f(a b) = f(a) f(b). An isomorphism from (T, ) to (T, ) is called automorphism. Permutation Group Consider S 3 = {1, 2, 3} be a set and a set of bijective mappings on S 3. Consider a triple (i, j, k) i, j, k S 3 and i j, j k, k i, (i, j, k) {(1, i), (2, j), (3, k)} = {f(1) = i, f(2) = j, f(3) =k} Then there are 6 (=3!) triples, P 3 = {(1, 2, 3) (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), (3, 2, 1)} Consider composition of permutation : P 3 P 3 s.t. p q(i) = p(q(i)) Ex.) (2, 3, 1) (3, 1, 2) = (1, 2, 3), (2, 3, 1) (3, 2, 1) = (1, 3. 2) 5/12/16 Kwang-Moo Choe 17
18 Consider S n = {1, 2,, n} and P n = {p: S n S n }. Then (S n, ) is called as a permutation group of degree n. : P n P n P n. where p q(i) = p(q(i)); Note that S n = n, P n = n!, and = n! n! = n! 2. Thm. 7 Any finite group of order n is isomorphic to a permutation group of degree n. 5/12/16 Kwang-Moo Choe 18
19 12.3 Homomorphisms, Normal Sungroups, and Congruence Relations Def. 1 Let A = (S,, c) and A = (S,, c ) be algebra, and h: S S h(a) h(b) = h(a b), h(c) = c. Then A = (S,, C ) is called as a homomorphic image of A = (S,, C). Since we consider h that is onto, S S. Def A (equivalent) congruence relation ~ S S where a ~ b, if h(a) = h(b) S. (Eqivalent) Congluence Class [a] ~ = h(a) S. (Eqivalent) Congluence Partition Par ~ (S) S. A =(S,, c ) is called as the abstract interpretation of A=(S,, c) A = (S,, c) is called as the refinement of A = (S,, c ). Ex. Group (N n 1, n, 0) is an abstract interpretation of (Z, +, 0). Monoid (N n 1, n, 1) is an abstract interpretations of (Z,, 1). Ex. Group ({ 홀, 짝 },, 짝 ) is an abstract interpretation of (Z, +, 0). Monoid ({ 홀, 짝 },, 홀 ) is an abstract interpretation of (Z,, 1). 5/12/16 Kwang-Moo Choe 19
20 12.4 Rings, Integral Domain, and Fields The operation is distributes over, if a (b c) = (a b) (a c). Def. 1 Let (A,, ) be an algebraic system with two operators and. Then (A,, ) is called as a ring, if 1. (A, ) is an abelian group, 1.5 (A,, e, 1 ) is a group, 2. (A, ) is a semigroup, and 3. The operation is distributive over. We may use ((A,, 0, 1, ) to denote a ring instead of (A,, ) Ex. (,, 0,, ) is not a ring, But (Z,, 0,, ) and (Z n, n, 0, n 1, n ) are rings. : additive operation of the ring a b: sum of a and b : multiplicative operation of the ring a b: multiplication of a and b 5/12/16 Kwang-Moo Choe 20
21 Let (A,, e, 1, ) is a ring with additive identity 0. a A, 0 a = (0 0) a = (0 a) (0 a) 0 a = 0 = a 0. 0: multiplicative zero as well as additive identity. Def. 2 (A,, 0, 1, ) is called an integral domain, if 1. (A,, 0, 1, ) is a ring, and 2. (A, ) is commutative semigroup, and If c 0 and c a = c b, then a = b where 0 is the additive identity and/or multiplicative zero. Ex. 2 Consider is set of integers Z. (Z,, 0,, ) is the integral domain Def. 3 (A,, 0, 1,, 1, 1 ) is called a field, if 1. (A,, 0, 1, ) is a integral domain. 2. (A {0},, 1, 1 ) is an abelian group. 5/12/16 Kwang-Moo Choe 21
22 (A {0},, 1, 1 ) is a group 1: multiplicative identity a 1 : multiplicative inverse of a A {0} a a 1 = 1. 1 :A A {0} A a A, b A {0}: a 1 b = a ( 1 b) multiplication of a and multiplicative inverse of b Example) Let Q be the set of rational numbers. Then (Q,, 0,,, 1, /) is a field. Let is the set of real numbers. Then (,, 0,,, 1, /) is a field. Let C is the set of complex numbers. Then (C,, 0,,, 1, /) is a field. Substruction is not really an independent operation but it is the addition of the additive inverse. Division is the multiplication of the multiplcative inverse. 5/12/16 Kwang-Moo Choe 22
23 12.5 Quotient and Product Algebras Consider (Z n,, ) a b = the remainder of ab divided by n. (Z n, ) is an abelian group, and is commutative (Z n -{0}, ) is an abelian group iff n is prime. If n is not prime, n = ab for some a, b Z n - {0}, But a b = 0 not closed If n is prime, a, b Z n -{0}, a b 0 a b Z n -{0}. is associative and commutative 1 is the identity of. a, b c Z n -{0}, a b a c assume a b = a c ab = kn + r, ac = ln + r a(b-c) = (k-l)n (assume b c, k l) 5/12/16 Kwang-Moo Choe 23
24 Since a, b-c n, and n is prime a(b-c) (k-l)n. a b a c a Z n -{0}, b Z n -{0}. a b = 1. 1/a = b. (Z n -{0},, ) is a field. field of integers modulus n 12.6 Coding Theory 12.7 Polynomial Rings and Polynomial Codes 5/12/16 Kwang-Moo Choe 24
12 Algebraic Structure and Coding Theory
12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b
More informationB Sc MATHEMATICS ABSTRACT ALGEBRA
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More information14 Uncountable Sets(Denial of Self Recursion)
14 Uncountable Sets(Denial of Self Recursion) 14.1 Countable sets Def. 1 Two sets A and B are isomorphic with respect to the bijective function f, iff a bijection f: A B, written A f B or for shorta B.
More information1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationDefinition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationModern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationGroup. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G
Victor Adamchik Danny Sleator Great Theoretical Ideas In Computer Science Algebraic Structures: Group Theory II CS 15-251 Spring 2010 Lecture 17 Mar. 17, 2010 Carnegie Mellon University Group A group G
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationCongruences and Residue Class Rings
Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationMATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More information2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.
Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms
More informationCourse of algebra. Introduction and Problems
Course of algebra. Introduction and Problems A.A.Kirillov Fall 2008 1 Introduction 1.1 What is Algebra? Answer: Study of algebraic operations. Algebraic operation: a map M M M. Examples: 1. Addition +,
More informationNORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION
NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
More informationIntroduction to Groups
Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationNotation. 0,1,2,, 1 with addition and multiplication modulo
Notation Q,, The set of all natural numbers 1,2,3, The set of all integers The set of all rational numbers The set of all real numbers The group of permutations of distinct symbols 0,1,2,,1 with addition
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationChapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationTEST CODE: PMB SYLLABUS
TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional
More informationMaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS
DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationNOTES ON AUTOMATA. Date: April 29,
NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then
More informationQuasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012
Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico
More informationAnswers to Final Exam
Answers to Final Exam MA441: Algebraic Structures I 20 December 2003 1) Definitions (20 points) 1. Given a subgroup H G, define the quotient group G/H. (Describe the set and the group operation.) The quotient
More informationPROBLEMS FROM GROUP THEORY
PROBLEMS FROM GROUP THEORY Page 1 of 12 In the problems below, G, H, K, and N generally denote groups. We use p to stand for a positive prime integer. Aut( G ) denotes the group of automorphisms of G.
More informationSRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS
1 MA6566 - DISCRETE MATHEMATICS UNIT I - LOGIC AND PROOFS Propositional Logic Propositional equivalences-predicates and quantifiers-nested Quantifiers- Rules of inference-introduction to Proofs-Proof Methods
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More informationENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.
ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups.
More informationALGEBRA 11: Galois theory
Galois extensions Exercise 11.1 (!). Consider a polynomial P (t) K[t] of degree n with coefficients in a field K that has n distinct roots in K. Prove that the ring K[t]/P of residues modulo P is isomorphic
More informationABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston
ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston Undergraduate abstract algebra is usually focused on three topics: Group Theory, Ring Theory, and Field Theory. Of the myriad
More informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationMA441: Algebraic Structures I. Lecture 26
MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order
More informationNOTES ON MODULES AND ALGEBRAS
NOTES ON MODULES AND ALGEBRAS WILLIAM SCHMITT 1. Some Remarks about Categories Throughout these notes, we will be using some of the basic terminology and notation from category theory. Roughly speaking,
More informationALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION
ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationKrull Dimension and Going-Down in Fixed Rings
David Dobbs Jay Shapiro April 19, 2006 Basics R will always be a commutative ring and G a group of (ring) automorphisms of R. We let R G denote the fixed ring, that is, Thus R G is a subring of R R G =
More informationLecture 7 Cyclic groups and subgroups
Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:
More informationAbstract Algebra FINAL EXAM May 23, Name: R. Hammack Score:
Abstract Algebra FINAL EXAM May 23, 2003 Name: R. Hammack Score: Directions: Please answer the questions in the space provided. To get full credit you must show all of your work. Use of calculators and
More informationBlock Introduction. Some self study examples and proof of the theorems are left to the readers to check their progress.
Abstract Algebra The word Algebra is derived from the Arabic word al-jabr. Classically, algebra involves the study of equations and a number of problems that devoted out of the theory of equations. Then
More informationMidterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationElements of solution for Homework 5
Elements of solution for Homework 5 General remarks How to use the First Isomorphism Theorem A standard way to prove statements of the form G/H is isomorphic to Γ is to construct a homomorphism ϕ : G Γ
More informationUnit I (Logic and Proofs)
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)
More information1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.
1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M M M, (x, y) x y such that (i) (x y) z = x (y z) x, y, z M (associativity); (ii) e M such that x e = e x = x for all x M (e
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationMATH 420 FINAL EXAM J. Beachy, 5/7/97
MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only
More informationAdvanced Automata Theory 9 Automatic Structures in General
Advanced Automata Theory 9 Automatic Structures in General Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata
More informationLecture Note of Week 2
Lecture Note of Week 2 2. Homomorphisms and Subgroups (2.1) Let G and H be groups. A map f : G H is a homomorphism if for all x, y G, f(xy) = f(x)f(y). f is an isomorphism if it is bijective. If f : G
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationMATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT
MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT The following is the list of questions for the oral exam. At the same time, these questions represent all topics for the written exam. The procedure for
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationMath 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001
Math 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001 1. [Burris-Sanka. 1.1.9] Let A, be a be a finite poset. Show that there is a total (i.e., linear) order on A such that, i.e., a b implies a b. Hint:
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationAlgebra. Travis Dirle. December 4, 2016
Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationMATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes.
MATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes. Subgroups Definition. A group H is a called a subgroup of a group G if H is a subset of G and the
More informationAlgebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
More information