1. Introduction
The exact values of approximation characteristics are especially valued in the theory of function approximation. Finding the exact values of approximation characteristics even for functions and classes of functions of one variable is a rare phenomenon. The exact values of approximation characteristics in the theory of approximation of functions and classes of functions of many variables being
-periodic in each variable, except the result of the work [
1], are unknown.
In the theory of function approximation, as in other branches of mathematics, it is difficult to formulate the problem and attract the attention of specialists to it. The problem of finding the exact values of approximation characteristics for functions and classes of functions of many variables remains relevant. The exact values of approximation characteristics even for the simplest classes of functions of many variables have not been found. Forty years ago, the famous Ukrainian mathematician Oleksandr Stepanets called its solution the problem of the twenty-first century.
Let
,
be the classes of functions
and
that are
-periodic in the variable
x and the variables
, for which the following conditions hold, respectively:
Let
be the best approximation of the function
by the trigonometric polynomials
of the degree
, where
C is the space of
-periodic continuous functions with the uniform norm
.
Let
be the best approximation of the function
by the trigonometric polynomials
of the degree
in the variable
x and the degree
in the variable
y in the uniform metric.
Let
be the Favard kernel, and
be Favard sums of the degree
and double rectangular Favard sums of the degree
in the variable
x and the degree
in the variable
y, respectively.
Favard proved in 1936 that
i.e., the Favard method implements the exact upper bound of the best approximations on the class
. In the work [
1], the exact value of approximations of classes
by Favard sums was found, namely, for
where
is the sum of permutations in descending order of the functions
(for definition of the permutation, see, e.g., [
2] (p. 130)).
2. Main Result
Theorem 1. For any natural numbers n and , it is asserted that Theorem 1 was formulated without proof in [
3]. We should note that the exact value of
, as well as the best linear approximation method reflecting the class
into the space of all trigonometric polynomials
of the degree at most
in the variable
x and
in the variable
y are unknown. However, it was found that
. According to the result of J. Mairhuber [
4], the polynomial of the best approximation
for the function
is not unique, which makes it difficult to find this polynomial.
Let us denote by
and
the classes of functions
and
defined on the segment
and the rectangle
satisfying conditions (
1). The summable function
if almost everywhere on
, almost everywhere on
and
Let
,
and
,
be the functions defined by the equalities
and
and
be the inverse functions to
and
.
M.P. Korneichuk [
2] (pp. 190–198) for the class
and O.I. Stepanets [
5] (p. 52) for the class
proved the following statements.
Lemma K [
2]
. The following equalities holdIn this case, the upper bound in (3) is implemented by functions from the class of the form , where K is arbitrary constant. Lemma S [
5]
. The following equalities holdand the exact upper bound in (4) is realized by the function specified in this lemma (see [5] (pp. 52–54)). Let us denote by
,
,
the arbitrary extremal functions from the classes
,
,
implementing exact upper bounds in (
2)–(
4), respectively, i.e., such that
Let us prove that all extremal functions
realizing the exact upper bound in (
2) have the same oscillations equal to
. To do this, we have to establish that if two arbitrary extremal functions realizing the exact upper bound in (
4) coincide on one of the larger sides of
P, then they coincide on the entire rectangle and have the same oscillations. The proof of the last statement is based on the description of the set of all extremal functions that realize the exact upper bound in (
3).
Lemma 1. The set of all extremal functions realizing the exact upper bound in (3) is the set of functions of the form , where K is an arbitrary constant. Proof. If for the arbitrary extremal function almost everywhere on
, then due to the absolute continuity of all functions of the class
(see [
5] (pp. 15–16)),
.
Let us prove that almost everywhere on
. To do this, we have to establish that any extremal function
satisfies the equalities
or
for
and almost everywhere on
Since
is absolutely continuous on
, and therefore, differentiable almost everywhere on
(see [
6] (p. 229)),
is absolutely continuous on
(see [
5] (p. 19)) and
, then
is differentiable almost everywhere on
. From (
5) and (
6) we then get that almost everywhere on
or
Using (
7)–(
9), we have almost everywhere on
or
. Let us prove that
satisfies equalities (
5) and (
6). If
is an extremal function, then, performing transformations such as in the proof of Theorem 3.1 (see [
5] (p. 20)), we obtain
Without loss of generality, we may assume that
almost everywhere on
. It then follows from (
10) that
or
Since
and
for
, then
, whence
for
. From (
11), due to the non-negativity and summability of functions
(see [
6] (Theorem 6, p. 131)), it follows that equalities (
5) and (
6) are valid almost everywhere on
. Since these functions are continuous, equalities (
5) and (
6) are valid for
.
Let us prove that
satisfies the relation (
7). Since
, then for
, using (
5) and (
6), we have
As a result of the continuity of
, for
the sign of
coincides with the sign of
. Therefore, from (
12) it follows
or
Using (
13) and (
14) we have
or
Therefore, due to the differentiability of the function , we obtain that almost everywhere on . In a similar way, we prove that almost everywhere on . Lemma 1 has been proved. □
Corollary 1. Let be the function that is summable and sign-preserving almost everywhere on . Thenwhere , are the same functions as in Lemma K. Moreover, the set of all extremal functions realizing the exact upper bound in (15) has the set of functions of the formwhere is the arbitrary function from the class . Proof. The relation (
15) was proved in [
5] (Lemma 5.1, p. 54). Just as it was done in the proof of Lemma 5.1, using Lemma 1 and the fact that
for the arbitrary function
, we get that
where
. The corollary has been proved. □
Let
be the set of all extremal functions for the Favard method on the class
. The following statement is then true.
Theorem 2. The set is the set of functions of the formwhere is the -periodic even function, for , and C are arbitrary constants. Proof. We can prove that
where
H is the subset of even functions
from the class
such that
Moreover, the arbitrary extremal function
can be obtained from the arbitrary extremal function
by shifting its graph parallel to the
- and
-axes, i.e.,
Let us prove that the extremal function
is unique up to a sign. It is clear that
Since
on
and
, then
Since (see [
7])
then applying Lemma K for each segment
we get
From (
16)–(
18), due to the continuity of the extremal function
, it follows that
is
-periodic even function,
for
and
We assume that there is another extremal function
. Then
From (
16)–(
19) it follows
In the inequality (
21), the equal sign is possible only if
for
.
Since
is the extremal function of Lemma K on each segment
, then by Lemma 1 the equal sign in (
22) is possible only if
for
. In order to justify the equal sign present in (
20), it must take place in (
21) and (
22). Therefore, due to the continuity of functions
and
, the equality
holds on
and
. As a result of the parity and
-periodicity of these functions, the equality
holds on the entire real axis.
Therefore, is the unique extremal function from the class H up to a sign. The theorem has been proved. □
In a similar way, we can describe the set of all extremal functions for the arbitrary linear approximation method
where
is the kernel of the method (approximation properties of linear methods studied, for example, in [
8,
9,
10,
11]). Since any trigonometric polynomial of the order
has at most
roots on
(see, e.g., [
12] (p. 214)), then the function
can have at most
n roots on
. Let
have exactly
m roots
on
,
, and the function
is such that
i.e., it is the arbitrary extremal function for the
on the class
. Then, analogously to the proof of Theorem 2, we can prove the following statement.
Theorem 3. The set of all extremal functions for the method on the class is the set of functions of the formwhere and K are arbitrary constants and is the even -periodic continuous function such that for and for , i.e., Let be the set of all extremal functions realizing the exact upper bound of the best approximations on the class .
Theorem 4. The set and for each function from these sets the best approximation polynomials are constants.
Proof. According to Theorem 2 and the Chebyshev criterion (see, e.g., [
2] (p. 46)), for any function
it follows that
These relations imply that for any function
the polynomials of the best approximation are constants and
. For any function
, it follows that
where
is the best approximation polynomial of the degree
of the function
. This means that
, i.e.,
. So
. Taking into account that
, the theorem has been proved. □
Corollary 2. If and is the polynomial of the best approximation of the function then .
Proof. For each function the inequality is true. If , then using Theorem 4 we get that contradicts the condition of the Corollary 2. The corollary has been proved. □
Corollary 3. If the approximation method is different from the Favard method, i.e., , thenMoreover, the set of all extremal functions for the method on the class does not intersect with the set of extremal functions for the Favard method on this class. Proof. If
then
where
is the
-periodic Bernoulli function (see, e.g., [
2] (pp. 109–111)). Since the function
belongs to the class
and the Bernoulli kernel
has a unique polynomial of the best approximation in the metric
L (see, for example, [
2] (p. 59–69)), we prove that the Favard method presents the unique best approximation method on the class
Therefore, the relations (
23) hold.
Let the extremal function
for the method
belong to the set
. So, according to Theorem 2 we have
and as a result of the
-periodicity of the function
(see, e.g., [
2] (p. 61)) we get
Then
that contradicts the fact proved above. The corollary has been proved. □
Lemma 2. Let be an arbitrary extremal function of Lemma S, be the oscillation of the function on P, and such that Then Moreover, if two arbitrary extremal functions coincide on one of the larger sides of the rectangle P, then they coincide over the entire rectangle.
Proof. Without loss of generality, we may assume that
almost everywhere on
and
almost everywhere on
,
almost everywhere on
and
almost everywhere on
. Let us break
P into sets
:
Let us prove that the arbitrary extremal function
satisfies the relations:
Here,
if
for each fixed
x,
if
for each fixed
if
for each fixed
y and
if
for each fixed
y. Applying the same transformations as in the proof of Lemma S and Lemma 1, we establish that the arbitrary extremal function
on
satisfies the equality
This equality is equivalent to equalities:
Substituting
and
in (
28), we get
if
because
maps to
after the replacement. Therefore, on
the extremal function
for each fixed
satisfies the equalities
if
,
if
.
Thinking in the same way as in the proof of Lemma 1 and Corollary 1, we conclude that the arbitrary extremal function
on
satisfies relation (
24). Similarly, using (
29)–(
31), we prove that equalities (
25)–(
27) hold, respectively. Taking into account the definiteness of the extremal function on each of the sets
and its continuity, we write it on the sides of the rectangle:
where
Let
. Let us prove that
for
.
Since
and
then, taking into account that
, we get
Similarly, we can prove that
If
, then
. Indeed,
Taking into account relation (
32) for the function
, we get
Since the function
belongs to the class
, we then get
hence
If
then, taking into account definition (
32) of the extremal function
and the fact that
belongs to the class
, we get
From relations (
34), (
36) and (
37), it follows that
If
then similarly we prove that
If
then we prove that
Let
. Then, according to the definitions of the function
and the sets
,
, we get
,
and
. According to (
32)
. This is why
Let
. So,
and
. Therefore, we prove that
Relations (
38)–(
43) imply equality (
33). Taking into account the definition (
32) of functions
and
from (
33), we obtain
The points where the extreme values of the function
(extreme points) are reached, lie on one of the larger sides of the rectangle or on both sides. If the extremal points lie on one of the larger sides of the rectangle, then, given the definition of the extremal function on the larger sides and the fact that functions
and
belong to the class
we conclude that
If the extreme points lie on both larger sides, then (
32) implies that
or
From (
44) and (
45), it follows that
Let
and
be arbitrary extremal functions coinciding on one of the larger sides of the rectangle
P, i.e.,
, or
. Then
where
,
and
,
,
,
.
Taking into account the definition of the extremal function on and on and the fact that , we get on and . On the set , and . Let be the line separating the sets and , i.e., for . Since is continuous on , then, taking into account the definition of the extremal function on and , we get: and . Since , then and by . We prove, similarly, that on . So, on the entire rectangle P. The lemma has been proved. □
Lemma 3. The set of all extremal functions for the Favard method on the class is the set of functions given by relationswhere is the extremal function constructed in [1], are arbitrary constants. Proof. Here
is the
-periodic even function,
for
,
is the even,
-periodic function,
for
and
such that
i.e.,
are the extremal functions of Lemma S for the class
on the rectangles
,
are constants, which are chosen so that
is continuous on
,
is the function that guarantees the continuity of
on the line
if
. We can prove that
where
is the subset of functions from the class
that are even in each of the variables, such that
Moreover, if
is such that
i.e., the arbitrary extremal function from the class
then
Let us prove that the extremal function
is unique and coincides with
. We suppose that there exists another extremal function
different from
Then
Taking into account that
belongs to the class
and its construction, similarly as it was done in Theorem 2, we get:
It follows from (
46) that inequalities (
47)–(
50) must contain the equal sign. In (
47) there is the equal sign only if
on
. The equal sign in (
48), according to Corollary 1, is possible if and only if
on
. Similarly, in (
49) the equal sign is possible if and only if
on
. The equal sign in (
50) is possible if and only if
is the extremal function of Lemma S for the class
on each rectangle
. For
but, on the other hand,
, because
on
As a result of the continuity of the function
we have
.
We prove similarly that
Therefore, on
we obtain
We prove similarly that on
Since
and
are the extremal functions of Lemma S for the class
on each rectangle
and coincide on the larger side
of the rectangle, then according to Lemma 2 they coincide on all rectangles
. We prove similarly that
on
. So, on
we have
From (
51)–(
53), taking into account the parity and
-periodicity in both variables of functions
and
we get that
on the whole plane
. Thus, our assumption is wrong. Therefore,
is the unique extremal function from the class
Since any extremal function
has the form
and
, then
The lemma has been proved. □
Proof of Theorem 1. Let us prove that there exists the function
, realizing the exact upper bound of the best approximation on the class
, i.e.,
. Since
, then
, where
is the subset of functions from the class
that are equal to 0 at the origin. Let us prove that
is the compact set in the metric space of
-periodic functions in each of the variables. If
then
. This implies that the set
is bounded and (see, for example, [
13] (pp. 123–125)) compact. The best approximation functional
is known to be continuous (see, for example, [
2] (p. 17)). Since
is the continuous functional and the set
is compact, then there exists the function
on which the functional
reaches its exact upper bound, i.e.,
. Let us assume that
. Since
then
Here,
is the polynomial of the best approximation of the function
of the degree
in the variable
x and the degree
in the variable
y in the uniform metric. It follows from relation (
54) that the function
belongs to the set of extremal functions for the Favard method on the class
, i.e.,
Since
, from relation (
55) we get
. Since
, and as a result (
2)
, then our assumption is wrong. Hence, the statement of Theorem 1 is true. □
Let us denote by
as the subset of the functions from the class
that can be represented as a sum of two functions, each of which depends on only one variable. It follows from the definition of the class
that
Theorem 1 (see, for example, [
14]) implies the following statement.
Lemma 4. If the functions and are continuous -periodic in the variables x and and , are the polynomials of the best approximation of these functions, then and is the unique polynomial of the best approximation for the function .
Using Lemmas 4 and (
56), we prove the relation
From the last relation and the equality
the following statement follows.
Theorem 5. For any natural numbers n and mthat is, the Favard method implements the exact upper bound of the best approximations on the class