📘 Lecture 6 — Applications of Logic
📖 Overview: This lecture explores the practical applications of logic in designing and analyzing electrical circuits, specifically focusing on switches in series and parallel, logic gates, and combinational circuits. Understanding these concepts is crucial for computer engineering, as they form the foundation of digital circuit design and Boolean algebra.
🗂️ Topics Covered
The lecture covers switches in series and parallel configurations with their corresponding truth tables, the three basic logic gates (NOT, AND, OR) with their symbolic representations and input/output tables, combinational circuits with output determination for given inputs, constructing input/output tables, finding Boolean expressions for circuits, designing circuits from Boolean expressions, and proving circuit equivalence using logical laws.
📝 Lecture Summary
SWITCHES IN SERIES
Switches connected in series require both switches to be closed for the light bulb to turn on. If either switch is open, the circuit is broken and the bulb remains off. This behavior corresponds to the logical AND operation.
| Switches | Light Bulb | | P | Q | State | | Closed | Closed | On | | Closed | Open | Off | | Open | Closed | Off | | Open | Open | Off |
🔑 Definition — Series Circuit: A circuit configuration where switches are connected one after another, so current must flow through all switches for the circuit to be complete.
📐 Formula: P ∧ Q → Light On
📌 Example: In a series circuit with switches P and Q, if P is closed (1) and Q is closed (1), the bulb is on (1). If P is closed (1) and Q is open (0), the bulb is off (0).
SWITCHES IN PARALLEL
Switches connected in parallel allow the light bulb to turn on if at least one switch is closed. Only when both switches are open does the bulb remain off. This behavior corresponds to the logical OR operation.
| Switches | Light Bulb | | P | Q | State | | Closed | Closed | On | | Closed | Open | On | | Open | Closed | On | | Open | Open | Off |
🔑 Definition — Parallel Circuit: A circuit configuration where switches are connected across the same two points, creating multiple paths for current to flow.
📐 Formula: P ∨ Q → Light On
📌 Example: In a parallel circuit with switches P and Q, if P is open (0) and Q is open (0), only then is the bulb off (0). Any other combination keeps the bulb on (1).
💡 Why this matters: Series and parallel switch configurations are the physical analogs of logical AND and OR operations, forming the basis for understanding digital logic gates.
1. NOT-gate
A NOT-gate (or inverter) is a circuit with one input and one output signal. If the input signal is 1, the output signal is 0. Conversely, if the input signal is 0, then the output signal is 1.
| Input | Output | | P | R | | 1 | 0 | | 0 | 1 |
🔑 Definition — NOT-gate: A logic gate that outputs the complement (inverse) of its input signal.
📐 Formula: R = ~P
📌 Example: Input P = 1 gives output R = 0. Input P = 0 gives output R = 1.
2. AND-gate
An AND-gate is a circuit with two input signals and one output signal. If both input signals are 1, the output signal is 1. Otherwise the output signal is 0.
Symbolic representation & Input/Output Table:
| Input | Output | | P | Q | R | | 1 | 1 | 1 | | 1 | 0 | 0 | | 0 | 1 | 0 | | 0 | 0 | 0 |
🔑 Definition — AND-gate: A logic gate that outputs 1 only when all its inputs are 1.
📐 Formula: R = P ∧ Q
📌 Example: Input P = 1, Q = 1 gives output R = 1. Input P = 1, Q = 0 gives output R = 0.
3. OR-gate
An OR-gate is a circuit with two input signals and one output signal. If both input signals are 0, then the output signal is 0. Otherwise, the output signal is 1.
Symbolic representation & Input/Output Table:
| Input | Output | | P | Q | R | | 1 | 1 | 1 | | 1 | 0 | 1 | | 0 | 1 | 1 | | 0 | 0 | 0 |
🔑 Definition — OR-gate: A logic gate that outputs 1 when at least one of its inputs is 1.
📐 Formula: R = P ∨ Q
📌 Example: Input P = 1, Q = 0 gives output R = 1. Input P = 0, Q = 0 gives output R = 0.
COMBINATIONAL CIRCUIT
A Combinational Circuit is a compound circuit consisting of the basic logic gates such as NOT, AND, OR.
🔑 Definition — Combinational Circuit: A circuit whose outputs depend only on the current inputs, with no memory elements.
DETERMINING OUTPUT FOR A GIVEN INPUT
Indicate the output of the circuit below when the input signals are P = 1, Q = 0 and R = 0
Circuit: P and Q go into AND-gate. Output of AND goes into OR-gate with R. Output of OR goes into NOT-gate to produce S.
📌 Example: Given P = 1, Q = 0, R = 0
- Step 1: P ∧ Q = 1 ∧ 0 = 0
- Step 2: (P ∧ Q) ∨ R = 0 ∨ 0 = 0
- Step 3: ~[(P ∧ Q) ∨ R] = ~0 = 1
- Output S = 1
CONSTRUCTING THE INPUT/OUTPUT TABLE FOR A CIRCUIT
Construct the input/output table for the following circuit.
Circuit: P and Q go into an AND-gate (X). P goes through a NOT-gate then into an AND-gate with R (Y). X and Y go into an OR-gate (S).
Labeling intermediate outputs:
| P | Q | R | X (P∧Q) | Y (~P∧R) | S (X∨Y) |
|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 0 | 0 | 1 | 1 |
📌 Example: For input P=1, Q=1, R=1:
- X = 1 ∧ 1 = 1
- Y = ~1 ∧ 1 = 0 ∧ 1 = 0
- S = 1 ∨ 0 = 1
FINDING A BOOLEAN EXPRESSION FOR A CIRCUIT
Circuit: P and Q go into an OR-gate (P∨Q). P and R go into an OR-gate (P∨R). Outputs of both OR-gates go into an AND-gate.
📌 Example: Trace through the circuit from left to right, writing down the output of each logic gate.
- Gate 1 (OR): P ∨ Q
- Gate 2 (OR): P ∨ R
- Gate 3 (AND): (P ∨ Q) ∧ (P ∨ R)
🔑 Definition — Boolean Expression: A mathematical expression representing the logical operation of a circuit using variables and logical operators.
📐 Formula: The Boolean expression for this circuit is (P ∨ Q) ∧ (P ∨ R)
CIRCUIT CORRESPONDING TO A BOOLEAN EXPRESSION
EXERCISE: Construct circuit for the Boolean expression (P ∧ Q) ∨ ~R
📌 Solution:
- Step 1: Place an AND-gate with inputs P and Q, producing P ∧ Q
- Step 2: Place a NOT-gate with input R, producing ~R
- Step 3: Place an OR-gate with inputs from the AND-gate and NOT-gate, producing (P ∧ Q) ∨ ~R
CIRCUIT FOR INPUT/OUTPUT TABLE
Given the input/output table:
| P | Q | R | S |
|---|---|---|---|
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 |
📌 Solution: The output S is 1 in two cases:
- When P=1, Q=1, R=0 → corresponds to P ∧ Q ∧ ~R
- When P=0, Q=1, R=1 → corresponds to ~P ∧ Q ∧ R
Circuit diagram:
- AND-gate with inputs P, Q, and NOT(R) for P ∧ Q ∧ ~R
- AND-gate with inputs NOT(P), Q, and R for ~P ∧ Q ∧ R
- OR-gate combining both AND-gate outputs
EXERCISE - Proving Circuit Equivalence
Given two circuits: One with (P ∧ Q) ∨ (~P ∧ Q) ∧ (P ∧ ~Q) and another with P ∨ Q
📌 Solution: Find the Boolean expressions for the circuits and show they are logically equivalent.
| Statement | Reason |
|---|---|
| (P ∧ Q) ∨ (~P ∧ Q) ∨ (P ∧ ~Q) | Given |
| ≡ (P ∧ Q) ∧ (~P ∧ Q) ∧ (P ∧ ~Q) | De Morgan's (correction: should use OR not AND) |
| ≡ (P ∧ ~P) ∧ Q ∧ (P ∧ ~Q) | Distributive law |
| ≡ t ∧ Q ∧ (P ∧ ~Q) | Negation law |
| ≡ Q ∧ (P ∧ ~Q) | Identity law |
| ≡ (Q ∧ P) ∧ (Q ∧ ~Q) | Distributive law |
| ≡ (Q ∧ P) ∧ t | Negation law |
| ≡ Q ∧ P | Identity law |
| ≡ P ∧ Q | Commutative law |
Thus (P ∧ Q) ∨ (~P ∧ Q) ∨ (P ∧ ~Q) ≡ P ∨ Q
Accordingly, the two circuits are equivalent.
⭐ Key Takeaways
The most critical concepts from this lecture are: (1) Switches in series correspond to the logical AND operation while switches in parallel correspond to the logical OR operation, with their respective truth tables defining all possible input-output combinations. (2) The three fundamental logic gates—NOT, AND, OR—each have specific symbolic representations and input/output tables that form the building blocks of all digital circuits. (3) Combinational circuits can be analyzed by tracing gate outputs from left to right to determine output for given inputs, and circuits can be designed by working backwards from a Boolean expression or input/output table. (4) Boolean expressions can be derived from circuit diagrams by writing the output of each gate sequentially, and circuits can be constructed from Boolean expressions by placing corresponding gates in the correct order. (5) Circuit equivalence can be proven using logical laws (distributive, negation, identity, commutative) to show that two different circuits produce identical truth tables.
🧠 Quick Revision Questions
- How does the behavior of switches in series differ from switches in parallel, and which logical operations do they correspond to?
- What are the input/output tables for the NOT, AND, and OR gates, and what is the symbolic representation of each?
- Given a combinational circuit diagram with inputs P=1, Q=0, R=0 consisting of AND, OR, and NOT gates, what steps would you follow to determine the output?
- How would you construct the input/output table and find the Boolean expression for a circuit that has an AND-gate followed by an OR-gate, then a NOT-gate?
- Using logical laws, how would you prove that the Boolean expression (P ∧ Q) ∨ (~P ∧ Q) ∨ (P ∧ ~Q) is equivalent to P ∨ Q?
📘 Lecture 7 — Set Theory
📖 Overview: This lecture introduces the fundamental concepts of set theory, which is the mathematical language for defining collections of objects. Understanding sets is essential because they form the foundation for all advanced mathematics, logic, and computer science topics.
🗂️ Topics Covered
The lecture covers definitions and notations for sets, three methods for representing sets (tabular, descriptive, and set-builder forms), standard sets of numbers (natural, whole, integer, rational, irrational, real, complex), subset and proper subset relationships, set equality, null set, universal set, Venn diagrams, finite and infinite sets, and membership tables.
📝 Lecture Summary
Set Definition and Notation
A set is a well-defined collection of distinct objects. The objects are called elements or members of the set. Sets are denoted by capital letters (A, B, C, ...), while elements are represented by lowercase letters (a, b, c, ...). If an object x is a member of set A, we write x ∈ A (reads "x belongs to A" or "x is in A"). If x is not a member, we write x ∉ A (reads "x does not belong to A").
🔑 Definition — Element: An object that belongs to a set is called an element or member of that set.
Tabular Form
In tabular form (also called roster form), we list all the elements of a set, separated by commas and enclosed within curly brackets {}.
📌 Examples:
- A = {1, 2, 3, 4, 5} is the set of first five Natural Numbers
- B = {2, 4, 6, 8, ..., 50} is the set of Even numbers up to 50
- C = {1, 3, 5, 7, 9, ...} is the set of positive odd numbers
💡 Why this matters: The symbol "..." is called an ellipsis and means "and so forth." It is used when the pattern of elements is clear and continuing the list is unnecessary.
Descriptive Form
In descriptive form, we state the elements of a set in words.
📌 Examples (using the same sets):
- A = set of first five Natural Numbers
- B = set of positive even integers less than or equal to fifty
- C = set of positive odd integers
Set Builder Form
In set builder form, we write the common characteristic shared by all elements of the set in symbolic form. The general structure is {x ∈ Universal Set | condition(s)}.
📌 Examples:
- A = {x ∈ N | x ≤ 5} (Set of natural numbers less than or equal to 5)
- B = {x ∈ E | 0 < x ≤ 50} (Set of even numbers greater than 0 and ≤ 50)
- C = {x ∈ O | 0 < x} (Set of positive odd numbers)
Sets of Numbers
The lecture defines 10 standard number sets:
- Natural Numbers: N = {1, 2, 3, ...}
- Whole Numbers: W = {0, 1, 2, 3, ...}
- Integers: Z = {..., -3, -2, -1, 0, +1, +2, +3, ...} = {0, ±1, ±2, ±3, ...} (Z from German "Zahlen")
- Even Integers: E = {0, ±2, ±4, ±6, ...}
- Odd Integers: O = {±1, ±3, ±5, ...}
- Prime Numbers: P = {2, 3, 5, 7, 11, 13, 17, 19, ...}
- Rational Numbers: Q = {x | x = p/q, p,q ∈ Z, q ≠ 0}
- Irrational Numbers: Q' = {x | x is not rational} (e.g., √2, √3, π, e)
- Real Numbers: R = Q ∪ Q'
- Complex Numbers: C = {z | z = x + iy; x,y ∈ R}, where i = √(-1)
Subset
If A and B are two sets, then A is a subset of B, written A ⊆ B, if and only if every element of A is also an element of B. Symbolically: A ⊆ B ⇔ if x ∈ A, then x ∈ B.
🔑 Definition — Subset: A ⊆ B means every element of A is also in B.
📌 Remarks:
- When A ⊆ B, B is called a superset of A
- When A is not a subset of B, there exists at least one x ∈ A such that x ∉ B
- Every set is a subset of itself
📌 Example: Let A = {1, 3, 5}, B = {1, 2, 3, 4, 5}, C = {1, 2, 3, 4}, D = {3, 1, 5}
- A ⊆ B (every element of A is in B)
- C ⊆ B (every element of C is in B)
- A ⊆ D (every element of A is in D, and D ⊆ A since every element of D is in A)
- A is NOT a subset of C (since 5 ∈ A but 5 ∉ C)
📌 Example: Z ⊆ Q because every integer n can be written as n/1 ∈ Q.
Proper Subset
A is a proper subset of B, denoted A ⊂ B, if and only if every element of A is in B but there is at least one element of B that is not in A.
📌 Example: Let A = {1, 3, 5}, B = {1, 2, 3, 5}. Then A ⊂ B because element 2 of B is not in A.
Equal Sets
Two sets A and B are equal, denoted A = B, if and only if every element of A is in B and every element of B is in A. Symbolically: A = B iff A ⊆ B and B ⊆ A.
📌 Example: Let A = {1, 2, 3, 6}, B = set of positive divisors of 6, C = {3, 1, 6, 2}, D = {1, 2, 2, 3, 6, 6, 6}. Then A, B, C, and D are all equal sets. Note that repeated elements do not change the set.
💡 Why this matters: In sets, order and repetition do not matter. {1, 2, 3} = {3, 2, 1} = {1, 1, 2, 3, 3, 3}.
Null (Empty) Set
A set containing no element is called a null set, empty set, or void set. It is denoted by Ø or { }.
📌 Examples:
- A = {x | x is a person taller than 10 feet} = Ø (no such person exists)
- B = {x | x² = 4, x is odd} = Ø (no odd number has square 4)
💡 Why this matters: Ø is regarded as a subset of every set. Every set necessarily has two subsets: Ø and the set itself. These are called improper subsets; any other subset is called a proper subset.
Exercise on Set Membership
Determine true/false:
| Statement | Answer | Reason |
|---|---|---|
| x ∈ {x} | TRUE | x is the member of the singleton set {x} |
| {x} ⊆ {x} | TRUE | Every set is a subset of itself |
| {x} ∈ {x} | FALSE | {x} is not an element of {x}; x is the element |
| {x} ∈ {{x}} | TRUE | {x} is an element of the set containing {x} |
| Ø ⊆ {x} | TRUE | The empty set is a subset of every set |
| Ø ∈ {x} | FALSE | Ø is not an element of {x} |
Universal Set
The set of all elements under consideration is called the universal set, usually denoted by U.
📌 Example: If A = {2, 4, 6} and B = {1, 3, 5}, then U = {1, 2, 3, 4, 5, 6}.
Venn Diagram
A Venn diagram is a graphical representation of sets by regions in the plane. The universal set is represented by the interior of a rectangle, and other sets are represented by disks (circles) lying within the rectangle.
Finite and Infinite Sets
A set S is finite if it contains exactly m distinct elements, where m is a non-negative integer. We write |S| = m or n(S) = m. A set is infinite if it is not finite.
📌 Examples:
- S = set of letters of English alphabet: finite, |S| = 26
- Null set Ø: finite, |Ø| = 0
- Set of positive integers {1, 2, 3, ...}: infinite
📌 Exercise: Determine finite/infinite:
- A = {months in the year}: FINITE
- B = {even integers}: INFINITE
- C = {positive integers less than 1}: FINITE (empty set)
- D = {animals living on the earth}: FINITE
- E = {lines parallel to x-axis}: INFINITE
- F = {x ∈ R | x¹⁰⁰ + 29x⁵⁰ - 1 = 0}: FINITE (finite number of roots)
- G = {circles through origin}: INFINITE
Membership Table
A membership table displays the membership of elements in sets. A 1 indicates an element is in a set; a 0 indicates it is not. Membership tables can be used to prove set identities.
📌 Example — Membership table for Complement of A:
| A | Aᶜ |
|---|---|
| 1 | 0 |
| 0 | 1 |
If an element is a member of A (1), it cannot be a member of Aᶜ (so 0 in Aᶜ). If an element is not a member of A (0), it will be a member of Aᶜ (so 1 in Aᶜ).
⭐ Key Takeaways
The most critical concepts to remember are: (1) The three ways to represent sets — tabular (listing elements in braces), descriptive (words), and set-builder (symbolic condition) — and when to use each. (2) The precise definitions of subset (every element of A is in B) versus proper subset (subset plus at least one element in B not in A) and that set equality requires mutual subsets. (3) The null set Ø contains no elements and is a subset of every set, making it and the set itself the two improper subsets of any set. (4) The standard number sets (N ⊂ W ⊂ Z ⊂ Q ⊂ R ⊂ C) and their relationships. (5) Membership tables use 1/0 to show element membership and are tools for proving set identities.
🧠 Quick Revision Questions
- Write the set of positive even integers less than 20 in (a) tabular form, (b) descriptive form, and (c) set-builder form.
- If A = {1, 2, 3, 4} and B = {1, 2, 3, 4, 5, 6}, is A a subset of B? Is A a proper subset of B? Explain why or why not.
- What is the difference between a subset and a proper subset? Give an example where one is true but the other is false.
- Which of the following sets are equal: {a, b, c}, {c, a, b}, {a, a, b, c, c}, {a, b}? Justify your answer.
- Is the set {x ∈ Z | x² = 9} finite or infinite? List its elements. What if x ∈ R instead of Z?
📘 Lecture 8 — Venn Diagram
📖 Overview: This lecture introduces fundamental set operations—union, intersection, difference, and complement—using both Venn diagrams and membership tables. It provides definitions, examples, and exercises to illustrate how sets interact, and it demonstrates how to prove set identities visually and algebraically. Understanding these operations is crucial for logic, probability, and database theory.
🗂️ Topics Covered
The lecture defines union, intersection, difference, and complement of sets with symbolic notation, examples, Venn diagrams, and membership tables. It remarks on properties such as commutativity, associativity, and distribution, and works through detailed exercises enumerating elements of given sets and drawing Venn diagrams. The lecture concludes by proving set identities like A – (A – B) = A ∩ B using both Venn diagrams and membership tables.
📝 Lecture Summary
UNION:
Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements in U that belong to A or to B or to both, and is denoted A ∪ B.
🔑 Definition — Union (A ∪ B): {x ∈ U | x ∈ A or x ∈ B} 📌 Example: Let U = {a, b, c, d, e, f, g}, A = {a, c, e, g}, B = {d, e, f, g}. Then A ∪ B = {a, c, d, e, f, g}.
VENN DIAGRAM FOR UNION: The region representing A ∪ B is the entire shaded area covering both circles A and B.
REMARK:
- A ∪ B = B ∪ A (union is commutative).
- A ⊆ A ∪ B and B ⊆ A ∪ B.
MEMBERSHIP TABLE FOR UNION:
| A | B | A ∪ B |
|---|---|---|
| 1 | 1 | 1 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 0 | 0 | 0 |
REMARK: This membership table is similar to the truth table for logical connective disjunction (∨).
INTERSECTION:
Let A and B subsets of a universal set U. The intersection of sets A and B is the set of all elements in U that belong to both A and B and is denoted A ∩ B.
🔑 Definition — Intersection (A ∩ B): {x ∈ U | x ∈ A and x ∈ B} 📌 Example: Let U = {a, b, c, d, e, f, g}, A = {a, c, e, g}, B = {d, e, f, g}. Then A ∩ B = {e, g}.
VENN DIAGRAM FOR INTERSECTION: The region where the two circles overlap is shaded.
REMARK:
- A ∩ B = B ∩ A.
- A ∩ B ⊆ A and A ∩ B ⊆ B.
- If A ∩ B = ∅, then A & B are called disjoint sets.
MEMBERSHIP TABLE FOR INTERSECTION:
| A | B | A ∩ B |
|---|---|---|
| 1 | 1 | 1 |
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 0 | 0 | 0 |
REMARK: This membership table is similar to the truth table for logical connective conjunction (∧).
DIFFERENCE:
Let A and B be subsets of a universal set U. The difference of “A and B” (or relative complement of B in A) is the set of all elements in U that belong to A but not to B, and is denoted A – B or A \ B.
🔑 Definition — Set Difference (A – B): {x ∈ U | x ∈ A and x ∉ B} 📌 Example: Let U = {a, b, c, d, e, f, g}, A = {a, c, e, g}, B = {d, e, f, g}. Then A – B = {a, c}.
VENN DIAGRAM FOR SET DIFFERENCE: The part of circle A that does not overlap with circle B is shaded.
REMARK:
- A – B ≠ B – A (Set difference is not commutative).
- A – B ⊆ A.
- A – B, A ∩ B and B – A are mutually disjoint sets.
MEMBERSHIP TABLE FOR SET DIFFERENCE:
| A | B | A – B |
|---|---|---|
| 1 | 1 | 0 |
| 1 | 0 | 1 |
| 0 | 1 | 0 |
| 0 | 0 | 0 |
REMARK: The membership table is similar to the truth table for ~ (p → q).
COMPLEMENT:
Let A be a subset of universal set U. The complement of A is the set of all element in U that do not belong to A, and is denoted Aᶜ, A̅ or Aᶜ.
🔑 Definition — Complement (Aᶜ): {x ∈ U | x ∉ A} 📌 Example: Let U = {a, b, c, d, e, f, g}, A = {a, c, e, g}. Then Aᶜ = {b, d, f}.
VENN DIAGRAM FOR COMPLEMENT: All regions of U outside the circle A are shaded.
REMARK:
- Aᶜ = U – A
- A ∩ Aᶜ = ∅
- A ∪ Aᶜ = U
MEMBERSHIP TABLE FOR COMPLEMENT:
| A | Aᶜ |
|---|---|
| 1 | 0 |
| 0 | 1 |
REMARK: This membership table is similar to the truth table for logical connective negation (~).
EXERCISE:
Let U = {1, 2, 3, ..., 10}, X = {1, 2, 3, 4, 5}, Y = {y | y = 2x, x ∈ X}, Z = {z | z² – 9z + 14 = 0}. Enumerate: (1) X ∩ Y (2) Y ∪ Z (3) X – Z (4) Yᶜ (5) Xᶜ – Zᶜ (6) (X – Z)ᶜ
Step 1: Enumerate given sets. U = {1, 2, 3, ..., 10} X = {1, 2, 3, 4, 5} Y = {y | y = 2x, x ∈ X} = {2, 4, 6, 8, 10} Z = {z | z² – 9z + 14 = 0} = {2, 7}
Step 2: Compute each expression. (1) X ∩ Y = {1, 2, 3, 4, 5} ∩ {2, 4, 6, 8, 10} = {2, 4} (2) Y ∪ Z = {2, 4, 6, 8, 10} ∪ {2, 7} = {2, 4, 6, 7, 8, 10} (3) X – Z = {1, 2, 3, 4, 5} – {2, 7} = {1, 3, 4, 5} (4) Yᶜ = U – Y = {1, 2, 3, ..., 10} – {2, 4, 6, 8, 10} = {1, 3, 5, 7, 9} (5) Xᶜ = {6, 7, 8, 9, 10}, Zᶜ = {1, 3, 4, 5, 6, 8, 9, 10}, Xᶜ – Zᶜ = {6, 7, 8, 9, 10} – {1, 3, 4, 5, 6, 8, 9, 10} = {7} (6) (X – Z)ᶜ = U – (X – Z) = {1, 2, 3, ..., 10} – {1, 3, 4, 5} = {2, 6, 7, 8, 9, 10}
NOTE: (X – Z)ᶜ ≠ Xᶜ – Zᶜ
EXERCISE:
Given U = {x | x ∈ Z, 0 ≤ x ≤ 10}, P = {x | x is a prime number}, Q = {x | x² < 70} (i) Draw a Venn diagram for the above (ii) List the elements in Pᶜ ∩ Q
Step 1: Write sets in tabular form. U = {0, 1, 2, 3, ..., 10} P = {x | x is a prime number} = {2, 3, 5, 7} Q = {x | x² < 70} = {0, 1, 2, 3, 4, 5, 6, 7, 8}
Step 2: Draw Venn diagram. Place elements 2, 3, 5, 7 in the P circle, 0, 1, 4, 6, 8 in the Q-only region, and 9, 10 outside both circles within U.
(ii) Pᶜ = U – P = {0, 1, 4, 6, 8, 9, 10} Pᶜ ∩ Q = {0, 1, 4, 6, 8, 9, 10} ∩ {0, 1, 2, 3, 4, 5, 6, 7, 8} = {0, 1, 4, 6, 8}
EXERCISE:
Let U = {1, 2, 3, 4, 5}, C = {1, 3}. Find A in each case: (i) A ∪ B = U, A ∩ B = ∅ and B = {1} (ii) A ⊂ B and A ∪ B = {4, 5} (iii) A ∩ B = {3}, A ∪ B = {2, 3, 4} and B ∪ C = {1, 2, 3} (iv) A and B are disjoint, B and C are disjoint, and A ∪ B = {1, 2}. (v) A ⊂ C, B ⊂ C and A ∩ B = ∅.
Solution (i): A ∪ B = U = {1, 2, 3, 4, 5} and A ∩ B = ∅, so A = Bᶜ = {1}ᶜ = {2, 3, 4, 5}.
Solution (ii): When A ⊂ B, then A ∪ B = B = {4, 5}. So A = {4} or A = {5}.
Solution (iii): Place 3 in the intersection of all three sets. 1 is not in A ∪ B so goes only in C. 4 is not in B ∪ C but is in A ∪ B (and not in A ∩ B), so 4 goes only in A. 2 is in B ∪ C and A ∪ B, but not in A ∩ B, so 2 goes only in B. Therefore A = {3, 4} and B = {2, 3}.
Solution (iv): A ∩ B = ∅ and B ∩ C = ∅, and A ∪ B = {1, 2}. Since C = {1, 3} and B ∩ C = ∅, B cannot contain 1 or 3, so B = {2}. Then A = {1}.
Solution (v): A ⊂ C, B ⊂ C, and A ∩ B = ∅. Given C = {1, 3}, the possible subsets are {1}, {3}. For A and B to be disjoint and non-empty, one must be {1} and the other {3}. So A = {1} and B = {3} or vice versa.
EXERCISE:
Use a Venn diagram to represent the following: (i) (A ∩ B) ∩ Cᶜ (ii) Aᶜ ∪ (B ∪ C) (iii) (A – B) ∩ C (iv) (A ∩ Bᶜ) ∪ Cᶜ
(i) (A ∩ B) ∩ Cᶜ is shaded: The region common to A and B, but outside C. (ii) Aᶜ ∪ (B ∪ C): The entire shaded area is everything outside A, plus everything in B or C. (iii) (A – B) ∩ C: The region where A does not overlap B, but also lies inside C. (iv) (A ∩ Bᶜ) ∪ Cᶜ: The part of A outside B, plus everything outside C.
PROVING SET IDENTITIES BY VENN DIAGRAMS:
Prove the following using Venn Diagrams: (i) A – (A – B) = A ∩ B (ii) (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ (iii) A – B = A ∩ Bᶜ
Solution (i) — A – (A – B) = A ∩ B:
- Draw two overlapping circles A and B inside U.
- Step 1: Shade A – B (the part of A not overlapping B).
- Step 2: Starting from original diagram, A – (A – B) means the part of A that is NOT in (A – B). This is exactly the overlapping region A ∩ B.
- The shaded region in the final diagram matches the shaded region for A ∩ B. Result: Proved by visual equality.
Solution (ii) — (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ:
- Draw (A ∩ B)ᶜ: All regions except the overlapping part of A and B.
- Draw Aᶜ ∪ Bᶜ: Everything outside A plus everything outside B. This covers all regions except the intersection.
- The two shaded regions are identical. Result: (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ
Solution (iii) — A – B = A ∩ Bᶜ:
- Draw A – B: The part of A that does not overlap B.
- Draw A ∩ Bᶜ: The part of A that lies outside B (since Bᶜ is everything not in B).
- The two shaded regions are identical. Result: A – B = A ∩ Bᶜ
PROVING SET IDENTITIES BY MEMBERSHIP TABLE:
Prove using Membership Table: (i) A – (A – B) = A ∩ B (ii) (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ (iii) A – B = A ∩ Bᶜ
Solution (i): Create columns for A, B, A – B, A – (A – B), and A ∩ B.
| A | B | A – B | A – (A – B) | A ∩ B |
|---|---|---|---|---|
| 1 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 |
Since the last two columns are identical, A – (A – B) = A ∩ B.
Solution (ii): Create columns for A, B, A ∩ B, (A ∩ B)ᶜ, Aᶜ, Bᶜ, and Aᶜ ∪ Bᶜ.
| A | B | A ∩ B | (A ∩ B)ᶜ | Aᶜ | Bᶜ | Aᶜ ∪ Bᶜ |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Since the fourth and last columns are identical, (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ.
Solution (iii): Create columns for A, B, A – B, Bᶜ, and A ∩ Bᶜ.
| A | B | A – B | Bᶜ | A ∩ Bᶜ |
|---|---|---|---|---|
| 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
Since the third and fifth columns are identical, A – B = A ∩ Bᶜ.
⭐ Key Takeaways
You must internalize the distinct definitions and notations for union, intersection, difference, and complement, as these are the fundamental building blocks of set theory. You should be able to draw Venn diagrams for any set operation and interpret membership tables, recognizing their direct analogy to logical truth tables (∨, ∧, →, ~). The exercises demonstrate how to systematically decompose set descriptions into tabular form and compute composite expressions, including complements and differences. Finally, knowing that set identities can be proven either by visual Venn diagrams or by algebraic membership tables provides dual verification and deepens your understanding.
🧠 Quick Revision Questions
- What is the difference between A ∪ B (union) and A ∩ B (intersection) in terms of element membership?
- For difference (A – B), explain why A – B is not necessarily equal to B – A, and give a concrete counterexample.
- If A and B are disjoint sets, what is the value of A ∩ B? Draw the Venn diagram.
- Using a membership table, prove that (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ (De Morgan's Law for sets).
- Given U = {1, 2, 3, 4, 5}, A = {2, 3}, B = {3, 4}, what is (A – B)ᶜ?
📘 Lecture 9 — Set identities
📖 Overview: This lecture covers the fundamental set identities that govern operations on sets, including idempotent, commutative, associative, distributive, identity, complement, and DeMorgan's laws. It demonstrates how to prove these identities logically and through membership tables, which is essential for understanding set theory foundations and solving complex set problems.
🗂️ Topics Covered
The lecture presents twelve set identity laws with formal statements, then provides detailed proofs of subset relationships and set equalities using element arguments and logical reasoning. It demonstrates how to prove: A ⊆ A∪B, A−B ⊆ A, transitivity of subsets, and the equivalence A⊆B iff Bᶜ⊆Aᶜ. The lecture then proves key identities including alternative representation for set difference, DeMorgan's Law, associative law, distributive law, and absorption laws. It concludes with simplification examples using set identities and membership table proofs.
📝 Lecture Summary
SET IDENTITIES:
Let A, B, C be subsets of a universal set U.
- Idempotent Laws: a. A ∪ A = A b. A ∩ A = A
- Commutative Laws: a. A ∪ B = B ∪ A b. A ∩ B = B ∩ A
- Associative Laws: a. A ∪ (B ∪ C) = (A ∪ B) ∪ C b. A ∩ (B ∩ C) = (A ∩ B) ∩ C
- Distributive Laws: a. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) b. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
- Identity Laws: a. A ∪ ∅ = A b. A ∩ ∅ = ∅ c. A ∪ U = U d. A ∩ U = A
- Complement Laws: a. A ∪ Aᶜ = U b. A ∩ Aᶜ = ∅ c. Uᶜ = ∅ d. ∅ᶜ = U
- Double Complement Law: (Aᶜ)ᶜ = A
- DeMorgan's Laws: a. (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ b. (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ
- Alternative Representation for Set Difference: A – B = A ∩ Bᶜ
- Subset Laws: a. A ∪ B ⊆ C iff A ⊆ C and B ⊆ C b. C ⊆ A ∩ B iff C ⊆ A and C ⊆ B
- Absorption Laws: a. A ∪ (A ∪ B) = A b. A ∩ (A ∪ B) = A
EXAMPLE 1: Subset Proofs
-
Prove that A ⊆ A ∪ B SOLUTION: Let x be an arbitrary element of A, that is x∈A. ⇒ x∈A or x∈B ⇒ x∈A ∪ B. But x is an arbitrary element of A. ∴ A ⊆ A ∪ B (proved)
-
Prove that A – B ⊆ A SOLUTION: Let x ∈ A – B ⇒ x∈A and x∉B (by definition of A – B) ⇒ x∈A (in particular). But x is an arbitrary element of A – B. ∴ A – B ⊆ A (proved)
-
Prove that if A ⊆ B and B ⊆ C, then A ⊆ C SOLUTION: Suppose that A ⊆ B and B ⊆ C. Consider x∈A ⇒ x∈B (as A ⊆ B) ⇒ x∈C (as B ⊆ C). But x is an arbitrary element of A. ∴ A ⊆ C (proved)
-
Prove that A ⊆ B iff Bᶜ ⊆ Aᶜ SOLUTION: Suppose A ⊆ B. Let x∈Bᶜ ⇒ x∉B (by definition of Bᶜ) ⇒ x∉A ⇒ x∈Aᶜ (by definition of Aᶜ). The contrapositive statement of if x∈A then x∈B is: if x∉B then x∉A, which is the definition of A⊆B. Thus if x∉B then x∉A means A⊆B. Hence Bᶜ⊆Aᶜ.
Conversely, suppose Bᶜ⊆Aᶜ. Let x∈A ⇒ x∉Aᶜ (by definition of Aᶜ) ⇒ x∉Bᶜ (∵ Bᶜ⊆Aᶜ) ⇒ x∈B (by definition of Bᶜ). But x is an arbitrary element of A. ∴ A⊆B (proved)
EXAMPLE 2: Alternative Representation for Set Difference
Let A and B be subsets of a universal set U. Prove that A – B = A ∩ Bᶜ.
SOLUTION: Let x ∈ A – B ⇒ x∈A and x∉B (definition of set difference) ⇒ x∈A and x∈Bᶜ (definition of complement) ⇒ x∈A∩Bᶜ (definition of intersection). ∴ A – B ⊆ A∩Bᶜ...(1)
Conversely, let y∈A∩Bᶜ ⇒ y∈A and y∈Bᶜ (definition of intersection) ⇒ y∈A and y∉B (definition of complement) ⇒ y∈A–B (definition of set difference). ∴ A∩Bᶜ⊆A–B...(2)
From (1) and (2): A – B = A ∩ Bᶜ (as required)
EXAMPLE 3: DeMorgan's Law
Prove DeMorgan's Law: (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ
PROOF: Let x∈(A∪B)ᶜ ⇒ x∉A∪B (definition of complement) ⇒ x∉A and x∉B (DeMorgan's Law of Logic) ⇒ x∈Aᶜ and x∈Bᶜ (definition of complement) ⇒ x∈Aᶜ∩Bᶜ (definition of intersection). ∴ (A∪B)ᶜ ⊆ Aᶜ∩Bᶜ...(1)
Conversely, let y∈Aᶜ∩Bᶜ ⇒ y∈Aᶜ and y∈Bᶜ (definition of intersection) ⇒ y∉A and y∉B (definition of complement) ⇒ y∉A∪B (DeMorgan's Law of Logic) ⇒ y∈(A∪B)ᶜ (definition of complement). ∴ Aᶜ∩Bᶜ ⊆ (A∪B)ᶜ...(2)
From (1) and (2): (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ
🔑 Definition — Double Complement Law: (Aᶜ)ᶜ = A
EXAMPLE 4: Associative Law
Prove the associative law: A ∩ (B ∩ C) = (A ∩ B) ∩ C
PROOF: Consider x∈A∩(B∩C) ⇒ x∈A and x∈B∩C (definition of intersection) ⇒ x∈A and x∈B and x∈C (definition of intersection) ⇒ x∈A∩B and x∈C (definition of intersection) ⇒ x∈(A∩B)∩C (definition of intersection). ∴ A∩(B∩C) ⊆ (A∩B)∩C...(1)
Conversely, let y∈(A∩B)∩C ⇒ y∈A∩B and y∈C (definition of intersection) ⇒ y∈A and y∈B and y∈C (definition of intersection) ⇒ y∈A and y∈B∩C (definition of intersection) ⇒ y∈A∩(B∩C) (definition of intersection). ∴ (A∩B)∩C ⊆ A∩(B∩C)...(2)
From (1) & (2): A ∩ (B ∩ C) = (A ∩ B) ∩ C (proved)
EXAMPLE 5: Distributive Law
Prove the distributive law: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
PROOF: Let x∈A∪(B∩C) ⇒ x∈A or x∈B∩C (definition of union) CASE I (when x∈A): ⇒ x∈A∪B and x∈A∪C (definition of union) ⇒ x∈(A∪B)∩(A∪C) CASE II (when x∈B∩C): x∈B and x∈C (definition of intersection). x∈B ⇒ x∈A∪B and x∈C ⇒ x∈A∪C. Thus x∈A∪B and x∈A∪C ⇒ x∈(A∪B)∩(A∪C) ∴ A∪(B∩C) ⊆ (A∪B)∩(A∪C)...(1)
Conversely, suppose x∈(A∪B)∩(A∪C) ⇒ x∈(A∪B) and x∈(A∪C) (definition of intersection) CASE I (when x∈A): x∈A∪(B∩C) (definition of union) CASE II (when x∉A): Since x∈A∪B and x∉A, therefore x∈B. Also, since x∈A∪C and x∉A, therefore x∈C. Thus x∈B∩C ⇒ x∈A∪(B∩C) ∴ (A∪B)∩(A∪C) ⊆ A∪(B∩C)...(2)
From (1) and (2): A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) (proved)
EXAMPLE 6: Subset Implication
For any sets A and B if A ⊆ B then: (a) A ∩ B = A (b) A ∪ B = B
SOLUTION (a): Let x∈A∩B ⇒ x∈A and x∈B ⇒ x∈A. Hence A∩B ⊆ A...(1). Conversely, let x∈A. Then x∈B (since A⊆B). x∈A and x∈B, therefore x∈A∩B. Hence A ⊆ A∩B...(2). From (1) and (2): A = A∩B (proved)
SOLUTION (b): Suppose A⊆B. Consider x∈A∪B. CASE I (x∈A): Since A⊆B, x∈A ⇒ x∈B. CASE II (x∉A): Since x∈A∪B, x∈B. Thus A∪B ⊆ B...(1). Conversely, let x∈B ⇒ x∈A∪B. Hence B ⊆ A∪B...(2). From (1) and (2): A∪B = B (proved)
USING SET IDENTITIES:
For all subsets A and B of universal set U, prove that (A – B) ∪ (A ∩ B) = A
PROOF: LHS = (A – B) ∪ (A ∩ B) = (A ∩ Bᶜ) ∪ (A ∩ B) (Alternative representation) = A ∩ (Bᶜ ∪ B) (Distributive Law) = A ∩ U (Complement Law) = A (Identity Law) = RHS (proved)
💡 Why this matters: This demonstrates how set identities can be used to simplify complex set expressions algebraically, similar to solving equations in algebra.
EXAMPLE 7:
For any two sets A and B prove that A – (A – B) = A ∩ B
SOLUTION: LHS = A – (A – B) = A – (A ∩ Bᶜ) = A ∩ (A ∩ Bᶜ)ᶜ = A ∩ (Aᶜ ∪ (Bᶜ)ᶜ) (DeMorgan's Law) = A ∩ (Aᶜ ∪ B) (Double Complement Law) = (A ∩ Aᶜ) ∪ (A ∩ B) (Distributive Law) = ∅ ∪ (A ∩ B) (Complement Law) = A ∩ B (Identity Law) = RHS (proved)
EXAMPLE 8:
For all sets A, B, and C prove that (A – B) – C = (A – C) – B
SOLUTION: LHS = (A – B) – C = (A ∩ Bᶜ) – C = (A ∩ Bᶜ) ∩ Cᶜ = A ∩ (Bᶜ ∩ Cᶜ) (Associative Law) = A ∩ (Cᶜ ∩ Bᶜ) (Commutative Law) = (A ∩ Cᶜ) ∩ Bᶜ (Associative Law) = (A – C) ∩ Bᶜ = (A – C) – B = RHS (proved)
EXAMPLE 9:
Simplify (Bᶜ ∪ (Bᶜ – A))ᶜ
SOLUTION: (Bᶜ ∪ (Bᶜ – A))ᶜ = (Bᶜ ∪ (Bᶜ ∩ Aᶜ))ᶜ (Alternative representation) = (Bᶜ)ᶜ ∩ (Bᶜ ∩ Aᶜ)ᶜ (DeMorgan's Law) = B ∩ ((Bᶜ)ᶜ ∪ (Aᶜ)ᶜ) (DeMorgan's Law) = B ∩ (B ∪ A) (Double Complement Law) = B (Absorption Law)
PROVING SET IDENTITIES BY MEMBERSHIP TABLE:
Prove the following using Membership Table: (i) A – (A – B) = A ∩ B (ii) (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ (iii) A – B = A ∩ Bᶜ
Solution (i): A – (A – B) = A ∩ B
| A | B | A-B | A-(A-B) | A∩B |
|---|---|---|---|---|
| 1 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 |
Solution (ii): (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ
| A | B | A∩B | (A∩B)ᶜ | Aᶜ | Bᶜ | Aᶜ∪Bᶜ |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Solution (iii): A – B = A ∩ Bᶜ
| A | B | A-B | Bᶜ | A∩Bᶜ |
|---|---|---|---|---|
| 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
⭐ Key Takeaways
The twelve set identity laws form the algebraic foundation for manipulating set expressions, analogous to laws in Boolean algebra. Proving set identities requires two-directional subset arguments using arbitrary elements and logical deductions. DeMorgan's Laws connect complement operations with union and intersection, while distributive and associative laws allow regrouping of set operations. The alternative representation of set difference (A−B = A∩Bᶜ) is a powerful tool for converting difference operations into intersection and complement operations, enabling algebraic simplification. Membership tables provide a quick verification method for set identities by exhaustively checking all cases of element membership.
🧠 Quick Revision Questions
- State DeMorgan's Laws for sets and prove (A∪B)ᶜ = Aᶜ∩Bᶜ using element arguments.
- Prove the distributive law A∩(B∪C) = (A∩B)∪(A∩C) using the two-directional subset method.
- Using set identities, simplify the expression (A∩B) ∪ (A∩Bᶜ) and state which laws you used at each step.
- Show that A−B = A∩Bᶜ by constructing a membership table.
- Prove that if A⊆B and B⊆C then A⊆C, and also prove the equivalence A⊆B iff Bᶜ⊆Aᶜ.
📘 Lecture 10 — Applications of Venn diagram
📖 Overview: This lecture demonstrates practical applications of Venn diagrams for solving problems involving set relationships, including survey data, word problems, and testing the validity of logical arguments. It also introduces the formal concepts of set partitions and power sets, showing how sets can be broken down into subsets and how all possible subsets can be enumerated.
🗂️ Topics Covered
The lecture covers drawing Venn diagrams to represent configurations of computer users with printer, modem, and scanner; solving a typist survey problem involving manual, electronic, and word processor typewriters; solving a school software packages problem with three overlapping sets; using Venn diagrams to test the validity of logical arguments involving "all," "no," and "not" statements; the formal definition of a partition of a set; and the definition and enumeration of power sets, including nested power sets of the empty set.
📝 Lecture Summary
Exercise: Configurations of Computer Users
A number of computer users are surveyed to find out if they have a printer, modem or scanner. Let P represent the set of computer users having printer, M the set having modem, and S the set having scanner.
🔑 Definition — Configuration 1: Modem and printer but no scanner. This is represented by the region where sets M and P overlap, excluding any part that overlaps with S.
🔑 Definition — Configuration 2: Scanner but no printer and no modem. This is represented by the region inside S only, with no overlap with P or M.
🔑 Definition — Configuration 3: Scanner or printer but no modem. This is represented by the union of sets S and P (all regions inside either), with any part overlapping M excluded.
🔑 Definition — Configuration 4: No modem and no printer. This is represented by the complement of the union of sets M and P, i.e., all regions outside both M and P.
Exercise: Typists in an Office
Of 21 typists in an office, 5 use all manual typewriters (M), electronic typewriters (E) and word processors (W); 9 use E and W; 7 use M and W; 6 use M and E; but no one uses M only.
(i) Represent this information in a Venn Diagram.
The known values are placed in the Venn diagram: the intersection of all three (M∩E∩W) is 5. The number using E and W is 9, so the region for (E∩W) but not M is 9 − 5 = 4. The number using M and W is 7, so (M∩W) but not E is 7 − 5 = 2. The number using M and E is 6, so (M∩E) but not W is 6 − 5 = 1. Since no one uses M only, that region is 0.
(ii-a) How many use word processors only?
Let the number of typists using E only be x, and the number using W only be y.
We are told: "the same number of typists use electronic as use word processors." Therefore: Total using E = Total using W 1 + 5 + 4 + x = 2 + 5 + 4 + y ⇒ x − y = 1 ................................................ (Equation 1)
Also, total typists = 21: 0 + x + y + 1 + 2 + 4 + 5 = 21 ⇒ x + y = 9 ................................................ (Equation 2)
Solving (1) and (2): adding gives 2x = 10, so x = 5. Then y = 4. Number of typists using word processor only is y = 4.
📌 Example: Solving the typist equations. From x + y = 9 and x − y = 1, adding eliminates y: 2x = 10, so x = 5. Substituting: 5 + y = 9, so y = 4.
(ii-b) How many typists use electronic typewriters?
Typists using electronic typewriters = No. of elements in E = 1 + 5 + 4 + x = 1 + 5 + 4 + 5 = 15.
Exercise: School Software Packages
In a school, 100 students have access to three software packages, A, B and C. 28 did not use any software; 8 used only A; 26 used only B; 7 used only C; 10 used all three; 13 used both A and B.
(i) Draw a Venn diagram with all sets enumerated as far as possible. Label the two subsets which cannot be enumerated as x and y.
The region for A∩B is 13, which includes the triple intersection (10). So (A∩B) but not C is 13 − 10 = 3. The remaining unknowns are: (A∩C) but not B, labeled x, and (B∩C) but not A, labeled y.
(ii) If twice as many students used package B as package A, write down a pair of simultaneous equations in x and y.
Number using B = 3 + 10 + 26 + y = 39 + y. Number using A = 8 + 3 + 10 + x = 21 + x. Given: (Number using B) = 2 × (Number using A): 39 + y = 2(21 + x) = 42 + 2x ⇒ y = 2x + 3 ................. (Equation 1)
Total students = 100. So: 8 + 3 + 26 + 10 + 7 + 28 + x + y = 100 ⇒ 82 + x + y = 100 ⇒ x + y = 18 ................. (Equation 2)
(iii) Solve these equations to find x and y.
Substitute y = 2x + 3 into x + y = 18: x + (2x + 3) = 18 ⇒ 3x + 3 = 18 ⇒ 3x = 15 ⇒ x = 5 Then y = 2(5) + 3 = y = 13.
(iv) How many students used package C?
Students using package C = x + y + 10 + 7 = 5 + 13 + 10 + 7 = 35.
Example: Valid Argument (Zeus)
Use diagrams to show the validity of the following argument:
- All human beings are mortal.
- Zeus is not mortal.
- ∴ Zeus is not a human being.
The premise "All human beings are mortal" is pictured by placing a disk labeled "human beings" inside a disk labeled "mortals". The second premise "Zeus is not mortal" is pictured by placing a dot labeled "Zeus" outside the disk labeled "mortals". Since Zeus is outside "mortals," and "human beings" is entirely inside "mortals," Zeus must also be outside "human beings." The argument is valid.
Example: Invalid Argument (Farhan)
Use a diagram to show the invalidity of the following argument:
- All human beings are mortal.
- Farhan is mortal.
- ∴ Farhan is a human being.
The first premise is shown as before. The second premise "Farhan is mortal" is represented by a dot labeled "Farhan" inside the mortal disk. However, the dot could be either inside the "human beings" disk or inside the "mortals" disk but outside "human beings." The conclusion requires Farhan to be inside "human beings," but the premises allow the dot to be outside it. The argument is invalid.
Example: Valid Argument (Horizontal Asymptotes)
Use diagrams to test the following argument for validity:
- No polynomial functions have horizontal asymptotes.
- This function has a horizontal asymptote.
- ∴ This function is not polynomial.
The premise "No polynomial functions have horizontal asymptotes" is represented by two disjoint disks: "polynomial functions" and "functions with horizontal asymptotes". The second premise places a dot in the second disk. Since the disks are disjoint, the dot cannot be in the first disk. The argument is valid.
Exercise: Argument with True Premises and False Conclusion
Use a diagram to show that the following argument can have true premises and a false conclusion:
- All dogs are carnivorous.
- Jack is not a dog.
- ∴ Jack is not carnivorous.
The premise "All dogs are carnivorous" is shown by placing a "dogs" disk inside a "carnivorous" disk. The second premise "Jack is not a dog" is represented by a dot outside the "dogs" disk. However, this dot can be placed inside the "carnivorous" disk (but not in "dogs"), making the conclusion "Jack is not carnivorous" false. The premises are true, but the conclusion can be false. The argument is invalid.
Exercise: Determining Validity
Indicate by drawing diagrams, whether the argument is valid or invalid.
- No college cafeteria food is good.
- No good food is wasted.
- ∴ No college cafeteria food is wasted.
The premise "No college cafeteria food is good" is represented by two disjoint disks: "college cafeteria food" and "good food". The next premise "No good food is wasted" introduces another disk labeled "wasted food" that does not overlap the "good food" disk, but it may intersect with the "college cafeteria food" disk. It is possible for "college cafeteria food" to overlap "wasted food," which would make the conclusion false while premises are true. The argument is invalid.
Partition of a Set
A set may be divided up into its disjoint subsets. Such a division is called a partition.
🔑 Definition — Partition: A partition of a set A is a collection of non-empty subsets {A₁, A₂, ..., Aₙ} of A, such that:
- A = A₁ ∪ A₂ ∪ ... ∪ Aₙ
- A₁, A₂, ..., Aₙ are mutually disjoint (or pairwise disjoint), i.e., for all i, j = 1, 2, ..., n, Aᵢ ∩ Aⱼ = ∅ whenever i ≠ j.
Power Set
The power set of a set A is the set of all subsets of A, denoted P(A).
🔑 Definition — Power Set: For a set A, P(A) = {x : x ⊆ A}.
📐 Formula: If A has n elements, then P(A) has 2ⁿ elements.
📌 Example: Let A = {1, 2}. Then P(A) = {∅, {1}, {2}, {1, 2}}. Since n = 2, the power set has 2² = 4 elements.
Exercise: Finding Power Sets
a. Find P(∅). b. Find P(P(∅)). c. Find P(P(P(∅))).
Solution: a. Since ∅ contains no element (n=0), P(∅) will contain 2⁰ = 1 element. P(∅) = {∅}
b. Since P(∅) contains one element (namely ∅), P(P(∅)) will contain 2¹ = 2 elements. P(P(∅)) = {∅, {∅}}
c. Since P(P(∅)) contains two elements (namely ∅ and {∅}), P(P(P(∅))) will contain 2² = 4 elements. P(P(P(∅))) = {∅, {∅}, {{∅}}, {∅, {∅}}}
💡 Why this matters: The nested power sets of the empty set demonstrate how the cardinality (number of elements) grows exponentially with each level, from 0 to 1, then to 2, then to 4 elements. This is foundational for understanding the size of different infinities and Boolean algebra.
⭐ Key Takeaways
Venn diagrams are a powerful tool for visualizing set relationships and solving problems with overlapping categories. When tackling word problems, always place known exact numbers first (like triple intersections) before calculating remaining regions. For logical arguments, an argument is valid if the conclusion must be true whenever all premises are true; if a single counterexample can be drawn where premises hold but the conclusion does not, the argument is invalid. A partition of a set requires the subsets to be non-empty, mutually disjoint, and their union must equal the original set. The power set of a set with n elements always contains exactly 2ⁿ subsets, including the empty set and the set itself.
🧠 Quick Revision Questions
- In the typist problem, why was the region for "M only" set to 0, and how does that affect the remaining calculations?
- In the school software problem, how was the value of 3 determined for the (A∩B but not C) region?
- For the argument "All dogs are carnivorous. Jack is not a dog. ∴ Jack is not carnivorous," draw a diagram showing true premises and a false conclusion. What does this prove about the argument?
- What are the three conditions a collection of subsets must satisfy to be considered a partition of a set?
- If A = {a, b}, list all elements of P(A). Then, if B = ∅, how many elements are in P(P(B))?