The Further Mathematics Support Programme

Similar documents
4&5 Binary Operations and Relations. The Integers. (part I)

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers

Slides for Faculty Oxford University Press All rights reserved.

9.5 Equivalence Relations

Chapter 1: Number and Operations

Page 1. Kobrin/Losquadro Math 8. Unit 10 - Types of Numbers Test Review. Questions 1 and 2 refer to the following:

Properties. Comparing and Ordering Rational Numbers Using a Number Line

Finite Math - J-term Homework. Section Inverse of a Square Matrix

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T

Quadratic Equations over Matrices over the Quaternions. By Diana Oliff Mentor: Professor Robert Wilson

A.1 Numbers, Sets and Arithmetic

Unit 2: Accentuate the Negative Name:

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

AXIOMS FOR THE INTEGERS

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Algebra 1 Review. Properties of Real Numbers. Algebraic Expressions

CHAPTER 7. Copyright Cengage Learning. All rights reserved.

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

To illustrate what is intended the following are three write ups by students. Diagonalization

Mathematics and Symmetry: A Bridge to Understanding

Integers and Rational Numbers

CGF Lecture 2 Numbers

Math Introduction to Advanced Mathematics

Binary Relations McGraw-Hill Education

Rational Numbers CHAPTER Introduction

Problem. Prove that the square of any whole number n is a multiple of 4 or one more than a multiple of 4.

The word zero has had a long and interesting history so far. The word comes

Decimal Binary Conversion Decimal Binary Place Value = 13 (Base 10) becomes = 1101 (Base 2).

x = 12 x = 12 1x = 16

Vocabulary: Looking For Pythagoras

Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

Multi-matrices and arithmetical operations with multi-matrices

DISCRETE MATHEMATICS

Month: April No. of Periods: 14

ON BINARY TOPOLOGICAL SPACES

SPERNER S LEMMA MOOR XU

Algebraic Expressions

Combining Isometries- The Symmetry Group of a Square

Mathematics Background

Discrete Mathematics. Kruskal, order, sorting, induction

Abstract Combinatorial Games

NAME UNIT 4 ALGEBRA II. NOTES PACKET ON RADICALS, RATIONALS d COMPLEX NUMBERS

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.

1 Elementary number theory

2.4 Multiplication and Division of Integers

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London

Integers and Mathematical Induction

Graceful Labeling for Cycle of Graphs

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

What Is A Relation? Example. is a relation from A to B.

1 The Axiom of Extensionality

9 abcd = dcba b + 90c = c + 10b b = 10c.

Post and Jablonsky Algebras of Compositions (Superpositions)

GRADE 7 MATH LEARNING GUIDE


Learning Log Title: CHAPTER 3: ARITHMETIC PROPERTIES. Date: Lesson: Chapter 3: Arithmetic Properties

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

PROOF OF THE COLLATZ CONJECTURE KURMET SULTAN. Almaty, Kazakhstan. ORCID ACKNOWLEDGMENTS

4.3 Rational Thinking

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Automata Theory EUR solutions

Unit 3: Multiplication and Division Reference Guide pages x 7 = 392 factors: 56, 7 product 392

Point groups in solid state physics I: point group O h

SET DEFINITION 1 elements members

9 abcd = dcba b + 90c = c + 10b b = 10c.

AH Matrices.notebook November 28, 2016

Section 17. Closed Sets and Limit Points

Number System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value

Functions. How is this definition written in symbolic logic notation?

Lecture 6,

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Intermediate Algebra. Gregg Waterman Oregon Institute of Technology

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

Chapter 3: Theory of Modular Arithmetic 1. Chapter 3: Theory of Modular Arithmetic

Table of Contents. Introduction to the Math Practice Series...iv Common Mathematics Symbols and Terms...1

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np

Introduction to Automata Theory. BİL405 - Automata Theory and Formal Languages 1

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

OUTLINES. Variable names in MATLAB. Matrices, Vectors and Scalar. Entering a vector Colon operator ( : ) Mathematical operations on vectors.

Counting. Chapter Basic Counting. The Sum Principle. We begin with an example that illustrates a fundamental principle.

CS3110 Spring 2017 Lecture 10 a Module for Rational Numbers

Journal of Asian Scientific Research WEAK SEPARATION AXIOMS VIA OPEN SET AND CLOSURE OPERATOR. Mustafa. H. Hadi. Luay. A. Al-Swidi

2.1 Sets 2.2 Set Operations

Monday, 12 November 12. Matrices

Two-Color Counters. Adding Integers, Part II. Key Term. Learning Goals. Essential Ideas. Common Core State Standards for Mathematics

An Interesting Way to Combine Numbers

Calculation of extended gcd by normalization

Two Comments on the Principle of Revealed Preference

Vesa Halava Tero Harju. Walks on Borders of Polygons

Mathematical morphology (1)

TAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS

The method of rationalizing

2 Review of Set Theory

MATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).

Transcription:

Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements these are the individual members of a set. They form a collection of objects which have something in common, e.g. The set of natural numbers { } The set of integers { } This diagram shows sets of numbers, some of which are subsets of others. Find out what letter symbols are used to represent each of these sets e.g. for natural numbers. What would the large set which encloses all of the others be called? http://www.bing.com/images/search?q=sets+of+numbers+diagram&go=submit+query&qs=bs&form=qbir#view=detail&id=e D0A16069BF53CC1DCA7CE6247001096C37ED29C&selectedIndex=12 Binary operation this is a function which is applied to two elements of a set. The binary operation + on elements of 3 + 5 = 8 and 8 is an element of. produces other elements of, for example The binary operation * on could be defined as a*b = min (a, b) where min indicates the minimum of the two integers. For example, 3*5 = min (3,5) = 3 and -3 *6 = -3. Notice that once again the answer is also an element of the set. When the answer to a binary operation on two elements of a set is also in the set, we say that the set is closed under that binary operation. By contrast, the binary operation on the set can produce answers that are not elements of the original set, for example 2 6 = -4, therefore we say that is not closed under subtraction.

Associativity When carrying out a binary operation on more than two elements, the operation should be applied in pairs. For example, a*b*c could be done as (a*b)*c or a*(b*c). If the answers to both of these give the same answer, we say the binary operation is associative. Task 1 Determine which of the following are associative. 1. The set under the binary operation + 2. The set under the binary operation - 3. The set under the binary operation a*b = a + 2b Commutativity For some binary operations, the order in which the pairs occur is important. In a simple case, is commutative under the binary operation + but not under as 3 + 5 = 5 + 3 is true, but 3 5 = 5 3 is not true. Task 2 If you have studied matrices, investigate whether matrix addition on 2 x 2 matrices is commutative. Is matrix multiplication commutative? Identity An identity element is usually denoted by the letter e. When combined with another element of a set under a binary operation, the element is unchanged. For example, 5 + 0 = 5 so 0 is the identity element for addition on the set. For multiplication on this set however, the identity would be 1 as, for example, 5 x 1 = 5. Task 3 Explain why the following sets do not have an identity element: 1. The set under addition + 2. The set of even numbers under multiplication x

Inverses For an element of a set g an inverse g -1 is an element for which g * g -1 = e and g -1 *g = e. For example, for the set under addition, the identity is 0 and so the inverse of say 3, is (-3) as 3 + (-3) = (-3) + 3 = 0. However, of 3 would be as set. does not have inverses under multiplication. The identity is 1 and so the inverse. However, is not an integer and so is not an element of the Group Axioms A set of numbers S forms a group under a binary operation * if the following axioms hold: 1. S is closed under * 2. * is associative 3. There is an identity element e which is a member of S 4. Every element of S has an inverse Task 4 By checking the axioms above, determine whether the following sets are groups under the binary operations given. 1. The positive rational numbers under multiplication x. (Note: Rational numbers are those which can be expressed as fractions) 2. The integers under the binary operation a*b = a + b 1 3. The positive integers under multiplication

Why have groups? Groups allow diverse collections of objects to be compared and similarities in the structure to be identified. They are an important way in which mathematicians organise and compare 4. ideas. They can also be used in a variety of ways outside mathematics, for example in solving the Rubic Cube puzzle. The possible moves that could be made are elements of a group and these can be combined and studied as part of a symmetric group (see Symmetry Group activity for more details) or visit http://en.wikipedia.org/wiki/rubik%27s_cube_group#group_structure How many groups are there? As recently as 1981, it was thought that it had finally been proved that the classification of finite simple groups (ones with a fixed number of elements and satisfies some additional mathematical rules) that had been previously identified was in fact a complete list. It was a huge piece of pure mathematics spanning over 10,000 pages in journals, and written by around 100 authors. Even now, gaps within the proof have been identified and remedied. Find out more: Nrich - Groups an interesting collection or articles including the history of the development of groups. Schools' Wikipedia - Group Theory - an introduction to the topic.

Solutions Task 1 The Further Mathematics Support Programme These examples are not formal proofs but they give an indication of associativity. 1. The set under the binary operation + 3 + (5 + 2) = (3 + 5) + 2 shows associativity in this case as 3 + 7 = 8 + 2. 2. The set under the binary operation 3 - (5-2) = (3-5) - 2 shows non-associativity in this case as 3 3-2 - 2 3. The set under the binary operation a*b = a + 2b 5*(7*2) = (5*7)*2 shows non-associativity in this case. On the left hand side 7*2 = 7 + 4 = 11 and then 5*11 = 5 + 22 = 27. On the right hand side 5*7 = 5 + 14 = 19 and then 19*2 = 19 + 4 = 23. Task 2 Choosing any 2 x 2 matrices allows us to see that matrix addition is commutative but matrix multiplication is not. e.g. ( ) ( ) ( ) ( ) ( ) so commutative ( ) ( ) ( ) ( ) ( ) ( ) so not commutative Task 3 1. The set under addition + Under addition, the identity element would have to be 0; however 0 is not a member of the set of natural numbers. Hence there is no identity element in this set. 2. The set of even numbers under multiplication x Under multiplication of number, the identity would be 1; however 1 is not even. Hence there is no identity element in this set. Task 4 1. The positive rational numbers under multiplication x. Closure: Multiplying together two fractions would produce a fraction and so the set closed under multiplication. is Associativity: ( ) ( ) These expressions are equal so this confirms associativity. Identity: Multiplying any fraction by 1would leave the fraction unchanged. 1 is a rational number and therefore there is an identity element.

Inverse: For any fraction we know that multiplying by the fraction would give an answer of 1. Hence every element of has an inverse under multiplication. Therefore does form a group under multiplication. 2. a*b = a + b 1 Closure: adding two integers gives an integer, so adding 1 would also give an integer. Hence the set is closed. Associativity: (a*b)*c = (a+b-1)*c = (a+b-1) + c 1 = a + b + c 2 a*(b*c) = a*(b+c-1) = a + (b+c-1) 1 = a + b + c 2 These expressions are equal, hence * is associative. Identity: We need an element e such that a*e = a, which means that a + e -1 = a. Hence e = 1 and this is an integer. Inverse: Suppose the inverse of element a is b, then a*b = e. This means that a*b = 1. So a + b 1 = 1 and therefore b = 2 a (which is an integer) and so the inverse of a is 2-a. Therefore the integers under the binary operation a*b = a + b 1 3. The positive integers under multiplication Closure: Multiplying together two positive integers gives a positive integer, so this axiom holds. Associativity: Multiplication of integers is associative i.e. (a x b) x c = (ab)c = abc and a x (b x c) = a x (bc) = abc. These expressions are equal. Identity: Identity: We need an element e such that a*e = a, which means that e = 1 and this is a positive integer. Inverse: Suppose b is the inverse of an element a, then a x b = 1. Hence b = This is not an element of unless a = 1. Hence it is not possible to find an inverse for most elements and so does not form a group under multiplication.