When Does A \ (A \ B) Equal B in Set Theory?

Click For Summary
SUMMARY

The discussion centers on the conditions under which the equation A \ (A \ B) = B holds true in set theory. It is established that if B is a subset of A, then A \ (A \ B) equals B. The proof involves demonstrating that if an element x belongs to A \ (A \ B), it must also belong to B, and vice versa. The participants clarify the use of DeMorgan's Law and associative law to support their arguments, ultimately concluding that A \ (A \ B) = B if and only if B is a subset of A.

PREREQUISITES
  • Understanding of set theory concepts, specifically set difference and subsets.
  • Familiarity with DeMorgan's Law in mathematical logic.
  • Knowledge of associative laws in set operations.
  • Basic skills in mathematical proof techniques.
NEXT STEPS
  • Study the properties of set operations, focusing on set difference and subset relations.
  • Learn how to apply DeMorgan's Law in various mathematical contexts.
  • Explore the concept of complements in set theory and their implications.
  • Practice constructing formal proofs in set theory to solidify understanding.
USEFUL FOR

Students of mathematics, particularly those studying set theory, educators teaching mathematical proofs, and anyone interested in logical reasoning and mathematical relationships.

icantadd
Messages
109
Reaction score
0

Homework Statement



where A and B are sets and ' \ ' means set difference

under what conditions does A \ (A \ B) = B

Homework Equations



S\A = {X | X in S and X not in A}
B < A (subset) means if x is in B then x is in A


The Attempt at a Solution


I get that if B is a subset of A then A \ (A \ B) = B. But I don't know how to prove it. Here's my attempt thus far

assume x is in A \ (A \ B)
to be proved x is in B

from assumption x is in A and x is not in (A \ B) , then
x is in A and not { L | L in A and L not in B}
because B is a subset of A
x is in A and . . .

. . .
It's like I know that A \ B contains nothing from B but because A includes B, subtracting it from A will give back B. I don't know how to phrase it right for making a mathematical argument. Any guidance will be strongly appreciated.
 
Physics news on Phys.org
A\(A\ B) = B

For A\B, Let x \in A \wedge x \notin B
Then, A \ (A \ B) implies that

x \in A \wedge (x \notin A \vee x \in B) by DeMorgan's Law

Then, by associative law,

(x \in A \wedge x \notin A) \vee ( x \in A \wedge x \in B) \implies ( x \in A \vee x \in B)

So, A \cup B = B if A \subset B or if A is the empty set.
 
Last edited:
Assuming B is a subset of A:

If x is in A\(A\B) then x is in A and x is not in A\B. x not in A\B means either x is not in A (which is impossible) or x is in B. Therefore x in A\(A\B) implies x is in B.
If x is in B, since B is a subest of A, x is in A. Since x is in B, it is NOT in A\B and therefore is in A\(A\B).

Those two prove that, if B is a subset of A, A\(A\B)= B.

But you also have to prove the other way: if A\(A\B)= B, then B is a subset of A.

if x is in B, then x is NOT in A\B but is in A\(A\B) because A\(A\B)= B. Therefore x is in A and so B is a subset of A.
 
Thank you for your help. I actually got it just after posting here, when I read the chapter and found that if B is a subset of A, A\B can be rewritten as B* or B's Complement in A. Then my modeling of the problem became more crystaline, and I went from there, only slightly different than yours HallsOfIvy

For Konthelion, I have not seen the step you made to get to "x in A and (x not in A or x in B)". Can you explain why you were able to do this?
 
A\B=A\capB^{c} will help o:)
Well, Konthelion made a mistake: that should be "so, A\capB=B , blah blah blah"
 
Last edited:

Similar threads

Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K