Comparing T/F for Three Sets: A, B & C

  • Thread starter Thread starter EvLer
  • Start date Start date
  • Tags Tags
    Sets
Click For Summary
SUMMARY

The discussion focuses on the evaluation of set equalities involving three sets A, B, and C, specifically examining the validity of three statements related to union, intersection, and Cartesian products. The first statement, A U (B x C) = (A U B) x (A U C), is determined to be false. The second statement, A x (B ∩ C) = (A x B) ∩ (A x C), and the third statement, A x (B x C) = (A x B) x C, require systematic proof using the method of subset verification. The approach involves selecting arbitrary elements and demonstrating their membership in both sides of the equations to establish equality.

PREREQUISITES
  • Understanding of set theory concepts including union, intersection, and Cartesian products.
  • Familiarity with the notation and properties of sets.
  • Ability to perform subset proofs using arbitrary elements.
  • Knowledge of logical reasoning and implications in mathematical proofs.
NEXT STEPS
  • Study the properties of Cartesian products in set theory.
  • Learn about subset proofs and their applications in set equality verification.
  • Explore additional set identities and their proofs, such as De Morgan's laws.
  • Investigate the implications of set operations in higher dimensions and their applications.
USEFUL FOR

Mathematicians, educators, and students studying set theory, particularly those interested in proofs and logical reasoning in mathematics.

EvLer
Messages
454
Reaction score
0
Here is this problem I actually don't know how to approach:

which of the following are T/F for all sets A, B, C
a. A U (B x C) = (A U B) x (A U C)
i think this one is false, i worked it out on a small example
b. A x (B intersection C) = (A x B) intersection (A x C)
c. A x (B x C) = (A x B) x C

where the "x" is cartesian product.
Any idea how to approach this systematically or just a helpful explanation is very much appreciated.
 
Physics news on Phys.org
The typical method for proving set equalities is to choose some arbitrary element of one side of the equality call it x then show that because of it belonging to one side, and the properties of unions, intersections, and cartesian products that it belongs to the other side of the equality. This shows that the first side is a subset of the second, so to prove them equal you need to show that the second side is also a subset of the first by using the same method.

I'll give you an example.
Let's say I want to prove that

[tex]A \cap (B \cup C) = (A \cap B) \cup (A \cap C)[/tex]
Then I want to start with
[tex]let \ x \ \epsilon \ A \cap (B \cup C)[/tex]
then
[tex]x \ \epsilon \ A \ and \ x \ \epsilon B \cup C[/tex]
from that I know that
[tex]x \ \epsilon A \ and \ ( x \ \epsilon B \ OR \ x \ \epsilon C )[/tex]
Which means that
[tex]x \ \epsilon \ A \cap B \ OR \ x \ \epsilon \ A \cap C[/tex]
And so
[tex]x \ \epsilon \ (A \cap B) \cup (A \cap C)[/tex]

this proves that [tex]A \cap (B \cup C) \subset (A \cap B) \cup (A \cap C)[/tex]

And to finish the proof I would just need to start with some other arbitrary element, say y, is in ( A intersect B) U (A intersect C) and perform the same procedure to show that this is a subset of A intersect ( B U C) then since each side is a subset of the other they must be equal, and the proof would be complete.

Note that when doing a proof like this witha cartesian prodcut to remeber that the elements of a cartesian product are pairs of elements (x, y) so that if this was a member of the cartesian product X x Y then x is an element of X and y is an element of Y.
 
Last edited:

Similar threads

Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K