K.RAVINDRA REDDY Z. P.H.S. PANDYALAMADUGU P.ADISESHAIAH Z. P.H. S. DANDIKUPPAM.

Slides:



Advertisements
Similar presentations
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Set Theory.
Ch 9 Inequalities and Absolute Value
Unit 10 – Logic and Venn Diagrams
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
Mathematics.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
MATHEMATICS XI SETS.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Set Theory. What is a set?  Sets are used to define the concepts of relations and functions. The study of geometry, sequences, probability, etc. requires.
DEFINITION:SETS A SET IS A WELL-DEFINED COLLECTION OF OBJECTS. EXAMPLES: 1.THE SET OF STUDENTS IN A CLASS. 2.THE SET OF VOWELS IN ENGLISH ALPHABETS.
Chapter 2: The Basic Concepts of Set Theory. Sets A set is a collection of distinguishable objects (called elements) Can define in words Can list elements.
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
CompSci 102 Discrete Math for Computer Science
MATH 104 Chapter 2 Sets. Notation and overview 2.1 Basics Ǿ Empty set ∈ Is an element Is not an element of 2.2 Subsets  Is a subset of Is not a subset.
Thinking Mathematically Chapter 2 Set Theory 2.1 Basic Set Concepts.
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
ELEMENTARY SET THEORY.
Set Notation and Description Kinds of Sets Operations on Sets By: Mr. Gerzon B. Mascariñas.
Sets jadhav s.s. M.S.V.Satara
9.1 Sets, Intersections, and Unions  Standard 1.0  8 Key Terms.
Section 3.1 Sets and their operation. Definitions A set S is collection of objects. These objects are said to be members or elements of the set, and the.
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Introduction to Set theory. Ways of Describing Sets.
Discrete Mathematics SETS. What is a set? ^A set is a unordered collection of “objects”  People in a class: {A yşe, B arış, C anan }  Cities in Turkey.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
Discrete Mathematics Set.
Warning: All the Venn Diagram construction and pictures will be done during class and are not included in this presentation. If you missed class you.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Set Operations Section 2.2.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Thinking Mathematically Venn Diagrams and Subsets.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Thinking Mathematically Venn Diagrams and Set Operations.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
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.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Set. Outline Universal Set Venn Diagram Operations on Sets.
Dr. Ameria Eldosoky Discrete mathematics
Sets Page 746.
Chapter two Theory of sets
(є:belongs to , є:does not belongs to)
Algebra STANDARD IX A ∩ B B ∩ C A ∩ C Std-9th Sub-Mathematics
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
CSE 2353 – September 22nd 2003 Sets.
… and now for something completely different…
Exercises Show that (P  Q)  (P)  (Q)
CS100: Discrete structures
        { } Sets and Venn Diagrams Prime Numbers Even Numbers
Session – 2 SETS & Operations of SETS
Discrete Mathematics CS 2610
Discrete Mathematics R. Johnsonbaugh
SET THEORY Chumki Sarkar.
… and now for something completely different…
2.1 – Symbols and Terminology
Sets & Set Operations.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Introduction A set is a collection of objects.
Sets, Unions, Intersections, and Complements
MATH 104 Chapter 2 Sets Math104_ch2_pptx.
Presentation transcript:

K.RAVINDRA REDDY Z. P.H.S. PANDYALAMADUGU P.ADISESHAIAH Z. P.H. S. DANDIKUPPAM

INTRODUCTION S Set Theory was developed by the famous great mathematician George Canter ( ).

Definition of SET Set : A set is a group of well defined objects. For representing set we use { } A set can be represented in two ways 1. Roster method : Elements of a set are written in between the parenthesis 2. Set builder form :Elements of a set are described by their common property

ROSTER FORM Write the following sets in ROSTER-FORM. 1.A is the set of odd numbers bellow 20. Ans. A = {1,3,5,7,9,11,13,15,17,19}. 2.B is the set of vowels. Ans. B = {a,e,i,o,u }. 3.P is the set of prime numbers bellow 30. Ans. P = {2,3,5,7,11,13,17,19,23,29}. 4.F is the set of factors of 50. Ans. F = {1,2,5,10,25,50}. 5.M is the set of multiples of 3. Ans. M = {3,6,9,12,15 …………}

SET-BUILDER FORM Write the following sets in SET-BUILDER form. 1.A = {2,4,6,8,10,……..} Ans.A = {x/x is the positive even number}. 2.B = {1,8,27,64,125….} Ans.B = { n 3 / n is positive integer}. 3.F={apple,banana,mango,orange,grapes}. Ans.F = {x / x is a fruit}. 4.W = {sun,mon,tue,wed,thu,fri,Saturday}. Ans. W = {x / x is the week day}. 5.S = {chiru,bala, naga,venki,raviteja}. Ans S = {x / x is a telugu cine film star}.

TYPES OF SETS-1 SINGLETON SET A set which has only one element is called a singleton set. Ex. A = { 2 }. EMPTY SET A set which has no element in it is called an empty set. An emptyset is represented as Ǿ or { }. FINITE SET If the number of elements of a set is countable then the set is called a finite set. Ex.A = {1,2,3,4,5}. INFINITE SET If the number of elements of a set are uncountable then the set is called an infiniteset. Ex.N = {1,2,3,4,5……………………….} SUBSET If every element of the set A is an element of set B then A is called subset of B. It is represented as A ⊂ B. Ex. A = {1,3,5,7,9}, B = {1,2,3,4,5,6,7,8,9,10} here A ⊂ B. NOTE 1.Empty set is subset of every set. NOTE 2.Every set is subset of itself.

TYPES OF SETS-2 SUPER SET If every element of set A is also an element of set B then B is called superset of A. Ex. A = {4,8,12,16,20}, B = {2,4,6,8,10.12,14,16,18,20} here B ⊃ A. PROPER SUBSET If A ⊂ B and A ≠ B then A is called proper subset of B. Ex. A = {1,2,3}, B = {1,2,3,4,5}. IMPROPER SUBSET If A ⊂ B and A = B then A is called an improper subset of B. Ex. A={2,4,6},B={2,4,6}. POWER SET If A is a set, then set of all subsets of A is called powerset of A. Power set of a set A is represented as P(A). NOTE:If n(A) = n then number of elements in P(A) = 2 n

UNION OF SETS A={1,2,3} B={2,3,4} C={4,5,6} Find( AUB),(,BUC),AU(BUC),(AUB)UC AUB={1,2,3}U{2,3,4} AUB={1,2,3,4,} BUA={1,2,3,4} SO AUB=BUA This is called commutative law BUC={2,3,4,}U{4,5,6,} BUC={2,3,4,5,6} AU(BUC)={1,2,3}U{2,3,4,5,6,} AU(BUC)={1,2,3,4,5,6} (AUB)UC={1,2,3,4}U{4,5,6} (AUB)UC={1,2,3,4,5,6} So AU(BUC)=(AUB)UC T This is called Associative law

U

Venn-Diagrams of AUB,BUC,(AUB)UC

INTERSECTION OF SETS A={a,b,c,d,e} B={d,e,f} C={d,e,f,h} A∩B={a,b,c,d,e}∩{d,e,f} A∩B={d,e } B∩A={d,e,f }∩{a,b,c,d,e } B∩A={d,e} B∩C={d,e,f } ∩ {d,e,f,h } B∩C={d,e,f } C∩B={d,e,f,h} ∩ {d,e,f } C∩B={d,e,f } So Intersecton of sets following Commutative law A∩(B∩C) = {a,b,c,d,e } ∩ { d,e,f } A∩(B∩C) = {d,e } (A∩B)∩C = {,d,e } ∩ {d,e,f,h} (A∩B)∩C = {d,e }... A∩(B∩C) = (A∩B)∩C Intersection of SETS following Associate law

Venn diagram of A∩B,

Venn-diagram of A∩(B∩C)

DIFFERENCE OF SETS A={1,3,5,7,9 },B={1,2,3 } A-B={1,3,5,7,9 } – {1,2,3 } A-B= {5,7,9} B-A= {1,2,3 } – {1,3,5,7,9 } B-A = { 2 }... A-B ≠ B-A So Difference of sets not following commutative law

Venn-diagram of A-B,

SYMMETRIC DIFFERENCE OF SETS IF A = {2,4,6,8,10 } B = { 1,2 3, }THEN PROVE THAT A Δ B = (AUB)-(A∩B) = (A-B)U(B-A). Ans: AUB = {2,4,6,8,10 }U {1,2,3 } AUB = {1,2,3,4,6,8,10 } A∩B = {2 } (A U B ) –(A∩B ) = {1,2,3,4,6,8,10 } – { 2 } = {1,3,4,6,8,10 } (A – B ) = {2,4,6,8,10 } – {1,2,3 } ={4,6,8,10 } (B – A) = {1,2,3, } – { 2,4,6,8,10 } = {I,3 } (A – B) U (B – A ) = {4,6,8,10 } U { 1,3 } = {1,3,4,6,8,10 } So A Δ B = ( A –B ) U (B – A ) = (A U B ) – ( A ∩ B ) Here A Δ B is called Symmetri difference of sets

COMPLIMENT OF A SET µ is a universal set A is any set then (µ -A) is called Complement of A this can be represent as A' µ = {1,2,3, }, A = { 2,4 6,--- }, B = {1,3,5 }, find A', B‘, A'∩B', (AUB)'

PROBLEM-1 IF A = { 1,2,3,4,5 } B = {2,3,4,},C={4,5,6,7} THEN PROVE THAT AU(B∩ C) = (AUB) ∩ (AUC). B∩C= {2,3,4} ∩ {4,5,6,7 } B∩C= {4} AU(B∩C)={1,2,3,4,5 } U {4} AU(B∩C)={1,2,3,4,5 } (AUB) = {1,2,3,4,5 } U {2,3,4 } (AUB) ={1,2,3,4,5 } (AUC) = {1,2,3,4,5 } U {4,5,6,7 } (AUC) = {1,2,3,4,5,6,7 } (AUB)∩(AUC) = {1,2,3,4,5,} ∩ {,2,3,4,5,6,7 } (AUB)∩(AUC) = {1,2,3,4,5 }... AU(B∩C) = (AUB) ∩ (AUC)

Venn –diagram of A∩(BUC) A ∩ (BUC) = =

Venn-Diagram of (A∩B)U(A∩C)

U

Venn-Diagram of A',

Venn-Diagram of (A∩B)' (A∩B)'

Venn –Diagram of A' U B'

Venn –Diagram of A- (

PROBLEM-4 PROBLEMS RELATING TO n(A),n(B),n(AUB) & n(A∩B). If n(AUB)= 51, n(A) = 20, n(B) =44 find n(A∩B) Ans: We know n(AUB)=n(A) +n(B)-n(A∩B) 51 = – n(A∩B) n(A∩B) = n(A∩B)= 13

PROBLEM-5 PROBLEMS RELATING TO n(A),n(B),n(C),n(A∩B),n(B∩C),n(C∩A) n(AUBUC) &n(A∩B∩C).

PROBLEM-6 IF A = {…………..} B = {…………..} THEN PROVE THAT A Δ B = (AUB)-(A∩B) = (A-B)U(B-A).

PROBLEM-7 PROVE THAT AU(B∩C) = (AUB) ∩ (AUC).

PROBLEM-8 PROVE THAT A-(BUC) = (A-B) ∩ (A-C). It is enough to prove 1. A-(BUC) ⊂ (A-B)∩ (A-C) 2. (A-B)∩(A-C) ⊂ A-(BUC)

ACKNOWLEDGEMENTS