If $A$ and $B$ are two sets, prove that $\{ A \cap B, A\setminus B \}$ is a partition of $A$.
I think this is a problem more of not knowing how to construct proofs than not comprehending the material (although, honestly, I'm finding myself to be quite weak in the Linear Algebra course I'm taking). As an aside to the question, I've acquired Velleman's How to Prove It, and I would not mind opinions as to whether that's a good start to learning how to answer questions such as this without looking at solutions.
Moving on to the question. From the way the set is defined, if $A$ is disjoint from $B$, is their intersection not the empty set?
Furthermore, I know that my proof needs to apply the definition of partition:
- The union of the elements of $P$ is equal to $X$. (The elements of $P$ are said to cover $X$.)
- The intersection of any two distinct elements of $P$ is empty. (We say the elements of $P$ are pairwise disjoint.)
But I'm not sure how to do this: I feel like if $A$ is disjoint from $B$ and my feeling that the intersection is the empty set is true, then I am in fact dealing with $A$, and that the singleton $\{A\}$ is a partition. But that's about as far as I get.
Any explanations that help me further my understanding of the material are extremely appreciated.