![]()
Definition: Let
be a relation and
be a set.
implies the relationship is reflexive.
Definition: Let
be a relation and
be a set.
.The relationship is symmetric.
Definition: Let
be a relation and
be a set.
.The relationship is antisymmetric.
Definition: Let
be a relation and
be a set.
.The relationship is transitive.
If a relation is reflexive, symmetric and transitive then it is called an equivalence relation. If a relation is reflexive, antisymmetric and transitive then it is an order relation.
We now have the elements to define a very common term in mathematics, a function, much more precisely using set theory. A function is a binary (meaning it takes two elements) relation
. We can state this as
. To be sure, this states that
relates
to
. However, to be a function we need to make sure that
can only relate to one element. This means if
and
then
. The unique
is called the value of
at
. This is commonly written
.
From the definition of a set we have derived a definition for an ordered pair which leads to the concept of a cartesian product. A relation is a true statement about a subsection of a cartesian product. We can define a special case which we call a function. We make a final observation that follows from this.
![]()
That is, a function is a relation that is a subset of a cartesian product of sets.
A.D. (David) Everett : “Large streams from little fountains flow,
Tall oaks from little acorns grow.”
