Chapter 5 Flashcards

1
Q

Suppose A, B, and C are sets; set containment is… (give 2 answers) [proposition]

A
  1. set containment is reflexive
    A ⊆ A
  2. set containment is transitive
    if A ⊆ B and B ⊆ C, then A ⊆ C
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Suppose A, B, and C are sets; state the 3 characteristics of set equality [proposition]

A
  1. set equality is reflexive
    A = A
  2. set eqaulity is symmetric
    if A = B, then B = A
  3. set equality is transitive
    ​if A = B and B = C, then A = C
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

the empty set [definition / notation]

A

The empty set, denoted ∅, is the set with no elements. That is, it is the set such that x ∈ ∅ is never true, no matter what x is.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

state the proposition that says that there is only one empty set [proposition]

A

Suppose ∅1 and ∅2 have the property that x ∈ ∅1 is never true
andx ∈ ∅2 is never true.
Then ∅1 = ∅2.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

intersection of two sets A and B [definition / notation]

A

A ∩ B = {x : x ∈ A and x ∈ B}

or

(x ∈ A ∩ B) ⇐⇒ (x ∈ A and x ∈ B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

If A ∩ B = ∅, we say that A and B are… [terminology]

A

If A ∩ B = ∅, we say that A and B are disjoint.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

union of 2 sets A and B [definition / notation]

A

A ∪ B = {x : x ∈ A or x ∈ B}

or

(x ∈ A ∪ B) ⇐⇒ (x ∈ A or x ∈ B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

If A and B are sets, then their set difference is…
[definition / notation]

A

A − B = {x: x ∈ A and x ∉ B}

or

A \ B = {x: x ∈ A and x ∉ B}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

If A and B are sets, then their symmetric difference is…
[definition / notation]

A

A∆B = (A − B) ∪ (B − A)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Suppose A, B ⊆ X ; then A ⊆ B ⇔ []C ⊆ []C
[proposition]

A

A ⊆ B ⇔ BC⊆ AC

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

De Morgan’s laws (2) [theorem]

A
  1. (A ∩ B)C = AC ∪ BC
  2. (A ∪ B)C = AC ∩ BC
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Suppose A, B, and C are sets; then

C ∩ (A ∪ B) = ?

[proposition]

A

C ∩ (A ∪ B) = (C ∩ A) ∪ (C ∩ B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Suppose A, B, and C are sets; then

C ∪ (A ∩ B) = ?

[proposition]

A

C ∪ (A ∩ B) = (C ∪ A) ∩ (C ∪ B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Suppose A and B are sets; the cartesian product of A and B is defined… [definition / notation]

A

A × B := {(a, b): a ∈ A, b ∈ B}

where (a,b) is an ordered pair, NOT a set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Equality of ordered pairs is given by… [definition]

A

(a, b) = (c, d) ⇐⇒ a = c and b = d

Thus (a, b) = (b, a) if and only if a = b .

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

If A and B are nonempty sets such that A ̸= B, then… [proposition]

A

If A and B are nonempty sets such that A ≠ B,

then A × B ≠ B × A .

17
Q

Let A, B, and C be sets.

A × (B ∪ C) = ?

A × (B ∩ C) = ?

[proposition]

A

A × (B ∪ C) = (A × B) ∪ (A × C)

and

A × (B ∩ C) = (A × B) ∩ (A × C)

18
Q

A function consists of… (3 points) and is denoted…
[definition / notation]

A
  1. a set A called the domain of the function
  2. a set B called the codomain of the function
  3. a “rule” f that “assigns” to each a ∈ A an element f(a) ∈ B.

We denote such a function f : A → B

19
Q

definition of a function [definition]

A

A function with domain A and codomain B is a subset Γ of A × B such that for each a ∈ A, there is one and only one b ∈ B, such that (a, b) ∈ Γ. If (a, b) ∈ Γ, we write b = f(a).