0HWKRGVRI $SSUR[LPDWLRQ7KHRU\
0HWKRGVRI $SSUR[LPDWLRQ7KHRU\ $,6WHSDQHWV
,6%1 &RS\ULJKW...
102 downloads
2404 Views
3MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
0HWKRGVRI $SSUR[LPDWLRQ7KHRU\
0HWKRGVRI $SSUR[LPDWLRQ7KHRU\ $,6WHSDQHWV
,6%1 &RS\ULJKWE\.RQLQNOLMNH%ULOO19/HLGHQ7KH1HWKHUODQGV .RQLQNOLMNH%ULOO19LQFRUSRUDWHVWKHLPSULQWV%ULOO$FDGHPLF3XEOLVKHUV 0DUWLQXV1LMKRII3XEOLVKHUVDQG963 $&,3UHFRUGIRUWKLVERRNLVDYDLODEOHIURPWKH/LEUDU\RI&RQJUHVV $OOULJKWVUHVHUYHG1RSDUWRIWKLVSXEOLFDWLRQPD\EHUHSURGXFHGWUDQVODWHGVWRUHGLQD UHWULHYDOV\VWHPRUWUDQVPLWWHGLQDQ\IRUPRUE\DQ\PHDQVHOHFWURQLFPHFKDQLFDO SKRWRFRS\LQJUHFRUGLQJRURWKHUZLVHZLWKRXWSULRUSHUPLVVLRQIURPWKHSXEOLVKHU $XWKRUL]DWLRQWRSKRWRFRS\LWHPVIRULQWHUQDORUSHUVRQDOXVHLVJUDQWHGE\%ULOOSURYLGHG WKDWWKHDSSURSULDWHIHHVDUHSDLGGLUHFWO\WRWKH&RS\ULJKW&OHDUDQFH&HQWHU5RVHZRRG 'ULYH6XLWH'DQYHUV0$86$)HHVDUHVXEMHFWWRFKDQJH
Contents
PREFACE
xi PART I
1. REGULARITY OF LINEAR METHODS OF SUMMATION OF FOURIER SERIES 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2. Nikol’skii and Nagy Theorems . . . . . . . . . . . . . . . . . . . . 3. Lebesgue Constants of Classical Linear Methods . . . . . . . . . . 4. Lower Bounds for Lebesgue Constants . . . . . . . . . . . . . . . . 5. Linear Methods Determined by Rectangular Matrices . . . . . . . . 6. Estimates for Integrals of Moduli of Functions Defined by Cosine and Sine Series . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7. Asymptotic Equality for Integrals of Moduli of Functions Defined by Trigonometric Series. Telyakovskii Theorem . . . . . . . . . . 8. Corollaries of Theorem 7.1. Regularity of Linear Methods of Summation of Fourier Series . . . . . . . . . . . . . . . . . . 2. SATURATION OF LINEAR METHODS 1. Statement of the Problem . . . . . . . . . . . . . 2. Sufficient Conditions for Saturation . . . . . . . 3. Saturation Classes . . . . . . . . . . . . . . . . . 4. Criterion for Uniform Boundedness of Multipliers 5. Saturation of Classical Linear Methods . . . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
1 1 6 15 21 23
. 28 . 43 . 66
. . . . .
79 79 81 84 90 98
3. CLASSES OF PERIODIC FUNCTIONS 101 1. Sets of Summable Functions. Moduli of Continuity . . . . . . . . . . 101 2. Classes Hω [a, b] and Hω . . . . . . . . . . . . . . . . . . . . . . . 108 3. Moduli of Continuity in Spaces Lp . Classes Hωp . . . . . . . . . . 110 v
vi
Contents
4. 5. 6. 7.
Classes of Differentiable Functions . . . Conjugate Functions and Their Classes . Weyl–Nagy Classes . . . . . . . . . . . Classes Lψ βN . . . . . . . . . . . . . .
8.
Classes Cβψ N . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
9.
N . . . . . . . . . . . . . . . . Classes Lψ β¯ ¯ Order Relation for (ψ, β)-Derivatives . . . ¯ ψ-Integrals of Periodic Functions . . . . . Sets M0 , M∞ , and MC . . . . . . . . . . Set F . . . . . . . . . . . . . . . . . . . . Two Counterexamples . . . . . . . . . . . Function ηa (t) and Sets Defined by It . . . Sets B and M0 . . . . . . . . . . . . . .
10. 11. 12. 13. 14. 15. 16.
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
112 116 119 120
. . . . . . . . . . . . . . 130 . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
133 137 147 153 156 160 162
4. INTEGRAL REPRESENTATIONS OF DEVIATIONS OF POLYNOMIALS GENERATED BY LINEAR PROCESSES OF SUMMATION OF FOURIER SERIES 165 1. First Integral Representation . . . . . . . . . . . . . . . . . . . . . . 165 2. Second Integral Representation . . . . . . . . . . . . . . . . . . . . . 167 ¯ 3. Representation of Deviations of Fourier Sums on Sets C ψ M ¯ and Lψ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 5. APPROXIMATION BY FOURIER SUMS IN SPACES C AND 1. Simplest Extremal Problems in Space C . . . . . . . . . . . . . 2. Simplest Extremal Problems in Space L1 . . . . . . . . . . . . . 3. Approximations of Functions of Small Smoothness by Fourier Sums . . . . . . . . . . . . . . . . . . . . . . . . . 4. Auxiliary Statements . . . . . . . . . . . . . . . . . . . . . . . . 5. Proofs of Theorems 3.1–3.3 . . . . . . . . . . . . . . . . . . . . 6. Approximation by Fourier Sums on Classes Hω . . . . . . . . . ˜ω . . . . . . . . . 7. Approximation by Fourier Sums on Classes H 8. Analogs of Theorems 3.1–3.3 in Integral Metric . . . . . . . . . 9. Analogs of Theorems 6.1 and 7.1 in Integral Metric . . . . . . . . 10. Approximations of Functions of High Smoothness by Fourier Sums in Uniform Metric . . . . . . . . . . . . . . . . . . . . 11. Auxiliary Statements . . . . . . . . . . . . . . . . . . . . . . . . 12. Proofs of Theorems 10.1–10.3 . . . . . . . . . . . . . . . . . . .
L1 187 . . 189 . . 198 . . . . . . .
. . . . . . .
203 207 225 235 239 243 252
. . 253 . . 259 . . 271
Contents 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24.
vii
Analogs of Theorems 10.1–10.3 in Integral Metric . . . . . . . . . . 278 Remarks on the Solution of Kolmogorov–Nikol’skii Problem . . . . . 279 ¯ Approximation of ψ-Integrals That Generate Entire Functions by Fourier Sums . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284 Approximation of Poisson Integrals by Fourier Sums . . . . . . . . . 294 Corollaries of Telyakovskii Theorem . . . . . . . . . . . . . . . . . . 303 Solution of Kolmogorov–Nikol’skii Problem for Poisson Integrals of Continuous Functions . . . . . . . . . . . . . . . . . . . . . . . . 310 Lebesgue Inequalities for Poisson Integrals . . . . . . . . . . . . . . 338 Approximation by Fourier Sums on Classes of Analytic Functions . . 345 Convergence Rate of Group of Deviations . . . . . . . . . . . . . . . 363 Corollaries of Theorems 21.1 and 21.2. Orders of Best Approximations374 Analogs of Theorems 21.1 and 21.2 and Best Approximations in Integral Metric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378 Strong Summability of Fourier Series . . . . . . . . . . . . . . . . . 383
BIBLIOGRAPHICAL NOTES (Part I)
393
REFERENCES (Part I)
399
6. 0. 1. 2. 3. 4. 5. 6. 7. 8. 9.
PART II CONVERGENCE RATE OF FOURIER SERIES AND THE BEST APPROXIMATIONS IN THE SPACES Lp Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . Approximations in the Space L2 . . . . . . . . . . . . . . . . Direct and Inverse Theorems in the Space L2 . . . . . . . . . Extension to the Case of Complete Orthonormal Systems . . . Jackson Inequalities in the Space L2 . . . . . . . . . . . . . . Marcinkiewicz, Riesz, and Hardy–Littlewood Theorems . . . ¯ Imbedding Theorems for the Sets Lψ Lp . . . . . . . . . . . . ¯ Approximations of Functions from the Sets Lψ Lp by Fourier Sums . . . . . . . . . . . . . . . . . . . . . . . . . . . . Best Approximations of Infinitely Differentiable Functions . . Jackson Inequalities in the Spaces C and Lp . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
429 429 432 437 439 444 448 452
. . . . 455 . . . . 466 . . . . 481
7. BEST APPROXIMATIONS IN THE SPACES C AND L 1. Chebyshev and de la Vall´ee Poussin Theorems . . . . . . . . . . . . . 2. Polynomial of the Best Approximation in the Space L . . . . . . . . 3. General Facts on the Approximations of Classes of Convolutions . . .
489 490 492 495
viii 4. 5. 6. 7. 8. 9.
Contents Orders of the Best Approximations . . . . . . . . . . . . . . Exact Values of the Upper Bounds of Best Approximations . Dzyadyk–Stechkin–Xiung Yungshen Theorem. Korneichuk Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . Serdyuk Theorem . . . . . . . . . . . . . . . . . . . . . . . Bernstein Inequalities for Polynomials . . . . . . . . . . . . Inverse Theorems . . . . . . . . . . . . . . . . . . . . . . .
. . . . . 505 . . . . . 510 . . . .
8. INTERPOLATION 1. Interpolation Trigonometric Polynomials . . . . . . . . . . . . 2. Lebesgue Constants and Nikol’skii Theorems . . . . . . . . . 3. Approximation by Interpolation Polynomials in the Classes of Infinitely Differentiable Functions . . . . . . . . . . . . 4. Approximation by Interpolation Polynomials on the Classes of Analytic Functions . . . . . . . . . . . . . . . . . . . . . 5. Summable Analog of the Favard Method . . . . . . . . . . . .
. . . .
13.
. . . .
. . . .
522 525 539 545
553 . . . . 553 . . . . 557 . . . . 560 . . . . 572 . . . . 586
9. APPROXIMATIONS IN THE SPACES OF LOCALLY SUMMABLE FUNCTIONS ˆp . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1. Spaces L 2. Order Relation for (ψ, β)-Derivatives . . . . . . . . . . . . . . 3. Approximating Functions . . . . . . . . . . . . . . . . . . . . . 4. General Estimates . . . . . . . . . . . . . . . . . . . . . . . . . ˆψ . . . . . . . . . 5. On the Functions ψ(·) Specifying the Sets L β 6. Estimates of the Quantities ˆ rσc (t, β)1 for c = σ − h and h > 0 . . . . . . . . . . . . . . . . . . . . . . . . . . 7. Estimates of the Quantities ˆ rσc (t, β)1 for c = θσ, 0 ≤ θ ≤ 1, and ψ ∈ Ac . . . . . . . . . . . . . . . . . . . . . . . . . . 8. Estimates of the Quantities ˆ rσc (t, β)1 for c = 2σ − η(σ) and ψ ∈ A∞ . . . . . . . . . . . . . . . . . . . . . . . . . 9. Estimates of the Quantities ˆ rcσ (t, 0)1 for c = θσ, 0 ≤ θ < 1, and ψ ∈ A0 . . . . . . . . . . . . . . . . . . . . . . . . . . 10. Estimates of the Quantities δˆσ,c (t, β)1 . . . . . . . . . . . . 11. Basic Results . . . . . . . . . . . . . . . . . . . . . . . . . . . ψ 12. Upper Bounds of the Deviations ρσ (f ; ·) in the Classes Cˆβ,∞ and Cˆ ψ Hω . . . . . . . . . . . . . . . . . . . . . . . . . . β
. . . .
. . . . .
. . . . .
. . . . .
597 598 601 607 615 624
. . . 626 . . . 632 . . . 634 . . . 635 . . . 636 . . . 639 . . . 648
Some Remarks on the Approximation of Functions of High Smoothness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666
Contents 14.
ix
Strong Means of Deviations of the Operators Fσ (f ; x) . . . . . . . . 668
10. APPROXIMATION OF CAUCHY-TYPE INTEGRALS 1. Definitions and Auxiliary Statements . . . . . . . . . . . 2. Sets of ψ-Integrals . . . . . . . . . . . . . . . . . . . . 3. Approximation of Functions from the Classes C ψ (T)+ . 4. Landau Constants . . . . . . . . . . . . . . . . . . . . . 5. Asymptotic Equalities . . . . . . . . . . . . . . . . . . . 6. Lebesgue–Landau Inequalities . . . . . . . . . . . . . . 7. Approximation of Cauchy-Type Integrals . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
11. APPROXIMATIONS IN THE SPACES S p 1. Spaces Sϕp . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2. ψ-Integrals and Characteristic Sequences . . . . . . . . . . . . 3. Best Approximations and Widths of p-Ellipsoids . . . . . . . . 4. Approximations of Individual Elements from the Sets ψSϕp . . . 5. Best n-Term Approximations . . . . . . . . . . . . . . . . . . 6. Best n-Term Approximations (q > p) . . . . . . . . . . . . . 7. Proof of Lemma 6.1 . . . . . . . . . . . . . . . . . . . . . . . . 8. Best Approximations by q-Ellipsoids in the Spaces Sϕp . . . . . 9. Application of Obtained Results to Problems of Approximation of Periodic Functions of Many Variables . . . . . . . . . . . 10. Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11. Theorems of Jackson and Bernstein in the Spaces S p . . . . . . 12. APPROXIMATIONS BY ZYGMUND AND ´ POUSSIN SUMS DE LA VALLEE 1. Fej´er Sums: Survey of Known Results . . . . . . . . . . . 2. Riesz Sums: A Survey of Available Results . . . . . . . . 3. Zygmund Sums: A Survey of Available Results . . . . . . ψ 4. Zygmund Sums on the Classes Cβ,∞ . . . . . . . . . . . 5. De la Vall´ee Poussin Sums on the Classes Wβr and Wβr Hω 6.
¯
De la Vall´ee Poussin Sums on the Classes Cβψ N and C ψ N
. . . .
. . . . .
. . . . .
. . . . . . .
. . . . . . .
. . . . . . .
679 680 696 702 713 716 723 727
. . . . . . . .
. . . . . . . .
. . . . . . . .
741 741 745 747 750 755 771 777 808
. . . 811 . . . 817 . . . 822
. . . . .
. . . . .
. . . . .
847 848 860 863 866 871
. . . . . 877
BIBLIOGRAPHICAL NOTES (Part II)
881
REFERENCES (Part II)
885
Index
917
PREFACE What is new in this monograph? First of all, it is worth noting methods that enable one to solve, within the framework of a common approach, traditional problems of approximation theory for large collections of functions, including the well-known Weyl–Nagy and Sobolev classes as particular cases as well as classes of functions defined by convolutions with arbitrary summable kernels. The results obtained with the use of these methods are also new. Systematic investigations in this direction were originated in the 1980s under the influence of works by B. Nagy, S. M. Nikol’skii, S. B. Stechkin, V. K. Dzyadyk, N. I. Akhiezer, N. P. Korneichuk, A. V. Efimov, S. A. Telyakovskii, etc. In the same years, the concept of (ψ, β)-derivative defined for a given function f by a given sequence of numbers ψ = ψ(k), k = 1, 2, . . . , and numbers β was formed. The ordinary rth derivative, r = 1, 2, . . . , of a periodic function is a particular case of the (ψ, β)-derivative for ψ(k) = k −r and β = r. Derivatives in the Weyl and Weyl–Nagy sense are also particular cases of (ψ, β)-derivatives. Generally speaking, the sequences ψ(k) in the definition of derivatives may be arbitrary. However, it turned out that, in many cases, it suffices to consider only sequences convex downwards (in the present monograph, the set of such sequences is denoted by M ). This simplifies investigations without considerable loss of generality. It turns out that any summable (or continuous) 2π-periodic function f necessarily has the (ψ, β)-derivative, which remains summable (continuous), and, furthermore, ψ ∈ M. Moreover, if the set of periodic functions for which (ψ, β)-derivatives exist for given ψ and β is denoted by Lψ β , then the following equality is true: ∪ Lψ β = L, ψ∈M
where L denotes the set of 2π-periodic functions integrable over the period. This equality means, in particular, that, using the notion of (ψ, β)-derivatives, one can classify all functions from L. It was established that the common part of all sets Lψ β for ψ ∈ M consists solely of trigonometric polynomials. This xi
xii
Preface
implies that, under this classification, every function f ∈ L falls only into its “own” set Lψ β , and only polynomials remain indistinguishable (they are contained in each of these sets). Clearly, any classification of functions has the right to exist only if its efficiency is confirmed. Apparently, the main problem of approximation theory is to establish the properties of approximation characteristics of a function on the basis of the postulated properties of this function. In the case of approximation of 2π-periodic functions, it is customary to use the convergence rates of Fourier series, best approximations by trigonometric polynomials, approximations by polynomials generated by linear methods of summation of Fourier series, approximations by interpolation polynomials, etc., as such characteristics. Functions with the same a priori properties are combined into classes, so that the facts established for a given class are valid for every representative of it. In this case, there arises the possibility of formulating new problems for entire classes of functions. Among them, there are problems of the properties of upper bounds for a given class of deviations of Fourier sums, best approximations, approximations by linear methods, etc., problems of various widths of given classes, etc. Therefore, the success of any classification of functions depends, first of all, on whether the properties used as its basis are adequate to the objective chosen. In this respect, the classification considered can withstand even strong criticism because all approximation characteristics investigated are completely expressed (most often, in explicit form) in terms of parameters defining classes of functions. For example, the orders of upper bounds of the best uniform approximations by trigonometric polynomials of degree n − 1 on classes of functions for which (ψ, β)-derivatives are bounded are equal to ψ(n). An analogous quantity in the Lebesgue spaces Lp has the same value for any p ∈ [1, ∞]. If a function f is the (ψ, β)-derivative of a function F, then it is quite natural to call F the (ψ, β)-integral of the function f. In this case, the set Lψ β is the collection of (ψ, β)-integrals of all functions f ∈ L. Obviously, it makes no difference which concept (derivative or integral) is regarded as primary. For a long time, the concept of derivative has been primary in the definition of classes of functions. However, in recent years, a preference has been given to the concept of integral (indeed, the approximated objects are, as a rule, integrals). This concept dominates in the present monograph. As a rule, the main results are formulated for entire families of classes whose parameters are sequences running through a given set (e.g., the set M or a certain part of it). Since they are quite general, their proof is not simple. All cumbersome
Preface
xiii
proofs are divided into several steps, the first of which, as a rule, is the derivation of integral representations for the quantities investigated, and the second step is devoted to the simplification of the obtained expressions according to the objective of the problem considered. Problems of approximation of 2π-periodic functions of one variable occupy the main place in the monograph. The most complete and final results are obtained in the case of approximation of these functions by their Fourier sums in the uniform metric and in the metric of the space L = L1 . These results are presented in Chapter 5. Chapters 1–4 can be regarded as preparatory, though, undoubtedly, they are of independent interest. For, example, Chapter 1 is devoted to general problems of the theory of summation of Fourier series, in particular, problems of their regularity. In this chapter, we present the well-known Nagy and Nikol’skii statements that give sufficient regularity conditions and (apparently, for the first time in monographs) the known Telyakovskii theorem that enables one to determine the principal parts of the integrals of summable functions in terms of their Fourier coefficients in fairly general cases. General problems of the theory of summation of Fourier series (problems of saturation of linear methods) are considered in Chapter 2. An important place in the monograph is occupied by Chapter 3. One may begin reading this monograph with exactly this chapter, where problems of classification of periodic functions (from the notion of modulus of continuity to prop¯ erties of ψ-integrals) are systematically presented. Formulas for the integral representation of deviations of polynomials gener¯ ated by linear processes of summation of Fourier series on sets of ψ-integrals are deduced in Chapter 4. Parallel with traditional representations of these deviations in terms of convolutions with integrals over the period, we also present here representations with the use of convolutions with integrals taken over the entire real axis. Exactly these representations are most often used in what follows. In the derivation of these representations, an important role is played by functions that are integrable and continuous on the entire axis and orthogonal to every function from L. Approximations by Fourier sums and the best approximations in the spaces Lp for p > 1 are considered in Chapter 6. While, in the case of the spaces C and L1 , asymptotic equalities for the upper bounds of deviations of Fourier sums are obtained in Chapter 5 for large collections of functions, in the spaces Lp , with rare exceptions, one has to be content with exact order relations. It is clear that one of these positive exceptions corresponds to the case p = 2. Time will show whether this is a consequence of inadequate analysis or of the disharmony
xiv
Preface
between the original data and the objectives formulated. Arguments in favor of the latter are given, in particular, by the constructions presented in Chapter 11, where it is proposed to consider functions (including functions of many variables) as elements of linear spaces with a norm defined in a special way. Chapter 7 is devoted to the determination of orders and exact values of the best ¯ polynomial approximations in the spaces C and L1 on the sets of ψ-integrals. Orders are readily determined for large collections of functions. However, as for exact values, only a few new results are added to the well-known Favard– Akhiezer–Krein, Nagy, Dzyadyk–Stechkin–Xiung Yungshen, and Korneichuk results, and, probably, the main achievements in this direction are yet to come. In Chapter 8, interpolation problems are considered. The Nikol’skii results on the approximation of differentiable functions by interpolation polynomials and ¯ new results for sets of ψ-integrals are presented here. It is shown that, in fact, approximations by interpolation polynomials are not inferior in quality to approximations by Fourier sums. ¯ The methods for the investigation of approximations of ψ-integrals developed in Chapters 5–7 are fairly universal. In particular, these methods and new facts (which are actually at the level of definitions) enable one to investigate approximation characteristics of classes of functions locally integrable on the entire axis and defined by Cauchy-type integrals in Jordan domains with rectifiable boundary. The corresponding results are presented in Chapters 9 and 10. In Chapter 9, we investigate problems of approximation of locally integrable functions defined on the entire axis (not necessarily periodic) with the use of entire functions of the exponential type. Here, in fact, we construct a theory analogous to that for the periodic case presented in Chapters 5–7: the notion of the (ψ, β)ˆ is integral of a function f locally integrable on the numerical axis (f ∈ L) ψ ψ ˆ introduced, sets Lβ analogous to the sets Lβ are defined, and approximations of ˆ ψ by entire functions of the exponential type are studied. Main functions f ∈ L β
attention is given to approximations by so-called Fourier operators (analogs of Fourier sums in the periodic case). Here, analogs of the spaces Lp are the sets ˆ p of functions f with the finite norm f pˆ defined as follows: L
f pˆ =
⎧ ⎞1/p ⎛ a+2π ⎪ ⎪ ⎪ ⎪ ⎪ |f (t)|p dt⎠ , 1 ≤ p < ∞, ⎨ sup ⎝ a∈R1
a
⎪ ⎪ ⎪ ⎪ ⎪ ⎩ess sup |f (t)|, t∈R1
p = ∞.
Preface
xv
ˆ ψ involve the corresponding Therefore, the statements obtained for the sets L β results for the sets Lψ β. The results presented in Chapter 11 are completely new (they were published in journals in 2001–2002), and, apparently, their analysis will be performed in the future. This material is a result of a search for new approaches to problems of the theory of approximation of functions of many variables and, in particular, functions periodic in each variable. There are many problems here, but the following may be regarded as the most important ones: the choice of approximating aggregates, the choice of classes of functions, and the choice of approximation characteristics. The extension of one-dimensional results to the multidimensional case immediately encounters the problem of the choice of approximating aggregates. In the one-dimensional case, the form of the simplest aggregate is determined by the natural order of a natural series, whereas in the multidimensional case, i.e., in the case where there is a set X [a Banach space of functions f (t) = f (t1 , . . . , tm ), t ∈ Rm , of m variables], the choice of the simplest aggregates becomes problematic; it is well known that the first difficulties here begin with the problem of the choice of an analog of a partial sum for the multiple series
ck , k = (k1 , . . . , km ),
(1)
k∈Z m
where Z m is the integer lattice in Rm . It seems quite natural to introduce “rectangular” sums and the corresponding approximating aggregates in the periodic case, namely trigonometric polynomials of the form n1 nm ... ck1 ,...,km ei(k1 t1 +...+km tm ) . (2) k1 =−n1
km =−nm
However, partial sums of a multiple series can be introduced in many ways, e.g., as follows: Let {Gα } be a family of bounded domains in Rm that depend on the numerical parameter α and are such that any vector n ∈ Z m belongs to all domains Gα for sufficiently large values of α. Then the expression k∈Gα
ck
xvi
Preface
is called a partial sum of series (1) corresponding to the domain Gα . By analogy, one introduces the corresponding partial sums of the trigonometric series: ck eikx = ck1 ,...,km ei(k1 x1 +...+km xm ) . (3) k∈Gα
k∈Gα
It turned out quite soon that, in the case of approximation of functions from the Sobolev classes Wpr (Rm ), it is “more productive” to use sums of the form (3) constructed on the basis of domains formed by certain hyperbolas instead of the rectangular sums (2). These domains, first introduced by K. I. Babenko in 1960, were called hyperbolic crosses. The appearance of the notion of hyperbolic cross has made a considerable impact on the development of the theory of approximation of functions of many variables. However, this notion turned out to be of little use for classes of functions different from Sobolev classes . In this connection, there naturally arise assumptions that, for every individual class of functions N (or any family of these classes), it is necessary to select “its own” family of domains Gα defined by the parameters of this class and to construct approximating aggregates of the form (3) on the basis of this family. In this case, as in the case of hyperbolic crosses, the values of the Kolmogorov widths of these functional classes may serve as a measure of the applicability of approximating aggregates. These arguments motivated the investigations described in Chapter 11. A few words should be said about the metric used in that chapter, which is alternative to the metric used in the definition of the Lebesgue spaces Lp . Let L2 be the set of 2π-periodic square-integrable functions. For such functions, a norm is traditionally defined in two different ways, namely,
f L2
⎛ 2π ⎞1/2
1/2 ∞ = f 2 = ⎝ f 2 (t)dt⎠ = c2k = cl2 , k=−∞
0
where c = {ck }k∈Z 1 are the Fourier coefficients of the function f. For this reason, the notion of norm for different values of p = 2 can be generalized in at least two ways: in the first case, the quantities ⎛ 2π ⎞1/p f p = ⎝ |f (t)|p dt⎠ 0
Preface
xvii
are taken as a norm, and in the second case a norm is defined as follows:
∞
1/p |ck |
p
= clp .
k=−∞
In Chapter 11, the second approach is used. In particular, this enables one to consider functions from the general positions of analysis and leads to fairly interesting results. It is also necessary to make some remarks concerning Chapter 12. Initially, it was planned to present all assertions in this chapter with complete proofs because there is no systematic presentation of this material available in the monographic literature. However, later, it became clear that an additional volume is required just for this purpose. For this reason, it was decided to present basic results obtained in this field without proofs. Since there are many papers and more than 30 theses devoted to investigations in this field, the author had the problem of the choice of material. The monograph mainly contains results obtained with the participation of the author. Unfortunately, the size of the monograph does not allow the author to include the results of the doctoral thesis of A. K. Kushpel’ devoted to the investigation of the widths of classes of (ψ, β)-differentiable functions, the doctoral thesis of N. L. Pachulia, where problems of strong summability of Fourier series on the sets Lψ β were studied, and the doctoral theses of P. V. Zaderei and A. S. Romanyuk, where approximations of (ψ, β)-differentiable functions of many variables were investigated. Early results on these subjects were presented by the author in his monograph Classification and Approximation of Periodic Functions [Naukova Dumka, Kiev (1987); English version: Kluwer, Dordrecht (1995)]. The main results of the present monograph have been obtained after 1987. In the presentation of the main material, as a rule, we do not refer the reader to the literature; all references are given in the bibliographical notes at the end of the book. The chapters of the monograph are divided into sections, which, in turn, are divided into subsections enumerated by two numbers: the first stands for the number of the section and the second for the number of the subsection itself. The same enumeration is used for all kinds of statements and formulas. If we refer to statements or formulas from a different chapter, then we use triple enumeration, where the first number stands for the chapter and the other two have the meaning described above.
xviii
Preface
My first words of deep and sincere gratitude go to T. A. Andreeva, who patiently carried out the large and difficult work of computer typesetting and composition of the monograph. I am grateful to my colleagues A. S. Serdyuk and V. V. Savchuk for a great help in the preparation of the manuscript and to N. L. Bilokon’ for her kind help in the preparation of the English edition. The warmest words of gratitude are addressed to my wife and colleague N. I. Stepanets, who is the first technical and scientific editor of this book. I am grateful to the entire staff of the Institute of Mathematics of the National Academy of Sciences of Ukraine, where I have been working since 1965, for a creative and friendly atmosphere. A. Stepanets January, 2002–December, 2004
PART I 1. REGULARITY OF LINEAR METHODS OF SUMMATION OF FOURIER SERIES
1.
Introduction
1.1. Let f (x) be a 2π-periodic function Lebesgue summable on the period (f ∈ L) and let S[f ] =
∞
∞
k=1
k=0
a0 (ak cos kx + bk sin kx) ≡ Ak (f ; x) + 2
be its Fourier series, i.e., for any k = 0, 1, 2, . . . , π π 1 1 ak = ak (f ) = f (t) cos ktdt, bk = bk (f ) = f (t) sin ktdt; π π −π
(1.1)
(1.2)
−π
the nth-order partial sum Sn (f ; x) of series (1.1) is the trigonometric polynomial called the nth-order Fourier sum for the function f (x). (n) Further, let Λ = λk , n = 0, 1, . . . , k = 0, 1, . . . , n, be an arbitrary infinite triangular numerical matrix. We associate every function f ∈ L, on the basis of its expansion in a Fourier series, with a sequence of polynomials Un (f ; x; Λ) of the form a0 (n) (n) Un (f ; x; Λ) = λ0 + λk (ak cos kx + bk sin kx). 2 n
(1.3)
k=1
Thus, every triangular matrix Λ determines a method for the construction of polynomials Un (f ; x; Λ), or, in other words, a certain sequence of polynomial operators Un (f ; Λ) is defined on the set L. In this case, one says that the matrix Λ 1
2
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
determines a certain linear method, or a process, of summation of Fourier series. It is clear that, for any n ∈ N, the operators Un (f ; Λ) are linear. For this reason, the Λ-methods are also called linear methods, or processes, of summation of Fourier series. Substituting the representation of Fourier coefficients (1.2) in (1.3), we obtain 1 Un (f ; x) = Un (f ; x; Λ) = π where
π f (t + x)Un (t; Λ)dt, −π
(n) λo λk cos kt + 2 (n)
Un (t) = Un (t; Λ) =
(1.4)
n
(1.5)
k=1
is a trigonometric polynomial of degree n, which is called the kernel of the operator (method) Un (f ; Λ). (n) If the matrix Λ is such that λk ≡ 1, then, obviously, Un (f ; x; Λ) ≡ Sn (f ; x). According to the accepted terminology, this method is called the method of partial Fourier sums. In this case, 1 cos kt + 2 n
Un (t; Λ) = Dn (t) =
(1.5 )
k=1
is the Dirichlet kernel of order n. Among linear methods different from the method of partial Fourier sums, one should, first of all, mention the classical arithmetic-mean method (Fej´er method). (n) This method is determined by the matrix Λ in which λk = 1 − k/n, k = 0, 1, . . . , n − 1. In this case, the polynomials Un (f ; x; Λ) have the form 1 Sk (f ; x) n n−1
Un (f ; x; Λ) = σn (f ; x) =
(1.6)
k=0
and are called Fej´er sums. The well-known Fej´er theorem states the following: If f (x) is a continuous 2π-periodic function (f ∈ C), then its Fourier series is uniformly summable by the Fej´er method, i.e., for any f ∈ C, the following relation holds uniformly on the period: lim σn (f ; x) = f (x). (1.7) n→∞
This theorem put an end to scepticism existed in the theory of Fourier series in the last century and connected with the fact that functions whose Fourier series
Section 1
Introduction
3
diverge at certain points exist even in the set C. The Fej´er theorem is a starting point in the contemporary theory of summation of Fourier series. Later, various authors proposed other linear summation methods, among which methods of de la Vall´ee Poussin, Riesz, Rogosinski, Zygmund, Bernstein, etc. (n) The de la Vall´ee Poussin method is determined by the matrix Λ = λk in which ⎧ 0 ≤ k ≤ m, ⎨1, (n) λk = n − k (1.8) ⎩ , m < k ≤ n. n−m In this case, the polynomials Un (f ; x; Λ) = Vmn (f ; x) =
n−1 1 Sk (f ; x) n−m
(1.9)
k=m
are called de la Vall´ee Poussin sums. It is clear that, for m = 0, we have V0n (f ; x) = σn (f ; x). If 2 σ k (n) , k = 0, 1, . . . , n − 1, δ > 0, λk = 1 − n then Un (f ; x; Λ) ≡
Snδ (f ; x)
δ n k2 a0 1 − 2 (ak cos kx+bk sin kx). (1.10) = + 2 n k=1
This method of summation is called the Riesz method, and the polynomials Snδ (f ; x) are called Riesz sums. kπ (n) In the case where λk = cos , k = 0, 1, . . . , n − 1, we obtain the Ro2n gosinski method. Here, 1 Un (f ; x; Λ) ≡ Rn (f ; x) = (Sn (f ; x + π/2n) + Sn (f ; x − π/2n)). 2 The polynomials Rn (f ; x) are called Rogosinski sums.
(1.11)
4
Regularity of Linear Methods of Summation of Fourier Series Setting
(n) λk
Chapter 1
s k = 1− , s > 0, we obtain the Zygmund method. The n
polynomials Un (f ; x; Λ) ≡ Zn(s) (f ; x) s n−1 k a0 1− (ak cos kx + bk sin kx) = + 2 n
(1.12)
k=1
(1)
are called Zygmund sums. For s = 1, we have Zn (f ; x) = σn (f ; x). 1.2. Each of these methods became a milestone in the theory of approximation of functions and the theory of Fourier series. Their different properties were investigated by greatest mathematicians for many decades. Main attention was given to properties that characterize the approximation capability of the methods under study. As a result of the investigation of certain linear methods, new approaches were developed that enable one to correctly formulate and successfully solve the corresponding problems also for general linear methods, i.e., in the case where a summation method is determined by an arbitrary numerical matrix Λ, (n) and it is only known that its elements λk satisfy certain conditions. In the course of investigation of general linear methods, the following question naturally (n) arises: What conditions should be imposed on the numbers λk in order that the sequence Un (f ; x; Λ) converge uniformly on the entire space C, i.e., in order that the following relation hold for all f ∈ C : lim f (x) − Un (f ; x; Λ)C = 0.
n→∞
(1.13)
If this relation is true, then the method Un (f ; Λ) is called regular in the space C, or simply regular. An exhaustive answer to this question is given by the following theorem: Theorem 1.1. In order that a sequence of polynomials Un (f ; x; Λ) converge uniformly to f (x) on the entire space C of continuous 2π-periodic functions, it is necessary and sufficient that, for any fixed k = 0, 1, . . . , n, (n)
lim λk = 1,
(1.14)
n→∞
and, moreover, that the sequence of numbers 2 Ln (Λ) = π
π |Un (t; Λ)|dt, 0
n = 0, 1, . . . ,
(1.15)
Section 1
Introduction
5
which are called the Lebesgue constants of the given method, be bounded: Ln (Λ) = O(1),
n → ∞.
(1.16)
Proof. If equality (1.13) holds for any f ∈ C, then it also holds in the space Tm of trigonometric polynomials Pm (x) of degree m, i.e., for any Pm ∈ Tm , one has lim Un (Pm ; x; Λ) − Pm (x)C = 0. (1.17) n→∞
However, this is obviously true only if (1.14) holds. Furthermore, according to the known Banach theorem, in order that a sequence of linear operators Un (f ) that map a complete normed vector space F into its part possess the property lim f − Un (f )F = 0,
n→∞
it is necessary that Un F = sup{Un (f )F : f ∈ F, f F ≤ 1} = O(1),
n → ∞.
(1.18)
The space C is complete, and, by virtue of (1.4), it is obvious that π 1 f (t)Un (t − x; Λ)dt Un (Λ)C = sup Un (f ; x; Λ)C = sup f C ≤1 f C ≤1 π −π
=
1 π
C
π |Un (t; Λ)|dt = Ln (Λ).
(1.19)
−π
Thus, the conditions of the theorem are necessary. Let us show that they are sufficient. According to the classical Weierstrass theorem, any function f ∈ C can be approximated by trigonometric polynomials with arbitrary accuracy. In (ε) other words, for any ε > 0 and f ∈ C, there exists a polynomial Pm (f ; x) such that (ε) f (x) − Pm (f ; x)C < ε. (1.20) Consequently, for any Λ and n, the following relation is true: f (x) − Un (f ; x; Λ)C (ε) (ε) ≤ f (x) − Pm (f ; x)C + Pm (f ; x) − Un (f ; x; Λ)C (ε) (ε) (ε) ≤ ε + Pm (f ; x) − Un (Pm ; x; Λ)C + Un (Pm − f ; x; Λ)C . (1.21)
6
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
However, by virtue of (1.4) and (1.20), we have π 2ε (ε) |Un (t; Λ)|dt = εLn (Λ). Un (Pm − f ; x; Λ)C ≤ π 0
Hence, (ε) (ε) f (x) − Un (f ; x; Λ)C ≤ ε(1 + Ln (Λ)) + Pm (f ; x) − Un (Pm ; x; Λ).
Therefore, conditions (1.14) and (1.16) indeed guarantee the validity of relation (1.13). The theorem is proved. As a rule, condition (1.14) can be fairly easily verified. In particular, its validity is obvious for all examples in Subsection 1.2. The verification of condition (1.16), in many cases, encounters serious difficulties. There are numerous deep investigations devoted to this problem, in which sufficient (and often necessary) (n) conditions on the numbers λk that guarantee the validity of relation (1.16) are obtained. The results related to this problem are presented in Sections 2–8. It is shown in Section 3 that the Lebesgue constants for Fourier sums increase unboundedly. Therefore, by virtue of Theorem 1.1, the sums Sn (f ; x) cannot converge uniformly on the entire class C. n (f ; x) = S If we set m = n − 1 in (1.9), then we obtain Vn−1 n−1 (f ; x). Hence, for arbitrarily chosen numbers m, de la Vall´ee Poussin sums are also not convergent on the entire space C. For the other methods considered in Subsection 1.1, the sequences of Lebesgue constants are bounded, and, thus, these methods induce sequences of polynomials that are uniformly convergent for any f ∈ C. This is also true for the sums Vmn (f ; x) with properly chosen m, e.g., if one sets n − m = [kn], where k ∈ (0, 1).
2.
Nikol’skii and Nagy Theorems
2.1. The first result that establishes conditions for the boundedness of the Lebesgue constants, and, consequently, conditions for the regularity of a given (n) general method Un (f ; Λ) in terms of the elements λk of the matrix Λ belongs to S. M. Nikol’skii. He proved the following theorem: (n)
Theorem 2.1. Suppose that, for any n ∈ N, the system of numbers λk , (n) (n) k = 0, n, λ0 = 1, λn+1 = 0, is convex upwards or downwards, i.e., (n)
(n)
(n)
(n)
Δ2k = Δ2 λk = λk − 2λk+1 + λk+2 ≥ 0 or
Δ2k ≤ 0, k = 0, n − 1. (2.1)
Section 2
Nikol’skii and Nagy Theorems
7
Then the conditions (n)
|λk | ≤ K, and
k = 1, 2, . . . , n, n ∈ N,
n λ(n) k ≤ K1 n − k + 1
(2.2)
(2.3)
k=1
are necessary and sufficient for the following inequality to be true: 2 Ln (Λ) = π
π n 1 (n) λk cos kt dt ≤ K2 , + 2
(2.4)
k=1
0
where K2 is a constant independent of n ∈ N. The necessity of condition (2.2) is obvious:
n 2 π 1 (n) (n) λm cos mt cos ktdt ≤ Ln (Λ). + λk = π 2 m=1
0
Further, let fn (t) = sign sin(n + 1)t
n+1 k=1
n+1 ∞ sin kt 4 sin kt sin(2m − 1)(n + 1)t = . k π k 2m − 1 m=1
k=1
The expansion of this function in a Fourier series has the form S[fn ] =
n ∞ 2 cos kt αk cos kt, + π n−k+1 k=0
k=n+1
where αk are certain numbers. Therefore, π π
n n 2 1 cos kt (n) Un (t; Λ)fn (t)dt = λk cos kt + dt π 2 n−k+1 k=1 k=0 0 0 n λ(n) k = . n − k + 1 k=0
8
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
At the same time, π π Un (t; Λ)fn (t)dt ≤ fn (t)C |Un (t; Λ)|dt = fn (t)C π Ln (Λ). 2 0
0
However, it is well known that, for any n ∈ N, n sin kt k=1
Hence, we always have
k
π <
sin t dt = siπ. t
(2.5)
0
n λ(n) π k < siπLn (Λ). n − k + 1 2
(2.6)
k=0
It is convenient to combine the proof of the sufficiency of the conditions of Theorem 2.1 with the proof of the Nagy theorem presented below. First, we make several notes. 2.2. Let FC be the set of numerical matrices Λ such that, for any f ∈ C, the following equality holds at any point x: lim Un (f ; x; Λ) = f (x).
n→∞
(2.7)
Let FL be the set of matrices that satisfy (2.7) at any Lebesgue point for any function from L. Since every continuity point of a function f ∈ L is its Lebesgue point, the following inclusion is obviously true: F L ⊆ FC .
(2.8)
Also note that if Λ ∈ FC , then the method Un (f ; Λ) defined by this matrix is regular, i.e., for any f ∈ C, the convergence in (2.7) is uniform. This is a simple consequence of inequality (1.21). Thus, by virtue of (2.8), every matrix Λ ∈ FL also determines a method regular in C. The Nagy theorem states the following: Theorem 2.2. If the matrix Λ satisfies conditions (1.14) and, in addition, for any n ∈ N, n n−1 n−k 2 Nn (Λ) = (2.9) |Δk | ≤ K, i k=0 i=n−k
(n)
where Δ2k = Δ2 λk
and K is an absolute constant, then Λ ∈ FL .
Section 2
Nikol’skii and Nagy Theorems
9
First, let us show that conditions (2.1)–(2.3) yield estimate (2.9). Indeed, since (n) the system of numbers λk , k = 0, n, is convex, by setting (n)
(n)
(n)
Δk = Δλk = λk − λk+1 = λk − λk+1
(2.10)
we get Nn (Λ) =
n−1
(n −
n
k)Δ2k
k=0
i−1
i=n−k
= Δ0 +
n−1
Δk
k=1
i=1
= Δ0 +
n
−1
i
((n − k) − (n − k + 1)) + 1
i=n−k+1 n
− Δn
n
i−1
Δk
1−
k=1
n
−1
i
− Δn .
i=n−k+1
Substituting expression (2.10) for Δk in this relation and taking into account that (n) λn+1 = 0, we get Nn (Λ) = Δ0 +
n
(λk − λk+1 ) 1 −
k=1
= Δ0 +
n
n
λk
k=2
= λ0 − λn −
−1
i
i=n−k+1 n
i=n−k+2
k=n−k+1
n
i−1 −
− λn
i−1
+ λ1 (1 − n−1 ) − λn
i=n−k+1
λk . n+1−k
Therefore, proving Theorem 2.2, we also prove the sufficiency of the conditions of Theorem 2.1. Proof of Theorem 2.2. We begin with the following lemma: Lemma 2.1. Let Un (t), n ∈ N, be a sequence of functions continuous on [0, π] and satisfying the following conditions:
10
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
(a) for any δ ∈ (0, π), the quantity mn (δ) = max |Un (t)| tends to zero as δ≤t≤π n→∞: (2.11) lim mn (δ) = 0 ∀δ ∈ (0, π); n→∞
(b) there exists a function Un∗ (t) monotonically decreasing on [0, π] and such that, for t ∈ [0, π], (2.12) |Un (t)| ≤ |Un∗ (t)|, and, moreover,
π
|Un∗ (t)|dt ≤ K,
(2.13)
0
where K is an absolute constant. Further, let f ∈ L, ϕx (t) = f (x − t) − 2f (x) + f (x + t), and
(2.14)
t Φx (t) =
ϕx (v)dv. 0
If x is a point where lim t−1 Φx (t) = 0,
(2.15)
t→0
then 1 lim n→∞ π
π ϕx (t)Un (t)dt = 0.
(2.16)
0
Proof. As a consequence of (2.14), for any ε > 0 there exists δ > 0 such that Φx (t) < εt for any t ∈ [0, δ]. For such δ, in view of (2.11) we get δ δ δ ∗ ∗ δ ϕx (t)Un (t)dt ≤ |ϕx (t)|Un (t)dt = (Φx (t)Un (t))0 − Φx (t)dUn∗ (t) 0
0
≤ εδUn∗ (δ) − ε
0
δ 0
tdUn∗ (t) = ε
δ 0
Un∗ (t)dt ≤ K1 ε.
(2.17)
Section 2
Nikol’skii and Nagy Theorems
11
At the same time, according to (2.10), for sufficiently large n we have π π ϕx (t)Un (t)dt ≤ mn (δ) |ϕx (t)|dt ≤ K2 ε.
(2.17 )
0
δ
Combining these estimates, we arrive at equality (2.15). The lemma is proved. It is well known that every Lebesgue point of the function f (·) satisfies condition (2.15). Moreover, by virtue of (1.4) and (1.5), 1 Un (f ; x; Λ) − f (x) = π
π ϕx (t)Un (t; Λ)dt. 0
Therefore, according to the lemma, to prove Theorem 2.2 it suffices to show that if inequality (2.9) is true, then the kernel Un (t) = Un (t; Λ) satisfies conditions (a) and (b). Denoting, as before, the Dirichlet kernel by Dk (t), we set Mk (t) =
k
Di (t),
Nk (t) = Mk (t) − Mn (t),
k = 0, 1, . . . , n.
(2.18)
i=0
Since, for any k ∈ N, Dk (t) = (sin(2k + 1)t/2)/(2 sin t/2), we conclude that −1
Mk (t) = (2 sin(t/2)) =
t 4 sin 2 2
=
4 sin2
t 2
−1
−1
t 3t 2k + 1 sin + sin + . . . + sin t 2 2 2
(2.19)
(1 − cos t + (cos t − cos 2t) + . . . + (cos kt − cos(k + 1)t)) (1 − cos(k + 1)t),
i.e., Mk (t) = (sin2 (k + 1)t/2)/2 sin2
t 2
(2.20)
12
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
and, hence,
t t Nk (t) = − sin(n + k + 2) sin(n − k) 2 2
t /2 sin2 . 2
(2.21)
Applying twice the Abel transformation, according to which, for arbitrary real u0 , u1 , . . . and v0 , v1 , . . . and any n ∈ N, one has n
uk vk =
k=0
n−1
(uk − uk+1 )Vk + un Vn ,
Vk =
k
vi ,
(2.22)
i=0
k=0
and setting ν = [(n + 1)/2], we obtain
Un (t; Λ) =
n
Dk (t)Δk =
k=0
=
ν−1
n−1
Mk (t)Δ2k + Mn (t)Δn
k=0
Mk (t)Δ2k
k=0
+
n−1
Nk (t)Δ2k + Mn (t)Δν .
(2.23)
k=ν
It follows from (2.20) and (2.21) that, for any δ > 0, the functions |Mk (t)| and δ |Nk (t)| are bounded on the segment [δ, π] by sin−2 . Thus, 2 mn (δ) = max |Un (t; Λ)| ≤ sin−2 δ≤t≤π
δ 2
n−1
|Δ2k | + Δν
.
(2.24)
k=0
Let us verify that, under condition (2.9), the right-hand side of (2.24) tends to zero as n → ∞. Since n n−k k+1 ≥ (n − k) > i n
i=n−k
(k + 1)/2
if 0 ≤ k < ν,
(n − k)/2 if ν ≤ k ≤ n,
relation (2.9) yields ν−1 k=0
(k −
1)|Δ2k |
< K1 ,
n−1 k=ν
(n − k)|Δ2k | ≤ K2 .
(2.25)
Section 2
Nikol’skii and Nagy Theorems
13
Here and in what follows, K and Ki , i ∈ N, are absolute positive constants. Further, using the Abel transformation, we get 1 = λ0 − λn+1 =
n
ν−1
Δk =
k=0
=
ν−1
(k +
1)Δ2k
Δk +
k=0
n
Δk
k=ν
+ νΔν + (n − ν + 1)Δν −
k=0
n−1
(n − k)Δ2k .
k=ν
Hence, (n + 1)Δν = 1 −
ν−1
(k +
1)Δ2k
+
k=0
n−1
(n − k)Δ2k .
k=ν
Therefore, in view of (2.25), (n + 1)|Δν | ≤ K3 .
(2.26)
Let us show that, in the case considered, lim
n−1
n→∞
|Δ2k | = lim
n→∞
k=0
n−1
(n)
|Δ2 λk | = 0.
(2.27)
k=0
Let r be an arbitrary natural number. We define a number n0 = n0 (r) so that, for n ≥ n0 and all m ≤ r, the following inequality is true: n
i−1 > r.
(2.28)
i=m
It is clear that such a number n0 (r) always exists. For n ≥ n0 (r), in view of (2.25) and (2.28), we have n−1
|Δ2k |
≤
k=0
r−1 k=0
|Δ2k |
ν−1 n−r 1 1 2 + (k + 1)|Δk | + (n − k)|Δ2k | r r k=r k=ν
n n−1 n−k 1 |Δ2k | + r i k=n−r+1
≤
r−1 k=0
|Δ2 λk | + r−1 K4 . (n)
i=n−k
(2.29)
14
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
This yields equality (2.27) because, for any ε > 0, one can find r such that r−1 K4 < ε/2 and then, according to (1.14), choose n so large that r−1
(n)
|Δ2 λk | < ε/2.
k=0
Combining (2.24), (2.26), and (2.27), we get lim mn (δ) = 0 ∀δ ∈ (0, π].
n→∞
To prove Theorem 2.2, it remains to show that the kernel Un (t; Λ) satisfies condition (b). To this end, we set 2 π (k + 1)2 /8, 0 ≤ t ≤ 2/(k + 1), ∗ Mk (t) = 2/(k + 1) ≤ t ≤ π. π 2 /2t2 , It is clear that, for any t ∈ [0, π], we have |Mk (t)| ≤ Mk∗ (t) and π
Mk∗ (t)dt ≤ K5 (k + 1).
(2.30)
0
Also let ⎧ 2 π (n + k + 2)(n − k)/4, 0 ≤ t ≤ 2/(n + k + 2), ⎪ ⎪ ⎨ Nk∗ (t) = π 2 (n − k)/2t, 2/(n + k + 2) ≤ 2/(n − k), ⎪ ⎪ ⎩ 2 2 π /t , 2/(n − k) ≤ t ≤ π. Then, for any t ∈ [0, π], one has |Nk (t)| ≤ Nk∗ (t) and π 0
Nk∗ (t)dt
π2 n+k+2 −π = (n − k) 2 + ln 2 n−k π2 n+1 < (n − k) 2 + ln 2 + ln 2 n−k
n i−1 . < K6 (n − k) 1 + i=n−k
(2.31)
Section 3
Lebesgue Constants of Classical Linear Methods
15
We define the required function Un∗ (t; Λ) by the formula Un∗ (t; Λ) =
ν−1
Mk∗ (t)|Δ2k | +
k=0
n−1
Nk∗ (t)|Δ2k | + Mn∗ (t)|Δν |.
k=ν
It is easy to see that it decreases monotonically and satisfies the condition |Un (t; Λ)| ≤ Un∗ (t; Λ), and, furthermore, by virtue of (2.30), (2.31), (2.25), and (2.26), we have π Un∗ (t; Λ)dt ≤ K. 0
Theorems 2.2 and 2.1 are proved.
3.
Lebesgue Constants of Classical Linear Methods
The statements established in Section 2 enable one to solve the problem of the boundedness of Lebesgue constants for a wide range of linear methods. At the same time, more complete information about these constants is available for several classical linear methods. 3.1. According to Subsection 1.1, the kernel of the Fourier method is the trigonometric polynomial 1 sin(2n + 1)t/2 cos kt = + . 2 2 sin(t/2) n
Dn (t) =
(3.1)
k=1
Therefore, in view of (1.15), the Lebesgue constant Ln of the Fourier method has the form 2 Ln = π
π
| sin((2n + 1)t/2)| 2 dt = sin(t/2) π
0
=
2 π
π/2
π/2
| sin(2n + 1)t| dt sin t
0
| sin(2n + 1)t| dt + r1 (n), t
0
where 2 r1 (n) = π
π/2 t − sin t | sin(2n + 1)t| dt. t sin t 0
(3.2)
16
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
For t ∈ [0, π/2], we have sin t > t − t3 /6 and sin t > 2t/π, whence 2 r1 (n) ≤ π
π/2
πt π2 dt = . 12 48
(3.3)
0
Further, according to (3.2), we get n−1 2 Ln = π
π/(2n+1)
sin(2n + 1)t
k=0
2 = π
0
π sin t
n−1 k=0
0
2 = π
dt + r1 (n) t + kπ/(2n + 1)
π sin t
n−1 k=1
0
1 dt + r1 (n) t + kπ 1 2 dt + t + kπ π
π
sin t dt + r1 (n). t
(3.4)
0
For t ∈ [0, π], we have n n−1 n−1 n−1 1 11 1 11 ≤ ≤ ≤ , π k (k + 1)π t + kπ π k k=2
i.e.,
n−1 k=1
k=1
k=1
1 1 = t + kπ π
k=1
n−1
1 − θn , k
θn ∈ [0, 1].
(3.5)
k=1
At the same time, for any n ∈ N, we get ln n <
n−1 k=1
i.e.,
n−1 k=1
1 1 = + 1 < ln n + 1, k k n−1
(3.6)
k=2
1 = ln n + θn , k
θn ∈ (0, 1).
(3.7)
Thus, according to (3.5) and (3.7), for any t ∈ [0, π] and n ∈ N the following relation is true: n−1 k=1
1 1 = ln n + Δn , t + kπ π
|Δn | ≤ π −1 .
(3.8)
Section 3
Lebesgue Constants of Classical Linear Methods
17
Substituting this relation in (3.4) and taking into account that π
sin t dt = siπ = 1.8519 . . . , t
0
we obtain
4 2 ln n + siπ + r2 (n), 2 π π where, according to (3.3) and (3.8), Ln =
|r2 (n)| ≤ |r1 (n)| + or
4 π2 4 |Δn | < + 2 < 0.611, π 48 π
4 ln n + Rn , π2
Ln =
|Rn | < 1.8.
(3.9)
(3.10)
(3.11)
3.2. The polynomial n−1 n−1 1 k 1 cos kt = 1− Dk (t). Fn (t) = + 2 n n k=1
(3.12)
k=0
is called the Fej´er kernel of order n − 1. Using equality (3.1), we get Fn (t) = (2n sin t/2)−1 (sin t/2 + sin(3t/2) + . . . + sin((2n − 1)t/2)) = (4n sin2 t/2)−1 ((1 − cos t) + (cos t − cos 2t) + . . . + (cos(n − 1)t − cos nt)) = (1 − cos nt)/4n sin2 t/2 =
sin2 nt/2 . 2n sin2 t/2
(3.13)
Therefore, Fn (t) ≥ 0 for any t. Thus, for the Lebesgue constant of the Fej´er method, we have 2 Fn = π
π 0
2 |Fn (t)|dt = π
π Fn (t)dt = 1. 0
(3.14)
18
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
3.3. According to equalities (1.5) and (1.8), the kernel of the de la Vall´ee Poussin method is the polynomial n−1 n−1 k 1 n cos kt, (3.15) Vmn (t) = 1− Dk (t) = Dm (t) + n−m n−m n k=m
k=m+1
so that Vnn+1 (t) = Dn (t),
V0n = Fn (t).
(3.16)
It follows from (3.15), (3.12), and (3.13) that Vmn (t) = =
1 (nFn (t) − mFm (t)) n−m sin2 nt/2 − sin2 mt/2 cos mt − cos nt = . 2 (n − m)2 sin t/2 4(n − m) sin2 t/2
(3.17)
This yields the following estimate for the Lebesgue constants of the de la Vall´ee Poussin method: π 2 n+m n |Vmn (t)|dt ≤ Vm = . (3.18) π n−m 0
Therefore, if, e.g., n−m ≥ cn, where c is an arbitrary positive number, then the quantities Vmn are uniformly bounded by the number 2/c. The values of Vmn can be computed for some combinations of the numbers n and m. In particular, it is easy to find the values Vn2n and Vn3n . According to (3.17), we have Vn2n (t) =
cos nt − cos 2nt , 4n sin2 t/2
Vn3n (t) =
Since sign(cos t − cos 2t) =
1,
cos nt − cos 3nt . 8n sin2 t/2
t ∈ (0, 2π/3),
−1, t ∈ (2π/3, π),
and, for t ∈ (0, π), sign(cos t − cos 3t) = sign cos t, the following Fourier expansions are true: S[sign(cos t − cos 2t)] =
∞ 1 4 sin 2kπ/3 + cos kt, 3 π k k=1
∞ cos(2k + 1)t 4 (−1)k S[sign cos t] = . π 2k + 1 k=0
(3.19)
Section 3
Lebesgue Constants of Classical Linear Methods
19
Hence, S[signVn2n (t)]
√ 3 1 2√ = + 3 cos nt − cos 2nt + . . . , 3 π π
(3.19 )
4 4 S[signVn3n (t)] = cos nt − cos 3nt + . . . . π 3π Taking into account these expansions and equality (3.15), we obtain Vn2n
1 = π 1 = π
π |Vn2n (t)|dt −π
π
−π
n 2n−1 1 k cos kt signVn2n (t)dt 1− cos kt + 2 + 2 2n k=1
k=n+1
√ 1 2 3 = + , 3 π Vn3n
1 = π =
π −π
(3.20)
n 3n−1 1 k 3 cos kt signVn3n (t)dt 1− cos kt + + 2 2 3n k=1
k=n+1
4 . π
(3.21)
3.4. The kernel of the Rogosinski method, in view of (1.11), has the form 1 kπ 1 cos Rn (t) = + cos kt = (Dn (t + π/2n) + Dn (t − π/2n)) , (3.22) 2 2n 2 n−1 k=1
or, with regard for (3.1), Rn (t) =
cos nt sin π/2n . 2 cos t − cos π/2n
Hence, sign Rn (t) = −sign cos nt + e(t), where 2, |t| < π/2n, e(t) = 0, π/2n < |t| < π.
(3.23)
20
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
The Fourier expansion of the function e(t) has the form S[e(t)] =
∞ 41 kπ 1 + sin cos kt. n π k 2n k=1
Therefore, taking into account equalities (3.19) and (3.19 ), we get 1 Rn = π
π −π
1 |Rn (t)|dt = π
=
π Rn (t)
n−1 1 41 kπ + sin cos kt dt n π k 2n k=1
−π
n−1 21 kπ 1 + sin . n π k n
(3.24)
k=1
Now, using estimate (2.6), we obtain Rn < siπ + 1/n.
(3.25)
3.5. The kernel of the Riesz method, according to (1.10), is the polynomial Rnδ (t)
2 δ n−1 k 1 1− = + cos kt, 2 n
δ > 0,
(3.26)
k=1
and the kernel of the Zygmund method is the polynomial Zns (t)
s n−1 k 1 1− cos kt, = + 2 n
s > 0.
k=1
Representations of these kernels in a form similar to (3.1), (3.13), (3.17), and (3.23) are unknown, except for the case where s = 1 in the Zygmund method. This complicates the direct determination of upper bounds for their Lebesgue constants. At the same time, the boundedness of these constants follows from Theorem 2.1. Indeed, setting 2 δ k 1− , n
(n) λk
=
Section 4
Lower Bounds for Lebesgue Constants (n)
21
(n)
we conclude that the system of numbers λk , k = 0, n, λn+1 = 0, satisfies conditions (2.1), (2.2), and (3.3) because, in this case, the expression n (1 − (k/n)2 )δ k=1
n−k+1
=
n−1 k=1
(1 − (k/n)2 )δ 1 , 1 − (k − 1)/n n
δ > 0,
is the integral sum for the integral 1 0
(1 − u2 )δ du = 1−u
1
(1 − (1 − t)2 )δ dt t
0
1
1 t
=
δ−1
(2 − t) dt ≤ 2 δ
0
δ
tδ−1 dt < δ −1 .
0
Thus, the constants Rn of the Riesz method are uniformly bounded. By analogy, we establish the boundedness of the Lebesgue constants Zns of (n) (n) the Zygmund method. If λk = 1 − (k/n)s , k = 0, n, λn+1 = 0, then conditions (2.1) and (2.2) are obvious. The expression n 1 − (k/n)s k=1
n−k+1
=
n−1 k=1
1 − (k/n)s 1 , 1 − (k − 1)/n n
s > 0,
is the integral sum for the integral 1 0
1 − us du 1−u
of a bounded function. Thus, condition (2.3) is satisfied, and, hence, the constants Zns are uniformly bounded.
4.
Lower Bounds for Lebesgue Constants 4.1. Inequality (2.6) means that, for an arbitrary trigonometric polynomial a0 ak cos kt, Kn (t) = + 2 n
k=1
22
Regularity of Linear Methods of Summation of Fourier Series
we have
π n a k ≤ C1 |Kn (t)|dt, n − k + 1 k=0
Chapter 1
C1 = siπ.
(4.1)
0
Along with this estimate, the following statement is often useful: Theorem 4.1. If ak ≡ 0, then, for any n ∈ N, n k=0
|ak | <2 n − k + 1/2
π |Kn (t)|dt.
(4.2)
0
Proof. The proof is based on the following fact from the theory of analytic functions. Lemma 4.1. Let f (z) =
∞
ck z k , ck ≡ 0,
k=0
be a function regular in the circle |z| < 1 and let 1 lim r→1−θ 2π
2π |f (reiθ )|dθ = M1 (f ) < ∞. 0
Then
∞ k=0
|ck | < πM1 (f ). k + 1/2
(4.3)
To use this lemma, note that Kn (t) =
n n a0 1 ak cos kt = ak eikt , + 2 2 k=1
a−k = ak ,
k=−n
and, hence, π
1 |Kn (t)|dt = 4
0
2π 2π n n 1 ikt i(k+n)t dt = a e a e dt. k k 4 0
k=−n
0
k=−n
Therefore, setting p2n (z) = an + an−1 z + . . . + a0 z n + a1 z n+1 + . . . + an z 2n ,
Section 5
Linear Methods Determined by Rectangular Matrices
we get
π
1 |Kn (t)|dt = 4
0
2π |p2n (eiθ )|dθ =
π M1 (p2n ). 2
23
(4.4)
0
Using inequality (4.3), we obtain the estimate |an | |an−1 | |a0 | |a1 | |an | + + ... + + + ... + 1/2 1 + 1/2 n + 1/2 n + 1 + 1/2 2n + 1/2 π < πM1 (p2n ) = 2 |Kn (t)|dt, 0
which immediately yields (4.2). The theorem is proved. Theorem 4.1 yields the following statement: Theorem 4.2. For the Lebesgue constants Ln (Λ) of the method Un (Λ) with the kernel n (n) λ0 (n) Un (t; Λ) = λk cos kt, + 2 k=1
the following estimates are true: 2 Ln (Λ) = π
π 0
5.
n (n) 1 |λk | |Un (t; Λ)|dt > , π n−k+1
n ∈ N.
(4.5)
k=1
Linear Methods Determined by Rectangular Matrices
5.1. In the previous sections, the matrix Λ was regarded as triangular, i.e., ≡ 0 for k > n. However, it is reasonable to omit this condition and consider (n) matrices Λ with arbitrary elements λk , n = 0, 1, . . . , k = 0, 1, . . . . With every function f ∈ L with Fourier series S[f ], we associate the sequence of series (n) λk
(n)
Un (f ; x; Λ) =
a0 λ1 2
+
∞
(n)
λk (ak cos kx + bk sin kx), n = 0, 1, . . . , (5.1)
k=1
which, in the case considered, may not be trigonometric polynomials; generally speaking, they may not even be Fourier series of certain functions.
24
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Thus, the following question naturally arises: For f ∈ C, what conditions (n) should be satisfied by the numbers λk in order that series (5.1) converge uniformly for any n ∈ N and lim f (x) − Un (f ; x; Λ)C = 0
n→∞
(5.2)
for every f ∈ C ? In this case, the summation method Un (Λ) determined by a given matrix Λ is also called regular in the space C, or simply regular. An answer to this question is given by the following theorem: Theorem 5.1. In order that the summation method Un (Λ) be regular in the space C, it is necessary and sufficient that the following conditions be satisfied: (i) for all k = 0, 1, 2, . . . , (n)
lim λk = 1;
(5.3)
n→∞
(ii) every function (n) λ0 λk cos kt, + 2 m
(n)
Kn(m) (t) =
n = 0, 1, . . . , m ∈ N
k=1
satisfies the condition π |Kn(m) (t)|dt ≤ Mn ,
n = 0, 1, . . . ,
(5.4)
0
where Mn is a constant independent of m; (iii) the total variation of the function x ¯ n (x) = lim K
(n)
Kn(m) (t)dt =
m→∞
xλ0 2
0
+
∞ 1 (n) λ sin kx k k k=1
is uniformly bounded on the segment [0, π] : π
π
¯n = VK 0
¯ n (t)| ≤ C. |dK 0
(5.5)
Section 5
Linear Methods Determined by Rectangular Matrices
25
Proof. The proof of this theorem is based on the following well-known statement from functional analysis: Theorem 5.2. In order that a sequence {Fm } of linear functionals be convergent to a functional F0 at every point f of a Banach space E, it is necessary and sufficient that the following conditions be satisfied: (i) the norms of the functionals Fm are uniformly bounded: Fm ≤ C;
(5.6)
(ii) if M is the set of functions ϕi , i = 0, 1, . . . , whose linear combinations are dense everywhere in E, then, for any ϕi ∈ M, lim Fm (ϕi ) = F0 (ϕi ),
i = 0, 1, 2, . . . .
m→∞
(5.7)
Conditions (i) and (ii) guarantee the validity of the following equality: lim Fm (f ) = F0 (f ) ∀f ∈ E.
m→∞
(5.8)
Furthermore, if f (v) is continuous on (a + α, b + β), 0 < α < β, and fx (t) = f (x + t), then (5.9) lim Fm (fx ) = F0 (fx ) m→∞
uniformly in t ∈ (α, β). If series (5.1) converge uniformly for any f ∈ C, then, setting (n)
(n) Fm (f )
=
=
(n) Fm (f ; x)
1 π
1 = π
a0 λ0 = 2
+
m
(n)
λk Ak (f ; x)
k=1
π f (x + t)Kn(m) (t)dt −π
π ¯ (m) (t), f (x + t)dK n −π
n = 0, 1, 2, . . . ,
(5.10)
26
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
we conclude that, according to Theorem 5.2, for this purpose it is necessary and sufficient that, first, the norms of the functionals Fm (f ) be bounded, i.e., π 1 (m) f (x + t)Kn (t)dt Fm (f ) = sup f C ≤1 π −π
π
2 π
=
|Kn(m) (t)|dt ≤ Cn ,
(5.11)
0
and, second, any function from the trigonometric system 1, cos x, sin x, cos 2x, sin 2x, . . .
(5.12)
satisfy condition (5.7), in particular, (n) (cos kx) lim Fm
m→∞
(n)
(n)
= lim λk cos kx = F0 (cos kx), m→∞
k = 0, 1, 2, . . . . (5.13)
(n)
In addition, the functional F0 (f ) satisfies the condition (n) F0 (f )
1 = lim m→∞ π
π ¯ nm (t). f (x + t)dK −π
However, in the space C, every linear functional has the form 1 π
π f (x + t)dK(t),
(5.14)
−π
where K(t) is a certain periodic function of bounded variation on the period. Therefore, taking into account the Helly theorem on the limit transition under the sign of Stieltjes integral, we get (n) F0 (f )
1 = π
π ¯ n (t) = Un (f ; x; Λ), f (x + t)dK −π
¯ n (t) is a function of bounded variation on the period. where K
(5.15)
Section 5
Linear Methods Determined by Rectangular Matrices
27
Thus, the uniform convergence of series (5.1) yields relations (5.11), (5.13), and (5.15), which immediately implies the necessity of conditions (5.3) and (5.4). Further, setting 1 Fn (f ; x) = Um (f ; x; Λ) = π
π ¯ n (t) f (x + t)dK −π
in Theorem 5.2, we conclude that the condition 2 Fm (f ; x) = π
π ¯ n (t)| < C, |dK
(5.16)
0
together with (5.3), is necessary and sufficient for equality (5.2) to be valid. Therefore, condition (5.5) is also necessary. The sufficiency of conditions (5.3)–(5.5) is also obvious, Indeed, if conditions (5.3) and (5.4) are satisfied, then relations (5.11), (5.13), and (5.15) are also true. Hence, series in (5.1) converge uniformly, and if, in addition, relation (5.5) holds, then, by virtue of (5.16), equality (5.2) is also true. 5.2. The simplest sufficient conditions for the regularity of a rectangular summation method are given by the following Karamata–Tomic theorem: Theorem 5.3. In order that the method Un (Λ) be regular in the space C, it (n) is sufficient that the elements λk of the matrix Λ satisfy the following conditions: (i) for all k = 0, 1, 2, . . . , one has (n)
lim λk = 1,
n→∞
(5.17)
and, for a fixed n, (n)
λk = O(1/ ln k),
k → ∞;
(5.18)
(ii) for every n, one can indicate a number m (fixed or tending to infinity with n) such that ∞ m+k m+k (n) |m − k| ln |Δ2 λk | ≤ C, m |m − k|
k=0 k =m
(5.19)
28
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
where (n)
(n)
(n)
(n)
Δ2 λk = λk − 2λk+1 + λk+2 and C is a constant independent of n. Proof. This theorem is a consequence of the Telyakovskii theorem presented in Subsection 8.5. We only note here that, for any fixed m, condition (5.19) is equivalent to the inequality ∞
(n)
(k + 1)|Δ2 λk | ≤ C1 ,
(5.20)
k=0 (n)
where the constant C1 is independent of n. In this case, the sequence λk , k = 0, 1, . . . , is called quasiconvex with respect to the index k uniformly in n ∈ N.
6.
Estimates for Integrals of Moduli of Functions Defined by Cosine and Sine Series
6.1. Many problems in approximation theory lead to the necessity of obtaining estimates for integrals of the form π ∞ a0 (ak cos kx + bk sin kx) dx + 2
−π
(6.1)
k=1
in terms of the coefficients ak and bk , k ∈ N. In this section, we obtain estimates for integral (6.1) in the case where the series in it consists only of cosines or only of sines, i.e., for the series ∞
a0 ak cos kx + 2
(6.2)
k=1
or
∞
ak sin kx.
(6.3)
k=1
First, we present several well-known facts from the general theory of trigonometric series related to series (6.2) and (6.3), which will be used in what follows.
Section 6
Estimates for Integrals of Moduli of Functions
29
The sequence {ak } is of bounded variation if ∞
|Δak | = V (a) < ∞,
(6.4)
k=0
where Δak = ak − ak+1 . Theorem 6.1. If a sequence {ak } is of bounded variation and lim ak = 0,
k→∞
(6.5)
then both series (6.2) and (6.3) converge uniformly on every segment ε ≤ x ≤ 2π−ε for any ε > 0. Furthermore, series (6.3) converges everywhere, and series (6.2) converges for all x ∈ [−π, π], except, possibly, the point x = 0. Theorem 6.2. If a trigonometric series converges in the interval (0, 2π) to some integrable function f (x), then it is the Fourier series of this function. Combining these theorems, we obtain the following statement: Corollary 6.1. If conditions (6.4) and (6.5) are satisfied and series (6.2) and (6.3) converge to integrable functions, then these series are the Fourier series of their sums. Theorem 6.3. If a sequence {ak } satisfies condition (6.5) and, for any k = 0, 1, . . . , one has Δ2 ak = ak − 2ak+1 + ak+2 ≥ 0, (6.6) then series (6.2) converges everywhere, except, possibly, the point x = 0, to some integrable function c(x) and is its Fourier series; moreover, c(x) ≥ 0. Condition (6.6) is essential: one can indicate a series of the form (6.2) with coefficients monotonically tending to zero whose sum does not belong to L. Theorem 6.4. Suppose that the sequence {ak } tends monotonically to zero as k → ∞. Then the sum g(x) of series (6.3) is integrable if and only if ∞
ak /k < ∞.
(6.7)
k=1
If condition (6.7) is satisfied, then series (6.3) is the Fourier series of the function g(x), and series (6.2) is the Fourier series of some function c ∈ L.
30
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Theorem 6.4. If both series ∞
a0 (ak cos kx + bk sin kx) + 2 k=1
and
∞
(ak sin kx − bk cos kx)
k=1
are Fourier series, then
∞ a2n + b2n /n < ∞. n=1
6.2. The main result for series of the form (6.2) to be proved here is the following theorem: Theorem 6.5. Suppose that series (6.2) satisfies conditions (6.4) and (6.5) and, furthermore, n/2 ∞ Δan−k − Δan+k | | = B(a) < ∞, k
df
n/2 =[n/2].
(6.8)
n=2 k=1
Then series (6.2) is a Fourier series and the following estimate holds: π I=
∞
a0 | + an cos nx|dx ≤ C(V (a) + B(a)), 2
(6.9)
n=1
0
where C is a certain absolute constant. Proof. By virtue of Corollary 6.1, the theorem will be proved if we establish estimate (6.9). Performing the Abel transformation, setting Δak = Δk , and taking relation (2.19) into account, we get π ∞ I= | Δk sin(k + 1/2)x| k=0
0
2 ≤ π
π | 0
∞ k=0
dx 2 sin x/2
Δk sin(2k + 1)x|
dx . x
(6.10)
Section 6
Estimates for Integrals of Moduli of Functions
31
Further, we use the following statement of Boas [1] well known in the theory of Fourier series: Lemma 6.1. Let f ∈ L and ϕ = f (x)sign x for x ∈ [−π, π]. If the Fourier series of the functions f (·) and ϕ(·) are absolutely convergent, then the integral π dx |f (x)| , (6.11) x −π
converges, and, moreover, π −π
dx |f (x)| ≤C x
∞ |a0 | + |a0 | (|an | + |bn | + |an | + |bn |) , + 2
(6.12)
n=1
where {an , bn } and {an , bn } are the Fourier coefficients of the functions f (·) and ϕ(·), respectively, and C is an absolute constant. Setting f (x) =
∞
Δk sin(2k + 1)x, we conclude that, by virtue of (6.4),
k=0
the Fourier series of the function f (x) is absolutely convergent. Further, since π sin(2k + 1)x cos nxdx 0
=
0,
n = 2p + 1,
(2k + 1 + n)−1 + (2k + 1 − n)−1 , n = 2p, p = 0, 1, . . . ,
the Fourier series of the function ϕ(x) = f (x)sign x is the series
∞ ∞ 2 Δk (2k + 1 + 2n)−1 + (2k + 1 − 2n)−1 cos 2nx, π n=0
(6.13)
k=0
which is obviously absolutely convergent. Therefore, by virtue of (6.10) and (6.12), we get I≤C
∞ k=0
∞ ∞ −1 −1 |Δk | + ((2k + 1 + 2n) + (2k + 1 − 2n) ) . (6.14) n=0 k=0
32
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
∞ ∞ 2 Δk |Δk | ≤2 2k + 1
Since
k=0
k=0
∞ ∞ 1 Δn |Δk |, +1 ≤C 4n + 1
and
n=0
k=0
relation (6.14) can be rewritten as follows: ∞ ∞ −1 −1 I ≤ C V (a) + Δk ((2k + 1 + 2n) + (2k + 1 − 2n) ) . (6.15) n=1 k=0 k =n
If (2k + 1 + 2n)−1 + (2k + 1 − 2n)−1 in the last sum is replaced by ((k + n)−1 + ∞ (k − n)−1 )/2, then this sum changes by a value that does not exceed C |Δn |. n=0
Therefore, according to (6.15), we have ⎞ ⎛ ∞ ⎟ ∞ ⎜ −1 −1 Δk ((k + n) + (k − n) )⎟ I ≤C⎜ ⎠. ⎝V (a) + n=1 k=0 k =n
(6.16)
(0)
We represent the inner sum Sn in the form Δk ((k + n)−1 + (k − n)−1 ) + Δk /(k + n) Sn(0) = 0≤k
n/2≤k k =n
+
Δk (k − n)−1 +
Δk /(k − n)
3n/2
n/2≤k≤3n/2 k =n
= Sn(1) + Sn(2) + Sn(3) + Sn(4)
(6.17)
(i)
and estimate sums Sn for every i = 1, 4 separately. We have ∞ n=1
|Sn(1) | ≤
∞ 2k|Δk | n2 − k 2
n=1 k
≤2
∞ k=1
k|Δk |
∞ n=2k
1 ≤ CV (a), n2 − (n/2)2
(6.18)
Section 6 ∞
Estimates for Integrals of Moduli of Functions
|Sn(2) |
n=1 k =n
≤
∞
Δk /(k + n) =
n=1 k≥n/2
By analogy, we get
∞
|Δk |
k=1
∞
2k
33
(k + n)−1 ≤ CV (a). (6.19)
n=1
(6.19 )
|Sn(4) | ≤ CV (a).
n=1
(3) Finally, let us show that the sum of all Sn is exactly the value B(a): ∞ (3) |Sn | = Δ /(k − n) k n=1 n=2 n/2≤k≤3n/2 n+n/2 ∞ n−1 Δ Δ k k = B(a). + = k−n k − n n=2 k=n−n/2 k=n+1 ∞
(6.20)
Combining inequalities (6.16)–(6.20), we obtain estimate (6.9). The theorem is proved. 6.3. For series of sines of the form (6.3), the following analog of Theorem 6.5 is true: Theorem 6.6. Assume that series (6.3) satisfies conditions (6.4), (6.5), and (6.8) (a0 = 0). Then series (6.3) is a Fourier series if and only if the series ∞
|an |/n.
(6.21)
n=1
is convergent. If, in addition, series (6.21) is convergent, then the following estimate holds:
π ∞ ∞ I= an sin nx dx ≤ C V (a) + B(a) + |an |/n , (6.22) 0
n=1
n=1
where C is a certain absolute constant. Proof. If the conjugate trigonometric series (6.2) and (6.3) are Fourier series, then, according to Theorem 6.4 , series (6.21) is convergent. Therefore, in the
34
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
conditions of the theorem, the convergence of series (6.21) is necessary for series (6.3) to be a Fourier series because, in this case, series (6.2) is a Fourier series by virtue of Theorem 6.5. Hence, to prove the theorem, it suffices to establish estimate (6.22). Setting ¯ 0 (x) = − 1 cot x , D 2 2 (6.23) ¯ k (x) = D ¯ 0 (x) + sin x + . . . + sin kx = − cos(k + 1/2)x , D 2 sin x/2
k = 1, 2, . . . ,
and performing the Abel transformation with regard for the fact that a0 = 0, we get π ∞ dx I= Δk cos(k + 1/2)x 2 sin x/2 0
π ≤ 2
k=0
π ∞ dx Δk cos(2k + 1)x , x 0
Δk = Δak .
(6.24)
k=0
Lemma 6.1 can be applied to the function f (x) =
∞
Δk cos(2k + 1)x. Indeed,
k=0
in view of (6.4), the Fourier series of the function f (x) converges absolutely, and since π cos(2k + 1)x sin nxdx 0
=
0,
n = 2p,
(2k + 1 + n)−1 − (2k + 1 − n)−1 , n = 2p + 1, p = 0, 1, . . . ,
the Fourier series of the function ϕ = f (x)sign x now has the form ∞
∞ 2 −1 −1 Δk ((2k + 1 + 2n) − (2k + 1 − 2n) ) sin 2nx π n=1
(6.25)
k=0
and is also absolutely convergent. As a consequence of (6.12), we get ∞ ∞ ∞ |Δk | + Δk ((2k + 1 + 2n)−1 − (2k + 1 − 2n)−1 ) , I≤C k=0
n=0 k=0
Section 6
Estimates for Integrals of Moduli of Functions
35
and, by analogy with the derivation of inequality (6.15), we obtain the following estimate: ⎞ ⎛ ∞ ∞ ⎜ ⎟ −1 −1 ⎟ ⎜ I ≤ C ⎝V (a) + Δ ((k + n) − (k − n) ) k ⎠ . n=1 k=0 k =n Using the notation accepted in equality (6.17), one can represent the inner sum in this expression as follows: ∞
Δk (k + n)−1 − (k − n)−1
k=0 k =n
=
Δk (k + n)−1 − (k − n)−1 + Sn(2) − Sn(3) − Sn(4) . (6.26)
0≤k≤n/2
Therefore, in view of relations (6.18)–(6.20), we obtain ∞ −1 −1 I ≤ C V (a) + B(a) + Δk ((k + n) − (k − n) ) . (6.27) n=1 0≤k≤n/2
Denote the last sum by S. Let us show that S≤C
∞
|an |/n.
(6.28)
n=1
This proves estimate (6.22). Since 1 1 2 2k 2 − = + , k+n k−n n n(n2 − k 2 ) we have
∞ ∞ 2 2k 2 + = S1 + S2 . (6.29) Δ |Δ | S≤ k k n n(n2 − k 2 ) n=1 0≤k≤n/2 n=1 0≤k
However, S2 ≤ C
∞
n=1 1≤k
|Δk |
∞ ∞ k2 2 ≤ C k |Δ | n−2 ≤ CV (a), k n3 k=1
n=2k
(6.30)
36
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
and, since a0 = 0, the condition 0 ≤ k < n/2 is equivalent to the condition 0 ≤ k ≤ (n − 1)/2. Hence, Δk = Δak = −a(n+1)/2 . 0≤k
Therefore, S1 =
0≤k≤n−1/2
∞ ∞ 2 |an |/n. |a(n+1)/2 | ≤ C n
n=1
(6.31)
n=1
Combining relations (6.29)–(6.31), we obtain inequality (6.28). The theorem is proved. 6.4. Using deeper reasoning, one can improve Theorem 6.6 as follows: Theorem 6.6. Suppose that series (6.3) satisfies conditions (6.4), (6.5), and (6.8) (a0 = 0). Then series (6.3) converges for all x, and, for any S ∈ N, the following estimate holds: π ∞ ∞ (6.32) an sin nx dx − |an |/n ≤ C (V (a) + B(a)) , n=1 n=1 π/(2S+1) where C is an absolute constant. Proof. The convergence of series (6.9) is guaranteed by conditions (6.4) and (6.5). Therefore, the theorem will be proved if we establish estimate (6.32). Since a0 = 0 and, for k ∈ N, sin kx =
cos(k − 1/2)x cos(k + 1/2)x − , 2 sin x/2 2 sin x/2
performing the Abel transformation we get ∞ k=1
ak sin kx = −(2 sin x/2)−1
∞
Δk cos(k + 1/2)x,
Δk = Δak . (6.33)
k=0
The function (2 sin x/2)−1 − x−1 is bounded on [0, π]. Hence, by integrating the last equality, we establish that, for any natural s, the following equality is true:
Section 6
Estimates for Integrals of Moduli of Functions
37
∞ ak sin kx dx
π
k=1
π/(2s+1)
∞ dx Δk cos(k + 1/2)x + O(V (a)). (6.34) x
π = π/(2s+1)
k=0
The integral on the right-hand side of this equality can be rewritten as a sum: π
αn−1 s = ,
αk = π/(2k + 1)
(6.35)
n=1 αn
π/(2s+1)
Consider one of the terms: αn−1 ∞ dx Δk cos(k + 1/2)x x αn
k=0
dx n−1 Δk cos(k + 1/2)x x
αn−1
= αn
k=0
⎛ αn−1 ⎞ ∞ dx Δk cos(k + 1/2)x ⎠ +O⎝ x
⎞ ⎛ αn−1 n−1 n−1 dx dx Δk |Δk |(1 − cos(k + 1/2)x) ⎠ +O⎝ x x
αn−1
= αn
k=n
αn
k=0
n−1
(6.36)
k=n
αn
Since
k=0
αn
⎞ ⎛ αn−1 ∞ dx | Δk cos(k + 1/2)x| ⎠ . +O⎝ x
Δk =
k=0
n−1
Δak = −an ,
k=0
we have αn−1
αn
n−1 dx Δk = |an | x k=0
π/(2n−1)
π/(2n+1)
−1
x
|an | dx = +O n
|an | n2
.
(6.37)
38
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Further, αn−1 n−1 αn
k=0
dx |Δk | (1 − cos(k + 1/2)x) |Δk | ≤ x n−1 k=0
≤C
n−1 k=0
αn−1
(k + 1/2)dx αn
k+1 |Δk |. n2
(6.38)
Combining relations (6.34)–(6.38), we obtain π ∞ ∞ |an | ak sin kx dx − n π/(2n+1)
n=1
k=1
=O
s |an |
n=1
n2
+O
s n−1 k+1
n2
n=1 k=0
|Δk |
⎛
⎞ αn−1 s ∞ dx +O⎝ Δk cos(k + 1/2)x ⎠ . (6.39) x n=1 αn
k=n
n−1 ∞ Δak ≤ |Δak | = V (a), |an | =
Since
k=0
we have
s |an | n=1
n2
k=0
≤ max |an | n
s 1 ≤ CV (a). n2
(6.40)
n=1
Moreover, s n−1 k+1 n=1 k=0
n2
|Δk | =
s−1 k=0
(k + 1)|Δk |
s n=k+1
n−2 ≤ C
∞
|Δk | = CV (a). (6.41)
k=0
Therefore, the first two terms on the right-hand side of (6.39) have the order O(V (a)), and it remains to obtain the required estimate for the third term. To this end, for every k = 0, 1, 2, . . . , we set ⎧ 0, 0 ≤ x ≤ π/2(2k + 1), ⎪ ⎪ ⎨ (6.42) ϕk (x) = cos(2k + 1)x, π/2(2k + 1) ≤ x ≤ π − π/2(2k + 1), ⎪ ⎪ ⎩ 0, π − π/2(2k + 1) ≤ x ≤ π.
Section 6
Estimates for Integrals of Moduli of Functions
39
Then αn−1 αn−1 s ∞ s ∞ dx dx Δk cos(k + 1/2)x Δk ϕk (x/2) = (6.43) x x
n=1 αn
n=1 αn
k=n
π =
k=0
∞ π ∞ dx dx Δk ϕk (x/2) Δk ϕk (x) , ≤ x x k=0
π/(2s+1)
(6.44)
k=0
0
and expression (6.39) takes the form ∞ s ak sin kx dx − |an |/n
π π/(2s+1)
n=1
k=1
⎛
⎞ π ∞ dx ⎝ Δak ϕk (x) ⎠ . (6.45) = O(V (a)) + O x 0
k=0
Now let us prove the following statement: Lemma 6.2. If the sequence {an } satisfies conditions (6.4), (6.5), and (6.8), then the following inequality is true: π ∞ dx | Δk ϕk (x)| ≤ C (V (a) + B(a)) , x 0
Δk = Δak ,
(6.46)
k=0
where the functions ϕk (x) are defined by (6.42) and C is an absolute constant. Proof. The proof is based on the following version of Lemma 6.1: Lemma 6.1. Suppose that the function f (x) is integrable on [0, π] and its Fourier series in the cosine system and in the sine system are absolutely convergent. Then
∞ π ∞ dx |f (x)| |An | + |Bn | , (6.47) ≤C x 0
n=0
n=1
where {An } and {Bn } are the Fourier coefficients of the function f (·) in the cosine system and in the sine system, respectively, and C is an absolute constant.
40
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
According to (6.47), to prove inequality (6.46) it suffices to establish the corresponding estimates for the series of the moduli of Fourier coefficients for the ∞ function f (x) = Δk ϕk (x) in the cosine system and in the sine system. Calk=0
culations show that π ϕk (x) cos nxdx 0
⎧ ⎪ 0, n = 2p, p = 0, 1, . . . , ⎪ ⎪ ⎪ ⎪ ⎪ sin((2k + 1 − n)αk /2) ⎪ ⎪ ⎪ ⎨− 2k + 1 − n = ⎪ sin((2k + 1 + n)αk /2) ⎪ ⎪ − , n = 2p + 1, n = 2k + 1, ⎪ ⎪ 2k + 1 + n ⎪ ⎪ ⎪ ⎪ ⎩ kπ/(2k + 1), n = 2k + 1, αk = π/(2k + 1).
(6.48)
Therefore, the Fourier series of the function f (·) in the cosine system has the form ∞ ∞ sin(k − n)αk sin(k + 1 + n)αk 1 cos(2n+1)x, (6.49) Δk + − π k−n k+1+n n=0
k=0
where means that, for k = n, we must take −2kαk as the coefficients of Δk . Let us estimate the sum ∞ ∞ sin(k − n)αk sin(k + 1 + n)αk S1 = Δk ( + ) . k−n k+1+n n=0 k=0
Denoting by Pn,k the coefficient of Δk , we get S1 ≤
∞
|Δk |
k=0
∞
|Pn,k | + π
n=0 n =k
∞
|Δn |.
n=0
However, ∞ k=0
|Δk |
2k n=0 n =k
|Pn,k | ≤
∞ k=0
|Δk |
2k n=0
2π = 2πV (a) 2k + 1
Section 6
Estimates for Integrals of Moduli of Functions
41
and ∞
|Δk |
k=0
∞
|Pn,k |
n=2k+1
=
∞ k=0
≤
∞ k=0
∞ 1 1 |Δk | cos(n + 1/2)α + k k−n k+1+n n=2k+1
|Δk |
∞ n=2k+1
2k + 1 ≤ CV (a). (n2 − k 2 )
(6.50)
Therefore, S1 ≤ CV (a), i.e., series (6.49) is absolutely convergent. The Fourier series of the function f (x) in the sine system has the form ∞ ∞ 2 Δk Qn,k sin 2nx, π
(6.51)
n=1 k=0
where Qn,k =
cos(k + n + 1/2)αk cos(k − n + 1/2)αk − , 2k + 1 + 2n 2k + 1 − 2n
αk = π/(2k + 1).
Let us verify that series (6.51) is also absolutely convergent. We have ∞ ∞ Δk Qn,k S2 = n=1 k=0 ∞ ∞ ≤ Δk Qn,k + Δk Qn,k , n=1 k≥n/2 n=1 0≤k
n=1 0≤k
|Δk Qn,k | ≤
∞
n=1 0≤k
≤C
∞ k=0
(6.52)
2(2k + 1) Δk sin nαk 4n2 − (2k + 1)2
|Δak | = CV (a).
(6.53)
42
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
We estimate the second term on the right-hand side of (6.52) as follows: ∞ Δk Qn,k n=1 k≥n/2 ∞ −1 −1 Δk ((2k + 1 + 2n) − (2k + 1 − 2n) ) ≤ n=1 k≥n/2 ∞ 1 − cos(k + n + 1/2)αk 1 − cos(k + n + 1/2)αk + |Δk | + 2k + 1 + 2n |2k + 1 − 2n| n=1 k≥n/2
=
1
+
.
2
(6.54)
If we replace (2k +1+2n)−1 −(2k +1−2n)−1 by ((k +n)−1 −(k −n)−1 )/2 in ∞ the expression |Δk |. 1 , then it changes by a value that does not exceed C k=0
Thus, 1
∞ −1 −1 ≤ Δk ((k + n) − (k − n) ) + CV (a) n=1 k≥n/2 =
∞
|Sn(2) − Sn(3) − Sn(4) | + CV (a).
n=1 (2)
(3)
(4)
Here, Sn , Sn , and Sn have the same sense as in expressions (6.26) and (6.17). In view of estimates (6.18)–(6.20), we obtain ≤ C(V (a) + B(a)). (6.55) 1
At the same time, using the estimate 1 − cos x ≤ |x|, we get 2
≤
∞ k=1
|Δk |
2k n=1
∞
π |Δk | = πV (a). ≤π 2k + 1
(6.56)
k=0
Combining relations (6.52)–(6.56), we establish that S2 ≤ C(V (a) + B(a)), i.e., series (6.51) is indeed absolutely convergent.
(6.57)
Section 7
Telyakovskii Theorem
43
Inequalities (6.50) and (6.57) give estimates for the series of the moduli of ∞ Δk ϕk (x) in the cosine system Fourier coefficients for the function f (x) = k=0
and in the sine system, respectively. Hence, by virtue of inequality (6.47), these relations yield the statement of the lemma. Combining relations (6.45) and (6.46), we obtain the required estimate for the last term on the right-hand side of (6.39), which completes the proof of Theorem 6.6 .
7.
Asymptotic Equality for Integrals of Moduli of Functions Defined by Trigonometric Series. Telyakovskii Theorem
7.1. Theorems 6.5–6.6 proved in the last section (which also belong to S. A. Telyakovskii) enable us to fairly efficiently estimate norms in the space of L-functions in terms of their Fourier coefficients. However, in certain cases, e.g., in the case of the determination of the norms of trigonometric polynomials or in the case where functions are approximated by polynomials, it is desirable to have asymptotic equalities that enable one to determine the quantities π
∞
|
I= −π
a0 (ak cos kx + bk sin kx)|dx + 2
(7.1)
k=1
with given accuracy rather than mere estimates (even exact in a certain sense) of integrals (7.1). For example, for the norm of the even trigonometric polynomial 2 π
π 0
a0 ak cos kx|dx + 2 n−1
|
(7.2)
k=1
there are known asymptotic equalities that show that this norm is equal to n−1 4 |ak | . π2 n−k
(7.3)
k=0
up to a certain remainder. In this section, we obtain an equality for integral (7.1), where the leading term is an analog of (7.3). To formulate the main result, we introduce the following notation:
44
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Assume that the coefficients of the trigonometric series ∞
a0 (ak cos kx + bk sin kx) + 2
(7.4)
k=1
satisfy the conditions (we set b0 = 0 and n/2 = [n/2] for any n ∈ N ) lim an = 0, lim bn = 0,
n→∞ ∞
n→∞
∞
|Δak | = V (a) < ∞,
k=0
|Δbk | = V (b) < ∞ (b0 = 0),
(7.5) (7.6)
k=0 ∞
Δai−k − Δai+k i/2
|
k
i=2 k=1
| = B(a) < ∞,
i/2 Δbi−k − Δbi+k | | = B(b) < ∞, k
(7.7)
i=2 k=1
∞
|bk |/k < ∞.
(7.8)
k=1
Then, by virtue of Theorems 6.1, 6.5, and 6.6, series (7.4) converges for any x ∈ [−π, π], except, possibly, the point x = 0. Its sum is continuous for all x = 0 and is integrable on the period. It follows from conditions (7.6) and (7.7) that, for any natural m, the following series are convergent: i/2 ∞ Δam+i−k − Δam+i+k | | = Bm (a), k i=2 k=1
i/2 ∞ Δbm+i−k − Δbm+i+k | | = Bm (b). k
(7.9)
i=2 k=1
Thus, for any m ∈ N, the following quantities are finite: Tm =
qi,m m−2
|
i=2
k=1
Δai−k − Δai+k | + Bm (a) k +
qi,m m−2
|
i=2
where qi,m = min(i/2, (m − i)/2).
k=1
Δbi−k − Δbi+k | + Bm (b), (7.10) k
Section 7
Telyakovskii Theorem
45
The Telyakovskii theorem is formulated as follows: Theorem 7.1. Suppose that series (7.4) satisfies conditions (7.5)–(7.8). Then this series is a Fourier series, and, for integral (7.1), the following estimate holds uniformly in m = 0, 1, . . . : m ∞ 2 |I − 2( ξk /k + |bk |/k)| ≤ C(V + Tm ), V = V (a) + V (b), (7.11) π k=1
k=2m+1
where ξk = ξ(bk ,
(am−k − am+k )2 + (bm−k − bm+k )2 ),
(7.12)
the function ξ(t, u) is defined by the equalities π|t|/2, ξ(t, u) =
|t|arc sin |t/u| +
√
|u| ≤ |t|, u2 − t2 , |u| > |t|,
(7.13)
and C is an absolute constant. Proof. The proof of this theorem is based on several auxiliary facts, which are established below. Lemma 7.1. For an arbitrary sequence of numbers {ak }, k = 0, 1, . . . , one has i/2 ∞ ∞ Δai−k − Δai+k B(a) = | k|Δ2 ak−1 |, |≤C k i=2 k=1
(7.14)
k=1
and, for every m ∈ N, ¯m (a) = B
qi,m m−2
|
i=2
k=1
m−1 k(m − k) Δai−k − Δai+k |≤C |Δ2 ak−1 |, k m
(7.15)
k=1
where Δ2 ak = Δak − Δak+1 , qi,m = min(i/2, (n − i)/2), and C is an absolute constant. Indeed, taking into account that Δai−k − Δai+k =
i+k−1 n=i−k
Δ2 an ,
(7.16)
46
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
and changing the order of summation, we get i/2 i+k−1 ∞ i+k−1 ∞ ∞ |Δ2 an | |Δ2 an | B(a) ≤ = k k i=2 k=1 n=i−k
≤
∞ ∞
k=1 i=2k n=i−k ∞
n+k
k=1 n=k i=n−k+1
=2
∞ n
∞
|Δ2 an | |Δ2 an | =2 k k=1 n=k
|Δ ak | = 2 2
n=1 k=1
∞
k|Δ ak | ≤ C 2
k=1
∞
k|Δ2 ak−1 |.
(7.17)
k=1
Relation (7.14) is proved. By analogy, we establish inequality (7.15): ¯m (a) ≤ B
qi,m i+k+1 m−2 i=2 k=1 j=i−k
m/4 m−k−1
≤
k=1
≤2
j=k
n/4 m−2k i+k−1 |Δ2 aj | |Δ2 aj | ≤ k k
j+k
≤C
m−1 k=1
m/4 m−k−1
|Δ aj |/k = 2 2
i=j+1−k
m−2 min(j,m−j−1) j=1
k=1 i=2k j=i−k
k=1
|Δ2 ak | = 2
k=1
m−2
|Δ2 aj |
j=k
min(j, m − j − 1)|Δ2 aj |
j=1
k(m − k) 2 |Δ ak−1 |. m
(7.18)
Lemma 7.2. Let m be a natural number and let {αk }, k = 0, 1, 2, . . . , be a sequence of numbers such that αk = 0 for all k ≥ m. Setting μ = [m/3] and ν = m − μ, consider the following two sequences {βk } and {γk } : ⎧ αk , k = 0, 1, . . . , μ, ⎪ ⎪ ⎪ ⎨ (7.19) βk = ν − k αk , k = μ + 1, . . . , ν − 1, ⎪ ν − μ ⎪ ⎪ ⎩ 0, k ≥ ν, γk =
αm−k − βm−k , k = 0, 1, . . . , m, 0,
k ≥ m + 1.
(7.20)
Section 7
Telyakovskii Theorem
47
Then the following estimates are true: m−1
V (β) + V (γ) ≤ C
|Δαk |
(7.21)
k=0
and qi,m m−2
B(β) + B(γ) ≤ C(
|
i=2
k=1
m−1 Δαi−k − Δαi+k |Δαk |), |+ k
(7.22)
k=0
where qi,m = min([i/2], [(m − i)/2]) and C is an absolute constant. Proof. According to (7.19), we have ⎧ ⎪ Δαk , k = 0, 1, . . . , μ − 1, ⎪ ⎪ ⎪ ⎨ν − k αk+1 Δαk − , k = μ, . . . , ν − 1, Δβk = ⎪ ν−μ ν−μ ⎪ ⎪ ⎪ ⎩0, k≥ν and, for all i, |αi | = |
m−1
Δαk | ≤
k=i
m−1
|Δak |.
(7.23)
(7.24)
k=0
Therefore, V (β) =
∞
|Δβk | ≤
k=0
≤
ν−1
μ−1 k=0
ν−1 ν−k |αk+1 | |Δαk | + ( |Δαk | + ) ν−μ ν−μ
|Δαk | + (ν − μ)−1
k=μ
ν−1 m−1
|Δαi | ≤ 2
k=μ i=0
k=0
m−1
|Δαk |.
(7.25)
k=0
Now let us estimate the quantity B(β). To this end, we define an auxiliary sequence {ak }, k = 0, 1, . . . , by setting (ν − μ)−1 αk+1 , k = μ, . . . , ν − 1, (7.26) Δak = 0, k ∈ [0, μ − 1] ∪ [ν, ∞). Then
Δ2 ak =
⎧ −(ν − μ)−1 αμ+1 , k = μ − 1, ⎪ ⎪ ⎪ ⎪ ⎪ ⎨(ν − μ)−1 αk+1 , k = μ, . . . , ν − 2, ⎪ (ν − μ)−1 αν , ⎪ ⎪ ⎪ ⎪ ⎩ 0,
k = ν − 1, k ∈ [0, μ − 2] ∪ [ν, ∞),
(7.27)
48
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
and, by virtue of estimates (7.14) and (7.24), i/2 ∞ Δai−k − Δai+k | B(a) = |≤ k i=2 k=1
≤ C(μ
ν−1 m−1 |αμ+1 | |Δαk | |αν | k |Δαk |. + +ν )≤C ν−μ ν−μ ν−μ k=μ+1
(7.28)
k=0
We now set Δβk∗ = Δβk − αk , i.e., ⎧ ⎪ Δαk , k = 0, 1, . . . , μ, ⎪ ⎪ ⎪ ⎨ν − k Δαk , k = μ + 1, . . . , ν − 1, Δβk∗ = ⎪ ν−μ ⎪ ⎪ ⎪ ⎩0, k ≥ ν.
(7.29)
Thus, according to (7.28), we have i/2 ∞ m−1 ∗ ∗ Δβi−k − Δβi+k | |Δαk | B(β) ≤ |+C k i=2 k=1 ∗
= B(β ) + C
k=0
m−1
|Δαk |.
(7.30)
k=0
Let us estimate the quantity B(β ∗ ). If i ≤ μ, then, according to (7.29), we ∗ = Δαi−k and have Δβi−k
∗ Δβi+k
Hence,
⎧ ⎪ k ≤ μ + i, ⎨Δαi+k , = ν − (i + k) ⎪ Δαi+k , k > μ − i. ⎩ ν−μ
Section 7
Telyakovskii Theorem
49
i/2 i/2 μ ∗ ∗ Δβi−k − Δβi+k Δαi−k − Δαi+k | − | k k i=2 k=1
k=1
=
μ
i/2
|
(1 −
i=2 k=μ−i+1
≤
μ
i/2
i=2 k=μ−i+1
ν − (i + k) Δαi+k ) | ν−μ k
(i + k − μ)|Δαi+k | k(ν − μ)
μ μ+[μ/2] m−1 1 |Δαk | ≤ |Δαk |. ≤ ν−μ i=2 k=μ+1
k=0
Therefore, i/2 i/2 μ μ m−1 ∗ ∗ Δβi−k − Δβi+k Δαi−k − Δαi+k | | |Δαk |. (7.31) |≤ |+ k k i=2 k=1
i=2 k=1
k=0
Now let μ + 1 ≤ i ≤ ν − 1. Then, by virtue of (7.29), ⎧ ⎪ ⎨ ν − (i − k) Δαi−k , k < i − μ, ∗ ν−μ Δβi−k = ⎪ ⎩ k ≥ i − μ, Δαi−k , ⎧ ⎪ ⎨ ν − (i + k) Δαi+k , k < ν − i, ∗ ν−μ Δβi+k = ⎪ ⎩ 0, k ≥ ν − i. Hence, ν−1
|
i/2 ∗ ∗ Δβi−k − Δβi+k
k
i=μ+1 k=1
=
ν−1
|
i=μ+1
i−μ−1 k=1
i/2 k Δαi−k ν − i Δαi−k + (1 − ) ν−μ k ν−μ k
k=1
≤
i/2
k=1
min /[i/2,ν−i−1)
+
ν − i Δαi−k − Δαi+k − | ν−μ k
k=i−μ
i/2 k Δαi+k ν − i Δαi+k + | ν−μ k ν−μ k k=ν−i
ν−1 m−1 |Δαi−k | |Δαi+k | ( |Δαk |. + )≤ ν−μ ν−μ i/2
i/2
i=μ+1 k=1
k=1
k=0
50
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Therefore, the following estimate is true: ν−1
|
i/2 ∗ ∗ Δβi−k − Δβi+k
i=μ+1 k=1
k ≤
|
ν−1
|
i/2 Δαi−k − Δαi+k
k
i=μ+1 k=1
|+
m−1
|Δαk |. (7.32)
k=0
∗ = 0 and Finally, let i ≥ ν. In this case, by virtue of (7.29), we have Δβi+k
∗ Δβi−k
⎧ ⎪ k ≤ i − ν, ⎨0, = ν − (i − k) ⎪ Δαi−k , k > i − ν. ⎩ ν−μ
Therefore, i/2 ∞ ∞ ∗ ∗ Δβi−k − Δβi+k | | |= k i=ν
i=ν
k=1
≤
i/2 k=i−ν+1
∞
i/2
i=ν k=i−ν+1
ν − (i − k) Δαi−k | ν−μ k
ν + k − i |Δαi−k | k ν−μ
2ν−2 1 ≤ ν−μ
i/2
|Δαi−k |
i=ν k=i−ν+1
≤C
m−1
|Δαk |.
(7.33)
k=0
Combining estimates (7.31)–(7.33), we get B(β ∗ ) ≤
i/2 ν−1 m−1 Δαi−k − Δαi+k | |Δαk |. |+C k i=2 k=1
Note that
k=0
(7.34)
Section 7 ν−1
Telyakovskii Theorem i/2
|
i=[m/2]+1 k=[(m−i)/2]+1
≤
Δαi−k − Δαi+k | k
1 (m − ν)/2 + 1
≤C
m−1
51
ν−1
i/2
(|Δαi−k | + |Δαi+k |)
i=[m/2]+1 k=[(m−i)/2]+1
|Δαk |,
k=0
and if i ≤ m/2, then qi,m = [i/2]. Hence, relation (7.34) yields the following inequality: qi,m ν−1 m−1 Δαi−k − Δαi+k | |Δαk |. B(β ) ≤ |+C k ∗
i=2 k=1
(7.35)
k=0
Using this inequality and relation (7.30), we obtain the required estimate for B(β): qi,m ν−1 m−1 Δαi−k − Δαi+k B(β) ≤ | |Δαk |. (7.36) |+C k i=2 k=1
k=0
Now consider the quantities V (γ) and B(γ). By virtue of (7.20), we have Δγk = −Δαm−1−k + Δβm−1−k . Thus, by virtue of (7.23), we get ⎧ −Δαm−k−1 , k = 0, 1, . . . , μ − 1, ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ − m − μ − k Δαm−k−1 ν−μ (7.37) Δγk = ⎪ 1 ⎪ ⎪ + , k = μ, . . . , ν − 1, α m−k−1 ⎪ ⎪ ν−μ ⎪ ⎪ ⎪ ⎩ 0, k ≥ ν. Comparing relations (7.23) and (7.37), we conclude that they are completely analogous. Hence, following the proof of estimates (7.25) and (7.36), we get V (γ) =
∞ k=0
|Δγk | ≤ 2
m−1
|Δαk |,
(7.38)
k=0
qi,m ν−1 m−1 Δαm−1−(i−k) − Δαm−1−(i+k) | |Δαk |. B(γ) ≤ |+C k i=2 k=1
k=0
(7.39)
52
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
However, qi,m ν−1 Δαm−1−(i−k) − Δαm−1−(i+k) | | k i=2 k=1
m−2
=
Δαp−1−k − Δαp−1+k | k
qp,m
|
p=m−ν+1 k=1 m−2
≤
|
qi,m Δαi−k − Δαi+k
k
i=m−ν k=1
|+C
m−1
|Δαk |.
(7.40)
k=0
Combining inequalities (7.25) and (7.38), we obtain estimate (7.21). Comparing relations (7.36), (7.39), and (7.40), we arrive at inequality (7.22). Lemma 7.2 is proved. Lemma 7.3. For arbitrary real numbers A, B, and D, the following equality is true: π |A + B sin x + D cos x|dx = 4ξ(A,
I1 =
B 2 + D2 ),
(7.41)
−π
where ξ = ξ(t; u) is the function defined by (7.13). √ Proof. Since B sin x + D cos x = B 2 + D2 sin(x + β), where β is a certain number, we have π |A +
I1 = If √
B 2 + D2 sin t|dt.
−π
√
B 2 + D2 ≤ |A|, then the statement of the lemma is obvious. If |A| < B 2 + D2 , then π/2 |A +
I1 = 2
B 2 + D2 sin t|dt
−π/2
t0 = 2| −π/2
(A +
π/2 B 2 + D2 sin t)dt − (A + B 2 + D2 sin t)dt|, t0
Section 7
Telyakovskii Theorem
53
√ where t0 = − arcsin(A/ B 2 + D2 ). Calculating the integrals, we obtain equality (7.41). Lemma 7.4. The function ξ(t, u) defined by (7.13) satisfies the following estimates for any t and u : π |t| + |u|, 2 π ξ(t, u) ≥ |t|, 2 ξ(t, u) ≥ |u|.
ξ(t, u) ≤
(7.42) (7.43) (7.44)
Proof. If |u| ≤ |t|, then, by definition, ξ(t, u) = π|t|/2, and the statement of the lemma is obvious. Let |t| < |u|. Then π ξ(t, u) = |t|arc sin |t/u| + u2 − t2 ≤ |t| + |u|, 2 i.e., relation (7.42) is true. On the other hand, since the function arcsin x−1 + √ x2 − 1 does not decrease for x ≥ 1, relation (7.43) is also true: u π ξ(t, u) = |t|(arc sin( )−1 + (u/t)2 − 1) ≥ |t|. t 2 Finally, taking into account that 0 ≤ 1 − (t/n)2 ≤ 1 in the case considered, we obtain estimate (7.44): ξ(t, u) = |u|( 1 − (t/u)2 + |t/u|arc sin |t/u|) ≥ |u|( 1 − (t/u)2 + (t/u)2 ) ≥ |u|. Lemma 7.4 is proved. 7.2. Passing directly to the proof of the theorem, we first note that, for m = 0, inequality (7.11) follows from estimates (6.9) and (6.32). Hence, assume that m ≥ 1. We set ak , k = 0, 1, . . . , m − 1, (7.45) αk = 0, k ≥ m, bk , k = 0, 1, . . . , m − 1, (7.45 ) αk = 0, k ≥ m.
54
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
For the sequences {αk } and {αk }, using equalities (7.19) and (7.20) we define sequences {βk }, {γk } and {βk }, {γk }, respectively. Then ak = βk + γm−k and bk = βk + γm−k for all k = 0, 1, . . . , m − 1. Therefore,
∞
a0 (ak cos kx + bk sin kx) + 2 k=1
=
m−1 β0 ((βk + γm−k ) cos kx + (βk + γm−k ) sin kx) + 2 k=1
+
∞
(am+k cos(m + k)x + bm+k sin(m + k)x)
k=0 ∞
∞
k=1
k=1
β0 βk cos kx + cos mx γk cos kx = + 2
+ sin mx
∞
γk sin kx +
k=1
+ sin mx
∞ k=1
+ cos mx
∞
∞
βk sin kx
k=1
γk
cos kx − cos mx
∞ k=1
am+k cos kx − sin mx
k=0
+ sin mx
∞ k=0
γk sin kx
∞
am+k sin kx
k=0
bk+m cos kx + cos mx
∞ k=0
bm+k sin kx.
(7.46)
Section 7
Telyakovskii Theorem
55
To estimate the integral of the obtained cosine series, we use Theorem 6.5. According to estimate (6.9), we have π | −π
∞
∞
k=1
k=1
β0 + βk cos kx + cos mx γk cos kx 2 ∞
+ sin mx
k=1 ∞
+ sin mx
γk
cos kx + cos mx
∞
am+k cos kx
k=0
bm+k cos kx|dx
k=0
≤ C(V (β) + B(β) + V (γ) + B(γ) + V (γ ) + B(γ ) ∞
+ |am | +
k=0
+ |bm | +
∞ k=0
i/2 ∞ Δam+i−k − Δam+i+k |Δam+k | + | | k i=2 k=1
i/2 ∞ Δbm+i−k − Δbm+i+k |Δbm+k | + | |). k
(7.47)
i=2 k=1
By assumption, lim ak = 0. Hence, for any k = 0, 1, . . . , we get k→∞
|ak | = |
∞
Δai | ≤
∞
|Δai | = V (a).
(7.48)
i=0
i=k
Similarly,
(7.48 )
|bk | ≤ V (b).
Therefore, taking into account Lemma 7.2, we conclude that the integral on the left-hand side of inequality (7.47) does not exceed C(V + Tm ). Hence, by virtue of representation (7.46), the following estimate is true: π |I −
| sin mx
k=1
−π
− cos mx + cos mx
∞
∞ k=1 ∞ k=0
γk
γk sin kx +
∞
βk sin kx
k=1
sin kx − sin mx
∞
am+k sin kx
k=0
bm+k sin kx|dx| ≤ C(V + Tm ).
(7.49)
56
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
For simplicity, we set A0 = 0 and Ak = Ak (x) = β (k) + (γk − am+k ) sin mx − (γk − bm+k ) cos mx.
(7.50)
In this notation, inequality (7.48) takes the form π ∞ |I − | Ak (x) sin kx|dx| ≤ C(V + Tm ). −π
(7.51)
k=1
Further arguments are similar to those used in Subsection 6.4. Since A0 = 0, with regard for representation (6.33) we have ∞
−1
Ak (x) sin kx = −(2 sin x/2)
k=1
∞
ΔAk (x) cos(k + 1/2)x.
(7.52)
k=0
By virtue of (7.21), (7.48), and (7.48 ), the following estimate holds for all x: ∞
|ΔAk (x)| ≤ |am | + |bm | + V (β ) + V (γ) + V (γ )+
k=0
+
∞
|Δam+k | +
k=0
∞
|Δbm+k | ≤ CV.
(7.53)
k=0
Thus, the boundedness of the function (2 sin x/2)−1 −x−1 on [−π, π] and equality (7.52) yield π π ∞ ∞ dx | | Ak (x) sin kx|dx − | ΔAk (x) cos(k + 1/2)x| | ≤ CV. (7.54) |x| −π
k=1
−π
k=0
Further, let ϕk (x) be the even functions defined by (6.42) on [0, π] and let ψk (x) be the functions defined as follows: cos(2k + 1)x, |x| ≤ π/2(2k + 1), ψk (x) = (7.55) 0, |x| ≥ π/2(2k + 1), k = 0, 1, . . . . Then, for any x ∈ [−π, π], we have cos(k + 1/2)x = ϕk (x/2) + ϕk (x/2), k = 0, 1, . . . (ϕo (x) ≡ 0),
(7.56)
Section 7
Telyakovskii Theorem
57
and, in the notation accepted, π π ∞ ∞ dx dx ΔAk (x) cos(k + 1/2)x| ΔAk (x)ψk (x/2)| | − | | | |x| |x| −π
k=0
−π
k=0
π π ∞ ∞ dx dx | ΔAk (x)ϕk (x/2)| | ΔAk (2x)ϕk (x)| ≤ ≤ |x| |x| −π
k=0
k=0
−π
π π ∞ ∞ dx dx ≤2 | Δβk ϕk (x)| Δγk ϕk (x)| +2 | x x 0
k=0
0
k=0
π π ∞ ∞ dx dx +2 | Δam+k ϕk (x)| Δγk ϕk (x)| +2 | x x 0
k=0
0
k=0
π ∞ dx Δbm+k ϕk (x)| . +2 | x 0
(7.57)
k=0
In view of Lemmas 6.2 and 7.2 and estimates (7.48) and (7.48 ), we conclude that π π ∞ ∞ dx dx ΔAk (x) cos(k + 1/2)x| ΔAk (x)ψk (x/2)| | | | − | |x| |x| −π
k=0
−π
k=0
≤ C(V + Tm ).
(7.58)
Combining estimates (7.51), (7.53), and (7.58), we get π ∞ dx ΔAk (x)ψk (x/2)| | ≤ C(V + Tm ). |I − | |x| −π
(7.59)
k=0
To complete the proof of the theorem, it suffices to show that π ∞ m dx 2 ΔAk (x)ψk (x/2)| | − 2( ξk /k + | | |x| π −π
k=0
k=1
≤ C(V + Tm ),
∞
|bk |/k)|
k=2m+1
(7.60)
58
Regularity of Linear Methods of Summation of Fourier Series 7.3. Let Φk (x) =
Chapter 1
1, |x| ≤ π/(k + 1),
(7.61)
0, |x| > π/(k + 1).
Then it follows from (7.55) that |ψk (x/2) − Φk (x)| ≤ (k + 1/2)|x| if |x| ≤ π/(k + 1), and ψk (x/2) = Φk (x) if |x| > π/(k + 1). Therefore, taking (7.53) into account, we get π π ∞ ∞ dx dx | | ΔAk (x)ψk (x/2)| ΔAk (x)Φk (x)| | − | |x| |x| −π
k=0
−π
∞
k=0
π
≤
|ΔAk (x)||ψk (x/2) − Φk (x)|
k=0−π
≤
∞
dx |x|
π/(k+1)
|ΔAk (x)|(k + 1/2)dx ≤ CV.
(7.62)
k=0−π/(k+1)
This implies that, to prove inequality (7.60), one must investigate the integral π ∞ dx | ΔAk (x)Φk (x)| . |x|
−π
(7.63)
k=0
We divide the interval of integration into several parts and examine them separately. Let √ M = [ m] + 1. (7.64) First, consider the integral π ∞ M −1 dx | ΔAk (x)Φk (x)| = x π/M
i=1
k=0
π/i |
π/(i+1)
∞
ΔAk (x)Φk (x)|
k=0
dx . x
(7.65)
If x ∈ (π/(i + 1), π/i], then, by virtue of (7.61), ∞ k=0
ΔAk (x)Φk (x) =
i−1 k=0
ΔAk (x) = −Ai (x).
(7.66)
Section 7
Telyakovskii Theorem
59
Hence, π/i |
∞ k=0
π/(i+1)
π/i
dx ΔAk (x)Φk (x)| = x
x−1 |Ai (x)|dx.
(7.67)
π/(i+1)
Further, π/i Ri = |
π/i
i x−1 |Ai (x)|dx − π
π/(i+1)
|Ai (x)|dx| π/(i+1)
π/i ≤ max |Ai |
(
x
1 i − )dx ≤ i−2 max |Ai (x)|. x x π
π/(i+1)
According to the definition of the quantities Ai (x) and in view of relations (7.48) and (7.48 ), for any x we have |Ai (x)| < C(max |ak | + max |bk |) ≤ CV,
(7.68)
|Ri | ≤ Ci−2 V.
(7.69)
k
whence
k
The quantity Ai (x) has period 2π/m. Taking into account that [m/2i(i + 1)] segments of length 2π/m are completely contained in every segment [π/(i + 1), π/i] and using Lemma 7.3 and estimate (7.68), we get π/i |
|Ai (x)|dx −
4 C ξi [m/2i(i + 1)]| ≤ max |Ai (x)| ≤ CV /m, (7.70) m m x
π/(i+1)
where ξi = ξ(βi ,
(γi − am+i )2 + (γi − bm+i )2 ).
(7.71)
Thus, by using estimates (7.42), (7.48), and (7.48 ), for all i we obtain ξi ≤ CV.
(7.72)
This inequality enables us to rewrite (7.70) in the form π/i | π/(i+1)
|Ai (x)|dx −
2 ξ | ≤ C(m−1 + i−3 )V. i2 i
(7.73)
60
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Combining relations (7.67), (7.69), and (7.73), we get π/i |
|
∞
ΔAk (x)Φk (x)|x−1 dx −
k=0
π/(i+1)
2 i ξi | ≤ C( + i−2 )V, πi m
(7.74)
which, together with (7.65), yields π ∞ M −1 2 −1 | | ΔAk (x)Φk (x)|x dx − ξi /i| π i=1
k=0
π/M
M −1
≤ CV
i=1
(
i + i−2 ) ≤ CV. (7.75) m
Assuming that m > M, we consider the integral π/M
| π/m
∞
ΔAk Φk (x)|x−1 dx, ΔAk = ΔAk (x).
k=0
Let j0 denote the greatest integer for which (2j0 + 1)/m ≤ M −1 . Note that √ (7.76) 2j0 + 1 ≤ m. Then π/M
| π/m
∞
ΔAk Φk (x)|x−1 dx
k=0 j0 =(
π(2j+1)/m
j=1 π(2j−1)/m
π/M
+ π(2j0 +1)/m
π/M
)|
ΔAk Φk (x)|x−1 dx. (7.77)
k=0
By virtue of (7.53), we have π/M
| π(2j0 +1)/m
∞
ΔAk Φk (x)|x−1 dx
k=0
m ≤ π(2j0 + 1)
π/M
∞
π(2j0 +1)/m k=0
|ΔAk (x)|dx ≤ CV. (7.78)
Section 7
Telyakovskii Theorem
61
Further, assuming that j0 ≥ 1, we consider the terms of the sum on the right-hand side of (7.77) that correspond to every j = 1, 2, . . . , j0 . Let xi be an arbitrary point of the form π/i, where i is a certain natural number that belongs to the interval [π(2j − 1)/m, π(2j + 1)/m). Then, setting δj = π(2j − 1)/m, we get δj+1
|
|
∞
−1
ΔAk (x)Φk (x)|x
k=0
δj
|
≤
∞
ΔAk (x)Φk (x)||
k=0
δj
i + π
δj+1
|
|
δi+1
∞ k=0
∞
∞
ΔAk (x)Φk (xi )|dx|
k=0
1 1 − |dx x xi
ΔAk (x)(Φk (x) − Φk (xi ))|dx
k=0
δj
δj
δj+1
δj
δj+1
≤
i dx − π
1 i |ΔAk (x)|| − |dx x π
i + π
δj+1
∞
δj
|ΔAk (x)||Φk (x) − Φk (xi )|dx.
(7.79)
k=0
Since, in the case considered, |
1 i m m m − |≤ − = , x π π(2j − 1) π(2j + 1) π(4j 2 − 1)
with regard for (7.53) we obtain δj+1
∞
δj
k=0
|ΔAk (x)||
2π 1 i m − |dx ≤ CV ≤ CV j −2 . 2 x π π(4j − 1) m
(7.80)
Now let us obtain an estimate for the last term in (7.79). In view of (7.61), if the points x and xi = π/i belong to [δj , δj+1 ), then Φk (x) = Φk (xi ) for all k such that π/(k + 1) < δj or π/(k + 1) ≥ δj+1 . If the numbers k satisfy the converse inequalities, i.e., if m/(2j + 1) < k + 1 ≤ m/(2j − 1),
(7.81)
62
Regularity of Linear Methods of Summation of Fourier Series
then |Φk (x) − Φk (xi )| ≤ 1. Therefore, denoting by
Chapter 1
j the sum over all k that
k
satisfy condition (7.81), we get δj+1
∞
δj
|ΔAk (x)||Φk (x) − Φk (xi )|dx
k=0 δj+1
≤ δj
2π/m j |ΔAk (x)|dx
=
k
j |ΔAk (x)|dx.
(7.82)
k
0
Further, by virtue of (7.66) and Lemma 7.3, we have δj+1
| δj
∞
δj+1
|Ai (x)|dx = 4ξi /m.
ΔAk (x)Φk (π/i)|dx =
k=0
(7.83)
δj
Combining estimates (7.79), (7.80), (7.82), and (7.83), we conclude that, for all natural i such that δj ≤ π/i < δj+1 , δj = π(2j − 1)/m,
(7.84)
the following inequality holds: δj+1
|
| δj
∞ k=0
ΔAk (x)Φk (x)|x−1 dx −
4 i ξ| πm i
≤ CV j
−2
i + π
2π/m
0
j |ΔAk (x)|dx.
(7.85)
k
The interval [δj , δj+1 ) contains rj = [m/(2j − 1)] − [m/(2j + 1)] points of the form π/i. Since, for j < j0 , by virtue of (7.76), m m 2m ≥ 2, − ≥ 2j − 1 2j + 1 (2j0 + 1)2
(7.86)
there are at least two points of the form π/i in [δj , δj+1 ). Summing inequalities (7.85) for all i that satisfy condition (7.84) and dividing the result by the number of terms, we get
Section 7 δj+1
|
|
∞
Telyakovskii Theorem
ΔAk (x)Φk (x)dx|x−1 dx −
4 iξi | πmrj i
k=0
δj
63
≤ CV j −2 + m
2π/m
j |ΔAk (x)|dx,
(7.87)
k
0
where the summation is carried out only over i satisfying condition (7.84). Relation (7.86) yields |
4j 2 − 1 2m 2m −1 1 − | ≤ (( 2 − 1) 2 ) ri 2m 4j − 1 4j − 1
4j 2 − 1 2 ) ≤ Cj 4 /m2 , 2m and, for i satisfying conditions (7.84), the following estimate is true: ≤ 2(
(7.88)
1 4j 2 − 1 − 2 | ≤ Cj/m. 2 m i Therefore, for such values i, we get |
|
1 ij j3 1 i ij 4 − | ≤ C 3 + C 2 ≤ C( 2 + ). mrj 2i m m m m
Hence, for the sum on the left-hand side of (7.87), we have i3 1 4 2 iξi − ξi /i| ≤ C( 2 + ) ξi | πmrj π m m i
i
i
≤ C(
j3 m2
1 )rj max ξi i m
+
≤ C(j/m + j −2 ) max ξi . i
(7.89)
In view of notation (7.71), relations (7.89) and (7.87) yield δj+1
|
| δj
∞ k=0
−1
ΔAk (x)Φk (x)|x
2 dx − π
≤ C(j/m + j
−2
[m/(2j−1)]
ξi /i|
i=[m/(2j+1)]+1 2π/m
)V + m 0
k
j |ΔAk (x)|dx.
(7.90)
64
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
In view of (7.77) and (7.78), this yields π/M
|
|
π/m
∞
m
ΔAk (x)Φk (x)|x−1 dx −
k=0
ξi /i|
i=[m/(2j0 +1)]+1
≤ CV
j0
(j/m + j
−2
)+m
j=1
2π/m j0 0
j |ΔAk (x)|dx.
(7.91)
j=1 k
By virtue of the definition of the numbers j0 and M, it is clear that [m/(2j0 + 1)] − M ≤ C. Hence, in view of (7.71), we obtain
[m/(2j0 +1)]
ξi /i ≤ CV.
(7.92)
(j/m + j −2 ) ≤ C.
(7.93)
i=M
Moreover, according to (7.76), we have j0 j=1
Recall that the notation
j means summation over all k that satisfy condi-
k
tion (7.81). Thus, if we change the order of summation in the double sum
j0
j,
j=1 k
then, for every k, the sum over j contains only one term because such j must satisfy the inequality 1 m 1 m − <j≤ + . 2(k + 1) 2 2(k + 1) 2 This yields j0
j |ΔAk (x)|
j=1 k
≤
m
|ΔAk (x)|.
k=0
Therefore, taking into account estimate (7.53), we get
m
2π/m j0 0
j=1 k
j |ΔAk (x)|dx
≤ CV.
(7.94)
Section 7
Telyakovskii Theorem
65
Relations (7.91)–(7.94) yield π/M
|
|
∞
−1
ΔAk (x)Φk (x)|x
i=M
k=0
π/m
m 2 dx − ξi /i| ≤ CV. π
Combining this estimate with (7.75), we obtain π ∞ m 2 −1 | ΔAk (x)Φk (x)|x dx − ξi /i| ≤ CV. | π π/m
(7.95)
i=1
k=0
According to (7.12) and (7.71), we have ξi = ξi for i = 1, 2, . . . , [m/3], and estimate (7.72), together with its analog ξi ≤ CV, yields m
m
ξi /i ≤ CV,
i=[m/3]+1
ξi /i ≤ CV.
i=[m/3]+1
Therefore, we can replace ξi by ξi , i.e., π ∞ m 2 −1 | ΔAk (x)Φk (x)|x dx − ξi /i| ≤ CV. | π π/m
(7.96)
i=1
k=0
Finally, note that, by virtue of (7.66), we get π/m
| 0
∞
−1
ΔAk (x)Φk (x)|x
dx =
∞
π/i
i=m π/(i+1)
k=0
|Ai (x)| dx. x
(7.97)
However, for i ≥ m, according to (7.50), we have Ai = −am+i sin mx + bm+i cos mx. Therefore, π/i
|Ai (x)| dx − x
π/(i+1)
π/i
|bm+i | dx x
π/(i+1)
π/i ≤
(|am+i |
sin mx 1 − cos mx dx + |bm+i | )dx x x
π/(i+1)
≤
Cm (|am+i | + |bm+i |). i2
(7.98)
66
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Since π/i
x−1 dx = i−1 + O(i−2 ) =
1 m + O( 2 ) m+i i
π/(i+1)
uniformly in m, it follows from (7.97) and (7.98), in view of (7.48) and (7.48 ), that π/m
|
| 0
∞ k=0
−1
ΔAk (x)Φk (x)|x
∞
dx −
|bi |/i|
i=2m+1 ∞ m (|am+i | + |bm+i |) ≤ CV. (7.99) ≤C i2 i=m
Comparing relations (7.96), (7.99), and (7.62), we obtain the following inequality: π ∞ m ∞ 2 ξi −1 ΔAk (x)Φk (x)|x dx − ( + | | π i 0
i=1
k=0
i=2m+1
|bi | )| ≤ CV. i
(7.100)
It is clear that an analogous inequality holds for the integral over [−π, 0]. This proves relation (7.60). Thus, Theorem 7.1 is completely proved.
8.
Corollaries of Theorem 7.1. Regularity of Linear Methods of Summation of Fourier Series
8.1. First, we indicate the special case of Theorem 7.1 related to an even trigonometric series. In this case, ξk ≡ |am−k − am+k |, and, hence, the following statement is true: Corollary 8.1. Suppose that the coefficients {ak } of the series ∞
a0 ak cos kx + 2 k=1
satisfy conditions (7.5)–(7.7). Then this series is a Fourier series and the following inequality holds uniformly in m = 0, 1, . . . :
Section 8 π |
|
Corollaries of Theorem 7.1
67
∞ m a0 2 |am−k − am+k | cos kx|dx − + | 2 π k k=1
0
k=1
≤ C(V (a) + B(a) +
qi,m m−2
|
i=2
k=1
Δai−k − Δai+k |), (8.1) k
where qi,m = min([i/2], [(m − i)/2]). In particular, for the integral of an even trigonometric polynomial, we have π |
m−1 m a0 2 |am−k | | + ak cos kx|dx − | 2 π k
0
k=1
k=1
m−1
≤ C(
|Δak | +
qi,m m−2
|
i=2
k=0
k=1
Δai−k − Δai+k |). (8.2) k
In relations (8.1) and (8.2), C denotes an absolute constant. 8.2. It is sometimes convenient to use the estimate from Theorem 7.1 with a simpler (but rougher) remainder. In this connection, using Theorem 7.1, we obtain the following statement: Corollary 8.2. Suppose that the coefficients of series (7.4) tend to zero, conditions (7.8) are satisfied, and ∞
k(|Δ2 ak−1 | + |Δ2 bk−1 |) < ∞.
(8.3)
k=1
Then series (7.4) is a Fourier series and the following estimate is true: |I − 2(
m 2 ξk /k + π k=1
∞
|bk |/k)|
k=2m+1
≤ C(|a0 | +
m−1 k=1
k(m − k) (|Δ2 ak−1 | + |Δ2 bk−1 |) m
+ |am | + |bm | +
∞ k=1
k(|Δ2 am+k−1 | + |Δ2 bm+k−1 |)). (8.4)
68
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
In particular, if each of the four number systems a0 , a1 , . . . , am , am+1 , am+2 , . . . , b0 , b1 , b2 , . . . , bm , bm+1 , bm+2 , . . . is either convex or concave, then series (8.3) converges and m 2 |I − 2( ξk /k + π k=1
∞
|bk |/k)| ≤ C max(|ak |; |bk |). k
k=2m+1
(8.5)
Proof. The proof of this statement is based on Lemma 7.1, according to which, for any number sequence {ak } and any m = 0, 1, . . . , one has m−1
¯m (a) ≤ C( Bm (a) + B
k=1
∞
k(m − k) 2 k|Δ2 am+k |), |Δ ak−1 | + m
(8.6)
k=1
and on the following auxiliary statement: Lemma 8.1. Let a0 , a1 , . . . , an−1 be certain numbers. Then, for any i = 0, 1, . . . , n − 1, the following estimate is true: |ai | ≤ |a0 | +
n−1 k=1
Moreover,
n−1
k(n − k) 2 |Δ ak−1 |, n
|Δak | ≤ C(|a0 | +
k=0
n−1 k=1
df
an = an+1 = 0.
k(n − k) 2 |Δ ak−1 |). n
(8.7)
(8.8)
Proof. Performing the Abel transformation, we get ai = a0 +iΔai −
i
kΔ2 ak−1 , ai = (n−i)Δai −
k=1
n−1
(n−k)Δ2 ak−1 . (8.9)
k=i+1
Thus, i n−1 n−i n−i i 2 kΔ ak−1 − (n − k)Δ2 ak−1 , a0 − ai = n n n k=1
k=i+1
Section 8
Corollaries of Theorem 7.1
69
whence i n−1 i(n − k) k(n − i) 2 n−i |ai | ≤ |a0 | + |Δ ak−1 | + |Δ2 ak−1 | n n n k=1
≤ |a0 | +
n−1 k=1
k=i+1
k(n − k) 2 |Δ ak−1 |, n
i.e., inequality (8.7) is proved. Now let us establish estimate (8.8). Let ν = [n/2]. Then n−1
|Δak | =
k=0
n−1
|Δaν +
k=ν
ν−1
Δ2 ai | +
i=k
≤ ν|Δaν | +
ν−1
|Δaν −
|Δ ai | + (n − ν)|Δaν | + 2
ν k=1
≤ n|Δaν | + 2
n−1
k|Δ2 ak−1 | +
n−1 k=1
k−1 n−1
|Δ2 ai |
k=ν i=ν
k=0 i=k
= n|Δaν | +
Δ2 ai |
i=ν
k=0
ν−1 ν−1
k−1
(n − k)|Δ2 ak−1 |
k=ν+1
k(n − k) 2 |Δ ak−1 |. n
(8.10)
We conclude from (8.9) and (8.7) that n|Δaν | ≤ C(|a0 | +
n−1 k=1
k(n − k) 2 |Δ ak−1 |). n
(8.11)
Combining relations (8.10) and (8.11), we obtain (8.8). Lemma 8.1 is proved. Passing directly to the proof of inequality (8.4), note that, using Lemma 8.1 and performing the Abel transformation, we find V (a) =
∞
|Δak | =
m−1
k=0
≤ C(|a0 | +
k=0 m−1 k=1
|Δak | +
∞
|Δak |
k=m ∞
k(m − k) 2 k|Δ2 ak+m−1 |). (8.12) |Δ ak−1 | + |am | + m k=1
70
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Thus, using analogs of inequalities (8.6) and (8.12) for the quantities Bm (b) + ¯m (b) and B(b), we conclude that the quantity V + Tm in inequality (7.11) B does not exceed the right-hand side of estimate (8.4). Inequality (8.4) is proved. To prove the second part of the statement of Corollary 8.2, note that if the number system a0 , a1 , . . . , am is convex or concave, i.e., Δ2 ak−1 ≥ 0 or Δ2 ak−1 ≤ 0 for k = 1, 2, . . . , m − 1, then m−1 k=1
k(m − k) 2 kΔ2 ak−1 + |Δ ak−1 | ≤ | m m/2
k=1
m−1
(m − k)Δ2 ak−1 |
k=m/2+1
≤ C max |ak |, 0≤k≤m
and if the sequence am+1 , am+2 , . . . is convex or concave, then ∞
k|Δ2 am+k | = |
k=1
∞
kΔ2 am+k | = |am+1 |.
k=1
Using analogous relations for the systems b0 , b1 , . . . , bm and bm+1 , bm+2 , . . . and taking estimate (8.4) into account, we obtain inequality (8.5). 8.3. Inequality (8.4) is true for any natural m. Therefore, setting m = 1 and using Corollary 8.2, we obtain the following corollary: Corollary 8.3. Suppose that the sequence {an }, n = 0, 1, . . . , satisfies the conditions ∞ an → 0 (n → ∞), (k + 1)|Δ2 ak | < ∞. (8.13) k=0
Then the trigonometric series ∞
an cos nt
n=0
is the Fourier series of a certain function f ∈ L and π f L = −π
If, in addition,
π ∞ ∞ |f (t)|dt = 2 | an cos nt|dt ≤ C (k + 1)|Δ2 ak |. 0
n=0 ∞ k=1
k=0
k −1 |ak | < ∞,
(8.14)
Section 8
Corollaries of Theorem 7.1
then the trigonometric series
∞
71
an sin nt
n=1
is also the Fourier series of a certain function g ∈ L and π ∞ ∞ ∞ an sin nt|dt ≤ C( (k + 1)|Δ2 ak | + k −1 |ak |). (8.15) gL = 2 | n=1
0
k=0
k=1
8.4. Theorem 7.1 and its corollaries enable us to establish the regularity of linear methods of summation of Fourier series that are determined by either triangular or rectangular matrices. In particular, on the basis of Theorem 7.1, we can prove the following general statement: (n)
Theorem 8.1. Suppose that the elements λk , n = 0, 1, . . . , k = 0, 1, . . . , of the matrix Λ satisfy the following conditions: (i)
∞
(n)
|Δλk | ≤ C, n = 0, 1, . . . ;
(8.16)
k=0
(ii) for any number n, there exists a number m such that qi,m m−2
|
i=2
k=1
(n)
(n)
Δλi−k − Δλi+k | k i/2 (n) (n) ∞ Δλm+i−k − Δλm+i+k | + | ≤ C, (8.17) k i=2 k=1
where qi,m = min([i/2], [(m − i)/2]) and C is an absolute constant; (iii) for any n, there exists a number Mn dependent only on n and such that, for all k, (n) |λk |log(k + 2) ≤ Mn . (8.18) Then, in order that the summation method Un (Λ) determined by the matrix Λ be regular in the space C, it is necessary and sufficient that the conditions (n)
lim λk = 1, k = 0, 1, . . . ,
n→∞
(8.19)
72
Regularity of Linear Methods of Summation of Fourier Series
and
(n) (n) m λm−k − λm+k
k
k=1
≤ C.
Chapter 1
(8.20)
be satisfied. Proof. The proof is based on Theorem 5.1. By virtue of (8.18), for any n we have (n) lim λk = 0. k→∞
Therefore, according to Theorem 7.1, it follows from (8.16) and (8.17) that, for every n, the series ∞ (n) λ0 (n) λk cos kx (8.21) + 2 k=1
are the Fourier series of certain summable functions Kn (x). Further, we use the following statement: Lemma 8.2. Suppose that the coefficients of the series ∞
a0 ak cos kx + 2
(8.22)
k=1
satisfy the conditions lim an = 0,
n→∞
∞
|Δak | = V (a) < ∞,
(8.23)
k=0
and i/2 ∞ Δai−k − Δai+k | | = B(a) < ∞. k
(8.24)
|an log n| ≤ C
(8.25)
i=2 k=1
If uniformly in n, then the partial sums of series (8.22) are uniformly bounded in the metric L : π n a0 | + ak cos kx|dx ≤ C. (8.26) 2 0
k=1
Section 8
Corollaries of Theorem 7.1
73
All assumptions of Lemma 8.2 are satisfied for series (8.21). Thus, by virtue of (8.18) and (8.26), we conclude that, in the case considered, condition (ii) of Theorem 5.1 is satisfied. Now consider condition (iii). In this case, for all x ∈ (0, π], the function ¯ n (x) has the derivative equal to Kn (x), so that K π
π ¯ n (t)| = |dK
0
|
∞
(n) λ0 λk cos kt|dt. + 2 (n)
(8.27)
k=1
0
It follows from estimate (8.1) that, under conditions (8.16) and (8.17), the validity of estimate (8.20) is necessary and sufficient for the uniform boundedness of integral (8.27). Thus, Theorem 8.1 will be proved if we establish the validity of Lemma 8.2. Proof of Lemma 8.2. It is obvious that the required statement will be proved if we show that, for any n ∈ N, π
∞
|
ak cos kx|dx ≤ C.
(8.28)
k=n+1
0
To prove this inequality, we set bk = so that
∞
0, k ≤ n,
ak , k > n,
(8.29)
∞
ak cos kx =
k=n+1
b0 bk cos kx. + 2
(8.30)
k=1
Applying Theorem 6.5 to the last series, we get π
∞
|
b0 bk cos kx|dx ≤ C(V (b) + B(b)). + 2
0
(8.31)
k=1
Let us show that i/2 ∞ Δai−k − Δai+k | | + O( max |ak | log n) B(b) = k n/2≤k≤3n/2 i=n k=1
uniformly in n ≥ 2. For this purpose, we set
(8.32)
74
Regularity of Linear Methods of Summation of Fourier Series n
=
n−1
|
i/2 Δbi−k − Δbi+k
k
i=2 k=1
|,
i/2 i/2 ∞ Δbi−k − Δbi+k Δai−k − Δai+k (| |−| |). Rn = k k i=n
k=1
Then B(b) =
Chapter 1
(8.33)
(8.34)
k=1
i/2 ∞ Δai−k − Δai+k + | | + Rn . n k
(8.35)
i=n k=1
To prove equality (8.32), it suffices to show that +Rn = O( max |ak | log n) n
n/2≤k≤3n/2
(8.36)
uniformly in n ≥ 2. Let us estimate the quantity n . According to (8.29), we have Δbi−k = 0 in sum (8.33) for all i and k. Therefore, n
=
n−1
|
i/2 Δbi+k
i=2 k=1
k
|.
(8.37)
Since i/2 Δbi+k
k
k=1
i/2 1 1 1 = bi+1 + )bi+k − b ( − , k k−1 [i/2] i+[i/2]+1 k=2
bi+k = 0 for i + k ≤ n, and bi+k = ai+k for i + k > n, we have n
≤
n−1
(|bi+1 | +
i=2
≤
i/2 k=2
max n+1≤k≤3n/2
|ak |
(
1 1 1 |) − )|bi+k | + |b k−1 k [i/2] i+[i/2]+1
n−1 i=2
1 |ak |(1 + log n). ≤ max n − i n+1≤k≤3n/2
(8.38)
Now let us estimate the quantity Rn . Note that Δbi+k = Δai+k for all i ≥ n. If i − k > n, then Δbi−k = Δai−k . However, i − [i/2] > n for all i > 2n, and, hence, i/2 2n Δbi−k − Δai−k Rn ≤ | |. (8.39) k i=n k=1
Section 8
Corollaries of Theorem 7.1
75
Since i/2 Δbi−k − Δai−k
k
k=1
k=1
+ by setting di,k
i/2−1
= −(bi − ai ) +
1 1 (bi−k − ai−k )( − ) k k+1
1 − ai−[i/2] ), (b [i/2] i−[i/2]
⎧ −1, k = 0, ⎪ ⎪ ⎨ = k −1 − (k + 1)−1 , k = 1, . . . , [i/2] − 1, ⎪ ⎪ ⎩ [i/2]−1 , k = [i/2],
we obtain i/2 Δbi−k − Δai−k k=1
k
=
i/2
(bi−k − ai−k )dik .
k=0
However, bi−k = 0 for k ≥ i − n and bi−k = ai−k for i − n > k. Therefore, i/2 i/2 2n 2n Δbi−k − Δai−k | | ai−k di,k | |= k i=n k=1
i=n k=i−n
≤
=
max |ak |
n/2≤k≤n
|di,k |
i=n k=i−n
max |ak |(2 +
n/2≤k≤n
≤
i/2 2n
2n
(i − n)−1 )
i=n+1
max |ak |(3 + log n).
n/2≤k≤n
(8.40)
Comparing relations (8.38)–(8.40), we obtain estimate (8.36) and thus establish equality (8.32). Now note that, for any n ∈ N, V (b) =
∞ k=0
|Δbk | = |an+1 | +
∞
|Δak | ≤ |an+1 | + V (a).
(8.41)
k=n+1
Therefore, combining relations (8.31), (8.32), (8.41), and (8.23)–(8.25), we obtain estimate (8.28). Lemma 8.2 and, hence, Theorem 8.1 are proved.
76
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
8.5. By virtue of estimates (8.6) and (8.12), relations (8.16) and (8.17) hold if (n)
(n) |+ |λ0 | + |λm
∞ k|m − k|
m+k
k=1
(n)
|Δ2 λk−1 | ≤ C.
(8.42)
Therefore, the following theorem is true: Theorem 8.1. Suppose that the elements λk , n = 0, 1, . . . , k = 0, 1, . . . , of a matrix Λ satisfy the following conditions: (n)
(i) for any number n, there exists a number m such that inequality (8.42) holds; (ii) for any n, there exists a number Mn dependent only on n and such that estimate (8.18) holds for all k; Then, in order that the summation method Un (Λ) be regular in the space C, it is necessary and sufficient that conditions (8.19) and (8.20) be satisfied. Let us show that Theorem 8.1 yields the statement of Theorem 5.3. To this end, it suffices to show that conditions (5.17)–(5.19) yield estimates (8.42) and (8.20). Let 1+ξ 1+ξ Φ(ξ) = |1 − ξ| log , ξ > 0, ξ = 1. ξ |1 − ξ| If ξ ∈ (0, 1), then Φ(ξ) > 2|1 − ξ|, and since Φ(ξ) = Φ(1/ξ), a similar inequality holds for ξ ∈ (1, ∞). Therefore, if (5.19) is true, then C≥
∞ k=1 k =m+1
∞
k|m − k + 1| k−1 (n) (n) (k − 1)Φ( )|Δ2 λk−1 | > |Δ2 λk−1 | m m k=1
1 1 (n) k|Δ2 λk−1 | + ≥ 2 2 m/2
k=1
∞
(n)
|m − k||Δ2 λk−1 |
k=m/2+1
∞
>
1 k|m − k| 2 (n) |Δ λk−1 |. 8 m+k
(8.43)
k=1
Thus, for any m ∈ N, we have ∞ k|m − k| k=1
m+k
(n)
|Δ2 λk−1 | ≤ 8C.
(8.44)
Section 8
Corollaries of Theorem 7.1
77
Further, by virtue of (5.18), we get (n)
lim λk = 0.
k→∞
Therefore, for any m ∈ N, λ(n) m =
∞
(n)
∞
(n)
Δλk , Δλk =
k=m
(n)
Δ2 λi ,
i=k
whence λ(n) m =
∞ ∞
(n)
Δ2 λi
i ∞
=
(n)
Δ2 λi
=
i=m k=m
k=m i=k
∞
(n)
(i − m + 1)Δ2 λi .
i=m
In view of estimate (8.43), this yields (n) | |λm
≤
∞
(k − m +
(n) 1)|Δ2 λk |
=
k=m
∞
(n)
(k − m)|Δ2 λk−1 | ≤ C.
(8.45)
k=m+1
Combining relations (8.44)–(8.45) and (5.17), we obtain estimate (8.42). Now let us verify condition (8.20). We have m m m+k−1 1 (n) 1 (n) (n) Δλi |. |λm−k − λm+k | = | k k k=1
k=1
(8.46)
i=m−k
However, m+k−1
(n) Δλi
=−
i=m−k
m+k−2
(n)
(m − i)Δ2 λi
(n)
(n)
+ (k + 1)Δλm−k + (k − 1)Δλm+k−1 .
i=m−k
Thus, we must estimate the following three sums: m m+k−2 1 (n) (m − i)Δ2 λi |, | S1 = k k=1
S2 =
i=m−k
S3 =
m k−1 k=1
k
m k+1 k=1
(n)
Δλm+k−1 .
k
(n)
Δλm−k ,
(8.47)
78
Regularity of Linear Methods of Summation of Fourier Series
Chapter 1
Changing the order of summation and taking (5.19) into account, we get S1 ≤
m
(n)
(m − i)|Δ2 λi |
i=1
≤
m
m 2m m 1 1 (n) |m − i||Δ2 λi | + k k i=m+1
k=m−i
(m − i) ln
i=1
+
k=i−m
m (n) |Δ2 λi | m−i 2m
|m − i| ln
i=m+1
It is clear that S2 + S3 ≤ 3
m (n) |Δ2 λi | < C. |m − i|
∞
(8.48)
(n)
|Δλk |.
k=0
Hence, according to (8.12) and (8.42), we obtain S2 + S3 ≤
(n) C(|λ0 |
+
m−1 k=1
(n)
∞
k(m − k) 2 (n) (n) k|Δ2 λk+m−1 |) |Δ λk−1 | + |λ(n) m |+ m
(n) |+ ≤ C(|λ0 | + |λm
k=1
∞ k=1
k|m − k| 2 (n) |Δ λk−1 |) < C. m+k
(8.49)
Combining relations (8.46)–(8.49), we obtain estimate (8.20). Thus, Theorem 5.3 is proved.
2. SATURATION OF LINEAR METHODS
1.
Statement of the Problem
1.1. Together with the notion of regularity considered in Chapter 1, the notion of saturation of linear method refers to the general problems of the theory of linear methods of summation of Fourier series. In order to pass to this notion, we make several remarks. First of all, note that we use here the notation of Chapter 1 and, in particular, the notation accepted in Subsection 1.1.1. If, for some k ∈ N, we have (n)
f (x) − Un (f ; x; Λ)C = o(|1 − λk |), n → ∞,
(1.1)
then the Fourier coefficients ak and bk of the function f (·) are equal to zero. Indeed, since π 1 (n) [f (x) − Un (f ; x; Λ)]e−ikx dx = (1 − λk )(ak − ibk ), (1.2) π −π
(n) |1 − λk | a2k + b2k ≤ 2f (x) − Un (f ; x; Λ)C ,
we have
and, consequently, relation (1.1) holds only if ak = bk = 0. Therefore, if a given method Un (Λ) satisfies relation (1.1) for all k beginning with a certain k0 , then f (·) is a trigonometric polynomial of degree not higher than k0 − 1. In particular, if k0 = 1, then f (·) is a constant. Consequently, if f (·) is not identically a constant, then the order of decrease in f (x) − Un (f ; x; Λ)C to zero as n → ∞ is not larger than the maximal order of decrease in the differences (n) (n) 1 − λk , k ∈ N, to zero. Thus, Fej´er sums satisfy the relation 1 − λk = k/n, (n) and, hence, min(1 − λk ) = n−1 . Therefore, k
f (x) − σn (f ; x)C = o(n−1 ), n → ∞, 79
80
Saturation of Linear Methods
Chapter 2
only if f (x) ≡ const. In other words, for any f ∈ C, f ≡ const, we have f (x) − σn (f ; x)C > Kn−1 , where K is independent of n. Similarly, we conclude that, in the case of Zygmund sums, we have f (x) − Zn(s) (f ; x)C > Kn−s , f ≡ const, and, in the case of Rogosinski sums, we have f (x) − Rn (f ; x)C > Kn−2 , f ≡ const. (n)
For partial Fourier sums, we have 1−λk = 0. Therefore, equality (1.1) does not really impose any restrictions on f (x) − Sn (f ; x)C . For de la Vall´ee Poussin sums, the restrictions depend on the choice of the number p. Thus, in the case of Fej´er, Rogosinski, and Zygmund sums and some other linear methods, there exists a function ϕΛ (n) such that the approximations induced by a given method do not decrease faster than ϕΛ (n). In this connection, we have the following problem of saturation in the theory of linear methods of summation of Fourier series: Given a concrete Λ-method and certain properties of the elements of the matrix Λ, establish whether there exists a function ϕΛ (n) described above, determine it, and describe the class of functions for which the orders of approximation obtained by this method are equal to ϕΛ (n). 1.2. We now give the main definition. Let Lp , p ≥ 1, be the space of 2πperiodic functions ϕ(·) with finite norm ϕp , where, for p ∈ [1, ∞), we have π ϕLp = ϕp = (
|ϕ(t)|p dt)1/p ,
(1.3)
−π
and, for p = ∞, we have ϕ∞ = esssup |ϕ(t)|, i.e., L1 = L. As above, let C be the set of 2π-periodic continuous functions ϕ(t) with norm ϕ(t)C = max |ϕ(t)|. Definition 1.1. Let X be either C or Lp , p ∈ [1, ∞), and let Un (Λ) be a linear method of summation of Fourier series that generates polynomials Un (f ; x; Λ) of the form (1.1.3). Suppose that there exists a positive function ϕΛ (n), n ∈ N, that monotonically decreases to zero and is such that if f (x) − Un (f ; x; Λ)X = o(ϕΛ (n)), n → ∞,
(1.4)
Section 2
Sufficient Conditions for Saturation
81
then, for X = C, f (x) ≡ const, and, for X = Lp , f (x) = const almost everywhere, and there exists at least one function f (·) not identically equal to a constant and such that f (x) − Un (f ; x; Λ)X = O(ϕΛ (n)), n → ∞.
(1.5)
Then the method Un (Λ) is called saturated in the space X. The set of functions Φ(Λ)X satisfying equality (1.5) is called the saturation class, and the function ϕΛ (n) is called the order of saturation of the method Un (Λ). In view of this definition, the problem of saturation of a certain method Un (Λ) is to establish whether it is saturated in a given space X, and if so, then to determine the order and the class of saturation.
2.
Sufficient Conditions for Saturation 2.1. We cite a few more definitions that will be needed below. Let V be the set of functions F (x) of bounded variation with a finite norm π |dF (t)|
F V =
(2.1)
−π
such that F (x + 2π) = F (x) + (F (π) − F (−π)) and S[dF ] = a0 /2 +
∞
(ak (dF ) cos kx + bk (dF ) sin kx),
(2.2)
(2.3)
k=1
where 1 ak (dF ) = π
π −π
1 cos ktdF (t), bk (dF ) = π
π sin ktdF (t),
(2.4)
−π
is the Fourier–Stieltjes series for the function F ∈ V. A symbol ϕ(x)dF (x) denotes the Lebesgue–Stieltjes integral for the function ϕ(·). Further, let ψ(k), k ∈ N, be an arbitrary function of a natural variable. Let Lψ Lp be the set of functions f ∈ Lp such that the series ∞ k=1
1 (ak (f ) cos kx + bk (f ) sin kx) ψ(k)
(2.5)
82
Saturation of Linear Methods
Chapter 2
is the Fourier series of some function f ψ (·) from Lp , C ψ L∞ is the set of continuous functions f (·) such that series (2.5) is the Fourier series of a function f ψ (·) from L∞ , and Lψ V is the set of functions f ∈ L1 such that (2.5) is the Fourier–Stieltjes series of some function ϕ ∈ V. Using these definitions, we obtain the following result: Theorem 2.1. Suppose that, for the elements of a matrix Λ, there exists a positive function ϕΛ (n) monotonically decreasing to zero and such that (n)
1 − λk c = , ψ(k) > 0, k = 1, 2, . . . , n→∞ ϕΛ (n) ψ(k) lim
(n)
λ0
= 1, |c| > 0,
(2.6)
Then the method Un (Λ) is saturated in the spaces C and Lp , p ∈ [1, ∞), with order of saturation ϕΛ (n). Moreover, the saturation classes satisfy the relation Φ(Λ)C ⊆ C ψ L∞ ; Φ(Λ)Lp ⊆ Lψ Lp , p ∈ (1, ∞), Φ(Λ)L1 ⊆ Lψ V.
(2.7)
(n)
Proof. First of all, we note that, by virtue of (1.2), if λk = 1, then
a2k (f )
+
b2k (f )
= |[π(1 −
(n) λk )]−1
π
(f (t) − Un (f ; t; Λ))e−ikt dt|
−π
=|
ϕΛ (n) π(1 −
π
(n) λk ) −π
f (t) − Un (f ; t; Λ) −ikt dt|. e ϕΛ (n)
Therefore, if (2.6) and (1.4) are satisfied, then the right-hand side of the last equality tends to zero as n → ∞. Hence, ak (f ) = 0 and bk (f ) = 0 for all k ∈ N, i.e., f (x) ≡ const. (n) On the other hand, if f0 = cos x, then f0 (x)−Un (f ; x; Λ) = (1−λ1 ) cos x. Thus, in view of (2.6), we conclude that if X denotes either C or Lp , then f0 (x) − Un (f ; x; Λ)X = ϕΛ (n)
(n)
1 − λ1 cos xX = O(ϕΛ (n)). ϕΛ (n)
This means that the method Un (Λ) is saturated and the order of its saturation is equal to ϕΛ (n). It remains to show that equality (1.5) yields the corresponding inclusion (2.7). To this end, we show that if equality (1.5) holds, then the Fej´er sums of series
Section 2
Sufficient Conditions for Saturation
83
(2.5) satisfy the uniform estimates
N −1
(1 − k/N )
k=1
1 Ak (f ; x)Y ≤ A, ψ(k)
(2.8)
where Y = L∞ if X = C in (1.5), and Y = Lp , p ∈ [1, ∞), if X = Lp . We now use the following fact, which is proved, e.g., in the book of Bari [1, pp. 165–170]: Lemma 2.1. A trigonometric series α0 /2 +
∞
(αk cos kx + βk sin kx)
k=1
is the Fourier series of a continuous function if and only if the sequence of its Fej´er means σN (x) = α0 /2 +
N −1
(1 − k/N )(αk cos kx + βk sin kx)
k=1
converges uniformly. This series is the Fourier series of some function f ∈ Lp , 1 < p ≤ ∞, if and only if its Fej´er means are uniformly bounded in Lp : σN (x)p ≤ A. A trigonometric series is the Fourier–Stieltjes series of some function F ∈ V if and only if σN (x)1 ≤ K, N = 1, 2, . . . . This immediately yields inclusions (2.7). Thus, let us prove estimate (2.8). By setting Fn (x; Λ) = (f (x) − Un (f ; x; Λ))/ϕΛ (n), n = 1, 2, . . . , according to (1.5), we conclude that, for any n ∈ N, Fn (x; Λ)X ≤ A. Therefore, the Fej´er sums σN (Fn (·; Λ); x) of the functions Fn (x; Λ), which are equal to N −1 (n) 1 − λk σN (Fn (·; Λ); x) = (1 − k/N ) Ak (f ; x), ϕΛ (n) k=1
are uniformly bounded in X, i.e., σN (Fn (·; Λ); x)X ≤ A.
(2.9)
84
Saturation of Linear Methods
Chapter 2
However, relation (2.6) yields lim σN (Fn (·; Λ); x) = c
n→∞
N −1
(1 − k/N )
k=1
1 Ak (f ; x) ψ(k)
Therefore, (2.9) yields (2.8). The theorem is proved. 2.2. Remark 2.1. The conclusion of Theorem 2.1 remains true and its proof remains practically the same if condition (2.6) is replaced by the conditions (n)
(n)
1 − λk 1 − λk = α(k, n) + β(n) or = α(k, n)β(n), ϕΛ (n) ϕΛ (n)
(2.6 )
c , c = const, c = 0, and β(n) ψ(k) does not depend on k and is uniformly bounded in n, i.e., |β(n)| < A and c β(n) = − in the first case and |β(n)| > a0 > 0 in the second one. ψ(k) where α(k, n) is such that lim α(k, n) = n→∞
3.
Saturation Classes
3.1. Theorem 2.1 gives sufficient conditions for the saturation of a given method Un () and indicates the order of saturation and the set of functions containing the saturation class. The next result we wish to prove contains more precise information about saturation classes. Prior to its formulation, we give some additional information. Let T be the set of trigonometric series of the form df
y(x) = a0 /2 +
∞
(ak cos kx + bk sin kx)
(3.1)
k=1
and let μ = μ(k), k = 0, 1, . . . , be a fixed numerical sequence. For every y ∈ T, we define an element z ∈ T as follows: ∞
a0 μ0 μ(k)(ak cos kx + bk sin kx). z(x) = + 2 df
(3.1 )
k=1
Thus, every sequence μ = μ(k) generates an operator M acting from T into T, which is called a multiplier.
Section 3
Saturation Classes
85
If A and B are some subsets of T, then we denote by M (A, B) the set of multipliers M acting from A into B. In particular, if A = B = Lp , p ∈ [1, ∞], and series (3.1) and (3.1 ) are the Fourier series of functions y(x) and z(x), then we set M (Lp , Lp ) = Mp ; if A = B = V and series (3.1) and (3.1 ) are the Fourier–Stieltjes series of functions y(x) and z(x), then we set M (V, V ) = MV . If y and z are related by equalities (3.1) and (3.1 ) and the series in these equalities are either Fourier or Fourier–Stieltjes series of functions y(x) and z(x), then we write z(x) = M y(x). In addition, if M ∈ Mp , then let M p be the norm of the multiplier M as an operator from Lp into Lp : M p = sup M y(x)p ; yp ≤1
if M ∈ MV , then let M V be the quantity π M V = sup
yV ≤1 −π
|dM y(x)|.
If, as n → ∞, a sequence of multipliers M = {M (n)} satisfies the relation M (n)X = O(1), where X can be either Lp , 1 ≤ p ≤ ∞, or V and O(1) is a quantity uniformly bounded in n, then this sequence is called uniformly bounded in X. We have the following theorem: Theorem 3.1. Let ϕ(k) and ψ(k) be arbitrary functions of a natural vari(n) able and let Λ be a matrix consisting of elements λk such that the sequence 1, k = 0, (n) μ(n) = μk = (3.2) (n) (1 − λk )ψ(k)/ϕ(n), k = 1, 2, . . . , n = 1, 2, . . . , generates a sequence of multipliers M μn uniformly bounded in X. If X = Lp , then, for p = ∞ and any f ∈ C ψ L∞ , we have f (x) − Un (f ; x; Λ) ≤ A, (3.3) ϕ(n) p where A does not depend on n. If p ∈ [1, ∞), then (3.3) holds for any f ∈ Lψ p. If X = V, then (3.3) holds for p = 1 for any f ∈ Lψ V.
86
Saturation of Linear Methods
Chapter 2
If a function ψ(k) is such that the series ∞
ψ(k) cos kx
(3.4)
k=1
is the Fourier series of some function ψ ∈ L1 and inequality (3.3) holds for some p ∈ [1, ∞] for any f ∈ Lψ Lp , then sequence (3.2) generates a sequence of multipliers M μn uniformly bounded in Lp . Moreover, if (3.3) holds for p = 1 for any f ∈ Lψ V, then the multipliers μ n are uniformly bounded in the space V. M Proof. Let f ∈ C ψ L∞ . Then the series ∞ k=1
1 Ak (f ; x) ψ(k)
(3.5)
is the Fourier series of some function y ∈ L∞ . If the operators M (n) = M μn are uniformly bounded in L∞ , then, for every fixed n, the series ∞ k=1
(n)
μk
1 Ak (f ; x) ψ(k)
(3.6)
is the Fourier series of some function z ∈ L∞ such that z∞ = M μn y∞ ≤ M μn ∞ y∞ = O(1).
(3.7)
However, S[z(x)] =
∞ k=1
(n)
μk
f (x) − Un (f ; x; Λ) 1 Ak (f ; x) = S[ ]. ψ(k) ϕ(n)
Therefore, z(x) = (f (x) − Un (f ; x))/ϕ(n) almost everywhere, which, together with (3.7), implies that relation (3.3) holds for p = ∞. Relation (3.3) for p ∈ [1, ∞) is proved by analogy with the case X = Lp . The same method also proves it in the case where p = 1 and X = V. Indeed, if f ∈ Lψ V, then series (3.5) is the Fourier–Stieltjes series of some function y ∈ V, series (3.6) is the Fourier–Stieltjes series of some function z ∈ V, and, since the multipliers M μn are uniformly bounded in the space V, we have zV = M μn yV ≤ M μn V yV = O(1).
(3.7 )
Section 3
Saturation Classes
87
In this case, S[dz] =
∞ k=1
(n) 1 μk Ak (f ; t) ψ(k)
Hence,
t z(t) = −π
t = S[d −π
f (x) − Un (f ; x; Λ) dx]. ϕ(n)
f (x) − Un (f ; x; Λ) dx + c ϕ(n)
almost everywhere, and, consequently, in view of (2.1), we have π
t |d
zV = −π
−π
Thus, by virtue of
f (x) − Un (f ; x; Λ) 1 |= ϕ(n) ϕ(n)
(3.7 ),
π |f (x) − Un (f ; x; Λ)|dx. −π
we have
f (x) − Un (f ; x; Λ)L1 = O(1)ϕ(n), which proves the first part of the theorem. 3.2. Now assume that series (3.4) is the Fourier series of some function ψ ∈ L1 and relation (3.3) holds for all f ∈ Lψ Lp and some p ∈ [1, ∞). Let us show that, in this case, the multipliers M μn induced by sequence (3.2) belong to Mp , i.e., for any g ∈ Lp , we have M μn g ∈ Lp . a0 (g) Assume that g ∈ Lp , g(x) = + g1 (x) and 2 1 fg (x) = (g1 ∗ Ψ)(x) = π
2π g1 (x − t)Ψ(t)dt. 0
Then, considering the Fourier series of the function fg (·), we conclude that fg ∈ Lψ Lp and g1 (x) = f ψ (x) almost everywhere, and, moreover, ak (fg ) = ψ(k)ak (f ψ ) = ψ(k)ak (g), bk (fg ) = ψ(k)bk (f ψ ) = ψ(k)bk (g), k = 1, 2, . . . Thus, by setting Rn (f ; x) = (fg (x) − Un (fg ; x; Λ))/ϕ(n), we obtain (n)
1 − λk (n) ak (Rn (fg ; ·) + a0 (g)/2) = ψ(k)ak (g) = μk ak (g), ϕ(n)
(3.8)
88
Saturation of Linear Methods
Chapter 2
and, by analogy, (n)
bk (Rn (fg ; ·)) = μk bk (g).
(3.8 )
The function fg (·) satisfies relation (3.3). Hence, Rn (fg ; ·) + a0 (g)/2p ≤ c(g), n = 1, 2, . . . , and, since g ∈ Lp , equalities (3.8) and (3.8 ) imply that, for all n ∈ N, the (n) sequence μk generates a multiplier M μn mapping Lp into Lp and such that, for any g ∈ Lp , we get M μn g(x)p = Rn (fg ; x) + a0 (g)/2p ≤ c(g),
(3.9)
where c(g) does not depend on n. Further, we use the following well-known result by Banach and Steinhauz: If a sequence of linear operators Tn defined on a Banach space E is bounded for all x ∈ E, then the sequence of their norms Tn is uniformly bounded in n. Applying this fact to relation (3.9), we conclude that the sequence M μn g is uniformly bounded, i.e., the multipliers M μn are uniformly bounded in Lp , p ∈ [1, ∞). 3.3. Finally, we consider the case where relation (3.3) holds for p = 1 for any f ∈ Lψ V. We show that the multiplier M μn is then uniformly bounded in the space V. Let g(·) be an arbitrary function from the set V and let 2π fg (x) = (Ψ ∗ dg)(x) =
Ψ(x + t)dg(t).
(3.10)
0
Then fg ∈ L1 and, moreover, ak (fg ) = ψ(k)ak (dg), bk (fg ) = ψ(k)bk (dg). Hence, ak (dg) = ak (fg )/ψ(k), bk (dg) = bk (fg )/ψ(k). Therefore, the series ∞ ak (fg ) bk (fg ) ( cos kx + sin kx) ψ(k) ψ(k) k=1
(3.11)
Section 3
Saturation Classes
89
is the Fourier–Stieltjes series of the function g. Thus, fg ∈ Lψ V. The rest of the proof is similar to the case studied above. We have t ak (d −π
(n)
1 − λk fg (x) − Un (fg ; x; Λ) ak (fg ) (n) dx) = ψ(k) = μk ak (dg), ϕ(n) ϕ(n) ψ(k) t
bk (d −π
fg (x) − Un (fg ; x; Λ) (n) dx) = μk bk (dg), k = 1, 2, . . . , ϕ(n)
and since relation (3.3) holds, we obtain t −π
fg (x) − Un (fg ; x; Λ) fg (x) − Un (fg ; x; Λ) dxV = L1 ≤ c(g). ϕ(n) ϕ(n) (n)
Therefore, the multiplier M μn induced by the sequence μk V into V so that, for all n, we get M μn gV ≤ c(g).
maps the space
(3.12)
Let V ∗ be the space of equivalent classes of g containing all functions from the space V that differ by a constant, i.e., V ∗ = {g : g = {F + c, F ∈ V, c = const}}, with the norm
π |dF (t)|.
gV0∗ =
(3.13)
−π
V0∗
= {F : F ∈ g ∈ V ∗ , F (0) = 0}. It is easy to see that the Furthermore, let space V0∗ is Banach with respect to norm (3.13), and since V0∗ ⊂ V, by virtue of (3.12), for any F ∈ V0∗ , we have M μn (F )V0∗ = M μn (F )V ≤ c(F ). By using the Banach–Steinhauz theorem, we see that the multipliers M μn are uniformly bounded in the space V0∗ and, therefore, in the space V. The theorem is proved.
90
Saturation of Linear Methods
Chapter 2
Corollary 3.1. Let Un (Λ) be a saturated linear method, let ϕ(n) = ϕΛ (n) be its order of saturation, and let ψ ∗ (k) be a sequence such that the sequence μ(n) =
(n) μk
1, =
(1 −
k = 0, (n) λk )ψ ∗ (k)/ϕ(n),
(3.2 )
k = 1, 2, . . . , n = 1, 2, . . . ,
induces multipliers M μn uniformly bounded in the space X. If X = Lp and p = ∞, then ∗ (3.14) C ψ L∞ ⊆ Φ(Λ)C ; if p ∈ [1, ∞), then
∗
Lψ Lp ⊆ Φ(Λ)Lp ;
(3.15)
Lψ V ⊆ Φ(Λ)L1 .
(3.16)
if X = V, then In particular, if ψ ∗ (k) = ψ(k), where ψ(k) is a sequence satisfying condition (2.6), then inclusions (3.14) and (3.16) as well as (3.15) for p ∈ (1, ∞) become equalities.
4.
Criterion for Uniform Boundedness of Multipliers
4.1. Theorem 2.1 indicates that, in order to prove that a given linear method Un (Λ) is saturated and determine its order of saturation, it suffices to show that conditions (2.6) are satisfied, which is straightforward in most cases. The same conditions also provide us with some preliminary information about saturation classes. More detailed information about the classes Φ(Λ)X is provided by Theorem 3.1, or more precisely, by its corollary. In order to use it, we have to prove the uniform boundedness of multipliers M μn generated by sequences (3.2 ). For this purpose, we need the following result: Theorem 4.1. The set of multipliers M μn generated by a sequence (n) μk , k = 1, 2, . . . , n = 1, 2, . . . , is uniformly bounded in C, L∞ , or V if and only if, for any N = 1, 2, . . . , we have Mn =
N −1
(n)
(1 − k/N )μk cos kx1 < A,
k=0
where A is a quantity uniformly bounded in n.
(4.1)
Section 4
Criterion for Uniform Boundedness of Multipliers
91
Proof. Consider the trigonometric series ∞
a0 (ak cos kx + bk sin kx), + 2
(4.2)
k=1
∞
(n)
μk cos kx,
(4.3)
k=1 ∞
a0 (n) μk (ak cos kx + bk sin kx) + 2
(4.4)
k=1
(n)
(n)
and let σN (x), lN (x), and σN (x) be their Fej´er sums of degree N − 1. We now prove the necessity of the conditions indicated in the statement of the theorem. First, assume that X = C or X = L∞ and series (4.2) is the Fourier series of some function f ∈ X. If the multipliers M μn are uniformly bounded in X, then series (4.4) are the Fourier series of some functions ϕn ∈ X, and, moreover, for any n = 1, 2, . . . , we have ϕn X = M μn f X ≤ M μn X f X ≤ Kf X . (n)
Therefore, taking into account the fact that, for any ϕn ∈ X, σN (ϕn ; x)X ≤ ϕn X , we find (n)
(n)
σN (x)X = σN (ϕn ; x)X ≤ ϕn X ≤ Kf X . However, (n) σN (x)
1 = π
π
(4.5)
(n)
lN (t − x)f (t)dt. −π
Thus, in view of (4.5), for any f ∈ X, we have 1 π
π
(n)
lN (t − x)f (t)dtX ≤ Kf X ,
n = 1, 2, . . . .
(4.6)
−π
We now use the following fact, which follows from the Banach–Steinhauz theorem: If the sequence b un (x) = x(t)yn (t)dt a
92
Saturation of Linear Methods
Chapter 2
is bounded for every bounded (or even every continuous) function x(t), t ∈ [a, b], then yn 1 ≤ c, n = 1, 2, . . . . Applying this result to inequalities (4.6), we establish that (4.1) holds. We now show the necessity of the conditions of the theorem for the space ∞ cos kx is the Fourier–Stieltjes series of some V. It is known that the series k=0
function G ∈ V. Therefore, if the set M μn is uniformly bounded in V, then the ∞ (n) μk cos kx are the Fourier–Stieltjes series of some function Gn ∈ V, series k=0
and, moreover, Gn V = M μn GV ≤ M μn V GV < K. (n)
Therefore, the Fej´er means σN (x) of the Fourier–Stieltjes series of functions Gn satisfy the following relation (here, FN (·) is the Fej´er kernel of degree N − 1): (n) σN (x)1
=
N −1
(n)
(1 − k/N )μk cos kx1
k=0
π = −π
1 | π
π −π
1 FN (t − x)dGn (t)|dx ≤ FN (·)1 π
π |dGn (t)| ≤ K.
−π
This proves the necessity of the conditions of the theorem. Assume that (4.1) holds and (4.2) is the Fourier series of some function f ∈ C. First of all, note that, in this case, (4.4) is also the Fourier series of some continuous function. Indeed, Lemma 2.1 implies that series (4.3) is the Fourier– Stieltjes series of a function Φn ∈ V. Therefore, we have (n) σN (x)
1 = π
π σN (x − t)dΦn (t)
(4.7)
−π
and, for any p ∈ Z, we get (n) σN +p (x)
−
(n) σN (x)C
1 ≤ π
π |σN +p (x − t) − σN (x − t)||dΦn (t)|.
(4.8)
−π
In view of (1.3.14), the sums σN (x) converge uniformly to f (x). Therefore, (n) the last inequality implies that, as N → ∞, the sums σn (x) also converge
Section 4
Criterion for Uniform Boundedness of Multipliers
93
uniformly. Then Lemma 2.1 implies that series (4.4) is indeed the Fourier series of some continuous function fn (x). Thus, every multiplier M μn acts from C into C and its norm satisfies the relation M μn C = sup{Mn (f )C : f C ≤ 1} (n)
≤ sup{(fn (x) − σN (fn ; x)C (n)
+ σN (fn ; x)C : fn C ≤ 1}.
(4.9)
Since (n) σN (fn ; x)C
1 = π
π
(n)
f (x − t)lN (t)dtC −π (n)
≤ f C lN 1 ≤ cf C ,
(4.10)
by taking the limit as N → ∞ and using (4.9), we obtain M μn C ≤ A. Now assume that (4.1) holds and (4.2) is the Fourier series of a function f ∈ L∞ . Then, by virtue of Lemma 2.1, series (4.4) is also the Fourier series of some function fn ∈ L∞ , i.e., the multiplier M μn acts from L∞ into L∞ . It is known that, for any f ∈ L∞ , f ∞ = lim f p . Therefore, we have p→∞
(n)
(n)
M μn f ∞ = fn (x)∞ = lim lim fn (x) − σN (x) + σN (x)p p→∞ N →∞
(n)
(n)
≤ lim lim fn (x) − σN p + lim lim σN (x)p . p→∞ N →∞
p→∞ N →∞
(4.11)
The Fej´er sums of a function ϕ ∈ Lp converge to ϕ(·) in the space Lp . Hence, (n)
lim fn (x) − σN (x)p = 0.
N →∞
(4.12)
On the other hand, by virtue of Minkowski inequality, for any N and p > 1, we have (n) σN (x)p
π = σN (fn ; x)p = ( −π
≤
1 | π
π
(n)
f (t)lN (x − t)|p dtdx)1/p −π
1 (n) (n) f p lN (x)1 ≤ 2f ∞ lN (x)1 . π
(4.13)
94
Saturation of Linear Methods
Chapter 2
In view of inequality (4.1), relations (4.11)–(4.13) imply that, for any f ∈ L∞ , we have M μn f ∞ ≤ 2Af ∞ , which is obviously equivalent to the uniform boundedness of the set of multipliers M μn in the set L∞ . 4.2. Finally, assume that (4.1) holds and (4.5) is the Fourier–Stieltjes series of some function F ∈ V. Then, for any N and n, we have (n) σN (x)
1 =| π
π
(n)
(n)
lN (x − t)dF (x)| ≤ lN 1 F V ≤ AF V . −π
Hence, Lemma 2.1 implies that series (4.4) is the Fourier–Stieltjes series of some function Fn ∈ V. Consider the functionals π s(x)dFn (x), s ∈ C, n = 1, 2, . . . .
Φn (s) = −π
We have π |Φn (s)| ≤ lim | N →∞
π s(x)dFn (x) −
−π
(n)
s(x)σN (x)dx|
−π
π + lim | N →∞
(n)
s(x)σN (x)dx|.
−π
However, by passing to the limit under the sign of Stieltjes integral, we obtain π lim
N →∞ −π
(n) s(x)σN (x)dx
π = lim
N →∞ −π
π = lim
N →∞ −π
KN (x − t)dFn (t)dt
1 ( π
π s(x)KN (x − t)dx)dFn (t) −π
π s(t)dFn (t).
= −π
Section 4
Criterion for Uniform Boundedness of Multipliers
95
Moreover, for any N, π |
(n)
(n)
s(x)σN (x)dx| ≤ sC σN 1 .
−π
Therefore, for any n and any s ∈ C, we have |Φn (s)| ≤ KsC , where K is a quantity uniformly bounded in n. Using the Banach–Steinhauz theorem, we conclude that the sequence of norms Φn C of functionals Φn (s) is bounded. In our case, we have Φn C = Fn V . Consequently, the sequences Fn V are uniformly bounded, and, hence, M μn V =
sup M μn F V =
F V ≤1
sup Fn V ≤ K.
F V <1
The theorem is proved. 4.3. Remark 4.1. Condition (4.1) is sufficient for the multipliers M μn to be uniformly bounded in Lp also in the case where p ∈ (1, ∞). Indeed, if condition (4.1) is satisfied and series (4.2) is the Fourier series of a function f ∈ Lp , then inequality (4.13) yields (n)
σN (x)p ≤
1 (n) f p lN 1 ≤ Kf p , π
(4.14)
whence, using Lemma 2.1, we conclude that (4.4) is the Fourier series of some function fn (·) in Lp . Therefore, the multiplier M μn actually maps Lp into Lp , and its norm satisfies the relation M μn p = sup{M μn f p : f p ≤ 1} (n)
(n)
≤ sup{fn (x) − σN (f ; x)p + σN (fn ; x)p : f p ≤ 1}. Thus, by using relations (4.12) and (4.14), we obtain the required statement. Remark 4.2. Condition (4.1), while being sufficient for the multipliers M μn to be uniformly bounded in the spaces Lp , p ∈ (1, ∞), is not, in general, necessary. Indeed, it is easy to see that the multiplier M μn generated by a sequence μk , k = 1, 2, . . . , maps the space L2 into L2 if and only if this sequence is bounded ( μk ∈ l∞ ). However, not every sequence μk ∈ l∞ is a sequence of
96
Saturation of Linear Methods
Chapter 2
Fourier–Stieltjes coefficients. Conditions (4.1) guarantee that (4.3) is a Fourier– Stieltjes series. Therefore, there exist sequences μk such that M μk ∈ M2 and the quantities N −1 (1 − k/N )μk cos kx1 k=0
are unbounded. Remark 4.3. In the space L2 , we have M μn 2 = sup{M μn f 2 : f 2 ≤ 1} ∞ (n) = sup{ (μk )2 (a2k + b2k ) : f 2 ≤ 1}, k=0
ak = ak (f ), bk = bk (f ). This implies that the inequality M2μn < A, where A is independent of n, holds if and only if (n)
|μk | < c,
(4.15)
Hence, condition (4.15) is a criterion for the uniform boundedness of multipliers M μn in the space L2 .
4.4. Sufficient conditions for the validity of (4.1) can easily be obtained from the results of Chapter 1 and, in particular, from Theorem 1.6.5. At the same time, for this purpose, it is often possible to use simpler statements, e.g., the following one: (n)
Lemma 4.1. Condition (4.1) is satisfied if sequences μk are uniformly bounded and uniformly quasiconvex, i.e., if, for any n = 1, 2, . . . , one has (n) |μk |
≤ A,
∞
(n)
(k + 1)|Δ2 μk | ≤ A1 ,
(4.16)
k=0 (n)
(n)
(n)
(n)
where A and A1 are absolute constants and Δ2 μk = μk − 2μk+1 + μk+2 .
Section 4
Criterion for Uniform Boundedness of Multipliers (n)
97
(n)
Proof. Setting ak = ak = (1 − k/N )μk if k ≤ N − 1 and ak ≡ 0 if k ≥ N and using estimate (1.8.4) for m = 1, we get Mn ≤ C(|a0 | + |a1 | +
∞
k|Δ2 ak |)
k=1 (n)
= C(|μ0 |(n) + (1 − 1/N )|μ1 | +
N −2
(n)
(k + 1)|Δ2 ak | + |μN −1 |).
k=0
Therefore, in order to obtain (4.1), it suffices to show that, for any N = 1, 2, . . . , N −2 (k + 1)|Δ2 ak | ≤ A2 . k=0
However,
k 2 (n) )Δ2 μk + (μk+1 − μk+2 ). N N Hence, in view of (4.16), we get |Δ2 ak | = (1 −
N −2
(k + 1)|Δ2 ak | ≤ A1 +
k=0
N −2 2 |μk+1 − μk+2 | ≤ A1 + 4A. N k=0
Lemma 4.1 and Remarks 4.1 and 4.2 yield the following statement: (n)
Corollary 4.1. If the sequences μk satisfy conditions (4.16), then they generate multipliers M μn that are uniformly bounded in the spaces C, Lp , 1 < p ≤ ∞, and V. (n)
Remark 4.4. If the sequences μk ∞ k=0
are convex, then Δ2 μk ≥ 0 and, thus,
(n)
(n)
(n)
(k + 1)Δ2 μk = lim (μ0 − μN ). N →∞
(4.17)
This implies that condition (4.16) is satisfied for all uniformly bounded convex sequences. 4.5. In the spaces Lp , 1 < p < ∞, one can indicate conditions for the uniform boundedness of the multipliers M μn more general than (4.16), which follow from the well-known result of Marcinkiewicz (see Section 6.5).
98
5.
Saturation of Linear Methods
Chapter 2
Saturation of Classical Linear Methods
5.1. First of all, we recall the well-known fact that, by improving the differential properties of a function, we increase the order of its approximation by Fourier sums. Therefore, the method of partial Fourier sums is not saturated. (n)
5.2. In the case of the Zygmund method λk = 1 − (k/n)s , k = 0, 1, . . . , n − 1, s > 0. This method is saturated with an order of saturation ϕΛ (n) = n−s and Φ(Λ)C = C ψ L∞ , Φ(Λ)L1 = Lψ V, Φ(Λ)Lp = Lψ Lp , 1 < p < ∞, ψ(k) = k −s .
(5.1)
Indeed, since, in the case considered, (n)
1 − λk = k −s , k = 1, 2, . . . , n→∞ ϕΛ (n) lim
according to Theorem 2.1 this method is saturated with the order of saturation ϕΛ (n) = n−s , and, moreover, Φ(Λ)C ⊆ C ψ L∞ , Φ(Λ)Lp ⊆ Lψ Lp , and Φ(Λ)L ⊆ Lψ V. In order to show that the last inclusions are equalities, by virtue of Lemma 4.1 it suffices to prove that the sequences 1, k = 0, 1, . . . , n, (n) μk = s −s n k , k > n, (n)
are uniformly bounded and quasiconvex. It is clear that |μk | ≤ 1 and (n) lim μk = 0 as k → ∞. Let us prove that the second condition in (4.16) is also satisfied. We have ∞
(n)
(k + 1)|Δ2 μk | = n|Δ2 μn−1 | + (n + 1)|Δμ(n) n |+
k=0
(n)
|Δ2 μk |.
(5.2)
k=n+1 (n)
For k > n, the sequences μk ∞
∞
(n)
are convex, and, hence, (n)
(n)
(k + 1)|Δ2 μk | = (n + 2)Δμn+1 + μn+2
k=n+1
= ns (n + 2)((n + 1)−s − (n + 2)−s ) + ns (n + 2)−s ≤ s(n + 2)l−s (n + θ)s−1 + 1 ≤ 2s + 1, 0 ≤ θ ≤ 1.
Section 5
Saturation of Classical Linear Methods
99
Performing elementary estimates of the first two terms on the right-hand side of (5.2), we conclude that conditions (4.16) are satisfied. This proves equalities (5.1). As noted above, for s = 1 the Zygmund method is equivalent to the Fej´er method. Consequently, the Fej´er method is saturated, its order of saturation is ϕΛ (n) = n−1 , Φ(Λ)C = C ψ L∞ , Φ(Λ)L1 = Lψ V, and Φ(Λ)Lp = Lψ Lp for 1 < p < ∞. 5.3. Rogosinski method. Recall that, in this case, the means are defined by the matrix kπ n−1 (n) Λ = {λk }n−1 = cos . k=0 2n k=0 This method is saturated with the order of saturation ϕΛ (n) = n−2 , Φ(Λ)C = C ψ L∞ , Φ(Λ)L1 = Lψ V, and Φ(Λ)Lp = Lψ Lp , 1 ≤ p < ∞, where ψ(k) = k −2 . Indeed, kπ (n) 1 − cos 2 2 1 − λk 2n = π k . lim = lim n→∞ ϕΛ (n) n→∞ n−2 8 Then, by virtue of Theorem 2.1, this method is saturated and its order of saturation is n−2 . Moreover, Φ(Λ) ⊆ C ψ L∞ , Φ(Λ)L1 ⊆ Lψ V, and Φ(Λ)Lp ⊆ Lψ Lp , p ∈ (1, ∞). To prove that these inclusions are equalities, it suffices to show that the sequences ⎧ 1, k = 0, ⎪ ⎪ ⎪ ⎪ ⎪ kπ ⎨ 1 − cos (n) μk = 2n , k = 1, 2, . . . , n − 1, ⎪ −2 ⎪ k ⎪ ⎪ ⎪ ⎩ 2 −2 n k , k ≥ n, are uniformly bounded (which is obvious) and uniformly quasiconvex (which can easily be verified by direct computation). 5.4. De la Vall´ee Poussin method. In this case, we have ⎧ ⎪ 1, k = 0, 1, . . . , n − p, ⎪ ⎪ ⎪ ⎨ k−n+p (n) , k = n − p + 1, . . . , n, λk = 1 − ⎪ p+1 ⎪ ⎪ ⎪ ⎩0, k > n,
100
Saturation of Linear Methods
Chapter 2
where p = p(n) is a natural parameter, 1 ≤ p(n) ≤ n, which may depend on n. It is easy to show that if the limit lim p(n)/n = θ exists and θ ∈ [0, 1), n→∞ then the de la Vall´ee Poussin method is not saturated. The same conclusion is also true if θ = 1, but n − p(n) → ∞ as n → ∞. If θ = 1 and n − p(n) = cn , cn < c = 0, then the method is not necessarily saturated: relation (1.4) may be satisfied not only if f ≡ const, but also if f is an arbitrary trigonometric polynomial of degree less than cn . On the other hand, in this case, de la Vall´ee Poussin sums cannot approximate functions that differ from such subsets with rate better than n−1 , i.e., in this case, the sums Vn,p (f ; ·) approximate with the same quality as the Fej´er sums, which is clear because Vn,n (f ; ·) ≡ σn (f ; ·). 5.5. Favard method. In this case, we have ⎧ ⎪ ⎨ kπ cot kπ , k = 1, 2, . . . , n − 1, (n) 2n λk = 2n ⎪ ⎩0, k ≥ n. This method is saturated with the order of saturation n−2 . Indeed, (n) 1 − λk π2 2 lim = k . n→∞ n−2 12 Therefore, according to Theorem 2.1, ϕΛ (n) = n−2 , Φ(Λ)C ⊆ C ψ L∞ , Φ(Λ)Lp ⊆ Lψ Lp , 1 < p < ∞, Φ(Λ)L1 ⊆ Lψ V, and ψ(k) = k −2 . Further, taking into account that the function (1 − x cot x)/x2 is convex on the interval (0, π/2), we conclude, as before, that the sequences ⎧ 1, k = 0, ⎪ ⎪ ⎪ ⎪ ⎨ kπ kπ n2 (n) μk = (1 − cot ) , k = 1, 2, . . . , n − 1, ⎪ 2n 2n k 2 ⎪ ⎪ ⎪ ⎩ 2 2 n /k , k ≥ n, are uniformly bounded and quasiconvex. Consequently, Φ(Λ)C = C ψ L∞ , Φ(Λ)Lp = Lψ Lp , 1 < p < ∞, Φ(Λ)L1 = Lψ V, and ψ(k) = k −2 .
3. CLASSES OF PERIODIC FUNCTIONS
In their famous works, D. Jackson and S. N. Bernstein proved the first theorems, which are now called direct and inverse theorems of approximation theory. After this, it became clear that the approximative properties of functions, i.e., their capability of being approximated by algebraic (or trigonometric) polynomials, are completely determined by some other properties, which can be called smoothness properties. Therefore, the investigation of these properties and the classification of functions according to their properties is one of the most important elements of approximation theory. In this chapter, we consider definitions and simplest properties of classes of functions traditional for approximation theory and introduce new classes of periodic functions.
1.
Sets of Summable Functions. Moduli of Continuity
1.1. Let L(0, 2π) be the set of 2π-periodic functions summable on (0, 2π). The main functional spaces considered here are the following subsets of L(0, 2π): the space C of 2π-periodic functions f (t) continuous on the entire axis with the norm f C = max |f (t)|; t
the space M of 2π-periodic essentially bounded functions f (t) with the norm f M = ess sup |f (t)|; t
the space Lp , 1 ≤ p < ∞, of 2π-periodic functions f (t) summable to the pth power on (0, 2π) with the norm 101
102
Classes of Periodic Functions
f Lp
Chapter 3
2π = ( |f (t)|p dt)1/p . 0
In what follows, we write f p instead of f Lp and f ∞ instead of df
df
f M , bearing in mind that f ∞ = f L∞ = f M , i.e., the space M is formally identified with the space L∞ . It is clear that, for any p, p , 1 < p < p < ∞, the following imbedding holds: C ⊂ M = L∞ ⊂ Lp ⊂ Lp ⊂ L1 .
(1.1)
1.2. Let X denote one of the spaces C or Lp , 1 ≤ p ≤ ∞. The simplest classification of functions f (·) from X is as follows: Let ρSX denote a ball of radius ρ, ρ > 0, in X, ρSX = {f : f X ≤ ρ}.
(1.2)
Then every value of ρ is associated with a certain set of functions f (·) belonging to the ball ρSX . Thus, the space X is decomposed into the sets ρSX , which are called classes. It is clear that, for any ρ and ρ , 0 < ρ < ρ , we have ρSX ⊂ ρ SX .
(1.3)
For ρ = 1, we denote the ball ρSX by SX and write Sp instead of SLp . 1.3. A more detailed classification of functions can be carried out by using moduli of continuity. The modulus of continuity of a function f (x) continuous on a segment [a, b], f ∈ C[a, b], is a function ω(t) = ω(f, t) defined for t ∈ [0, b − a] by the relation ω(t) = ω(f, t) = sup
max |f (x + h) − f (x)|
0≤h≤t a≤x≤b−h
= sup{|f (x ) − f (x )| : |x − x | ≤ t; x , x ∈ [a, b]}.
(1.4)
This definition yields the following basic properties of the modulus of continuity for f ∈ C[a, b] : (i) ω(0) = 0;
Section 1
Sets of Summable Functions. Moduli of Continuity
103
(ii) the function ω(t) does not decrease on the segment t ∈ [0, b − a]; (iii) the function ω(t) is semiadditive, i.e., ω(t1 + t2 ) ≤ ω(t1 ) + ω(t2 ), (t1 + t2 ) ∈ [0, b − a];
(1.5)
(iv) the function ω(t) is continuous on [0, b − a]. Indeed, if we denote by · the norm in the space C[α, β] of functions ϕ(x) continuous on the segment [α, β], i.e., ϕ = max |ϕ(x)|, x∈[α,β]
(1.6)
then equality (1.4) can be rewritten as follows: ω(t) = ω(f, t) = sup f (x + h) − f (x), α = a, β = b − h.
(1.7)
0≤h≤t
Properties (i) and (ii) are now obvious. Property (iii) can be established, e.g., in the following way: ω(t1 + t2 ) =
sup 0≤h≤t1 +t2
f (x + h) − f (x)
= sup{f (x + h1 + h2 ) − f (x) : h1 ∈ [0, t1 ], h2 ∈ [0, t2 ]} ≤
sup f (x + h1 + h2 ) − f (x + h2 )
0≤h1 ≤t1
+
sup f (x + h2 ) − f (x)
0≤h2 ≤t2
= ω(t1 ) + ω(t2 ). To prove property (iv), we first note that if 0 ≤ t1 ≤ t2 ≤ b − a, then (1.5) yields ω(t2 ) = ω(t2 − t1 + t1 ) ≤ ω(t2 − t1 ) + ω(t1 ), i.e., ω(t2 ) − ω(t1 ) ≤ ω(t2 − t1 ).
(1.8)
Hence, for any t, t + Δt ∈ [0, b − a], we have ω(t + Δt) − ω(t) ≤ ω(|Δt|).
(1.8 )
104
Classes of Periodic Functions
Chapter 3
However, by the uniform continuity of functions continuous on a closed segment, we get lim ω(t) = 0. (1.9) t→+0
Thus, the function ω(t) is continuous from the right at the point t = 0. This and (1.8 ) prove the continuity of ω(t) for all t ∈ [0, b − a]. 1.4. It follows from the property of semiadditivity of the modulus of continuity ω(t) that, for any n ∈ N, ω(nt) ≤ nω(t),
(1.10)
and, for arbitrary λ > 0, (λ + 1)t ∈ [0, b − a], ω(λt) ≤ (λ + 1)ω(t).
(1.10 )
Indeed, for n = 1, inequality (1.10) is obvious. Assume that it is valid for n = k, k > 1. Then, according to (1.5), we have ω((k + 1)t) ≤ ω(kt) + ω(t) ≤ (k + 1)ω(t), i.e., in this case, (1.10) also holds for n = k + 1. Hence, (1.10) is valid for any natural n. If λ is an arbitrary positive number, then, denoting by [λ] its integer part and using the monotonicity property of the function ω(t) and relation (1.10), we get ω(λt) ≤ ω(([λ] + 1)t) ≤ ([λ] + 1)ω(t) ≤ (λ + 1)ω(t).
1.5. Note that if a function ϕ(t) possesses properties (i)–(iv) on the segment [0, c] (with b − a = c ), then its modulus of continuity ω(ϕ, t) coincides with it, i.e., ω(ϕ, t) ≡ ϕ(t). (1.11) Indeed, for any t ∈ [0, c], we have ϕ(t) = ϕ(t) − ϕ(0) ≤ ω(ϕ, t).
(1.12)
On the other hand, parallel with conditions (i)–(iv), the function ϕ(t) also satisfies inequality (1.8). Therefore, ω(ϕ, t) = sup ϕ(x + h) − ϕ(x) ≤ sup ϕ(h) = ϕ(t). 0≤h≤t
0≤h≤t
(1.13)
Section 1
Sets of Summable Functions. Moduli of Continuity
105
Relations (1.12) and (1.13) are equivalent to (1.11). Thus, properties (i)–(iv) completely characterize the function ω(t) as a modulus of continuity. Therefore, in what follows, any function defined on t ∈ [0, c] and having properties (i)–(iv) is called a modulus of continuity. As an example, we consider a function ϕ(t) = Ktα , where K is a fixed positive constant and 0 < α ≤ 1. This function is a modulus of continuity for any c > 0. Properties (i), (ii), and (iv) are obvious for it and property (iii) can easily be verified. In view of (1.10 ), the following inequality holds for any modulus of continuity ω(t) which is not identically equal to zero: ω(b − a) = ω(t
b−a b−a t b−a )≤ (1 + )ω(t) ≤ 2 ω(t), t t b−a t
i.e., we always have ω(t) ≥
ω(b − a) · t. 2(b − a)
This means that none of moduli of continuity ω(t) ≡ 0 can be an infinitesimal value of order higher than one in t when t → 0. In particular, the function Ktα with α > 1 cannot be a modulus of continuity for any K > 0. Note that a function ω(t) satisfies condition (iii) for t ∈ [0, c] whenever the ratio ω(t)/t does not increase. Indeed, in this case, for all t1 , t2 ∈ [0, c] such that (t1 + t2 ) ∈ [0, c], we have ω(t1 + t2 ) = t1 ≤ t1
ω(t1 + t2 ) ω(t1 + t2 ) + t2 t 1 + t2 t1 + t2 ω(t1 ) ω(t2 ) + t2 = ω(t1 ) + ω(t2 ). t1 t2
If a function ω(t) is convex on [0, c], i.e., for any t1 , t2 ∈ [0, c], ω(
t 1 + t2 1 ) ≥ (ω(t1 ) + ω(t2 )), 2 2
then the ratio ω(t)/t does not increase (see, e.g., Natanson [1, p. 476]). Therefore, every function ω(t) convex for t ∈ [0, c], ω(0) = 0, is a modulus of continuity.
106
Classes of Periodic Functions
Chapter 3
It is not difficult to construct an example of a modulus of continuity that is not a convex function. Assume that h ∈ (0, 1), c ≥ 2, and ⎧ t/h, t ∈ [0, h], ⎪ ⎪ ⎪ ⎪ ⎪ ⎨1, t ∈ [h, 1], (1.14) ω(t) = ⎪ (t − 1 + h)/h, t ∈ [1, 1 + h], ⎪ ⎪ ⎪ ⎪ ⎩ 2, t ∈ [1 + h, c]. One can easily check that this function is not convex. Nevertheless, it satisfies conditions (i)–(iv), i.e., it is a modulus of continuity. 1.6. Convex moduli of continuity play a special role in what follows. In this connection, the following lemma on a convex majorant is often useful: Lemma 1.1. For any modulus of continuity ω = ω(t) ≡ 0 defined on [0, c], there exists a convex modulus of continuity ω∗ (t) such that, for any t ∈ [0, c], ω(t) ≤ ω∗ (t) < 2ω(t),
(1.15)
and, moreover, the constant 2 on the right–hand side of this inequality cannot be reduced. Proof. As ω∗ (t), we take a function whose graph bounds from above the smallest convex domain containing the curvilinear trapezoid {0 ≤ t ≤ c, 0 ≤ y ≤ ω(t)}. It is clear that ω∗ (0) = 0 and ω∗ (t) is a function continuous and convex on [0, c], i.e., ω∗ (t) is a convex modulus of continuity. The inequality ω(t) ≤ ω∗ (t) follows immediately from the definition. Let us show that ω∗ (t) ≤ 2ω(t) for any t ∈ [0, c]. For this purpose, clearly, it suffices to examine only the points t for which ω(t ) < ω∗ (t ). However, if t is a point of this sort, then there exist points t1 and t2 such that ω∗ (t1 ) = ω(t1 ) and ω∗ (t2 ) = ω(t2 ), t ∈ (t1 , t2 ), and ω∗ (t) is a linear function for any t ∈ [t1 , t2 ], ω∗ (t) = ω(t1 ) + Consequently,
ω(t2 ) − ω(t1 ) t2 − t t − t1 (t − t1 ) = ω(t1 ) + ω(t2 ). t2 − t1 t2 − t1 t2 − t1
ω∗ (t ) t2 − t ω(t1 ) t − t1 ω(t2 ) = + . ω(t ) t2 − t1 ω(t ) t2 − t1 ω(t )
(1.16)
Section 1
Sets of Summable Functions. Moduli of Continuity
107
However, t1 < t and, hence, ω(t1 )/ω(t ) ≤ 1. By virtue of (1.10), we have ω(t2 ) = ω(
t2 t2 t ) ≤ ( + 1)ω(t ), t t
and, therefore, ω(t2 )/ω(t ) ≤ (t2 + t )/t . By using these estimates and (1.16), we get ω∗ (t ) t − t1 t2 + t t2 t1 t2 t2 − t + · =1+ − · < 2. ≤ ω(t ) t2 − t 1 t2 − t 1 t t 2 − t1 t 2 − t1 t Inequalities (1.15) are proved. If we take the modulus of continuity (1.14) as ω(t) and construct its least convex majorant ω∗ (t), then, for t = 1, we get ω∗ (1) =2−h ω(1)
∀h ∈ (0, 1).
Since the number h is arbitrary, this equality means that, in the general case, the constant 2 in (1.15) cannot be reduced. 1.7. We now formulate a statement that characterizes convex functions (see, e.g., Natanson [1, p. 477]). Proposition 1.1. If f (x) is a function convex on [a, b], then it can be represented in the form x f (x) = ϕ(a) + ϕ(t)dt, a
where ϕ(t) is a function nonincreasing on [a, b]. Conversely, any function f (x) that can be represented in this form is convex on [a, b]. Hence, any convex modulus of continuity ω(t) can be represented as t ω(t) =
ϕ(τ )dτ, 0
where the function ϕ(τ ) is nonincreasing and ω (t) = ϕ(t) almost everywhere. In defining the modulus of continuity of a function f (x) and establishing its properties, we have used the finiteness of a segment [a, b] only when proving property (iv). In that case, we have used, in fact, only the uniform continuity of a function f (x). Therefore, the definition of the modulus of continuity ω(f, t)
108
Classes of Periodic Functions
Chapter 3
and all its properties remain valid for an infinite interval, provided that a function f (x) is uniformly continuous on it (this is true, e.g., for a 2π-periodic function continuous on a period). 1.8. According to property (ii), the modulus of continuity of any function f (x) continuous on [a, b] does not decrease on [0, b − a]. In the general case, one cannot characterize its growth. However, if a function f (x) is periodic, then one can obtain additional information, namely, if the period of f (x) is 2π, then ω(f, t) = ω(f, π) for t ≥ π. Indeed, let x and x be arbitrary points of the real axis. Clearly, there always exist an integer k and a point x0 the distance between which and x is at most π such that x = x0 + 2kπ. Therefore, for t ≥ π, we have ω(t) =
sup |f (x) − f (x )| =
|x−x |≤t
sup |x−x0 |≤π
|f (x) − f (x0 )| = ω(π).
Thus, for any f ∈ C, the modulus of continuity has the form ω(t), 0 ≤ t ≤ π, ω(f, t) = ω(π), t ≥ π,
(1.17)
where ω(t) is the modulus of continuity defined in Subsection 1.5. This implies, in particular, that, in studying moduli of continuity of 2πperiodic functions, it suffices to consider these functions on any segment of length 3π.
2.
Classes Hω [a, b] and Hω
2.1. Let C[a, b] be the set of functions f (·) continuous on [a, b] and let ω = ω(t) be an arbitrary fixed modulus of continuity defined on [0, b − a]. We say that a function f ∈ C[a, b] belongs to the class Hω [a, b] (f ∈ Hω [a, b]) if its modulus of continuity ω(f, t) satisfies the condition ω(f, t) ≤ ω(t) ∀t ∈ [0, b − a].
(2.1)
It is clear that, with this definition, any function f0 ∈ C[a, b] belongs to at least one of the classes Hω [a, b]. To verify this it suffices to note that we can take the modulus of continuity of a function f0 (·) itself as a modulus of continuity ω(t) that determines a class. As a result, we obtain the inclusion f0 ∈ Hω0 [a, b], where ω0 (t) = ω(f0 , t).
Classes Hω [a, b] and Hω
Section 2
109
Thus, the entire set C[a, b] can be decomposed into classes Hω [a, b]. In this case, obviously, the imbedding Hω(1) [a, b] ⊆ Hω(2) [a, b]
(2.2)
takes place, provided that ω (1) (t) ≤ ω (2) (t) for any t ∈ [0, b − a]. If f ∈ Hω [a, b], then ∀t1 , t2 ∈ [a, b] |f (t1 ) − f (t2 )| ≤ ω(|t1 − t2 |).
(2.3)
The converse statement is also true, namely, if inequality (2.3) holds for any t1 , t2 ∈ [a, b], then f ∈ Hω [a, b]. Indeed, ω(f, t) =
sup |t1 −t2 |≤t
|f (t1 ) − f (t2 )| ≤
sup |t1 −t2 |
ω(|t1 − t2 |) = ω(t).
This means that Hω [a, b] is the class of functions satisfying condition (2.3) on the segment [a, b]. 2.2. In the case where ω(t) = Ktα , where 0 < α ≤ 1 and K is a positive constant, the class Hω [a, b] is called a H¨older (or Lipschitz) class of order α. In this case, we write KHα [a, b] (or K Lip α) instead of Hω [a, b]. If K = 1, then 1 · H α [a, b] = H α [a, b]. For α = 1, the class KH 1 [a, b] coincides with the class of functions f (x) absolutely continuous on [a, b] for which |f (x)| ≤ K almost everywhere. Indeed, let f ∈ KH 1 [a, b]. For any ε > 0 and any collection of disjoint segments [ak , bk ] ⊂ [a, b] with nk=1 (bk − ak ) < ε/K, we have n
|f (bk ) − f (ak )| ≤
k=1
n
K(bk − ak ) < ε.
k=1
This means that, in fact, the function f (x) is absolutely continuous and, hence, almost everywhere on [a, b], it has a finite derivative f (x) satisfying the following inequality (at points where it exists): f (x + Δx) − f (x) KΔx |f (x)| = lim = K. ≤ lim Δx→0 Δx→0 Δx Δx On the other hand, if f (x) is absolutely continuous on [a, b] and |f (x)| ≤ K almost everywhere, then, for any x , x ∈ [a, b], we have x |f (x ) − f (x )| = f (t)dt ≤ K · |x − x |, x
110
Classes of Periodic Functions
Chapter 3
i.e., f ∈ KH 1 [a, b]. It is clear that classes KH α [a, b] defined analogously for α > 1 contain only constants. 2.3. By using moduli of continuity, we can similarly decompose the space C of continuous 2π-periodic functions f (·) into classes. Namely, if ω(t) is a modulus of continuity defined for all t ≥ 0, then Hω (or KH α , respectively) denotes the class of functions for which ω(f, t) ≤ ω(t) (ω(f, t) ≤ Ktα ). In addition, according to Subsection 1.8, it suffices to define a modulus of continuity ω(t) only on the segment [0, π]. It is clear that an imbedding of the type (2.2) is valid for classes Hω and the statement of Subsection 2.2 holds for the class KH 1 (this class coincides with the class of 2π-periodic absolutely continuous functions f (x) for which |f (x )| ≤ K almost everywhere (this class is also denoted by KW 1 )).
3.
Moduli of Continuity in Spaces Lp . Classes Hωp
3.1. Every function f ∈ Lp (a, b), 1 ≤ p < ∞, is continuous in the metric of this space in the sense of the following assertion: Proposition 3.1. Let f ∈ Lp (a, b), 1 ≤ p < ∞. Then lim f (· + h) − f (·)Lp (a,b) = 0.
h→0
(3.1)
Proof. Let f (·) be an arbitrary function from Lp (a, b). As is well known, the space C(a, b) is everywhere dense in Lp (a, b). Therefore, for any ε > 0, there exists ϕ ∈ C such that f (·) − ϕ(·)p < ε. Equality (3.1) is obviously satisfied for the function ϕ(·). Hence, we can find δ = δ(ε) such that ϕ(· + h) − ϕ(·)Lp (a,b) < ε for |h| < δ. Consequently, for |h| < δ, we get f (· + h) − f (·)Lp (a,b) ≤ f (· + h) − ϕ(· + h)Lp (a,b) + ϕ(· + h) − ϕ(·)Lp (a,b) + ϕ(·) − f (·)Lp (a,b) < 3ε. Proposition 3.1 allows one to introduce the notion of a modulus of continuity by analogy with a modulus of continuity in the space C.
Section 3
Moduli of Continuity in Spaces Lp . Classes Hωp
111
The modulus of continuity of a function f ∈ Lp , 1 ≤ p < ∞, in the space Lp is the function ωp (t) = ωp (f, t) = sup f (· + h) − f (·)p , 0 ≤ t < ∞. |h|≤t
(3.2)
The function ωp (t) possesses all the basic properties characterizing moduli of continuity. Indeed, relation (3.2) implies that ωp (0) = 0 and ωp (t) does not decrease on the interval 0 ≤ t < ∞. In order to verify the inequality ωp (t1 + t2 ) ≤ ωp (t1 ) + ωp (t2 ), t1 , t2 > 0,
(3.3)
it suffices to use the arguments presented in Subsection 1.3 in the proof of property (iii), assuming that · = · p . The continuity of the function ωp (t) from the right at the point t = 0 follows from (3.1). If 0 < t < ∞, then, for any h such that t + h ≥ 0, we have |ωp (t + h) − ωp (t)| ≤ ωp (|h|) by virtue of (3.3). Therefore, lim |ωp (t + h) − ωp (t)| ≤ lim ωp (t) = 0.
|h|→0
t→+0
It is clear that the functions ωp (f, t), f ∈ Lp , possess all the other properties of ω(ϕ, t) with ϕ ∈ C. In particular, for any n ∈ N, ωp (nt) ≤ nωp (t) and, for any λ > 0, ωp (λt) ≤ (λ + 1)ωp (t). An analog of equality (1.17) also takes place, namely, for any f ∈ Lp , 1 ≤ p < ∞, the modulus of continuity ωp (f, t) has the form ω(t), 0 ≤ t ≤ π, (3.4) ωp (f, t) = ω(π), t ≥ π, where ω(t) is a modulus of continuity. 3.2. By analogy with the spaces C, the spaces Lp , 1 ≤ p < ∞, can be decomposed into the classes Hωp as follows: Let ω(t) be a modulus of continuity defined for all t ≥ 0. Then the class Hωp contains the functions f ∈ Lp for which ωp (f, t) = ω(t). In this case, by virtue of (3.4), it suffices to define the modulus of continuity ω(t) only on the segment 0 ≤ t ≤ π. It is clear that the class Hωp is completely characterized by the fact that, for all f ∈ Hωp , the following analog of inequality (2.3) holds: f (· + t1 ) − f (· + t2 )p ≤ ωp (|t1 − t2 |)
∀t1 , t2 ∈ R.
(3.5)
112
Classes of Periodic Functions
Chapter 3
Indeed, since functions f ∈ Hωp , are periodic, we have f (· + t1 ) − f (· + t2 )p = f (· + |t1 − t2 |) − f (·)p
(3.6)
for any t1 , t2 ∈ R. Therefore, if f ∈ Hωp , then (3.5) follows immediately from (3.6). Conversely, if (3.5) holds, then, according to (3.2) and (3.6), we have ωp (f, t) = =
sup |t1 −t2 |≤t
sup |t1 −t2 |≤t
f (· + |t1 − t2 |) − f (·)p f (· + t1 ) − f (· + t2 )p ≤
sup |t1 −t2 |≤t
ωp (|t1 − t2 |) = ωp (t).
It is also clear that, for α > 1, the inequality ωp (f, t) ≤ Ktα can be satisfied only for functions that are different from constants on a period only on a set of measure zero. (1) (2) The imbeddings Hω(1) ⊆ Hω(2) with ωp (t) ≤ ωp (t) for any t ≥ 0 are p p also obvious.
4.
Classes of Differentiable Functions
4.1. It has been shown in Subsection 1.5 that, for any modulus of continuity ω(t), the inequality ω(t) ≥ Kt, where K is a constant, must hold. Therefore, according to relation (2.2), the narrowest set that can be extracted from L(0, 2π) by using moduli of continuity is the set KH 1 , i.e., the set of absolutely continuous functions. A subsequent decomposition of the set A of absolutely continuous functions into classes is carried out by the existence of a certain number of their derivatives as follows: Let Ar denote the set of functions f ∈ L(0, 2π) that have absolutely continuous derivatives up to the (r − 1)th order (r ∈ N ) and let N denote some other class of functions from L(0, 2π), e.g., one of the classes that have been considered above. In this case, if f ∈ Ar for some r ∈ N and, in addition, f (r) ∈ N, then we say that f (·) belongs to the class A(r) N. For example, Ar SM is the class of 2π-periodic functions whose rth derivatives do not exceed one in modulus almost everywhere. This class is usually denoted by W r . Furthermore, Ar Hω is the class of 2π-periodic functions whose rth derivatives belong to the class Hω . This class is usually denoted by W r Hω . Below, following the tradition, we write W r instead of Ar in combinations with specific classes N. For r = 0, we assume that A0 N = N by definition.
Section 4
Classes of Differentiable Functions
113
4.2. Let L0 be the set of functions f ∈ L(0, 2π) with mean value zero on a period: π f (t)dt = 0. −π
Let us prove the following statement: Proposition 4.1. The set Ar , r ∈ N, coincides with the set A¯r of functions f ∈ L(0, 2π) that can be represented by the equality π
∞
a0 (f ) 1 f (x) = + 2 πk r k=1
ϕ(x − t) cos(kt − −π
where 1 a0 (f ) = π and ϕ(·) is a function from
rπ )dt, x ∈ R, 2
(4.1)
π f (t)dt −π
L0 .
Proof. The imbedding Ar ⊆ A¯r is implied by the following reasoning: Assume that f ∈ Ar and ∞
∞
k=1
k=0
a0 (f ) df S[f ] = (ak (f ) cos kx + bk (f ) sin kx) = Ak (f ; x) + 2
(4.2)
is the Fourier series of this function. In the case under consideration, this series is obviously convergent for all x ∈ R, i.e., S[f ] = f (x). Therefore, carrying out integration by parts in the representations of Fourier coefficients 1 ak = ak (f ) = π
π −π
1 f (t) cos ktdt, bk = bk (f ) = π
π f (t) sin ktdt,
(4.3)
rπ )dt. 2
(4.4)
−π
we get ∞
a0 (f ) 1 f (x) = + 2 πk r k=1
π f (r) (x − t) cos(kt − −π
Since f (r) ∈ L0 for any f ∈ A(r) , we have Ar ⊆ A¯r . To prove the imbedding A¯r ⊆ Ar , we use the following two classical results:
114
Classes of Periodic Functions
Chapter 3
Theorem 4.1. If a function f ∈ C has a bounded variation on a period, then the Fourier series S[f ] converges uniformly to f (x). Theorem 4.2. Every Fourier series S[f ] can be integrated within any limits, no matter whether it is convergent or not. This means that the sum of the series of integrals of terms of a Fourier series is always equal to the integral of a function f (·). The proof of Theorem 4.1 is given in almost all manuals on Fourier series. The proof of Theorem 4.2 can also be found in textbooks, but we present it here because the relations obtained in the course of the proof are used in what follows. Let x a0 (f ) F (x) = [f (t) − ]dt. 2 0
The function F (x) is 2π-periodic and absolutely continuous, and, hence, it has a bounded variation on a period. Therefore, according to Theorem 4.1, the Fourier series of this function converges to it uniformly, i.e., ∞
a0 (F ) (ak (F ) cos kx + bk (F ) sin kx). + F (x) = 2 k=1
However, 1 ak (F ) = π
2π F (t) cos ktdt 0
1 1 sin kt 2π = [F (t) ]0 − π k kπ
2π a0 (f ) [f (t) − ] sin ktdt 2 0
=−
1 kπ
2π f (t) sin ktdt = −
bk (f ) . k
0
Similarly, we obtain bk (F ) = ak (f )/k. Thus, ∞
a0 (F ) 1 F (x) = + (ak (f ) sin kx − bk (f ) cos kx). 2 k k=1
Section 4
Classes of Differentiable Functions
By setting x = 0, we find that a0 (F )/2 = we get F (x) =
∞
115
bk (f )/k. Hence, for any x ∈ R,
k=1
∞ 1 (ak (f ) sin kx + bk (f )(1 − cos kx)). k k=1
Theorem 4.2 is proved. Let us proceed with proving Proposition 4.1. We take the function ϕ(·) from decomposition (4.1) as the function f (·) in Theorem 4.2. We get x F (x) =
∞
a0 (F ) 1 ϕ(t)dt = + (ak (ϕ) sin kx − bk (ϕ) cos kx) 2 k k=1
0
π
∞
a0 (F ) 1 = + 2 kπ k=1
−π
π dt. ϕ(x − t) cos kt − 2
(4.5)
The series in this expression converge to F (x) uniformly. By comparing relations (4.1) and (4.5), we conclude that, for r = 1, the function f (x) defined by (4.1) is absolutely continuous, i.e., A¯1 ⊆ A1 . If r > 1, then, by virtue of the uniform convergence of the series in (4.5), the function f (x) in (4.1) can be differentiated r − 1 times. Moreover, f (r−1) ∈ A1 , which proves the imbedding A¯r ⊆ Ar for all r ∈ N. 4.3. Thus, we have Ar = A¯r . This implies that, on the set Ar (or A¯r ), the operator of differentiation Dr of order r ∈ N can also be defined as an operator that associated every function f ∈ Ar with a function ϕ ∈ L0 . This approach allows one to extend the operation of differentiation to fractional values of r, r > 0, as follows: The series in (4.1) has a sense for any r > 0 and ϕ ∈ L0 . For fixed r > 0, we denote the set of functions f ∈ L(0, 2π) for which S[f ] coincides with the right-hand side of (4.1) by Jrr and call it the set of rth periodic integrals of functions ϕ ∈ L0 . On the set Jrr , we define Drr as an operator that associates a function f ∈ Jrr with a function ϕ ∈ L0 by the relation ∞
a0 (f ) 1 S[f ] = + 2 πk r k=0
π ϕ(x − t) · cos(kt − −π
rπ )dt. 2
In this way, we can define the operator of differentiation Drr for any r > 0.
(4.6)
116
Classes of Periodic Functions
Chapter 3
In this case, the function ϕ(·) is called the rth Weyl derivative of the function f (·) and the following notation is used: ϕ(·) = Drr (f ) = frr (·). 4.4. Besides functions f (·), the set Jrr contains all functions that differ from f (·) on an arbitrary set of measure zero. Therefore, generally speaking, we have Jrr ⊃ Ar for r ∈ N. In what follows, if the series in (4.6) is convergent, we take its sum as a function f (·) regarded as an element of the set Jrr . Then for r ∈ N, we obviously have Jrr = Ar , Drr = Dr , and, hence, frr (·) = f r (·). 4.5. Classes of functions differentiable in the sense of Weyl can be defined by analogy with the classes of functions differentiable in the ordinary sense. If f ∈ Jrr and, moreover, frr ∈ N, then we say that a function f belongs to the class Jrr N. If N is a specific class of functions, then we set Jrr N = Wrr N. For example, Wrr Hω is the class of functions f (·) for which frr ∈ Hω , Wrr SM is the class of functions f (·) for which the inequality |frr (·)| ≤ 1 holds almost everywhere, etc. The last class is also denoted by Wrr . In the notation Drr , Wrr , Jrr , and, frr , the subscript r is omitted if this does not lead to misunderstanding. It is clear that, for r ∈ N, the classes Wrr N coincide with the classes W r N introduced in Subsection 4.1. Therefore, if f ∈ Jrr for r ≥ 1, then this function is at least absolutely continuous. However, if r ∈ (0, 1), then the fact that a function f (·) belongs to Jrr does not guarantee even its ordinary continuity. For more details concerning functions f ∈ Jrr , see Sections 7 and 8.
5.
Conjugate Functions and Their Classes 5.1. Let f ∈ L(0, 2π) and let, as usual, ∞
S[f ] =
a0 (f ) (ak (f ) cos kx + bk (f ) sin kx) + 2
(5.1)
k=1
be its Fourier series. Consider the power series ∞
a0 (f ) (ak (f ) + ibk (f ))z k + 2
(5.2)
k=1
on the unit circle z = eix , the coefficients ak (f ) and bk (f ) of which are the coefficients of series (5.1). Then series (5.1) is the real part of series (5.2). The
Section 5
Conjugate Functions and Their Classes
series ˜ ]= S[f
∞
(ak (f ) sin kx − bk (f ) cos kx)
117
(5.3)
k=1
is the imaginary part of series (5.2); it is called a series conjugate to series (5.1). ˜ ]. Therefore, the series conjugate to the Note that there is no free term in S[f ˜ series S[f ] is the series S[f ] without free term. ˜ ] is called trigonometriThe function f˜ ∈ L(0, 2π) for which S[f˜] = S[f cally conjugate, or simply conjugate, to f (·). It can be shown that the functions f (·) and f˜(·) are connected by the equality 1 f˜(x) = − 2π
π f (x + t) cot −π
t dt, 2
(5.4)
in which the integral is understood in the sense of its principal value, i.e., π −π
t f (x + t) cot dt = lim ( ε→0 2
−ε π t + )f (x + t) cot dt. 2
−π
(5.5)
ε
5.2. The problem of the existence of the function f˜(·) (or, which is the same, ˜ of the limit in (5.5)), the correlation between the series S[f ], S[t], and S[f˜], and other problems close to this topic are well described in the fundamental books of Bari [1] and Zygmund [5, 6]. Let us present some statements from these books which will be necessary below. Theorem 5.1. If the limit in (5.5) is finite, then f˜(x) exists and the series ˜ ] converges to f˜(x). S[f Theorem 5.2. Suppose that f ∈ Hω and 1
ω(t) dt = A < ∞. t
(5.6)
0
˜ ] converge uniformly to f (x) and f˜(x), respecThen the series S[f ] and S[f tively. Moreover, the function f (x) is continuous and the equality ˜ ] S[f˜] = S[f holds. Equality (5.7) remains valid if f (·) and f˜(·) belong to L(0, 2π).
(5.7)
118
Classes of Periodic Functions
Chapter 3
The function f˜(·) conjugate to a continuous function f (·) is not necessarily continuous. However, if the majorant ω(t) of its modulus of continuity ω(f, t) satisfies condition (5.6), then, according to Theorem 5.2, the function f˜(·) is continuous. Condition (5.6) is, clearly, satisfied if ω(t) = Ktα , 0 < α < 1. In this case, a stronger statement is valid for the function f˜(·). Theorem 5.3 (Privalov [1]). If f ∈ KH α , 0 < α < 1, i.e., if |f (x) − f (x )| ≤ K|x − x |α
∀x, x ∈ R,
(5.8)
where K is a fixed constant, then f˜(x) also satisfies condition (5.8), probably, with a different constant K. This statement fails for α = 0 and α = 1; if α = 1, then ω(f˜, t) = O(t ln 1/t) as t → 0. 5.3. Classes of conjugate functions are introduced according to the following ˜ denotes the class principle: If M is a class of 2π-periodic functions, then M ˜ ˜ ω is the of functions f (·) conjugate to functions from the class M. Thus, H r H is the set of set of functions conjugate to functions from the class Hω , W ω ˜α functions conjugate to functions from the class W r Hω , etc. In particular, H is the class of functions conjugate to functions f ∈ H α . Note that Theorem 5.3 ˜ α , 0 < α < 1, then this function also belongs to the class implies that if f ∈ H KH α although the constant K is not necessarily equal to one in this case. In the ˜ ⊂ M is not true general case, as follows from Subsection 5.2, the imbedding M even if we use a homothet KM with an arbitrary coefficient K instead of M. 5.4. If f ∈ Jrr , then the Fourier series of this function has the form (4.6). In this case, if f˜ ∈ L(0, 2π), then, by virtue of equalities (5.7) and (5.3), we have π ∞ r+1 1 ˜ ]= S[f˜] = S[f ϕ(x − t) cos(kt − π)dt, ϕ ∈ L0 . πk r 2 k=1
(5.9)
−π
Hence, J˜rr is the set of functions the Fourier series of which have the form r (5.9). This means, in particular, that the classes W r N coincide with the classes of functions whose Fourier series have the form (5.9) with ϕ ∈ N. Therefore, if 0 ˜ rr = Dr ˜r df r we introduce an operator D r+1 that maps Jr = Jr+1 in L according df r r to relation (5.9), then the classes W r N = Wr+1 N can also be characterized as df
r r = fr+1 ∈ N. sets of functions f (·) for which Dr+1
Section 6
6.
Weyl–Nagy Classes
119
Weyl–Nagy Classes
6.1. One can conclude from the results in Subsections 4.3 and 5.4 that it is likely to be helpful to consider the sets Jβr of functions f (·) such that, for fixed r > 1 and β ∈ (−∞, ∞), ∞
a0 (f ) 1 + S[f ] = 2 πk r k=1
π ϕ(x − t) cos(kt − −π
βπ )dt 2
(6.1)
π ∞ rπ (β − r)π 1 a0 (f ) ϕ(x − t) cos(kt − + cos )dt = r 2 2 πk 2 k=1
−π
π ∞ r+1 (β − r)π 1 ϕ(x − t) cos(kt − π)dt, (6.2) + sin 2 πk r 2 k=1
−π
where ϕ ∈ L0 . Moreover, it is expedient to introduce an operator Dβr that acts from Jβr to L0 according to equality (6.1). It is clear that, for β = r + 2k, k ∈ Z, the set Jβr coincides with the set r Jr in Subsection 4.3; for β = r + 1 + 2k, functions that form the sets Jβr and r Jr+1 in Subsection 5.4 may differ only by constant terms. For other values of β, functions from the set Jβr are linear combinations of a pair of conjugate functions r , respectively. belonging to Jrr and Jr+1 The sets Jβr were first considered by Nagy. This is why we call the function ϕ(·) in decomposition (6.1) the Weyl–Nagy (r, β)-derivative; in what follows, it is sometimes denoted by fβr (·) so that fβr = Dβr f and it is easy to verify that S[fβr ]
=
∞ k=1
k −r (ak (f ) cos(kx +
βπ βπ ) + bk (f ) sin(kx + )). 2 2
(6.3)
6.2. The set Jβr can be completely described by using equality (6.3). Namely, this set consists of functions f (·) for which the series in (6.3) is the Fourier series of some summable function. To verify this it suffices to substitute decomposition (6.3) for ϕ(·) in equality (6.1) and perform elementary transformations. Thus, for any r > 0 and β ∈ (−∞, ∞), we have Jβr = {f (·) : Dβr f = fβr (·) ∈ L0 }.
(6.4)
120
Classes of Periodic Functions
Chapter 3
As in Subsection 4.4, if the series in (6.1) is convergent, we take its sum as a function f (·) regarded as an element of the set Jβr . 6.3. The classes of Weyl–Nagy differentiable functions are introduced in the already familiar way. If f ∈ Jβr and fβr ∈ N, then we say that f (·) belongs to the class Jβr N. As in Subsection 4.5, if N is a specific class of functions, we set Jβr N = Wβr N. It is clear that Wβr N = Wrr N for β = r + 2k, k ∈ Z, and Wβr N = r N=W r Wr+1 r N for β = r + 1 + 2k.
7.
Classes Lψ βN
7.1. By considering successively more and more general operators of differentiation (Dr , Drr , and then Dβr ), we can classify wider and wider classes of functions. Furthermore, there is a succession in the sense that we have Wrr N = W r N for r ∈ N and Wβr N = Wrr N for β = r. Moreover, there appears a possibility to indicate, for a given function f (·), a narrower set in which this function is contained; this, in turn, allows one to use its distinctive features more completely, e.g., for studying the problem of its approximation. For the same purpose, we consider a further generalization of the operation of differentiation. Formally, it is reduced to the replacement of the factor k −r in equalities (6.1) and (6.3) by a factor ψ(k), where ψ(k), k = 1, 2, . . . , generally speaking, is an arbitrary function of a natural variable. On the basis of this operation, we introduce classes of periodic functions which may coincide with the classes Wβr N (and, hence, with the classes Wrr N and W r N as well) for fixed values of their determining parameters and, at the same time, allow one to take into account the properties of functions that cannot be described in terms of known classes of functions. Let f ∈ L(0, 2π) and let S[f ] be the Fourier series of this function. Furthermore, let ψ(k) be an arbitrary function of a natural variable and let β be a fixed real number, β ∈ (−∞, ∞). Assume that the series ∞ k=1
1 βπ βπ (ak (f ) cos(kx + ) + bk (f ) sin(kx + )) ψ(k) 2 2
(7.1)
is the Fourier series of some function from L(0, 2π). We denote this function by fβψ (·) and call it the (ψ, β)-derivative of a function f (·). The set of functions satisfying this condition is denoted by Lψ β.
Classes Lψ βN
Section 7
121
If f ∈ Lψ β , then, by using Theorem 4.2 and performing elementary transformations, we obtain ∞
π
k=1
−π
a0 (f ) ψ(k) + 2 π
fβψ (x − t) cos(kt −
∞
βπ Ak (f ; x) = S[f ]. (7.2) )dt = 2 k=0
On the other hand, it is easy to prove that every function f (·) with the Fourier series of the form π ∞ βπ a0 (f ) ψ(k) ϕ(x − t) cos(kt − + )dt, (7.3) S[f ] = 2 π 2 k=1
−π
where ϕ ∈ L0 , belongs to Lψ β . For this purpose, it suffices to show that the Fourier series of the function ϕ(·) has the form (7.1). However, if equality (7.3) holds for S[f ], then, for any k = 1, 2, . . . , ak (f ) = ψ(k)(ak (ϕ) cos
βπ βπ − bk (ϕ) sin ), 2 2 (7.4)
βπ βπ bk (f ) = ψ(k)(ak (ϕ) sin + bk (ϕ) cos ). 2 2 Hence, ak (ϕ) =
1 βπ βπ (ak (f ) cos + bk (f ) sin ), ψ(k) 2 2
(7.5) 1 βπ βπ bk (ϕ) = (bk (f ) cos − ak (f ) sin ). ψ(k) 2 2 By comparing the relations obtained with expression (7.1), we can conclude that the Fourier series of a function ϕ(·) is indeed determined by this expression. ¯ψ Thus, the set Lψ β coincides with the set Lβ of functions from L(0, 2π) whose Fourier series have the form (7.3) with ϕ ∈ L0 . In this connection, if the Fourier series of a function f ∈ L(0, 2π) has the form (7.3) and ϕ ∈ L0 , then it is natural to call the function ϕ(·) the (ψ, β)- derivative of f. In this case, ψ 0 the operator that maps Lψ β in L according to relation (7.3) is denoted by Dβ so that Dβψ f = fβψ . ψ 7.2. It is clear that if ψ(k) = k −r , r > 0, then Lψ β = Jβ . If the series
in (7.2) is convergent and we take its sum as an element of the set Lψ β , then, for r β = r ∈ N, we have Lψ β =A .
122
Classes of Periodic Functions
Chapter 3
ψ 7.3. Let N be a subset of functions from L(0, 2π). If f ∈ Lψ β and fβ ∈
N, then we say that the function f (·) belongs to the class Lψ β N. Thus, every function ψ, every number β ∈ R, and every set N are associated with a class ψ −r r Lψ β N. In particular, for ψ(k) = k , we have Lβ N = Wβ N. 7.4. The function f (·) is called a convolution of two functions h(·) and g(·) from L(0, 2π) if it can be represented in the form 1 f (x) = π
π h(x − t)g(t)dt, −π
which is symbolically denoted by f = h ∗ g. In this case, the function g(t) is called the kernel of a convolution. First, let us verify that the function f (x) exists for almost all x. The general case can easily be reduced to the case where functions h(·) and g(·) are nonnegative. However, in this case, the function h(x−t)g(t), as a product of measurable functions, is measurable on the plane (x, t); moreover, since it is nonnegative, the order of integration makes no matter. Therefore, π −π
1 f (x)dx = π
π π ( h(x − t)g(t)dt)dx
−π −π
1 = π
π
−π
π g(t)( −π
1 h(x − t)dx)dt = π
π
−π
π g(t)dt
h(t)dt.
(7.6)
−π
This implies that f ∈ L(−π, π) and, hence, this function is finite for all x ∈ (−π, π). The function f (x) is obviously periodic. Let us determine its Fourier coefficients under the assumption that ∞
a0 (ak cos kx + bk sin kx), S[h] = + 2
(7.7)
k=1 ∞
a (ak cos kx + bk sin kx). S[g] = 0 + 2 k=1
(7.7 )
Classes Lψ βN
Section 7
123
It follows from (7.6) that the product h(x − t)g(t) is summable in the square −π ≤ x, t ≤ π. Therefore, by changing the order of integration, we get 1 ak (f ) = 2 π 1 = 2 π
π π h(x − t)g(t) cos kxdtdx −π −π
π
π g(t)
−π
h(x) cos k(x + t)dxdt = ak ak − bk · bk , k = 0, 1, . . . .
−π
Similarly, we can find that bk (f ) = ak bk + ak bk , k = 1, 2, . . . . Thus, the following theorem is true: Theorem 7.1. If h ∈ L(0, 2π) and g ∈ L(0, 2π), then the convolution f = h ∗ g of these functions also belongs to L(0, 2π). If, in this case, equalities (7.7) and (7.7 ) hold, then ∞
S[f ] =
a0 a0 ((ak ak − bk bk ) cos kx + (ak bk + ak bk ) sin kx). + 2
(7.8)
k=1
7.5. Consider a function ψ(k), k ∈ N, and a number β ∈ R and assume that the series ∞ βπ ψ(k) cos(kx − ) (7.9) 2 k=1
is the Fourier series of a function Dψ,β (x) summable on (0, 2π). Consider a convolution π 1 f (x) = ϕ(x − t)Dψ,β (t)dt, (7.10) π −π
where ϕ(·) is a function from S[f ] =
L0 .
In view of equalities (7.8) and (7.4), we get
π ∞ ψ(k) k=1
π
−π
ϕ(x − t) cos(kt −
βπ )dt. 2
(7.11)
By comparing equalities (7.3) and (7.11), we establish the following statement: Proposition 7.1. If series (7.9) is the Fourier series of a function Dψ,β ∈ L(0, 2π), then elements of the set Lψ β differ only by a free term from functions representable by convolution (7.10), in which ϕ(·) coincides with fβψ (·) almost everywhere.
124
Classes of Periodic Functions
Chapter 3
7.6. The representation of functions in the form (7.10) is often preferable to equalities of the form (7.3). Moreover, in problems of the theory of approximation, the presence of a free term does not play a principal role. Indeed, if we succeed in approximating a function f (x) by a function F (f, x), then F (f, x) − a0 (f )/2 would approximate the function f (x) − a0 (f )/2. Therefore, it is important to know in what cases the conditions of Proposition 7.1 are satisfied, or, in other words, under what conditions series (7.9) is the Fourier series of a function from L(0, 2π). This is one of central problems in the theory of Fourier series. Many deep results were obtained in this field, a part of which is presented in manuals on trigonometric series, e.g., in the books of Bari [1] and Zygmund [5, 6]. Some general results in this direction follow from Chapter 1. We restrict ourselves to the formulation of several facts necessary for what follows. Theorem 7.2. Let a function ψ(k), k ∈ N, be such that lim ψ(k) = 0,
(7.12)
Δ2 ψ(k) = ψ(k − 1) − 2ψ(k) + ψ(k + 1) ≥ 0.
(7.13)
k→∞
Then the series
∞
ψ(k) cos kx
(7.14)
k=1
converges everywhere except, probably, the point x = 0 to a function f ∈ L(0, 2π) and is the Fourier series of this function. Condition (7.13) is essential because one can construct a series of the form (7.14) with coefficients tending to zero monotonically such that its sum does not belong to L(0, 2π). Theorem 7.3. Let ψ(k), k ∈ N, tend to zero monotonically as k → ∞. Then the sum g(x) of the series ∞
ψ(k) sin kx
(7.15)
k=1
is integrable if and only if
∞ ψ(k) k=1
k
< ∞.
(7.16)
If this condition is satisfied, series (7.15) is the Fourier series of the function g(x) and series (7.14) is the Fourier series of some function f ∈ L(0, 2π).
Classes Lψ βN
Section 7
125
7.7. Denote the set of pairs of functions (ψ, β) for which series (7.9) is the Fourier series of some function from L(0, 2π) by F0 and the set of functions ψ(k) satisfying condition (7.16) and tending to zero monotonically as k → ∞ by F1 . If ψ ∈ F1 , then series (7.9), as a linear combination of series (7.14) and (7.15), is the Fourier series of some function from L(0, 2π), i.e., (ψ, β) ∈ F0 for any ψ ∈ F1 and β ∈ R. In view of Proposition 7.1, this yields the following assertion: Proposition 7.2. Let ψ ∈ F1 . Then, for any β ∈ R, elements f (·) of the set Lψ β can be represented as a0 (f ) 1 + f (x) = 2 π
π ϕ(x − t)Dψ,β (t)dt,
(7.17)
−π
where ϕ ∈ L0 , ϕ(·) coincides with fβψ (·) almost everywhere, and the sign of equality in (7.17) means equality of two functions from L(0, 2π), i.e., equality for almost all x. The function ψ(k) = k −r , k ∈ N, belongs to F1 for any r > 0. Therefore, functions from the sets Jβr can be represented in the form (7.17), i.e., a0 (f ) 1 f (x) = + 2 π where Dβr (t) =
π ϕ(x − t)Dβr (t)dt, ϕ ∈ L0 ,
(7.18)
−π
∞
k −r cos(kt − βπ/2).
(7.19)
k=1
For β = r + 1 + 2k, k ∈ Z, this relation gives a representation of functions from J˜rr (see Subsection 6.1) and, for β = r + 2k, it gives a representation of functions from Jrr . If, in addition, r are natural numbers, then equality (7.18) gives a representation of functions from the sets Ar and A˜r , respectively. 7.8. If we consider the statements of Propositions 7.1 and 7.2 in view of the definition of classes Lψ β N, we can find that, for (ψ, β) ∈ F0 (ψ ∈ F1 ), these classes are the classes of convolutions of functions ϕ ∈ L0 (or ϕ ∈ L(0, 2π) ) with kernels Dψ,β (·). In particular, the classes Wβr N are the classes of convolutions with kernels Dβr (·). Note that, for β = r and β = r + 1, the functions Dβr (·) are sometimes called Bernoulli kernels (or Bernoulli functions).
126
8.
Classes of Periodic Functions
Chapter 3
Classes Cβψ N ψ 8.1. Denote the subset of continuous functions f ∈ Lψ β by Cβ and the class
of functions f ∈ Cβψ such that fβψ ∈ N by Cβψ N. To establish conditions under which the classes Cβψ N are classes of convolutions, we need the following additional information about convolutions: Proposition 8.1. If h ∈ Lp , 1 < p < ∞, and g ∈ Lp (1/p + 1/p = 1), then convolution (7.6) is continuous on the entire axis and f C ≤
1 hp gp . π
(8.1)
Proof. The proof of this statement is based on the H¨older inequality: If h ∈ Lp , 1 ≤ p ≤ ∞, and g ∈ Lp , then π |h(t)g(t)|dt ≤ hp gp .
(8.2)
−π
By using this inequality, we find that, for any x and t, 1 |f (x + t) − f (x)| = | π
π (h(x + t − τ ) − h(x − τ ))g(τ )dτ |
−π
1 ≤ ( π
π |h(x + t − τ ) − h(x − τ )|p dτ )1/p gp
−π
1 = ( π
π |h(t − τ ) − h(τ )|p dτ )1/p gp .
−π
In view of Proposition 3.1, this implies that f (x) is continuous for all x. Inequality (8.1) also follows from (8.2) because the norm in the space Lp does not depend on a shift of an argument or a change of its sign. Proposition 8.2. If at least one of functions h(·) and g(·) belongs to the space M = L∞ , then convolution (7.6) is continuous; moreover, f C ≤
1 hM g1 if h ∈ M, π
(8.3)
Classes Cβψ N
Section 8 and
1 h1 gM if g ∈ M. π Indeed, assume, e.g., that h ∈ M. Then f C ≤
1 |f (x + t) − f (x)| ≤ π
127
(8.3 )
π |h(τ )||g(x + t − τ ) − g(x − τ )|dτ −π
1 ≤ hM π
π |g(t − τ ) − g(τ )|dτ −π
To prove the continuity of the function f (x), it remains to use Proposition 3.1. Inequality (8.3) is obvious. The case of g ∈ M can be examined similarly. By combining Propositions 8.1, 8.2, and 7.1 and using the completeness of a trigonometric system in the space C, we establish the following statement: Proposition 8.3. If (ψ, β) ∈ F0 , Dψ,β ∈ Lp , 1 ≤ p ≤ ∞, and N ⊂ Lp , 1/p+1/p = 1, then the set Cβψ N consists of functions which can be represented by the equality a0 (f ) 1 f (x) = + 2 π
π
fβψ (x − t)Dψ,β (t)dt
−π
at any point x ∈ R. In particular, if N ⊂ M, then this is true for any (ψ, β) ∈ F0 . One can easily conclude from Proposition 8.3, for example, that the classes Wβr N consist of continuous functions if r is an arbitrary nonnegative number and N ⊂ M or r > 1 and N is an arbitrary set from L(0, 2π). 8.2. Consider the sets Cβψ in the case where the function ψ(k) is chosen so that it decreases to zero faster than any power of k, i.e., lim k r ψ(k) = 0 ∀r ∈ R.
k→∞
(8.4)
Then series (7.2) can be differentiated arbitrarily many times and, as a result, we obtain uniformly convergent series. This means that, under condition (8.4), the sets Cβψ and, hence, the classes Cβψ N consists of infinitely differentiable functions.
128
Classes of Periodic Functions
Chapter 3
The functions ψ(k) = ψα,r (k) = exp(−αk r ) with arbitrary positive α and r can serve as an example of a function for which (8.4) is satisfied. 8.3. The operators Dβψ also enable us to classify the sets A2π of 2π-periodic functions analytic on the real axis. If f ∈ A2π , then we can choose the layer −a ≤ y ≤ b ( a > 0, b > 0 ) in which the function f (z) = f (x + iy) is regular. There is a close connection between numbers a and b and Fourier coefficients of such function. This connection is established by the following statement: Theorem 8.1. Let f (z) be an analytic 2π-periodic function regular in a closed layer −c ≤ y ≤ d ( c > 0, d > 0 ) and let ∞
ck eikx
(8.5)
k=−∞
be the Fourier series of the function f (x) in the complex form, i.e., c0 = ck =
a0 (f ) , 2
ak (f ) − ibk (f ) ak (f ) + ibk (f ) , c−k = , k = 1, 2, . . . . 2 2
(8.6)
Then there exists a constant K independent of k and such that |c−k | ≤ Ke−kd , |ck | ≤ Ke−kc , k = 0, 1, . . . .
(8.7)
On the other hand, if conditions (8.7) are satisfied for a function f ∈ L(0, 2π) with the Fourier series (8.5), then the series ∞
ck eikz
(8.8)
k=−∞
converges uniformly and absolutely inside the layer −c < y < d and represents a 2π-periodic regular function therein. Proof. The proof of the second part of Theorem 8.1 is obvious. In order to prove its first part, we integrate the function f (z)eikz along the boundary of the
Classes Cβψ N
Section 8
129
rectangle with vertices at the points (0, 0), (2π, 0), (2π, d), and (0, d). By taking into account the periodicity of this function and using the Cauchy theorem, we get 2π ikx
f (x)e
−kd
2π f (x + id)eikx dx.
dx = e
0
(8.9)
0
However,
2π f (x)eikx dx = 2πc−k .
(8.10)
0
Consequently, e−kd |c−k | ≤ 2π
2π
|f (x + id)|dx ≤ Ke−kd .
0
The inequalities for |ck | can be obtained similarly. Corollary 8.1. The values a and b that determine the layer of regularity of a function f (z) can be obtained from the relations a = lim inf ln |ck |−1/k , b = lim inf ln |c−k |−1/k . k→∞
k→∞
(8.11)
Indeed, if (8.11) is satisfied, then, for any ε > 0 and all sufficiently large k, we have |c−k | < e−k(b−ε) , |ck | < e−k(a−ε) . By virtue of the second part of Theorem 8.1, this implies that f (z) is regular inside a layer −(a − ε) < y < (b − ε), and since ε is arbitrary, f (z) is regular in the layer −a < y < b as well. It remains to show that this is the largest layer of regularity of f (z). If this were not true, then, by virtue of the first part of the theorem, we could set d > b in the inequalities |c−k | < Ke−kd , k = 0, 1, . . . , or c > a in the inequalities |ck | < Ke−kc , k = 0, 1 . . . . In the first case, the inequality lim inf ln |c−k |−1/k > b, k→∞
would hold and, in the second case, the inequality lim inf ln |ck |−1/k > a k→∞
130
Classes of Periodic Functions
Chapter 3
would be valid. However, both these inequalities contradict condition (8.11). 8.4. It follows from the statements proved above and equalities (8.6) and (7.4) that if the function ψ(k) satisfies the condition |ψ(k)| ≤ Ke−αk , k ∈ N, α > 0,
(8.12)
then the sets Cβψ consist of analytic functions which can be regularly extended into the layer |y| < α. Hence, in this case, the classes Cβψ N are the classes of functions f (x) which can be regularly extended into the layer |y| < α and whose (ψ, β)-derivatives belong to the class N. If the function ψ(k) is chosen so that lim inf ln |ψ(k)|−1/k = ∞, k→∞
(8.13)
then, by virtue of equalities (8.6) and (7.4) and Corollary 8.1, the sets Cβψ and, hence, the classes Cβψ N consist of functions regular on the whole complex plane, i.e., of entire functions. As an example of a function ψ(k) satisfying condition (8.12), we use again the function ψα,r (k) from Subsection 8.2 with α > 0 and r = 1. If r > 1, this function also satisfies condition (8.13), 1 r αk = ∞, k→∞ k
lim ln(exp(−αk r ))−1/k = lim
k→∞
ψ
i.e., in this case, the classes Cβ α,r N are classes of entire functions.
9.
Classes Lψ ¯N β ψ 9.1. In the definition of the sets Lψ β and classes Lβ N, the parameter β can
and classes take exactly one fixed value from R1 . Consider now the sets Lψ β¯ N which are determined by two functions of a natural variable, namely, by the Lψ β¯ df ¯ = βk , k ∈ N. The idea function ψ(k), as before, and the function β¯ = β(k) of definition of this classes is to replace the number β in (7.1) by numbers βk . Thus, a function f ∈ L(0, 2π) for which ∞
a0 (f ) (ak (f ) cos kx + bk (f ) sin kx), + S[f ] = 2 k=1
(9.1)
Classes Lψ N β¯
131
1 βk π βk π (ak (f ) cos(kx + ) + bk (f ) sin(kx + )) ψ(k) 2 2
(9.2)
Section 9 belongs to the set Lψ if the series β¯ ∞ k=1
is the Fourier series of some function fβ¯ψ from L(0, 2π). If f ∈ Lψ and fβ¯ψ ∈ N, we say that f (·) belongs to the class Lψ N. Clearly, β¯ β¯ ψ ψ = Lψ if βk = β for all k ∈ N, then Lψ β and, hence, Lβ¯ N = Lβ N. β¯
9.2. Many facts presented in Sections 7 and 8 for βk = β can be almost automatically extended to the general case with replacing β by β¯ or β¯k in the notation. Here, we only present several facts necessary for what follows. ¯ ψ¯ of functions from Proposition 9.1. The set Lψ coincides with the set L β¯ β L(0, 2π) whose Fourier series have the form ∞
a0 (f ) ψ(k) S[f ] = + 2 π k=1
π ϕ(x − t) cos(kt − −π
βk π )dt, 2
(9.3)
where ϕ ∈ L0 . , one can easily obtain an analog of relation (7.2): Indeed, for f ∈ Lψ β¯ ∞
π
k=1
−π
a0 (f ) ψ(k) + 2 π
=
∞
fβ¯ψ (x − t) cos(kt − βk π/2)dt
Ak (f ; x) = S[f ].
(9.4)
k=0
¯ ψ¯ . At the same time, if equality (9.3) holds for f (·), then ⊂L Hence, Lψ β¯ β ak (f ) = ψ(k)(ak (ϕ) cos βk π/2 − bk (ϕ) sin βk π/2), (9.5) bk (f ) = ψ(k)(ak (ϕ) sin βk π/2 + bk (ϕ) cos βk π/2).
132
Classes of Periodic Functions
Chapter 3
Therefore, ak (ϕ) =
1 (ak (f ) cos βk π/2 + bk (f ) sin βk π/2), ψ(k) (9.6)
1 bk (ϕ) = (bk (f ) cos βk π/2 − ak (f ) sin βk π/2). ψ(k) This implies that the series S[ϕ] has the form (9.2) and, hence, f ∈ Lψ , i.e., β¯ ψ ψ ¯ ¯. Lβ¯ = L β ¯ If f (·) satisfies equality (9.3), then the function ϕ(·) is called a (ψ, β)in L0 according derivative of the function f (·) and the operator that maps Lψ β¯ to formula (9.3) is denoted by Dβψ¯ so that Dβψ¯ f = fβ¯ψ . 9.3. In the case where the series ∞
ψ(k) cos(kx − βk π/2)
(9.7)
k=1
is the Fourier series of a function Dψ,β¯(x), by virtue of Theorem 7.1 and equalities (9.5), we can easily conclude that the following representation is valid for at almost all points x : elements of the set Lψ β¯ a0 (f ) 1 f (x) = + 2 π
π ϕ(x − t)Dψ,β¯(t)dt,
(9.8)
−π
where ϕ(·) is a function from L0 which coincides with a function fβ¯ψ (·) almost everywhere. It has been established above that, by virtue of Theorems 7.2 and 7.3, the fact that a function ψ(k) belongs to the set F1 guarantees the validity of equality (7.17) for any f ∈ Lψ β because Dψ,β (·) is a linear combination of series (7.14) and (7.15). A function Dψ,β¯(·) has the form Dψ,β¯(x) =
∞ k=1
ψ(k) cos βk π/2 cos kx +
∞
ψ(k) sin βk π/2 sin kx
(9.9)
k=1
In order to apply Theorems 7.2 and 7.3, we must now require that the functions df df ψ1 (k) = ψ(k) cos βk π/2 and ψ2 (k) = ψ(k) sin βk π/2 should belong to the set F1 .
¯ Order Relation for (ψ, β)-Derivatives
Section 10
133
9.4. Denote the subset of continuous functions from Lψ by Cβψ¯ and the β¯ class of functions f ∈ Cβψ¯ for which fβ¯ψ ∈ N by Cβψ¯ N. In the case where series (9.7) is the Fourier series of a summable function Dψ,β¯(x), we say that the ¯ belongs to the set F1,1 . In this case, clearly, Proposition 8.3 can be pair (ψ, β) reformulated as follows: ¯ ∈ F1,1 , D ¯ ∈ Lp , 1 ≤ p ≤ ∞, and N ⊂ Lp , Proposition 9.2. If (ψ, β) ψ,β 1/p + 1/p = 1, then the set Cβψ¯ N consists of functions that can be represented at any point x ∈ R by the equality a0 (f ) 1 f (x) = + 2 π
π
fβ¯ψ (x − t)Dψ,β¯(t)dt.
−π
¯ ∈ F1,1 . In particular, if N ⊂ M, then this is valid for all (ψ, β) 9.5. By virtue of equalities (9.5), condition (8.4) guarantees that functions f ∈ Cβψ¯ N are infinitely differentiable for such ψ. If inequalities (8.12) hold, then Cβψ¯ N are classes of analytic functions that can be extended regularly into the layer |y| < α; under condition (8.13), functions f ∈ Cβψ¯ N are regular on the entire complex plain.
¯ Order Relation for (ψ, β)-Derivatives
10.
10.1. If a function f (·) is r times differentiable (r ∈ N ), then it is absolutely continuous and has absolutely continuous derivatives f (ri ) (·) of all lower orders ri < r. Therefore, it is also natural to indicate analogs of “lower” derivatives for functions from sets Lψ . For this purpose, we give the following definiβ¯ tion: Assume that ψ1 = ψ1 (k), β¯1 = β1 (k), ψ2 = ψ2 (k), and β¯2 = β2 (k), k ∈ N, are arbitrary sequences of real numbers. The pair (ψ1 , β¯1 ) L-precedes L
2 1 ⊆ Lψ . In this case, we write (ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ). If the pair (ψ2 , β¯2 ) if Lψ β¯ β¯ 2
Lβψ¯2 2
⊂
1 Lψ , β¯1
1
L then we write (ψ1 , β¯1 ) < (ψ2 , β¯2 ).
Thus, larger sets correspond to “lower” pairs (an operator Dβψ¯ with “lower” indices has a larger domain of definition).
134
Classes of Periodic Functions
Chapter 3 L
2 If a function f (·) belongs to Lψ and (ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ), then it β¯ 2
has a derivative
fβψ¯1 1
belonging to
ψ /ψ Lβ¯2−β¯1 , 2 1
df
where ψ2 /ψ1 = (ψ2 (k)/ψ1 (k)),
df β¯2 − β¯1 = (β2 (k) − β1 (k)), k ∈ N ; furthermore, ψ /ψ
S[(fβ¯ψ1 )β¯2−β¯1 ] = S[fβ¯ψ2 ]. 1
2
1
(10.1)
2
1 Indeed, the imbedding Lβψ¯2 ⊆ Lψ implies that the derivative fβψ¯1 (·) exists and β¯1 2 1 the series
∞ k=1
1 (ak (f ) cos(kx+βi (k)π/2)+bk (f ) sin(kx+βi (k)π/2)), i = 1, 2 (10.2) ψi (k)
are the Fourier series of the function fβψ¯1 (x) and fβψ¯2 (x), respectively. For i = 1 2 1, we have S[fβ¯ψ1 ] = 1
∞
(ak (fβ¯ψ1 ) cos kx + bk (fβ¯ψ1 ) sin kx), 1
k=1
1
(10.3)
where 1 (ak (f ) cos β1 (k)π/2 + bk (f ) sin β1 (k)π/2), ψ1 (k)
ak (fβ¯1 )ψ1 = ψ1
bk (fβ¯1 )
1 = (bk (f ) cos β1 (k)π/2 − ak (f ) sin β1 (k)π/2). ψ1 (k)
(10.4)
Consider the series ∞ ψ1 (k) k=1
ψ2 (k)
(ak (fβ¯ψ1 ) cos(kx + (β2 (k) − β1 (k))π/2) 1
+ bk (fβ¯ψ1 ) sin(kx + (β2 (k) − β1 (k))π/2)). (10.5) 1
By using equalities (10.4), we can check that this series coincides with S[fβψ¯2 ] 2 and, at the same time, it is the Fourier series of the (ψ2 /ψ1 , β¯2 − β¯1 )- derivative of the function fβψ¯1 . 1
L
It follows from (10.1), in particular, that if (ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ), then ψ /ψ
fβ¯ψ1 ∈ Lβ¯2−β¯1 N 1
2
1
2 ∀f ∈ Lψ N, N ⊂ L0 . β¯ 2
(10.6)
¯ Order Relation for (ψ, β)-Derivatives
Section 10
135
¯ derivatives. It is clear that In this way, we establish an order relation for (ψ, β)the pair for which ψ(k) ≡ 1 and β(k) ≡ 0 has the “lowest” order because Lψ = L in this case. β¯ 10.2. In examining the sets Cβψ¯ N, we find that the required continuity of “lower” derivatives is closely connected with the properties of the set containing ¯ (ψ, β)-derivatives. In this connection, we introduce one more notion. As before, let ψ1 (k), β1 (k), ψ2 (k), and β2 (k) be arbitrary sequences of real numbers. We say that the pair (ψ1 , β¯1 ) CN-precedes the pair (ψ2 , β¯2 ), CN
(ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ) if the inclusion f ∈ Cβψ¯2 N yields fβψ¯1 ∈ C. 2
CN If f ∈ Cβψ¯2 N and (ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ), then, 2 automatically, fβψ¯1 ∈ L0 ). Hence, equality (10.1) 1
1
by definition, fβψ¯1 ∈ C (and, 1
is also valid in this case. This
yields the following analog of relation (10.6): ψ /ψ
fβ¯ψ1 ∈ Cβ22−β11 N 1
∀f ∈ Cβψ¯ 2 N, N ⊂ L0 . 2
(10.7)
10.3. It is clear that there exist pairs (ψ2 , β¯2 ) and (ψ1 , β¯1 ) for which the L
CN
order relations ≤ or ≤ are meaningless. For example, let ψ1 (k) ≡ ψ2 (k) ≡ k −2 , β1 (k) ≡ 0, and β2 (k) ≡ 1. By virtue of Theorems 7.2 and 7.3, the function ∞ cos kx g(x) = k 2 ln k k=1
has a (ψ1 , β¯1 )-derivative because it is obviously continuous. Hence, it belongs to Lβψ¯1 and does not belong to Lβψ¯2 . Similarly, we conclude that the function 1
2
∞ sin kx h(x) = k 2 ln k k=1
belongs to
2 Lψ β¯2
and does not belong to Lβψ¯1 . This means that neither the relation 1
L
(ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ) nor the inverse one holds. This fact could be a shortage if our aim were ordering pairs of sequences. However, in the case under consideration, it only illustrates the variety in the sets Lψ . β¯ 10.4. After all, we can give fairly simple conditions that guarantee Lpreceding and CN-preceding of such pairs.
136
Classes of Periodic Functions
Chapter 3
Theorem 10.1. Let ψi (k) and βi (k), i = 1, 2, k ∈ N, be arbitrary sequences of real numbers. If the pair (ψ2 /ψ1 , β¯2 − β¯1 ) belongs to the set F1,1 , i.e., the series ∞ ψ2 (k) (10.8) cos(kx + (β2 (k) − β1 (k))π/2) ψ1 (k) k=1
is the Fourier series of some summable function Dψ,β¯(x), ψ(k) = ψ2 (k)/ψ1 (k), β¯ = β2 (k) − β1 (k), k ∈ N, then L
(ψ1 , β¯1 ) ≤(ψ2 , β¯2 ).
(10.9)
If, in addition, N ⊂ M, then CN
(10.9 )
(ψ1 , β¯1 ) ≤ (ψ2 , β¯2 ).
2 ⊆ Lβψ¯1 , i.e., that, for Proof. To prove relation (10.9) we must show that Lψ β¯ 2
all f ∈ Lβψ¯2 , the series
1
2
∞ k=1
1 (ak (f ) cos(kx + β1 (k)π/2) + bk (f ) sin(kx − β1 (k)π/2)) (10.10) ψ1 (k)
is the Fourier series of a summable function fβψ¯1 (x). For this purpose, we con1 sider the function 1 J (x) = π
π
fβ¯ψ2 (x − t)Dψ,β¯(t)dt. 2
(10.11)
−π
Since fβψ¯2 (·) and Dψ,β¯(·) are summable, the function J (x) is also summable 2 by virtue of Theorem 7.1. By writing the Fourier series for this function and taking equalities (10.4) into account, we find that this series coincides with series (10.10). This proves relation (10.9). If f ∈ Cβψ¯2 N and N ⊂ M, then fβψ¯2 is essentially bounded. Hence, accord2 2 ing to Proposition 8.2, J (x) is continuous. In this case, since S[J ] coincides with series (10.10), expression (10.10) is the Fourier series of a continuous function. This proves relation (10.9 ). 10.5. If ψ2 (k)/ψ1 (k) ≡ k −r , r > 0, k ∈ N, and β1 (k) and β2 (k) take df
fixed values β1 (k) ≡ β1 and β2 (k) ≡ β2 for any k ∈ N so that β2 − β1 = γ,
¯ ψ-Integrals of Periodic Functions
Section 11
137
then, according to Subsection 7.7, series (10.8) is always the Fourier series of a summable function Dγr (·). This means that, in this case, relations (10.9) and (10.9 ) are always valid. In particular, for ψ1 (k) = k −r1 and ψ2 (k) = k −r2 , r1 , r2 > 0, Theorem 10.1 implies that if r2 > r1 , then the pair (ψ1 , β1 ) Lprecedes and CN-precedes ( N ⊂ M ) the pair (ψ2 , β2 ) for any β1 and β2 . Note that the examples in Subsection 10.3 show that, for r1 = r2 , these facts do not take place in the general case.
11.
¯ ψ-Integrals of Periodic Functions
¯ 11.1. The function ϕ in equality (9.3) is called (ψ, β)-derivative of the ¯ function f. Hence, it is natural to call the function f (ψ, β)-integral of ϕ. Then ¯ the set Lψ is the set of (ψ, β)-integrals of all functions ϕ ∈ L0 . Using this β¯ notation, we give following definitions: Definition 11.1. Let L denote the space of integrable 2π-periodic functions f ∈ L, and let ∞
∞
k=1
k=0
a0 (ak cos kx + bk sin kx) ≡ Ak (f ; x) S[f ] = + 2
(11.1)
be the Fourier series of a function f. Further, let ψ¯ = (ψ1 , ψ2 ) be a pair of arbitrary fixed systems of numbers ψ1 (k) and ψ2 (k), k = 1, 2, . . . . Consider the following series: A0 +
∞
(ψ1 (k)Ak (f ; x) + ψ2 (k)A˜k (f ; x)),
(11.2)
k=1
where A0 is a certain number and A˜k (f ; x) = ak sin kx − bk cos kx. If series ¯ is the Fourier series of a certain (11.2), for a given function f (·) and a pair ψ, function F ∈ L, then we say that F is the integral of the function f generated ¯ or simply, the ψ-integral ¯ by the pair ψ, of the function f, and denote this as ¯ ψ follows: F (·) = J (f ; ·). ¯ ¯ We denote the set of ψ-integrals of all functions f ∈ L by Lψ . If N is a ¯ ¯ subset of L, then Lψ N denotes the set of ψ-integrals of functions f ∈ N.
Definition 11.2. Let f ∈ L, let (11.1) be its Fourier series, and let a pair ¯ ψ = (ψ1 , ψ2 ) satisfy the following condition: ψ¯2 (k) = ψ12 (k) + ψ22 (k) = 0, k ∈ N.
(11.3)
138
Classes of Periodic Functions
If the series
Chapter 3
∞ ψ1 (k) ψ2 (k) ˜ A A (f ; x) − (f ; x) k k ψ¯2 (k) ψ¯2 (k)
(11.4)
k=1
¯ is the Fourier series of some function ϕ ∈ L, then we say that ϕ is the ψ¯ ¯ ψ ψ derivative of the function f and write ϕ(·) = D (f ; ·) = f (·). We denote the ¯ ¯ ψ¯ . If f ∈ L ¯ ψ¯ and subset of functions f ∈ L for which ψ-derivatives exist by L ¯ ¯ ψ¯ N. f ψ ∈ N, where N ⊂ L, then we set f ∈ L ¯ Remark 11.1. It is clear from the definition of ψ-integral that if a function ¯ has a ψ-integral F (·), any function F1 (·) that differs from F (·) on any set of ¯ ¯ measure zero is also its ψ-integral. On the other hand, any ψ-integral F (·) of a ¯ given function f (·) is a ψ-integral of any function f1 (·) that differs from f (·) on an arbitrary set of measure zero. This ambiguity is not essential for the present investigation and can be removed by the standard method, namely, by the identification of functions that are equivalent with respect to the Lebesgue measure. ¯ This remark obviously remains true for ψ-derivatives. In view of this, in the case of convergence of series (11.2) and/or (11.4) to summable functions, we always ¯ ¯ regard the functions F (·) = J ψ (f ; ·) and/or ϕ(·) = Dψ (f ; ·), respectively, as the sums of the corresponding series. ¯ ¯ 11.2. The relationship between ψ-integrals and ψ-derivatives is given by the following statement: Proposition 11.1. If f ∈ L, series (11.1) is its Fourier series, and condi¯ ¯ tion (11.3) is satisfied, then the function J ψ (f ; x) has a ψ-derivative and the following equality is true: ¯
¯
Dψ (J ψ (f ; ·)) = f (·) − ¯
a0 . 2
(11.5) ¯
¯ ψ and series (11.1) is its Fourier series, then the function Dψ (f ; x) has If f ∈ L ¯ a ψ-integral and ¯ ¯ J ψ (Dψ (f ; ·)) = f (·) + A0 , (11.6) where A0 is a certain constant. This proposition is proved by simple verification in view of the fact that if U is the operator of trigonometric conjugation, then U U (Ak (f ; x)) = −Ak (f ; x).
¯ ψ-Integrals of Periodic Functions
Section 11
139
Remark 11.2. In view of equality (11.5), it is natural to say that the func¯ ¯ tion f (x) − a0 /2 is the ψ-derivative of a function F (x) = J ψ (f ; x) regardless of whether condition (11.3) is satisfied or not. Thus, we always assume that df ¯ ¯ ¯ Dψ (J ψ (f ; x)) = f (x) − a0 /2, i.e., F ψ (·) = f (·) − a0 /2. Relations (11.5) and (11.6) yield the following statement: Proposition 11.2. For any pair ψ¯ satisfying condition (11.3) the following equality holds: ¯ ψ¯ = Lψ¯ . L (11.7) ¯ integrals of all funcThus, if condition (11.3) is satisfied, then the set of ψ¯ tions f ∈ L coincides with the set of functions having ψ-derivatives. Hence, in ¯ order to verify that the given function f ∈ L belongs to Lψ , it suffices to show ¯ψ. that f ∈ L 11.3. If we represent series (11.1) in the complex form, then series (11.2) can be rewritten as a0 μk ck eikx , ck = (ak − ibk )/2, c−k = (ak + ibk )/2, (11.8) + 2 |k|≥1
where μk =
ψ1 (k) − iψ2 (k),
k ≥ 1,
ψ1 (|k|) + iψ2 (|k|), k ≤ −1,
and series (11.4) can be rewritten in the form λk ck eikx , |k|≥1
where λk =
¯ (ψ1 (k) + iψ2 (k))/ψ(k),
k ≥ 1,
¯ (ψ1 (|k|) − iψ2 (|k|))/ψ(|k|), k ≤ −1, ¯ ψ(k) = (ψ12 (k) + ψ22 (k))1/2 . ¯
¯
Thus, the operators J ψ and Dψ are multipliers, and μk λk = 1, |k| ≥ 1.
140
Classes of Periodic Functions
Chapter 3
11.4. Definition 11.3. If a pair ψ¯ = (ψ1 , ψ2 ) is such that the series ∞
(ψ1 (k) cos kx + ψ2 (k) sin kx) =
1 μk eikx 2
(11.9)
|k|≥1
k=1
is the Fourier series of a certain function Ψ(x), then we write ψ¯ ∈ L. ¯ Proposition 11.3. If ψ¯ ∈ L, then, for every function f ∈ L, its ψ-integral exists and, almost everywhere, 1 J (f ; x) = A0 + π ψ¯
π f (x − t)Ψ(t)dt.
(11.10)
−π
¯
Thus, the elements of the set Lψ are functions representable by A0 + f ∗ Ψ, f ∈ L. In particular, the following statement is true: ¯ Proposition 11.4. Suppose that ψ¯ ∈ L. Then, for any function f ∈ Lψ , the following equality is valid almost everywhere:
a0 1 f (x) = + 2 π
π
¯
f ψ (x − t)Ψ(t)dt = −π
a0 ¯ + (f ψ ∗ Ψ)(x), 2
(11.11)
where a0 is the free term of the Fourier series of a function f (·). Equality (11.10) is proved by simple verification, and equality (11.11) follows from (11.10) in view of Remark 11.2. ¯ ¯ 11.5. The notion of ψ-derivatives coincides with the notion of (ψ, β)derivatives assumed in Subsection 3.9 in the sense that the fact of the existence of one of such derivatives yields the existence of the other one with the corresponding values of the determining parameters. In order to prove this, it suffices to show by using relations (11.4) and (9.2) that the system ⎧ ψ1 (k) 1 π ⎪ ⎪ = cos βk , ⎪ ⎪ 2 ¯ ψ(k) 2 ⎨ ψ (k) ψ¯2 (k) = 0, ψ(k) = 0, (11.12) ⎪ ⎪ 1 (k) π ψ ⎪ 2 ⎪ = sin βk , ⎩ ¯2 ψ(k) 2 ψ (k)
¯ ψ-Integrals of Periodic Functions
Section 11
141
is solvable with respect to ψ1 (k) and ψ2 (k) if the pair ψ(k), β(k) is given, and with respect to ψ(k) and β(k) if ψ1 (k) and ψ2 (k) are given. If ψ(k) and β(k) are given, we set π π ψ1 (k) = ψ(k) cos βk , ψ2 (k) = ψ(k) sin βk . 2 2
(11.13)
It is clear that such values satisfy system (11.12). If the pair ψ1 (k), ψ2 (k) is given, then the required values are determined by the equalities ¯ ψ(k) = ψ(k), cos βk
π ¯ = ψ1 (k)/ψ(k), 2
π ¯ = ψ2 (k)/ψ(k). 2 Thus, the following statement is true: sin βk
(11.14)
¯ ¯ Proposition 11.5. Any (ψ, β)-derivative of a function f ∈ L is also a ψderivative if the components ψ1 (k) and ψ2 (k) are chosen according to equali¯ ¯ ties (11.13). Moreover, any ψ-derivative is a (ψ, β)-derivative if the parameters ψ(k) and β(k) are determined by relations (11.14). In both cases, the following equalities hold: ¯ ψ¯ = Lψ¯ , L ¯ ψ¯ N = Lψ¯ N ∀N ⊂ L0 . L (11.15) β β where L0 = {ϕ ∈ L :
π
ϕ(t)dt = 0, i.e., ϕ⊥1}.
−π
¯ Note that relations (11.13) imply that a (ψ, β)-derivative is also a ψderivative if π ψ1 (k) = ψ(k) cos β , 2
π ψ2 (k) = ψ(k) sin β . 2
(11.13 )
(r)
The known rth (r > 0) Weyl derivative fr (·) of a function f (·) is a (ψ, β)derivative under the condition that ψ(k) = k −r and β = r. Consequently, by ¯ (r) virtue of (11.13 ), fr (·) coincides with f ψ (·) if we set π ψ1 (k) = k −r cos r , 2
π ψ2 (k) = k −r sin r . 2
11.6. If, in condition (11.3), we set ϕ¯ = (ϕ1 , ϕ2 ), where ϕ1 (k) = ψ1 (k)/ψ¯2 (k),
ϕ2 (k) = ψ2 (k)/ψ¯2 (k),
(11.16)
142
Classes of Periodic Functions
Chapter 3
then the values of ψ1 (k) and ψ2 (k) are determined by the equalities ¯ ψ1 (k) = ϕ1 (k)/Φ(k),
¯ ψ2 (k) = −ϕ2 (k)/Φ(k),
¯ 2 (k) = ϕ2 (k) + ϕ2 (k). Φ 1 2
(11.17)
In this case, for f ∈ L0 , series (11.4) has the form ∞
(ϕ1 (k)Ak (f ; x) + ϕ2 (k)A˜k (f ; x)),
(11.18)
k=1
and series (11.2) has the form ∞ ϕ1 (k) ϕ2 (k) ( ¯ 2 Ak (f ; x) − ¯ 2 A˜k (f ; x)). Φ (k) Φ (k)
(11.18 )
k=1
¯
This implies that if condition (11.3) is satisfied, then the integral J ψ (f ; ·) can be ¯ regarded on the set L0 as the derivative Dϕ¯ (f ; ·), and the derivative Dψ (f ; ·) can be regarded as the integral J ϕ¯ (f ; ·). In other words, generally speaking, it ¯ suffices to consider only one of these notions, e.g., the notion of ψ-integral, or to interchange the names of these notions. However, it turns out to be convenient to separate these notions, and the principal reason for this is the traditional conjecture that the properties of a function become “better” after its integration, and become “worse” after its differentiation. In view of this fact, in the present paper, we assume that ψ1 (k) and ψ2 (k) are infinitely small and, consequently, ϕ1 (k) and ϕ2 (k) in (11.16) are infinitely ¯ large sequences. Hence, as a rule, the fact of the existence of a ψ-integral for a ¯ function f ∈ L can easily be established. At the same time, the existence of a ψderivative of a given function imposes substantial requirements on this function: The faster the functions ψ1 (k) and ψ2 (k) decrease, the lower the probability for ¯ ¯ ψ¯ a given function to have a ψ-derivative or, which is the same, to hit the set L ¯ and, hence, according to Proposition 11.2, the set Lψ , as well. ¯ ¯ Different pairs ψ¯ and ψ¯ correspond to different sets Lψ and Lψ . One can use Subsection 3.10 and take into consideration Proposition 11.5 for establishing the relationship between such sets. ¯ 11.7 Do all functions f ∈ L have at least one ψ-derivative? The positive answer to this question is obvious if we do not require that lim ψ1 (k) = lim ψ2 (k) = 0.
k→∞
k→∞
(11.19)
¯ ψ-Integrals of Periodic Functions
Section 11
143 ¯
Indeed, if we set, e.g., ψ1 (k) = ψ2 (k) = 1∀k ∈ N, we get f ψ (·) = f (·). Therefore, it is interesting to consider the case where condition (11.19) is satisfied. In this case, the answer is also positive but nontrivial. This follows from Salem’s statement [1] (see, e.g., N. K. Bari [1, p.243]), for the formulation of which we need the following standard definitions: Definition 11.4. A sequence of real numbers λ = λ(k), k = 1, 2, . . . , is called convex (convex downwards) if Δ2 λ(k) = λ(k) − 2λ(k + 1) + λ(k + 2) ≥ 0.
(11.20)
If δ 2 λ(k) ≤ 0, then the sequence λ(k) is called concave (convex upwards). The set of convex downwards sequences λ(k) for which lim λ(k) = 0,
k→∞
(11.21)
is denoted by M. Proposition 11.6 (Salem[1]). Let f (·) be any function from the set C (or L ) and let ∞ a0 + S[f ] = (ak cos kx + bk sin kx) 2 k=1
be its Fourier series. Then one can always indicate a concave sequence λ = λ(k) such that its terms tend to infinity (λ(k) ↑ ∞) without decreasing and the series ∞
a0 λ(k)(ak cos kx + bk sin kx) λ(0) + 2 k=1
is the Fourier series of a continuous (or, respectively, summable) function F (·). We can assume that, in this statement, we always have λ(k) ≥ 1. Therefore, for a pair ψ¯ = (ψ1 , ψ2 ) with ψ1 (k) ≡ 1/λ(k) and ψ2 (k) ≡ 0, taking into account that ψ1 , ψ2 ∈ M and, for any function f ∈ L, according to (11.4) ¯
S[f ψ ] =
∞ k=1
1 Ak (f ; x), ψ1 (k)
we obtain the following statement from Proposition 11.6:
144
Classes of Periodic Functions
Chapter 3
¯ Proposition 11.7. Every function f ∈ C (or f ∈ L ) has at least one ψ¯ ψ ¯ derivative f (·) which belongs to C (or L ). In this case, the pair ψ = (ψ1 , ψ2 ) can be chosen so that ψ1 , ψ2 ∈ M. ¯ This implies that every function f ∈ C (or f ∈ L ) has an infinite set of ψderivatives, the determining components of which ψ1 and ψ2 belong to M, and the derivatives themselves are continuous (or summable, respectively). Moreover, as is well known, for ψ ∈ M, the series ∞
ψ(k) cos kt,
(11.22)
k=1
is always the Fourier series of a summable function Ψ(t). Then, by virtue of Proposition 11.3, we arrive at the following statement: Proposition 11.8. Every function f ∈ C (or f ∈ L ) is representable as the convolution π 1 ϕ(x − t)Ψ(t)dt, (11.23) f (x) = A0 + π −π
where ϕ ∈ C (or ϕ ∈ L ) and Ψ(t) is a function whose Fourier series has the form (11.22). In addition, ψ = ψ(k) belongs to M. Thus, the following equalities hold: ∪
¯
Lψ = L,
ψ1 ,ψ2 ∈M
¯
∪
¯
¯
C ψ = C, (C ψ = Lψ ∩ C)
ψ1 ,ψ2 ∈M
(11.24)
and, moreover, ¯
∪ Lψ∗ = L,
ψ∈M
¯
¯
¯
∪ C ψ∗ = C, (C ψ∗ = Lψ∗ ∩ C),
ψ∈M
(11.24 )
¯
where Lψ∗ are the sets of functions representable by equality (11.23). 11.8. Let F be the set of all trigonometric polynomials, i.e., functions f (·) representable by the equalities a0 f (x) = (ak cos kx + bk sin kx), + 2 n
k=1
where n may be any positive integer. It is clear that, for any pair ψ¯ = (ψ1 , ψ2 ) ¯ satisfying condition (11.3), every function f ∈ F has a ψ-derivative. This
Section 11
¯ ψ-Integrals of Periodic Functions
145
¯
implies, in particular, that the set Lψ is always nonempty. It is also clear that ¯ ∩ψ¯ Lψ = F if ψ¯ runs through the set of pairs satisfying condition (11.3). Moreover, the following stronger statement is also true: Proposition 11.9. The following equality is true: ∩
¯
Lψ = F.
(11.25)
ψ1 ,ψ2 ∈M
¯
Proof. If f ∈ F, then, as indicated above, f ∈ Lψ for any pair satisfying condition (11.3). Therefore, it remains to prove that a function f (·) having any ¯ ψ-derivative for ψ1 , ψ2 ∈ M must belong to F. This fact follows from the statement presented below. ¯ F, then one can choose a pair ψ¯ = Proposition 11.10. If f ∈ L but f ∈ ¯ Lψ¯ , i.e., f ψ¯ (·) does not exist. (ψ1 , ψ2 ) such that ψ1 , ψ2 ∈ M and f ∈ Proof. Let a0 , a1 , . . . , b1 , b2 , . . . be the Fourier coefficients of a function f (·). We set a(x) = sup |ak |, b(x) = sup |bk |, x ≥ 1. k>x
k>x
The functions a(x) and b(x) are piecewise constant and nonincreasing. Moreover, since the Fourier coefficients tend to zero as k → ∞, we have lim a(x) = lim b(x) = 0.
x→∞
x→∞
¯ F is equivalent to the fact that at least one of these functions is The condition f ∈ always positive. For definiteness, assume that a(x) > 0∀x ≥ 1. Denote by kj , j = 1, 2, . . . , the points, arranged in ascending order, at which the function a(x) changes its value. It is clear that a(kj ) = |akj |. We set zj = (kj , |akj |) and construct a function l(x) in the following way: We rotate the ray l1 which originates at z1 in the direction opposite to the positive direction of the y-coordinate axis, counterclockwise up to the moment when this ray meets one of the points zj , j > 1. Denote this point by zj1 . In the case where several points lie on the ray, we denote by zj1 the point with the greatest abscissa. On the interval [1, kj1 ], we define l(x) so that its graph coincides with the straight line connecting the points z1 and zk1 . Further, we rotate the ray l2 that originates at the point zj1 and whose direction coincides with the ray l1 in the final position again counterclockwise up to the moment when it meets one of the remaining points zj , j > j1 . We denote this point by zj2 . If several such points lie on the
146
Classes of Periodic Functions
Chapter 3
ray, then we denote by zj2 the point with the greatest abscissa. On the interval [kj1 , kj2 ], we define l(x) so that the graph of this function coincides with the straight line connecting the points zj1 and zj2 . By repeating this procedure, we construct the function l(x) for all x ≥ 1. This function possesses the following properties: (a) l(x) is convex downwards and lim l(x) = 0; x→∞
(b) l(kjs ) = a(kjs ) = |akjs |, s = 1, 2, . . . . Therefore, if we set ψ1 (k) = l(k), then, by virtue of property (a), we conclude that ψ1 ∈ M, and, by virtue of property (b), we have ψ1 (kjs ) = |akjs |, s = 1, 2, . . . .
(11.26)
Consider the pair ψ¯ = (ψ1 , ψ2 ), where ψ2 (k) = 0, k = 1, 2, . . . . Then series (11.4) that corresponds to this pair and the function f (·) takes the form ∞ k=2
1 Ak (f ; x). ψ1 (k)
By virtue of (11.26), the coefficients of this series do not tend to zero. Hence, it cannot be the Fourier series of any function from L. Consequently, the function ¯ f (·) has no ψ-derivative with such parameters. Proposition 11.10 and, hence, Proposition 11.9 are thus proved. Note that equalities (11.24) show that, in the case where a pair ψ¯ = (ψ1 , ψ2 ) runs through the set M × M, the sets L and/or C are decomposed into subsets ¯ ¯ (classes) Lψ and/or C ψ . Equality (11.25) means that only trigonometric polynomials remain indistinguishable under such a classification. Therefore, in the course of investigation of various problems of the theory of ¯ approximation for functions from the sets Lψ , the main attention should be given to the case where the sequences ψ1 (k) and ψ2 (k), k = 1, 2, . . . , are chosen from the set M. In this case, the considerable mathematical apparatus has already been ¯ created. This enables one to obtain the results for the classes Lψ N practically with the same degree of completeness as for the classes of functions defined by derivatives in the Weyl sense. Some special properties of convex functions are one of the most important elements of this apparatus. Numerous properties of this type will be established in subsequent sections.
Section 12
12.
Sets M0 , M∞ , and MC
147
Sets M0 , M∞ , and MC
12.1. Without loss of generality, we assume that the sequences ψ(k) from the set M are restrictions of certain positive continuous convex downwards functions ψ(t) of continuous argument t ≥ 1 that vanish at infinity to the set of natural numbers. As above, we denote the set of such functions by M. Thus, we have M = {ψ(t) : ψ(t) > 0, ψ(t1 ) − 2ψ((t1 + t2 )/2) + ψ(t2 ) ≥ 0 ∀t1 , t2 ∈ [1, ∞),
lim ψ(t) = 0}.
t→∞
The set M is very inhomogeneous in the rate of convergence of its elements to zero as t → ∞ because the functions ψ(t) can decrease either arbitrarily slowly or arbitrarily rapidly. Moreover, it turns out that the form of results on ¯ the approximation of functions from the sets Lψ , their substance, and methods for their derivation significantly depend on this rate. Therefore, these arises the necessity of decomposing the set M into subsets of functions ψ ∈ M with the same, in a certain sense, character of convergence to zero. As a characteristic on the basis of which it is convenient to perform such a decomposition, we use a pair of functions η(t) = η(ψ; t) and μ(t) = μ(ψ; t) defined as follows: Let ψ ∈ M. Then we denote by η(t) = η(ψ; t) the function connected with ψ by the equality 1 ψ(η(t)) = ψ(t), 2
t ≥ 1.
(12.1)
By virtue of the strict monotonicity of ψ, the function η(t) from (12.1) is uniquely defined for all t ≥ 1 : 1 η(t) = η(ψ; t) = ψ −1 ( ψ(t)). 2
(12.2)
The function μ(t) is defined by the equality μ(t) = μ(ψ; t) =
t . η(t) − t
(12.3)
As follows from (12.1), the quantity η(t) − t is the length of the segment [t, η(t)] on which the value of the function ψ reduces exactly to half. In this connection, the function μ(ψ, t) was called the modulus of half-decay of the function ψ.
148
Classes of Periodic Functions
Chapter 3
If ψ1 (t) = t−r , r > 0, then μ(ψ1 ; t) = (21/r − 1)−1 . If ψ2 (t) = 1/ ln(t + a), a > e, then μ(ψ2 ; t) = t/((t + a)2 + a − t), and if ψ3 (t) = e−t , then μ(ψ3 ; t) = t/ ln 2. These examples demonstrate that the quantity μ(ψ; t) can be bounded from above and below by certain positive numbers, can tend to zero as t → ∞, and can be unbounded above. On the basis of these features, we select the following subsets of the set M : M0 = {ψ ∈ M : 0 < μ(ψ; t) ≤ K
∀t ≥ 1},
(12.4)
M∞ = {ψ ∈ M : 0 < K ≤ μ(ψ; t) < ∞ ∀t ≥ 1},
(12.5)
MC = {ψ ∈ M : 0 < K1 ≤ μ(ψ; t) ≤ K2
(12.6)
∀t ≥ 1}.
Here and below, K, K1 , . . . are certain positive constants independent of the quantities that are parameters in the case under investigation (in the case considered, they are independent of the variable t). Further, we denote by M+ 0 the subset of functions ψ ∈ M0 for which the quantity μ(ψ; t) tends monotonically to zero as t → ∞ : M+ 0 = {ψ ∈ M : μ(ψ; t) ↓ 0}.
(12.7)
By M+ ∞ , we denote the subset of functions ψ ∈ M∞ for which μ(ψ; t) monotonically and infinitely increases as t → ∞ : M+ ∞ = {ψ ∈ M : μ(ψ; t) ↑ ∞}.
(12.8)
12.2. Note that the functions t−r , r > 0, t−r lnε (t + e) for ε ∈ R1 , etc. can be regarded as natural examples of functions from the set MC ; the set M+ 0 contains the functions lnε (t + e) for ε < 0; the functions exp(−αtr ) for any α > 0 and r > 0 belong to the set M+ ∞ . This can easily be verified with the use of the following statement: Theorem 12.1. A function ψ ∈ M belongs to M0 if and only if the quantity α(t) =
ψ(t) df , ψ (t) = ψ (t + 0), t|ψ (t)|
(12.9)
satisfies the condition α(t) ≥ K > 0 ∀t ≥ 1.
(12.10)
Sets M0 , M∞ , and MC
Section 12
149
A function ψ ∈ M belongs to M∞ if and only if α(t) ≤ K
∀t ≥ 1.
(12.11)
A function ψ ∈ M belongs to MC if and only if 0 < K1 ≤ α(t) ≤ K2
∀t ≥ 1.
(12.12)
If the function α(t) does not decrease and lim α(t) = ∞,
(12.13)
t→∞
then ψ ∈ M+ 0 . If α(t) does not increase and lim α(t) = 0,
(12.14)
t→∞
then ψ ∈ M+ ∞. Proof. In view of equality (12.9) with t ≥ 1, we get η(t) ψ(η(t))
dτ ≤ τ α(τ )
t
η(t) η(t) η(t) ψ(τ ) dτ |ψ (τ )|dτ = dτ ≤ ψ(t) τ α(τ ) τ α(τ ) t
t
t
or, with regard for (12.2), ψ(t) 2
η(t)
dτ ψ(t) ≤ ≤ ψ(t) τ α(τ ) 2
t
η(t)
dτ , τ α(τ )
t
i.e., for all t ≥ 1, we have 1 ≤ 2
η(t)
dτ ≤ 1. τ α(τ )
t
If condition (12.10) is satisfied, we obtain K ≤ 2
η(t) t
dτ η(t) = ln = ln(1 + 1/μ(ψ; t)). τ t
(12.15)
150
Classes of Periodic Functions
Chapter 3
Thus, in this case, we have μ(ψ; t) ≥ (eK/2 − 1)−1 , i.e., ψ ∈ M0 . Similarly, if condition (12.11) is satisfied, then relation (12.15) yields ln(1 + 1/μ(ψ; t)) ≤ K, which immediately implies that ψ ∈ M∞ . By analogy, one can verify that if condition (12.12) is satisfied, then the function ψ belongs to the set MC . If α(t) does not decrease and relation (12.13) is true, then, by virtue of inequality (12.15), we have α(t) ≤ 2 ln(1 + 1/μ(ψ; t))
(12.16)
for all t ≥ 1. In view of (12.13), this yields lim μ(ψ; t) = 0.
t→∞
(12.17)
Let us verify that the function μ(ψ; t) monotonically decreases. For this purpose, we consider the function 1/μ(t) = η(t)/t − 1 and conclude that this is possible if and only if tη (t) − η(t) ≥ 0. (12.18) According to (12.1) and (12.9), we have 1 ψ(t) = ψ(η(t)) = −η(t)ψ (η(t))α(η(t)). 2 Combining this relation with (12.9) and taking into account the fact that, by virtue of (12.2), ψ (t) η (t) = (12.19) 2ψ (η(t)) for every ψ ∈ M, we establish that, in the case under consideration, tη (t)α(t) =1 η(t)α(η(t)) or tη (t) = η(t)
α(η(t)) ≥ η(t), α(t)
(12.20)
Section 12
Sets M0 , M∞ , and MC
151
i.e., relation (12.18) is indeed true. Thus, we have proved that if α(t) does not decrease and condition (12.13) is satisfied, then ψ ∈ M+ 0 . By analogy, we verify that if α(t) does not increase and condition (12.14) is satisfied, then ψ ∈ M+ ∞. It remains to show that condition (12.10) is satisfied for all ψ ∈ M0 , condition (12.11) is satisfied for any ψ ∈ M∞ , and condition (12.12) is satisfied for any ψ ∈ MC . For every function ψ ∈ M, we denote by η¯(t) = η¯(ψ; t) the function inverse to η(t). By virtue of (12.19), for any t ≥ 1 we have η (t) > 1/2, which implies that the function η(t) is strictly monotonic. Therefore, on the set t ≥ η(1), the function η¯(t) is uniquely defined and, for every t ≥ η(1), the following relation is true: t ψ(t) = − ψ (τ )dτ ≥ |ψ (t)|(t − η¯(t)) (12.21) η¯(t)
or
ψ(t) t − η¯(t) ≥ . t|ψ (t)| t We now assume that a function ψ ∈ M is such that μ(ψ; t) =
t ≤K η(t) − t
∀t ≥ 1
(12.22)
(12.23)
(i.e., ψ ∈ M0 ). Then, by setting z = η¯(t), we obtain t η(z) z = =1+ ≤K +1 t − η¯(t) η(z) − z η(z) − z or
t − η¯(t) 1 ≥ . t K +1 Substituting this estimate into (12.22), we conclude that if relation (12.23) is true, then ψ(t) ≥ K1 > 0 t|ψ (t)|
for all t ≥ η(1). It is clear that the same inequality is also true for t ∈ [1, η(1)]. This proves that condition (12.10) is satisfied if ψ ∈ M0 and, furthermore, the left-hand side of relation (12.12) is true if ψ ∈ MC . For every function ψ ∈ M and any t ≥ 1, we have 1 |ψ (η(t))|(η(t) − t) ≤ ψ(t) = − 2
η(t) ψ (τ )dτ ≤ |ψ (t)|(η(t) − t). t
(12.24)
152
Classes of Periodic Functions
Chapter 3
Hence, ψ(t) η(t) − t ≤2 . t|ψ (t)| t If ψ ∈ M is such that μ(ψ; t) =
t ≥K η(t) − t
∀t ≥ 1,
i.e., ψ ∈ M∞ , then ψ(t) 2 ≤ . t|ψ (t)| K Thus, if ψ ∈ M∞ , then condition (12.11) is satisfied, and if ψ ∈ MC , then the right-hand side of relation (12.12) is true. Theorem 12.1 is proved. Representing equality (12.9) in the form ψ (t) 1 =− ψ(t) tα(t) and integrating the last relation from 1 to t, t > 1, we get t ψ(t) = ψ(1) exp(−
dτ ). τ α(τ )
1
Analyzing this equality, we arrive at the following statement: Corollary 12.1. If ψ ∈ M0 , then there exists r1 > 0 such that, for all t ≥ 1, ψ(t) ≥ Kt−r1 . If ψ ∈ M∞ , then there exists r2 > 0 such that, for all t ≥ 1, ψ(t) ≤ Kt−r2 . If ψ ∈ MC , then there exist r1 , r2 > 0 such that, for all t ≥ 1, K1 t−r1 ≤ ψ(t) ≤ K2 t−r2 .
Set F
Section 13
13.
153
Set F
13.1. The further investigation of functions ψ ∈ M is connected with the behavior of the quantity η (t) = η(ψ; t), for which, as mentioned above, equality (12.19) is true. According to this equality, 2η (t) is the number that indicates by how many times the value of ψ (τ ) changes as τ runs through the segment [t, η(t)]. We have mentioned above that, for all ψ ∈ M, 1 η (t) ≥ , 2
t ≥ 1.
(13.1)
The functions ψ(t) = t−r , r > 0, and ψ(t) = ln−ε (t + e), ε > 0, demonstrate that, for various functions ψ ∈ M, this quantity can be bounded from above as well as unbounded. For this reason, we set F = {ψ ∈ M : η (ψ; t) ≤ K}.
(13.2)
The set F has certain specific features. First, we formulate the following statement: Theorem 13.1. The following inclusion is true: MC ∪ M+ ∞ ⊆ F.
(13.3)
Proof. Parallel with relations (12.21) and (12.24), we also consider their analog for the segment [η(t), η(η(t))], namely 1 |ψ (η(η(t)))|(η(η(t)) − η(t)) ≤ ψ(t) ≤ |ψ (η(t))|(η(η(t)) − η(t)). 4
(13.4)
Combining relations (12.21) and (13.4), for all ψ ∈ M and arbitrary t ≥ η(1) we obtain η (t) =
ψ (t) (t − η¯(t)) η(η(t)) − η(t) · · 2ψ (η(t)) η(η(t)) − η(t) t − η¯(t)
≤2
η(η(t)) − η(t) η(η(t)) − η(t) t η(t) =2 · · . t − η¯(t) η(t) t − η¯(t) t
(13.5)
If ψ ∈ MC , then it follows from (12.6) that each fraction in the last relation is bounded from above. Therefore, for every ψ ∈ MC and any t ≥ η(1), the quantity η (t) is also bounded. It is clear that this is also true for t ∈ [1, η(1)]. Thus, MC ⊂ F.
154
Classes of Periodic Functions
Chapter 3
If ψ ∈ M+ ∞ , then, by virtue of (12.8), the following equality is true: η(t) = t(1 + γ(t)),
(13.6)
where γ(t) is a function monotonically tending to zero as t → ∞. Therefore, η (t) ≤ 1 + γ(t) and, hence, M+ ∞ ⊂ F. 13.2. Now we establish several criteria for a function ψ ∈ M to belong to the set F. Theorem 13.2. In order that a function ψ ∈ M belong to F, it is necessary and sufficient that, for all t ≥ 1, the following relation be true: K1 |ψ (t)|(η(t) − t) ≤ ψ(t) ≤ K2 |ψ (η(t))|(η(t) − t), η(t) = η(ψ, t). (13.7) Indeed, if ψ ∈ F, then (13.7) follows from the (12.24), (13.1), (12.19) and (13.2). In this case, we have |ψ (η(t))| ≤ |ψ (t)| ≤ 2K|ψ (η(t))|.
(13.8)
On the other hand, if relation (13.7) is true, then, dividing it by |ψ (η(t))|(η(t) − t), we obtain η (t) ≤ K2 /2K1 , i.e., we indeed have ψ ∈ F. 13.3. Remark 13.1. Setting λ(t) = ψ(t)/|ψ (t)|, and using (13.7), we obtain K1 (η(t) − t) ≤ λ(t) ≤ K2 (η(t) − t) ∀ψ ∈ F. Theorem 13.3. In order that a function ψ ∈ M belong to F, it is necessary and sufficient that, for all t ≥ 1, the following inequality be true: η(η(t)) − η(t) ≤ K, η(t) − t
η(t) = η(ψ; t).
(13.9)
Proof. Let ψ ∈ F and let K0 > 1/2 be such that η (t) ≤ K0 for any t ≥ 1. Then η(t) η(η(t)) − η(t) = η (τ )dτ ≤ K0 (η(t) − t), t
(13.10)
Set F
Section 13
155
which yields inequality (13.9) for K = K0 . Now let inequality (13.9) be true. Then, by virtue of (12.21) and (13.4), for all t ≥ η(1) we get η (t) =
ψ (t) η(η(t)) − η(t) η(t) − t ≤2 · ≤ 2K 2 . 2ψ (η(t)) t − η¯(t) η(t) − t
Thus, for t ≥ η(1), the quantity η (t) is bounded. It is clear that this quantity is also bounded for t ∈ [1, η(1)]. 13.4. Remark 13.2. Since, for every ψ ∈ M, the estimate η (t) ≥ 1/2 is true, estimating integral (13.10) from below we conclude that, for all t ≥ 1, η(η(t)) − η(t) 1 ≥ ∀ψ ∈ M. η(t) − t 2
(13.11)
Thus, according to (13.9) and (13.11), for all t ≥ 1 we have 2(η(t) − t) ≤ η(η(t)) − η(t) ≤ K(η(t) − t) ∀ψ ∈ F.
(13.12)
Theorem 13.4. In order that, for a given function ψ ∈ M and all t ≥ 1, the relation ∞ ψ(τ ) K1 ψ(t) ≤ (13.13) dτ ≤ K2 ψ(t), η(t) = η(ψ; t), τ −t η(t)
be true, it is necessary and sufficient that ψ belong to F. If ψ ∈ F, then, for all t ≥ 1, we have η(t) t
ψ(t) − ψ(τ ) dτ ≤ Kψ(t), τ −t ∞
(13.14)
ψ(τ ) dτ ≤ K. τ
(13.15)
1
Proof. Since ∞
ψ(τ ) dτ > τ −t
η(t)
η(η(t))
η(t)
=
ψ(τ ) ψ(t) dτ > τ −t 4
η(η(t))
dτ τ −t
η(t)
ψ(t) η(η(t)) − η(t) ln(1 + ), 4 η(t) − t
(13.16)
156
Classes of Periodic Functions
Chapter 3
the upper bound for the integral in (13.13) is possible only if condition (13.9) is satisfied. Thus, the inclusion ψ ∈ F is necessary for inequality (13.13) to be satisfied. If ψ ∈ F, then, by virtue of (12.24) and (13.9), we have ∞
ψ(τ ) dτ ≤ 2 τ −t
η(t)
∞
|ψ (τ )|
η(τ ) − τ dτ ≤ Kψ(t), τ − η¯(τ )
η(t)
and the lower bound in (13.13) follows from (13.16) and (13.11). 13.5. In view of inequality (13.7), we obtain estimate (13.8): η(t) t
ψ(t) − ψ(τ ) dτ ≤ |ψ (t)|(η(t) − t) ≤ Kψ(t). τ −t
To prove inequality (13.15), we first note that, for any ψ ∈ F and t ≥ η(t), t η(t) − t =
.
η (τ )dτ ≤ K(t − η¯(t)) < Kt.
(13.17)
η¯(t)
This yields for all t ≥ 1 μ(ψ; t) =
t ≥ K1 > 0 ∀ψ ∈ F. η(t) − t
(13.18)
By using relation (12.24) and estimate (13.18), we obtain ∞
ψ(τ ) dτ ≤ 2 τ
1
∞
|ψ (τ )|
η(τ ) − τ dτ ≤ K. τ
1
Theorem 13.4 is proved.
14.
Two Counterexamples
14.1. Relation (13.18) means the validity of the inclusion F ⊆ M∞ . Thus, by virtue of Theorem 13.1, we have MC ∪ M+ ∞ ⊆ F ⊆ M∞ .
(14.1)
In fact, both inclusions in this relation are strict due to the following statement:
Section 14
Two Counterexamples
157
Theorem 14.1. The set M∞ \ F is nonempty. In particular, it contains functions ψ for which η(ψ; t) − t < 2. (14.2) The set F \ (MC ∪ M+ ∞ ) is also nonempty and also contains functions ψ satisfying condition (14.2). Proof. Let us prove the first part of Theorem 14.1. For this purpose, it suffices to indicate a function ψ ∗ ∈ M satisfying condition (14.2) for which ψ(1) = 1 and the quantity η (t) or, by virtue of Theorem 13.3, the quantity R(ψ; t) =
η(η(t)) − η(t) η(t) − t
(14.3)
is unbounded on the set t ≥ 1. Setting ψ(t) = 2x, we get η(t) − t = ψ −1 (x) − ψ −1 (2x), R(ψ; t) =
ψ −1 (x/2) − ψ −1 (x) 1 , x ∈ (0, ]. −1 −1 ψ (x) − ψ (2x) 2
(14.4) (14.5)
Hence, to prove the required statement, it suffices to indicate a function g(x) convex downwards on the interval (0, 1] and such that lim g(x) = ∞,
(14.6)
g(x) − g(2x) < 2,
(14.7)
x→0
and the quantity G(x) =
g(x/2) − g(x) g(x) − g(2x)
(14.8)
is unbounded on (0, 1/2). In this case, ψ ∗ = g −1 (t) is the required function. Indeed, g −1 (t), as the function inverse to a function convex downwards, is also convex downwards for all t ≥ 1 and, by virtue of (14.6), vanishes at infinity, i.e., ψ ∗ ∈ M. Relation (14.2) follows from (14.7) (and, hence, ψ ∗ ∈ M∞ ) . Since R(ψ ∗ ; t) = G(x) for x = ψ ∗ (t)/2, the unboundedness of g(x) in the neighborhood of zero would yield the unboundedness of R(ψ ∗ ; t) at infinity. 14.2. Let ak , k = 0, 1, . . . , be an arbitrary sequence of real numbers monotonically tending to zero, let a0 = 1, and let, for any k ∈ N, the following conditions be satisfied: ak+1 ≤ ak /2 < ak < 2ak < ak−1 .
(14.9)
158
Classes of Periodic Functions
Chapter 3
Further, let ck , k = 0, 1, . . . , be an arbitrary nondecreasing sequence of positive numbers and let ϕ(t) be a function defined by the conditions ϕ(t) = ck , ak+1 ≤ t ≤ ak , k = 0, 1, . . . . We set
(14.10)
1 ϕ(t)dt.
g(x) = 1 +
(14.11)
x
It is easy to see that, for any k = 1, 2, . . . , we have g(ak ) = 1 +
k−1
ci hi , hi = ai − ai+1 ,
(14.12)
i=0
and, with regard for conditions (14.9), g(2ak ) = g(ak ) − ck−1 ak ,
(14.13)
g(ak /2) = g(ak ) + ck ak /2.
(14.14)
Therefore, for k ∈ N, we get G(ak ) =
g(ak /2) − g(ak ) ck . = g(ak ) − g(2ak ) 2ck−1
(14.15)
14.3. Let us verify that the numbers ak and ck can be chosen so that g(x) satisfies conditions (14.9), (14.6), (14.7), and ck = ∞. k→∞ 2ck−1 lim
(14.16)
It is clear that this will prove the required statement. According to the results presented below, these numbers can be chosen in 2 2 numerous ways. Let, e.g., ak = 2−k and ck = 2k , k = 0, 1, . . . . Then 2
and
hk = ak − ak+1 = 2−k (1 − 2−(2k+1) ),
(14.17)
1 2 2 ak = 2−(k +1) > 2−(k+1) = ak+1 , 2
(14.18)
2ak = 2−k
2 +1
2
< 2−(k−1) = ak−1 ,
(14.19)
Section 14
Two Counterexamples
159
i.e., the sequence ak thus chosen satisfies conditions (14.9). At the same time, ck = lim 22(k−1) = ∞. lim k→∞ 2ck−1 k→∞ It remains to verify conditions (14.6) and (14.7). Assume that x ∈ [ak+1 , ak ] for a certain k ≥ 1. Then, by virtue of (14.11), (14.12), and (14.17), we have g(x) ≥ g(ak ) > k, which immediately yields equality (14.6). Furthermore, in this case, according to (14.19), we have 2x ≤ 2ak ≤ ak−1 . Taking (14.12) and (14.17) into account, we get g(x) − g(2x) ≤ g(ak+1 ) − g(ak−1 ) = ck−1 hk−1 + ck hk < 2. 14.4. The first part of the theorem is proved. To prove the second part of the theorem, we also use the function g(x) constructed above. However, in this case, we set ak = 2−N k and ck = 2N k , k = 0, 1, . . . , where N is any number greater then 4. In this case, we have hk = ak − ak+1 = 2−N k (1 − 2−N ),
(14.20)
1 ak = 2−(N k+1) > 2−N (k+1) = ak+1 , 2 and
2ak = 2−N k+1 < 2−N (k−1) = ak−1 ,
i.e., for the values chosen, conditions (14.9) are satisfied and hence, relations (14.12)–(14.14) remain valid. Let us show that, in this case, the quantity G(x) defined by relation (14.8) is bounded on the interval (0, 1/2). Let x be an arbitrary point from (0, 1/2) or, more specifically, let x ∈ [ak+1 , ak ], where k ≥ 1. Then, in view of (14.9) and (14.12)–(14.14), we obtain G(x) = ≤
g(x/2) − g(x) g(x) − g(2x) g(ak+2 ) − g(ak ) ck+1 hk+1 ck+1 hk+1 + ck hk =1+ . = g(ak ) − g(ak−1 ) ck hk ck hk
By using this relation and (14.20), we conclude that G(x) ≤ 2 for any x ∈ (0, 1/2). Therefore, for the function ψ ∗ (t) inverse to g(x), which obviously belongs to M, the quantity R(ψ ∗ ; t) is bounded for all t ≥ 1. This, in turn, means that ψ ∗ ∈ F by virtue of Theorem 13.3. Since, by virtue of (14.20), g(x) − g(2x) ≤ g(ak+1 ) − g(ak−1 ) = ck−1 hk−1 + ck hk ≤ 2,
160
Classes of Periodic Functions
Chapter 3
the function ψ ∗ satisfies condition (14.2). To complete the proof of the theorem, it remains to show that the quantity μ(ψ ∗ ; t) is not monotone or, which is the same, that the function f (x) = g(x)/g(2x) is not monotone on (0, 1/2). Note that the function f (x) is continuously differentiable everywhere in (0, 1/2) except the points ak and ak /2, k = 1, 2, . . . . Therefore, it suffices to indicate the segments of continuous differentiability of the function f (x) on which the expression ϕ(x) = g (x)g(2x) − 2g(x)g (2x) has opposite signs. Since ak /4 = 2−N k−2 ≥ 2−N (k+1) = ak+1 , in this case we have g (x) = g (2x) = −ck . Therefore, the equality ϕ(x) = −ck (g(2x) − 2g(x)) is true. Since g(x) decreases, we have ϕ(x) > 0, which completes the proof of the theorem.
Function ηa (t) and Sets Defined by It
15.
15.1. Let us replace the constant 1/2 in equality (12.1) by an arbitrary constant a ∈ (0, 1) and denote the function η defined by the relation obtained by ηa : (15.1) ψ(ηa (t)) = aψ(t), t ≥ 1. This definition is correct in the sense that, for any ψ ∈ M and all t ≥ 1, the value of ηa (t) is uniquely defined by the equality ηa (t) = ηa (ψ; t) = ψ −1 (aψ(t))
(15.2)
η1/2 (t) = η(t).
(15.3)
and Further, by setting μa (t) = μa (ψ; t) =
t , ηa (t) − t
(15.4)
we can introduce analogs of the set M0 , M∞ , MC , etc., namely, (a)
M0 = {ψ ∈ M : 0 < μa (ψ; t) ≤ K
∀t ≥ 1},
M(a) ∞ = {ψ ∈ M : 0 < K ≤ μa (ψ; t) < ∞ ∀t ≥ 1}, (a)
MC = {ψ ∈ M : 0 < K1 ≤ μa (ψ; t) ≤ K2 (a)+
M0
∀t ≥ 1},
(15.5)
= {ψ ∈ M : μa (ψ; t) ↓ 0}, M(a)+ = {ψ ∈ M : μa (ψ; t) ↑ ∞}, ∞
Section 15
Function ηa (t) and Sets Defined by It
161
and an analog of the set F : Fa = {ψ ∈ M : ηa (ψ; t) ≤ K}.
(15.6)
It is easy to see that Theorems 12.1–13.4 remain valid and their proof, in fact, does not change if we insert the index a in the corresponding places of their formulation and proof. After similar changes, Theorem 14.1 also remains valid. Its proof remains the same if we replace 1/2 in the corresponding places by a number a. In this direction, the following statement is more informative: Theorem 15.1. Let a1 and a2 be arbitrary numbers from the interval (0, 1). Then Fa1 = Fa2 . (15.7) Thus, for a ∈ (0, 1), all sets Fa are equal to one another and, in particular, Fa = F1/2 = F
∀a ∈ (0, 1).
(15.8)
Proof. For example, let ψ ∈ Fa1 . This means that there exists a constant K1 for which a1 ψ (t) ηa 1 (t) = (15.9) ≤ K1 ∀t ≥ 1. ψ (ηa1 (t)) We must prove that, in this case, there exists a constant K2 such that, for every t ≥ 1, a2 ψ (t) ηa 2 = (15.10) ≤ K2 . ψ (ηa2 (t)) If a1 < a2 , then ηa2 (t) < ηa1 (t) and, hence, |ψ (ηa1 (t))| ≤ |ψ (ηa2 (t))|. a2 Therefore, relation (15.10) follows from (15.9) for K2 = K1 . If a2 < a1 , we a1 set t = t0 , t1 = ηa1 (t0 ), t2 = ηa1 (t1 ), . . . , tk+1 = ηa1 (tk ), . . . and denote by n any natural number such that tn ≥ ηa2 (t). On each segment [tk , tk+1 ], k = 0, 1, . . . , in view of (15.9), the value of the derivative ψ (·) increases at most by K1 /a1 times. Therefore, |ψ (tn )| ≥ (K1 /a1 )−n |ψ (t)|. However, |ψ (tn )| ≤ |ψ (ηa2 (t))|. Therefore, K1 n ηa 2 ≤ a2 ( ) , a1 which proves Theorem 15.1. 15.2. Theorem 15.2. In order that, for a given function ψ ∈ M, any a1 , a2 ∈ (0, 1), and all t ≥ 1, the relation K1 ≤
ηa1 (t) − t ≤ K2 , ηa2 (t) − t
ηai (t) = ηai (ψ; t), i = 1, 2,
(15.11)
162
Classes of Periodic Functions
Chapter 3
where the constants K1 and K2 , generally speaking, may depend on the values of a1 and a2 , be true, it is necessary and sufficient that ψ ∈ F. Proof. If relation (15.11) holds, then, in particular, K1 ≤
η1/4 (t) − t ≤ K2 . η1/2 (t) − t
However, η(η(t)) = η1/2 (η1/2 (t)) = η1/4 (t). Therefore, R(ψ, t) =
η1/4 (t) − t η(η(t)) − η(t) = − 1. η(t) − t η1/2 (t) − t
Consequently, R(ψ; t) ≤ K2 − 1. By virtue of Theorem 13.3, this means that ψ ∈ F. The necessity of the conditions of the theorem is proved. If ψ ∈ F, then ψ ∈ Fa1 and ψ ∈ Fa2 by virtue of Theorem 15.1. Therefore, in view of an analog of relation (13.7) for the sets Fa1 and Fa2 , we conclude that, for any t ≥ 1, K1 |ψ (t)|(ηai (t) − t) ≤ ψ(t) ≤ K2 |ψ (t)|(ηai (t) − t),
i = 1, 2,
which yields relation (15.11).
16.
Sets B and M0
16.1. Let c be a certain number that satisfies the condition c > 1. Denote by Bc the set of functions ψ(t) monotonically decreasing for all t ≥ 1 for which there exists a constant K such that, for all t ≥ 1, the following inequality holds: ψ(t) ≤ K. ψ(ct)
(16.1)
If c and c1 are arbitrary numbers greater than the unity, then Bc = Bc1 . Indeed, let ψ ∈ Bc . If c1 ≤ c, then the inequality ψ(t) ≤ K1 ψ(c1 t)
(16.2)
Sets B and M0
Section 16
163
follows from inequality (16.1) for K1 = K because the function ψ decreases. If c1 > c, then, denoting by n any number for which cn ≥ c1 , we get ψ(t) ψ(t) ψ(cn−1 t) ψ(c2 t) ψ(ct) ≤ · . . . ≤ K n. ψ(c1 t) ψ(cn t) ψ(cn−1 t) ψ(c2 t) ψ(ct) df
Thus, all sets Bc with c > 1 coincide and are equal, e.g., to B2 = B. Theorem 16.1. In order that a function ψ ∈ M belong to M0 , it is necessary and sufficient that this function belong to the set B, i.e., M0 = M ∩ B.
(16.3)
Proof. It follows from the definition of the set M0 that if ψ ∈ M0 , then one can find ε > 0 such that, for every t ≥ 1, we have η(ψ; t) − t ≥ε t or η(ψ; t) ≥ (1 + ε)t. Therefore, if ψ ∈ M0 , then ψ(t) ≤ 2, ψ((1 + ε)t) i.e., ψ ∈ Bc for c = (1 + ε) and, hence, ψ ∈ M ∩ B. Now let ψ ∈ M ∩ B. By virtue of (12.24), for every ψ ∈ M, we have η(ψ; t) − t ≥
1 ψ(t) . 2 |ψ (t)|
(16.4)
If, in addition, ψ ∈ B, then there exists a constant K such that, for all t ≥ 1, K≥
ψ(t) ψ(t) − ψ(2t) |ψ (ξ)|t |ψ (2t)| = +1= +1≥ t + 1. ψ(2t) ψ(2t) ψ(2t) ψ(2t)
For all t ≥ 2, this yields t ψ(t) ≥ . |ψ (t)| 2(K − 1) Thus, we can indicate ε > 0 such that, for all t ≥ 1, ψ(t) ≥ εt. |ψ (t)| Substituting this estimate in (16.4), we establish that ψ ∈ M0 .
4. INTEGRAL REPRESENTATIONS OF DEVIATIONS OF POLYNOMIALS GENERATED BY LINEAR PROCESSES OF SUMMATION OF FOURIER SERIES
1.
First Integral Representation (n)
(n)
1.1. Let Λ = λk , k, n = 0, 1, . . . , λ0 = 1, be an arbitrary rectangular numerical matrix. We associate every function f ∈ L whose Fourier series has the form ∞ S[f ] = Ak (f ; x), (1.1) k=0
with the following sequence of series: ∞
Un (f ; x; Λ) =
a0 (n) λk Ak (f ; x), n = 1, 2, . . . . + 2
(1.2)
k=1
In this chapter, we obtain integral representations for the quantities δn (f ; x; Λ) = f (x) − Un (f ; x; Λ)
(1.3)
¯ in the case where f (·) is a ψ-integral of some function ϕ ∈ L. Hence, by virtue of (3.11.2), the following equality is true: S[δn (f ; x; Λ)] =
∞
(n) (1 − λk )(ψ1 (k)Ak (ϕ; x) + ψ2 (k)A˜k (ϕ; x)).
(1.4)
k=1
The first integral representation of the quantity δn (f ; x; Λ) is established in the following statement: 165
166
Integral Representations of Deviations of Polynomials
Chapter 4
Proposition 1.1. Suppose that the series ∞
(ψ1 (k) cos kx + ψ2 (k) sin kx)
(1.5)
(n)
(1.6)
k=1
and
∞
λk (ψ1 (k) cos kx + ψ2 (k) sin kx)
k=1 df (n) (n) are Fourier series, i.e., pairs ψ¯ = (ψ1 , ψ2 ) and λψ¯ = (λk ψ1 (k), λk ψ2 (k)) belong to L. Then, for every function ϕ ∈ L, the following equality holds almost everywhere: π 1 δn (f ; x; Λ) = ϕ(x − t)Kn (t)dt, (1.7) π −π
¯
where f (·) = J ψ (ϕ; ·) and ¯ Λ; t) = Kn (t) = Kn (ψ;
∞
(n)
(1 − λk )(ψ1 (k) cos kt + ψ2 (k) sin kt).
(1.8)
k=1
To prove relation (1.7), it suffices to write the Fourier series for the convolution ϕ ∗ Kn and verify that it coincides with the right-hand side of (1.4). ¯ 1.2. In the general case, if f ∈ Lψ and the pairs ψ¯ and λψ¯ belong to L, in view of Proposition 1.1, equality (1.7) is valid almost everywhere. If, in ¯ ¯ addition, f (·) belongs to C ψ = Lψ ∩ C, Kn (·) belongs to Lp , 1 ≤ p ≤ ∞, and ϕ(·) belongs to Lp , then, in view of Proposition 3.8.1, both sides in (1.7) are continuous functions. Under these conditions, equality (1.7) is valid at any point x. In particular, this is always true if ψ¯ ∈ L, ϕ ∈ M, and Λ is a triangular matrix. (n)
1.3. If Λ = λk , n = 0, 1, . . . , k = 0, 1, . . . , n − 1, is a triangular matrix (n) such that λk ≡ 1, then Un (f ; x; Λ) coincides with the partial sum Sn (f ; x) of the (n − 1)th order of series (1.1). In this case, we set δn (f ; x; Λ) = ρn (f ; x), so that, by definition ρn (f ; x) = f (x) − Sn−1 (f ; x) ∀f ∈ L, and, therefore, Proposition 1.1 takes the following form:
(1.9)
Section 2
Second Integral Representation
167
¯ Proposition 1.1. If ψ¯ ∈ L, then, for any function f ∈ Lψ , the following equality holds almost everywhere:
1 ρn (f ; x) = π here
∞
¯ t) = Fn (ψ;
π
¯ ¯ t)dt, f ψ (x − t)Fn (ψ;
(1.10)
−π
(ψ1 (k) cos kt + ψ2 (k) sin kt).
(1.11)
k=n ¯
¯
¯ ·) ∈ Lp , 1 ≤ p ≤ ∞, and f ψ ∈ Lp , then If, in addition, f ∈ C ψ , Fn (ψ; ¯ equality (1.10) is valid at any point x. In particular, this is true if f ψ ∈ M. ¯ t) in (1.11) is orthogonal to any 1.4. If ψ¯ ∈ L, then the function Fn (ψ; trigonometric polynomial tn−1 (·) of the (n − 1)th degree: π ¯ τ )dτ = 0. tn−1 (τ )Fn (ψ;
(1.12)
−π ¯
Therefore, we can replace f ψ (x − t) in (1.10) by ¯
Δ(x − t) = f ψ (x − t) − tn−1 (x − t),
(1.13)
where tn−1 (·) is an arbitrary polynomial of the (n − 1)th degree. In this case, equality (1.10) has the form 1 ρn (f ; x) = π
π ¯ t)dt. Δ(x − t)Fn (ψ;
(1.14)
−π
It is clear that Proposition 1.1 is valid for it.
2.
Second Integral Representation
2.1. It is often convenient to represent the quantity δn (f ; x; Δ) in another form, namely, as a convolution determined by integration over the entire number axis. Let, as above, M be the set of essentially bounded functions from L : M = {ϕ : ϕ ∈ L, ϕM = esssup|ϕ(·)| < ∞}. Let us prove the following statement:
(2.1)
168
Integral Representations of Deviations of Polynomials
Chapter 4
Lemma 2.1. Suppose that τ1 (v) and τ2 (v) are functions continuous for all v ≥ 0, and their transformations 1 τˆ1+ (t) = π
∞
1 τ1 (v) cos vtdv, τˆ2− (t) = π
0
∞ τ2 (v) sin vtdv
(2.2)
0
are absolutely summable on the entire number axis (ˆ τ1+ , τˆ2− ∈ L(R1 )) : ∞
∞ |ˆ τ1+ (t)|dt < ∞;
−∞
|ˆ τ2− (t)|dt < ∞.
(2.3)
−∞
For any function ϕ ∈ M, consider the convolution ∞ Φτ (x) = (ϕ ∗ τˆ)(x) =
ϕ(x − t)ˆ τ (t)dt,
(2.4)
−∞
where τˆ(t) = τˆ1+ (t) + τˆ2− (t),
(2.5)
and the integral is regarded as the limit of integrals over extending symmetric intervals, i.e., ∞ A = lim . (2.6) −∞
A→∞ −A
This convolution is a continuous 2π-periodic function, ϕ ∗ τ ∈ C, and S [ϕ ∗ τˆ] =
∞
(τ1 (k)Ak (ϕ; x) + τ2 (k)A˜k (ϕ, x)),
(2.7)
k=0
where Ak (ϕ; x) = ak (ϕ) cos kx + bk (ϕ) sin kx, A˜k (ϕ; x) = U Ak (ϕ; x), and ak (ϕ) and bk (ϕ) are the Fourier coefficients of the function ϕ(·). Proof. The inclusion ϕ ∗ τˆ ∈ C is a simple consequence of the fact that ϕ ∈ M and relations (2.3) implying that τˆ ∈ L(R1 ). Therefore, it remains to prove the validity of (2.7). To this end, we calculate the Fourier coefficients αk and βk of function (2.4). The product ϕ(x − t) · τˆ(t) is absolutely integrable
Section 2
Second Integral Representation
169
in the layer x ∈ [−π, π], t ∈ R1 . Therefore, by using the Fubini theorem on the change of the order of integration, we have 1 αk = π
∞
π ϕ(x − t) cos kxdxdt
τˆ(t) −∞
−π
∞
∞ τˆ(t) cos ktdt − bk
= ak −∞
1 βk = π
τˆ(t) sin ktdt,
(2.8)
−∞
∞
π τˆ(t)
−∞
ϕ(x − t) sin kxdxdt
−π
∞
∞ τˆ(t) sin ktdt + bk
= ak −∞
τˆ(t) cos ktdt.
(2.8 )
−∞
Below, we use the following fact from the theory of Fourier integrals: Proposition 2.1. Suppose that γ(v) is a function continuous for all v ≥ 0 and such that its transformations ∞ γˆ+ (t) =
∞ γ(v) cos vtdv, γˆ− (t) =
0
γ(v) sin vtdv 0
are absolutely summable on R1 . Then, at any point v ∈ [0, ∞), we have ∞
∞ γˆ+ (t) cos vtdt =
−∞
and
γˆ− (t) sin vtdt = γ(v)
(2.9)
−∞
∞
∞ γˆ+ (t) sin vtdt =
−∞
γˆ− (t) cos vtdt = 0.
(2.9 )
−∞
In view of equalities (2.5), (2.9), and (2.9 ), we have ∞
∞ τˆ(t) cos ktdt =
−∞
(ˆ τ1+ (t) + τˆ2− (t)) cos ktdt = τ1 (k), −∞
(2.10)
170
Integral Representations of Deviations of Polynomials
Chapter 4
∞ τˆ(t) sin ktdt = τ2 (k).
(2.10 )
−∞
Therefore, returning to relations (2.8) and (2.8 ), we find αk = ak τ1 (k) − bk τ2 (k), βk = ak τ2 (k) + bk τ1 (k). Hence, S[ϕ ∗ τˆ] =
∞
(ak τ1 (k) − bk τ2 (k)) cos kx + (ak τ2 (k) + bk τ1 (k)) sin kx
k=1
=
∞
τ1 (k)Ak (ϕ; x) + τ2 (k)A˜k (f ; x).
k=0
Lemma 2.1 is proved. In what follows, we assume that the systems of numbers ψ1 (k), ψ2 (k), and continuous functions ψ1 (v), ψ2 (v), set of positive integers. By setting τ1 (v) = (1 − λn (v))ψ1 (v), τ2 (v) = (1 − λn (v))ψ2 (v), and (n) λn (k) = λn (k) = λk in Lemma 2.1, we obtain the following statement:
(n) λk , k = 1, 2, . . . , are restrictions of certain and λn (v) of a continuous variable v to the
Theorem 2.1. Suppose that the functions τ1 (v) = (1 − λn (v))ψ1 (v)
and τ2 (v) = (1 − λn (v))ψ2 (v),
λn (k) = λn (k) = λk
(n)
(2.11)
¯ satisfy all conditions of Lemma 2.1. If a function f (·) is a ψ-integral (ψ¯ = (ψ1 , ψ2 )) of some ϕ ∈ M, then the integral ∞ ϕ(x − t)ˆ τn (t)dt,
Φn (f ; τˆn ; x) =
(2.12)
−∞
where 1 τˆn (t) = π
∞ ((1 − λn (v))ψ1 (v) cos vt + (1 − λn (v))ψ2 (v) sin vt)dv, (2.13) 0
Section 2
Second Integral Representation
171
is a continuous 2π-periodic function. Moreover, S[Φn (f ; τˆn ; x)] =
∞
(n)
(1 − λk )(ψ1 (k)Ak (ϕ; x) + ψ2 (k)A˜k (ϕ; x))
k=1
= S[δn (f ; x; Λ)].
(2.14)
Now consider convolution (2.4) in the case where ϕ ∈ L. It is clear that, in this case, conditions (2.3) do not even guarantee the existence of integrals (2.4) at any point x ∈ R1 . However, these conditions are sufficient for the convolution Φτ (x) to exist almost everywhere and to be a summable (and, obviously, 2πperiodic) function, because π
π ∞ |Φτ (x)|dx ≤
−π
∞ |ϕ(x − t)ˆ τ (t)|dtdx = ϕ1
−π −∞
|ˆ τ (t)|dt.
(2.15)
−∞
The last equality is valid because the order of integration of nonnegative functions is not essential. It follows from (2.15) that the product ϕ(x − t)ˆ τ (t) is absolutely integrable in the layer x ∈ [−π, π], t ∈ R1 . Therefore, evaluating Fourier coefficients of the function Φτ (x), in view of Proposition 2.1, we arrive at the following statements: Lemma 2.1. Suppose that the functions τi (v), i = 1, 2, satisfy all conditions of Lemma 2.1. Then, for every ϕ ∈ L, convolution (2.4) represents a function from L for which equality (2.7) holds. Theorem 2.1. Suppose that the functions τ1 (v) and τ2 (v) in (2.11) satisfy ¯ all conditions of Lemma 2.1. Then, for any function f (·) that is a ψ-integral of some function ϕ from L, function (2.12) belongs to L and equality (2.14) holds. ¯
2.2. If f ∈ Lψ M and the conditions of Theorem 2.1 are satisfied, then, for any n ∈ N, the functions Φn (f ; τn ; x) belong to C. Therefore, the left-hand side of (2.14) is the Fourier series of a continuous function. Hence, if f (·) and Un (f ; x; Λ) are also continuous, then, by virtue of (2.14), at any point x ∈ R1 , the following equality holds: ∞ f (x) − Un (f ; x; Λ) =
¯
f ψ (x − t)ˆ τn (t)dt.
(2.16)
−∞ ¯
¯
Consequently, by setting C ψ M = Lψ M ∩ C, we obtain from Theorem 2.1 the following statement:
172
Integral Representations of Deviations of Polynomials
Chapter 4
¯
Theorem 2.2. Suppose that f ∈ C ψ M and the functions τi (·), i = 1, 2, determined by equalities (2.11) satisfy all conditions of Lemma 2.1. Then, at any point x ∈ R1 , equality (2.16) is valid if Un (f ; ·; Λ) ∈ C (which is always true if Λ is a triangular matrix). Theorem 2.1 yields the following consequence: Theorem 2.2. Suppose that f ∈ Lψ and τˆi (·), i = 1, 2, satisfy all conditions of Lemma 2.1. Then equality (2.16) holds almost everywhere on R1 . ¯
2.3. Consider one more fact which follows from Lemma 2.1 . Namely, the following statement is true: Proposition 2.2. Suppose that the functions ψ1 (v) and ψ2 (v) are continuous for all v ≥ 0 and their transformations 1 ψˆ1+ (t) = π
∞
1 ψ1 (v) cos vtdv, ψˆ2− (t) = π
0
∞ ψ2 (v) sin vtdv
(2.17)
0
are absolutely integrable on
R1 .
Consider the convolution ∞
ˆ Φψ (x) = (ϕ ∗ ψ)(x) =
ˆ ϕ(x − t)ψ(t)dt,
(2.18)
−∞
where ˆ = ψˆ1+ (t) + ψˆ2− (t) ψ(t)
(2.19)
and the integral is regarded in the sense of (2.6). This convolution is a function from L and S[Φψ ] =
∞
(ψ1 (k)Ak (ϕ; x) + ψ2 (k)Ak (ϕ; x)).
(2.20)
k=0
This implies, in particular, that if the function ψi (v) satisfies the conditions of this proposition, then the following equality holds: ψ¯
∞ ˆ ϕ(x − t)ψ(t)dt + A0 ,
J (ϕ; x) = Φψ (x) =
(2.21)
−∞ ¯ ¯ where J ψ (ϕ; x) is the ψ-integral of the function ϕ(·) and A0 is a certain constant.
Section 3
3.
Representation of Deviations of Fourier Sums
173
Representation of Deviations of Fourier Sums ¯ ¯ on Sets C ψ M and Lψ
3.1. First, note that, for the validity of representation (2.18) for a given sequence Un (f ; x; Λ) with the functions τ1 (v) and τ2 (v) chosen according to (2.11), the principal condition is the continuity of these functions for v ≥ 0 and the fact that their transformations (2.2) belong to L(R1 ). It is clear that such functions are not unique. One may use this fact and choose τ1 (v) and τ2 (v) so that the right-hand of (2.18) has the most convenient form for investigation. In particular, in order to obtain the integral representation for the deviations of the Fourier sums a0 Sn−1 (f ; x) = (ak cos kx + bk sin kx) + 2 n−1 k=1
¯
from f ∈ C ψ M, it suffices to take any continuous functions τ1 (v) and τ2 (v) satisfying (2.3) and such that 0, k < n, τi (k) = (3.1) ψi (k), k ≥ n, i = 1, 2. Following this reasoning, we obtain integral representations of the quantities ρn (f ; x) = f (x) − Sn−1 (f ; x)
(3.2)
¯ ¯ for the cases where f ∈ C ψ M and f ∈ Lψ and the pairs ψ¯ = (ψ1 , ψ2 ) are such that ψ1 ∈ M (or −ψ1 ∈ M ) and ψ2 ∈ M (or −ψ2 ∈ M ) and satisfy the following condition: ∞ |ψ2 (k)|/k < ∞. (3.3) k=1
Note that the conditions imposed below on the functions ψ1 and ψ2 are nonsymmetric. This is explained by well-known fact (see Theorem 3.7.3) that condition (3.3) with ψ2 ∈ M, is necessary (and, obviously, sufficient) for the series ∞ ∞ ψ2 (k) sin kt to be a Fourier series, while the series ψ1 (k) cos kt is alk=1
k=1
ways a Fourier series for ψ1 ∈ M. In what follows, as above, we denote by M the set of continuous positive functions ψ(·) which are convex downwards for all v ≥ 1 and lim ψ(v) = 0.
v→∞
(3.4)
174
Integral Representations of Deviations of Polynomials
Chapter 4
By M we denote the subset of functions ψ(·) from M that satisfy, in addition, the following condition: ∞ |ψ(t)| dt < ∞. (3.5) t 1
The notation ±ϕ ∈ A means that either ϕ ∈ A or −ϕ ∈ A. It is clear that if ±ψ2 ∈ M , then the values of |ψ2 (k)| satisfy relation (3.3).
3.2. First, we present the following auxiliary statement: Lemma 3.1. Let ±ψ1 ∈ M, ±ψ2 ∈ M , and let n be an arbitrary positive integer, c ∈ [0, n), and
τi (c; v) =
⎧ ⎪ 0, ⎪ ⎪ ⎪ ⎪ ⎪ ⎨v − c
0 ≤ v ≤ c,
ψi (n), c ≤ v ≤ n, ⎪ n−c ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ψ (v), v ≥ n, i = 1, 2. i
(3.6)
Then the transformations 1 τˆ1+ (c; t) = π
∞ τ1 (c; v) cos vtdv
(3.7)
τ2 (c; v) sin vtdv
(3.7 )
0
and 1 τˆ2− (c; t) = π
∞ 0
are absolutely integrable on R1 : ∞
∞ |ˆ τ1+ (c; t)|dt < ∞,
−∞
|ˆ τ2− (c; t)|dt < ∞. −∞
(3.8)
Section 3
Representation of Deviations of Fourier Sums
175
Proof. Considering equality (3.6), we get 1 τˆ1+ (c; t) = π
∞ τ1 (c; v) cos vtdv 0
ψ1 (n) = π
n c
v−c 1 cos vtdv + n−c π
∞ ψ1 (v) cos vtdv n
df
= J1 (ψ1 , t, c)0 + J2 (ψ1 , n; t)0 .
(3.9)
By integrating by parts, we find J1 (ψ1 , t, c)0 =
=
ψ1 (n) sin nt 2 sin(n + c)t sin((n − c)t/2) ] [ − π t (n − c)t2
ψ1 (n) (n − c)t − sin(n − c)t 1 − cos(n − c)t sin nt + cos nt]. [ 2 π (n − c)t (n − c)t2
(3.10)
(3.11)
It follows from (3.10) that J1 (ψ1 ; t; c)0 = O(1)ψ1 (n), t → 0,
(3.12)
where O(1) is a quantity uniformly bounded in t. This implies that the function J1 (ψ1 ; t; c)0 is summable in the neighborhood of origin. Let us show that the function J2 (ψ1 ; t)0 is also of this sort. For any t ∈ R1 , we have 1 J2 (ψ1 ; n; t)0 = π
∞
ψ1 (n) sin nt 1 ψ1 (v) cos vtdt = − − πt πt
n df
=−
ψ1 (n) sin nt 1 − J3 (ψ1 ; t)0 . πt π
∞
ψ (v) sin vtdv
n
(3.13)
The first term on the right-hand side in (3.13) is bounded in the neighborhood of origin. Therefore, it suffices to prove that the function J3 (ψ1 ; t)0 is summable near the point t = 0. Now, for definiteness, we consider that the function ψ1 (v) is positive, i.e., that ψ1 ∈ M. In this case, let −ψ1 (n), 0 < v ≤ n, ϕn (v) = (3.14) −ψ1 (v), v ≥ n.
176
Integral Representations of Deviations of Polynomials
Chapter 4
For any fixed n, the function ϕn (v) does not increase, and, hence, df
∞ ϕn (v) sin vtdv ≥ 0 ∀t ≥ 0.
Φn (t) =
(3.15)
0
However,
2ψ1 (n) nt (3.16) sin2 − tJ3 (ψ; t)0 . t 2 Thus, if J3 (ψ1 ; t)0 ≥ 0 at some point t > 0, then, by virtue of (3.15) and (3.16), Φn (t) = −
J3 (ϕ; t)0 ≤ −
2ψ (n) nt sin2 < −n2 ψ (n)/2. 2 t 2
(3.17)
For every a > 0, let us decompose the interval (0, a) into the sets e+ and e− , by setting e+ = {t : t ∈ (0, a), J3 (ψ1 ; t) ≥ 0}, e− = (0, a) \ e+ . Then a
a |J3 (ψ1 ; t)0 |dt = 2
−a
|J3 (ψ1 ; t)0 |dt 0
a
J3 (ψ1 ; t)0 dt −
= 2(2 e+
J3 (ψ1 ; t)0 dt).
(3.18)
0
Estimate (3.17) is valid on the set e+ , thus, 4 J3 (ψ1 ; t)0 dt ≤ 2a|ψ (n)|n2 .
(3.19)
e+
By changing the order of integration, we find a
∞ J3 (ψ1 ; t)0 dt| = 2|
2|
ψ1 (v)
n
0
∞ ≤2
av
sin t dtdv| t
0
|ψ1 (v)| · (
π + siav)dv < 2πψ1 (n), 2
(3.20)
sin t dt t
(3.21)
n
where
∞ six = − x
is the integral sine.
Section 3
Representation of Deviations of Fourier Sums
177
By combining relations (3.18)–(3.20), we get a
|J3 (ψ1 ; t)0 |dt ≤ 2πψ1 (n) + 2a|ψ1 (n)|n2
(3.22)
−a
for any ψ1 ∈ M and for any a > 0. Thus, the function J2 (ψ1 ; t)0 (as well as J1 (ψ1 ; t; c)0 ) is summable in any neighborhood of origin. Consequently, by virtue of (3.9), the function τˆ1+ (c; t) is also of this sort and it is continuous for all |t| > 0. Therefore, in order to prove the first relation of (3.8), it suffices to show the summability of τ1 (c; t) for large values of |t|. 3.3. It follows from relations (3.9), (3.10), and (3.13) that τˆ1+ (c; t) = − Let us show that
2ψ1 (n) 1 sin(n + c)t sin((n − c)t/2) − J3 (ψ1 ; t)0 . (3.23) 2 π(n − c)t π J3 (ψ1 ; t)0 = O(1)t−2 , t → ∞.
(3.24)
For this purpose, we consider the function ∞ Φ(x) = Φβ (ϕ; x) =
ϕ(v) sin(vt +
βπ )dt, x > 0, t > 0, 2
(3.25)
x
where ϕ(·) is nonnegative and nonincreasing function for all v ≥ 1 and β is any real number. The function Φ(x) is continuous for every fixed t and β. On every interval between the consecutive zeros vk and vk+1 of the function sin(vt + βπ/2), the function Φ(x) has one simple zero xk . Indeed, it is obvious that this function is continuous and existence of zeros xk is a consequence of the Leibniz theorem on alternating series: v ∞ i+1 sign Φ(vk ) = sign ϕ(v) sin(vt + βπ/2)dv i=k vi vk+1
= sign
ϕ(v) sin(vt + βπ/2)dv vk
= sign sin(ξt + βπ/2), ξ ∈ (vk , vk+1 ).
(3.26)
178
Integral Representations of Deviations of Polynomials
Chapter 4
The fact that the zero xk is unique on the interval (vk , vk+1 ) follows from the equality sign Φ (x) = −sign sin(xt + βπ/2). For zeros xk , the following condition is satisfied: (kπ − βπ/2)/t ≤ xk ≤ ((k + 1)π − βπ/2)/t.
(3.27)
Thus, assuming that xk is the zero closest from the right to the point n, we have n ≤ xk ≤ n + 2π/t.
(3.28)
In view of this, by setting ϕ(v) = ψ1 (v) and β = 0 in (3.25), we find 1 |J3 (ψ1 ; t)0 | = | t
∞
1 ψ1 (v) sin vtdv| = | Φ0 (ψ1 ; n)| t
n
1 =| t
xk
ψ1 (v) sin vtdv|
1 ≤| t
n+2π/t
n
≤
ψ1 (v)dv|
n
2π|ψ1 (n)|/t2 .
(3.29)
This proves relation (3.24). Combining (3.23) and (3.24), we get τ1+ (c; t) = O(1)t−2 , t → ∞,
(3.30)
which yields the summability of the function τ1+ (c; t) for large values of |t|. 3.4. Let us prove the second relation in (3.8). Relation (3.6) yields ψ2 (n) τˆ2− (c; t) = π
n c
v−c 1 sin vtdv + n−c π
∞ ψ2 (v) sin vtdv n
df
= J1 (ψ2 ; t; c)1 + J2 (ψ2 ; n; t)1 .
(3.31)
Since J1 (ψ2 ; t; c)1 = =−
ψ2 (n) cos nt 2 cos(n + c)t sin((n − c)t/2) [− + ] π t (n − c)t2
ψ2 (n) (n − c)t − sin(n − c)t 1 − cos(n − c)t cos nt + sin nt], [ 2 π (n − c)t (n − c)t2
(3.32) (3.33)
Section 3
Representation of Deviations of Fourier Sums
179
relation (3.32) yields J1 (ψ2 ; t; c)1 = O(1)ψ2 (n), t → 0.
(3.34)
Setting ϕ(v) = ψ2 (v) and β = 0 in (3.25), by virtue of (3.27) and (3.28) we obtain 1 |Φ0 (ψ2 ; n)| π
|J2 (ψ2 ; n; t)1 | =
1 = | π
xk
1 ψ2 (v)dv| < π
n+2π/t
n
|ψ2 (v)|dv.
(3.35)
n
Therefore, for any a > 0, in view of (3.5) we get a −a
2 |J2 (ψ2 ; n; t)1 |dt ≤ π
a
n+2π/t
|ψ2 (v)|dvdt n
0
2 = (t π
n+2π/t
a
|ψ2 (v)|dv
|a0
+ 2π
n
|ψ2 (n + 2π/t)| dt) t
0
∞ < 4(|ψ2 (n)| + π
|ψ2 (t + n)| dt) t
2π/a
= O(1)(ψ2 (n) + 1).
(3.36)
Relations (3.34) and (3.35) yield the summability of the function τˆ2− (c; t) in any neighborhood of origin. Let us verify its summability for large values of |t|. For any t ∈ R, we have 1 J2 (ψ2 ; n; t)1 = π
∞ ψ2 (v) sin vtdv n
ψ2 (n) cos nt 1 = + πt πt
∞
ψ2 (v) cos vtdv
n df
=
ψ2 (n) cos nt 1 + J3 (ψ2 ; t)1 . πt π
(3.37)
180
Integral Representations of Deviations of Polynomials
Chapter 4
Thus, in view of (3.31) and (3.32), τˆ2− (c; t) =
2ψ2 (n) 1 + J3 (ψ2 ; t)1 . 2 π(n − c)t π
(3.38)
It is now necessary to obtain J3 (ψ2 ; t)1 = O(1)t−2 , t → ∞.
(3.39)
Setting ϕ(v) = ψ2 (v) and β = 1 in (3.25), we get 1 |J3 (ψ2 ; t)1 | = | Φ1 (ψ2 ; n)|. t
(3.40)
Therefore, following the derivation of estimate (3.29), we obtain |J3 (ψ2 ; t)1 | ≤ 2π|ψ1 (n)|/t2 .
(3.41)
Relation (3.39) is established. By comparing (3.38) and (3.41), one can verify the summability of τˆ2− (c; t) for large values of |t|. Therefore, relations (3.8) are proved. 3.5. In Lemma 3.1, let c = n − 1. Then, according to (3.6), ⎧ 0, 0 ≤ v ≤ n − 1, ⎪ ⎪ ⎨ τi (n − 1, v) = (v − n + 1)ψi (n), n − 1 ≤ v ≤ n, ⎪ ⎪ ⎩ ψi (v), v ≥ n, i = 1, 2 and, hence, τi (n − 1, k) =
0,
k < n,
ψi (k), k ≥ n, i = 1, 2.
(3.42)
(3.42 )
Thus, condition (3.1) is satisfied, and, consequently, the left-hand side in (2.18) is the quantity ρn (f ; x) = f (x) − Sn−1 (f ; x). Therefore, by virtue of Theorems 2.2 and 2.2 and Lemma 3.1, we arrive at the following statement: ¯
Theorem 3.1. If f ∈ C ψ M, ±ψ1 ∈ M, and ±ψ2 ∈ M , then, at any point x, the following equality holds: ∞
¯
f ψ (x − t)ˆ τn (t)dt,
ρn (f ; x) = −∞
(3.43)
Section 3
Representation of Deviations of Fourier Sums
181
here 1 τˆn (t) = π
∞ (τ1 (n − 1, v) cos vt + τ2 (n − 1, v) sin vt)dv,
(3.44)
0
and τi (n − 1, v), i = 1, 2, are determined by formula (3.42). ¯ However, if f ∈ Lψ and, as above, ±ψ1 ∈ M and ±ψ2 ∈ M , then equality (3.43) holds almost everywhere. Let Fn be the set of trigonometric polynomials of degree ≤ n. If tn−1 (·) ∈ Fn−1 , then, taking into account equalities (3.42 ) and (2.7), we have ∞ tn−1 (x − t)ˆ τn (t)dt = 0.
(3.45)
−∞
Therefore, equality (3.43) can be rewritten as ∞
¯
(f ψ (x − t) − tn−1 (x − t))ˆ τn (t)dt,
ρn (f ; x) =
(3.46)
−∞
where tn−1 (·) is any function from Fn−1 . In particular, the following equality holds: ∞ ¯ ¯ ρn (f ; x) = (f ψ (x − t) − f ψ (x))ˆ τn (t)dt. (3.46 ) −∞
By virtue of (3.42), 1 π
∞ τ1 (n − 1, v) cos vtdv 0
ψ1 (n) = π
n
1 (v − n + 1) cos vtdv + π
n−1
∞ ψ1 (v) cos vtdv n
df
= J1 (n, t)0 + J2 (ψ1 , n, t)0 .
(3.47)
Taking the first integral, we find J1 (n, t)0 =
ψ1 (n) t − sin t 1 − cos t sin nt + cos nt). ( π t2 t2
(3.48)
182
Integral Representations of Deviations of Polynomials
Chapter 4
Similarly, we have 1 π
∞ τ2 (n − 1, v) sin vtdv = J1 (n, t)1 + J2 (ψ2 , n, t)1 ,
(3.49)
ψ2 (n) t − sin t 1 − cos t cos nt + sin nt) (− π t2 t2
(3.50)
0
where J1 (n, t)1 = and 1 J2 (ψ2 , n, t)1 = π
∞ ψ2 (v) sin vtdv.
(3.51)
n
3.6. The following lemma will be useful: Lemma 3.2. Suppose that ϕ(·) is an arbitrary summable 2π-periodic function ( ϕ ∈ L ). Then ∞ t − sin t ϕ(t) dt = 0, (3.52) t2 −∞
∞ −∞
1 − cos t 1 ϕ(t) dt = t2 2
π ϕ(t)dt,
(3.53)
−π
where the integrals are understood in the sense of their principal values. Proof. Let γ(t) = (t − sin t)/t2 , then ∞
−π π a ϕ(t)γ(t)dt = lim [ ϕ(t)γ(t)dt + ϕ(t)γ(t)dt + ϕ(t)γ(t)dt]. a→∞
−∞
−a
−π
π
It is clear that the quantity a can be chosen in the form a = (2p + 1)π, p = 1, 2, . . . . Therefore, a ϕ(t)γ(t)dt =
p
(2k+1)π
π
ϕ(t)γ(t)dt =
k=1(2k−1)π
π
π =
ϕ(t) π
p
k=1−π
p t + 2kπ − sin t k=1
(t + 2kπ)2
dt.
ϕ(t)γ(t + 2kπ)dt
Section 3
Representation of Deviations of Fourier Sums
183
By analogy, we have −π π p t − 2kπ − sin t ϕ(t)γ(t)dt = dt. (t − 2kπ)2 −π k=1
−a
Thus, ∞
π ϕ(t)γ(t)dt = lim
p→∞ −π
−∞
1 1 1 + ) ϕ(t)[ + ( t t + 2kπ t − 2kπ p
k=1
1 1 1 + ( + ))]dt. t2 (t + 2kπ)2 (t − 2kπ)2 p
− sin t(
k=1
The multiplier γ(t, p) of the function ϕ(t) under the integral sign on the righthand side of this equality is uniformly bounded in t and p. Therefore, taking the limit and using the well-known decompositions ∞
1 1 1 1 ( = + + ) 2 tan(t/2) t t + 2kπ t − 2kπ
(3.54)
k=1
and
∞
1 1 1 1 ( + ), = 2+ 2 t (t + 2kπ)2 (t − 2kπ)2 4 sin (t/2) k=1
we get
(3.55)
π lim
p→∞ −π
ϕ(t)γ(t, p)dt = 0,
which is equivalent to relation (3.52). Equality (3.53) is established by analogy. 3.7. In view of equalities (3.48), (3.50), (3.52), and (3.53), for every ϕ ∈ L we obtain ∞ π ψ1 (n) ϕ(t)J1 (n, t)0 dt = ϕ(t) cos ntdt, (3.56) 2π −∞ ∞
ϕ(t)J1 (n, t)1 dt = ∞
In particular, if we set ϕ(t) = (3.56) and (3.57) yield
ψ2 (n) 2π
−π π
ϕ(t) sin ntdt.
(3.57)
−π
¯ f ψ (x − t) − tn−1 (x − t)
for all x, then equalities
184
Integral Representations of Deviations of Polynomials ∞
Chapter 4
¯
(f ψ (x − t) − tn−1 (x − t))(J1 (n, t)0 + J1 (n, t)1 )dt −∞
1 = 2π
π
¯
(f ψ (x − t) − tn−1 (x − t)) · (ψ1 (n) cos nt + ψ2 (n) sin nt)dt. (3.58) −π
By analogy, we get ∞
¯
¯
(f ψ (x − t) − f ψ (x))(J1 (n, t)0 + J1 (n, t)1 )dt −∞
π =
¯
¯
(f ψ (x − t) − f ψ (x))(ψ1 (n) cos nt + ψ2 (n) sin nt)dt. (3.58 )
−π
Combining the statement of Theorem 3.1, equalities (3.46), (3.46 ), (3.47), (3.49), (3.58), and (3.58 ) and setting ¯
¯
δn (u) = δn (f ψ ; tn−1 , u) = f ψ (u) − tn−1 (u), ¯
δ0 (u) = δ0 (f ψ ; u) = f ψ (u) − f ψ (u + t), t ∈ R1 ,
(3.59) (3.59 )
we arrive at the following statement: ¯
Corollary 3.1. If f ∈ C ψ M, ±ψ1 ∈ M, and ±ψ2 ∈ M , then, at any point x ∈ R1 , the following equality holds: ∞ Δ(x − t)(J2 (ψ1 ; n; t)0 + J2 (ψ2 ; n; t)1 )dt
ρn (f ; x) = −∞
1 + 2π
π Δ(x − t)(ψ1 (n) cos nt + ψ2 (n) sin nt)dt, (3.60) −π
¯
where Δ(u) is either f ψ (u) or δn (u) from (3.57), or δ0 (u) from (3.57 ), 1 J2 (ψ1 ; n; t)0 = π
∞ ψ1 (v) cos vtdv, n
(3.61)
Section 3
Representation of Deviations of Fourier Sums 1 J2 (ψ2 ; n; t)1 = π
∞ ψ2 (v) sin vtdv.
185
(3.61 )
n ¯ Lψ
If f ∈ and, as above, ±ψ1 ∈ M and ±ψ2 ∈ M , then equality (3.60) is valid almost everywhere.
5. APPROXIMATION BY FOURIER SUMS IN SPACES C AND L1 In this chapter, we present results related to the estimation of the quantities ρn (f ; x)X = f (x) − Sn−1 (f ; x)X ,
(0.1)
where X denotes either C or L = L1 . If, in addition, X = C, then the ¯ ψ¯ and C ψ Hω0 defined as follows: functions f (·) are chosen from the classes C∞ ¯
¯
¯
0 ψ = {f : f ∈ C ψ , f ψ ∈ SM }, C∞ ψ¯
ψ¯
(0.2)
ψ¯
C Hω0 = {f : f ∈ C , f ∈ Hω0 }, 0 SM
where is the unit sphere in the space and orthogonal to a constant, i.e.,
M0
(0.3)
of functions essentially bounded π
0 SM
Hω0
= {ϕ : ϕM = ess sup |t| ≤ 1, t
ϕ(t)dt = 0},
(0.4)
−π
is the class of 2π-periodic functions ϕ(·) satisfying the condition |ϕ(t) − ϕ(t )| ≤ ω(|t − t |) ∀t, t ,
(0.5)
π ϕ(t)dt = 0, −π
and ω = ω(t) is a fixed modulus of continuity. ¯ ¯ If X = L1 , then functions f (·) in (0.1) belong to Lψ S10 and Lψ Hω01 : ¯
¯
¯
Lψ S10 = {f : f ∈ Lψ , f ψ ∈ S10 π = {ϕ : ϕ1 =
π |ϕ(t)|dt ≤ 1,
−π
187
ϕ(t)dt = 0}}, (0.6) −π
Approximation by Fourier Sums in Spaces C and L1
188 ¯
¯
Chapter 5
¯
Lψ Hω01 = {f : f ∈ Lψ , f ψ ∈ Hω01 π = {ϕ :
π |ϕ(x + t) − ϕ(x)|dx ≤ ω(t)}
ϕ(t)dt = 0}, (0.7)
−π
π
and ω = ω(t) is a fixed modulus of continuity. ¯
¯
ψ Note that, by virtue of Proposition 3.11.2, the sets C∞ and C ψ Hω0 consist ¯ 0 0 ¯ of ψ-integrals of all functions from SM and Hω , respectively. The sets Lψ S1 ¯ ¯ and Lψ Hω1 consist of ψ-integrals of functions from S1 and Hω1 , respectively. The quantities
En (N)X = sup ρn (f ; x)X , f ∈N
(0.8)
where N is one of the mentioned classes, are the main subject of our investigation aimed at obtaining asymptotic equalities for them, i.e., equalities of the form En (N)X = ϕ(n) + o(ϕ(n)),
(0.9)
where ϕ(n) = ϕ(N; n; X) is a certain function of a natural variable. If such an equality is obtained, we say that the Kolmogorov–Nikol’skii problem is solved in a given metric of the space X for a given class of functions N. Here, we find an analog of the well-known Lebesgue inequality with exact ¯ ¯ constant of the principal term for the sets C ψ C and Lψ : ρn (f ; x)C ≤
4 (ln n + K)En (f )C , ϕC = max |ϕ(x)|, x π2
(0.10),
where K is a certain constant and En (f )C is the quantity of the best approximation of a function f (·) by trigonometric polynomials of the (n − 1)th degree: En (f )C = inf f (·) − tn−1 (·)C . tn−1
(0.11)
The material is presented in ascending order of smoothness of functions. First, we ¯ consider the approximation of functions from the sets Lψ for ±ψ1 , ±ψ2 ∈ M0 and then for ±ψ1 , ±ψ2 ∈ F. Finally, we examine the case where elements of the ¯ sets Lψ are restrictions of entire functions to the real axis.
Simplest Extremal Problems in Space C
Section 1
1.
189
Simplest Extremal Problems in Space C
1.1. This section plays an auxiliary role. Here, we present a method for estimating integrals of the form b f (t)ϕ(t)dt,
(1.1)
a
where ϕ(·) is a fixed function and f (·) runs through a certain set of functions. We begin with the simplest but very important case. Assume that, on an arbitrary segment [a, b], a summable function ϕ(·) is given ( ϕ ∈ L(a, b) ) which is symmetric with respect to c = (a + b)/2, i.e., ϕ(t) = −ϕ(2c − t).
(1.2)
Denote the set of such functions ϕ(·) by Va,b . Further, let Hω [a, b] be the class of functions satisfying equality (0.5) for any t and t from [a, b] and let b Eω (ϕ) = Eω (ϕ; Hω [a, b]) =
sup f ∈Hω [a,b]
|
f (t)ϕ(t)dt|.
(1.3)
a
The problem is to determine the exact value of Eω (ϕ) or, at least, to find its upper and lower bounds unimprovable in a certain sense. As a rule, problems of this sort are solved in two steps: First, one establishes the required upper estimate, and then a function f ∗ (·) from a given class is indicated for which this estimate is unimprovable. In this case, the function f ∗ (·) is called extremal for a given problem. In the case under consideration, we establish the required upper estimate as follows: We decompose the integral over the interval (a, b) into two integrals over the intervals (a, c) and (c, b), respectively, and change the variables z = 2c − t in the second integral. By virtue of equality (1.2), we get b |
c f (t)ϕ(t)dt| = |
a
(f (t) − f (2c − t))ϕ(t)dt|. a
This implies that, for any f ∈ H[a, b], b |
c f (t)ϕ(t)dt| ≤
a
ω(2c − 2t)|ϕ(t)|dt. a
(1.4)
Approximation by Fourier Sums in Spaces C and L1
190
Consequently,
Chapter 5
c Eω (ϕ) ≤
ω(2c − 2t)|ϕ(t)|dt.
(1.5)
a
This is just the required upper estimate. Further, we set −ω(2c − 2t)/2, t ∈ [a, c], f ∗ (t) = ω(2t − 2c)/2, t ∈ [c, b].
(1.6)
For this function, we have b |
f ∗ (t)ϕ(t)dt| =
a
c
b ω(2c − 2t)|ϕ(t)|dt =
a
Therefore, in the case of
(1.7)
c
f∗
∈ Hω [a, b], equality (1.7) yields
c
b ω(2c − 2t)|ϕ(t)|dt =
Eω (ϕ) =
ω(2t − 2c)|ϕ(t)|dt.
a
ω(2t − 2c)|ϕ(t)|dt.
(1.8)
c
If ω = ω(t) is a convex function, then the inclusion f ∗ ∈ Hω [a, b] holds. Indeed, let t and t be arbitrary points from [a, b]. If both these points lie on the same side of the point c (e.g., c ≤ t < t ), then, by semiadditivity of a modulus of continuity (see Subsection 3.1.3), we have 1 |f ∗ (t ) − f ∗ (t )| = (ω(2t − 2c) − ω(2t − 2c)) 2 1 ≤ ω(2t − 2t ) ≤ ω(t − t ). 2
(1.9)
Consider the case where t < c < t . We set t − t = 2h and t0 = c − h. For definiteness, we assume that t ≤ t0 . Then, obviously, t ≤ c + h and t0 − t = c + h − t . Since the function f ∗ (·) increases on the segment [a, b], we have |f ∗ (t ) − f ∗ (t )| = (f ∗ (c + h) − f ∗ (t0 )) + (f ∗ (t0 ) − f ∗ (t )) + (f ∗ (t ) − f ∗ (c + h)) c−h c+h ∗ f (τ )dτ − f ∗ (τ )dτ. = ω(2h) + t
t
(1.10)
Simplest Extremal Problems in Space C
Section 1
191
By virtue of the convexity of the function ω(t), the derivative f ∗ (·) does not decrease on the interval (a, c) and does not increase on the interval (c, b). Therefore, c−h c+h ∗ f (τ )dτ − f ∗ (τ )dτ t
t
≤ f ∗ (c − h)(c − h − t ) − f ∗ (c + h)(c + h − t ) = 0. Thus, in this case, we also have |f ∗ (t ) − f ∗ (t )| ≤ ω(2h) = ω(t − t ). Hence, the following statement is true: Lemma 1.1. Suppose that ϕ ∈ Va,b and ω = ω(t) is an arbitrary convex modulus of continuity. Then b Eω (ϕ) =
sup f ∈Hω [a,b]
|
(a+b)/2
ω(a + b − 2t)|ϕ(t)|dt
f (t)ϕ(t)dt| = a
a
b ω(2t − a − b)|ϕ(t)|dt.
=
(1.11)
(a+b)/2
The upper bound in this equality is realized by any function of the form K ±f ∗ (·), where K is an arbitrary constant and f ∗ (·) is defined by equality (1.6). 1.2. In the case where ω(t) is not convex, the explicit value of Eω (ϕ) is unknown. Although the function f ∗ (t) in (1.6) still satisfies equality (1.7) in this case, it does not necessarily belong to the class Hω [a, b]. Nevertheless, it can be shown that, for any modulus of continuity, the function f∗ (t) = 23 f ∗ (t) belongs to the class Hω [a, b]. Indeed, if t and t lie on the same side of the point c, then inequality (1.9) always holds. However, if, e.g., t ∈ [a, c] and t ∈ [c, b], then, by virtue of the monotonicity of the function f ∗ (·), we have 1 |f∗ (t ) − f∗ (t )| = (ω(2t − 2c) + ω(2c − 2t )) 3 1 df = (ω(2t − c) + ω(2(t − t ) + 2(c − t ))) = Δ(ω). 3
Approximation by Fourier Sums in Spaces C and L1
192
Chapter 5
Thus,
1 1 Δ(ω) ≤ ω(2(t − t )) + ω(t − t ) ≤ ω(t − t ), 3 3 if t − c ≤ t − t ≤ 2(t − c), and 1 1 Δ(ω) ≤ ω(t − t ) + ω(2(t − t )) ≤ ω(t − t ), 3 3 if t − t ≥ 2(t − c), i.e., f∗ ∈ Hω [a, b]. If ϕ ∈ Va,b , then, obviously, b |
2 f∗ (t)ϕ(t)dt| = 3
a
c ω(2c − 2t)|ϕ(t)|dt. a
Comparing this equality with inequality (1.5), we obtain 2 3
c
c ω(2c − 2t)|ϕ(t)|dt ≤ Eω (ϕ) ≤
a
ω(2c − 2t)|ϕ(t)|dt.
(1.12)
a
By virtue of equality (1.2), we have
b
ϕ(t)dt = 0. Therefore, in the definition of
a
Eω (ϕ), the supremum of the integral in (1.3) can be only taken over the subset of functions f from Hω [a, b] that vanish at some point from [a, b], e.g., at the point t = c. This subset is compact in itself, which guarantees the existence of the value Eω (ϕ), whatever modulus of continuity ω(t) and function ϕ ∈ Va,b are taken. Thus, relation (1.12) and Lemma 1.1 yield the following assertion: Lemma 1.2. Suppose that ϕ ∈ Va,b and ω(t) is an arbitrary modulus of continuity. Then c Eω (ϕ) = θω
b ω(2c − 2t)|ϕ(t)|dt = θω
a
ω(2t − 2c)|ϕ(t)|dt,
(1.13)
c
where c = (a + b)/2, 2/3 ≤ θω ≤ 1, and θω = 1 for a convex function ω(t). 1.3. To illustrate applications of Lemmas 1.1 and 1.2, we establish some estimates necessary in what follows, namely, the estimates of upper bounds of nth Fourier coefficients of functions f (·) from the class Hω 1 an = an (f ) = π
π −π
1 f (t) cos ntdt, bn = bn (f ) = π
π f (t) sin ntdt. −π
Simplest Extremal Problems in Space C
Section 1
193
First, note that bn (f ) can be represented in the form 1 bn (f ) = π
π −π
π 1 f (t) cos(nt + )dt = 2 π
π f (t − π/2n) cos ntdt. −π
Since a shift in an argument does not remove a function from the class Hω , we have 1 sup |bn (f )| = sup | π f ∈Hω f ∈Hω
π
−π
f (t −
π ) cos ntdt| = sup |an (f )|, 2n f ∈Hω
(1.14)
i.e., in the class Hω , the upper bounds of the coefficients an (f ) and bn (f ) coincide. Therefore, it suffices to consider only one of them. Let us estimate, e.g., the value 1 en (ω) = sup |an (f )| = sup | π f ∈Hω f ∈Hω
π f (t) cos ntdt|, n ∈ N.
(1.15)
−π
Every function defined on the entire axis can be represented as a sum of its even and odd components, i.e., f (t) = f1 (t) + f2 (t), f1 (t) = (f (t) + f (−t))/2, f2 (t) = (f (t) − f (−t))/2. It is easy to see that if f ∈ Hω , then f1 ∈ Hω and f2 ∈ Hω . Since an (f2 ) = 0, we get 1 en (ω) = sup | f ∈Hω π
π f1 (t) cos ntdt|
−π
1 = sup | (0) π f ∈H ω
π
−π
2 f (t) cos ntdt| = sup | (0) π f ∈H ω
π f (t) cos ntdt|,
(1.16)
0
(0)
where Hω denotes the subset of even functions from the class Hω . For any fixed n, we denote by Hω,n the set of even 2π/n-periodic functions from Hω . Let us show that 2 sup | (0) π f ∈H ω
π 0
2 f (t) cos ntdt| = sup | f ∈Hω,n π
π f (t) cos ntdt|. 0
(1.17)
Approximation by Fourier Sums in Spaces C and L1
194
Chapter 5
Indeed, let f (·) be an arbitrary function from the class Hω . We set ti = iπ/n, i = 0, n, and take i0 satisfying the following condition: ti0+1 ti+1 df f (t) cos ntdt| = | f (t) cos ntdt| = M (f ). max | i
ti
(1.18)
ti0
Then 2 | π
π
2 f (t) cos ntdt| = | π
n−1
ti+1 2n f (t) cos ntdt| ≤ M (f ). π
(1.19)
i=0 t i
0
Let us show that, in the class Hω,n , there is a function ϕ0 (t) = ϕ0 (f ; t) for which this relation turns into an equality; this would prove equality (1.17). For this purpose, we set ϕ1 (t) = (f (t) − f (2ci − t))/2, t ∈ (ti0 , ti0 +1 ), ci = (2i + 1)π/2n,
ϕ2 (t) =
i = 0, n − 1, ϕ1 (t), t ∈ [ti0 , ti0 +1 ], ϕ1 (2ti0 +1 − t), t ∈ [ti0 +1 , ti0 +2 ],
(1.20)
and denote by ϕ0 (t) a 2π/n-periodic extension of the function ϕ2 (t). The function ϕ0 (t) is the required one. Indeed, for this function, relation (1.19) turns into an equality by construction; on the segment [ti0 , ti0 +1 ], the function ϕ0 (t) satisfies condition (0.5) because the function f (·) satisfies it; on the segment [ti0 , ti0 +2 ], which is the period of ϕ0 (t), this function satisfies condition (0.5) by virtue of its symmetry with respect to the straight line t = ti0 +1 . Equality (1.17) is proved. However, in this case, according to (1.16) and (1.17), we have
2 en (ω) = sup | f ∈Hω,n π
π 0
2n f (t) cos ntdt| = sup | π f ∈Hω,n
π/n f (t) cos ntdt|. (1.21) 0
It is clear that every function f (·) defined on [0, π/n] and satisfying condition (0.5) on this segment can be extended to a 2π/n-periodic even function for which condition (0.5) is also satisfied. Therefore, it follows from (1.21) that 2n en (ω) = | sup π f ∈Hω [0,π/n]
π/n f (t) cos ntdt|. 0
(1.22)
Simplest Extremal Problems in Space C
Section 1
195
To calculate the right-hand side of this equality, we use Lemma 1.2. In this case, a = 0, b = π/n, and c = π/2n. Hence, 2θω en (ω) = π
π/2 2t ω( ) sin tdt, n
(1.23)
0
where θω ∈ [2/3, 1], and θω = 1 for a convex modulus of continuity ω(t). This, in particular, yields 2 π en (ω) < ω( ). (1.23 )