Relations Flashcards

1
Q

What is the cartesian product of A={1,2,3} and B={4,5,6}

A

AxB = {(a,b)|a in A, b in B}
AxB={(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)}

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

What are the different ways to find R^n? (a path of length n in R from a to g)

A
  1. Draw digraph D_R Find all paths of length n
  2. Use matrix multiplication to compute M_{R^n} = M_R * M_R … M_R (repeat matrix n times)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

for a function f: A -> B
if dom(f) = A, then the function is…

A

defined everywhere / total

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

For a function f: A -> B if ran(f) = B then the function is…

A

surjective or onto

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

For a function f: A -> B if for x_1 not equal to x_2 it holds that f(x_1) not equal to f(x_2), then the function is…

A

Injective or one-to-one

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

If f is total, surjective, and injective then it is called

A

Bijective (f can also be called a bijection)

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

A relation R on A is reflexive if

A

for all a there exist (a, a) in R

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

A relation R on A is symmetric if

A

for all a,g there exist (a,g) in A and (g, a) in R

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

A relation R on A is antisymmetric if

A

for all a,g there exist (a,g) in A and (g, a) in R but a = g

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

if a matrix representation contains a diagonal of all 1s this means

A

The relation is reflexive

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

if a matrix represetation is symmetric ((M_R)^T = M_R) this means

A

A representation is symmetric

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

if for all a,g,c in A there exist (a,g) in R and (g,c) in R there exist (a,c) in R. This means that the relation is

A

Transitive

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

A relation R on A is an equivalence relation if

A

it is reflexive, symmetric, and transitive

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

what is a partition

A

a collection of subsets p1,p2,p3,…,pk
such that
for all i in [k], pi is not equal to Ø
for all i,j in [k], i not equal to j, the the intersection of pi and pj = Ø

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

let A = {1,2,3,4,5,6,7}
p1 = {1,4,7}
p2 = {2,5}
p3 = {3,6}
p4 = {2,3,5,7}
Does this collection of subsets have any partitions?

A

{p1,p2,p3} is the only partition

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