Proof of the identity A\(A\B)=B

Click For Summary
SUMMARY

The identity A \ (A \ B) = B is proven using set theory definitions and operations. By applying the definitions of set difference and complement, the proof simplifies to A ∩ B, confirming that the identity holds under the condition that A includes B. The discussion clarifies that confusion may arise from misinterpretation of the identity's formulation, but the mathematical steps taken are correct. The conclusion emphasizes the necessity of understanding the inclusion relation between sets A and B.

PREREQUISITES
  • Understanding of set theory concepts, specifically set difference and complement.
  • Familiarity with Munkres' Topology and its definitions.
  • Knowledge of basic operations on sets, such as intersection and union.
  • Ability to manipulate and simplify set expressions mathematically.
NEXT STEPS
  • Study the definitions of set operations in Munkres' Topology.
  • Explore examples of set identities and their proofs in set theory.
  • Learn about inclusion relations and their implications in set theory.
  • Practice proving other set identities using similar methods.
USEFUL FOR

Mathematics students, particularly those studying topology or set theory, educators teaching these concepts, and anyone interested in formal proofs within mathematical frameworks.

VladZH
Messages
56
Reaction score
1
I'm trying to proof an identity from Munkres' Topology

A \ ( A \ B ) = B

By definition A \ B = {x : x in A and x not in B}

A \( A \ B) = A \ (A ∩ Bc) = A ∩ (A ∩ Bc)c = A ∩ (Ac ∪ B) = (A ∩ Ac) ∪ (A ∩ B) = ∅ ∪ (A ∩ B) = A ∩ B

What did I miss?
 
Physics news on Phys.org
VladZH said:
I'm trying to proof an identity from Munkres' Topology

A \ ( A \ B ) = B

By definition A \ B = {x : x in A and x not in B}

A \( A \ B) = A \ (A ∩ Bc) = A ∩ (A ∩ Bc)c = A ∩ (Ac ∪ B) = (A ∩ Ac) ∪ (A ∩ B) = ∅ ∪ (A ∩ B) = A ∩ B

What did I miss?
Either that ##A=X## is the entire space, or you've found a typo. Just consider a point ##b\in B\text{ \ }A##. It is clearly in ##B## but never in any set ##A\text{ \ }C## whatever ##C## might be; except ##A=X## of course.
 
  • Like
Likes   Reactions: VladZH
VladZH said:
I'm trying to proof an identity from Munkres' Topology

A \ ( A \ B ) = B

By definition A \ B = {x : x in A and x not in B}

A \( A \ B) = A \ (A ∩ Bc) = A ∩ (A ∩ Bc)c = A ∩ (Ac ∪ B) = (A ∩ Ac) ∪ (A ∩ B) = ∅ ∪ (A ∩ B) = A ∩ B

What did I miss?

Perhaps even more simply, from the definition it is clear that ##A \text{ \ }X \subset A##. So, the identity as given cannot hold for all ##A, B##.
 
  • Like
Likes   Reactions: VladZH
VladZH said:
I'm trying to proof an identity from Munkres' Topology

A \ ( A \ B ) = B

By definition A \ B = {x : x in A and x not in B}

A \( A \ B) = A \ (A ∩ Bc) = A ∩ (A ∩ Bc)c = A ∩ (Ac ∪ B) = (A ∩ Ac) ∪ (A ∩ B) = ∅ ∪ (A ∩ B) = A ∩ B

What did I miss?

You missed nothing. This is correct.
 
  • Like
Likes   Reactions: VladZH
Thank you, guys. Seems like I confused with the formultaion
 
You can always resort to brute force by trying to show every element of B is a subset of A\(A\B) and viceversa. But, yes, you need to know the overall inclusion relation between A and B.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 11 ·
Replies
11
Views
3K