Week 12 In-Class Exercises
1. Suppose that A and B are sets. If A and B...
Nov 27, 2024
Hi Quentin! It looks like you have some exercises related to set cardinalities. Let's break down the questions one by one.
(a) Show that if A and B are finite, then the sum and product definitions above agree with the sum and product of non-negative integers.
To show this, you can consider the definitions of the cardinalities. If A has m elements and B has n elements, then:
- The cardinality of their union (since they are disjoint) is ∣A∪B∣=∣A∣+∣B∣=m+n.
- The cardinality of their Cartesian product is ∣A×B∣=∣A∣⋅∣B∣=m⋅n.
Thus, the definitions of sum and product of cardinalities align with the standard arithmetic of non-negative integers.
(b) Explain why these operations are commutative and associative.
- Commutativity: For the sum, ∣A∣+∣B∣=∣B∣+∣A∣ holds because the union of disjoint sets does not depend on the order of the sets. For the product, ∣A∣⋅∣B∣=∣B∣⋅∣A∣ holds because the Cartesian product is also independent of the order of the sets.
- Associativity: For the sum, (∣A∣+∣B∣)+∣C∣=∣A∣+(∣B∣+∣C∣) holds because you can group the sets in any way when taking their union. For the product, ∣A∣⋅(∣B∣⋅∣C∣)=(∣A∣⋅∣B∣)⋅∣C∣ holds because the Cartesian product can be grouped in any way.
(c) Show that if ∣A∣≤∣C∣ and ∣B∣≤∣D∣ then ∣A∣+∣B∣≤∣C∣+∣D∣.
You can use the definition of cardinality and the properties of inequalities. Since ∣A∣≤∣C∣ means there exists an injection from A to C, and similarly for B to D, you can construct a combined injection from A∪B to C∪D to show that the sum of the cardinalities holds.
(d) Show that if ∣A∣≤∣C∣ and ∣B∣≤∣D∣ then ∣A∣⋅∣B∣≤∣C∣⋅∣D∣.
Similar to part (c), you can use the definition of cardinality. If there are injections from A to C and from B to D, you can create a function that pairs elements from A and B to elements in C and D, showing that the product of the cardinalities holds.
If you need more detailed explanations or examples for any of these parts, feel free to ask!