Set Definitions Flashcards

1
Q

The 3 ways to write ∃!xP(x)

A

∃x (P(x) ∧ ∀y (P(y) → y = x) )

∃x ∀y (P(y) ↔ y = x)

∃x P(x) ∧ ∀y ∀z ( (P(y) ∧ P(z) ) → y = z)

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

A⊆B

A

∀x (x ∈ A → x ∈ B)

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

℘(A)

A

{x | x ⊆ A}

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

A×B

A

{(a,b) | a ∈ A ∧ b ∈ B}

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

Relation

A

R ⊆ A×B

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

∩F

A

{x | ∀A (A ∈ F → x ∈ A)}

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

∪F

A

{x | ∃A (A ∈ F ∧ x ∈ A)}

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

Dom(R)

A

{a ∈ A | ∃b ∈ B ( (a,b) ∈ R)}

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

Ran(R)

A

{b ∈ B | ∃a ∈ A ( (a,b) ∈ R)}

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

R-1

A

{(b,a) ∈ B×A | (a,b) ∈ R}

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

SoR

A

{(a,c) ∈ A×C | ∃b ∈ B ( (a,b) ∈ R ∧ (b,c) ∈ S)}

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

Reflexive

A

∀x ∈ A (xRx)

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

Symmetric

A

∀x ∈ A ∀y ∈ A (xRy → yRx)

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

Transitive

A

∀x ∈ A ∀y ∈ A ∀z ∈ A ( (xRy ∧ yRx) → xRz)

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

Antisymmetric

A

∀x ∈ A ∀y ∈ A ( (xRy ∧ yRx) → x = y)

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

Partial Order

A

Reflexive

Transitive

Antisymmetric

17
Q

Total Order

A

Partial Order

∀x ∈ A ∀y ∈ A (xRy ∨ yRx)

18
Q

R-smallest

A

∀x ∈ B (bRx)

19
Q

R-largest

A

∀x ∈ B (xRb)

20
Q

R-minimal

A

¬∃x ∈ B (xRb ∧ x ≠ b)

21
Q

R-maximal

A

¬∃x ∈ B (bRx ∧ x ≠ b)

22
Q

Equivalence Relation

A

Reflexive

Symmetric

Transitive

23
Q

Pairwise Disjoint

A

∀X ∈ F ∀Y ∈ F (X ≠ Y → X∩Y = ∅)

24
Q

Partition

A

∪F = A

Pairwise Disjoint (∀X ∈ F ∀Y ∈ F (X ≠ Y → X∩Y = ∅))

∀X ∈ F (x ≠ ∅)

25
Q

Equivalence Class

A

[x]R = {y ∈ A | yRx}

26
Q

A/R

A

{[x]R | x ∈ A}

27
Q

x is congruent to y (mod m)

(modulo)

A

∃k ∈ Z (x - y = km)

28
Q

f: A → B

A

∀a ∈ A ∃!b ∈ B ( (a,b) ∈ f)

29
Q

f: A → B is one-to-one.

A

¬∃a1 ∈ A ∃a2 ∈ A ( f(a1) = f(a2) ∧ a1 ≠ a2)