4. Let π΄π΄ = {1,2}, π΅π΅ = {ππ, ππ, ππ} ππππππ πΆπΆ = {ππ, ππ}. Then show that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) =
π΄π΄ Γ (π΅π΅ β© πΆπΆ).
To show that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ), we need to prove that every element in the left-hand side set is also in the right-hand side set, and vice versa.
Let's start by considering an arbitrary element (ππ, ππ) in the set (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ). This means that (ππ, ππ) is both in π΄π΄ Γ π΅π΅ and in π΄π΄ Γ πΆπΆ. By definition, this implies that ππ is an element of π΄π΄, ππ is an element of π΅π΅, and ππ is an element of π΄π΄, ππ is an element of πΆπΆ. Since π΅π΅ β© πΆπΆ is the set of elements that are common to both π΅π΅ and πΆπΆ, it follows that ππ is an element of π΅π΅ β© πΆπΆ. Thus, (ππ, ππ) is an element of π΄π΄ Γ (π΅π΅ β© πΆπΆ), which proves that every element in the left-hand side set is in the right-hand side set.
Now, let's consider an arbitrary element (ππ, ππ) in the set π΄π΄ Γ (π΅π΅ β© πΆπΆ). This means that ππ is an element of π΄π΄ and ππ is an element of π΅π΅ β© πΆπΆ. Since ππ is an element of π΅π΅ β© πΆπΆ, it follows that ππ is an element of π΅π΅ and ππ is an element of πΆπΆ. Thus, (ππ, ππ) is an element of π΄π΄ Γ π΅π΅ and (ππ, ππ) is an element of π΄π΄ Γ πΆπΆ, which implies that (ππ, ππ) is an element of (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ). This proves that every element in the right-hand side set is in the left-hand side set.
Since we have shown that every element in the left-hand side set is in the right-hand side set, and vice versa, we can conclude that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ).
To show that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ), we need to demonstrate that any element in the intersection on the left-hand side is also an element in the set on the right-hand side, and vice versa.
First, let's find the elements in (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ):
π΄π΄ Γ π΅π΅ = {(1, ππ), (1, ππ), (1, ππ), (2, ππ), (2, ππ), (2, ππ)}
π΄π΄ Γ πΆπΆ = {(1, ππ), (1, ππ), (2, ππ), (2, ππ)}
The intersection of these two sets is:
(π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = {(1, ππ), (2, ππ)}
Now, let's find π΅π΅ β© πΆπΆ:
π΅π΅ β© πΆπΆ = {ππ}
Finally, we need to determine π΄π΄ Γ (π΅π΅ β© πΆπΆ):
π΄π΄ Γ (π΅π΅ β© πΆπΆ) = {(1, ππ), (2, ππ)}
Comparing the sets, we can see that the elements in the intersection on the left-hand side are the same as the elements in the set on the right-hand side. Therefore, we can conclude that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ).
To show that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ), we need to demonstrate that each set is a subset of the other.
First, let's find (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ):
π΄π΄ Γ π΅π΅ represents the Cartesian product of set π΄π΄ and set π΅π΅. This means forming all possible ordered pairs where the first element comes from π΄π΄ and the second element comes from π΅π΅. In this case, we have:
π΄π΄ Γ π΅π΅ = {(1, ππ), (1, ππ), (1, ππ), (2, ππ), (2, ππ), (2, ππ)}
Similarly, π΄π΄ Γ πΆπΆ represents the Cartesian product of set π΄π΄ and set πΆπΆ, which is given by:
π΄π΄ Γ πΆπΆ = {(1, ππ), (1, ππ), (2, ππ), (2, ππ)}
Next, we need to compute the intersection of these two sets:
(π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = {(1, ππ), (2, ππ)}
Now, let's consider π΄π΄ Γ (π΅π΅ β© πΆπΆ):
π΅π΅ β© πΆπΆ represents the intersection of sets π΅π΅ and πΆπΆ, which is given by {ππ}. Therefore, π΅π΅ β© πΆπΆ = {ππ}.
Now, compute π΄π΄ Γ (π΅π΅ β© πΆπΆ):
π΄π΄ Γ (π΅π΅ β© πΆπΆ) = {(1, ππ), (2, ππ)}
By comparing both sets, we can see that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ), as the sets contain the same ordered pairs.
Therefore, we have successfully shown that (π΄π΄ Γ π΅π΅) β© (π΄π΄ Γ πΆπΆ) = π΄π΄ Γ (π΅π΅ β© πΆπΆ).