Finite Mathematical Systems

Slides:



Advertisements
Similar presentations
Rules of Matrix Arithmetic
Advertisements

Mathematics of Cryptography Part II: Algebraic Structures
Chapter 4 Systems of Linear Equations; Matrices
Matrices: Inverse Matrix
Copyright © Cengage Learning. All rights reserved.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
Mathematics. Matrices and Determinants-1 Session.
Chapter 4 Numeration and Mathematical Systems © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 4 Numeration and Mathematical Systems
CSE-221 Digital Logic Design (DLD)
Slide 10-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
MATH10001 Project 2 Groups part 1 ugstudies/units/ /level1/MATH10001/
Properties of Real Numbers. Closure Property Commutative Property.
EXAMPLE 3 Identify properties of real numbers
Table of Contents Matrices - Inverse Matrix Definition The inverse of matrix A is a matrix A -1 such that... and Note that... 1) For A to have an inverse,
1 Section 10.1 What Is an Algebra? To most people the word algebra means high school algebra. But there are many kinds of algebra. An algebra consists.
tables Objectives: By the end of class today I will:
Chapter 5.7 Properties of Matrices. Basic Definitions It is necessary to use capital letters to name matrices. Also, subscript notation is often used.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Chapter 4 Numeration and Mathematical Systems © 2008 Pearson Addison-Wesley. All rights reserved.
Groups Definition A group  G,  is a set G, closed under a binary operation , such that the following axioms are satisfied: 1)Associativity of  :
Ch X 2 Matrices, Determinants, and Inverses.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Properties of Real Numbers. Sets In mathematics, a set is a collection of things Sets can be studies as a topic all on its own (known as set theory),
4.5 Inverse of a Square Matrix
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
Learning Objectives for Section 4.5 Inverse of a Square Matrix
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 13 Mathematical Systems.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
10.4 Matrix Algebra 1.Matrix Notation 2.Sum/Difference of 2 matrices 3.Scalar multiple 4.Product of 2 matrices 5.Identity Matrix 6.Inverse of a matrix.
Copyright ©2015 Pearson Education, Inc. All rights reserved.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
SECTION 2 BINARY OPERATIONS Definition: A binary operation  on a set S is a function mapping S X S into S. For each (a, b)  S X S, we will denote the.
Chapter 13 Mathematic Structures 13.1 Modular Arithmetic Definition 1 (modulo). Let a be an integer and m be a positive integer. We denoted by a mod m.
4.4 Clock Arithmetic and Modular Systems. 12-hour Clock System  Based on an ordinary clock face  12 replaced with a zero  Minute hand is left off.
Designed by Victor Help you improve MATRICES Let Maths take you Further… Know how to write a Matrix, Know what is Order of Matrices,
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 13 Mathematical Systems.
 Commutative Property of Addition  When adding two or more numbers or terms together, order is NOT important.  a + b = b + a  =
Math 3121 Abstract Algebra I
Chapter 4 Systems of Linear Equations; Matrices
Matrices Introduction.
Elementary Matrix Theory
Set Operations CS 202, Spring 2008 Epp, chapter 5.
Checking Solutions with a Two Column Table
Great Theoretical Ideas in Computer Science
Reflexivity, Symmetry, and Transitivity
Great Theoretical Ideas In Computer Science
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Great Theoretical Ideas in Computer Science
Section 10.1 Groups.
Learning Objectives for Section 4.5 Inverse of a Square Matrix
Graphing Systems of Equations.
Section 10.2 Finite Mathematical Systems
1.3 Properties of Real Numbers
1.3 – AXIOMS FOR THE REAL NUMBERS
Algebraic Structures: Group Theory
Section 10.3 Modular Arithmetic
Chapter 4 Systems of Linear Equations; Matrices
Graphing Systems of Equations.
General Vector Spaces I
Section 9.1 Groups.
Chapter 4 Systems of Linear Equations; Matrices
Section 9.3 Modular Arithmetic.
Presentation transcript:

Finite Mathematical Systems Section 9.2 Finite Mathematical Systems

What You Will Learn Upon completion of this section, you will be able to: Determine whether a finite mathematical system defined by clock arithmetic is a group. Determine whether a finite mathematical system without numbers is a group.

Definition A finite mathematical system is one whose set contains a finite number of elements.

Clock 12 Arithmetic The set of elements is {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}. The binary operation we will use is addition, a movement clockwise. For example, 4 + 9 = 1. Also, 9 + 4 = 1. An addition table is found on the next slide.

Clock 12 Arithmetic

Example 1: A Commutative Group? Example: Determine whether the clock 12 arithmetic system under the operation of addition is a commutative group. {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}

Example 1: A Commutative Group? Solution 1. Closure: Note that the table contains only elements of the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}. The set is closed under addition. 2. Identity element: 12 is the additive identity. 4 + 12 = 12 + 4 = 4

Example 1: A Commutative Group? Solution 3. Inverse elements: The additive inverse is the number that when added will yield the additive identity, 12. 8 is the additive identity of 4; 4 + 8 = 12. And 4 is the additive identity of 8; 8 + 4 = 12. Similarly, 7 and 5 are additive identities of each other. Here is the table of additive identities:

Example 1: A Commutative Group? Solution

Example 1: A Commutative Group? Solution 4. Associative property: for all values of a, b and c, does (a + b) + c = a + (b + c)? Let a = 2, b = 6, and c = 8. (2 + 6) + 8 = 2 + (6 + 8) 8 + 8 = 2 + 2 4 = 4 True If we were to try other elements, we would have the same result. It is associative under addition.

Example 1: A Commutative Group? Solution 5. Commutative property: for all value of a and b, does a + b = b + a? 5 + 8 = 8 + 5 1 = 1 True 9 + 6 = 6 + 9 3 = 3 True If we were to try other elements, we would have the same result. The commutative property is true.

Example 1: A Commutative Group? Solution This system satisfies the five properties required for a mathematical system to be a commutative group. Thus, clock 12 arithmetic under the operation of addition is a commutative, or abelian, group.

A Few Things to Note If not every element in the set appears in every row and column of the table, however, you need to check the associative property carefully. If the elements are symmetric about the main diagonal, then the system is commutative. It is possible to have groups that are not commutative: noncommutative or nonabelian groups.

Example 6: Is the System a Commutative Group? Determine whether the mathematical system defined by the table is a commutative group under the operation of .

Example 6: Is the System a Commutative Group? Solution The system is closed. There is an identity element, A. Each elements has an inverse; A is its own inverse, and B and C are inverses of each other.

Example 6: Is the System a Commutative Group? Solution Every element in the set does not appear in every row and every column of the table, so we need to check the associative property carefully. The following counterexample illustrates that the associative property does not hold for every case.

Example 6: Is the System a Commutative Group? Solution The commutative property holds because there is symmetry about the main diagonal. Since we have shown that the associative property does not hold under the operation of , this system is not a group. Therefore, it cannot be a commutative group.