Definitions
-
Cartesian Product of sets A,B A×B={(a,b)∣a∈A,b∈B}
-
Ordered pair (a,b)={{a},{a,b}}
Relation
Let A,B=∅. A relation R:A→B is a non-empty subset of
A×B.
- aRb≡(a,b)∈R
- Domain of R: dom(R)=A
- Codomain of R: codom(R)=B
- Range of R: ran(R)={y∣(x,y)∈R}
- ran(R)⊆B
- Pre-range of R: preran(R)={x∣(x,y)∈R}
- preran(R)⊆A
- R(a)={b∣(a,b)∈R}
Everywhere defined
R is everywhere defined ⟺A=dom(R)=preran(R)
⟺∀a∈A,∃b∈B;(a,b)∈R.
Onto
R is onto ⟺B=codom(R)=ran(R)
⟺∀b∈B∃a∈A(a,b)∈R
Aka. surjection.
Inverse
Inverse of a relation R:
R−1={(b,a)∣(a,b)∈R}
Types of relation
one-many
⟺∃a∈A,∃b1,b2∈B((a,b1),(a,b2)∈R∧b1=b2)
Not one-many
⟺∀a∈A,∀b1,b2∈B((a,b1),(a,b2)∈R⟹b1=b2)
many-one
⟺∃a1,a2∈A,∃b∈B((a1,b),(a2,b)∈R∧a1=a2)
Not many-one
⟺∀a1,a2∈A,∀b∈B((a1,b),(a2,b)∈R⟹a1=a2)
many-many
iff R is one-many and many-one.
one-one
iff R is not one-many and not many-one. Aka. injection.
Bijection
When a relation is onto and one-one.