Abstract
In this paper, we study the average Kolmogorov –widths and the average linear –widths of multivariate isotropic and anisotropic Besov classes in Orlicz spaces and give the weak asymptotic estimates of these two widths. At the same time, we also give the asymptotic property of the optimal recovery of isotropic Besov classes in Orlicz spaces.
MSC:
41A46
1. Introduction
Ref. [1] has studied the average Kolmogorov –widths and average linear –widths of multivariate isotropic and anisotropic Besov classes in spaces. Research on the widths and optimal recovery of multivariate Besov classes in Orlicz spaces has not been conducted so far, and there are few related articles. This paper carries out some of this work. Orlicz spaces are introduced by Polish mathematician W. Orlicz. Since more than half a century, Orlicz spaces theory has been widely used. It not only provides intuitive background material for functional analysis, but also has many applications in differential equations, integral equations, probability theory, approximation theory of functions, harmonic analysis and other disciplines. As well known, the activity world and metrics provided by spaces are very effective for discussing problems such as equation solving and approximation theory of functions. However, spaces are only suitable for dealing with linear and at best polynomial type nonlinear problems. Whenever nonlinear problems appear, spaces will show its limitations. At this time, people naturally use the expansion of spaces–Orlicz spaces as an alternative tool. With the emergence of more complexity problems and nonlinear problems, it has become a choice to study the approximation problems in Orlicz spaces, which is the practical significance of this paper. Orlicz spaces are larger than continuous function spaces and spaces; they are an extension of spaces. In particular, the Orlicz spaces generated by N-functions that do not satisfy the -condition are a substantial generalization and promotion of spaces. Considering that the norm structure of Orlicz spaces is more complex than that of continuous function spaces and spaces, it is difficult and of theoretical significance to study the widths and optimal recovery problems in Orlicz spaces, and it can also reflect the characteristics of the function spaces of the study of the approximation problem from ‘small’ to ‘large’.
In this paper, let and be complementary N-functions; the definition of an N-function is as follows.
Definition 1.
A real valued function defined on R is called an N-function if it has the following properties.
(1) is an even continuous convex function, and ;
(2) for ;
(3) and
The complementary N-function is given by . Properties of N-functions are discussed in reference [2]. The norm in Orlicz spaces is
All measurable functions with finite Orlicz norms constitute the Orlicz space associated with the N-function , where expresses the modulus of with respect to . Here, , etc., are functions of d elements. For convenience, denote . According to ref. [2], the Orlicz norm can also be calculated by
In this paper, C is used to represent a constant, and in different places its value can be different.
Let and be the continuous linear operator on , where is the characteristic function of . Let and L be the subspace of , and define
where represents the Kolmogorov n-widths of A in X, see refs. [3,4]. The average dimension of L in is defined as
Let and S be the centrally symmetric subset of . The average Kolmogorov –widths (average widths) of S in are defined by
where the first infimum takes all subspaces , which satisfy . The average linear –widths (average widths) of S in are defined by
where the infimum takes all pairs such that, for each pair , Y is the normed space, which is continuously imbedded in , , is the continuous linear operator from Y to , and , where represents the range of the operator .
By definition, we have
Suppose that , for every ,
is the k-th difference of f at the point x with step t, where . We use to denote when .
Definition 2.
Let , and we say if f satisfies the following conditions:
(1) ,
(2)
where is the Euclidean norm.
By ref. [5], the linear space is a Banach space with the norm
and is an isotropic Besov space.
Definition 3.
Let , , , , . We say if f satisfies the following conditions:
(1) ,
(2) For , we have
By ref. [5], the linear space is a Banach space with the norm
and is an anisotropic Besov space. By ref. [5], when .
For real vector , we define
Let . Define as the set of all those functions from in which, for each function f, the support of the Fourier transform in the distributional sense of f is contained in . The Schwartz theorem states that coincides with the set of all continued analytically entire functions of type in . Here, means that for every .
In this paper, we study the average Kolmogorov widths, average linear widths, and the optimal recovery problem of the Besov classes , and .
2. Average Widths Problem
Lemma 1
([6,7]). Let . Then,
Let represent the unit ball of X.
Lemma 2
([3]). If , then
where represents the usual Kolmogorov n-width of A in X, while X is a normed linear space, and A is the subset of X.
Theorem 1.
Let , . Then,
(1)
where
and the definition of is given in the proof below.
(2) is the weakly asymptotic optimal subspace of average for , where is defined by ( when ) .
Proof.
To find the upper bound, first of all, we construct the following continuous linear operators from to . For every and natural number l, we have
where . For any real number , let
be an even entire function of one variable exponential type , where . Let For every , let
where . By ref. [5], is an entire function of one variable of exponential type . Let
Then, is the d variables entire function of exponential type . Let Using the Minkowski inequality and Hölder inequality, we have
where . In addition, we have
where
Similar to (2), we have
Inductively, for , we have
Therefore, from (3), we have
By (4), we have
where Therefore, the operator , is continuous and linear. Let (let when ). Hence, by (4) and Lemma 1, we have
To estimate the lower bound, let ( when ), , and the non-zero function with . For every and every , let
then, ,
For any , let . Define the following set of functions
then the dimension of space is . For any , it is easy to see that
If
then
where .
By the Minkowski inequality, we have
By (6), we have
In addition, for , we have
Then, .
Now, we estimate the quantity . Let A be the subspace of and its average dimension . By the definition of the average dimension, for any , there exists a subspace with dimension such that
where represents the unit ball of space A. In addition, for any , we have
here, denotes the distance of element x and B, while B is the subset of linear normed space X. Hence, for any and any , we have
Hence,
In addition, we also have
By (1), we finish the proof of the Theorem. □
Since , taking , by Theorem 1, we have the following.
Corollary 1.
Let Then,
(1)
where or .
(2) is a weakly asymptotic optimal subspace of average dimension σ for , where is defined by .
3. Optimal Recovery Problem
By ref. [8], be similar to the definition in [9,10], for , let be the set of all sequences of points in , which satisfies the following conditions:
(1) For , if and only if ,
(2) For , if and only if ,
(3)
where is the usual Euclidean norm, and for any denotes the number of elements of the set .
Let be the normed space of functions on with the norm , and for the set of , let
Let , and the quantity
is called the diameter of K. For , the information of is defined by . is called a standard sampling operator of the average cardinality . The quantity
is called the minimum information diameter of the set K in space . If K is the balanced and convex subset of , then
For every , the mapping is called an algorithm, and is called a recovering function of f in . Use to represent the set of all algorithms on K. If can be extended to a linear operator on the linearized set of K, we call the algorithm linear. Use to represent the set of all linear algorithms on the linearized set of K. The quantity
is called the minimum intrinsic error of the optimal recovery of the set K in the space X. Taking to replace in (13), and corresponding to this, we obtain , which we call the minimum linear intrinsic error. If K is a convex and centrally symmetric subset of X, then by ref. [11], the following inequality holds.
Let l be an even number, , similar to ref. [12], for every , and define the following differential operator
where is defined by
where . For , let
Let r be an even number, for any , and let
where . For any real number and , the function
is a univariate entire function of exponential type . is a multivariate entire function of spherical exponential type . Let
where (See ref. [13]).
Define
then, we have
Lemma 3.
For , let be an even number, when ; then, we have
Proof.
By the Minkowski inequality, we have
By ref. [12], we have
where for and for .
For (16), by the Minkowski inequality, we have
By ref. [12], it can easy to see that for , and for . So for , we have
The proof of the Lemma 3 is complete. □
For , let
where satisfies that , and its generalized Fourier transform is
Similar to the proof of Lemma 3, we obtain the following.
Let , and ; then, for every , there exists a constant such that
For , define as the set of all the entire functions of spherical exponential type ; then, we have the following.
Lemma 4.
Let , and, for almost all , there exists a constant such that
Proof.
By the definition of , we have
Because , it is easy to prove that
Theorem 2.
Let ; then,
Proof.
Let us complete the upper estimate first. For every , by ref. [5], in the sense of , f can be represented by the series that converges it; i.e., , , while the terms of series are an entire function of spherical exponential type such that
Let , for , let N be a natural number that satisfies , for , by (18) and Lemma 4, we have
and for , we have
Now, let us complete the lower estimate. For every , i.e.,
there exists a cube with the following form
such that its interior does not contain any point of , that is . Thus, it can be seen that . Let be the univariate function satisfing the following conditions: , for , for . For , let
where is a positive number to be determined. It is easy to see that , , and by ref. [1], we have
It is easy to see that
In addition, we have
By (30) and the definition of , we have
By (14), the proof of the Theorem is complete. □
Comparing refs. [10,14,15], the study of approximation problems in Orlicz spaces has potential application value and development prospect.
Author Contributions
Writing—original draft, X.L. and G.W.; Writing—review and editing, X.L. and G.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by the National Natural Science Foundation of China (11761055) and the Fundamental Research Funds for the Inner Mongolia Normal University (2023JBZD007).
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Jiang, Y.; Liu, Y. Average Widths and Optimal Recovery of Multivariate Besov Classes in Lp(Rd). J. Approx. Theory 2000, 102, 155–170. [Google Scholar] [CrossRef] [Scilit]
- Wu, C.; Wang, T. Orlicz Space and Its Applications; Heilongjiang Science and Technology Press: Harbin, China, 1983. (In Chinese) [Google Scholar]
- Sun, Y. Approximation Theory of Functions; Beijing Normal University Press: Beijing, China, 1989; Volume 1. (In Chinese) [Google Scholar]
- Pinkus, A. N-Widths in Approximation Theory; Springer: New York, NY, USA, 1985. [Google Scholar]
- Nikol’skii, S.M. Approximation of Functions of Several Variables and Imbedding Theorems; Springer: New York, NY, USA, 1975. [Google Scholar]
- Ding, Z. The sampling theorem, -approximation and ε-dimension. J. Approx. Theory 1992, 70, 1–15. [Google Scholar] [CrossRef] [Scilit]
- Wu, G. On approximation by polynomials in Orlicz spaces. Approx. Theory Its Appl. 1991, 7, 97–110. [Google Scholar] [CrossRef] [Scilit]
- Sun, Y.; Fang, G. Approximation Theory of Functions; Beijing Normal University Press: Beijing, China, 1990; Volume 2. (In Chinese) [Google Scholar]
- Liu, Y. Average σ–K width of class of smooth functions of Lpq(Rd) in Lq(Rd). Chin. Ann. Math. Ser. B 1995, 16, 351–360. [Google Scholar]
- Li, X.; Wu, G. Infinite Dimensional Widths and Optimal Recovery of a Function Class in Orlicz Spaces in L(R) Metric. J. Math. 2023, 2023, 6616280. [Google Scholar] [CrossRef] [Scilit]
- Traub, J.F.; Woźniakowski, H.A. A General Theory of Optimal Algorithms; Academic Press: New York, NY, USA, 1980. [Google Scholar]
- Samko, S.G. Spaces (Rn) and hypersingular integrals. Stud. Math. 1997, 61, 193–230. (In Russian) [Google Scholar]
- Liu, Y. Lq(Rd)-optimal recovery on the Reisz potential spaces with incomplete information. J. Beijing Norm. Univ. (Nat. Sci.) 1997, 33, 143–150. [Google Scholar]
- Romaniuk, A.S. On the best trigonimetric and bilinear approximations of anisotropic Besov function classes of many variables. Ukr. Mat. J. 1995, 47, 1097–1111. (In Russian) [Google Scholar]
- Rabab, E.; Badr, L.; Hakima, O. On some nonlinear elliptic problems in anisotropic Orlicz–Sobolev spaces. Adv. Oper. Theory 2020, 8, 24. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).