27.12.2013 Views

Book of Proof - Amazon S3

Book of Proof - Amazon S3

Book of Proof - Amazon S3

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

134 Pro<strong>of</strong>s Involving Sets<br />

Example 8.9 Suppose A and B are sets. If P(A) ⊆ P(B), then A ⊆ B.<br />

Pro<strong>of</strong>. We use direct pro<strong>of</strong>. Assume P(A) ⊆ P(B).<br />

Based on this assumption, we must now show that A ⊆ B.<br />

To show A ⊆ B, suppose that a ∈ A.<br />

Then the one-element set { a } is a subset <strong>of</strong> A, so { a } ∈ P(A).<br />

But then, since P(A) ⊆ P(B), it follows that { a } ∈ P(B).<br />

This means that { a } ⊆ B, hence a ∈ B.<br />

We’ve shown that a ∈ A implies a ∈ B, so therefore A ⊆ B.<br />

■<br />

8.3 How to Prove A = B<br />

In pro<strong>of</strong>s it is <strong>of</strong>ten necessary to show that two sets are equal. There is a<br />

standard way <strong>of</strong> doing this. Suppose we want to show A = B. If we show<br />

A ⊆ B, then every element <strong>of</strong> A is also in B, but there is still a possibility<br />

that B could have some elements that are not in A, so we can’t conclude<br />

A = B. But if in addition we also show B ⊆ A, then B can’t contain anything<br />

that is not in A, so A = B. This is the standard procedure for proving A = B:<br />

Prove both A ⊆ B and B ⊆ A.<br />

How to Prove A = B<br />

Pro<strong>of</strong>.<br />

[Prove that A ⊆ B.]<br />

[Prove that B ⊆ A.]<br />

Therefore, since A ⊆ B and B ⊆ A,<br />

it follows that A = B.<br />

■<br />

Example 8.10 Prove that { n ∈ Z : 35| n } = { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } .<br />

Pro<strong>of</strong>. First we show { n ∈ Z : 35| n } ⊆ { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } . Suppose<br />

a ∈ { n ∈ Z : 35| n } . This means 35| a, so a = 35c for some c ∈ Z. Thus a = 5(7c)<br />

and a = 7(5c). From a = 5(7c) it follows that 5| a, so a ∈ { n ∈ Z : 5| n } . From<br />

a = 7(5c) it follows that 7| a, which means a ∈ { n ∈ Z : 7| n } . As a belongs<br />

to both { n ∈ Z : 5| n } and { n ∈ Z : 7| n } , we get a ∈ { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } .<br />

Thus we’ve shown that { n ∈ Z : 35| n } ⊆ { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } .<br />

Next we show { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } ⊆ { n ∈ Z : 35| n } . Suppose that<br />

a ∈ { n ∈ Z : 5| n } ∩ { n ∈ Z : 7| n } . By definition <strong>of</strong> intersection, this means that<br />

a ∈ { n ∈ Z : 5| n } and a ∈ { n ∈ Z : 7| n } . Therefore it follows that 5| a and 7| a.<br />

By definition <strong>of</strong> divisibility, there are integers c and d with a = 5c and a = 7d.<br />

Then a has both 5 and 7 as prime factors, so the prime factorization <strong>of</strong> a

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!