Sets

Hello, and welcome to today's mathematics lesson on Sets. We are going to explore one of the most fundamental ideas in mathematics — the concept of a set. By the end of this session, you will understand what sets are, how to represent them, the different types of sets, and how we can combine and compare sets using operations like union, intersection, and complement.

Let us begin with the fundamental question: what exactly is a set? A set is a collection of well-defined objects. The key word here is "well-defined" — this means there must be no confusion about whether something belongs to the collection or not.

For example, consider "the collection of tall students in your class." This is not well-defined, because "tall" is subjective — different people might have different ideas about what counts as tall. Therefore, this does not form a set.

However, "the collection of students in your class with heights between 135 centimetres and 160 centimetres" is well-defined. Anyone can check a student's height and determine whether they belong. This forms a valid set.

The individual objects that make up a set are called its elements or members. We usually name sets using capital letters like A, B, or C. The elements are written inside curly braces, separated by commas.

Here is an illustration. If A is the set containing the names John, Geeta, Amit, and Rohit, we write: A equals {John, Geeta, Amit, Rohit}. Similarly, if V represents the set of vowels in the English alphabet, then V equals {a, e, i, o, u}.

We use special symbols to show membership. The symbol ∈ means "belongs to," and ∉ means "does not belong to." If an element x belongs to set A, we write: x ∈ A. If x does not belong to set A, we write: x ∉ A.

Now, let us learn how to represent sets. There are two main methods: the Roster or Tabular Form, and the Rule Method or Set-Builder Form.

In Roster Form, we simply list all the elements inside curly braces, separated by commas. For instance, if set A contains the numbers 2, 5, 7, 9, and 15, we write: A equals {2, 5, 7, 9, 15}.

Remember two important rules for Roster Form. First, the order of elements does not matter — {a, b, c} is the same set as {b, a, c}. Second, each element is written only once, even if it appears multiple times in the original description. For example, {2, 3, 3, 2, 4, 2} simplifies to {2, 3, 4}.

Some standard sets in Roster Form include: the set of integers Z equals {..., -2, -1, 0, 1, 2, 3, ...}, the set of whole numbers W equals {0, 1, 2, 3, 4, ...}, and the set of natural numbers N equals {1, 2, 3, 4, ...}. Notice that the sets of whole numbers and natural numbers continue indefinitely — these are infinite sets.

The second method is Set-Builder Form, also called the Rule Method. Here, instead of listing elements, we write a rule or property that describes all the elements.

For example, let A be the set of natural numbers less than 7. In Set-Builder Form, we write: A equals {x : x ∈ N and x < 7}.

We read this as: "A is the set of all x such that x is a natural number and x is less than 7." The colon symbol is read as "such that."

Let us convert between the two forms. Take A equals {2, 3, 4, 5} in Roster Form. In Set-Builder Form, this becomes: {x : x ∈ N, 2 ≤ x < 6}.

There are often several equivalent ways to write the same rule.

Another example: C equals {1, 3, 5, 7, 9, 11} in Roster Form can be written as {x : x = 2n - 1, n ∈ N and n ≤ 6} in Set-Builder Form.

Notice how the rule captures the pattern: odd numbers generated by the formula 2n minus 1.

Now let us explore different types of sets.

A finite set has a limited, countable number of elements. The set of boys in your class is finite — you can count them. Similarly, {3, 4, 5, ..., 100} is finite, even though listing all elements would be tedious.

An infinite set, by contrast, has no end to its elements. The set of all whole numbers greater than 1000 is infinite, as the numbers continue forever. Another example: {x : x ∈ W and x > 1000} is infinite because whole numbers continue forever.

A singleton or unit set contains exactly one element. For example, {x : x is the President of India} is a singleton — there is only one President at any time.

Another example: the set of whole numbers between 6 and 8 contains only 7, so it is {7}, a singleton.

The empty set or null set contains no elements at all. We denote it by the symbol ∅ or simply by empty braces { }. Examples include {x : x ∈ N and x < 1} — there are no natural numbers below 1.

Be careful: the set {0} is not empty — it contains zero. And the set containing the empty set, written as {∅}, is also not empty — it has one element, namely the empty set itself.

Two sets are called joint or overlapping sets if they share at least one common element. For instance, if A equals {5, 7, 9, 11} and B equals {6, 9, 12, 15}, they are joint because 9 belongs to both.

Conversely, disjoint sets have no elements in common. If A equals {5, 7, 9, 11} and B equals {4, 6, 8, 10}, these sets are disjoint — no number appears in both.

Equivalent sets have the same number of elements, though the elements themselves may differ. If A equals {a, b, c} and B equals {x, y, z}, both have three elements, so they are equivalent. We write this as A ↔ B.

If A equals {1, 2, 3, 4, 5} and B equals {x : x ∈ N and x < 6}, then A equals B because both contain precisely 1, 2, 3, 4, and 5. If A equals {1, 2, 3, 4, 5} and B equals {x : x ∈ N and x < 6}, then A equals B because both contain precisely 1, 2, 3, 4, and 5.

Let us now discuss subsets. If every element of set A also belongs to set B, then A is a subset of B. We write this as A ⊆ B, read as "A is contained in B."

For example, if A equals {5, 6, 7} and B equals {2, 3, 4, 5, 6, 7}, then all elements of A are in B, so A ⊆ B.

Three fundamental properties: every set is a subset of itself — A ⊆ A. The empty set is a subset of every set — ∅ ⊆ A for any set A. And if A ⊆ B and B ⊆ A, then A equals B.

A proper subset is more specific: A is a proper subset of B if all elements of A are in B, but B contains at least one element not in A. We write A ⊂ B. No set is a proper subset of itself.

Here is a powerful result: if a set has n elements, it has exactly 2ⁿ subsets, and 2ⁿ − 1 proper subsets. For instance, a set with 2 elements has 4 subsets and 3 proper subsets. A set with 3 elements has 2³ equals 8 subsets and 7 proper subsets.

If A is a subset of B, we can also say B is a superset of A, written as B ⊇ A.

The universal set, denoted by ξ or capital U, contains all sets under consideration as its subsets.

For example, if A equals {5, 6, 7, 8}, B equals {1, 3, 5, 7}, and C equals {4, 6, 8, 10}, then the universal set might be {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. The choice of universal set depends on what we are studying. For the given sets, the choice of universal set is not unique — we could also use all whole numbers, or all integers, depending on our needs.

The complement of a set A, written as A ′ or A dashed, contains all elements in the universal set that are not in A.

For example, if the universal set is {1, 2, 3, 4, 5, 6} and A equals {2, 3, 5}, then A ′ equals {1, 4, 6}.

Key properties: a set and its complement are always disjoint — they share no elements. The complement of the empty set is the universal set, ∅ ′ equals ξ, and the complement of the universal set is the empty set, ξ ′ equals ∅.

Now we come to set operations, beginning with union. The union of sets A and B, written as A ∪ B, contains all elements that belong to A or to B or to both.

If A equals {5, 6, 7} and B equals {6, 8}, then A ∪ B equals {5, 6, 7, 8}. Notice that 6 appears only once, even though it is in both sets.

Union is commutative: A ∪ B equals B ∪ A. It is also associative: A ∪ (B ∪ C) equals (A ∪ B) ∪ C. Every set is a subset of its union with another set: A ⊆ (A ∪ B). And A ∪ A ′ equals the universal set — together, a set and its complement cover everything.

Next, the intersection of sets A and B, written as A ∩ B, contains only elements common to both sets.

With A equals {5, 6, 7} and B equals {6, 8}, the intersection A ∩ B equals {6}. If two sets are disjoint, their intersection is the empty set.

Intersection is also commutative and associative. The intersection is always a subset of each original set: (A ∩ B) ⊆ A. A set intersected with its complement gives the empty set: A ∩ A ′ equals ∅. And A ∩ ξ equals A itself.

The difference of two sets, A minus B, contains elements in A that are not in B. Similarly, B minus A contains elements in B but not in A.

If A equals {1, 2, 3, 4, 5, 6} and B equals {4, 5, 6, 7, 8, 9, 10}, then A minus B equals {1, 2, 3}, while B minus A equals {7, 8, 9, 10}. Set difference is not commutative — A minus B is generally different from B minus A.

Two important distributive laws connect union and intersection.

First: union distributes over intersection. A ∪ (B ∩ C) equals (A ∪ B) ∩ (A ∪ C). Let us verify with A equals {2, 5, 8, 11}, B equals {2, 4, 6, 8}, and C equals {5, 6, 7, 8}. First, B ∩ C equals {6, 8}, so A ∪ (B ∩ C) equals {2, 5, 6, 8, 11}. Also, A ∪ B equals {2, 4, 5, 6, 8, 11} and A ∪ C equals {2, 5, 6, 7, 8, 11}, so their intersection is {2, 5, 6, 8, 11}. Both sides match, confirming the law. A ∪ (B ∩ C) equals (A ∪ B) ∩ (A ∪ C).

Second: intersection distributes over union. A ∩ (B ∪ C) equals (A ∩ B) ∪ (A ∩ C). This can be verified in the same way using specific sets. A ∩ (B ∪ C) equals (A ∩ B) ∪ (A ∩ C).

These laws work exactly like multiplication distributing over addition in arithmetic, though the operations are different.

Finally, let us discuss cardinal numbers. The cardinal number of a set, written as n of A or n(A), simply counts how many elements the set contains.

If A equals {5, 8, 13, 19}, then n of A equals 4. If B equals {x : x ∈ N and 8 < x ≤ 15}, then B equals {9, 10, 11, 12, 13, 14, 15}, so n of B equals 7.

For any two finite sets, here are crucial formulas. The cardinal number of A ∪ B equals n of A plus n of B minus n of (A ∩ B). We subtract the intersection because those elements were counted twice.

Rearranging: n of (A ∩ B) equals n of A plus n of B minus n of (A ∪ B).

Let us apply this. If n of A equals 12, n of B equals 9, and n of (A ∩ B) equals 5, then n of (A ∪ B) equals 12 plus 9 minus 5, which equals 16.

Another example: if n of A equals 18, n of (A ∩ B) equals 6, and n of (A ∪ B) equals 26, we can find n of B. Using the formula: 26 equals 18 plus n(B) minus 6. Solving: n of B equals 26 minus 18 plus 6, which equals 14.

Let us recap the key takeaways from today's lesson.

First, a set is a well-defined collection of objects, with elements written in curly braces. We use ∈ for "belongs to" and ∉ for "does not belong to."

Second, sets can be represented in Roster Form by listing elements, or in Set-Builder Form by stating a rule.

Third, sets may be finite, infinite, singleton, or empty. They may be joint with common elements, or disjoint with none. Equivalent sets have equal size; equal sets have identical elements.

Fourth, a subset contains only elements from another set. A set with n elements has 2ⁿ subsets.

Fifth, the universal set ξ contains all elements under consideration, and the complement A ′ contains everything in the universal set except that set's elements.

Sixth, union combines all elements from two sets, intersection keeps only common elements, and difference removes elements of one set from another.

Finally, for cardinal numbers: n of (A ∪ B) equals n of A plus n of B minus n of (A ∩ B), and n of (A ∩ B) equals n of A plus n of B minus n of (A ∪ B).

That brings us to the end of our exploration of sets. I hope you now feel confident understanding and working with sets, their representations, types, and operations. Remember, mathematics builds layer upon layer — the logical thinking you have practiced today will serve you well in all your future studies. Keep questioning, keep exploring, and I look forward to our next mathematical journey together.