0% found this document useful (0 votes)
13 views24 pages

Understanding Sets in Mathematics

sets for class 9

Uploaded by

bushra
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views24 pages

Understanding Sets in Mathematics

sets for class 9

Uploaded by

bushra
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

jhdhhd

MMATHBHS
Mathematics
Lesson Objectives

Understanding Sets in
Mathematics
What is a Set?

What is a Set?

•A set is a collection of distinct, well-defined objects.


•Example: The set of natural numbers less than 10 is written
as: A={1,2,3,4,5,6,7,8,9}A = \{1, 2, 3, 4, 5, 6, 7, 8,
9\}A={1,2,3,4,5,6,7,8,9}
Types of Sets

•Empty Set: A set with no elements.


•Singleton Set: A set with only one element.
•Finite Set: A set with a finite number of elements.
•Infinite Set: A set with an infinite number of elements
Empty Set or Null Sets

Empty Set or Null Set

•A set with no elements is called the empty set or null set.


•Denoted by ∅ or {}.
•Example: A={x:x is an odd integer and divisible by 2}
•A={x:x is an odd integer and divisible by 2}
• A={}
Singleton Set

Singleton Set

•A set with only one element.


•Example: A={x:3<x<5,x∈N}
•The set of all even prime numbers.
Finite Set

Finite Set

•A set with a finite number of elements.


•Example: The set of family members.
•Example: The set of indoor/outdoor games you play.
•Example: The set of curricular subjects you learn in school.
•Example: A={x:x is a factor of 36}
Infinite Set

Infinite Set
•A set with an infinite number of elements.
•Example: The set of natural numbers.
•Example: The set of all points on a line.
Cardinal numberSet

Cardinal number sets


•The number of elements in a set is called the cardinal
•.number.(counting the number of elements in a set )
•Denoted by n(A).
•Example: If A={1,2,3,4,5,7,9,11} then n(A)= 8
Equivalent Sets

Equivalent Sets
•Two sets are equivalent if they have the same number of
elements.
•Denoted by A≈B
•Example: A={ball, bat} and B={history, geography}
•Here n(A)=n(B)=2
Equal Set

Equal Set
•Two sets are equal if they contain exactly the same elements.
•Denoted by A=BA = BA=B.
•Example: A={1,2,3,4} and B={4,2,3,1} then A = B.
•Note: A set does not change if elements are repeated.
•Example: A={a,b,c} and B={a,a,b,b,b,c} then B={a,b,c}. A = B
Universal Set
Universal set

Universal set
A Universal set is a set which contains all the elements of all the
sets under consideration and is usually denoted by U.
Examples:
1. If we discuss elements in Natural numbers, then the universal set
U is the set of all Natural numbers. U = { x : x ∈ N }.
2. If A = { earth, mars, jupiter }, then the universal set U is the
planets of the solar system.
Note: Equal sets are equivalent sets but equivalent sets need not be
equal.
For example, if A = { p, q, r, s, t } and B = { 4, 5, 6, 7, 8 }. Here
n(A) = n(B), so A and B are equivalent but not equal.
Subset
Sub set

Sub set
Let A and B be two sets. If every element of A is also an element
of B, then A is called a subset of B. We write A ⊆ B.
A ⊆ B is read as “A is a subset of B”. Thus A ⊆ B, if a ∈ A implies
a ∈ B.
If A is not a subset of B, we write A ⊈ B.
Example:
1. { 1 } ⊆ { 1, 2, 3 }
2. { 2, 4 } ⊈ { 1, 2, 3 }
Thinking Corner: Since every element of A is also an element of
B, the set B must have at least as many elements as A, thus n(A)
≤ n(B).
Suppose that n(A) > n(B), then A has more elements than B,
and hence there is at least one element in A that cannot be in B,
so A is not a subset of B.
Proper Subset
Proper Subset
Proper Subset
Let A and B be two sets. If A is a subset of B and A ≠ B,
then A is called a proper subset of B and we write A ⊂ B.
Example: If A = { 1, 2, 5 } and B = { 1, 2, 3, 4, 5 } then A
is a proper subset of B i.e., A ⊂ B.
Disjoint Sets
Disjoint sets
Disjoint sets
Two sets A and B are said to be disjoint if they do not have common
elements.
In other words, if A ∩ B = ∅, then A and B are said to be disjoint
sets.
Example: Verify whether A = { 20, 22, 23, 24 } and B = { 25, 30,
40, 45 } are disjoint sets.
Solution: A ∩ B = { 20, 22, 23, 24 } ∩ { 25, 30, 40, 45 } = ∅. Since
A ∩ B = ∅, A and B are disjoint sets.
Power Set
Power of Set
Power of Set
The set of all subsets of a set A is called the power set of A. It is
denoted by P(A).
Example: If A = { 2, 3 }, then the power set of A is:
Subsets of A: ∅, { 2 }, { 3 }, { 2, 3 }.
Power set of A: P(A) = { ∅, { 2 }, { 3 }, { 2, 3 } }.
Important Property:
If n(A) = m, then n[P(A)] = 2^m.
The number of proper subsets of a set A is n[P(A)] - 1 = 2^m - 1.
Example: Find the number of subsets and the number of proper
subsets of a set X = { a, b, c, x, y, z }.
Solution: Given X = { a, b, c, x, y, z }, n(X) = 6.
The number of subsets = n[P(X)] = 2^6 = 64.
The number of proper subsets = n[P(X)] - 1 = 2^6 - 1 = 64 - 1 =
63.
Power Set
Power of Set
Given the Venn diagram below, write the
elements of the following sets:
•(i) A
•(ii) B
•(iii) A∪B
•(iv) A∩B
•(v) A′
•(vi) B′
•(vii) A∪B′
•(viii) A∩B′
Power Set

Consider the sets A = {3, 6, 9, 12} and B =


{6, 12, 18}. Find:
•(i) A∪B
•(ii) A∩B
•(iii) A–B
•(iv) B–A
•(v) A′ (where U = {1, 3, 6, 9, 12, 15, 18})
Power Set

Let U = {p, q, r, s, t, u}, A = {p, r, t}, and B =


{q, s, u}. Find the following:
•(i) A′
•(ii) B′
•(iii) A∪B
•(iv) A∩B
•(v) A∪B′
•(vi) (A′∩B)
Power Set

For the sets A = {2, 4, 6, 8}, B = {4, 5, 6, 7}, and C


= {6, 7, 8, 9}, calculate:
•(i) A∪B∪C
•(ii) A∩B∩C
•(iii) (A∪B)∩C
•(iv) (A∩C)∪(B∩C)
•(v) (A∩B)′
.
Power Set

[Link] the Venn diagram below, write the elements of the following sets:
•(i) A: Elements within set A (depends on the Venn diagram, but let’s assume A = {1, 2, 3})
•(ii) B: Elements within set B (assuming B = {3, 4, 5})
•(iii) A∪B: {1, 2, 3, 4, 5}
•(iv) A∩B: {3}
•(v) A′: Elements in the universal set U but not in A
•(vi) B′: Elements in the universal set U but not in B
•(vii) A∪B′: Elements in A or outside B
•(viii) A∩B′: Elements in A and outside B
[Link] the sets A = {3, 6, 9, 12} and B = {6, 12, 18}. Find:
•(i) A∪B: {3, 6, 9, 12, 18}
ii) A∩B: {6, 12}
•(iii) A–B: {3, 9}
•(iv) B–A: {18}
•(v) A′: {1, 15} (assuming U = {1, 3, 6, 9, 12, 15, 18})
Power Set

•Let U = {p, q, r, s, t, u}, A = {p, r, t}, and B = {q, s, u}. Find the following:
•(i) A′: {q, s, u}
•(ii) B′: {p, r, t}
•(iii) A∪B: {p, q, r, s, t, u} (since A and B cover all elements in U)
•(iv) A∩B: ∅ (no common elements between A and B)
•(v) A∪B′: {p, q, r, s, t, u} (same as A∪B)
•(vi) (A′∩B): {q, s, u} (elements outside A but inside B)
•For the sets A = {2, 4, 6, 8}, B = {4, 5, 6, 7}, and C = {6, 7, 8, 9}, calculate:
•(i) A∪B∪C: {2, 4, 5, 6, 7, 8, 9}
•(ii) A∩B∩C: {6}
•(iii) (A∪B)∩C: {6, 7, 8}
•(iv) (A∩C)∪(B∩C): {6, 7, 8}
•(v) (A∩B)′: {2, 5, 7, 8, 9}
Power Set

[Link] P = {x | x is a vowel in the English alphabet} and Q = {x | x is a letter in the


word "SET"}. Write down the following sets:
•(i) P∪Q: {a, e, i, o, u, s, t}
•(ii) P∩Q: {e}
•(iii) P–Q: {a, i, o, u}
•(iv) Q–P: {s, t}
Thank You
Thank you

Common questions

Powered by AI

A subset implies that every element of set A is also in set B, denoted as A ⊆ B. For example, {1} ⊆ {1, 2, 3} . A proper subset takes this further, saying A is a subset of B but not equal to B, denoted as A ⊂ B. For instance, if A = {1, 2, 5} and B = {1, 2, 3, 4, 5}, then A is a proper subset of B . Understanding these helps in recognizing the hierarchical structure of sets and aids in logical expressions and database theory.

Operations like (A ∩ B)∪C first identify overlapping elements with intersection and then expand the set by adding another set's elements through union. For the given sets, A ∩ B = {4, 6}, and when united with C, the result is {4, 6, 7, 8, 9}. This highlights how operations can rearrange set memberships to explore shared and unique features, essential in formal logic, algorithm design, and modeling interrelationships .

The power set of a set A is the set of all possible subsets of A, including the empty set and A itself. If A has m elements, then the power set P(A) contains 2^m subsets. The number of proper subsets, which excludes the full set itself, is one less than the number of subsets: 2^m - 1. For a set X = {a, b, c, x, y, z} with n(X) = 6, the power set has 2^6 = 64 subsets and the number of proper subsets is 63 .

The cardinal number of a set is the count of elements it contains, denoted n(A). Two sets are equivalent if they have the same cardinal number, meaning the same number of elements. This equivalence is crucial for understanding that while sets may differ in content, their size can affect operations like mapping, comparing, and bijections. For example, A = {1, 2} and B = {3, 4} have cardinality 2, hence are equivalent, enabling identity mappings across different contexts .

The complement of a set includes all elements in the universal set not present in the original set, which effectively defines boundaries and exclusions in set operations. For A = {3, 6, 9, 12}, A' = {1, 15, 18} relative to U . Complements are crucial in logical negation in probability, digital circuits design, and situations where not selecting elements is key, such as constraints management and defining external conditions.

Equivalent sets have the same number of elements, but their elements need not be identical. For example, A = {ball, bat} and B = {history, geography} are equivalent because n(A) = n(B) = 2 . Equal sets contain exactly the same elements, regardless of the order or repetition of elements. Thus, A = {1, 2, 3, 4} and B = {4, 2, 3, 1} are equal because they contain the same elements .

The universal set, denoted by U, contains all elements under discussion and provides a reference frame for complement operations and Venn diagrams. For instance, if we're discussing natural numbers, U is the set of all natural numbers . In problem-solving, it helps define complements; for example, if A = {earth, mars, jupiter}, the universal set of planets makes it possible to find complements or complete systems (all planets in the solar system). Its utility is particularly evident in probability, set partitions, and exhaustive lists of elements.

Disjoint sets are significant because they highlight sets with no common elements, which is essential in set operations and problem solving. For example, the sets A = {20, 22, 23, 24} and B = {25, 30, 40, 45} are considered disjoint because their intersection is empty, A ∩ B = ∅ . Recognizing disjoint sets helps in tasks like Venn diagram construction and probability calculations where mutual exclusivity is a factor.

Union and intersection greatly influence the selection and combination of elements from sets. The union (A ∪ B) brings all unique elements together: {2, 4, 5, 6, 7, 8}, combining all elements from both sets without repetition. Intersection (A ∩ B), on the other hand, selects only common elements: {4, 6}. These operations serve in logical computation, database queries, and defining relationships, often used in scenario analyses and data-centric strategies .

A singleton set contains exactly one element, making it a fundamental unit in understanding bigger constructs of sets. For instance, the set of all even prime numbers is a singleton set because it only contains the number 2 . Recognizing singleton sets helps in appreciating the minimalistic constructs in set theory and provides a basis for building increments in cardinality and complexity assessments.

You might also like