### Families of sets

A family of sets is simply a set of sets. For example: .

A union of a family of sets consists of all elements of all its elements. . In our example: .

An intersection of a family of sets consists of all elements appearing in every its element. . In our example: .

We can define an ordered pair of elements as . A product of two given sets is the set . Set is usually denoted as .

For a given set , the family consists of all subsets of . E.g. for , we get .

### Relations

A subset is called a relation on . The fact that is usually denoted as . As for any other sets we can consider a union or intersection of two relations. We often also consider some properties of relations. E.g. a relation on is reflexive, if for any , . Notice that giver two reflexive , their intersection is also reflexive, because for all , and , so also .

Given a relation , the set of those elements of which appear on the left side is called its left-side domain, in other words it is the set . Similarly its right-side domain is . Therefore if, for example, , is the left-side domain of the set of natural numbers divisible by is the right-side domain.

The field of a relation is the union of its left- and right-side domains. In the above example the whole set of natural numbers is the field of .

The inverse of a relation is the relation .

### Functions

A relation will be called a function, if for every argument it assigns at most one element (value) from , in other words if:

Sometimes we additionally request that every element of is used:

and then relations which satisfy the first condition but may not satisfy the second are called partial functions. But often (especially when studying mathematical analysis) we ignore the second condition and call all relations satisfying the first condition functions and studying instead their domains.

If is a function and , we write . The set of all functions will be denoted .

E.g. is a function, because if , then .

Meanwhile: is not a function, because .

### One-to-one functions and onto functions

A function is one-to-one (or monomorphism, injection), if different argument always give different values:

A function is onto (or epimorphism, surjection), if every value is used:

A bijection is a function which is both onto and one-to-one.

E.g. function , is not one-to-one, because . It is also not onto, because there does not exist such that .

On the other hand function , is one-to one, because if , then . It is not onto, because there does not exist such that .

Function , is not one-to-one, because . It is onto, since for any , we have .

Function , is one-to-one, because if , then , so . It is also onto, because for any we have . Therefore is a bijection.

### Reverse function

If a function is a bijection, then its reverse relation is also a function, called the reverse function . We can also consider the reverse function for a function, but it will be defined on its image only.

Function is the reverse function of , if and only if and . It is if for all , and for all , .

E.g.: let , . Then , where , .