• Sonuç bulunamadı

Abstract Mathematics Lecture 12

N/A
N/A
Protected

Academic year: 2021

Share "Abstract Mathematics Lecture 12"

Copied!
10
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)
(2)

We will discuss how to show that

1 an object is an element of a set,

2 how to prove one set is a subset of another and

(3)

Remember that; A × B = (x, y ) : x ∈ A, y ∈ B , A ∪ B = x : (x ∈ A) ∨ (x ∈ B) , A ∩ B = x : (x ∈ A) ∧ (x ∈ B) , A − B = x : (x ∈ A) ∧ (x /∈ B) , A = U − A,

(4)

How to Prove a ∈ A

To show that a ∈x : P(x) we just need to show that P(a) is true.

Likewise, to show a ∈x ∈ S : P(x) , we need to confirm that a ∈ S and

(5)

Example

Lets investigate elements of A =x : x ∈ N ve 7|x . This set has form

A =x : P(x) where P(x) is the open sentence (x ∈ N) ∧ (7|x).

Thus 21 ∈ A because P(21) is true. Similarly, 7, 14, 28, 35, etc., are all elements of A.

But 8 /∈ A because P(8) is false.

(6)

Example

Consider the set A =X ∈ P(N) : |X | = 3 . We know that

4, 13, 45 ∈ A because 4, 13, 45 ∈ P(N) and 4, 13, 45 = 3. But 1, 2, 3, 4 /∈ A since 1, 2, 3, 4 6= 3.

(7)

How to Prove A ⊆ B

To prove that A ⊆ B, we just need to prove that the conditional statement If a ∈ A, then a ∈ B is true.

This can be proved directly, by assuming a ∈ A and deducing a ∈ B.

The contrapositive approach is another option: Assume a /∈ B and deduce

a /∈ A.

(8)

Prove thatx ∈ Z : 18|x ⊆ x ∈ Z : 6|x .

Proof.

Suppose a ∈x ∈ Z : 18|x . This means that a ∈ Z and 18|a.

By definition of divisibility, there is an integer c for which a = 18c. Consequently a = 6(3c), and from this we deduce that 6|a. Therefore a is one of the integers that 6 divides, so a ∈x ∈ Z : 6|x .

(9)

Example

Prove that if A and B are sets, then P(A) ∪ P(B) ⊆ P(A ∪ B).

Suppose X ∈ P(A) ∪ P(B). By definition of union, this means X ∈ P(A) or X ∈ P(B).

Therefore X ⊆ A or X ⊆ B (by definition of power sets). We consider cases.

(10)

Case 1. Suppose X ⊆ A. Then X ⊆ A ∪ B , and this means X ∈ P(A ∪ B).

Case 2. Suppose X ⊆ B. Then X ⊆ A ∪ B, and this means X ∈ P(A ∪ B). The above cases show that X ⊆ P(A ∪ B). Thus weve shown that

X ∈ P(A) ∪ P(B) implies X ∈ P(A ∪ B), and this completes the proof that P(A) ∪ P(B) ⊆ P(A ∪ B).

Referanslar

Benzer Belgeler

A number p ∈ N is perfect if it equals the sum of its positive divisors less

Mathematicians have a special name for the statements in the category that they suspect (but havent yet proved) are true.. Such statements are

Note that in the first five lines of the table, the sum of the first n odd numbers really does add up to n 2.. The table raises

Try to prove the following statement using strong

The proof combines the techniques of induction, cases, minimum counterexample and the idea of uniqueness of existence.. see for the full proof at page 192 of ”Book

A partition of a set A is a set of non-empty subsets of A, such that the union of all the subsets equals A, and the intersection of any two different subsets is ∅. Oktay ¨

How to spot the various properties of a relation from its

The pigeonhole principle is motivated by a simple thought experiment: Imagine there is a set A of pigeons and a set B of pigeonholes, and all the pigeons fly into the