DOCSLIB.ORG

Algebra I (Math 200)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algebra I (Math 200) Algebra I (Math 200) UCSC, Fall 2009 Robert Boltje Contents 1 Semigroups and Monoids 1 2 Groups 4 3 Normal Subgroups and Factor Groups 11 4 Normal and Subnormal Series 17 5 Group Actions 22 6 Symmetric and Alternating Groups 29 7 Direct and Semidirect Products 33 8 Free Groups and Presentations 35 9 Rings, Basic Definitions and Properties 40 10 Homomorphisms, Ideals and Factor Rings 45 11 Divisibility in Integral Domains 55 12 Unique Factorization Domains (UFD), Principal Ideal Do- mains (PID) and Euclidean Domains 60 13 Localization 65 14 Polynomial Rings 69 Chapter I: Groups 1 Semigroups and Monoids 1.1 Definition Let S be a set. (a) A binary operation on S is a map b : S × S ! S. Usually, b(x; y) is abbreviated by xy, x · y, x ∗ y, x • y, x ◦ y, x + y, etc. (b) Let (x; y) 7! x ∗ y be a binary operation on S. (i) ∗ is called associative, if (x ∗ y) ∗ z = x ∗ (y ∗ z) for all x; y; z 2 S. (ii) ∗ is called commutative, if x ∗ y = y ∗ x for all x; y 2 S. (iii) An element e 2 S is called a left (resp. right) identity, if e ∗ x = x (resp. x ∗ e = x) for all x 2 S. It is called an identity element if it is a left and right identity. (c) S together with a binary operation ∗ is called a semigroup, if ∗ is as- sociative. A semigroup (S; ∗) is called a monoid if it has an identity element. 1.2 Examples (a) Addition (resp. multiplication) on N0 = f0; 1; 2;:::g is a binary operation which is associative and commutative. The element 0 (resp. 1) is an identity element. Hence (N0; +) and (N0; ·) are commutative monoids. N := f1; 2;:::g together with addition is a commutative semigroup, but not a monoid. (N; ·) is a commutative monoid. (b) Let X be a set and denote by P(X) the set of its subsets (its power set). Then, (P(X); [) and (P(X); \) are commutative monoids with respective identities ; and X. (c) x∗y := (x+y)=2 defines a binary operation on Q which is commutative but not associative. (Verify!) (d) Let X be a set. Then, composition (f; g) 7! f ◦g is a binary operation on the set F (X; X) of all functions X ! X.(F (X; X); ◦) is a monoid with the identity map idX : X ! X, x 7! x, as identity element. In general it is not commutative. (Verify!) 1.3 Remark Sometimes a binary operation ∗ is given by a table of the form ∗ ··· y ··· . x ··· x ∗ y . 1 For instance, the binary operation \and" on the set ftrue; falseg can be de- picted as ^ true false true true false false false false 1.4 Remark Let (S; ∗) be a semigroup and let x1; : : : ; xn 2 S. One defines x1 ∗ x2 ∗ · · · ∗ xn := x1 ∗ (x2 ∗ (· · · ∗ xn) ··· ). Note that this element equals the element that one obtains by any other choice of setting the parentheses. This can be proved by induction on n using the associativity of ∗. We omit the proof. 1.5 Proposition Let S be a set with a binary operation ∗. If e 2 S is a left identity and f 2 S is a right identity, then e = f. In particular, there exists at most one identity element in S. Proof Since e is a left identity, we have e ∗ f = f. But since f is a right identity, we also have e ∗ f = e. Thus, e = e ∗ f = f. 1.6 Remark Identity elements are usually denoted by 1 (resp. 0), if the binary operation is denoted by ∗, ·, •, ◦ (resp. +). 1.7 Definition Let (M; ∗) be a monoid and let x 2 M. An element y 2 M is called a left (resp. right) inverse of x if y ∗ x = 1 (resp. x ∗ y = 1). If y is a left and right inverse of x, then y is called an inverse of x. If x has an inverse, we call x an invertible element of M. 1.8 Proposition Let (M; ∗) be a monoid and let x 2 M. If y 2 M is a left inverse of x and z 2 M is a right inverse of x, then y = z. In particular, every element of M has at most one inverse. Proof We have y = y ∗ 1 = y ∗ (x ∗ z) = (y ∗ x) ∗ z = 1 ∗ z = z. 1.9 Remark If x is an invertible element in a monoid, then we denote its (unique) inverse by x−1 (resp. −x), if the binary operation is denoted by ∗, ·, •, ◦ (resp. +). 2 1.10 Example Let ! n a b o M := a; b; c 2 : 0 c Z M is a non-commutative monoid under matrix multiplication. The element a b! has an inverse if and only if a; c 2 {±1g. In this case, one has 0 c −1 a b! a −abc! = : 0 c 0 c (Verify!) 1.11 Proposition Let (M; ∗) be a monoid and let x; y 2 M. (a) If x is invertible, then also x−1 is invertible with (x−1)−1 = x. (b) If x and y are invertible, then also x ∗ y is invertible with inverse y−1 ∗ x−1. (c) The identity element 1 is invertible with 1−1 = 1. Proof (a) Since x ∗ x−1 = 1 = x−1 ∗ x, the element x is a left and right inverse of x−1. (b) We have (x∗y)∗(y−1 ∗x−1) = ((x∗y)∗y−1)∗x−1 = (x∗(y∗y−1))∗x−1 = (x ∗ 1) ∗ x−1 = x ∗ x−1 = 1, and similarly, we have (y−1 ∗ x−1) ∗ (x ∗ y) = 1. This implies that y−1 ∗ x−1 is a left and right inverse of x ∗ y. (c) This follows from the equation 1 ∗ 1 = 1. 1.12 Definition In a semigroup S we set xn := x ∗ · · · ∗ x (n factors) for any x 2 S and n 2 N. If S is a monoid we also define x0 := 1 for all x 2 S. If additionally x is invertible, we define x−n := x−1 ∗ · · · ∗ x−1 (n factors) for any n 2 N. 1.13 Remark For an element x in a monoid we have the usual rules: xm ∗ xn = xm+n and (xm)n = xmn ; for all m; n 2 N. If x is invertible, these rules hold for all m; n 2 Z. This can be proved by distinguishing the cases that m; n are positive, negative or equal to 0. Moreover, if x and y are elements in a commutative monoid then n n n (x ∗ y) = x ∗ y for all n 2 Z. 3 2 Groups From now on through the rest of this chapter we will usually write abstract binary operations in the form (x; y) 7! xy. 2.1 Definition A group G is a monoid in which every element is invertible. A group is called abelian if it is commutative. The order of G is the number of elements of G. It is denoted by jGj. 2.2 Remark If G is a semigroup with a left (resp. right) identity e in which every element has a left (resp. right) inverse with respect to e, then G is a group. (cf. Homework.) 2.3 Examples (a) (Z; +), (Q; +), (R; +), (C; +) are abelian groups, but (N0; +) is not. (b) (Qrf0g; ·), (Rrf0g; ·), (Crf0g; ·) are abelian groups, but (Zrf0g; ·) and (Q; ·) are not. (c) (f1g; ·) and (f0g; +) are groups of order 1. A group of order 1 is called a trivial group. (d) For any set X, the set Sym(X) := ff : X ! X j f is bijectiveg is a group under composition. It is called the symmetric group on X. Its elements are called permutations of X. If jXj = n, then jSym(X)j = n!. We write Sym(n) instead of Sym(f1; 2; : : : ; ng) and call Sym(n) the symmetric group of degree n. We use the following notation for π 2 Sym(n): 1 2 ··· n ! 1 2 3! π = ; e:g:; π = 2 Sym(3) : π(1) π(2) ··· π(n) 2 1 3 (e) If G1;G2;:::;Gn are groups, then also their direct product G1 × G2 × · · · × Gn is a group under (x1; : : : ; xn)(y1; : : : ; yn) = (x1y1; : : : ; xnyn) : (f) For every n 2 N, the sets GLn(Q), GLn(R), GLn(C) of invertible ma- trices with entries in Q, R, C, respectively, form groups under multiplication. 2.4 Definition Let G and H be groups. A map f : G ! H is called a homomorphism, if f(xy) = f(x)f(y) for all x; y 2 G. The set of all ho- momorphisms from G to H is denoted by Hom(G; H). A homomorphism f : G ! H is called 4 (a) a monomorphism if f is injective, (b) an epimorphism if f is surjective, (c) an isomorphism if f is bijective, (d) an endomorphism if G = H, (e) an automorphism if G = H and f is bijective. 2.5 Remark Let f : G ! H be a homomorphism between groups G and −1 −1 H. Then f(1G) = 1H and f(x ) = f(x) for all x 2 G. Moreover, if also g : H ! K is a homomorphism between H and a group K, then g◦f : G ! K is a homomorphism. If f : G ! H is an isomorphism, then also its inverse f −1 : H ! G is an isomorphism. The automorphisms f : G ! G form again a group under composition, called the automorphism group of G and denoted by Aut(G).
Load more

Recommended publications
  • Boolean and Abstract Algebra Winter 2019
    Queen's University School of Computing CISC 203: Discrete Mathematics for Computing II Lecture 7: Boolean and Abstract Algebra Winter 2019 1 Boolean Algebras Recall from your study of set theory in CISC 102 that a set is a collection of items that are related in some way by a common property or rule. There are a number of operations that can be applied to sets, like [, \, and C. Combining these operations in a certain way allows us to develop a number of identities or laws relating to sets, and this is known as the algebra of sets. In a classical logic course, the first thing you typically learn about is propositional calculus, which is the branch of logic that studies propositions and connectives between propositions. For instance, \all men are mortal" and \Socrates is a man" are propositions, and using propositional calculus, we may conclude that \Socrates is mortal". In a sense, propositional calculus is very closely related to set theory, in that propo- sitional calculus is the study of the set of propositions together with connective operations on propositions. Moreover, we can use combinations of connective operations to develop the laws of propositional calculus as well as a collection of rules of inference, which gives us even more power to manipulate propositions. Before we continue, it is worth noting that the operations mentioned previously|and indeed, most of the operations we have been using throughout these notes|have a special name. Operations like [ and \ apply to pairs of sets in the same way that + and × apply to pairs of numbers.
    [Show full text]
  • 7.2 Binary Operators Closure
    last edited April 19, 2016 7.2 Binary Operators A precise discussion of symmetry benefits from the development of what math- ematicians call a group, which is a special kind of set we have not yet explicitly considered. However, before we define a group and explore its properties, we reconsider several familiar sets and some of their most basic features. Over the last several sections, we have considered many di↵erent kinds of sets. We have considered sets of integers (natural numbers, even numbers, odd numbers), sets of rational numbers, sets of vertices, edges, colors, polyhedra and many others. In many of these examples – though certainly not in all of them – we are familiar with rules that tell us how to combine two elements to form another element. For example, if we are dealing with the natural numbers, we might considered the rules of addition, or the rules of multiplication, both of which tell us how to take two elements of N and combine them to give us a (possibly distinct) third element. This motivates the following definition. Definition 26. Given a set S,abinary operator ? is a rule that takes two elements a, b S and manipulates them to give us a third, not necessarily distinct, element2 a?b. Although the term binary operator might be new to us, we are already familiar with many examples. As hinted to earlier, the rule for adding two numbers to give us a third number is a binary operator on the set of integers, or on the set of rational numbers, or on the set of real numbers.
    [Show full text]
  • An Elementary Approach to Boolean Algebra
    Eastern Illinois University The Keep Plan B Papers Student Theses & Publications 6-1-1961 An Elementary Approach to Boolean Algebra Ruth Queary Follow this and additional works at: https://thekeep.eiu.edu/plan_b Recommended Citation Queary, Ruth, "An Elementary Approach to Boolean Algebra" (1961). Plan B Papers. 142. https://thekeep.eiu.edu/plan_b/142 This Dissertation/Thesis is brought to you for free and open access by the Student Theses & Publications at The Keep. It has been accepted for inclusion in Plan B Papers by an authorized administrator of The Keep. For more information, please contact [email protected]. r AN ELEr.:ENTARY APPRCACH TC BCCLF.AN ALGEBRA RUTH QUEAHY L _J AN ELE1~1ENTARY APPRCACH TC BC CLEAN ALGEBRA Submitted to the I<:athematics Department of EASTERN ILLINCIS UNIVERSITY as partial fulfillment for the degree of !•:ASTER CF SCIENCE IN EJUCATION. Date :---"'f~~-----/_,_ffo--..i.-/ _ RUTH QUEARY JUNE 1961 PURPOSE AND PLAN The purpose of this paper is to provide an elementary approach to Boolean algebra. It is designed to give an idea of what is meant by a Boclean algebra and to supply the necessary background material. The only prerequisite for this unit is one year of high school algebra and an open mind so that new concepts will be considered reason­ able even though they nay conflict with preconceived ideas. A mathematical science when put in final form consists of a set of undefined terms and unproved propositions called postulates, in terrrs of which all other concepts are defined, and from which all other propositions are proved.
    [Show full text]
  • Irreducible Representations of Finite Monoids
    U.U.D.M. Project Report 2019:11 Irreducible representations of finite monoids Christoffer Hindlycke Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Mars 2019 Department of Mathematics Uppsala University Irreducible representations of finite monoids Christoffer Hindlycke Contents Introduction 2 Theory 3 Finite monoids and their structure . .3 Introductory notions . .3 Cyclic semigroups . .6 Green’s relations . .7 von Neumann regularity . 10 The theory of an idempotent . 11 The five functors Inde, Coinde, Rese,Te and Ne ..................... 11 Idempotents and simple modules . 14 Irreducible representations of a finite monoid . 17 Monoid algebras . 17 Clifford-Munn-Ponizovski˘ıtheory . 20 Application 24 The symmetric inverse monoid . 24 Calculating the irreducible representations of I3 ........................ 25 Appendix: Prerequisite theory 37 Basic definitions . 37 Finite dimensional algebras . 41 Semisimple modules and algebras . 41 Indecomposable modules . 42 An introduction to idempotents . 42 1 Irreducible representations of finite monoids Christoffer Hindlycke Introduction This paper is a literature study of the 2016 book Representation Theory of Finite Monoids by Benjamin Steinberg [3]. As this book contains too much interesting material for a simple master thesis, we have narrowed our attention to chapters 1, 4 and 5. This thesis is divided into three main parts: Theory, Application and Appendix. Within the Theory chapter, we (as the name might suggest) develop the necessary theory to assist with finding irreducible representations of finite monoids. Finite monoids and their structure gives elementary definitions as regards to finite monoids, and expands on the basic theory of their structure. This part corresponds to chapter 1 in [3]. The theory of an idempotent develops just enough theory regarding idempotents to enable us to state a key result, from which the principal result later follows almost immediately.
    [Show full text]
  • Semigroups and Monoids 
    S Luis Alonso-Ovalle // Contents Subgroups Semigroups and monoids Subgroups Groups. A group G is an algebra consisting of a set G and a single binary operation ◦ satisfying the following axioms: . ◦ is completely defined and G is closed under ◦. ◦ is associative. G contains an identity element. Each element in G has an inverse element. Subgroups. We define a subgroup G0 as a subalgebra of G which is itself a group. Examples: . The group of even integers with addition is a proper subgroup of the group of all integers with addition. The group of all rotations of the square h{I, R, R0, R00}, ◦i, where ◦ is the composition of the operations is a subgroup of the group of all symmetries of the square. Some non-subgroups: SEMIGROUPS AND MONOIDS . The system h{I, R, R0}, ◦i is not a subgroup (and not even a subalgebra) of the original group. Why? (Hint: ◦ closure). The set of all non-negative integers with addition is a subalgebra of the group of all integers with addition, because the non-negative integers are closed under addition. But it is not a subgroup because it is not itself a group: it is associative and has a zero, but . does any member (except for ) have an inverse? Order. The order of any group G is the number of members in the set G. The order of any subgroup exactly divides the order of the parental group. E.g.: only subgroups of order , , and are possible for a -member group. (The theorem does not guarantee that every subset having the proper number of members will give rise to a subgroup.
    [Show full text]
  • Binary Operations
    Binary operations 1 Binary operations The essence of algebra is to combine two things and get a third. We make this into a definition: Definition 1.1. Let X be a set. A binary operation on X is a function F : X × X ! X. However, we don't write the value of the function on a pair (a; b) as F (a; b), but rather use some intermediate symbol to denote this value, such as a + b or a · b, often simply abbreviated as ab, or a ◦ b. For the moment, we will often use a ∗ b to denote an arbitrary binary operation. Definition 1.2. A binary structure (X; ∗) is a pair consisting of a set X and a binary operation on X. Example 1.3. The examples are almost too numerous to mention. For example, using +, we have (N; +), (Z; +), (Q; +), (R; +), (C; +), as well as n vector space and matrix examples such as (R ; +) or (Mn;m(R); +). Using n subtraction, we have (Z; −), (Q; −), (R; −), (C; −), (R ; −), (Mn;m(R); −), but not (N; −). For multiplication, we have (N; ·), (Z; ·), (Q; ·), (R; ·), (C; ·). If we define ∗ ∗ ∗ Q = fa 2 Q : a 6= 0g, R = fa 2 R : a 6= 0g, C = fa 2 C : a 6= 0g, ∗ ∗ ∗ then (Q ; ·), (R ; ·), (C ; ·) are also binary structures. But, for example, ∗ (Q ; +) is not a binary structure. Likewise, (U(1); ·) and (µn; ·) are binary structures. In addition there are matrix examples: (Mn(R); ·), (GLn(R); ·), (SLn(R); ·), (On; ·), (SOn; ·). Next, there are function composition examples: for a set X,(XX ; ◦) and (SX ; ◦).
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • TEACHING NOTES a NOTE on IDENTITY ELEMENTS Ho Soo Thong Temasek Junior College Tay Yong Chiang*
    TEACHING NOTES A NOTE ON IDENTITY ELEMENTS Ho Soo Thong Temasek Junior College Tay Yong Chiang* In niost books on elementary group theory, the axiom on the existence of an identity element e in a non-empty set G with a binary operation* is simply mentioned as: for all a E G, e * a = a = a * e ••...•••.•••.(I) without further elaboration. As a result, students vecy ofter fail to gain an insight into the meaning of (I). The two common mistakes they make are: Firstly. they fail to see that the condition must hold for all a E G. Secondly, they tend to prove either e * a = a or a * e = a only. We hope that this note will help students have a better understanding of the identity axiom. Also, we show how, given a set with a binary operation defined on it, one may find the identity element. Further, we hope that students will be able to define new opera­ tions using our techniques. Let * be a binary operation on m, the set of real numbers, defined by a * b = a + (b - 1)(b - 2). We note that for all a~: m , and a * 1 =a a * 2 = a. The numbers 1 and 2 are known as right identity elements with respect to the operation* . On the other hand, there exists no element r (say) such that r * b = b for all b~: Rl. This can be proved by contradiction as follows. If possible, r * b = b for all bE Rl. Hence r + (b - 1)(b - 2) =b which is an identity and such an identity is impossible.
    [Show full text]
  • Order (Group Theory) 1 Order (Group Theory)
    Order (group theory) 1 Order (group theory) In group theory, a branch of mathematics, the term order is used in two closely-related senses: • The order of a group is its cardinality, i.e., the number of its elements. • The order, sometimes period, of an element a of a group is the smallest positive integer m such that am = e (where e denotes the identity element of the group, and am denotes the product of m copies of a). If no such m exists, a is said to have infinite order. All elements of finite groups have finite order. The order of a group G is denoted by ord(G) or |G| and the order of an element a by ord(a) or |a|. Example Example. The symmetric group S has the following multiplication table. 3 • e s t u v w e e s t u v w s s e v w t u t t u e s w v u u t w v e s v v w s e u t w w v u t s e This group has six elements, so ord(S ) = 6. By definition, the order of the identity, e, is 1. Each of s, t, and w 3 squares to e, so these group elements have order 2. Completing the enumeration, both u and v have order 3, for u2 = v and u3 = vu = e, and v2 = u and v3 = uv = e. Order and structure The order of a group and that of an element tend to speak about the structure of the group.
    [Show full text]
  • 1 Monoids and Groups
    1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M × M ! M; (x; y) 7! x · y such that (i) (x · y) · z = x · (y · z) 8x; y; z 2 M (associativity); (ii) 9e 2 M such that x · e = e · x = x for all x 2 M (e = the identity element of M). 1.2 Examples. 1) Z with addition of integers (e = 0) 2) Z with multiplication of integers (e = 1) 3) Mn(R) = fthe set of all n × n matrices with coefficients in Rg with ma- trix multiplication (e = I = the identity matrix) 4) U = any set P (U) := fthe set of all subsets of Ug P (U) is a monoid with A · B := A [ B and e = ?. 5) Let U = any set F (U) := fthe set of all functions f : U ! Ug F (U) is a monoid with multiplication given by composition of functions (e = idU = the identity function). 1.3 Definition. A monoid is commutative if x · y = y · x for all x; y 2 M. 1.4 Example. Monoids 1), 2), 4) in 1.2 are commutative; 3), 5) are not. 1 1.5 Note. Associativity implies that for x1; : : : ; xk 2 M the expression x1 · x2 ····· xk has the same value regardless how we place parentheses within it; e.g.: (x1 · x2) · (x3 · x4) = ((x1 · x2) · x3) · x4 = x1 · ((x2 · x3) · x4) etc. 1.6 Note. A monoid has only one identity element: if e; e0 2 M are identity elements then e = e · e0 = e0 1.7 Definition.
    [Show full text]
  • Vector Spaces
    Vector Spaces Saravanan Vijayakumaran [email protected] Department of Electrical Engineering Indian Institute of Technology Bombay July 31, 2014 1 / 10 Vector Spaces Let V be a set with a binary operation + (addition) defined on it. Let F be a field. Let a multiplication operation, denoted by ·, be defined between elements of F and V . The set V is called a vector space over F if • V is a commutative group under addition • For any a 2 F and v 2 V , a · v 2 V • For any u; v 2 V and a; b 2 F a · (u + v) = a · u + b · v (a + b) · v = a · v + b · v • For any v 2 V and a; b 2 F (ab) · v = a · (b · v) • Let 1 be the unit element of F. For any v 2 V , 1 · v = v 2 / 10 Binary Operations Definition A binary operation on a set A is a function from A × A to A Examples • Addition on the natural numbers N • Subtraction on the integers Z Definition A binary operation ? on A is associative if for any a; b; c 2 A a ? (b ? c) = (a ? b) ? c Definition A binary operation ? on A is commutative if for any a; b 2 A a ? b = b ? a 3 / 10 Groups Definition A set G with a binary operation ? defined on it is called a group if • The operation ? is associative • There exists an e 2 G such that for any a 2 G a ? e = e ? a = a: The element e is called the identity element of G • For every a 2 G, there exists an element b 2 G such that a ? b = b ? a = e Examples • Addition on the integers Z • Modulo m addition on Zm = f0; 1; 2;:::; m − 1g 4 / 10 Commutative Groups Definition A group G is called a commutative group if its binary operation is commutative.
    [Show full text]
  • Section 10.1 Groups Guided Notes
    Section 10.1 Groups Guided Notes What You Will Learn Mathematical Systems Commutative Property Associative Property Closure Identity Element Inverses Groups Let’s begin with, a Mathematical System: A mathematical system consists of a set of elements and at least one binary operation. Binary Operation A binary operation is an operation, or rule, that can be performed on two and only two elements of a set. The result is a single element. Addition, multiplication, subtraction and division are all binary operations. The set of integers and the binary operation of addition make a mathematical system. Commutative Property For any elements a, b, and c Addition a + b = b + a Multiplication a • b = b • a Associative Property For any elements a, b, and c Addition (a + b) + c = a + (b + c) Multiplication (a • b) • c = a • (b • c) Closure If a binary operation is performed on any two elements of a set and the result is an element of the set, then that set is closed (or has closure) under the given binary operation. Identity Element An identity element is an element in a set such that when a binary operation is performed on it and any given element in the set, the result is the given element. Additive identity element is 0. Multiplicative identity element is 1. Inverses When a binary operation is performed on two elements in a set and the result is the identity element for the binary operation, each element is said to be the inverse of the other. The additive inverse of a nonzero integer, a, is –a.
    [Show full text]