0 Sets and Induction, Schemes and Mind Maps of Logic

The roster method is a way of defining a ... Another way to describe a set is using set builder notation. ... The integer r in the division algorithm is.

Typology: Schemes and Mind Maps

2022/2023

Uploaded on 02/28/2023

myboy
myboy 🇺🇸

4.4

(76)

260 documents

1 / 410

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
0 Sets and Induction
Sets
Aset is an unordered collection of objects,
called elements or members of the set. A
set is said to contain its elements. We write
aAto denote that ais an element of the
set A. The notation a /Adenotes that a
is not an element of the set A.
1
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62
pf63
pf64

Partial preview of the text

Download 0 Sets and Induction and more Schemes and Mind Maps Logic in PDF only on Docsity!

0 Sets and Induction

Sets

A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a ∈ A to denote that a is an element of the set A. The notation a /∈ A denotes that a is not an element of the set A.

Defining a Set

The roster method is a way of defining a set by listing all of its members.

Examples

  • S = {a, b, c}

• S = { 1 , 2 , 3 , 4 }

• S = { 1 , 4 , 7 , 10 , 13 , 16 ,.. .}

Defining a Set

Example: Express the following set using set builder notation.

S = {... , − 12 , − 8 , − 4 , 0 , 4 , 8 , 12 ,.. .}

Important Sets

Notation

Z = {... , − 2 , − 1 , 0 , 1 , 2 ,.. .}, the set of integers Z+^ = { 1 , 2 , 3 ,.. .}, the set of positive integers Q = {pq | p ∈ Z, q ∈ Z, and q 6 = 0}, the set of ratio- nal numbers R, the set of real numbers R+, the set of positive real numbers C, the set of complex numbers

Subsets

The set A is a subset of B if and only if every element of A is also an element of B. That is, A is a subset of B iff

∀x (x ∈ A → x ∈ B).

We use the notation A ⊆ B to indicate that A is a subset of B.

Proper Subsets

We say that A is a proper subset of B if and only if A ⊆ B and A 6 = B. That is, A is a proper subset of B iff

∀x (x ∈ A → x ∈ B) ∧ ∃x (x ∈ B ∧ x /∈ A).

We use the notation A ( B to indicate that A is a proper subset of B.

Special Subsets

For every set S,

(i) Ø ⊆ S (ii) S ⊆ S

Equality of Sets

Two sets are equal if and only if they have the same elements. Therefore, if A and B are sets, then A = B if and only if

∀x (x ∈ A ↔ x ∈ B).

That is, A = B iff A ⊆ B and B ⊆ A.

Intersection and Union

Let S and T be sets.

  • The intersection of S and T , denoted S ∩ T , is the set of elements which be- long to both S and T. That is, S ∩ T = {x | x ∈ S and x ∈ T }
  • The union of S and T , denoted S ∪ T , is the set of elements which belong to S or T. That is, S ∪ T = {x | x ∈ S or x ∈ T }

Intersection and Union

Example

Let S = { 1 , 2 , 3 , 4 , 5 } and T = { 2 , 4 , 6 }. Then, S ∩ T = { 2 , 4 }. S ∪ T = { 1 , 2 , 3 , 4 , 5 , 6 }.

Sets and Proofs

To show A ⊆ B

Assume x ∈ A, then show x ∈ B.

To show A * B

Show there exists an x ∈ A such that x 6 = B.

Sets and Proofs

To show A = B

Step 1. Assume x ∈ A, then show x ∈ B.

Step 2. Assume x ∈ B, then show x ∈ A.

Sets and Proofs

Example: Let S and T be sets. Prove that S ⊆ T if and only if S ∩ T = S.