midterm 2 Flashcards
def of relation
Let A and B be sets. R is a relation from A to B if R is a subset of A x B
identity relation
Ia = {(a,a): a∈A
domain of the relation R from A to B
Dom(R) = {x∈A: ∃y∈B st xRy}
range of the relation R
Rng(R) = {y∈B: ∃x∈A st xRy}
inverse relation
{(y,x): (x,y)∈R}
The composite of two relations R and S
Let R be a relation from A to B and S be a relation from B to C
S o R = {(a,c): ∃b∈B st (a,b)∈R and (b,c)∈S}
(S o R)^-1
R^-1 o S^-1
reflexive
∀x∈A, (x,x)∈R
irreflexive
∀x∈A, (x,x)∉R
transitive
if (x,y), (y,z)∈R, then (x,z)∈R
symmetric
if (x,y)∈R, then (y,x)∈R
antisymmetric
if (x,y),(y,x)∈R, then x=y
comparability property
either (x,y)∈R or (y,x)∈R
equivalence relation
R is reflexive, symmetric, and transitive
partial order
R is reflexive, antisymmetric, and transitive
strict partial order
R is irreflexive, antisymmetric, and transitive
A function from A to B is a relation f from A to B such that…
i) dom(f) =A
ii) if (x,y),(y,z)∈f, then y=z
image of y = f(x)
y is the image of f at x
pre-image of y = f(x)
x is a pre-image of y
two functions are equal iff
i) Dom(f) = Dom(g)
ii) ∀x∈Dom(f), f(x)=g(x)
the composite of functions f and g
g o f = {∃y∈B st (x,y)∈f and (y,z)∈g}
a function f from A to B is onto or surjective if
∀b∈B ∃a∈A st f(a) = b
a function is 1-1 or injective if
if f(x)=f(y), then x=y