MATHEMATICS XI SETS.

Slides:



Advertisements
Similar presentations
Learning Objectives for Section 7.2 Sets
Advertisements

Sets and its element A set is a collection of well-defined and well-distinguished objects. The objects that make up a set are called the members or elements.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
Denoting the beginning
Analytical Methods in CS (CIS 505)
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets 1.
Set Theory.
1 Learning Objectives for Section 7.2 Sets After today’s lesson, you should be able to Identify and use set properties and set notation. Perform set operations.
Mathematics.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
CSCI 1900 Discrete Structures
Sets.
Set Notation.
Definition and Representation A set is a well-defined collection of objects; The objects are called elements or members of the set; A set can be represented.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
ELEMENTARY SET THEORY.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Definition of a Set DM is study of discrete structures. Fundamental discrete structure upon which most of other discrete structures are built is the sets.
Sets jadhav s.s. M.S.V.Satara
CSNB143 – Discrete Structure Topic 1 - Set. Topic 1 - Sets Learning Outcomes – Student should be able to identify sets and its important components. –
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.
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.
Discrete Mathematics Lecture # 10. Set Theory  A well defined collection of {distinct} objects is called a set.  The objects are called the elements.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
ITD1111 Discrete Mathematics & Statistics STDTLP
Discrete Mathematics Set.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
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.
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.
Sets and Operations TSWBAT apply Venn diagrams in problem solving; use roster and set-builder notation; find the complement of a set; apply the set operations.
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.
CSE15 Discrete Mathematics 02/13/17
Dr. Ameria Eldosoky Discrete mathematics
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Sets Page 746.
Chapter two Theory of sets
Set Definition: A set is unordered collection of objects.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
CSNB 143 Discrete Mathematical Structures
Set, Combinatorics, Probability & Number Theory
Sets Section 2.1.
(є: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.
CS100: Discrete structures
        { } Sets and Venn Diagrams Prime Numbers Even Numbers
Algebra 1 Section 1.1.
2.1 Sets Dr. Halimah Alshehri.
CHAPTER 1 - Sets and Intervals
CHAPTER 1 - Sets and Intervals
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Discrete Mathematics CS 2610
Discrete Mathematics R. Johnsonbaugh
SET THEORY Chumki Sarkar.
Chapter 7 Logic, Sets, and Counting
Sets & Set Operations.
Set – collection of objects
Sets, Unions, Intersections, and Complements
Presentation transcript:

MATHEMATICS XI SETS

Sets: a well defined collection of distinct objects. Objects, elements and members of a set are represented by small letters of English alphabet. Sets are usually denoted by capital letters A,B,G,Q, etc. The elements of a set are represented by small letters a, b, c, x, etc. each element of a set is denoted by curly brackets { }.

sets are represented by two methods: Roaster or tabular form Set builder form Roaster form: in roaster form all the elements of a set are numerical values and they are separated by (,) and enclosed within curly brackets. eg:- the set of natural numbers less than 6. A= {1,2,3,4,5} the set of vowels in English alphabet. B= {a , e , I , o , u} Note: in roaster form all the elements are taken as distinct.

Set builder form:- In set builder form each of the elements of a set possesses a single common property which is not possessed any element outside the set. eg:- the set of vowels in the English alphabet A= { x:x is a vowel in the English alphabet} B= {x:x is a natural number and 3<x<=6} C= {x:x is an odd natural number less than 3}

TYPES OF SETS Equal sets: Two set A and B are said to be equal if they have exactly the same elements and we write A=B. they have exactly same elements. Empty set: A set which doesn’t contain any element is called the empty set. It is denoted by { } or 0. Finite and infinite set: A set which is empty or consists of a definite number of elements is called finite otherwise the set is called infinite.

Every set is subset of itself. i.e. ACB. 0 is subset of every set. Subsets: A set A is said to be subsets of a set B if every element of A is also an element of B. it is represented as (ACB). Important results:- Every set is subset of itself. i.e. ACB. 0 is subset of every set.

Intervals of subsets of R Open interval:- It is written in ( ). eg:- {3,4,5,6,7,}  can be written as (2,8) Closed interval:- In this interval, numbers are enclosed between [ ]. eg:- {3,4,5,6,7}  can be written as [3,7] Semi -closed interval:- The numbers are written between [ ). eg:- {3,4,5,6,7} can be written as [3,8). Semi- open interval:- The numbers are written between ( ]. eg:- {3,4,5,6,7} can be written as (2,7].

Power set and some important results:- The collection of all the subsets of a set is called the power set of the given set. Eg: A={1, 2, 3} Subsets of A:- {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}, 0. Power set of A:- {{1}, {2}, {3}, {1,2}, {1,3}, {2,3}, 0,{1,2,3,}} If m is the no. of elements of a set A i.e. n(A)=m then, n(P(A))= 2m . If m is the no. of elements of a set ‘A’ then, no. of proper sub-sets of ‘A’= 2m-1

N C W C I C Q C R, R-Q C R Where N:- natural numbers W:- whole numbers Proper sub-set: let A and B be two sets if ACB and A=B. then, A is called a proper subset of B. Super set: if set B contains the set A in it. Then, B is the super set of A. Singleton set: it is a set containing only one element. Subsets of a set of real numbers:- N C W C I C Q C R, R-Q C R Where N:- natural numbers W:- whole numbers I:- integers Q:- rational numbers R:- real numbers R-Q:- irrational numbers

Universal set:- Universal set is the set which contains all sets in a given context is called universal set. Eg:- A={1,2,3} B={2,3,5} c= {3,5,6,8,9} Then, U = {1,2,3,5,6,8,9,…………..}

Venn diagrams In Venn diagrams universal sets are represented by rectangles and sets by closed curves usually circles as shown in figure:- U

OPERATION OF SETS Union of sets:- let A and B be any two sets. The union of A and B, is the set which consists of all the elements of A and all the elements of B, the common elements being taken only once. The symbol ‘U’ is used to denote the union. AUB:- U

SOME PROPERTIES OF UNION OF SETS:- Commutative law:- AUB=BUA Associative law:- AU(BUC)= (AUB)UC Law of identity element:- AUO= A, O is the identity. Idempotent law:- AUA= A Law of U:- UUA=U

Intersection of sets:- The intersection of sets A and B is the set of all elements which are common to both A and B. The symbol is used to denote the intersection. A B:- U U U

Properties of intersection of sets:- Commutative law:- A B Associative property:- A (B C)= (A B) C Law of O and U:- O A= O, U A=A. Distributive law:- A (B C)=(A B) (A C) U U U U U U U U U U U U

A B= O then, A and B are said to be disjoint sets. Disjoint sets:- if A and B are two sets such that A B= O then, A and B are said to be disjoint sets. A B:- U U U

Difference of sets:- The difference of sets A and B in t his order is the set of elements which belong to A but not to B. A-B:- B-A:- U U

Some important Venn diagrams:- U BUC A B C U A B U A B C

U A B A (BUC) U C U A B A C U C U A B (A B) U (A C) U U C

PROPERTIES OF COMPLIMENT OF A SET:- Compliment laws:- AUA’ = U A A’ = O Law of double complimentation:- (A’)’= A Law of empty set and universal set:- O’ = U U’= O U

De Morgan's law:- The compliment of the union of two sets is the intersection of their compliments and the compliments of intersection of two sets is the union of their compliments. (AUB)’= A’ B’ (A B)’= A’UB’ U U