WELCOME.

Slides:



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

Cryptography and Network Security
Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Cryptography and Network Security Chapter 4 Fourth Edition by William Stallings.
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
Math 3121 Abstract Algebra I
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
MATH10001 Project 2 Groups part 1 ugstudies/units/ /level1/MATH10001/
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Unit – IV Algebraic Structures
1 Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 4 – Finite Fields.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
By: Hector L Contreras SSGT / USMC
Monoids, Groups, Rings, Fields
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),
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Mathematical Preliminaries
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Chapter 2 With Question/Answer Animations. Section 2.1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.
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.
Chapter 6 Abstract algebra
Great Theoretical Ideas in Computer Science.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Math 3121 Abstract Algebra I Lecture 14 Sections
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.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Great Theoretical Ideas in Computer Science.
Divisibility and Modular Arithmetic
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Chapter 7 Algebraic Structures
Math 3121 Abstract Algebra I
Dr. Ameria Eldosoky Discrete mathematics
Unit-III Algebraic Structures
CS480 Cryptography and Information Security
Great Theoretical Ideas in Computer Science
Groups and Applications
Great Theoretical Ideas In Computer Science
CS201: Data Structures and Discrete Mathematics I
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
刘振 上海交通大学 计算机科学与工程系 电信群楼3-509
Relations and Their Properties
8.1 Relations and Their Properties
Great Theoretical Ideas in Computer Science
Great Theoretical Ideas in Computer Science
Section 10.1 Groups.
B.Sc. III Year Mr. Shrimangale G.W.
Discrete Mathematics CS 2610
I. Finite Field Algebra.
Lecture 43 Section 10.1 Wed, Apr 6, 2005
MCS680: Foundations Of Computer Science
Algebraic Structures: Group Theory
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Set – collection of objects
Cryptography Lecture 19.
DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P
Presentation transcript:

WELCOME

. Presentation on Introduction to Groups Dr. K. SUVARNA Lecturer in Mathematics III Sem, Abstract Algebra D.K. Govt. college for women(A) Nellore. Ph : 9985039953 .

The study of Algebraic Structures which have been subjected to Axiomatic development is called “Abstract Algebra or Group Theory”. Basic ingredients of Group Theory are Sets, Relations and Mappings. A set with a method of combination of elements of it called an Algebraic structure.

‘+’ is the binary operation in N. Let s be a non-empty set If f : sxs →s is a mapping then f is called “Binary operation” in S or “Binary composition” in S. i.e., (a , b) є SXS => f(a , b) є S i.e., a є S , b є S => a.b є S then ‘.’ is called a “Binary operation” in the set S. which is known as “Closure law”. Ex: Let N be the set of Natural numbers and for any a є N , b є N if a + b є N then ‘+’ is the binary operation in N.

For any two natural numbers (>0) 4,8 є N We have 4+8=12 є N then “+” is a binary operation in N whereas “-” is not a binary operation in N since for any two numbers 6,12 є N we have 6-12 = -6 does not belongs to N. i.e “-”’ is not a binary operation in N as (a,b) є N does not imply a-b є N.

ASSOCIATIVE LAW ‘*’ is a binary operation in S , for any a, b, c є S if (a*b)*c = a*(b*c) then the operation “*” is called ASSOCIATIVE in ‘S’. Ex: a, b, c є Z a+(b + c) = (a + b)+c let us take a=1, b=2, c=3 1+(2+3)= (1+2)+3 1+5= 3+3 6=6

Existence of Identity : In a non-empty set G for any aєG there exist e єG Э a*e = e*a = a then ‘e’ is called an Identity element in G w.r.to the operation “*”. → With respect to addition ‘0’ is the identity element since 0+a = a+0 = a. Ex : for any number -6 є Z there exists 0 є Z such that -6 + 0 = 0+ (-6) = -6 Ex : 3+0 = 0+3 = 3 → Under multiplication ‘1’ is the identity element

Inverse property : For any a є G there exists b є G Э a. b = b Inverse property : For any a є G there exists b є G Э a*b = b*a = e then ‘b’ is called Inverse element of ‘a’ in G. → Under addition inverse of a is –a → Under multiplication inverse of a is 1/a Ex : for 3є Z there exists -3 є Z Э 3+ (-3) = -3 + 3 = 0

Algebraic structure A non-empty set G equipped with one or more binary operations is called Algebraic structure. Ex: (R, .,+), (Z, .)

Semi Group An Algebraic structure which is Associative is called Semi group Ex:(N,+) is Semi group i . e, For a, b, c ЄN 1.aєN, bєN =>a + b є N 2.(a + b)+c = a+(b + c)

Monoid A Semi group with the identity element is known as “Monoid”. i Monoid A Semi group with the identity element is known as “Monoid” . i.e., (S,0) is a Monoid if a non-empty S under the operation “0” follows 1.Binary operation (or) Closure law 2. Associativity 3. Identity Ex: 1. (N,+) is not a monoid since 0 does not є N 2. (R,+) , (N,.) ,(Z,+) are the monoids. .

Group Let G be a non empty set and ‘ Group Let G be a non empty set and ‘*’ is a binary operation defined on G then (G,*) is said to be a Group if it satisfies the following properties 1. Associative property 2. Identity property and 3. Inverse property Ex : (Z, +), (R, +), (Q, +) etc are groups under “+”.

ABELIAN GROUP In a group (G,0) If a,b є G => a0b = b0a then (G,0) is called an “Abelian or Commitative group” . Ex: (Z,+), (R,+), (C,+), (Q,+) are the Commitative groups .

FINITE AND INFINITE GROUP In group (G,0) If the number of the elements are finite then it is called “Finite group”. Otherwise it is “Infinite group”. Ex: (R,+), (Z,+), (Q,+)

ORDER OF A GROUP The number of elements in a group (G,0) is called it’s “order”. And it is denoted by 0(G) . 0(G) < ∞. Ex: 0(G) = 2n for all n є Z is the group of even order. 0(G) = 2n-1 for all n є N is the group of the odd order.

Any subset H of a group G is called a Complex. Ex: Set of all even integers is complex of group (Z, +) Ex 2: In the Group, fourth roots of unity {1, -1, i, -i }, the complexes are {1, -1}, {i, -i}, …… 16

If a complex H of a group G is itself a group under the operation of G, we say that H is a Subgroup of G denoted by H≤G Ex: (Z, +) is the subgroup of (Q, +) (R, +) is the subgroup of (C, +)

If a complex H of a group G is itself a group under the operation of G, we say that H is a Subgroup of G denoted by H≤G Ex: (Z, +) is the subgroup of (Q, +) (R, +) is the subgroup of (C, +) If If

The fourth roots of unity {1, -1, i, -i} is the group G under multiplication. The complex {1, -1} is a subgroup but {i, -i} is not a subgroup WHY?

Criteria of a subset to be a subgroup: Theorem: H is a non-empty complex of a subgroup G, the necessary and sufficient condition for H to be a subgroup of G is a, b ϵ H =>ab^(-1) ϵ H  In additive notation, H is a subgroup of G iff a,b ϵ H => a-b ϵ H

Two-Step Subgroup Test Theorem: A non-empty complex H of a group G is a subgroup  1) a ϵ H, b ϵ H => ab ϵ H. 2) a ϵ H => a^(-1) ϵ H.

Finite Subgroup Test Theorem: Let H be a non-empty finite complex of a group G. If H is closed under the operation of G, then H is a subgroup of G. i.e. a, b ϵ H => ab ϵ H.

Some Other Criterions  A necessary and sufficient condition for a non-empty complex H of a subgroup G to be a subgroup of G is that HH^(-1) is contained in H.  A necessary and sufficient condition for a non-empty subset H of a subgroup G to be a subgroup of G is that HH^(-1) = H.

THANK YOU THANK YOU