# Discrete Mathematics/Functions and relations

This article examines the concepts of the *function* and the *relation*.

A * relation* is any association between elements of one set, called the

*or (less formally) the*

**domain***set of inputs*, and another set, called the

*or*

**range***set of outputs*. Some people mistakenly refer to the range as the

*codomain*(range), but as we will see, that really means the

*set of all possible outputs*—even values that the relation does not actually use. (Beware: some authors do not use the term

*codomain*(range), and use the term

*range*instead for this purpose. Those authors use the term

*for what we are calling*

**image***range*. So while it

**is**a mistake to refer to the

*range*or

*image*as the

*codomain*(range), it is

**not necessarily**a mistake to refer to

*codomain*as

*range*.)

For example, if the *domain* is a set Fruits = {apples, oranges, bananas} and the *codomain*(range) is a set Flavors = {sweetness, tartness, bitterness}, the flavors of these fruits form a relation: we might say that apples are related to (or associated with) **both** sweetness and tartness, while oranges are related to tartness only and bananas to sweetness only. (We might disagree somewhat, but that is irrelevant to the topic of this book.) Notice that "bitterness", although it is one of the possible Flavors (codomain)(range), is not really used for any of these relationships; so it is not part of the *range* (or *image*) {sweetness, tartness}.

Another way of looking at this is to say that a relation is a *subset of ordered pairs* drawn from the *set of all possible ordered pairs* (of elements of two other sets, which we normally refer to as the *Cartesian product* of those sets). Formally, R is a relation if

- R ⊆ X × Y = {(x, y) | x ∈ X, y ∈ Y}

for the domain X and codomain(range) Y. The * inverse relation* of R, which is written as R

^{-1}, is what we get when we interchange the X and Y values:

- R
^{-1}= {(y, x) | (x, y) ∈ R}

Using the example above, we can write the relation in set notation: {(apples, sweetness), (apples, tartness), (oranges, tartness), (bananas, sweetness)}. The inverse relation, which we could describe as "fruits of a given flavor", is {(sweetness, apples), (sweetness, bananas), (tartness, apples), (tartness, oranges)}. (Here, as elsewhere, the order of elements in a set has no significance.)

One important kind of relation is the *function*. A * function* is a relation that has

**exactly one output**for every possible input

**in the domain**. (The domain does not necessarily have to include all possible objects of a given type. In fact, we sometimes intentionally use a

*restricted domain*in order to satisfy some desirable property.) The relations discussed above (flavors of fruits and fruits of a given flavor) are

**not**functions: the first has two possible outputs for the input "apples" (sweetness and tartness); and the second has two outputs for both "sweetness" (apples and bananas) and "tartness" (apples and oranges).

The main reason for not allowing multiple outputs with the same input is that it lets us apply the same function to different forms of the same thing without changing their equivalence. That is, if f is a function with a (or b) in its domain, then a = b implies that f(a) = f(b). For example, z - 3 = 5 implies that z = 8 because f(x) = x + 3 is a function defined for all numbers x.

The converse, that f(a) = f(b) implies a = b, is not always true. When it is, there is never more than one *input* x for a certain *output* y = f(x). This is the same as the definition of function, but with the roles of X and Y interchanged; so it means the *inverse relation* f^{-1} **must also** be a function. In general—regardless of whether or not the original relation was a function—the inverse relation will *sometimes* be a function, and sometimes not.

When f and f^{-1} are both functions, they are called * one-to-one*,

*, or*

**injective***. This is one of two very important properties a function f might (or might not) have; the other property is called*

**invertible functions***or*

**onto***, which means, for any y ∈ Y (in the codomain), there is some x ∈ X (in the domain) such that f(x) = y. In other words, a*

**surjective***surjective*function f

*maps onto*every possible output

**at least once**.

A function can be **neither** one-to-one nor onto, **both** one-to-one and onto (in which case it is also called * bijective* or a

*), or just one and not the other. (As an example which is neither, consider f = {(0,2), (1,2)}. It is a function, since there is only one y value for each x value; but there is more than one input x for the output y = 2; and it clearly does not "map onto" all integers.)*

**one-to-one correspondence**## Contents

## Relations[edit]

In the above section dealing with functions and their properties, we noted the important property that all functions must have, namely that if a function does map a value from its domain to its co-domain, it must map this value to only one value in the co-domain.

Writing in set notation, if *a* is some fixed value:

- |{f(x)|x=a}| ∈ {0, 1}

The literal reading of this statement is: the *cardinality* (number of elements) of the set of all values f(x), such that x=a for some fixed value a, is an element of the set {0, 1}. In other words, the number of *outputs* that a function f may have at any fixed *input* a is either zero (in which case it is *undefined* at that input) or one (in which case the output is unique).

However, when we consider the *relation*, we relax this constriction, and so a relation may map one value to more than one other value. In general, a relation is **any** subset of the Cartesian product of its domain and co-domain.

All functions, then, can be considered as relations also.

### Notations[edit]

When we have the property that one value is related to another, we call this relation a *binary relation* and we write it as

- x R y

where R is the relation.

For arrow diagrams and set notations, remember for relations we do not have the restriction that functions do and we can draw an arrow to represent the mappings, and for a set diagram, we need only write all the ordered pairs that the relation does take: again, by example

- f = {(0,0),(1,1),(1,-1),(2,2),(2,-2)}

is a relation and not a function, since both 1 and 2 are mapped to two values, 1 and -1, and 2 and -2 respectively) example let A=2,3,5;B=4,6,9 then A*B=(2,4),(2,6),(2,9),(3,4),(3,6),(3,9),(5,4),(5,6),(5,9) Define a relation R=(2,4),(2,6),(3,6),(3,9) add functions and problems to one another

### Some simple examples[edit]

Let us examine some simple relations.

Say f is defined by

- {(0,0),(1,1),(2,2),(3,3),(1,2),(2,3),(3,1),(2,1),(3,2),(1,3)}

This is a relation (not a function) since we can observe that 1 maps to 2 and 3, for instance.

Less-than, "<", is a relation also. Many numbers can be less than some other fixed number, so it cannot be a function.

### Properties[edit]

When we are looking at relations, we can observe some special properties different relations can have.

#### Reflexive[edit]

A relation is *reflexive* if, we observe that for all values a:

*a*R*a*

In other words, all values are related to themselves.

The relation of equality, "=" is reflexive. Observe that for, say, all numbers a (the domain is **R**):

*a*=*a*

so "=" is reflexive.

In a reflexive relation, we have arrows for all values in the domain pointing back to themselves:

Note that ≤ is also reflexive (a ≤ a for any a in **R**). On the other hand, the relation < is not (a < a is false for any a in **R**).

#### Symmetric[edit]

A relation is *symmetric* if, we observe that for all values of a and b:

*a*R*b*implies*b*R*a*

The relation of equality again is symmetric. If *x*=*y*, we can also write that *y*=*x* also.

In a symmetric relation, for each arrow we have also an opposite arrow, i.e. there is either no arrow between *x* and *y*, or an arrow points from *x* to *y* and an arrow back from *y* to *x*:

Neither ≤ nor < is symmetric (2 ≤ 3 and 2 < 3 but neither 3 ≤ 2 nor 3 < 2 is true).

#### Transitive[edit]

A relation is *transitive* if for all values *a*, *b*, *c*:

*a*R*b*and*b*R*c*implies*a*R*c*

The relation *greater-than* ">" is transitive. If *x* > *y*, and *y* > *z*, then it is true that *x* > *z*. This becomes clearer when we write down what is happening into words. *x* is greater than *y* and *y* is greater than *z*. So *x* is greater than both *y* and *z*.

The relation *is-not-equal* "≠" is not transitive. If *x* ≠ *y* and *y* ≠ *z* then we might have *x* = *z* or *x* ≠ *z* (for example 1 ≠ 2 and 2 ≠ 3 and 1 ≠ 3 but 0 ≠ 1 and 1 ≠ 0 and 0 = 0).

In the arrow diagram, every arrow between two values *a* and *b*, and *b* and *c*, has an arrow going straight from *a* to *c*.

#### Antisymmetric[edit]

A relation is *antisymmetric* if we observe that for all values *a* and *b*:

*a*R*b*and*b*R*a*implies that*a*=*b*

**Notice that antisymmetric is not the same as "not symmetric."**

Take the relation *greater than or equal to*, "≥" If *x* ≥ *y*, and *y* ≥ x, then *y* must be equal to *x*. a relation is anti-symmetric if and only if a∈A, (a,a)∈R

#### Trichotomy[edit]

A relation satisfies *trichotomy* if we observe that for all values *a* and *b* it holds true that: *a*R*b* *or* *b*R*a*

The relation *is-greater-or-equal* satisfies since, given 2 real numbers *a* and *b*, it is true that whether *a* ≥ *b* or *b* ≥ *a* (both if *a* = *b*).

#### Problem set[edit]

Given the above information, determine which relations are reflexive, transitive, symmetric, or antisymmetric on the following - there may be more than one characteristic. (Answers follow.) *x* R *y* if

- x = y
- x < y
- x
^{2}= y^{2} - x ≤ y

##### Answers[edit]

- Symmetric, Reflexive,and Antisymmetric
- Transitive, Antisymmetric
- Symmetric, Reflexive, and Antisymmetric (x
^{2}= y^{2}is just a special case of equality, so all properties that apply to x = y also apply to this case) - Reflexive, and Antisymmetric (and satisfying Trichotomy)

### Equivalence relations[edit]

We have seen that certain common relations such as "=", and congruence (which we will deal with in the next section) obey some of these rules above. The relations we will deal with are very important in discrete mathematics, and are known as *equivalence relations*. They essentially assert some kind of equality notion, or *equivalence*, hence the name.

#### Characteristics of equivalence relations[edit]

For a relation R to be an *equivalence relation*, it must have the following properties, viz. R must be:

- symmetric
- transitive
- reflexive

(A helpful mnemonic, S-T-R)

In the previous problem set you have shown equality, "=", to be reflexive, symmetric, and transitive. So "=" is an equivalence relation.

We denote an equivalence relation, in general, by .

#### Example proof[edit]

Say we are asked to prove that "=" is an equivalence relation. We then proceed to prove each property above in turn (Often, the proof of transitivity is the hardest).

**Reflexive**: Clearly, it is true that*a*=*a*for all values a. Therefore, = is reflexive.**Symmetric**: If*a*=*b*, it is also true that*b*=*a*. Therefore, = is symmetric**Transitive**: If*a*=*b*and*b*=*c*, this says that*a*is the same as*b*which in turn is the same as*c*. So*a*is then the same as*c*, so*a*=*c*, and thus = is transitive.

Thus = is an equivalence relation.

#### Partitions and equivalence classes[edit]

It is true that when we are dealing with relations, we may find that many values are related to one fixed value.

For example, when we look at the quality of *congruence*, which is that given some number *a*, a number congruent to *a* is one that has the same remainder or *modulus* when divided by some number *n*, as *a*, which we write

- a ≡ b (mod n)

and is the same as writing

*b*=*a*+*kn*for some integer k.

(We will look into congruences in further detail later, but a simple examination or understanding of this idea will be interesting in its application to equivalence relations)

For example, 2 ≡ 0 (mod 2), since the remainder on dividing 2 by 2 is in fact 0, as is the remainder on dividing 0 by 2.

We can show that congruence is an equivalence relation (This is left as an exercise, below **Hint** use the equivalent form of congruence as described above).

However, what is more interesting is that we can group all numbers that are equivalent to each other.

With the relation congruence *modulo* 2 (which is using n=2, as above), or more formally:

- x ~ y if and only if x ≡ y (mod 2)

we can group all numbers that are equivalent to each other. Observe:

This first equation above tells us all the *even* numbers are equivalent to each other under ~, and all the *odd* numbers under ~.

We can write this in set notation. However, we have a special notation. We write:

- [0]={0,2,4,...}
- [1]={1,3,5,...}

and we call these two sets *equivalence classes*.

All elements in an equivalence class by definition are equivalent to each other, and thus note that we do not need to include [2], since 2 ~ 0.

We call the act of doing this 'grouping' with respect to some equivalence relation *partitioning* (or further and explicitly *partitioning a set S into equivalence classes under a relation ~*). Above, we have partitioned **Z** into equivalence classes [0] and [1], under the relation of congruence modulo 2.

#### Problem set[edit]

Given the above, answer the following questions on equivalence relations (Answers follow to even numbered questions)

- Prove that congruence is an equivalence relation as before (See hint above).
- Partition {x | 1 ≤ x ≤ 9} into equivalence classes under the equivalence relation

##### Answers[edit]

2. [0]={6}, [1]={1,7}, [2]={2,8}, [3]={3,9}, [4]={4}, [5]={5}

### Partial orders[edit]

We also see that "≥" and "≤" obey some of the rules above. Are these special kinds of relations too, like equivalence relations? Yes, in fact, these relations are specific examples of another special kind of relation which we will describe in this section: the *partial order*.

As the name suggests, this relation gives some kind of ordering to numbers.

#### Characteristics of partial orders[edit]

For a relation R to be a partial order, it must have the following three properties, viz R must be:

- reflexive
- antisymmetric
- transitive

(A helpful mnemonic, R-A-T)

We denote a partial order, in general, by .

**Question:**

- Suppose R is a relation on a set of integers Z then prove that R is a partial order relation on Z iff a=b raise to power r.

#### Example proof[edit]

Say we are asked to prove that "≤" is a partial order. We then proceed to prove each property above in turn (Often, the proof of transitivity is the hardest).

##### Reflexive[edit]

Clearly, it is true that *a* ≤ *a* for all values a. So ≤ is reflexive.

##### Antisymmetric[edit]

If *a* ≤ *b*, and *b* ≤ *a*, then a *must* be equal to *b*. So ≤ is antisymmetric

##### Transitive[edit]

If *a* ≤ *b* and *b* ≤ *c*, this says that *a* is less than *b* and *c*. So *a* is less than *c*, so *a* ≤ *c*, and thus ≤ is transitive.

Thus ≤ is a partial order.

#### Problem set[edit]

Given the above on partial orders, answer the following questions

- Prove that divisibility, |, is a partial order (a | b means that a is a factor of b, i.e., on dividing b by a, no remainder results).
- Prove the following set is a partial order: (
*a*,*b*) (*c*,*d*) implies*ab*≤*cd*for*a*,*b*,*c*,*d*integers ranging from 0 to 5.

##### Answers[edit]

2. Simple proof; Formalization of the proof is an optional exercise.

- Reflexivity: (
*a*,*b*) (*a*,*b*) since*ab*=*ab*. - Antisymmetric: (
*a*,*b*) (*c*,*d*) and (*c*,*d*) (*a*,*b*) since*ab*≤*cd*and*cd*≤*ab*imply*ab*=*cd*. - Transitive: (
*a*,*b*) (*c*,*d*) and (*c*,*d*) (*e*,*f*) implies (*a*,*b*) (*e*,*f*) since*ab*≤*cd*≤*ef*and thus*ab*≤*ef*

#### Posets[edit]

A partial order imparts some kind of "ordering" amongst elements of a set. For example, we only know that 2 ≥ 1 because of the partial ordering ≥.

We call a set A, ordered under a general partial ordering , a *partially ordered set*, or simply just *poset*, and write it (A, ).

##### Terminology[edit]

There is some specific terminology that will help us understand and visualize the partial orders.

When we have a partial order , such that *a* *b*, we write to say that a but *a* ≠ *b*. We say in this instance that a *precedes* b, or *a* is a predecessor of *b*.

If (A, ) is a poset, we say that *a* is an immediate predecessor of *b* (or *a* immediately precedes *b*) if there is no *x* in A such that *a* *x* *b*.

If we have the same poset, and we also have *a* and *b* in A, then we say *a* and *b* are *comparable* if *a* *b* or *b* *a*. Otherwise they are *incomparable*.

#### Hasse diagrams[edit]

*Hasse diagrams* are special diagrams that enable us to visualize the structure of a partial ordering. They use some of the concepts in the previous section to draw the diagram.

A Hasse diagram of the poset (A, ) is constructed by

- placing elements of A as points
- if
*a*and*b*∈ A, and*a*is an immediate predecessor of b, we draw a line from*a*to*b* - if
*a**b*, put the point for*a*lower than the point for*b* - not drawing loops from
*a*to*a*(this is assumed in a partial order because of reflexivity)

### Operations on Relations[edit]

There are some useful operations one can perform on relations, which allow to express some of the above mentioned properties more briefly.

#### Inversion[edit]

Let R be a relation, then its inversion, R^{-1} is defined by

R^{-1} := {(a,b) | (b,a) in R}.

#### Concatenation[edit]

Let R be a relation between the sets A and B, S be a relation between B and C. We can concatenate these relations by defining

R • S := {(a,c) | (a,b) in R and (b,c) in S for some b out of B}

#### Diagonal of a Set[edit]

Let A be a set, then we define the diagonal (D) of A by

D(A) := {(a,a) | a in A}

#### Shorter Notations[edit]

Using above definitions, one can say (lets assume R is a relation between A and B):

R is *transitive* if and only if R • R is a subset of R.

R is *reflexive* if and only if D(A) is a subset of R.

R is *symmetric* if R^{-1} is a subset of R.

R is *antisymmetric* if and only if the intersection of R and R^{-1} is D(A).

R is *asymmetric* if and only if the intersection of D(A) and R is empty.

R is a *function* if and only if R^{-1} • R is a subset of D(B).

In this case it is a function A → B. Let's assume R meets the condition of being a function, then

R is *injective* if R • R^{-1} is a subset of D(A).

R is *surjective* if {b | (a,b) in R} = B.

## Functions[edit]

A function is a relationship between two sets of numbers. We may think of this as a *mapping*; a function *maps* a number in one set to a number in another set. Notice that a function maps values to **one and only one** value. Two values in one set could map to one value, but one value **must never** map to two values: that would be a relation, *not* a function.

For example, if we write (define) a function as:

then we say:

- 'f of x equals x squared'

and we have

and so on.

This function f maps numbers to their squares.

### Range, image, codomain[edit]

If D is a set, we can say

which forms a new set, called the *range* of f. D is called the *domain* of f, and represents all values that f takes.

In general, the range of f is usually a subset of a larger set. This set is known as the *codomain* of a function. For example, with the function f(*x*)=cos *x*, the range of f is [-1,1], **but** the codomain is the set of real numbers.

### Notations[edit]

When we have a function f, with domain D and range R, we write:

If we say that, for instance, *x* is mapped to *x*^{2}, we also can add

Notice that we can have a function that maps a point (*x*,*y*) to a real number, or some other function of two variables -- we have a set of ordered pairs as the domain. Recall from set theory that this is defined by the *Cartesian product* - if we wish to represent a set of all real-valued ordered pairs we can take the Cartesian product of the real numbers with itself to obtain

- .

When we have a set of *n*-tuples as part of the domain, we say that the function is *n*-ary (for numbers *n*=1,2 we say unary, and binary respectively).

### Other function notation[edit]

Functions can be written as above, but we can also write them in two other ways. One way is to use an arrow diagram to represent the mappings between each element. We write the elements from the domain on one side, and the elements from the range on the other, and we draw arrows to show that an element from the domain is mapped to the range.

For example, for the function f(*x*)=*x*^{3}, the arrow diagram for the domain {1,2,3} would be:

Another way is to use set notation. If f(*x*)=*y*, we can write the function in terms of its mappings. This idea is best to show in an example.

Let us take the domain D={1,2,3}, and f(*x*)=*x*^{2}. Then, the range of f will be R={f(1),f(2),f(3)}={1,4,9}. Taking the Cartesian product of D and R we obtain F={(1,1),(2,4),(3,9)}.

So using set notation, a function can be expressed as the Cartesian product of its domain and range.

f(x)

This function is called *f*, and it takes a *variable* *x*. We substitute some value for *x* to get the second value, which is what the function maps x to.

### Types of functions[edit]

Functions can either be * one to one (injective), onto (surjective), or bijective*.

*INJECTIVE Functions* are functions in which every element in the domain maps into a unique elements in the codomain.

*SURJECTIVE Functions* are functions in which every elements in the codomain is mapped by an element in the domain.

__'BIJECTIVE' Functions__ are functions that are both injective and surjective.

---onto functions a function f form A to B is onto , Previous topic: **Functions and relations** | Contents:Discrete Mathematics | Next topic: Number theory