Next Article in Journal
Stability of the Exponential Type System of Stochastic Difference Equations
Previous Article in Journal
Generalization of Neural Networks on Second-Order Hypercomplex Numbers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Approximation Characteristics of Weighted p-Wiener Algebra

1
School of Science, Xihua University, Chengdu 610039, China
2
Graduate School, Xihua University, Chengdu 610039, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(18), 3974; https://doi.org/10.3390/math11183974
Submission received: 14 August 2023 / Revised: 10 September 2023 / Accepted: 15 September 2023 / Published: 19 September 2023

Abstract

:
In this paper, we study the approximation characteristics of weighted p-Wiener algebra A ω p T d for 1 p < defined on the d-dimensional torus T d . In particular, we investigate the asymptotic behavior of the approximation numbers, Kolmogorov numbers, and entropy numbers associated with the embeddings i d : A ω p T d A T d and i d : A ω p T d L q T d for 1 p , q < , where A T d is the Wiener algebra defined on the d-dimensional torus T d .
MSC:
06F20; 41A50; 41A52; 46A40

1. Introduction

The approximation numbers, Kolmogorov numbers, entropy numbers, and associated widths serve as fundamental components in the examination of stability, conditioning, approximation, and sensitivity properties pertaining to linear operators and matrices. These concepts have proven indispensable across various fields encompassing mathematics, numerical analysis, and scientific computing.
Within the context of Pitsch’s framework [1], the approximation numbers and Kolmogorov numbers were considered as the s-numbers and there were certain rules assigning to every operator a decreasing sequence of numbers which characterized their approximation or compactness properties in Banach space. Extensive research has been devoted to investigating the s-numbers and their associated widths. The approximation number, a measure of how effectively a linear operator or matrix can be approximated by a low-rank matrix, finds application in diverse areas such as data compression, signal processing, and image reconstruction. Achieving a smaller approximation numbers corresponds to a higher quality approximation. The Kolmogorov numbers characterize the rate at which singular values of a linear operator or matrix decay. These prove valuable in the analysis of stability and conditioning of numerical algorithms, particularly in tasks such as solving linear systems or computing eigenvalues.
In addition to the conventional s-numbers, entropy numbers, also known as pseudo s-numbers, offer a more refined approach to analyzing the sensitivity of operators. Entropy numbers are mathematical quantities employed to assess the complexity of function classes or sets by means of covering numbers, which are the estimate of the approximation achieved by a given set K through finite elements [2]. The theory of entropy numbers, as summarized by Pietsch [3], highlights their versatility as a tool for analyzing the complexity, approximation, and generalization properties of function classes, sets, and statistical models. Entropy numbers have various applications in functional analysis, approximation theory, statistical learning theory, and machine learning.
The width theory constitutes a central topic within function approximation theory, revolving around the pursuit of the most optimal approximation set and method in a certain sense, with a primary focus on quantifying the approximation error of sets in a normed space. Kolmogorov [4] originally introduced the concept of Kolmogorov width, which serves to characterize the best approximation error achievable by the “worst” element within a function class. Subsequently, Tikhomirov [5] extended this framework by introducing the notion of linear width, contributing to the comprehension of the trade-off between accuracy and complexity in various computational tasks. Additionally, the linear width offers valuable insights into the behavior of linear operators under diverse conditions. It is worth noting that the Kolmogorov widths, the linear widths, and the pseudo-widths correspond respectively to the Kolmogorov numbers, the approximation numbers, and the entropy numbers of the corresponding identity operators. These measures play a vital role in assessing the approximation properties of linear operators, enabling researchers to analyze and understand the behavior of various function classes and operators in the context of function approximation. For a comprehensive understanding of s-numbers and their associated widths, please refer to the following References [1,3,6,7,8,9], and for the details about entropy numbers, see References [3,10,11,12,13,14,15].
Owing to the exceptional characteristics exhibited by s-numbers and pseudo s-numbers, an extensive body of scholarly work has been dedicated to their comprehensive investigation, focusing particularly on estimating the asymptotic behavior of these quantities in diverse function spaces. Zhang et al. [16] conducted a study examining the asymptotic behavior of Gelfand, Kolmogorov, and Weyl numbers within Sobolev embeddings in weighted function spaces, specifically those of the Besov and Triebel–Lizorkin types, incorporating polynomial weights.
Wiener algebra refers to the set of all integrable functions with absolutely convergent Fourier series, which forms a Banach space equipped with a norm f A T d = : k Z d | f ^ ( k ) | . Cobos et al. [17] studied approximation numbers of embeddings of Sobolev spaces with mixed smoothness in the norm of · A T d . Byrenheid et al. [18] studied sample widths of multivariate periodic function classes in the norm of · A T d . Sickel et al. [19] established the accurate asymptotic behavior of the s-numbers associated with embeddings in weighted Wiener algebraic spaces. Their work facilitated a reduction of the approximation numbers and Kolmogorov numbers for bounded linear operators to the corresponding numbers for diagonal operators between sequences. In other words, they provided a profound insight into the relationship between the approximation characteristics of linear operators acting on function spaces and those acting on sequences, specifically diagonal operators. This analysis yielded valuable results regarding the asymptotic orders of these numbers and their interconnections within the context of weighted Wiener algebraic spaces.
These investigations contribute to our understanding of the asymptotic properties of s-numbers and pseudo s-numbers and provide valuable insights into their behavior in various functional and function space contexts. However, the estimation of s-numbers and pseudo s-numbers within the framework of weighted p-Wiener algebra remains an unexplored subject that has not yet been investigated. This paper builds upon prior research and delves into an investigation of the approximation properties of weighted p-Wiener algebras. Initially, we propose the concept of the weighted p-Wiener algebra, drawing upon the foundation laid by the classical Wiener algebra. Subsequently, we examine the asymptotic behavior of the approximation numbers, Kolmogorov numbers, and entropy numbers associated with the embeddings i d : A ω p ( T d ) A ( T d ) and i d : A ω p ( T d ) L q ( T d ) , where 1 p , q < . Additionally, we take inspiration from the work of Sickel et al. [19], which explored the asymptotic behavior of s-numbers related to the embeddings i d : A ω ( T d ) A ( T d ) and i d : A ω ( T d ) L 2 ( T d ) but only considered the cases where p = 1 and q = 2 .
The present paper is structured as follows. Section 2 introduces some preliminaries that will be employed throughout this study. Section 3 proceeds to present an exposition on the the approximation numbers, Kolmogorov numbers, and entropy numbers of embeddings of weighted p-Wiener algebra. Finally, Section 4 provides a concise summary of the findings and conclusions derived from this research endeavor.

2. Preliminaries

Let T d be the d-dimensional torus. It shows that the volume of T d is 1 when it is equipped with the probability measure ( 2 π ) d d x , and several related embeddings of operator norms equal to 1. Let L p ( T d ) be a classical p-th integrable Lebesgue space with the norm
f L p T d : = ( 2 π ) d T d | f ( x ) | p d x 1 / p , 1 p < , ess sup | f | , p = .
and let p Z d , 1 p , be a classical sequence space on Z d with the usual norm
x p Z d : = i = 1 | x i | p 1 / p , 1 p < , sup 1 < i < | x i | , p = .
For every function f L 1 ( T d ) , we define the Fourier transform as
f ^ ( x ) : = ( 2 π ) d T d f ( t ) e i t x d t ,
and f ^ ( k ) , k Z d denote the Fourier coefficients of f.
Note that L 2 ( T d ) is a Hilbert space with the orthonormal basis e i k x : k Z d . Therefore, it holds that, for every f L 2 ( T d ) ,
f L 2 ( T d ) 2 = ( 2 π ) d T d | f ( x ) | 2 d x = k Z d | f ^ ( k ) | 2 .
Let A ( T d ) denote the classical Wiener algebra defined as
A ( T d ) : = f L 1 ( T d ) : { f ^ ( k ) } 1 ( Z d ) .
Consider a sequence ω = { ω k } , where ω k > 0 for all k Z d . In this context, such a sequence is denoted as a “weight”. Additionally, let 1 / ω = { 1 / ω k } p p 1 ( Z d ) , for 1 < p < ; and 1 / ω = { 1 / ω k } ( Z d ) , for p = 1 . Under these conditions, we formally introduce the notion of the weighted p-Wiener algebra A ω p ( T d ) as
A ω p T d : = f L 1 T d : ω k f ^ ( k ) p Z d , 1 p < .
Note that A ω 1 T d : = A ω T d .
Remark 1.
For 1 p < , it is easy to prove that weighted p-Wiener algebra A ω p T d is a Banach space equipped with the norm f A ω p T d : = ω k f ^ ( k ) p Z d , and there exists the embedding of A ω p T d A T d .
In fact, for every function f belonging to the weighted p-Wiener algebra A ω p T d , the following inequality holds
{ f ^ ( k ) } 1 Z d = ω k f ^ ( k ) ω k 1 Z d ω k f ^ ( k ) p Z d · 1 ω p p 1 Z d ,
which implies that the sequence { f ^ ( k ) } 1 Z d . Consequently, we can deduce that f also belongs to the space A T d . As a result, we establish the existence of the embedding of A ω p T d A T d .
Now we recall definitions of the approximation numbers, Kolmogorov numbers, and entropy numbers of linear bounded operators as well as their associated properties, which will play a crucial role in our investigations.
Let X, Y be two Banach spaces and T be a linear bounded operators from X to Y and n N . Then the n-th approximation number of T is defined as
a n ( T ) = inf { T A : A L ( X , Y ) , rankA < n } ,
where L ( X , Y ) contains all linear bounded operators from X to Y.
The n-th Kolmogorov number of T is defined as
d n ( T ) = inf L n 1 sup x 1 inf y L n 1 T x y Y ,
where the left-most infimum is taken over all subspaces L n 1 in Y with the dimensional at most n 1 .
The n-th entropy number of linear bounded operator T is defined as
ε n ( T ) = inf r > 0 : T B X i = 1 2 n 1 B Y y i ; r , y 1 , , y 2 n 1 Y ,
where B X is the unit ball within the space X, while B Y y i ; r denotes the ball centered at y i with a radius of r within the space Y.
The n-th approximation number and the n-th Kolmogorov number of linear bounded operator T are consider as s-numbers and the n-th entropy number of linear bounded operator T is also named as pseudo s-number.
Convention: For the sake of brevity and clarity, we adopt the notation s n ( T ) in place of a n ( T ) , d n ( T ) , and ε n ( T ) throughout this work. Therefore, when we refer to s n ( T ) possessing certain properties x , y , z , it implies that these properties are applicable to all three quantities, namely, the approximation number, the Kolmogorov number, and the entropy number associated with the linear operator T.
The entropy numbers and s-numbers display a number of advantageous characteristics, especially the ideal property in the following lemma, which will be used to prove the main results. Further details on these properties can be found in the works of Pietsh [1,3], Milaré [14], Mayer [15], Dinh Dung [20], Temlyakov [21], and Belinsky [22].
Lemma 1
([1,3,21]). Let X, Y, X 0 , Y 0 be Banach spaces, R, S, T be linear operators satisfying T L X 0 , X , S L ( X , Y ) , R L Y , Y 0 , and m , n N . Then the approximation numbers, the Kolmogorov numbers, and the entropy numbers have the ideal property as
s n ( R S T ) R · s n ( S ) · T .
In this paper, it is assumed that the positive constants c, c 1 , c 2 depend solely on the parameters p , q , and d. For two positive functions a ( y ) and b ( y ) , y D , we employ the notations a ( y ) b ( y ) to indicate the existence of a constant c such that a ( y ) c · b ( y ) holds for all y in D, and a ( y ) b ( y ) to indicate the existence of constants c 1 and c 2 such that c 1 · b ( y ) a ( y ) c 2 · b ( y ) holds for all y in D.

3. The Estimation of the Approximation Numbers, Kolmogorov Numbers, and Entropy Numbers of Embeddings of Weighted p-Wiener Algebra

This section aims to explore two different cases of the approximation numbers, Kolmogorov numbers, and entropy numbers concerning weighted p-Wiener algebra, namely, s n i d : A ω p T d A T d and s n i d : A ω p T d L q T d , for 1 p , q < .

3.1. The Approximation Numbers, Kolmogorov Numbers, and Entropy Numbers of i d : A ω p T d A T d , 1 p <

As postulated earlier, the sequence ω k is considered to be a weight sequence. Additionally, we introduce the condition lim | k | 1 ω k = to ensure the compactness of certain embeddings of L q T d , 1 q < . Let σ n n N be the non-increasing rearrangement of the weight sequence 1 / ω k k Z d . It is evident that lim n σ n = 0 . Moreover, the rearranged sequence σ n n N holds significant importance in the estimation of the approximation numbers, Kolmogorov numbers, and entropy numbers.
The following lemma represents the exact order of the approximation numbers, Kolmogorov numbers, and entropy numbers of certain diagonal operators in classical sequence spaces, which is crucial for the proof of the main theorems in this paper.
Lemma 2
([3,23]). Let σ = σ i i N be a diagonal operator satisfying the condition of σ i being a non-increasing sequence.
(1) If 1 q < p and 1 / r = 1 / q 1 / p , then
a n σ : p N q N = d n σ : p N q N = i = n σ i r 1 / r .
(2) If 1 p = q , then
a n σ : p N q N = d n σ : p N q N = σ n .
(3) If p = 1 and q = 2 , then
a n σ : 1 N 2 N = d n σ : 1 N 2 Z d = sup h n h n + 1 i = 1 h σ i 2 1 / 2 .
(4) If 0 < p , q , sup i n σ i σ n · i n α < , for some α > max ( 1 / q 1 / p , 0 ) , then
ε n σ : p N q N n 1 / q 1 / p σ n .
Utilizing the ideal property of s-numbers and pseudo s-numbers, we are able to estimate the approximation numbers, Kolmogorov numbers, and entropy numbers of the operator i d : A ω p T d A T d , 1 p < . This estimation can be translated into terms of the approximation numbers, Kolmogorov numbers, and entropy numbers associated with the operator σ : p Z d 1 Z d , 1 p < , as elucidated in Lemma 2.
Theorem 1.
Let ω = ω k be a weight sequence and lim | k | 1 ω k = . Let the sequence σ n n N be the non-increasing rearrangement of the sequence 1 / ω k k Z d .
(1) If 1 < p < and 1 / r = 1 1 / p , then
a n i d : A ω p T d A T d = d n i d : A ω p T d A T d = i = n σ i r 1 / r ,
ε n i d : A ω p T d A T d n 1 / r σ n .
(2) If p = 1 and the sequence { σ n } satisfies the condition outlined in Lemma 2(4), then
ε n i d : A ω T d A T d σ n .
Proof. 
In order to investigate the approximation numbers, Kolmogorov numbers, and entropy numbers of the embeddings of weighted p-Wiener algebra for 1 p < , we consider the following commutative diagram firstly
A ω p T d i d A T d A B p Z d D ω 1 Z d
where the linear operators A : A ω p T d p Z d ,   D ω : p Z d 1 Z d and B : 1 Z d A T d are defined as
A f : = ω k f ^ ( k ) k Z d ; D ω ξ : = ξ k / ω k k Z d , ξ = ξ k k Z d p Z d ; B ξ ( x ) : = k Z d ξ k e i k x , x T d .
It is obvious that linear operators A and B are invertible, and the operator norm A = B = 1 . By employing the properties of the approximation numbers, Kolmogorov numbers, and entropy numbers outlined in Lemma 1, and considering the diagram (1) where i d = B D ω A , we can establish an upper bound for the approximation numbers, Kolmogorov numbers, and entropy numbers associated with the embedding of weighted p-Wiener algebra as
s n i d : A ω p T d A T d A · s n D ω : p Z d 1 Z d · B = s n D ω : p Z d 1 Z d .
On the other hand, we can modify the diagram as follows,
p Z d D ω 1 Z d A 1 B 1 A ω p T d i d A T d
Similarly, according to the ideal property of the approximation numbers, Kolmogorov numbers and entropy numbers in Lemma 1 and considering the diagram (4) where i d = B 1 D ω A 1 with A 1 = B 1 = 1 , we obtain the lower bound of the approximation numbers, Kolmogorov numbers, and entropy numbers of the embedding of weighted p-Wiener algebra as
s n D ω : p Z d 1 Z d A 1 · s n i d : A ω p T d A T d · B 1 = s n i d : A ω p T d A T d .
From inequalities (3) and (5) and σ n n N being the non-increasing rearrangement of ( 1 / ω k ) k Z d , we have
s n i d : A ω p T d A T d = s n D ω : p Z d 1 Z d = s n σ : p N 1 N .
If 1 < p < and 1 / r = 1 1 / p , then according to Lemma 2(1), Lemma 2(4), and Equation (6), we obtain
a n i d : A ω p T d A T d = d n i d : A ω p T d A T d = i = n σ i r 1 / r ,
and
ε n i d : A ω p T d A T d = ε n σ : p N 1 N n 1 / r σ n .
If p = 1 , then according to Lemma 2(4) and Equation (6), we obtain
ε n i d : A ω T d A T d = ε n σ : 1 N 1 N σ n .
Therefore, the conclusion of Theorem 1 is proved.  □
Remark 2.
Based on Sickel’s findings as presented in [19], it can be established that, in the case of p = 1 , the exact orders of the approximation numbers, Kolmogorov numbers, and entropy numbers of the embedding of weighted Wiener algebra corresponds precisely to σ n .
Corollary 1.
Let n N and Λ be an indicator set in Z d with the two properties:
(1) | Λ | = n 1 , where | Λ | is the cardinality of Λ.
(2) For k Λ and Λ , then ω ( k ) ω ( ) holds.
Then, for every f L 1 T d , the operator S Λ defined as S Λ f ( x ) : = k Λ f ^ ( k ) e i k x , is the optimal operator of the approximation number a n i d : A ω p T d A T d , and
a n i d : A ω p T d A T d = sup f A ω p T d 1 f S Λ f A T d .
Proof. 
For every f L 1 T d , according to the conditions (1) and (2), we have
f S Λ f A T d = k Z d \ Λ | f ^ ( k ) | sup Z d \ Λ 1 ω ( ) | | f | | A ω p T d = σ n | | f | | A ω p T d i = n σ i r 1 / r f A ω p T d , p > 1 , σ n | | f A ω p T d , p = 1 .
Based on the estimation of the approximation number a n i d : A ω p T d A T d in Theorem 1, we obtain
i d S Λ i = n σ i r 1 / r , p > 1 , σ n , p = 1 , = a n i d : A ω p T d A T d .
By the definition of the approximation number a n i d : A ω p T d A T d and inequality (7), we have
a n i d : A ω p T d A T d = sup f A ω p T d 1 f S Λ f A T d .
Therefore, the operator S Λ is the optimal operator and Corollary 1 is proved.  □

3.2. The Approximation Numbers, Kolmogorov Numbers, and Entropy Numbers of i d : A ω p T d L q T d , for 1 p , q <

In this section, we turn to discuss the approximation numbers, Kolmogorov numbers, and entropy numbers of i d : A ω p T d L q T d for 1 q < . To obtain a more precise estimation of the approximation numbers, Kolmogorov numbers, and entropy numbers of i d : A ω p T d L q T d , we undertake a comprehensive examination of the parameter q, partitioning it into three distinct scenarios for meticulous analysis: specifically, the cases where q = 2 , q > 2 , and q < 2 .
Case 1. q = 2 :
The subsequent theorem furnishes an estimation of the approximation numbers, Kolmogorov numbers, and entropy numbers of the operator i d : A ω p T d L q T d , for 1 p < , when q = 2 .
Theorem 2.
Let ω = ω k be a weight sequence and lim | k | 1 ω k = . Let the sequence σ n n N be the non-increasing rearrangement of the sequence 1 / ω k k Z d .
(1) If p = 1 or 2 p < , then we have
a n i d : A ω p T d L 2 T d = d n i d : A ω p T d L 2 T d = sup h n h n + 1 i = 1 h σ i 2 1 / 2 , p = 1 , σ n , p = 2 , i = n σ i r 1 / r , 2 < p < ,
where 1 / r = 1 / 2 1 / p .
(2) If 1 < p < 2 , then we derive both the upper and lower bounds of the approximation number and Kolmogorov number as
sup h n h n + 1 i = 1 h σ i 2 1 / 2 a n i d : A ω p T d L 2 T d = d n i d : A ω p T d L 2 T d σ n .
(3) If 1 p < , and the sequence { σ n } satisfies the condition outlined in Lemma 2(4), then we obtain
ε n i d : A ω p T d L 2 T d n 1 / 2 1 / p σ n .
Proof. 
In order to address the behavior of the approximation numbers, Kolmogorov numbers, and entropy numbers associated with the operator i d : A ω p T d L 2 T d , our approach entails establishing the embedding A ω p T d L 2 T d as an initial step.
If 1 p 2 , for every f A ω p T d , then
f ^ ( k ) 2 Z d f ^ ( k ) p Z d ω k f ^ ( k ) p Z d < ,
which indicates that A ω p T d L 2 T d , for 1 p 2 .
If p > 2 , for every f A ω p T d , we have 1 ω 1 + 1 p 1 Z d . Since 1 + 1 p 1 Z d 2 + 4 p 2 Z d , we have 1 ω 2 + 4 p 2 Z d . By the Hölder inequality, we obtain f L 2 T d , which shows that A ω p T d L 2 T d , for p > 2 .
Therefore, for 1 p < , the embedding of A ω p T d L 2 T d holds.
Now we turn to consider the diagram as follows
A ω p T d i d L 2 T d A B p Z d D ω 2 Z d
where A , D ω , and B are defined in (2) with A = 1 , B = 1 . From Lemma 1(4) and the diagram (8) with i d = B D ω A , we have
s n i d : A ω p T d L 2 T d A s n D ω : p Z d 2 Z d B = s n D ω : p Z d 2 Z d .
On the other hand, we consider the reverse direction diagram as
p Z d D ω 2 Z d A 1 B 1 A ω p T d i d L 2 T d
Similarly, from Lemma 1(4) and the diagram (9) with i d = B 1 D ω A 1 and A 1 = B 1 = 1 , we obtain the lower bound of the approximation numbers, Kolmogorov numbers, and entropy numbers of the embedding of weighted p-Wiener algebra as
s n D ω : p Z d 2 Z d A 1 s n i d : A ω p T d L 2 T d B 1 = s n i d : A ω p T d L 2 T d .
Thus, it is viable to transform the approximation number, Kolmogorov number, and entropy number associated with the mapping i d : A ω p T d L 2 T d into their counterparts for the mapping D ω : p Z d 2 Z d . This transformation enables a comprehensive examination and comparison between the numerical measures characterizing the embeddings of these two function spaces. Moreover, since σ n n N is the non-increasing rearrangement of ( 1 / ω k ) k Z d , we obtain this transformation relationship as
s n i d : A ω p T d L 2 T d = s n D ω : p Z d 2 Z d = s n σ : p N 2 N .
(1) When p = 1 or 2 p < , according to Lemma 2(1), (2), (3) and Equation (10), the approximation number and Kolmogorov number of i d : A ω p T d L 2 T d can be estimated as
a n i d : A ω p T d L 2 T d = d n i d : A ω p T d L 2 T d = sup h n h n + 1 i = 1 h σ i 2 1 / 2 , p = 1 , σ n , p = 2 , i = n σ i r 1 / r , 2 < p < ,
where 1 / r = 1 / 2 1 / p .
(2) When 1 < p < 2 , it holds that
A ω T d A ω p T d A ω 2 T d .
For any given functions f A ω T d and g A ω p T d , it can be ascertained that f A ω p T d f A ω T d , and similarly, g A ω 2 T d g A ω p T d . Then, it can be inferred that the unit balls B A ω T d , B A ω p T d , and B A ω 2 T d of the function spaces A ω T d , A ω 2 T d , and A ω p T d , respectively, exhibit the relationship B A ω T d B A ω p T d B A ω 2 T d .
Therefore, we can provide an upper bound and a lower bound for the approximation number and Kolmogorov number pertaining to the mapping i d : A ω p T d L 2 T d as
s n i d : A ω T d L 2 T d s n i d : A ω p T d L 2 T d s n i d : A ω 2 T d L 2 T d .
Finally, from
a n i d : A ω T d L 2 T d = d n i d : A ω T d L 2 T d = sup h n h n + 1 i = 1 h σ i 2 1 / 2 ,
see ([19], Theorem 3.3), Equation (11) and Inequality (13), we obtain
sup h n h n + 1 i = 1 h σ i 2 1 / 2 a n i d : A ω p T d L 2 T d = d n i d : A ω p T d L 2 T d σ n .
(3) When 1 p < , from Lemma 2(4) and Equation (10), the entropy number can be estimated as
ε n i d : A ω p T d L 2 T d n 1 / 2 1 / p σ n .
Consequently, the proof of Theorem 2 is hereby established.  □
Case 2. q 2 :
The subsequent theorems aim to establish the order of the approximation numbers, Kolmogorov numbers, and entropy numbers pertaining to the operator i d : A ω p T d L q T d , concerning the cases where 2 < q < and 1 q < 2 , respectively.
Theorem 3.
Let ω = ω k be a weight sequence and lim | k | 1 ω k = . Let the sequence σ n n N be the non-increasing rearrangement of the sequence 1 / ω k k Z d .
For 2 < q < , 1 / r 1 = 1 / 2 1 / p and 1 / r 2 = 1 1 / p ,
(1) the approximation number and Kolmogorov number pertaining to the operator i d : A ω p T d L q T d can be estimated as
(i) if p = 1 , then
sup h n h n + 1 i = 1 h σ i 2 1 / 2 a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d σ n ;
(ii) if 1 < p < 2 , then
sup h n h n + 1 i = 1 h σ i 2 1 / 2 a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d i = n σ i r 2 1 / r 2 ;
(iii) if p = 2 , then
σ n a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d i = n σ i r 2 1 / r 2 ;
(iv) if 2 < p < , then
i = n σ i r 1 1 / r 1 a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d i = n σ i r 2 1 / r 2 .
(2) if the sequence { σ n } satisfies the condition outlined in Lemma 2(4), then the entropy number pertaining to the operator i d : A ω p T d L q T d can be estimated as
n 1 / 2 1 / p σ n ε n i d : A ω p T d L q T d n 1 1 / p σ n ,
for 1 p < .
Proof. 
For 2 < q < , 1 < p < , from Equation (12), Remark 1, and (Reference [19] Theorem 3.6), we obtain the following chain of embeddings
A ω T d A ω p T d A T d L T d L q T d L 2 T d .
Thus, it holds that
s n i d : A ω p T d L 2 T d s n i d : A ω p T d L q T d s n i d : A ω p T d L T d .
Then, from Equation (14) and Theorem 2, we obtain the lower bound of the approximation numbers, Kolmogorov numbers, and entropy numbers as
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d sup h n h n + 1 i = 1 h σ i 2 1 / 2 , 1 p < 2 , σ n , p = 2 , i = n σ i r 1 1 / r 1 , 2 < p < ,
and
ε n i d : A ω p T d L q T d n 1 / 2 1 / p σ n .
For the upper bound of Theorem 3, from Equation (14), we have
s n i d : A ω p T d L q T d s n i d : A ω p T d L T d i d : A T d L T d · s n i d : A ω p T d A T d = s n i d : A ω p T d A T d .
Then, based on the result of Theorem 1, Reference [19], and Equation (15), we obtain the upper bound of the approximation numbers, Kolmogorov numbers, and entropy numbers as
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d σ n , p = 1 , i = n σ i r 2 1 / r 2 , 1 < p < ,
and
ε n i d : A ω p T d L q T d n 1 1 / p σ n .
Finally, we obtain the desired results of Theorem 3.  □
Theorem 4.
Let ω = ω k be a weight sequence and lim | k | 1 ω k = . Let the sequence σ n n N be the non-increasing rearrangement of the sequence 1 / ω k k Z d . Then, for 1 q < 2 , 1 / q + 1 / q = 1 , r 1 = 1 / 2 1 / p , r 2 = 1 / q 1 / p , and the sequence { σ n } for estimating the entropy number satisfies the condition outlined in Lemma 2(4),
(1) the upper bound of the approximation number, Kolmogorov number, and entropy number pertaining to the operator i d : A ω p T d L q T d can be estimated as
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d sup h n h n + 1 i = 1 h σ i 2 1 / 2 , p = 1 , σ n , 1 < p 2 , i = n σ i r 1 1 / r 1 , 2 < p < ,
and
ε n i d : A ω p T d L q T d n 1 / 2 1 / p σ n .
(2) the lower bound of the approximation number, Kolmogorov number, and entropy number pertaining to the operator i d : A ω p T d L q T d can be estimated as
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d σ n , 2 < p = q < , i = n σ i r 2 1 / r 2 , 2 < q < p < ,
and
ε n i d : A ω p T d L q T d n 1 / q 1 / p σ n .
Proof. 
For 1 q < 2 , we consider the following chain of embedding
L 2 T d L q T d .
When 1 p < , we obtain
s n i d : A ω p T d L q T d s n i d : A ω p T d L 2 T d .
From the results of Theorem 2 and Equation (16), we can estimate the upper bound of the approximation number, Kolmogorov number, and entropy number as
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d sup h n h n + 1 i = 1 h σ i 2 1 / 2 , p = 1 , σ n , 1 < p 2 , i = n σ i r 1 1 / r 1 , 2 < p < ,
and
ε n i d : A ω p T d L q T d n 1 / 2 1 / p σ n .
Subsequently, we turn to estimate the lower bound of Theorem 4.
When 1 q < 2 and q denotes the conjugate index of q, satisfying 1 / q + 1 / q = 1 , it is obvious that 1 q < 2 < q , and { f ^ ( k ) } q Z d { f ^ ( k ) } q Z d holds.
For every f L q T d , the Hausdorff–Young inequality [see [24], Theorem 3.2.2] establishes that the sequence of Fourier coefficients of f belongs to the sequence space q Z d , and it further satisfies the inequality:
{ f ^ ( k ) } q Z d f L q T d .
We consider the following diagram
p Z d D ω q Z d A 1 B 1 1 A ω p T d i d L q T d
where A, D ω are defined as in (2) with A = A 1 = 1 , and B 1 is defined as
( B 1 ξ ) ( x ) : = k Z d ξ k e i k x , x T d .
Thus, from Equation (17), we obtain B 1 1 1 .
From Lemma 1 and i d = B 1 1 D ω A 1 with A 1 = B 1 1 = 1 , we have
s n D ω : p Z d q Z d A 1 s n i d : A ω p T d L q T d B 1 1 s n i d : A ω p T d L q T d .
Finally, when 2 < q < p < , from Lemma 2(1), Lemma 2(2), and Equation (19), we obtain
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d i = n σ i r 2 1 / r 2 .
When 2 < q = p < , from Lemma 2(2) and Equation (19), we obtain
a n i d : A ω p T d L q T d = d n i d : A ω p T d L q T d σ n .
Therefore, results of Theorem 4 are obtained.  □
Remark 3.
Theorems 3 and 4 present upper and lower bound estimates for the approximation number, Kolmogorov number, and entropy number associated with the operator i d : A ω p T d L q T d as for 2 < q < ,
s n i d : A ω p T d L 2 T d s n i d : A ω p T d L q T d s n i d : A ω p T d A T d ,
and for 1 q < 2 ,
s n D ω : p Z d q Z d s n i d : A ω p T d L q T d s n i d : A ω p T d L 2 T d .
Therefore, for q 2 , we can not estimate the exact order of the approximation number, Kolmogorov number, and entropy number pertaining to the operator i d : A ω p T d L q T d , and alternative estimation methods are required to address the exact estimates.

4. Conclusions

Approximation numbers, Kolmogorov numbers, and entropy numbers, often referred to as s-numbers or pseudo s-numbers, are important concepts in the field of functional analysis. They are indispensable in various fields such as mathematics, numerical analysis, and scientific computing. In this paper, we propose the concept of the weighted p-Wiener algebra and examine the asymptotic behavior of the approximation number, Kolmogorov number, and entropy number associated with the embeddings i d : A ω p ( T d ) A ( T d ) and i d : A ω p ( T d ) L q ( T d ) , where 1 p , q < .
In the context of mathematical analysis and machine learning, approximation numbers, Kolmogorov numbers, and entropy numbers serve as fundamental theoretical tools that facilitate a more profound comprehension of approximation and complexity in mathematical entities. The notion of s-numbers is intrinsically linked to sparsity and, consequently, holds relevance in the investigation of sparse representations within the realm of machine learning, encompassing domains like compressed sensing and sparse coding. Additionally, the application of entropy numbers in data compression scenarios assumes significance given their pivotal role in machine learning algorithms. These numbers furnish a quantification of the efficacy with which a dataset can be compressed, thereby gaining significance when handling voluminous datasets or devising streamlined data representation methodologies. The implications of these theoretical constructs extend to diverse aspects of machine learning, including algorithm design, error analysis, regularization, and comprehension of the generalization performance exhibited by various machine learning methodologies. As part of our future endeavors, we shall delve further into exploring these aforementioned implications and their practical applications within the machine learning domain.

Author Contributions

Conceptualization, Y.X.; Methodology, Y.C.; Writing—original draft, X.P.; Writing—review and editing, G.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Talent Introduction Project in Xihua University (No. RX2200002007).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pietsch, A. Eigenvalues and s-Numbers; Cambridge University Press: Cambridge, UK, 1987. [Google Scholar]
  2. Mitjangin, B.S. Approxmative dimension and bases in nuclear spaces. Usp. Mat. Nauk. 1961, 16, 63–132. [Google Scholar]
  3. Pietsch, A. Operator Ideals; North-Holland: Amsterdam, The Netherlands, 1980. [Google Scholar]
  4. Kolmogorov, A. Über die beste Annäherung von Funktionen einer Funktionklasse. Ann. Math. 1936, 37, 107–111. [Google Scholar] [CrossRef]
  5. Tikhomirov, V. Widths of sets in function spaces and the theory of best approximations. Uspekhi Mat. Nauk. 1960, 15, 81–120. [Google Scholar]
  6. Pietsch, A. s-numbers of operators in Banach spaces. Studia Math. 1974, 51, 201–223. [Google Scholar] [CrossRef]
  7. Pietsch, A. History of Banach Spaces and Linear Operators; Birkhäuser: Basel, Switzerland, 2007. [Google Scholar]
  8. Pinkus, A. N-Widths in Approximation Theory; Springer: Berlin/Heidelberg, Germany, 1985. [Google Scholar]
  9. Lang, J.; Musil, V. Strict s-numbers of non-compact Sobolev embeddings into continuous functions. Constr. Approx. 2019, 50, 271–291. [Google Scholar] [CrossRef]
  10. Oloff, R. Entropieeigenschaften von Diagonal operatoren. Math. Nachr. 1978, 86, 157–165. [Google Scholar] [CrossRef]
  11. Carl, B.; Stephani, I. Entropy, Compactness and the Approximation of Operators. Cambridge Tracts in Mathematics; Cambridge University Press: Cambridge, UK, 1990; Volume 98. [Google Scholar]
  12. Edmunds, D.E.; Triebel, H. Function Spaces, Entropy Numbers, Differential Operator. Cambridge Tracts in Mathematics; Cambridge University Press: Cambridge, UK, 1996; Volume 120. [Google Scholar]
  13. DeVore, R.A.; Lorentz, G.G. Constructive Approximation; Springer: Berlin/Heidelberg, Germany, 1993. [Google Scholar]
  14. Milaré, J.; Tozoni, S.A. Estimates for entropy numbers of multiplier operators of multiple series. J. Math. Anal. Appl. 2022, 530, 127733. [Google Scholar]
  15. Mayer, S.; Tino, U. Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness. Constr. Approx. 2021, 53, 249–279. [Google Scholar] [CrossRef]
  16. Zhang, S.; Fang, G.; Huang, F. Some s-numbers of embeddings in function spaces with polynomial weights. J. Complex. 2014, 30, 514–532. [Google Scholar] [CrossRef]
  17. Cobos, F.; Kühn, T.; Sickel, W. Optimal approximation of Sobolev functions in the sup-norm. J. Funct. Anal. 2016, 270, 4196–4212. [Google Scholar] [CrossRef]
  18. Byrenheid, G.; Kämmerer, L.; Ullrich, T.; Volkmer, T. Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. Numer. Math. 2017, 136, 4196–4212. [Google Scholar]
  19. Sickel, W. s-numbers of embeddings of weighted Wiener algebras. J. Approx. Theory 2022, 279, 105745. [Google Scholar]
  20. Dinh, D. Non-linear approximations using sets of finite cardinality or finite pseudo-dimension. Constr. Approx. 2001, 17, 467–492. [Google Scholar]
  21. Temlyakov, V.N. Estimates of the asymptotic characteristics of classes of functions with bounded mixed derivative of difference. Trudy Mat. Inst. Steklov. 1989, 189, 138–167. [Google Scholar]
  22. Belinsky, E.S. Estimates of entropy numbers and Gaussian measures for classes of functions with bounded mixed derivative. J. Approx. Theory 1998, 93, 114–127. [Google Scholar] [CrossRef]
  23. Kühn, T. Entropy numbers of general diagonal operators. Rev. Math. Complut. 2005, 18, 479–491. [Google Scholar] [CrossRef]
  24. Grafakos, L. Classical Fourier Analysis; Springer: New York, NY, USA, 2008; Volume 2. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Chen, Y.; Pan, X.; Xu, Y.; Chen, G. The Approximation Characteristics of Weighted p-Wiener Algebra. Mathematics 2023, 11, 3974. https://doi.org/10.3390/math11183974

AMA Style

Chen Y, Pan X, Xu Y, Chen G. The Approximation Characteristics of Weighted p-Wiener Algebra. Mathematics. 2023; 11(18):3974. https://doi.org/10.3390/math11183974

Chicago/Turabian Style

Chen, Ying, Xiangyu Pan, Yanyan Xu, and Guanggui Chen. 2023. "The Approximation Characteristics of Weighted p-Wiener Algebra" Mathematics 11, no. 18: 3974. https://doi.org/10.3390/math11183974

APA Style

Chen, Y., Pan, X., Xu, Y., & Chen, G. (2023). The Approximation Characteristics of Weighted p-Wiener Algebra. Mathematics, 11(18), 3974. https://doi.org/10.3390/math11183974

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

Article Metrics

Back to TopTop