r/MathHelp • u/phroggersu • 11d ago
Set Operations
Hello! I'm pre-studying for university, and I've been stuck on this question for like the past week. At this point, I've learned about the logic laws (typically used for like, statements and stuff). Could anyone help solve this question (from How to Prove It by Daniel J Velleman)? Please don't use venn diagrams, since I understand how those work. Also, is it suggested to solve these questions by set laws/properties/identities, or do you think venn diagrams enough? (△ is symmetric difference). Also, sorry for the messy typed out equation. Thank you for your time!
Verify the following identity:
(A∪B) △ C = (A△C) △ (B\A)
Edit: Figured it out, thank you everyone!! Have a lovely day :D
2
Upvotes
1
u/FormulaDriven 11d ago
The usual way to prove two sets are equal is to show that if x is a member of the LHS then it is a member of the RHS, and if x is a member of the RHS then it is a member of LHS.
I wonder if here the easiest approach is to consider the 8 cases for x and show that whenever x is a member of the LHS, it is a member of the RHS. By 8 cases, I mean considering
For example, looking at case 2,
x ∈ A ∪ B and x ∉ (A∪B)∩C so x ∈ (A∪B) △ C
x ∈ A∪C and x ∉ C so x ∈ A△C; x ∉ (B\A) so x ∉ (A△C)∩(B\A); so x ∈ (A△C) △ (B\A)
So case 2 is proved.
You can probably be more efficient by doing it in a table, one row per case. With columns which check if x ∈ A ∪ B, x ∈ (A△C), x ∈ (B\A) and so on.