4. Let π΄ = {1,2}, π΅= {π, π, π} and πΆ = {π, π}. Then show that (π΄ Γ π΅) β© (π΄ Γ πΆ) =
π΄ Γ (π΅ β© πΆ).
To prove that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ), we need to show that each set is a subset of the other.
First, let's find (π΄ Γ π΅) β© (π΄ Γ πΆ):
π΄ Γ π΅ = {(1, π), (1, π), (1, π), (2, π), (2, π), (2, π)}
π΄ Γ πΆ = {(1, π), (1, π), (2, π), (2, π)}
(π΄ Γ π΅) β© (π΄ Γ πΆ) = {(1, π), (2, π)}
Now, let's find π΄ Γ (π΅ β© πΆ):
π΅ β© πΆ = {π}
π΄ Γ (π΅ β© πΆ) = {(1, π), (2, π)}
Since (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ) = {(1, π), (2, π)}, we can conclude that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ).
To show that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ), we need to prove that they have the same elements.
First, let's find (π΄ Γ π΅) β© (π΄ Γ πΆ):
π΄ Γ π΅ = {(1, π), (1, π), (1, π), (2, π), (2, π), (2, π)}
π΄ Γ πΆ = {(1, π), (1, π), (2, π), (2, π)}
Taking the intersection of these two sets, we get:
(π΄ Γ π΅) β© (π΄ Γ πΆ) = {(1, π), (2, π)}
Now, let's compute π΅ β© πΆ:
π΅ β© πΆ = {π}
Next, let's compute π΄ Γ (π΅ β© πΆ):
π΄ Γ (π΅ β© πΆ) = {(1, π), (2, π)}
We see that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ), as both sets contain the same elements, which are {(1, π), (2, π)}.
Therefore, we have shown that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ).
To show that (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ), we need to demonstrate that the two sets are equal. Here is how we can prove it step by step:
1. Start with π΄ Γ π΅:
- π΄ Γ π΅ represents the Cartesian product of set A and set B.
- π΄ Γ π΅ is a set that contains all possible ordered pairs, where the first element belongs to set A and the second element belongs to set B.
- In this case, π΄ Γ π΅ will contain the following ordered pairs: {(1,π), (1,π), (1,π), (2,π), (2,π), (2,π)}.
2. Next, consider π΄ Γ πΆ:
- π΄ Γ πΆ represents the Cartesian product of set A and set C.
- π΄ Γ πΆ is a set that contains all the possible ordered pairs where the first element belongs to set A and the second element belongs to set C.
- In this case, π΄ Γ πΆ will contain the following ordered pairs: {(1,π), (1,π), (2,π), (2,π)}.
3. Now calculate the intersection of (π΄ Γ π΅) and (π΄ Γ πΆ):
- (π΄ Γ π΅) β© (π΄ Γ πΆ) represents the intersection between the two sets, which means finding the common elements between them.
- In this case, when we calculate the intersection, we find that the only common elements between (π΄ Γ π΅) and (π΄ Γ πΆ) are the ordered pairs (1,π) and (2,π).
- Hence, (π΄ Γ π΅) β© (π΄ Γ πΆ) = {(1,π), (2,π)}.
4. Lastly, consider π΄ Γ (π΅ β© πΆ):
- π΅ β© πΆ represents the intersection between sets B and C, which means finding the common elements between them.
- In this case, π΅ β© πΆ = {π}, as it is the only element that belongs to both sets B and C.
- π΄ Γ (π΅ β© πΆ) represents the Cartesian product of set A and the intersection of sets B and C.
- Since π΅ β© πΆ = {π}, π΄ Γ (π΅ β© πΆ) will contain the following ordered pairs: {(1,π), (2,π)}.
5. Comparing the results:
- After calculating (π΄ Γ π΅) β© (π΄ Γ πΆ) and π΄ Γ (π΅ β© πΆ), we see that they both contain the same ordered pairs: {(1,π), (2,π)}.
- Therefore, (π΄ Γ π΅) β© (π΄ Γ πΆ) = π΄ Γ (π΅ β© πΆ).
By going through the steps above, we have established the equality between (π΄ Γ π΅) β© (π΄ Γ πΆ) and π΄ Γ (π΅ β© πΆ).