An exercise asks me to prove the following:
A∩B⊆¯A△B
Unlike most other exercises, this one implies a symmetric difference, of which I am unfamiliar in this kind of proofs. There was little I could do, here:
The statement can be rewritten as the following:
A∩B⊆¯(A−B)∩(B−A)
A∩B⊆¯(A−B)∩¯(B−A)
A∩B⊆(¯A−¯B)∩(¯B−¯A)
I rewrote it because the symmetric difference doesn't seem "primitive" enough for me to operate with. Then my proof begins:
x∈A∩B⟹x∈A∧x∈B
⟹x∈(A∩B)∧x∈(B∩A)
⟹(x∈A∧x∈B)∧(x∈B∧x∈A)
And then, I got stuck. I don't see how can (x∈A∧x∈B)∧(x∈B∧x∈A) become what I needed at all.
Answer
You’ve some serious errors in your first calculations: it is not true in general that ¯(A∖B)∩(B∖A)=¯A∖B∩¯B∖A or that ¯A∖B∩¯B∖A=(¯A∖¯B)∩(¯B∖¯A). In fact,
¯(A∖B)∩(B∖A)=¯A∖B∪¯B∖A
by one of the de Morgan laws, and ¯A∖B=¯A∪B, also by de Morgan.
Here’s an approach that does work.
Suppose that x∈A∩B; you want to show that x is not in A△B. Judging by the work in your question, your definition of A△B is (A∖B)∪(B∖A), so you want to show that
x∉(A∖B)∪(B∖A).
To do this, you must show that x∉A∖B and x∉B∖A. But that’s easy: if x were in A∖B, then by definition we’d have x∈A, which is fine, and x∉B, which is not fine: since x∈A∩B, we know that x is in B. Thus, x cannot belong to A∖B: x∉A∖B. A virtually identical argument shows that x∉B∖A, and hence that x∉(A∖B)∪(B∖A).
Another approach is to show that your definition of A△B is equivalent to another comment definition: A△B=(A∪B)∖(A∩B). That makes it very obvious that nothing can belong both to A△B and A∩B.
No comments:
Post a Comment