Constructing Proofs in Mathematics: Where do I Begin?

[Repetit]

Hey
Im trying to study abstract algebra, set theory and group theory, on my own. I have trouble understanding how to construct mathematical proofs though. Some of the things the excercises tells me to prove, seems so intuitively clear and obvious that I don't know what's left to prove. For example, prove that

$$A\cup B = B\cup A$$

where A and B are two sets, or

$$A\cap(B\cup C)=(A\cap B)\cup (A\cap C)$$

I have no idea how to start. Can someone give me a hint on these? And maybe a hint on general proof making in mathematics?

 

[The|M|onster]

Well, for starters, when you are trying to prove that the the union of A and B is equal to the union of B and A it is necessary to show that the union of A and B is contained in the union of B and A. Then you need to prove the converse. When I do proofs of this sort, I start by drawing some pretty Venn diagrams. It helps me visualize what I am trying to prove.

 

[Hurkyl]

The first axiom of elementary set-theory is the Axiom of extensionality:

S=T if and only if ($x \in S$ if and only if $x \in T$).​

In fact, this is the only axiom of Zermelo set theory that says anything about equality. So, if you want to prove two sets are equal, essentially the only method available is to apply this axiom.

Once you learn more theorems (such as the two theorems you posted), you will learn more ways to prove sets are equal.

 

[uman]

Your book probably defines equality of sets. That definition may or may not be the same as the one Hurkyl gave.

What's the definition given?

 

[Repetit]

Thanks for the answers.

I think the definition the book gives of equality between sets, is that for two sets A and B to be equal, A must be a subset of B and B must be a subset of A.

 

[HallsofIvy]

Yes, that's exactly what Hurkyl gave.

And to prove "A is a subset of B" you start "let x be a member of A" and then, using the fact that x satisfies whatever the definition of A is, show that it must also satisfy the definition of B and so "x is a member of B".

Here, since you are asked to prove $A\cup B = B\cup A$ you need to prove that $A\cup B$ is a subset of $B\cup A$ and then prove that $B\cup A$ is a subset of $A\cup B$.

To prove that $A\cup B$ is a subset of $B\cup A$, start "let x be a member of $A\cup B$. I said above "using the fact that x satisfies whatever the definition of A is". Here the set is defined as a union so we really need to use the definition of "union". x is in $A\cup B$ if and only if x is in A or x is in B. Since that is an "or", break this into two cases:
(i) x is in A. In that case x is in $B\cup A$ because ...
(ii) x is in B. In that case x is in $B\cup A$ because ...