Rough automatic draft, low quality: expect mistakes and awkward wording. It will be replaced by a better translation. Original →
27
running_head:
folio:
A. N. KOLMOGOROV
This article declares modern
general understanding of the word “function”.
The article is not for easy reading:
it requires the reader to pay attention to every word,
although it does not require any special knowledge,
beyond high school.
This also means
that readers know how to handle words
“set” and “element of set”.
- INTRODUCTION
To the question “What is a function?” Schoolchildren often answer: “A function can be specified by a table, graph or formula.” It is clear that this is not certain. But schoolchildren who shy away from formulating an explicit definition and immediately move on to describing how functions are written are not entirely wrong. Mathematics cannot begin with definitions. When I formulate the definition of a certain concept, we inevitably use some other concepts in this very definition. Until we understand the meaning of any concepts, we will not get anywhere and will not be able to formulate a single definition. Therefore, the presentation of any mathematical theory begins with the fact that some basic concepts are accepted without definition. Using them, it is already possible to formulate the definition of further arbitrary concepts.
How do people communicate to each other their understanding of the meaning of basic concepts? There is no other way for this than clarification with examples and with the help of a detailed description of the characteristics of the properties of the things being defined. These descriptions may not be entirely clear in detail and may not be exhaustive at first. But gradually from them the meaning of the concept emerges with sufficient clarity. This is how we approach the concept of function, considering it one of the basic mathematical concepts that are not subject to formal definition.
[True, it will be said later that a function is nothing more than a mapping of one set onto another (the domain of definition of a function onto the set of its values). But here the word display is simply a synonym for the word function. These are two names for the same concept. The explanation of one word by another equally significant cannot replace the definition of the concept it expresses.]
28
Example 1. We will assume that the letters and stand for real numbers. The sign will be considered a sign for extracting the argument of the square root. Equality
indicates that the conditions are met
Points whose coordinates satisfy these conditions form a semicircle, depicted by the red line at Fig. 1.

Figure 1 makes clear the following facts, which you can prove purely algebraically:
- formula (1) allows for any satisfying the conditions
calculate the corresponding , which satisfies inequality (4), corresponds to at least one such , which according to formula (1) corresponds to this given .
We can say that formula (1) specifies a mapping from the set of numbers satisfying inequalities (3) to the set of numbers satisfying inequalities (4). Mathematicians often (especially recently) use an arrow to denote mappings. The mapping we are interested in can be written using an arrow like this:
For example:
Note: the mapping is fully specified if
a) given the set , which is displayed,
b) for each element of this set there is given an element on which element is mapped.
Fig. 1.
Fig. 2.
29
The set of all values of is denoted by the letter . In example 1, is the set of numbers satisfying condition (3), and is the set of numbers satisfying condition (4) *).
Example 2. Rules
- ,
define the same mapping
(7)
real numbers on their model (absolute values) (Fig. 2).
Mapping (7) displays the set of all real numbers
for many
non-negative real numbers.
Instead of the word mapping, you can say function and write mapping (5) like this:
(8)
and display (7) is like this:
(9)
The partial values of function (8), listed in formulas (6), will then be written in the following form:
The domain of function (9) is the set of all real numbers . The set of its values is the set of non-negative real numbers.
Example 3. Petya, Kolya, Sasha and Volodya live in a dorm room. For February they set the following activity schedule:
| | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | . . . | 28 |
| :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— | :— |
| Petya | ■ | | | | ■ | | | | ■ | | | | ■ | | . . . | |
| Kolya | ■ | | | | ■ | | | | ■ | | | | | | . . . | |
| Sasha | ■ | | | | ■ | | | | ■ | | | | | | . . . | |
| Volodya | ■ | | | ■ | | | | ■ | | | | | | | . . . | |
*) A set can be denoted by any letter. Here we take the letters (from the French word ensemble - set) and (German - Menge; by chance the Russian word “set” begins with the same letter). But this is not necessary: in the next example we will denote the set of real numbers, as is customary, by the letter (French gel - real, real).
30
The similarity of this table with the graphs of functions familiar to you from the school algebra course is immediately striking. Does this analogy make precise logical sense? Have the boys here established a mapping from one set to another, that is, have they defined some function? And didn’t they draw a graph of this function? (Pay attention to the everyday expression “established the graph of the function”!)
- GENERAL CONCEPT OF FUNCTION
It is easy to see that in example 3 a certain duty officer is assigned for each of the 28 days of February. In other words, many days in February are reflected in many boys, sharing duty among themselves. We can agree that the letter x stands for any day in February, and y=f(x) stands for the person on duty on day x. There is no reason to refuse display
day x→y = duty officer for day x
in the right to call it a function and write this mapping like this:
y=f(x).
We will call any mapping f a set E onto a set M a function with a domain of definition E and a set of values M.
Don’t forget that when we talk about mapping f from set E to set M, we mean that y=f(x) is defined for any x from E and
Mapping E to M
Mapping E to M
only for x from this set, and the value y of the function f necessarily belongs to the set M, and each y from this set M is the value of the function f for at least one value of the argument x.
If it is known only that the values of functions f necessarily belong to the set M, but it is not stated that every element of this set is the value of the function f, then we say that the function maps its domain of definition E into the set M or that the mapping f is a mapping of the set E into the set M.
Thus, it is necessary to strictly distinguish the meaning of the expressions
“mapping to set M”
“mapping to set M”*).
*) Note also that every mapping “on” can also be called a mapping “in”, but not vice versa.
31
For example, about the image
we can say that it is the map of to , but we cannot say that it is the “map of to ”.
From a purely logical point of view, the simplest case is the case when the domain of definition of the functions is finite. It is clear that a function whose domain consists of elements cannot take more than different values. Thus, functions defined on finite sets carry out mappings of finite sets onto finite sets. Such images are one of the subjects of studying an important part of mathematics - compinatorics (see problems 8, 11, 18, 19).
Example 4. Consider functions whose domains of definition are many
of two letters and and whose values belong to the same set, i.e., images of the set into itself.
There are only four such functions. Let’s assign them to tables in the following way:
| | | | | |
| :— | :— | :— | :— | :— |
| | | | | |
| | | | | |
The functions and are constants, that is, constants: the set of values of each of these functions consists of one single element.
The functions and map the set onto itself. The function can be given by the formula
This is an image concept: each element of the set is processed in itself.
To complete the clarification of the meaning of the very concept of “function”, it remains to pay attention to the fact that the choice of letters to denote an “independent variable”, i.e. an arbitrary element of processing, and a “dependent variable”, i.e. an arbitrary element of a set of values, perfect non-existence. Posts
define the same function , which processes a non-negative number into the arithmetic square root of it. Use any of these entries, we will get
etc.
32
- REVERSIBLE FUNCTION
Function
called reversible), if each value it takes one -
the only time. These are the functions and from example 4. The functions
and of Example 4 and the functions of Examples 1, 2 and 3 are inorganic.
To prove that any function is irreversible, it is enough to indicate
take any two values of the argument for which
In example 3, it is enough to note that Petya is on duty both on the 1st and on the 5th
February. Therefore, the function of example 3 is irreversible.
Example 5. Function
reversible. It is defined on the set of non-negative numbers. Multi-
the gesture of its meanings is the multitude
all non-positive numbers. Given any from the set , one can find
corresponding to by the formula .
Function
at
There are functions inverse to the function . It maps the set to the set . As already mentioned, there is no choice of letters to denote the independent and dependent variable. The functions and can be written as
for , for .
figure 3 shows the graphs of mutually inverse functions and .

Fig. 3.
Fig. 4.
*) The origin of the name will become clear later: a function is invertible if for it
there is an inverse function.
33
Example 6. Function given by table
is defined by the set of the first five letters of the Russian alphabet, and the set of its values is the set of the first five natural numbers. The inverse function is given by the table
figure 4 shows the graphs of these functions.
Let us give precise definitions. Let be a mapping from the set to the set . If for any element from the set there is one and only element
set for which
then the mapping is inverse, and
is called the inverse mapping to the mapping .
Reversible mapping of to
Reversible mapping of to
Thus, the invertibility of the mapping means that it has an inverse mapping . The inverse of is usually denoted by . For example, if
That
Since the word “function” is simply a synonym for the word “mapping,” we have thereby defined the meaning of the expression “inverse function.”
*) Such mappings are also called one-to-one mappings onto .
34
Try to repeat what was said above yourself, using the words “mapping” together with the word “function”.
It is clear that the domain of the inverse function is the set of values of the function , and the set of values is the domain of the function .
The inverse function of the inverse function is the original function :
Thus, the functions and are always mutually inverse.
Example 7. There are functions that are their own inverse. Such functions
a)
b)
b) .
Check it out! The graphs of these functions are given on figure 5. Note that all these graphs are symmetrical with respect to the bisector of the first and third squares, i.e. the line .
Let us schematically depict the correspondences between different types of mappings from the set to the set and to the set .
Let us recall once again that the most general concept is the concept of the mapping to . If with such a mapping the image coincides with , we speak of a mapping onto .
35
Invertible mappings are also called one-to-one mappings. You will often come across this term in books. But it is not customary to talk about “one-to-one functions.” Since we consider the words “function” and “mapping” to be synonymous, together with the words “one-to-one” we have chosen to use the words “mapped function” or, which is the same thing, “mapped mapping”.
Recently, French terminology has become widespread in our literature:
- the mapping of to is called “surjective” or “surjective” by the French;
- the mappings to are called “injective” or “injections”;
- mapped mappings onto are called “bijective” or “bijections” in French terminology.
Please note that with a visiting attitude to the use of the prepositions “in” and “on” such general terms are unnecessary.
3 ADACS
Very easy questions are marked with a zero, by answering which you can check whether you understood what was written in the status. More difficult tasks are marked with an asterisk. It is not necessary to solve them all.
- Introduction
1.0. Find the domains and set of values of the following functions:
a) , 6) .
- The integer part of the number is the most integer number not exceeding . The whole part represents . For example,
The difference is called the fractional part of the number and denotes . Plot graphs of the following functions and find their domains and sets of values:
a) , 6) , b) , r) ,
3*. For any natural number we define as the sum of the divisors of the number (not counting itself). For example,
Prove that does not take the values 2 and 5.
- Function
4.0. Two wholes ( and ) can share two rooms in four ways:
How many ways can you accommodate: a) two wholes in three rooms, b) three wholes in two rooms, b) three wholes in two rooms so that none of the rooms is left unoccupied?
36
-
The set consists of three elements, and the set consists of two elements. How many mappings are there: a) mappings to , b) mappings to , c) mappings to , d) mappings to ?
-
How many seven-digit phone numbers are there? Which number is formed only by the numbers 0, 1, 2 and 3?
-
Prove that there are more than a million functions that take only two values, 0 and 1, and are defined on the set of the first twenty natural numbers.
-
The set consists of elements, and the set consists of elements. How many functions are there defined on the set with values taking ?
Let us also note that Tasks 8, 11, 18, 19 are considered among the main problems of combinatorics. We present them here to show that combinatorics has a significant connection with parts and is concerned with counting the number of mappings of one or another type of finite sets into finite sets.
-
How many ways can you seat: a) two guests on two chairs, b) three on three chairs, c) six on six chairs?
-
The set consists of six elements. Show that there are exactly 720 functions for which is both the domain and the set of values.
-
The mapping of a finite set onto itself is called a substrange one. The number of different permutations of a set depends only on the number of its elements and is denoted . Show that
Indicate a general method for calculating !
- Inverse function
12.0. Which of the following functions are inverse and which are not inverse?
-
In the class, no more than two people sit behind each pair. Let us assign each student his desk neighbor, and if he is sitting alone, then himself. What will be the return?
-
Let each word of the Russian language be given a corresponding word, written with the same letters, but in reverse order (a word is a sequence of letters). Is this function inverse? If yes, what is the inverse function?
-
A mapping of a finite set onto itself is always invertible. Give an example of a non-inverse mapping of a set of natural numbers onto itself.
-
Nine tourists must be accommodated in three boats. In how many ways can they do this if it is required that a) there are three people in each boat, b) there are no more than four and no less than two people in each boat, b) there is at least one tourist in each boat? (Boats have numbers: No. 1, No. 2, No. 3.)
17*. If the hosts have students, then it is not customary to say for one student one guest: many guests are reflected in many students in the opposite way. If there are only six students in the room, in how many ways can you seat them: a) one guest, b) two guests, c) four, d) heels, e) six guests?
18*. The inverse mappings of one finite set into another finite set are called placement (guests are “placed” on chairs). The number of mappings of the set into the set depends only on the number of elements of the set and the number of elements of the set and is denoted . Show that
and the general rule for calculating is established. Show that it is always .
19*. Task 16c can be formed abstractly: how many mappings are there of a set of ninth elements onto a set of three elements. Let denote the number of mappings of a set of elements onto a set of elements. Check that
Try the general rule for calculating (this is a slightly more difficult problem than problems 8, 11 and 18).
20*. How many functions are there, defined on a set of 28 elements, that take each of the four values P, K, C and B six times?
This is a problem about the number of ways to fairly distribute duty in February between Petya, Kolya, Sasha and Volodya (example 3 on page 29).