Successfully reported this slideshow.

×

# SETS PPT-XI.pptx

Highly needed for class 11

Highly needed for class 11

## More Related Content

### SETS PPT-XI.pptx

1. 1. LR DAV PUBLIC SCHOOL, GANDARPUR, CUTTACK. MATHEMATICS CLASS-XI SETS BY SUSHREE S. SAHU
2. 2. INTRODUCTION: ο΅ The theory of sets was developed by German mathematicians George Cantor. ο΅ Sets forms the basis of several other fields of study like Relations and functions, geometry, sequences, probability etc.
3. 3. DEFINITION: ο΅ A set is a well-defined collection of objects. ο΅ The objects are called as elements or members of the set. Example: (i) The rivers of India. (ii) The vowels of English alphabet. (iii) The factors of 12, namely 1, 2, 3, 4, 6, 12. The above examples are well defined collection of objects in a particular category. NOTE: βThe set of good cricketers in the Worldβ is not a set because the word βgoodβ is not well defined here. The criteria to define goodness varies from person to person.
4. 4. REPRESENTATION OF A SET: ο΅ Sets are usually represented by capital letters like A, B, C, D, M, N etc. ο΅ The elements of a set are represented by small letters a, b, c, x, y, z etc. ο΅ The elements are separated by commas and are enclosed within the curly braces{}. Example: M={a, b, c, d} Here M is a set which contains the elements a, b, c, d. ο΅ If βaβ is an element of set M then we say that βaβ belongs to the set M. We write it as aβ M. ο΅ If βpβ is not an element of set M then we say that βpβ does not belong to the set M. We write it as pβ M.
5. 5. METHODS OF REPRESENTATION OF A SET: ο΅ There are two methods of representing a set: (i) Roaster or tabular form (ii) Set builder form ο΅ (i) Roaster or tabular form: In Roaster form, all the elements of a set are enlisted being separated by commas and enclosed within curly braces. Ex- If A is the set of all prime numbers less than 10, then A={2, 3, 5, 7} NOTE: The order in which the elements are written in a set makes no difference. Also the repetition of an element has no effect. Ex-{1, 2, 3} is same as {3, 2, 1}. Also {1,2,3,1,3} is same as {1,2,3}.
6. 6. ο΅ (ii) Set-builder form: In Set-builder form, all the elements of a set possess a single common property which is not possessed by any element outside the set. Ex-The set of all even natural number less than 10 can be written as: A={π₯: π₯ is an even natural number less than 10} Or A={π₯: π₯ = 2π, π β π and π < 5} The set A can be read as βthe set of all π₯ such that π₯ is an even natural number less than 10β. This set can be represented in roaster form i.e. A={2,4,6,8}
7. 7. Examples: Converting set builder form to roaster form: (i) A={π₯: π₯ is an odd natural number} A={1, 3, 5, 7,β¦β¦..} (ii) B={π₯: π₯ is a letter in the word βMATHEMATICSβ} B={M, A, T, H, E, I, C,S} Converting roaster form to set builder form: (i)A={1, 4, 9, 16, β¦β¦..} A={π₯: π₯ = π2,where π β π} (ii) B={5, 25,125, 625} B={π₯: π₯ = 5π,1 β€ π β€ 4}
8. 8. Some important number sets:- ο΅ π = The sππ‘ ππ πππ πππ‘π’πππ ππ’πππππ  = 1, 2, 3, 4, 5, β¦ β¦ β¦ β¦ β¦ ο΅ π = πβπ π ππ‘ ππ πππ π€βπππ ππ’πππππ  = 0, 1, 2, 3, 4, β¦ β¦ β¦ β¦ β¦ . ο΅ π = πβπ π ππ‘ ππ πππ πππ‘πππππ  = β¦ β¦ β¦ β¦ . . β3, β2, β1, 0, 1, 2, 3, β¦ β¦ β¦ β¦ ο΅ π = πβπ π ππ‘ ππ πππ πππ‘πππππ ππ’πππππ  = π π : π, π β π, π β  0 = 1, 2, 1 3 , 5 3 , 0, β 7 9 , β¦ β¦ β¦ β¦ . . ο΅ π = πβπ π ππ‘ ππ πππ ππππ ππ’πππππ  ο΅ πβ² = π β π = π = π₯: π₯ β π πππ π₯ β π = πβπ π ππ‘ ππ πππ πππππ‘πππππ ππ’πππππ , π. π π‘βπ ππ’πππππ  π€βππβ πππ πππ‘ πππ‘πππππ ππ’πππππ  = 2, 3, 2 + 5, β¦ β¦ β¦ β¦ . π, π, log 2 β¦ β¦ β¦ β¦ β¦ .
9. 9. DIFFERENT TYPES OF SETS: ο΅ The Empty Set: A set containing no elements is called an Empty set or Null set or void set. It is denoted by β(Read as phi) or { }. Example:- π΄ = π₯ β π: 1 < π₯ < 2 = β. ο΅ Singleton Set: A set consisting of a single element is called a singleton set. Example:- A= π₯ β π: π₯2 = 9 is a singleton set as A={3}. ο΅ Finite Set: A set which is empty or consists of a definite number of elements is called a finite set. Example:- A={1,3,5} is a finite set. Cardinal number of a finite set: The number of elements present in the finite set is called the cardinal number of a that set. It is denoted by n(A). Ex- The cardinal number of the above set A is 3 i.e. n(A)=3
10. 10. ο΅ Infinite Set: If the set does not contain finite number of elements then the set is called an infinite sets. Ex- The set of all lines in a plane. ο΅ Equal Sets: Two sets A and B are said to be equal if every elements of set A is a member of set B and every elements of set B is a member of set A. Ex-1. A={1,2,3,4} and B={4,3,2,1} are equal sets. 2. A={x: x is a letter of the word βITEMβ} and B={x: x is a letter of the word βTIMEβ} are equal sets. ο΅ Equivalent Sets: Two finite sets A and B are said to be equivalent sets if their cardinal numbers are same i.e. if n(A)=n(B).
11. 11. Subsets: ο΅ Proper Subset: Let A and B be two sets. Set π΄ is called a proper subset of set π΅ if all the elements of set π΄ are also in set π΅ and there is at least one more element in π΅ which is not in π΄. We denote this as π¨ β π©. Ex- A={1,2,3,4}, B={1,2,3,4,5,6}. Here π¨ β π©. ο΅ Subset: A set π΄ is called a subset of another set π΅ if π΄ is a proper subset of π΅ or A is equal to π΅. We denote it by π¨ β π©. Also we read this as "π΄ is subset of π΅". Also we can say here "π΅ is superset of π΄". We denote it by π© β π¨. Important results: ο΅ The Empty set (β) is a subset of every set. ο΅ Every set is subset of itself. ο΅ If π¨ β π© and π© β π¨ then π¨ = π©. ο΅ The total no. of subsets of a set containing βπβ number of elements is 2π. ο΅ The total no. of non-empty subsets of a set containing βπβ number of elements is 2πβ1. B A π¨ β π©
12. 12. INTERVALS AS SUBSETS OF R: ο΅ Closed Intervals: The set of all numbers π₯ such that π β€ π β€ π is called a closed interval. It is denoted by [π, π]. [π, π]={π: π β€ π β€ π } i.e. the set contains all numbers in between π and π including π and π itself. ο΅ Open Intervals: The set of all numbers π₯ such that π < π < π is called a closed interval. It is denoted by (π, π). (π, π)={π: π < π < π } i.e. the set contains all numbers in between π and π excluding π and π. a b [a, b] a b (a, b)
13. 13. ο΅ Semi Open/Closed Intervals(opened at left end and closed at right end): The set of all numbers π₯ such that π < π β€ π is called a semi open/closed interval. It is denoted by (π, π]. (π, π]={π: π < π β€ π } i.e. the set contains all numbers in between π and π excluding π but including π. ο΅ Semi Open/Closed Intervals( closed at left end and opened at right end): The set of all numbers π₯ such that π β€ π < π is called a semi open/closed interval. It is denoted by [π, π). [π, π)={π: π β€ π < π } i.e. the set contains all numbers in between π and π including π but excluding π. a b (a, b] a b [a, b)
14. 14. ο΅ UNIVERSAL set: A set that contains all sets in a given context is called the universal set and is denoted by U. Ex-When we are using intervals on real line , the set R of real numbers is taken as the universal set. ο΅ POWER set: Let A be a set. Then the set containing all the subsets of set A is called the power set of A and is denoted by P(A). P(A)={S: SβA}. Ex- Let A={1,2}.Then P(A)={{1},{2},{1,2}, β}. Note: 1.Since the empty set and the set A itself are subsets of A and therefore elements of P(A).Thus the power set of a set is always non-empty. 2.If A is a finite set having π elements, then P(A) has 2π elements.
15. 15. VENN DIAGRAM ο΅ First of all a Swiss mathematician Euler represented the set by diagrams. ο΅ Then British mathematician John Venn popularized the diagram in the 1880s. ο΅ Thus the diagrammatic or pictorial representation of sets are called as Venn-Euler Diagram or simply Venn Diagram. ο΅ In Venn-Diagram, the Universal set Uis represented by points within a rectangle and its subsets are represented by points in closed curves(usually circles) within the rectangle. ο΅ If set A is subset of a set B, then the circle representing the set A is drawn inside the circle representing set B. U B A
16. 16. ο΅ If A and B are not equal but they have some common elements, then to represent A and B we draw two intersecting circles inside the rectangle representing the universal set. ο΅ Two disjoint sets are represented by two non-intersecting circles. U B A U A B
17. 17. OPERATIONS ON SETS: ο΅ UNION: Let A and B be two sets. The union of A and B is the set of all those elements that either belongs to A or belongs to B or to both A and B. AβͺB={π₯: π₯ β π΄ ππ π₯ β π΅} We can say if π₯ β A βͺ B β π₯ β A ππ π₯ β B. Ex-If A={a, b, c, d} and B={d, e, f}, then AβͺB={a, b, c, d, e, f}. Properties: ο΅ π΄ β π΄ βͺ π΅ πππ π΅ β π΄ βͺ π΅ . ο΅ If π΄ β π΅,then π΄ βͺ π΅ = π΅ and if π΅ β π΄,then π΄ βͺ π΅ = π΄. ο΅ π΄ βͺ π΅ = π΅ βͺ π΄(Commutative law) ο΅ π΄ βͺ π΅ βͺ πΆ = π΄ βͺ (π΅ βͺ πΆ)(Associative law) ο΅ π΄ βͺ β = π΄(Identity law) ο΅ π΄ βͺ π΄ = π΄(Idempotent law) ο΅ π΄ βͺ π = π(Law of U) A B B A AβͺB, if A and B are joint sets. AβͺB, if A and B are disjoint sets. AβͺB, if A βB