SETS. JEE-Mathematics

Similar documents
SETS. Chapter Overview

Chapter-2 SETS In Mathematics, Set theory was developed by George Cantor ( ).

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.

1 Chapter 1: SETS. 1.1 Describing a set

Set Theory. CPT Section D Quantitative Aptitude Chapter 7 Brijeshwar Prasad Gupta

Sets. your school. A group of odd natural numbers less than 25.

SETS. set of natural numbers by N set of integers by Z set of rational numbers by Q set of irrational numbers by T

Contents. 4. Principle of Mathematical Induction Introduction Motivation The Principle of Mathematical Induction 88

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Spring

Discrete Basic Structure: Sets

A set is an unordered collection of objects.

In this initial chapter, you will be introduced to, or more than likely be reminded of, a

1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

BASIC MATHEMATICAL TECHNIQUES

1.1 Introduction to Sets

Circles & Interval & Set Notation.notebook. November 16, 2009 CIRCLES. OBJECTIVE Graph a Circle given the equation in standard form.

Basic Set Concepts (2.1)

Exclusive Disjunction

With Question/Answer Animations. Chapter 2

4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall

ICS141: Discrete Mathematics for Computer Science I

Sets McGraw-Hill Education

Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition

The objects in a set are the elements or members of the set. Always enclose the elements of a set in curly brackets. is read is an element of

4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall Set-builder notation (a more precise way of describing a set)

Set builder notation: Describe the set in terms of its properties, Chapter 1: SETS AND PROBABILITY. 1.1 Introduction to Sets

Sets. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

CSI30. Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums. 2.1 Sets and subsets 2.2 Sets of sets

Math 3201 Unit 1 Set Theory

CHAPTER 1 SETS AND EVENTS

CISC 1100: Structures of Computer Science

Sets. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

Introduction to Set Operations

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sec$on Summary. Definition of sets Describing Sets

Chapter 0: Sets and Numbers

CHAPTER 1. Preliminaries. 1 Set Theory

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Section-A. Short Questions

Chapter 2 - Basics Structures

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

Mathematics Review for Business PhD Students Lecture Notes

Section 1: Sets and Interval Notation

For all Engineering Entrance Examinations held across India. Mathematics

Chapter 1 Math Set: a collection of objects. For example, the set of whole numbers is W = {0, 1, 2, 3, }

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.

Unit 1 Day 1. Set Operations & Venn Diagrams

CSE 20 DISCRETE MATH. Winter

Chapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

Sets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

Discrete Mathematical Structures: Theory and Applications

Preface. [ Uj \m Vk NVp U\k Y rj U! - kndh kùa«bg. Rªjudh. (iii)

Mathematics Review for Business PhD Students

Mathematics Foundation for College. Lesson Number 1. Lesson Number 1 Page 1

Point sets and certain classes of sets

Tenth Bit Bank Mathematics Real Numbers

CONTENTS. FOREWORD iii PREFACE v CHAPTER 1 Sets 1. CHAPTER 2 Relations and Functions 19. CHAPTER 3 Trigonometric Functions 34

PREFACE. Synergy for Success in Mathematics 7 is designed for Grade 7 students. The textbook

CS 2336 Discrete Mathematics

Foundations of Mathematics

Sets Exercise 1. Question 1: Which of the following are sets? Justify your answer.

Perfect Mathematics - II

A B is shaded A B A B

COMP9020 Lecture 3 Session 2, 2014 Sets, Functions, and Sequences. Revision: 1.3

Today s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets

Sets. 1.1 What is a set?

x +y = 4 2x + 3y = , y=

Math 3338: Probability (Fall 2006)

The universal set is the set of all possible elements of set used in the problem. Denoted by U

Step-by-step and detailed demonstrations of how a specific concept or technique is applied in solving problems.

Welcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation

Std. XI Commerce Mathematics & Statistics - I

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

In N we can do addition, but in order to do subtraction we need to extend N to the integers

= A. Example 2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {4, 6, 7, 9, 10}, and B = {2, 6, 8, 9}. Draw the sets on a Venn diagram.

MATHEMATICS ACHIVEMENT TEST(Try out)

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions

Glossary. Glossary 981. Hawkes Learning Systems. All rights reserved.

CM10196 Topic 2: Sets, Predicates, Boolean algebras

Finite Math Section 6_1 Solutions and Hints

0 Sets and Induction. Sets

Discrete Mathematics Set Operations

R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member

Probability Theory Review

Boolean Algebras. Chapter 2

Math 42, Discrete Mathematics

Intro to Logic and Proofs

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

CSE 20. Final Review. CSE 20: Final Review

Set Theory. CSE 215, Foundations of Computer Science Stony Brook University

1. (B) The union of sets A and B is the set whose elements belong to at least one of A

Welcome to CS103! Three Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation

Glossary. Glossary Hawkes Learning Systems. All rights reserved.

Transcription:

STS J-Mathematics ST : A set is a collection of well defined objects which are distinct from each other Set are generally denoted by capital letters A, B, C,... etc. and the elements of the set by a, b, c... etc. If a is an element of a set A, then we write a A and say a belongs to A. If a does not belong to A then we write a A, e.g. The collection of first five prime natural numbers is a set containing the elements 2, 3, 5, 7, 11. SOM IMPORTANT NUMBR STS : N = Set of all natural numbers = {1, 2, 3, 4,...} W = Set of all whole numbers = {0, 1, 2, 3,...} Z or I set of all integers = {... 3, 2, 1, 0, 1, 2, 3,...} Z + = Set of all +ve integers = {1, 2, 3,...} = N. Z = Set of all ve integers = ( 1, 2, 3,...} Z 0 = The set of all non-zero integers. = {±1, ±2, ±3,...} Q = The set of all rational numbers. p = :p, q I, q 0 q R = the set of all real numbers. R Q = The set of all irrational numbers e.g. 2, 3, 5,..., e, log2 etc. are all irrational numbers. MTHODS TO WRIT A ST : ( i ) Roster Method : In this method a set is described by listing elements, separated by commas and enclose then by curly brackets e.g. The set of vowels of nglish Alphabet may be described as a, e, i, o, u ( i i ) Set Builder Form : In this case we write down a property or rule p Which gives us all the element of the set A = {x : P(x)} e.g. A = {x : x N and x = 2n for n N} i.e. A = {2, 4, 6,...} e.g. B = {x 2 : x z} i.e. B = {0, 1, 4, 9,...} TYPS OF STS : Null set or mpty set : A set having no element in it is called an mpty set or a null set or void set it is denoted by or { } e.g. A = {x N : 5 < x < 6} = A set consisting of at least one element is called a non-empty set or a non-void set. 1

J-Mathematics Illustration 1 : The set A = [x : x R, x 2 = 16 and 2x = 6] equal- (1) (2) [14, 3, 4] (3) [3] (4) [4] x 2 = 16 x = ±4 2x = 6 x = 3 There is no value of x which satisfies both the above equations. Thus, A = Hence (1) is the correct answer Singleton : A set consisting of a single element is called a singleton set. e.g. Then set {0}, is a singleton set Finite Set : A set which has only finite number of elements is called a finite set. e.g. A = {a, b, c} Order of a fi nite set : The number of elements in a finite set is called the order of the set A and is denoted O(A) or n(a). It is also called cardinal number of the set. e.g. A = {a, b, c, d} n(a) = 4 Infinite set : A set which has an infinite number of elements is called an infinite set. e.g. A = {1, 2, 3, 4,...} is an infinite set qual sets : Two sets A and B are said to be equal if every element of A is a member of B, and every element of B is a member of A. If sets A and B are equal. We write A = B and A and B are not equal then A B e.g. A = {1, 2, 6, 7} and B = {6, 1, 2, 7} A = B quivalent set s : Two fi nite set s A and B are equivalent if their number of element s are same ie. n(a) = n(b) e.g. A = {1, 3, 5, 7}, B = {a, b, c, d} n(a) = 4 and n(b) = 4 n(a) = n(b) Note : qual set always equivalent but equivalent sets may not be equal Subsets : Let A and B be two sets if every element of A is an element B, then A is called a subset of B if A is a subset of B. we write A B xample : A = {1, 2, 3, 4} and B = {1, 2, 3, 4, 5, 6, 7} A B The symbol '' '' stands for "implies" Proper subset : If A is a subset of B and A B then A is a proper subset of B. and we write A B Note-1 : very set is a subset of itself i.e. A A for all A Note-2 : mpty set is a subset of every set Note-3 : Clearly N W Z Q R C Note-4 : The total number of subsets of a finite set containing n elements is 2 n Universal set : A set consisting of all possible elements which occur in the discussion is called a Universal set and is denoted by U Note : All sets are contained in the universal set e.g. If A = {1, 2, 3}, B = {2, 4, 5, 6}, C = {1, 3, 5, 7} then U = {1, 2, 3, 4, 5, 6, 7} can be taken as the Universal set. Power set : Let A be any set. The set of all subsets of A is called power set of A and is denoted by P(A) 2

J-Mathematics e.g. Let A = {1, 2} then P(A) = {, {1}, {2}, {1, 2}} e.g. Let P( ) = { } P(P( )) = {, { }} P(P(P( )) = {, { }, {{ }}, {, { }} Note-1 : If A = then P(A) has one element Note-2 : Power set of a given set is always non empty Illustration 2 : Two finite sets of have m and n elements respectively the total number of elements in power set of first set is 56 more thatn the total number of elements in power set of the second set find the value of m and n respectively. Number of elements in power set of 1 st set = 2 m Number of elements in power set of 2 nd set = 2 n Given 2 m = 2 n + 56 2 m 2 n = 56 2 n (2 m n 1) = 2 3 (2 3 1) n = 3 and m = 6 Do yourself - 1 : ( i ) Write the following set in roaster form : A = {x x is a positive integer less than 10 and 2 x 1 is an odd number} ( i i ) Write power set of set A = {, { }, 1} Some Operation on Sets : (i) Union of two sets : A B = {x : x A or x B} e.g. A = {1, 2, 3}, B = {2, 3, 4} then A B = {1, 2, 3, 4} (ii) Intersection of two sets : A B = {x : x A and x B} e.g. A = {1, 2, 3, }, B = {2, 3, 4} then A B = {2, 3} (iii) Difference of two sets : A B = {x : x A and x B} e.g. A = {1, 2, 3}, B = {2, 3, 4} ; A B = {1} (iv) Complement of a set : A' = {x : x A but x U} = U A e.g. U = {1, 2,..., 10}, A = {1, 2, 3, 4, 5} then A' = {6, 7, 8, 9, 10} (v) De-Morgan Laws : (A B)' = A' B' ; (A B)' = A' B' (vi) A (B C) = (A B) (A C) ; A (B C) = (A B) (A C) (vii) Distributive Laws : A (B C) = (A B) (A C) ; A (B C) = (A B) (A C) (viii) Commutative Laws : A B = B A ; A B = B A (ix) Associative Laws : (A B) C = A (B C) ; (A B) C = A (B C) (x) A = ; A U = A A = A ; A U = U (xi) A B A ; A B B (xii) A A B ; B A B (xiii) A B A B = A (xiv) A B A B = B 3

J-Mathematics Illustration 3 : Let A = {x : x R, x < 1] ; B = [x : x R, x 1 1] and A B = R D, then the set D is- (1) [x : 1 < x 2] (2) [x : 1 x < 2] (3) [x : 1 x 2] (4) none of these A = [x : x R, 1 < x < 1] B = [ x : x R : x 1 1 or x 1 1] = [x : x R : x 0 or x 2] A B = R D where D = [x : x R, 1 x < 2] Thus (2) is the correct answer. Disjoint Sets : IF A B =, then A, B are disjoint. e.g. if A = {1, 2, 3}, B = {7, 8, 9} then A B = Note : A A' = A, A' are disjoint. Symmetric Difference of Set s : A B = (A B) (B A) (A')' = A A B B' A' If A and B are any two sets, then (i) A B = A B' (ii) B A = B A' (iii) A B = A A B = (iv) (A B) B = A B (v) (A B) B = (vi) (A B) (B A) = (A B) (A B) Venn Diagrame : Clearly (A B) (B A) (A B) = A B Note : A A' =, A A' = U SOM IMPORTANT RSULTS ON NUMBR OF LMNTS IN STS : If A, B and C are finite sets, and U be the finite universal set, then (i) n(a B) = n(a) + n(b) n(a B) (ii) n(a B) = n(a) + n(b) A, B are disjoint non-void sets. (iii) n(a B) = n(a) n(a B) i.e. n(a B) + n(a B) = n(a) 4

J-Mathematics (iv) n(a B) = No. of elements which belong to exactly one of A or B = n((a B) (B A)) = n(a B) + n(b A) [ (A B) and (B A) are disjoint] = n(a) n(a B) + n(b) n(a B) = n(a) + n(b) 2n(A B) = n(a) + n(b) 2n(A B) (v) n(a B C) = n(a) + n(b) + n(c) n(a B) n(b C) n(a C) + n(a B C) (vi) Number of elements in exactly two of the sets A, B, C = n(a B) + n(b C) + n(c A) 3n(A B C) (vii) number of elements in exactly one of the sets A, B, C = n(a) + n(b) + n(c) 2n(A B) 2n(B C) 2n(A C) + 3n(A B C) (viii) n(a' B') = n((a B)') = n(u) n(a B) (ix) n(a' B') = n((a B)') = n(u) n(a B) Illustration 4 : In a group of 1000 people, there are 750 who can speak Hindi and 400 who can speak Bengali. How many can speak Hindi only?how many can spak Bengali? How many can spak both Hindi and Bengali? Let A and B be the sets of persons who can speak Hindi and Bengali respectively. then n(a B) = 1000, n(a) = 750, n(b) = 400. Number of persons whos can speak both Hindi and Bengali = n(a B) = n(a) + n(b) n(a B) = 750 + 400 1000 Number of persons who can speak Hindi only = 150 = n(a B) = n(a) n(a B) = 750 150 = 600 Number of persons Whos can speak Bengali only = n(b A) = n(b) n(a B) = 400 150 = 250 Do yourself - 2 : ( i ) If an = {ax : x N}, then the set 6N 8N is equal to- (1) 8N (2) 48N (3) 12N (4) 24N ( i i ) If P, Q and R subsets of a set A, then R (P' Q')' = (1) (R P) (R Q) (2) (R Q) (R P) (3) (R P) (R Q) (4) none of these (iii) If A = {x, y}, then the power set of A is- (1) {x y, y x } (2) {, x, y} (3) {, {x} {2y}} (4) {, {x}, {y}, {x, y}} ANSWRS FOR DO YOURSLF 1. ( i ) {1, 2, 3, 4, 5, 6, 7, 8, 9} ( i i ) {, { }, {{ }}, {1}, { { }}, {{ }, 1}, {, 1}, {, { }, 1}} 2. ( i ) 4 ( i i ) 1 (iii) 4 5