Next Article in Journal
Starlike Functions Associated with Bernoulli’s Numbers of Second Kind
Next Article in Special Issue
Theory of Functions and Applications
Previous Article in Journal
Efficiency of Some Predictor–Corrector Methods with Fourth-Order Compact Scheme for a System of Free Boundary Options
Previous Article in Special Issue
Joint Discrete Universality in the Selberg–Steuding Class
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Realization of Exact Upper Bounds of the Best Approximations on the Classes H1,1 by Favard Sums

Faculty of Information Technologies and Mathematics, Lesya Ukrainka Volyn National University, 43025 Lutsk, Ukraine
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(8), 763; https://doi.org/10.3390/axioms12080763
Submission received: 20 May 2023 / Revised: 14 July 2023 / Accepted: 27 July 2023 / Published: 2 August 2023
(This article belongs to the Special Issue Theory of Functions and Applications)

Abstract

:
In this paper, we find the sets of all extremal functions for approximations of the Hölder classes of H 1 2 π -periodic functions of one variable by the Favard sums, which coincide with the set of all extremal functions realizing the exact upper bounds of the best approximations of this class by trigonometric polynomials. In addition, we obtain the sets of all of extremal functions for approximations of the class H 1 by linear methods of summation of Fourier series. Furthermore, we receive the set of all extremal functions for the class H 1 in the Korneichuk–Stechkin lemma and its analogue, the Stepanets lemma, for the Hölder class H 1 , 1 functions of two variables being 2 π -periodic in each variable.

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 2 π -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 H 1 , H 1 , 1 be the classes of functions f ( x ) and f ( x , y ) that are 2 π -periodic in the variable x and the variables x , y , for which the following conditions hold, respectively:
f ( x ) f ( x ) x x , f ( x , y ) f ( x , y ) x x + y y .
Let
E n ( f ) = inf T n 1 f ( x ) T n 1 ( x ) C
be the best approximation of the function f ( x ) by the trigonometric polynomials T n 1 ( x ) of the degree ( n 1 ) , where C is the space of 2 π -periodic continuous functions with the uniform norm f C = max t | f ( t ) | .
Let
E n , m ( f ) : = inf T n 1 , m 1 f ( x , y ) T n 1 , m 1 ( x , y ) C
be the best approximation of the function f ( x , y ) by the trigonometric polynomials T n 1 , m 1 ( x , y ) of the degree ( n 1 ) in the variable x and the degree ( m 1 ) in the variable y in the uniform metric.
Let
F n ( u ) = 1 2 + k = 1 n 1 k π 2 n cot k π 2 n cos k u
be the Favard kernel, and
F n ( f , x ) = 1 π π π f ( t ) F n ( t x ) d t ,
F n , m ( f , x , y ) = 1 π 2 π π π π f ( t , z ) F n ( t x ) F m ( z y ) d t d z
be Favard sums of the degree ( n 1 ) and double rectangular Favard sums of the degree ( n 1 ) in the variable x and the degree ( m 1 ) in the variable y, respectively.
Favard proved in 1936 that
E n = sup f H 1 f ( x ) F n ( f , x ) C = π 2 n = E n ( H 1 ) : = sup f H 1 E n ( f ) ,
i.e., the Favard method implements the exact upper bound of the best approximations on the class H 1 . In the work [1], the exact value of approximations of classes H 1 , 1 by Favard sums was found, namely, for n , m 2
E n , m : = sup f H 1 , 1 f ( x , y ) F n , m ( f , x , y ) C
= π 2 n + π 2 m + 8 π 2 0 π n Φ n ( x ) Φ m ( x ) d x ,
where Φ k ( x ) = i = 1 k 1 Φ ¯ i k ( x ) is the sum of permutations in descending order of the functions Φ i k = i π / k x F k ( t ) d t (for definition of the permutation, see, e.g., [2] (p. 130)).

2. Main Result

Theorem 1.
For any natural numbers n and m , n , m 2 , it is asserted that
E n , m > E n , m H 1 , 1 : = sup f H 1 , 1 E n , m ( f ) .
Theorem 1 was formulated without proof in [3]. We should note that the exact value of E n , m H 1 , 1 , as well as the best linear approximation method reflecting the class H 1 , 1 into the space of all trigonometric polynomials T n 1 , m 1 ( x , y ) of the degree at most ( n 1 ) in the variable x and ( m 1 ) in the variable y are unknown. However, it was found that E n , m H 1 , 1 π 2 n + π 2 m . According to the result of J. Mairhuber [4], the polynomial of the best approximation T n 1 , m 1 ( x , y ) for the function f ( x , y ) is not unique, which makes it difficult to find this polynomial.
Let us denote by W [ a , b ] 1 and W p 1 , 1 the classes of functions f ( x ) and f ( x , y ) defined on the segment [ a , b ] and the rectangle P = [ a , b ] × [ a 1 , b 1 ] satisfying conditions (1). The summable function ψ ( x ) a , b c if almost everywhere on ( a , c ) ( a < c < b ) ψ ( x ) > 0 ( ψ ( x ) < 0 ) , almost everywhere on ( c , b ) ψ ( x ) < 0 ( ψ ( x ) > 0 ) and a b ψ ( t ) d t = 0 .
Let ψ ( x ) a , b c , φ ( y ) a 1 , b 1 c 1 and t = ρ ( x ) , z = δ ( y ) be the functions defined by the equalities
a x ψ ( t ) d t = a ρ ( x ) ψ ( t ) d t , x [ a , c ] , ρ ( x ) [ c , b ] ,
a 1 y φ ( z ) d z = a 1 δ ( y ) φ ( z ) d z , y [ a 1 , c 1 ] , δ ( y ) [ c 1 , b 1 ] ,
and ρ 1 ( x ) and δ 1 ( x ) be the inverse functions to ρ ( x ) and δ ( x ) .
M.P. Korneichuk [2] (pp. 190–198) for the class W [ a , b ] 1 and O.I. Stepanets [5] (p. 52) for the class W p 1 , 1 proved the following statements.
Lemma K
[2]. The following equalities hold
sup f W [ a , b ] 1 a b f ( x ) ψ ( x ) d x = a c ψ ( t ) ( ρ ( t ) t ) d t = c b ψ ( t ) ( t ρ 1 ( t ) ) d t
= a b f * ( x ) ψ ( x ) d x .
In this case, the upper bound in (3) is implemented by functions from the class W [ a , b ] 1 of the form f * ( x ) = K ± x , where K is arbitrary constant.
Lemma S
[5]. The following equalities hold
sup f W p 1 , 1 a b a 1 b 1 f ( x , y ) ψ ( x ) φ ( y ) d x d y
= 2 a c a 1 c 1 ψ ( t ) φ ( z ) min ρ ( t ) t , δ ( z ) z d t d z = a b a 1 b 1 f * ( x , y ) ψ ( x ) φ ( y ) d x d y ,
and the exact upper bound in (4) is realized by the function f * ( x , y ) specified in this lemma (see [5] (pp. 52–54)).
Let us denote by γ n m * ( x , y ) , f * ( x ) , f * ( x , y ) the arbitrary extremal functions from the classes H 1 , 1 , W [ a , b ] 1 , W P 1 , 1 implementing exact upper bounds in (2)–(4), respectively, i.e., such that
E n , m = γ n m * ( x , y ) F n , m ( γ n m * , x , y ) C ,
sup f W [ a , b ] 1 a b f ( x ) ψ ( x ) d x = a b f * ( x ) ψ ( x ) d x ,
sup f W p 1 , 1 a b a 1 b 1 f ( x , y ) ψ ( x ) φ ( y ) d x d y = a b a 1 b 1 f * ( x , y ) ψ ( x ) φ ( y ) d x d y .
Let us prove that all extremal functions γ n m * ( x , y ) realizing the exact upper bound in (2) have the same oscillations equal to π / n + π / m . 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 f * ( x ) realizing the exact upper bound in (3) is the set of functions of the form f * ( x ) = K ± x , where K is an arbitrary constant.
Proof. 
If for the arbitrary extremal function almost everywhere on [ a , b ] f * ( x ) = ± 1 , then due to the absolute continuity of all functions of the class W [ a , b ] 1 (see [5] (pp. 15–16)), f * ( x ) = ± x + K .
Let us prove that almost everywhere on [ a , b ] f * ( x ) = ± 1 . To do this, we have to establish that any extremal function f * ( x ) satisfies the equalities
f * ( x ) f * ( ρ ( x ) ) = ρ ( x ) x ,
or
f * ( x ) f * ( ρ ( x ) ) = ( ρ ( x ) x )
for x [ a , c ] and almost everywhere on [ a , c ]
f * ( x ) = f * ( ρ ( x ) ) .
Since f * ( x ) is absolutely continuous on [ a , b ] , and therefore, differentiable almost everywhere on [ a , b ] (see [6] (p. 229)), ρ ( x ) is absolutely continuous on [ a , c ] (see [5] (p. 19)) and c ρ ( x ) b , then f * ( ρ ( x ) ) is differentiable almost everywhere on [ a , c ] . From (5) and (6) we then get that almost everywhere on [ a , c ]
f * ( x ) f * ( ρ ( x ) ) ρ ( x ) = ρ ( x ) 1 ,
or
f * ( x ) f * ( ρ ( x ) ) ρ ( x ) = ρ ( x ) + 1 .
Using (7)–(9), we have almost everywhere on [ a , c ] f * ( x ) = 1 or f * ( x ) = 1 . Let us prove that f * ( x ) satisfies equalities (5) and (6). If f * ( x ) is an extremal function, then, performing transformations such as in the proof of Theorem 3.1 (see [5] (p. 20)), we obtain
a b f * ( x ) ψ ( x ) d x = a c f * ( t ) f * ( ρ ( t ) ) ψ ( t ) d t
= a c ρ ( t ) t ψ ( t ) d t .
Without loss of generality, we may assume that ψ ( x ) > 0 almost everywhere on [ a , c ] . It then follows from (10) that
a c ψ ( t ) ( ρ ( t ) t ) + f * ( t ) f * ( ρ ( t ) ) d t = 0
or
a c ψ ( t ) ( ρ ( t ) t ) f * ( t ) f * ( ρ ( t ) ) d t = 0 .
Since c ρ ( t ) b and f * W [ a , b ] 1 for t [ a , c ] , then ρ ( t ) t f * ( t ) f * ( ρ ( t ) ) , whence ρ ( t ) t ± f * ( t ) f * ( ρ ( t ) ) 0 for t [ a , c ] . From (11), due to the non-negativity and summability of functions ψ ( t ) ( ( ρ ( t ) t ) ± f * ( t ) f * ( ρ ( t ) ) (see [6] (Theorem 6, p. 131)), it follows that equalities (5) and (6) are valid almost everywhere on [ a , c ] . Since these functions are continuous, equalities (5) and (6) are valid for x [ a , c ] .
Let us prove that f * ( x ) satisfies the relation (7). Since f * W [ a , b ] 1 , then for x , x + Δ x , ρ ( x ) , ( ρ ( x ) + Δ x ) [ a , b ] , using (5) and (6), we have
f * ( x + Δ ) f * ( ρ ( x ) + Δ x ) ρ ( x ) x = f * ( x ) f * ( ρ ( x ) ) .
As a result of the continuity of f * ( x ) , for Δ x 0 the sign of ( f * ( x ) f * ( ρ ( x ) ) ) coincides with the sign of ( f * ( x + Δ x ) f * ( ρ ( x ) + Δ x ) ) . Therefore, from (12) it follows
f * ( x + Δ x ) f * ( x ) f * ( ρ ( x ) + Δ x ) f * ( ρ ( x ) ) ,
or
f * ( x + Δ x ) f * ( x ) f * ( ρ ( x ) + Δ x ) f * ( ρ ( x ) ) .
Using (13) and (14) we have
f * ( x + 0 ) f * ( ρ ( x ) + 0 ) and f * ( x 0 ) f * ( ρ ( x ) 0 ) ,
or
f * ( x + 0 ) f * ( ρ ( x ) + 0 ) and f * ( x 0 ) f * ( ρ ( x ) 0 ) .
Therefore, due to the differentiability of the function f * ( x ) , we obtain that f * ( x ) = f * ( ρ ( x ) ) almost everywhere on [ a , c ] . In a similar way, we prove that f * ( x ) = ± 1 almost everywhere on [ c , b ] . Lemma 1 has been proved. □
Corollary 1.
Let φ ( y ) be the function that is summable and sign-preserving almost everywhere on [ a 1 , b 1 ] . Then
sup f W p 1 , 1 a b a 1 b 1 ψ ( x ) φ ( y ) f ( x , y ) d x d y
= a 1 b 1 φ ( y ) a c ψ ( t ) ( ρ ( t ) t ) d t d y ,
where ψ ( x ) , ρ ( x ) are the same functions as in Lemma K. Moreover, the set of all extremal functions f * ( x , y ) W p 1 , 1 realizing the exact upper bound in (15) has the set of functions of the form
f * ( x , y ) = ± x + g ( y ) ,
where g ( y ) is the arbitrary function from the class W [ a 1 , b 1 ] 1 .
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 a b ψ ( x ) g ( y ) d x = 0 for the arbitrary function g ( y ) , we get that
f * ( x , y ) = ± x + g ( y ) ,
where g ( y ) W [ a 1 , b 1 ] 1 . The corollary has been proved. □
Let
E * = { f n * ( x ) H 1 : sup f H 1 f ( x ) F n ( f , x ) C = π 2 n
= f n * ( x ) F n ( f n * , x ) C }
be the set of all extremal functions for the Favard method on the class H 1 . The following statement is then true.
Theorem 2.
The set E * is the set of functions of the form
f n * ( x ) = ± φ n ( x x 0 ) + C ,
where φ n ( t ) is the 2 π / n -periodic even function, φ n ( t ) = t for t [ 0 , π / n ] , x 0 and C are arbitrary constants.
Proof. 
We can prove that
sup f H 1 f ( x ) F n ( f , x ) C = 2 π sup f H 0 π f ( t ) F n ( t ) d t ,
where H is the subset of even functions f ( x ) from the class H 1 such that
f ( x ) F n ( f , x ) C = f ( 0 ) F n ( f , 0 ) = F n ( f , 0 ) .
Moreover, the arbitrary extremal function f n * ( x ) can be obtained from the arbitrary extremal function
φ n ( t ) H : 2 π sup f H 0 π f ( t ) F n ( t ) d t = 2 π 0 π φ n ( t ) F n ( t ) d t
by shifting its graph parallel to the O X - and O Y -axes, i.e.,
f n * ( x ) = φ n ( x x 0 ) + C .
Let us prove that the extremal function φ n ( t ) H is unique up to a sign. It is clear that
sup f H 2 π 0 π f ( t ) F n ( t ) d t
2 π sup f H 0 π / n f ( t ) F n ( t ) d t + k = 1 n 1 sup f H k π / n ( k + 1 ) π / n f ( t ) F n ( t ) d t .
Since F n ( t ) > 0 on [ 0 , π n ] and f ( t ) H , then
sup f H 0 π / n f ( t ) F n ( t ) d t = 0 π / n t F n ( t ) d t .
Since (see [7]) k π / n ( k + 1 ) π / n F n ( t ) d t = 0 then applying Lemma K for each segment [ k π / n , ( k + 1 ) π / n ] we get
sup f H k π / n ( k + 1 ) π / n f ( t ) F n ( t ) d t = k π / n ( k + 1 ) π / n ( ( 1 ) k t + C k ) F n ( t ) d t .
From (16)–(18), due to the continuity of the extremal function φ n ( t ) , it follows that φ n ( t ) is 2 π / n -periodic even function, φ n ( t ) = t for t [ 0 , π / n ] and
sup f H 2 π 0 π f ( t ) F n ( t ) d t = 2 π 0 π φ n ( t ) F n ( t ) d t .
We assume that there is another extremal function φ ¯ n ( t ) H . Then
0 = 2 π 0 π φ n ( t ) F n ( t ) d t 2 π 0 π φ ¯ n ( t ) F n ( t ) d t
= 2 π 0 π / n φ n ( t ) F n ( t ) d t 0 π / n φ ¯ n ( t ) F n ( t ) d t
+ k = 1 n 1 k π / n ( k + 1 ) π / n φ n ( t ) F n ( t ) d t k π / n ( k + 1 ) π / n φ ¯ n ( t ) F n ( t ) d t .
From (16)–(19) it follows
0 π / n φ n ( t ) F n ( t ) d t 0 π / n φ ¯ n ( t ) F n ( t ) d t 0 ,
k π / n ( k + 1 ) π / n φ n ( t ) F n ( t ) d t k π / n ( k + 1 ) π / n φ ¯ n ( t ) F n ( t ) d t 0 , k = 1 , n 1 ¯ .
In the inequality (21), the equal sign is possible only if φ ¯ n ( t ) = φ n ( t ) = t for t [ 0 , π / n ] .
Since φ n ( t ) is the extremal function of Lemma K on each segment [ k π / n , ( k + 1 ) π / n ] , then by Lemma 1 the equal sign in (22) is possible only if φ ¯ n ( t ) = φ n ( t ) + C k for t [ k π / n , ( k + 1 ) π / n ] . 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 φ ¯ n ( t ) and φ n ( t ) , the equality φ ¯ n ( t ) = φ n ( t ) holds on [ 0 , π / n ] and [ k π / n , ( k + 1 ) π / n ] . As a result of the parity and 2 π -periodicity of these functions, the equality φ ¯ n ( t ) = φ n ( t ) holds on the entire real axis.
Therefore, φ n ( t ) 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
U n ( Λ , f , x ) = 1 π π π f ( t ) U n ( λ , t x ) d t ,
where U n ( λ , t ) = 1 2 + k = 1 n 1 λ k ( n ) cos k t 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 ( n 1 ) has at most 2 n 2 roots on [ π , π ) (see, e.g., [12] (p. 214)), then the function Φ ( x ) = x π U n ( λ , t ) d t can have at most n roots on [ 0 , π ] . Let Φ ( x ) = x π U n ( λ , t ) d t have exactly m roots x k ( k = 1 , m ¯ ) on [ 0 , π ] , 0 m n , and the function f u n * ( x ) H 1 is such that
sup f H 1 f ( x ) U n ( Λ , f , x ) C = f u n * ( x ) U n ( Λ , f u n * , x ) C ,
i.e., it is the arbitrary extremal function for the U n ( Λ , f , x ) on the class H 1 . Then, analogously to the proof of Theorem 2, we can prove the following statement.
Theorem 3.
The set of all extremal functions f u n * ( x ) for the method U n ( Λ , f , x ) on the class H 1 is the set of functions of the form
f u n * ( x ) = ± φ u n ( x x 0 ) + K ,
where x 0 and K are arbitrary constants and φ u n ( t ) is the even 2 π -periodic continuous function such that φ u n ( t ) = 1 for t [ 0 , x 1 ] and φ u n ( t ) = ( 1 ) k for t ( x k , x k + 1 ) , i.e.,
φ u n ( t ) = t , t [ 0 , x 1 ] , ( 1 ) k t + 2 i = 1 k ( 1 ) i + 1 x i , t ( x k , x k + 1 ) ,
k = 1 , m ¯ , 0 m n .
Let E ^ = f ^ n ( x ) H 1 : E n ( H 1 ) C = π 2 n = E n ( f ^ n ) C be the set of all extremal functions realizing the exact upper bound of the best approximations on the class H 1 .
Theorem 4.
The set E ^ = E * 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 f n * ( x ) E * it follows that
E n ( f n * ) = E n ( ± φ n ( x x 0 ) + C ) = E n ( φ n ) = φ n C = π 2 n = E n ( H 1 ) .
These relations imply that for any function f n * ( x ) E * the polynomials of the best approximation are constants and E * E ^ . For any function f ^ n ( x ) E ^ , it follows that
E n ( f ^ n ) = π 2 n = f ^ n ( x ) T n 1 * ( f ^ n , x ) C
f ^ n ( x ) F n ( f ^ n , x ) C sup f H 1 f ( x ) F n ( f , x ) C = π 2 n ,
where T n 1 * ( f ^ n , x ) is the best approximation polynomial of the degree ( n 1 ) of the function f ^ n ( x ) . This means that f ^ n ( x ) F n ( f ^ n , x ) C = π 2 n , i.e., f ^ n ( x ) E * . So E * E ^ . Taking into account that E * E ^ , the theorem has been proved. □
Corollary 2.
If n 1 > 0 and T n 1 * ( f , x ) is the polynomial of the best approximation of the function f ( x ) H 1 then E n ( f ) C < π / 2 n .
Proof. 
For each function f ( x ) H 1 the inequality E n ( f ) C π / 2 n is true. If E n ( f ) = π / 2 n , then using Theorem 4 we get deg T n 1 * ( f , x ) = 0 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., U n ( Λ , f , x ) F n ( f , x ) , then
sup f H 1 f ( x ) U n ( Λ , f , x ) C > sup f H 1 f ( x ) F n ( f , x ) C = π 2 n .
Moreover, the set of all extremal functions f u n * ( x ) for the method U n ( Λ , f , x ) on the class H 1 does not intersect with the set of extremal functions f n * ( x ) for the Favard method on this class.
Proof. 
If f ( x ) H 1 , then
f ( x ) U n ( Λ , f , x ) = 1 π π π D 1 ( t ) k = 1 n 1 λ k ( n ) k sin k t f ( x t ) d t ,
where D 1 ( u ) = k = 1 sin k u k is the 2 π -periodic Bernoulli function (see, e.g., [2] (pp. 109–111)). Since the function f ( x ) belongs to the class H 1 and the Bernoulli kernel D 1 ( u ) 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 H 1 . Therefore, the relations (23) hold.
Let the extremal function f u n * ( x ) for the method U n ( Λ , f , x ) belong to the set E * . So, according to Theorem 2 we have
f u n * ( x ) = ± φ n ( x x 0 ) + C
and as a result of the 2 π / n -periodicity of the function φ n ( t ) (see, e.g., [2] (p. 61)) we get
U n ( Λ , f u n * , x ) = 1 π π π 1 2 φ n ( t ) + C d t = π 2 n + C .
Then
f u n * ( x ) U n ( Λ , f u n * , x ) C = π 2 n
that contradicts the fact proved above. The corollary has been proved. □
Lemma 2.
Let f * ( x , y ) W p 1 , 1 be an arbitrary extremal function of Lemma S, K f * be the oscillation of the function f * ( x , y ) on P, b a b 1 a 1 and y 0 [ a 1 , c 1 ] such that δ ( y 0 ) y 0 = b a . Then
b a K f * = max { max a 1 y y 0 f * ( a , y ) , max δ ( y 0 ) y b 1 f * ( b , y ) }
min { min δ ( y 0 ) y b 1 f * ( a , y ) , min a 1 y y 0 f * ( b , y ) } b 1 a 1 .
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 ψ ( x ) > 0 almost everywhere on [ a , c ] and ψ ( x ) < 0 , almost everywhere on [ c , b ] , φ ( y ) > 0 almost everywhere on [ a 1 , c 1 ] and φ ( y ) < 0 almost everywhere on [ c 1 , b 1 ] . Let us break P into sets E i ( i = 1 , 8 ¯ ) :
E 1 = { ( x , y ) [ a , c ] × [ a 1 , c 1 ] : ρ ( x ) x δ ( y ) y } ,
E 2 = { ( x , y ) [ c , b ] × [ a 1 , c 1 ] : x ρ 1 ( x ) δ ( y ) y } ,
E 3 = { ( x , y ) [ c , b ] × [ a 1 , c 1 ] : δ ( y ) y x ρ 1 ( x ) } ,
E 4 = { ( x , y ) [ c , b ] × [ c 1 , b 1 ] : y δ 1 ( y ) x ρ 1 ( x ) } ,
E 5 = { ( x , y ) [ c , b ] × [ c 1 , b 1 ] : x ρ 1 ( x ) y δ 1 ( y ) } ,
E 6 = { ( x , y ) [ a , c ] × [ c 1 , b 1 ] : ρ ( x ) x y δ 1 ( y ) } ,
E 7 = { ( x , y ) [ a , c ] × [ c 1 , b 1 ] : y δ 1 ( y ) ρ ( x ) x } ,
E 8 = { ( x , y ) [ a , c ] × [ a 1 , c 1 ] : δ ( y ) y ρ ( x ) x } .
Let us prove that the arbitrary extremal function f * ( x , y ) satisfies the relations:
f * ( x , y ) = x + K 1 ( y ) , ( x , y ) E 1 E 2 ,
f * ( x , y ) = x + K 2 ( y ) , ( x , y ) E 6 E 5 ,
f * ( x , y ) = y + v 1 ( x ) , ( x , y ) E 8 E 7 ,
f * ( x , y ) = y + v 2 ( x ) , ( x , y ) E 3 E 4 .
Here, K 1 ( y ) W [ a 1 , c 1 ] 1 if ( x , y ) E 1 E 2 for each fixed x, K 2 ( y ) W [ c 1 , b 1 ] 1 if ( x , y ) E 6 E 5 for each fixed x ,   v 1 ( x ) W [ a , c ] 1 if ( x , y ) E 8 E 7 for each fixed y and v 2 ( x ) W [ c , b ] 1 if ( x , y ) E 3 E 4 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 f * ( x , y ) on [ a , c ] × [ a 1 , c 1 ] satisfies the equality
f * ( x , y ) f * ( ρ ( x ) , y ) f * ( x , δ ( y ) ) + f * ( ρ ( x ) , δ ( y ) )
= 2 min ρ ( x ) x , δ ( y ) y .
This equality is equivalent to equalities:
f * ( x , y ) f * ( ρ ( x ) , y ) = ρ ( x ) x , ( x , y ) E 1 ,
f * ( x , δ ( y ) ) f * ( ρ ( x ) , δ ( y ) ) = ( ρ ( x ) x ) , ( x , y ) E 1 ,
f * ( x , y ) f * ( x , δ ( y ) ) = δ ( y ) y , ( x , y ) E 8 ,
f * ( ρ ( x ) , y ) f * ( ρ ( x ) , δ ( y ) ) = ( δ ( y ) y ) , ( x , y ) E 8 .
Substituting x = ρ 1 ( t ) and t = x in (28), we get f * ( x , y ) f * ( ρ 1 ( x ) , y ) = ρ 1 ( x ) x , if ( x , y ) E 2 because E 1 maps to E 2 after the replacement. Therefore, on E 1 E 2 the extremal function f * ( x , y ) for each fixed y ( a 1 y c 1 ) satisfies the equalities f * ( x , y ) f * ( ρ ( x ) , y ) = ρ ( x ) x if ( x , y ) E 1 , f * ( x , y ) f * ( ρ 1 ( x ) , y ) = ρ 1 ( x ) x if ( x , y ) E 2 .
Thinking in the same way as in the proof of Lemma 1 and Corollary 1, we conclude that the arbitrary extremal function f * ( x , y ) on E 1 E 2 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 E i and its continuity, we write it on the sides of the rectangle:
f * ( a , y ) = y + v 1 ( a ) , y 0 y δ ( y 0 ) , u 1 ( y ) , a 1 y y 0 , u 2 ( y ) , δ ( y 0 ) y b 1 ,
f * ( b , y ) = y + v 2 ( b ) , y 0 y δ ( y 0 ) , u 1 ( y ) ( b a ) , a 1 y y 0 , u 2 ( y ) + ( b a ) , δ ( y 0 ) y b 1 ,
where
u 1 ( y ) = a + K 1 ( y ) , u 2 ( y ) = a + K 2 ( y ) ,
u 1 ( y 0 ) = y 0 + v 1 ( a ) , u 2 ( δ ( y 0 ) ) = δ ( y 0 ) + v 1 ( a ) ,
f * ( x , a 1 ) = x + K 1 ( a 1 ) , f * ( x , b 1 ) = x + K 2 ( b 1 ) .
Let us prove that
K f * = max a 1 y b 1 f * ( a , y ) , f * ( b , y ) min a 1 y b 1 f * ( a , y ) , f * ( b , y ) .
We have to prove that
( α , β ) P min a 1 y b 1 { f * ( a , y ) , f * ( b , y ) } f * ( α , β )
max a 1 y b 1 { f * ( a , y ) , f * ( b , y ) } .
Let y 0 β δ ( y 0 ) . Let us prove that
f * ( b , y 0 ) = f * ( a , δ ( y 0 ) ) f * ( x , β ) f * ( a , y 0 ) = f * ( b , δ ( y 0 ) )
for x [ a , b ] .
Since f * ( a , y 0 ) = u 1 ( y 0 ) = y 0 + v 1 ( a ) and f * ( b , δ ( y 0 ) ) = u 2 ( δ ( y 0 ) ) + ( b a ) = δ ( y 0 ) + v 1 ( a ) + ( b a ) then, taking into account that b a = δ ( y 0 ) y 0 , we get
f * ( a , y 0 ) = f * ( b , δ ( y 0 ) ) .
Similarly, we can prove that
f * ( b , y 0 ) = f * ( a , δ ( y 0 ) ) .
If x a β y 0 , then f * ( x , β ) f * ( a , y 0 ) . Indeed,
f * ( a , y 0 ) f * ( x , β ) = f * ( a , y 0 ) f * ( a , β ) + f * ( a , β ) ) f * ( x , β ) .
Taking into account relation (32) for the function f * ( a , y ) , we get
f * ( a , y 0 ) f * ( a , β ) = β y 0 .
Since the function f * ( x , β ) belongs to the class W [ a , b ] 1 , we then get
f * ( a , β ) f * ( x , β ) ( x a ) ,
hence
f * ( x , β ) f * ( a , y 0 ) .
If x a β y 0 then, taking into account definition (32) of the extremal function f * ( b , y ) and the fact that f * ( x , β ) belongs to the class W [ a , b ] 1 , we get
f * ( b , δ ( y 0 ) ) f * ( x , β )
= f * ( b , δ ( y 0 ) ) f * ( b , β ) + f * ( b , β ) f * ( x , β )
= δ ( y 0 ) β + f * ( b , β ) f * ( x , β )
= δ ( y 0 ) y 0 ( β y 0 ) + f * ( b , β ) f * ( x , β )
b a ( β y 0 ) ( b x ) = ( x a ) ( β y 0 ) 0 .
From relations (34), (36) and (37), it follows that
f * ( x , β ) f * ( a , y 0 ) = f * ( b , δ ( y 0 ) ) .
If x a δ ( y 0 ) β then similarly we prove that
f * ( x , β ) f * ( a , δ ( y 0 ) ) = f * ( b , y 0 ) .
If x a δ ( y 0 ) β then we prove that
f * ( x , β ) f * ( b , y 0 ) = f * ( a , δ ( y 0 ) ) .
Let a 1 β y 0 . Then, according to the definitions of the function δ ( y ) and the sets E 1 , E 2 , we get δ ( β ) β δ ( y 0 ) y 0 = b a , ( x , β ) E 1 E 2 and f * ( x , β ) = x + K 1 ( β ) . According to (32) K 1 ( β ) = u 1 ( β ) + a . This is why
f * ( x , β ) = ( x + a ) + u 1 ( β ) u 1 ( β ) = f * ( a , β ) max a 1 y y 0 f * ( a , y )
max a 1 y b 1 f * ( a , y ) max a 1 y b 1 f * ( a , y ) , f * ( b , y ) .
Similarly, we prove that
f * ( x , β ) min a 1 y y 0 f * ( b , y ) min a 1 y b 1 f * ( a , y ) , f * ( b , y ) .
Let δ ( y 0 ) β b 1 . So, ( x , β ) E 6 E 5 and f * ( x , β ) = x + K 2 ( β ) . Therefore, we prove that
min a 1 y b 1 { f * ( a , y ) , f * ( b , y ) } min δ ( y 0 ) y b 1 { f * ( a , y ) } f * ( x , β )
max δ ( y 0 ) y b 1 { f * ( b , y ) } max a 1 y b 1 { f * ( a , y ) , f * ( b , y ) } .
Relations (38)–(43) imply equality (33). Taking into account the definition (32) of functions f * ( a , y ) and f * ( b , y ) , from (33), we obtain
K f * = max max a 1 y y 0 f * ( a , y ) , max δ ( y 0 ) y b 1 f * ( b , y )
min min δ ( y 0 ) y b 1 f * ( a , y ) , min a 1 y y 0 f * ( b , y ) .
The points where the extreme values of the function f * ( x , y ) (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 f * ( a , y ) and f * ( b , y ) belong to the class W [ a 1 , b 1 ] 1 , we conclude that
b a K f * b 1 a 1 .
If the extreme points lie on both larger sides, then (32) implies that
K f * = max a 1 y y 0 u 1 ( y ) min a 1 y y 0 ( u 1 ( y ) ( b a ) ) ,
or
K f * = max δ ( y 0 ) ) y b 1 ( u 2 ( y ) + ( b a ) ) min δ ( y 0 ) y b 1 u 2 ( y ) .
So,
b a K f * b a + y 0 a 1 < b 1 a 1 ,
or
b a K f * b a + b 1 δ ( y 0 ) < b 1 a 1 .
From (44) and (45), it follows that b a K f * b 1 a 1 .
Let f 1 * ( x , y ) and f 2 * ( x , y ) be arbitrary extremal functions coinciding on one of the larger sides of the rectangle P, i.e., f 1 * ( a , y ) f 2 * ( a , y ) , or f 1 * ( b , y ) f 2 * ( b , y ) . Then
f 1 * ( a , y ) = y + v 1 1 ( a ) , y 0 y δ ( y 0 ) , u 1 1 ( y ) , a 1 y y 0 , u 2 1 ( y ) , δ ( y 0 ) y b 1 ,
f 2 * ( a , y ) = y + v 2 1 ( a ) , y 0 y δ ( y 0 ) , u 1 2 ( y ) , a 1 y y 0 , u 2 2 ( y ) , δ ( y 0 ) y b 1 ,
where u 1 1 ( y ) = a + K 1 1 ( y ) , u 2 1 ( y ) = a + K 2 1 ( y ) and u 1 2 ( y ) = a + K 1 2 ( y ) , u 2 2 ( y ) = a + K 2 2 ( y ) , u 1 1 ( y ) = u 1 2 ( y ) , u 2 1 ( y ) = u 2 2 ( y ) .
Taking into account the definition of the extremal function f * ( x , y ) on E 1 E 2 and on E 6 E 5 and the fact that f 1 * ( a , y ) = f 2 * ( a , y ) , we get f 1 * ( x , y ) = f 2 * ( x , y ) on E 1 E 2 and E 6 E 5 . On the set E 8 E 7 f 1 * ( x , y ) = y + v 1 1 ( x ) , and f 2 * ( x , y ) = y + v 1 2 ( x ) . Let y = l 1 ( x ) be the line separating the sets E 1 and E 8 , i.e., ρ ( x ) x = δ ( l 1 ( x ) ) l 1 ( x ) for x [ a , c ] . Since f * ( x , y ) is continuous on y = l 1 ( x ) , then, taking into account the definition of the extremal function on E 1 and E 8 , we get: x + K 1 1 ( l 1 ( x ) ) = l 1 ( x ) + v 1 1 ( x ) and x + K 1 2 ( l 1 ( x ) ) = l 1 ( x ) + v 1 2 ( x ) . Since K 1 1 ( l 1 ( x ) ) = K 1 2 ( l 1 ( x ) ) , then v 1 1 ( x ) = v 1 2 ( x ) and f 1 * ( x , y ) = f 2 * ( x , y ) by E 8 E 7 . We prove, similarly, that f 1 * ( x , y ) = f 2 * ( x , y ) on E 3 E 4 . So, f 1 * ( x , y ) = f 2 * ( x , y ) 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 H 1 , 1 is the set of functions given by relations
γ n m * ( x , y ) = ± f n m * ( x x 0 , y y 0 ) + K ,
where f n m * ( x , y ) is the extremal function constructed in [1], x 0 , y 0 , K are arbitrary constants.
Proof. 
From [1] it follows that
f n m * ( x , y ) = x + y , ( x + y ) [ 0 , π n ] × [ 0 , π m ] , x + φ ( y ) , ( x , y ) [ 0 , π n ] × [ 0 , π ] , y + ψ ( x ) , ( x , y ) [ 0 , π ] × [ 0 , π m ] , ( 1 ) ( k + 1 ) ( i + 1 ) F k , i ( x , y ) + C k , i + r ( y ) , ( x , y ) [ k π n , ( k + 1 ) π n ] × [ i π m , ( i + 1 ) π m ] , k = 1 , n 1 ¯ , i = 1 , m 1 ¯ .
Here φ ( y ) is the 2 π / m -periodic even function, φ ( y ) = y for y [ 0 , π / m ] , ψ ( x ) is the even, 2 π / n -periodic function, ψ ( x ) = x for x [ 0 , π / n ] , and F k , i ( x , y ) W P k , i 1 , 1 such that
sup f W P k , i 1 , 1 k π n ( k + 1 ) π n i π m ( i + 1 ) π m f ( x , y ) F n ( x ) F m ( y ) d x d y
= k π n ( k + 1 ) π n i π m ( i + 1 ) π m ( 1 ) ( k + 1 ) ( i + 1 ) F k , i ( x , y ) F n ( x ) F m ( y ) d x d y ,
i.e., F k , i ( x , y ) are the extremal functions of Lemma S for the class W P k , i 1 , 1 on the rectangles P k , i = [ k π n , ( k + 1 ) π n ] × [ i π m , ( i + 1 ) π m ] , C k , i are constants, which are chosen so that f n m * ( x , y ) is continuous on [ π n , π ] × [ π m , π ] , r ( y ) = f * ( π n , y ) ( F 1 , i ( π n , y ) + C 1 , i ) is the function that guarantees the continuity of f n m * ( x , y ) on the line x = π / n if n m . We can prove that
sup f H 1 , 1 f ( x , y ) F n m ( f , x , y ) C
= 4 π 2 sup f H 0 0 π 0 π f ( t , z ) F n ( t ) F m ( z ) d t d z ,
where H 0 is the subset of functions from the class H 1 , 1 that are even in each of the variables, such that
f ( x , y ) F n m ( f , x , y ) C = f ( 0 , 0 ) F n m ( f , 0 , 0 ) = F n m ( f , 0 , 0 ) .
Moreover, if φ n m * ( x , y ) H 0 is such that
4 π 2 sup f H 0 0 π 0 π f ( x , y ) F n ( x ) F m ( y ) d x d y
= 4 π 2 0 π 0 π φ n m * ( x , y ) F n ( x ) F m ( y ) d x d y ,
i.e., the arbitrary extremal function from the class H 0 , then
γ n m * ( x , y ) = ± φ n m * ( x x 0 , y y 0 ) + K .
Let us prove that the extremal function φ n m * ( x , y ) H 0 is unique and coincides with f n m * ( x , y ) H 0 . We suppose that there exists another extremal function f ¯ n m * ( x , y ) H 0 , different from f n m * ( x , y ) . Then
0 = 4 π 2 0 π 0 π f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
0 π 0 π f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z
= 4 π 2 0 π n 0 π m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
0 π n 0 π m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z
+ i = 1 m 1 0 π / n i π / n ( i + 1 ) π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
0 π / n i π / n ( i + 1 ) π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z
+ k = 1 n 1 k π / n ( k + 1 ) π / n 0 π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
k π / n ( k + 1 ) π / n 0 π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z
+ k = 1 n 1 i = 1 m 1 k π / n ( k + 1 ) π / n i π / m ( i + 1 ) π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
k π / n ( k + 1 ) π / n i π / m ( i + 1 ) π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z .
Taking into account that f n m * ( x , y ) belongs to the class H 0 and its construction, similarly as it was done in Theorem 2, we get:
0 π / n 0 π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
0 π / n 0 π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z 0 ,
0 π / n i π / m ( i + 1 ) π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
0 π / n i π / m ( i + 1 ) π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z 0 ,
k π / n ( k + 1 ) π / n 0 π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
k π / n ( k + 1 ) π / n 0 π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z 0 ,
k π / n ( k + 1 ) π / n i π / m ( i + 1 ) π / m f n m * ( t , z ) F n ( t ) F m ( z ) d t d z
k π / n ( k + 1 ) π / n i π / m ( i + 1 ) π / m f ¯ n m * ( t , z ) F n ( t ) F m ( z ) d t d z 0 .
It follows from (46) that inequalities (47)–(50) must contain the equal sign. In (47) there is the equal sign only if
f ¯ n m * ( t , z ) = f n m * ( t , z )
on [ 0 , π / n ] × [ 0 , π / m ] . The equal sign in (48), according to Corollary 1, is possible if and only if
f ¯ n m * ( t , z ) = φ ( z ) + f i ( t )
on [ 0 , π / n ] × [ i π / m , ( i + 1 ) π / m ] . Similarly, in (49) the equal sign is possible if and only if
f ¯ n m * ( t , z ) = ψ ( t ) + g k ( z )
on [ k π / n , ( k + 1 ) π / n ] × [ 0 , π / m ] . The equal sign in (50) is possible if and only if f ¯ n m * ( t , z ) is the extremal function of Lemma S for the class W P k , i 1 , 1 on each rectangle P k , i . For 0 t π n
f ¯ n m * ( t , π m ) = f n m * ( t , π m ) = π m + t ,
but, on the other hand, f ¯ n m * ( t , π m ) = π m + f 1 ( t ) , because f ¯ n m * ( t , z ) = φ ( z ) + f 1 ( t ) on [ 0 , π / n ] × [ π / m , 2 π / m ] . As a result of the continuity of the function f ¯ n m * ( t , z ) we have f 1 ( t ) = t .
We prove similarly that f i ( t ) = t , ı = 2 , m 1 ¯ . Therefore, on [ 0 , π / n ] × [ 0 , π ] we obtain
f ¯ n m * ( t , z ) = f n m * ( t , z ) .
We prove similarly that on [ 0 , π ] × [ 0 , π / m ]
f ¯ n m * ( t , z ) = f n m * ( t , z ) .
Since f n m * ( t , z ) and f ¯ n m * ( t , z ) are the extremal functions of Lemma S for the class W P 1 , i 1 , 1 on each rectangle P 1 , i and coincide on the larger side π n , z : i π m z ( i + 1 ) π m of the rectangle, then according to Lemma 2 they coincide on all rectangles P 1 , i . We prove similarly that
f ¯ n m * ( t , z ) = f n m * ( t , z )
on P 2 , i , P 3 , i , , P k , i , , P n 1 , i . So, on [ π / n , π ] × [ π / m , π ] we have
f ¯ n m * ( t , z ) = f n m * ( t , z ) .
From (51)–(53), taking into account the parity and 2 π -periodicity in both variables of functions f n m * ( x , y ) and f ¯ n m * ( x , y ) we get that f ¯ n m * ( x , y ) = f n m * ( x , y ) on the whole plane X O Y . Thus, our assumption is wrong. Therefore, f n m * ( x , y ) is the unique extremal function from the class H 0 . Since any extremal function γ n m * ( x , y ) has the form γ n m * ( x , y ) = ± φ n m * ( x x 0 , y y 0 ) + K , and φ n m * ( x , y ) = f n m * ( x , y ) , then
γ n m * ( x , y ) = ± f n m * ( x x 0 , y y 0 + K ) .
The lemma has been proved. □
Proof of Theorem 1.
Let us prove that there exists the function f ^ n m ( x , y ) H 1 , 1 , realizing the exact upper bound of the best approximation on the class H 1 , 1 , i.e., E n , m ( f ^ n m ) = E n , m ( H 1 , 1 ) . Since E n , m ( f ) = E n , m ( f f ( 0 , 0 ) ) , then E n , m ( H 1 , 1 ) = E n , m ( H 0 1 , 1 ) , where H 0 1 , 1 is the subset of functions from the class H 1 , 1 that are equal to 0 at the origin. Let us prove that H 0 1 , 1 is the compact set in the metric space of 2 π -periodic functions in each of the variables. If f ( x , y ) H 0 1 , 1 then | f ( x , y ) f ( 0 , 0 ) | = | f ( x , y ) | | x | + | y | 2 π . This implies that the set H 0 1 , 1 is bounded and (see, for example, [13] (pp. 123–125)) compact. The best approximation functional E n , m ( f ) is known to be continuous (see, for example, [2] (p. 17)). Since E n , m ( f ) is the continuous functional and the set H 0 1 , 1 is compact, then there exists the function f ^ ( x , y ) H 0 1 , 1 on which the functional E n , m ( f ) reaches its exact upper bound, i.e., E n , m ( H 1 , 1 ) = E n , m ( H 0 1 , 1 ) = E n , m ( f ^ n m ) . Let us assume that E n , m ( H 1 , 1 ) = E n , m . Since
E n , m = E n , m ( H 1 , 1 ) = E n , m ( f ^ n m ) = f ^ n m ( x , y ) T n 1 , m 1 * ( f ^ , x , y ) C
f ^ n m ( x , y ) F n , m ( f ^ n m , x , y ) C E n , m ,
then
f ^ n m ( x , y ) F n , m ( f ^ n m , x , y ) C = E n , m .
Here, T n 1 , m 1 * ( f ^ , x , y ) is the polynomial of the best approximation of the function f ^ n m ( x , y ) of the degree ( n 1 ) in the variable x and the degree ( m 1 ) in the variable y in the uniform metric. It follows from relation (54) that the function f ^ n m ( x , y ) belongs to the set of extremal functions for the Favard method on the class H 1 , 1 , i.e.,
f ^ n m ( x , y ) = ± f n , m * ( x x 0 , y y 0 ) + K .
Since K f n , m * = π / n + π / m , from relation (55) we get K f ^ n m = p i / n + π / m . Since E n , m ( f ^ n m ) K f ^ n m / 2 = π / 2 n + π / 2 m , and as a result (2) E n , m > π / 2 n + π / 2 m , then our assumption is wrong. Hence, the statement of Theorem 1 is true. □
Let us denote by H u + v 1 , 1 : = f ( x , y ) H 1 , 1 : f ( x , y ) = u ( x ) + v ( y ) as the subset of the functions from the class H 1 , 1 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 H 1 , 1 that
u ( x ) H 1 , v ( x ) H 1 .
Theorem 1 (see, for example, [14]) implies the following statement.
Lemma 4.
If the functions u ( x ) and v ( y ) are continuous 2 π -periodic in the variables x and y , and T n 1 * ( u , x ) , T m 1 * ( v , y ) are the polynomials of the best approximation of these functions, then E n , m ( u + v ) = E n ( u ) + E m ( v ) , and T n 1 * ( u , x ) + T m 1 * ( v , y ) is the unique polynomial of the best approximation for the function f ( x , y ) = u ( x ) + v ( y ) H 1 .
Using Lemmas 4 and (56), we prove the relation
E n , m ( H u + v 1 , 1 ) = E n ( H 1 ) + E m ( H 1 ) = π 2 n + π 2 m .
From the last relation and the equality
sup f H u + v 1 , 1 f ( x , y ) F n , m ( f , x , y ) C = sup u H 1 u ( x ) F n ( u , x ) C
+ sup v H 1 v ( y ) F m ( v , y ) C = π 2 n + π 2 m
the following statement follows.
Theorem 5.
For any natural numbers n and m
sup f H u + v 1 , 1 f ( x , y ) F n , m ( f , x , y ) C = π 2 n + π 2 m = E n , m ( H u + v 1 , 1 ) ,
that is, the Favard method implements the exact upper bound of the best approximations on the class H u + v 1 , 1 .

3. Conclusions

In this paper, we proved that the approximation of the class H 1 , 1 by Favard method is greater than the value of the best approximation of this class by trigonometric polynomials, the exact value of which being unknown. We have also managed to build classes for which these values are equal.
The question of Theorem 1 validity for Hölder classes of functions of n 3 variables being 2 π -periodic in each variable, still remains open. To solve it, we have to establish analogues of equality (1) and Lemmas 2 and 3 for these classes of functions.

Author Contributions

Conceptualization, D.B. and I.K.; methodology, D.B. and I.K.; formal analysis, D.B. and I.K.; writing—original draft preparation, D.B. and I.K.; writing—review and editing, D.B. and I.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Stepanets, A.I. A sharp estimate of the deviations of Favard sums over the classes H1,1A,B. Studies in the theory of approximation of functions and their applications. Akad. Nauk Ukrain SSR Inst. Mat. Kiev. 1978, 195, 174–181. (In Russian) [Google Scholar]
  2. Korneichuk, N.P. Extremal Problems in Approximation Theory; Nauka: Moscow, Russia, 1976. (In Russian) [Google Scholar]
  3. Bushev, D.N. Inequalities of the type of Bernstein inequalities and their application to the investigation of the differential properties of the solutions of differential equations of higher order. Dokl. Akad. Nauk USSR 1984, 2, 3–4. (In Russian) [Google Scholar]
  4. Mairhuber, J. On Haar’s theorem concerning Chebysheff approximation problems heving unique solutions. Proc. Am. Math. Soc. 1971, 7, 609–615. [Google Scholar]
  5. Stepanets, A.I. Uniform Approximations by Trigonometric Polynomials; Naukova Dumka: Kiev, Ukraine, 1981. (In Russian); English translation: VSP: Leiden, The Netherland, 2001 [Google Scholar]
  6. Natanson, I.P. Theory of Functions of a Real Variable; Nauka: Moscow, Russia, 1974. (In Russian); English translation by Leo F. Boron: Dover Publications: New York, NY, USA, 2016 [Google Scholar]
  7. Stechkin, S.B. The approximation of continuous periodic functions by Favard sums. Trudy Mat. Inst. Steklov 1971, 109, 26–34. (In Russian) [Google Scholar]
  8. Kal’chuk, I.; Kharkevych, Y. Approximation Properties of the Generalized Abel-Poisson Integrals on the Weyl-Nagy Classes. Axioms 2022, 11, 161. [Google Scholar] [CrossRef]
  9. Kal’chuk, I.V.; Kharkevych, Y.I. Approximation of the Classes Wrβ,∞ by Generalized Abel–Poisson Integrals. Ukr. Math. J. 2022, 74, 575–585. [Google Scholar] [CrossRef]
  10. Zhyhallo, T.; Kharkevych, Y. On Approximation of functions from the Class Lβ,1ψ by the Abel-Poisson integrals in the integral metric. Carpathian Math. Publ. 2022, 14, 223–229. [Google Scholar] [CrossRef]
  11. Kharkevych, Y.I. On Some Asymptotic Properties of Solutions to Biharmonic Equations. Cybern. Syst. Anal. 2022, 58, 251–258. [Google Scholar] [CrossRef]
  12. Dzyadyk, V.K. Introduction to the Theory of Uniform Approximation of Functions by Polynomials; Nauka: Moskow, Russia, 1977. (In Russian) [Google Scholar]
  13. Timan, A.F. Theory of Approximation of Functions of a Real Variable; Fizmatgiz: Moscow, Russia, 1960. (In Russian); English translation by J. Berry: International Series of Monographs on Pure and Applied Mathematics 34; Pergamon Press and MacMillan: Oxford, UK, 1963 [Google Scholar]
  14. Newman, D.; Shapiro, H. Some theorems on Cebysev approximation. Duke Math. J. 1963, 30, 673–681. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Bushev, D.; Kal’chuk, I. On the Realization of Exact Upper Bounds of the Best Approximations on the Classes H1,1 by Favard Sums. Axioms 2023, 12, 763. https://doi.org/10.3390/axioms12080763

AMA Style

Bushev D, Kal’chuk I. On the Realization of Exact Upper Bounds of the Best Approximations on the Classes H1,1 by Favard Sums. Axioms. 2023; 12(8):763. https://doi.org/10.3390/axioms12080763

Chicago/Turabian Style

Bushev, Dmytro, and Inna Kal’chuk. 2023. "On the Realization of Exact Upper Bounds of the Best Approximations on the Classes H1,1 by Favard Sums" Axioms 12, no. 8: 763. https://doi.org/10.3390/axioms12080763

APA Style

Bushev, D., & Kal’chuk, I. (2023). On the Realization of Exact Upper Bounds of the Best Approximations on the Classes H1,1 by Favard Sums. Axioms, 12(8), 763. https://doi.org/10.3390/axioms12080763

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop