• Tidak ada hasil yang ditemukan

(1)Sets Definition A set is an unordered collection of objects called elements or members of the set

N/A
N/A
Protected

Academic year: 2024

Membagikan "(1)Sets Definition A set is an unordered collection of objects called elements or members of the set"

Copied!
28
0
0

Teks penuh

(1)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets: N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(2)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets: N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(3)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets: N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(4)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets:

N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(5)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets:

N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(6)

Sets

Definition A set is an unordered collection of objects called elements or members of the set.

Examples:

I S ={1,2,5}

I V ={a,e,i,o,u}

I X ={apple,32,A,Z}

I Y ={2,3,4,6,22}

I Y0 ={2,3,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Familiar sets:

N,Z,R,Q,R+.

I Two common questions

I doesxS?

I isX =Y?

Roster method vs set-builder method.

(7)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(8)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(9)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(10)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(11)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(12)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(13)

Equality and containment

A=B

I Y ={2,3,4,6,22}

I Y0 ={2,3,4,3,22,2,6}

I Y00={22,4,6,22,3}

I Express equality using quantifiers.

∀x (x ∈A↔x ∈B)

A⊆B

I A={a,b,22,33}

I B ={a,b,22,33,N}

I B *A

I Express not a subset of using quantifiers.

∃x (x ∈B∧x∈/ A)

(14)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

(15)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

(16)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

I for any setS,φ⊆S.

proof?

I ∀x (x φxS)

I for anyx,xφalways evaluates to false.

I the conditional (xφx S) evaluates to true.

Example of a vacuous proof.

Important {φ}is not the same as φ.

(17)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

I for any setS,φ⊆S. proof?

I ∀x (x φxS)

I for anyx,xφalways evaluates to false.

I the conditional (xφx S) evaluates to true.

Example of a vacuous proof.

Important {φ}is not the same as φ.

(18)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

I for any setS,φ⊆S. proof?

I ∀x (x φxS)

I for anyx,xφalways evaluates to false.

I the conditional (x φx S) evaluates to true.

Example of a vacuous proof.

Important {φ}is not the same as φ.

(19)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

I for any setS,φ⊆S. proof?

I ∀x (x φxS)

I for anyx,xφalways evaluates to false.

I the conditional (x φx S) evaluates to true.

Example of a vacuous proof.

Important {φ}is not the same as φ.

(20)

Empty set

Definition A set that has no elements is the empty set denoted by φor{}.

I for any setS,φ∈S.

I for any setS,φ⊆S. proof?

I ∀x (x φxS)

I for anyx,xφalways evaluates to false.

I the conditional (x φx S) evaluates to true.

Example of a vacuous proof.

Important {φ}is not the same as φ.

(21)

Power set

S ={32,6,41}

I subsets ofS:

{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.

Definition The set of all subsets of S is called the power setof S, denoted asP(S).

The power set of a set withn elements has 2n elements.

(22)

Power set

S ={32,6,41}

I subsets ofS:

{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.

Definition The set of all subsets of S is called the power setof S, denoted asP(S).

The power set of a set withn elements has 2n elements.

(23)

Power set

S ={32,6,41}

I subsets ofS:

{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.

Definition The set of all subsets of S is called the power setof S, denoted asP(S).

The power set of a set withn elements has 2nelements.

(24)

Size of a set

Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.

I S ={1,17,a,b};|S|= 4.

I S ={1,2,2,6,7,7};|S|= 4.

I |φ|= 0.

A set that is not finite is said to be infinite

(25)

Size of a set

Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.

I S ={1,17,a,b};|S|= 4.

I S ={1,2,2,6,7,7};|S|= 4.

I |φ|= 0.

A set that is not finite is said to be infinite

(26)

Size of a set

Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.

I S ={1,17,a,b};|S|= 4.

I S ={1,2,2,6,7,7};|S|= 4.

I |φ|= 0.

A set that is not finite is said to be infinite

(27)

Set operations

I Union

I Intersection

I Set difference

I Exclusive OR

I Complement Set identities

(28)

Exercises

1. For each of the sets below determine if 2 belongs to the set.

(a){x ∈R | x is an integer greater than 1}

(b) {x ∈R | x is the square of an integer}

(c) {2,{2}} (d){{2},{2}} (e) {{2},{2,{2}}}

2. Let A={φ,b}. Construct the following sets:

I Aφ

I A∪ P(A)

I {φ} −A

I A∩ P(A) 3. Prove thatP(A)⊆ P(B) iff A⊆B.

4. ExpressA⊂B using quantifiers.

5. Prove thatA∩B = ¯A∪B.¯

Referensi

Dokumen terkait