Next Article in Journal
Riemann Solitons on a Spacetime with the Spatially Homogeneous Rotating Metric
Next Article in Special Issue
On Sawyer Duality in One and Higher Dimensions
Previous Article in Journal
Research on Dimensional Reduction Methods for Incomplete Data Labeling Based on Maximal Consistent Blocks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Matrix Transformations of Generalized Almost Convergent Double Sequences

1
Department of Mathematics, Tallinn University, Narva mnt. 29, 10120 Tallinn, Estonia
2
Department of Mathematics, Usak University, 64200 Usak, Turkey
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(4), 247; https://doi.org/10.3390/axioms15040247
Submission received: 29 January 2026 / Revised: 17 March 2026 / Accepted: 20 March 2026 / Published: 25 March 2026
(This article belongs to the Special Issue Theory and Applications in Functional Analysis)

Abstract

In this paper, we study matrix transformations on spaces of generalized almost convergent double sequences with powers. Extending classical results of Lorentz, Maddox, and Nanda, we characterize several classes of infinite matrices that map between Maddox’s double sequence spaces and spaces of almost convergent (to zero) double sequences with powers. Our results generalize earlier characterizations for single sequence spaces obtained by the authors in previous work, providing a structured framework for studying summability and convergence in higher dimensions.

1. Introduction

Matrix transformations of sequence spaces constitute a classical and well-developed topic in summability theory and functional analysis. Given an infinite matrix A = ( a n k ) , such transformations describe linear operators acting on sequences via series of the form
( A x ) n = k a n k x k ,
and their boundedness properties characterize how different modes of convergence and summability are preserved under linear mappings. Significant contributions in this direction include the works of Toeplitz, Lorentz, Maddox, and Nanda, among others [1,2,3,4,5].
In many applied and computational contexts, one naturally encounters two-dimensional (or, more generally, multidimensional) discrete data, such as images and signals sampled on a grid, finite-difference/finite-element discretizations of partial differential equations, and matrices of coefficients arising in bilinear transforms. In such settings the behavior of discrete operators is governed by their action on double sequences rather than on single sequences. This motivates a systematic study of the summability and stability properties of operators acting on double sequences, particularly matrix transformations between double sequence spaces with nonuniform (position-dependent) growth conditions.
In recent decades, this theory has been extended to generalized sequence spaces with variable exponents and to almost convergent sequences. However, the corresponding results for double sequences and, in particular, for matrix transformations acting between generalized almost convergent double sequence spaces, remain relatively limited. The present paper contributes to this line of research by providing complete characterizations of four-dimensional matrix transformations between such spaces.
The concept of almost convergence, introduced by Lorentz ([2]), has played an important role in summability theory and the study of sequence spaces. Unlike ordinary convergence, almost convergence captures limiting behavior through uniform Cesàro-type averages and allows meaningful limits for sequences that fail to converge in the classical sense. Over the years, this notion has been extended and refined in various directions, including generalized almost convergence and matrix transformations between sequence spaces.
Intuitively, the ‘almost limit’ of a double sequence is obtained by averaging over growing rectangular blocks in a way that is uniform with respect to shifts in the averaging window. Convergence of these two-dimensional Cesàro means expresses a robustness of the limit under local perturbations and translations of the indexing grid; thus, almost convergence detects a global averaged stability rather than pointwise behavior. In formulas, the means t m n r s ( x ) (defined below) serve exactly this averaging purpose: the requirement that t m n r s ( x ) converge uniformly in the shift indices ( r , s ) formalizes the idea that the averaged value is insensitive to finite local translations.
Parallel to these developments, the study of double sequences has gained increasing attention due to their relevance in approximation theory, numerical analysis, summability methods, and multidimensional functional analysis. Double sequences naturally arise, for example, in discretizations of functions of several variables, in iterative schemes, and in the study of series and transforms indexed by multiple parameters. Consequently, extending convergence concepts from single sequences to double sequences is both natural and necessary.
Generalized almost convergence for double sequences provides a flexible framework that unifies several summability methods and allows for finer control over limiting processes. In particular, it enables the study of convergence behavior under multidimensional averaging procedures and matrix transformations that cannot be captured by classical convergence alone. Matrix transformations play a central role in this context, as they provide a powerful tool for describing how summability properties are preserved or altered under linear operators.
The aim of this paper is to study matrix transformations between spaces of generalized almost convergent double sequences and double sequence spaces with variable exponents. Extending earlier results for single sequences, we establish the necessary and sufficient conditions under which infinite matrices define bounded linear operators between these spaces. The obtained results generalize previous theorems by the authors to the two-dimensional setting.
To characterize matrix transformations involving almost convergent (to 0) sequences with powers in [6], the authors used matrix transformations involving convergent (to 0) sequences with powers mainly considered in [7]. To characterize matrix transformations involving almost convergent (to 0) double sequences with powers, we will use the mentioned results for single almost convergent (to 0) sequences with powers; matrix transformations involving convergent (to 0) double sequences with powers (see [8,9]), and the reduction method of matrix maps from a sequence space to a double sequence space to matrix maps between sequence spaces as described in [10].
First, we introduce the necessary notions and notation for the paper. We begin with notions and notation pertaining to sequence spaces.
Let X , Y be two nonempty subsets of the space ω of all complex (or real) sequences, and let A = ( a n k ) be an infinite matrix of complex (or real) numbers. For every x = ( x k ) X and every n N , we write
[ A x ] n = k a n k x k .
We say that A ( X , Y ) if and only if A x : = ( [ A x ] ) n Y whenever x X . One can see that for a given n N , for [ A x ] n to exist for every x X , the sequence ( a n k ) k must belong to
X β = ( y k ) ω | k x k y k converges for every x X .
Let p = ( p k ) be a sequence of strictly positive numbers. The following variable exponent spaces were defined by Maddox ([3]) and Nakano ([11]):
c 0 ( p ) = { ( x k ) ω | | x k | p k 0 } , c ( p ) = { ( x k ) ω | | x k l | p k 0 for some l } , ( p ) = { ( x k ) ω | k | x k | p k < } , ( p ) = { ( x k ) ω | sup k | x k | p k < } .
When all terms of ( p k ) are constant and equal to p > 0 , we have ( p ) = p , ( p ) = , c ( p ) = c , and c 0 ( p ) = c 0 , where p , , c, c 0 are the spaces of p-summable, bounded, convergent, and null sequences, respectively.
Note that (Theorem 6 in [12], Theorem 2 in [13])
c 0 ( p ) β = M 0 ( p ) = N N ( y k ) : k | y k | N 1 / p k < , M 0 ( p ) β = N N ( y k ) : sup k | y k | N 1 / p k <
and (Theorem 2 in [14])
( p ) β = M ( p ) = N N ( y k ) : k | y k | N 1 / p k < .
Now we introduce the notions and notation for double sequence spaces.
Let e be the double sequence with all elements equal to 1, and let e k l be the double sequence with the ( k , l ) -th element equal to 1 and all others equal 0 ( k , l N ) . By an index sequence ( m i ) , we mean an increasing sequence of integers.
A double sequence x = ( x k l ) of real or complex numbers is said to converge to the limit a in Pringsheim’s sense (shortly, p-converge to a) if
ε > 0 N N : k , l > N x k l a < ε .
Let Ω denote the linear space of all double sequences. Linear subspaces of Ω are called double sequence spaces.
For any notion of convergence ν , the space of all ν -convergent double sequences will be denoted by C ν and the limit of a ν -convergent double sequence x by ν lim m , n x m n . The sum of a double series k , l x k l is defined by ν k , l x k l : = ν lim m , n k = 1 m l = 1 n x k l whenever k = 1 m l = 1 n x k l m , n C ν . In the case of regular convergence, we skip the prefix ν -. We consider the following double sequence spaces:
M u : = x Ω | sup k , l | x k l | < , C ν 0 : = x Ω | ν lim m , n x m n = 0 ( ν { p , b p , r } ) , B S : = ( x k l ) Ω : sup m , n | k , l = 1 m , n x k l < } , C S ν : = x Ω | k , l = 1 m , n x k l m , n C ν ( ν { p , b p , r } ) , B V : = { ( x k l ) Ω : k , l | Δ ( 11 ) x k l | < , k N : l | Δ ( 01 ) x k l | < , l N : k | Δ ( 10 ) x k l | < } .
where
Δ ( 10 ) x k l : = x k l x k + 1 , l , Δ ( 01 ) x k l : = x k l x k , l + 1 , Δ ( 11 ) x k l : = x k l x k , l + 1 x k + 1 , l + x k + 1 , l + 1 .
Given a double sequence space E, we define its α - and β ( ν ) -dual by
E α : = u Ω : k , l | u k l x k l | < , x E , E β ( ν ) : = u Ω : ν k , l u k l x k l exists for each x E ,
where ν { p , b p , r } . For other notions and notations in the area of double sequences, we refer the reader to [15].
In [16], the authors showed that
B V β ( ν ) = D 1 D 2 ν ,
where
D 1 : = u Ω | sup k , l , m , n i , j = k , l m , n u i j < , D 2 ν : = u Ω | k , l N ν lim m , n i , j = k , l m , n u i j ( ν { p , b p , r } ) .
It can be easily shown that u D 1 if and only if u B S , and u D 2 ν if and only if u C S r ( ν { p , b p , r } ) . Since C S r B S , it follows that
B V β ( ν ) = C S r .
Let p = ( p k l ) be a double sequence of strictly positive numbers. We consider the following double sequence spaces with powers:
M u ( p ) : = x Ω | ( | x k l | p k l ) M u , C ν 0 ( p ) : = x Ω | ( | x k l | p k l ) C ν 0 ( ν { p , b p } ) , C r 0 ( p ) : = { x C p 0 ( p ) | l N : ( x k l ) k c ( ( p k l ) k ) and k N : ( x k l ) l c ( ( p k l ) l ) } , C ν ( p ) : = x Ω | a K : ( x k l a ) C ν 0 ( p ) ( ν { p , b p , r } ) , L u ( p ) : = { ( x k l ) Ω | k , l | x k l | p k l < } .
Most of these spaces were defined and studied by Gökhan and Çolak in [17,18,19]. In the proofs, we will use the representation ([8]):
C p 0 ( p ) = N x Ω : ( | x k l | N 1 / p k l ) C p 0 .
In [8], the authors verified that
C p 0 ( p ) α = C p 0 ( p ) β ( ν ) = M 0 p ( p ) : = M 0 2 ( p ) ( y k l ) : l N : ( y k l ) k φ , k N : ( y k l ) l φ ,
where
M 0 2 ( p ) : = N N { ( y k l ) : k , l | y k l | N 1 / p k l < } ,
and in [18] that
M u ( p ) α = M u ( p ) β ( ν ) = M 2 ( p ) : = N N ( y k l ) : k , l | y k l | N 1 / p k l < .
Let A = ( a m n k l ) be any four-dimensional scalar matrix and let ν be some convergence notion for double sequences. We define
Ω A ( ν ) : = x Ω | m , n N : [ A x ] m n : = ν - k , l a m n k l x k l exists .
The map
A : Ω A ( ν ) Ω , x A x : = [ A x ] m n m , n
is called a matrix map of type ν . We use the notation A ( X , Y ) ν if and only if A is a matrix map of type ν and A x Y whenever x X . If X β ( p ) = X β ( b p ) = X β ( r ) (for example, X is solid), we use the notation A ( X , Y ) .
In addition, if X is a double sequence space, Y is a single sequence space and B = ( b n k l ) is a three-dimensional matrix, we use the notation B ( X , Y ) ν if and only if
x ω B ( ν ) : = y Ω | B y : = ν k , l b n k l y k l n exists
and B x Y whenever x X . As before if X β ( p ) = X β ( b p ) = X β ( r ) (for example if X is solid), we use the notation B ( X , Y ) .
If X is a sequence space, Y is a double sequence space and B = ( b m n k ) is a three-dimensional matrix, we use the notation B ( X , Y ) if and only if
x Ω B : = y ω | B y : = ( k b m n k y k ) m , n exists
and B x Y whenever x X .
We set
t m n r s ( x ) = 1 m + 1 1 n + 1 i = 0 m j = 0 n x r + i , s + j ( m , n , r , s N )
and note that
t m n r s ( A x ) = ν k , l a ( m , n , r , s , k , l ) x k l ,
where
a ( m , n , r , s , k , l ) = 1 m + 1 1 n + 1 i = 0 m j = 0 n a r + i , s + j , k , l ( m , n , r , s , k , l N ) .
We consider generalizations of the spaces of all almost convergent double sequences defined by Móricz and Rhoades [20]:
F p = { ( x k l ) Ω : lim m , n t m n r s ( x ) exists uniformly in r , s }
and of all almost convergent to 0 double sequences
F 0 p = { ( x k l ) Ω : lim m , n t m n r s ( x ) = 0 uniformly in r , s }
with indexes:
F p ( p ) = { ( x k l ) Ω : lim m , n | t m n r s ( x l e ) | p m n = 0 for some l uniformly in r , s }
and
F 0 p ( p ) = { ( x k l ) Ω : lim m , n | t m n r s ( x ) | p m n = 0 uniformly in r , s } .
The following inclusions hold for these spaces.
Lemma 1. 
Let p , q be bounded positive double sequences such that 0 < p k l q k l ( k , l N ) . Then, the following apply:
(a) 
F 0 p ( p ) F 0 p ( q ) .
(b) 
F p ( p ) F p ( q ) .
Proof. 
We prove part (b); part (a) follows by the same argument with l = 0 . Let x F p ( p ) and let l be a number such that
lim m , n | t m n r s ( x l e ) | p m n = 0 uniformly in r , s .
Then | t m n r s ( x l e ) | p m n < 1 for sufficiently large m , n , so | t m n r s ( x l e ) | < 1 for sufficiently large m , n , and since 0 < p m n q m n , we have
| t m n r s ( x l e ) | q m n | t m n r s ( x l e ) | p m n 0 uniformly in r , s .
As in the case of single sequences, almost every convergent double sequence is bounded ([20]). The inclusion F p ( p ) M u ( p ) does not hold in general. Set p k 1 : = k , p k l : = 1 ( l 1 ) , and x k l : = ( 1 ) k + l 2 ( k , l N ) . x k l : = ( 1 ) k + l 2 ( k , l N ) . Then ( x k l ) F p ( p ) M u ( p ) . The following lemma demonstrates that F p ( p ) M u ( p ) holds when p is bounded.
Lemma 2. 
Let p be a bounded positive double sequence. Then F p ( p ) M u M u ( p ) .
Proof. 
Let P : = sup k , l p k l and x F p ( p ) . Then we also have x F p ( p ˜ ) , where p ˜ k l : = p k l / P ( k , l N ) . Hence, by Lemma 1, x F p ( e ) = F p M u . Therefore, by Theorem 1 (ii) in [18], x M u M u ( p ) . □
In [6], we characterized the classes of two-dimensional matrices ( E , F ) where F { f 0 ( q ) , f ( q ) } and E { c 0 ( p ) , c ( p ) , ( p ) , M 0 ( p ) , ( p ) , b v } .
In this paper, we will generalize these results to the corresponding double sequence spaces and four-dimensional matrices. More precisely, we will give the conditions for the classes of matrices ( E , F ) ν where F { F 0 p ( q ) , F p ( q ) } and
E C p 0 ( p ) , C p ( p ) , M u ( p ) , M 0 2 ( p ) , L u ( p ) , B V .
Although the present work is mainly theoretical, the obtained results are closely related to several topics in matrix analysis and numerical linear algebra (see, for example, [21,22]). In particular, condition numbers quantify the sensitivity of solutions of linear systems and inverse problems with respect to data perturbations, which is directly connected to the boundedness and stability properties of the associated operators (see [23,24]). In this sense, infinite matrix transformations acting between generalized almost convergent double sequence spaces can be viewed as abstract models of discrete operators arising in numerical approximations, where stability plays a central role.
Moreover, generalized inverses, including the Moore–Penrose inverse and its weighted variants, as well as regularization techniques such as Tikhonov regularization, are fundamental tools in the analysis of ill-posed problems. The matrix transformation results established in this paper may, therefore, support further investigations of stability and robustness in regularized inverse problems.
It is worth noting that several results related to the summability and convergence of sequences can also be formulated within the general framework of ideal convergence (see [25] for the definition). While this approach provides a broad and unifying perspective, the present work focuses on generalized almost convergence, which is particularly well suited for obtaining explicit characterizations of infinite matrix transformations. This setting allows us to derive concrete operator conditions and matrix criteria that are less transparent in a purely ideal-theoretic formulation.
Furthermore, although the present study is connected to earlier works on almost convergence and matrix transformations, it is not merely a marginal modification of known results. The extension to generalized almost convergent double sequence spaces and to four-dimensional matrix transformations introduces substantial technical and conceptual differences that do not follow directly from the one-dimensional setting studied in [6]. In particular, the interaction between two-dimensional index structures and higher-dimensional matrices leads to new boundedness conditions and transformation criteria that do not follow directly from the one-dimensional setting.

2. Main Results

In what follows, we assume that p = ( p k l ) and q = ( q k l ) are bounded double sequences of strictly positive numbers. The boundedness of the exponent sequences p = ( p k l ) , q = ( q k l ) is essential, since otherwise the set of almost convergent (to 0) double sequences with powers may fail to be linear. We also follow the order of the results in [6].
Example 1. 
Let p k l = k + l and consider the constant double sequence x = ( x k l ) defined by x k l = 1 2 for all k , l N . Then for every m , n , r , s N , we have
t m n r s ( x ) = 1 m + 1 1 n + 1 i = 0 m j = 0 n 1 2 = 1 2 .
Since p m n = m + n as m , n , it follows that
| t m n r s ( x ) | p m n = 1 2 p m n 0 ,
uniformly in r , s . Hence, x F 0 p ( p ) . On the other hand, for the sequence 2 x , we obtain t m n r s ( 2 x ) = 1 , and therefore
| t m n r s ( 2 x ) | p m n = 1 p m n = 1   /   0 .
Thus, 2 x F 0 p ( p ) . Consequently, when the exponent sequence p = ( p k l ) is unbounded, the space F 0 p ( p ) is not closed under scalar multiplication and therefore need not be linear.
To characterize matrices in ( C p 0 ( p ) , F 0 p ( q ) ) , we use the characterizations of matrices in ( C p 0 ( p ) , C p 0 ( q ) ) and ( C p 0 ( p ) , M u ( q ) ) (Theorems 2.6 and 2.4 in [9], respectively).
Proposition 1 
(Theorem 2.6 in [9]).  A ( C p 0 ( p ) , C p 0 ( q ) ) if and only if the following conditions hold:
(i) 
lim m , n | a m n k l | q m n = 0 ( k , l N ) ;
(ii) 
m , n , l N : ( a m n k l ) k φ ;
(iii) 
m , n , k N : ( a m n k l ) l φ ;
(iv) 
k N L ( k ) N such that a m n k l = 0 for m , n , l > L ( k ) ;
(v) 
l N K ( l ) N such that a m n k l = 0 for m , n , k > K ( l ) ;
(vi) 
m , n N M N : k , l | a m n k l | M 1 / p k l < ;
(vii) 
L N M , D N : sup m , n > D L 1 / q m n k , l | a m n k l | M 1 / p k l < .
Proposition 2 
(Theorem 1 in [9]).  A ( C p 0 ( p ) , M u ( q ) ) if and only if the following conditions hold:
(i) 
k , l N : sup m , n | a m n k l | q m n < ;
(ii) 
m , n , l N : ( a m n k l ) k φ ;
(iii) 
m , n , k N : ( a m n k l ) l φ ;
(iv) 
k N L ( k ) N such that a m n k l = 0 for l > L ( k ) ( m , n N ) ;
(v) 
l N K ( l ) N such that a m n k l = 0 for k > K ( l ) ( m , n N ) ;
(vi) 
m , n N M N : k , l | a m n k l | M 1 / p k l < ;
(vii) 
M N : sup m , n k , l | a m n k l | M 1 / p k l q m n < .
Now, using these propositions, we find conditions for a matrix A = ( a m n k l ) to map C p 0 ( p ) to F 0 p ( q ) . For clarity, the conditions appearing in the characterizations are grouped into four types:
(A)
almost convergence-type conditions,
(C)
convergence-type conditions,
(B)
boundedness-type conditions (including restrictions on the support of the matrix entries),
(M)
modular control conditions.
Theorem 1. 
A = ( a m n k l ) is in ( C p 0 ( p ) , F 0 p ( q ) ) if and only if the following conditions hold:
(A1) 
lim m , n sup r , s | a ( m , n , r , s , k , l ) | q m n = 0 ( k , l N ) ;
(B1) 
m , n , l N : ( a m n k l ) k φ ;
(B2) 
m , n , k N : ( a m n k l ) l φ ;
(B3) 
k N L ( k ) N such that a m n k l = 0 for l > L ( k ) ( m , n N ) ;
(B4) 
l N K ( l ) N such that a m n k l = 0 for k > K ( l ) ( m , n N ) ;
(M1) 
m , n N M N : k , l | a m n k l | M 1 / p k l < ;
(M2) 
L N M , D N :
sup m , n > D sup r , s L 1 / q m n k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < .
Proof. 
Necessity. (A1) follows since e k l C p 0 ( p ) ( k , l N ) . (B1), (B2) and (M1) follow since ( a m n k l ) k , l C p 0 ( p ) β ( ν ) = M 0 2 ( p ) ( m , n N ) .
Since by Lemma 2 A ( C p 0 ( p ) , F 0 p ( q ) ) implies A ( C p 0 ( p ) , M u ( q ) ) , (B3) and (B4) follow from Proposition 2.
To prove (M2), suppose on the contrary that (M2) does not hold; that is,
L 0 N M , D N : sup m , n > D sup r , s L 0 1 / q m n k , l | a ( m , n , r , s , k , l ) | M 1 / p k l = .
Then we can choose index sequences ( m i ) , ( n i ) , ( M i ) and sequences of integers ( r i ) , ( s i ) such that
sup i L 0 1 / q m i n i k , l | a ( m i , n i , r i , s i , k , l ) | M i 1 / p k l > i ( i N ) .
We consider the matrix C = ( c i j k l ) with c i i k l = a ( m i , n i , r i , s i , k , l ) and c i j k l = 0 for i j ( i , j , k , l N ) . Since
L 0 1 / q m j n j k , l | c j j k l | M i 1 / p k l L 0 1 / q m j n j k , l | c j j k l | M j 1 / p k l > j ( j i ) ,
we get
M , D N : sup i , j > D L 0 1 / q m i n j k , l | c i j k l | M 1 / p k l = .
Hence, by Proposition 1, the matrix C is not in ( C p 0 ( p ) , C p 0 ( ( q m i n j ) i , j ) ) , so there exists x C p 0 ( p ) such that C x C p 0 ( ( q m i n j ) i , j ) .
Therefore
| k , l c i i k l x k l | q m i n i = | k , l a ( m i , n i , r i , s i , k , l ) x k l | q m i n i   /   0 .
Since
sup r , s | k , l a ( m i , n i , r , s , k , l ) x k l | q m i n i | k , l a ( m i , n i , r i , s i , k , l ) x k l | q m i n i ( i N ) ,
then
sup r , s | k , l a ( m , n , r , s , k , l ) x k l | q m n   /   0 ( m , n ) ,
which implies A x F 0 p ( q ) , and the contradiction follows.
Sufficiency. Suppose that the conditions (A1), (B1)–(B4) and (M1)–(M2) are satisfied; we shall prove that A ( C p 0 ( p ) , F 0 p ( q ) ) .
From (M2), it follows that M , D N :
sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < ( m , n > D ) .
So the matrix ( a ( m , n , r , s , k , l ) ) r , s , k , l satisfies the condition (vii) in Proposition 2 for ( q m n ) = ( 1 ) ( m , n > D ) .
From (A1), (B1)–(B4) and (M1), it follows that the matrix ( a ( m , n , r , s , k , l ) ) r , s , k , l also satisfies the conditions (i)–(vi) in Proposition 2 for ( q m n ) = ( 1 ) ( m , n > D ) .
Hence, the matrix ( a ( m , n , r , s , k , l ) ) r , s , k , l ( C p 0 ( p ) , M u ) for every m , n > D . Therefore, by Proposition 2 we have
m , n > D : sup r , s k , l a ( m , n , r , s , k , l ) x k l q m n < .
Suppose on the contrary that A x F 0 p ( q ) for some x C p 0 ( p ) . So
sup r , s k , l a ( m , n , r , s , k , l ) x k l q m n   /   0 .
Hence, we can find index sequences ( m i ) , ( n i ) , sequences of integers ( r i ) , ( s i ) , and ε > 0 such that
k , l a ( m i , n i , r i , s i , k , l ) x k l q m i n i > ε ( i N ) .
We consider the matrix C = ( c i j k l ) with c i i k l = a ( m i , n i , r i , s i , k , l ) and c i j k l = 0 for i j ( i , j , k , l N ) .
Then the matrix C does not map C p 0 ( p ) to C p 0 ( ( q m i n j ) i , j ) .
Therefore, C does not satisfy at least one of the conditions (i)–(vii) in Proposition 1.
The condition (i) is fulfilled since
lim i , j | c i j k l | q m i n j = lim i | a ( m i , n i , r i , s i , k , l ) | q m i n i lim m , n sup r , s | a ( m , n , r , s , k , l ) | q m n = 0 ( k , l N ) .
From (B1)–(B4) and (M1), it follows that the conditions (ii)–(vi) are satisfied in Proposition 1 for the matrix C.
Let us verify that the condition (vii) of Proposition 1 also holds.
By (M2), for a fixed L N , we can find M , D 0 N such that
sup m , n > D 0 sup r , s L 1 / q m n k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < .
Let D be such that m i , n i > D 0 for i > D ; then
sup i , j > D L 1 / q m i n j k , l | c i j k l | M 1 / p k l = sup i > D L 1 / q m i n i k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l sup m , n > D 0 sup r , s L 1 / q m n k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < .
Therefore, the condition (vii) in Proposition 1 also holds for the matrix C, and we reach a contradiction. □
Corollary 1. 
A ( C p ( p ) , F 0 p ( q ) ) ν if and only if the conditions (A1), (B1)–(B4), and (M1)–(M2) in Theorem 1 are fulfilled as well as
(A2) 
lim m , n sup r , s | ν - k , l a ( m , n , r , s , k , l ) | q m n = 0 .
Proof. 
Necessity. The necessity of (A1), (B1)–(B4), and (M1)–(M2) follows from Theorem 1. We obtain the necessity of (A2) since e C p ( p ) .
Sufficiency. Let x C p ( p ) be given. Then y = x l e C p 0 ( p ) for some l R . By Theorem 1, A y F 0 p ( q ) and e F 0 p ( q ) by (A2). So x = y + l e F 0 p ( q ) by the linearity of F 0 p ( q ) . □
To find the conditions for a matrix A to be in ( C p 0 ( p ) , F p ( q ) ) , we use the following result:
Proposition 3 
(Theorem 2.5 in [9]).  A ( C p 0 ( p ) , C p ( q ) ) if and only if the following conditions hold:
(i) 
k , l N a k l : lim m , n | a m n k l a k l | q m n = 0 ;
(ii) 
m , n , l N : ( a m n k l ) k φ ;
(iii) 
m , n , k N : ( a m n k l ) l φ ;
(iv) 
] k N L ( k ) N such that a m n k l = 0 for m , n , l > L ( k ) ;
(v) 
l N K ( l ) N such that a m n k l = 0 for m , n , k > K ( l ) ;
(vi) 
m , n N M N : k , l | a m n k l | M 1 / p k l < ;
(vii) 
M , D N : sup m , n > D k , l | a m n k l | M 1 / p k l < ;
(viii) 
L M , D N : sup m , n > D L 1 / q m n k , l | a m n k l a k l | M 1 / p k l < .
Applying this proposition, we obtain the conditions for a three-dimensional matrix to map C p 0 ( p ) to c ( q ) .
Corollary 2. 
A = ( a n k l ) ( C p 0 ( p ) , c ( q ) ) if and only if the following conditions hold:
(i) 
k , l N a k l : lim n | a n k l a k l | q n = 0 ;
(ii) 
n , l N : ( a n k l ) k φ ;
(iii) 
n , k N : ( a n k l ) l φ ;
(iv) 
k N L ( k ) N such that a n k l = 0 for n , l > L ( k ) ;
(v) 
l N K ( l ) N such that a n k l = 0 for n , k > K ( l ) ;
(vi) 
n N M N : k , l | a n k l | M 1 / p k l < ;
(vii) 
M N : sup n k , l | a n k l | M 1 / p k l < ;
(viii) 
L M N : sup n L 1 / q n k , l | a n k l a k l | M 1 / p k l < .
Now, using these proposition and corollary, we find conditions for a matrix A = ( a m n k l ) to map C p 0 ( p ) to F p ( q ) .
We use the following notation: for x C p ( p ) and l C such that | x k l l | p k l 0 , we set C p ( p ) lim x : = l . Analogously, for x F p ( q ) and l C such that lim m , n | t m n r s ( x l e ) | p m n = 0 uniformly in r , s , we set
F p ( q ) lim x : = l .
Theorem 2. 
A ( C p 0 ( p ) , F p ( q ) ) if and only if
(A1) 
( α k l ) : lim m , n sup r , s | a ( m , n , r , s , k , l ) α k l | q m n = 0 ( k , l N ) ;
(B1) 
m , n , l N : ( a m n k l ) k φ ;
(B2) 
m , n , k N : ( a m n k l ) l φ ;
(B3) 
k N L ( k ) N such that a m n k l = 0 for l > L ( k ) ( m , n N ) ;
(B4) 
l N K ( l ) N such that a m n k l = 0 for k > K ( l ) ( m , n N ) ;
(M1) 
m , n N M N : k , l | a m n k l | M 1 / p k l < ;
(M2) 
M , D N : sup m , n > D sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < ;
(M3) 
L N M , D N :
sup m , n > D sup r , s L 1 / q m n k , l | a ( m , n , r , s , k , l ) α k l | M 1 / p k l < .
Moreover, in this case,
F p ( q ) lim A x = k , l α k l x k l ( x C p 0 ( p ) ) .
Proof. 
Necessity. The proof of (A1), (B1)–(B4), and (M1) follows in the same way as in Theorem 1.
To prove (M2), we suppose on the contrary that (M2) does not hold. Then
M , D N : sup m , n > D sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l = .
Hence, we can choose index sequences ( m i ) , ( n i ) , ( M i ) and sequences of integers ( r i ) , ( s i ) such that
sup i k , l | a ( m i , n i , r i , s i , k , l ) | M i 1 / p k l > i ( i N ) .
We consider the matrix C = ( c i k l ) with c i k l = a ( m i , n i , r i , s i , k , l ) ( i , k , l N ) . Since
k , l | c j k l | M i 1 / p k l k , l | c j k l | M j 1 / p k l > j ( j i ) ,
we get
M N : sup i k , l | c i k l | M 1 / p k l = .
Hence, by Corollary 2, the matrix C is not in ( C p 0 ( p ) , c ( ( q m i n i ) i ) ) , so there exists x C p 0 ( p ) such that C x c ( ( q m i n i ) i ) .
Therefore,
| k , l c i k l x k l l | q m i n i = | k , l a ( m i , n i , r i , s i , k , l ) x k l l | q m i n i   /   0
for any l R .
Since
sup r , s | k , l a ( m i , n i , r , s , k , l ) x k l l | q m i n i | k , l a ( m i , n i , r i , s i , k , l ) x k l l | q m i n i
for any i N , then
sup r , s | k , l a ( m , n , r , s , k , l ) x k l l | q m n   /   0 ( m , n ) ,
which implies A x F p ( q ) , a contradiction.
To prove the necessity of (M3), we first note that (A1) and (M2) imply that
k , l | α k l | M 1 / p k l <
for some M N .
From (B3) and (B4) it follows that k N L ( k ) N such that α k l = 0 for l > L ( k ) and l N K ( l ) N such that α k l = 0 for k > K ( l ) . Hence, ( α k l ) C p 0 ( p ) β ( p ) .
From the fact that A ( C p 0 ( p ) , F p ( q ) ) , it follows that ( a ( m , n , r , s , k , l ) ) m , n , k , l : C p 0 ( p ) C p ( q ) for every r , s N . Thus these matrices satisfy the conditions (i)–(viii) in Proposition 3.
From (M3) we get
L , r , s N M , D N : sup m , n > D L 1 / q m n k , l | a ( m , n , r , s , k , l ) α k l | M 1 / p k l < .
Altogether, by Proposition 1, we obtain ( a ( m , n , r , s , k , l ) α k l ) m , n , k , l : C p 0 ( p ) C p 0 ( q ) for every r , s N .
Hence, for every x C p 0 ( p ) we have
| k , l ( a ( m , n , r , s , k , l ) α k l ) x k l | q m n 0 ( m , n ; r , s N ) .
On the other hand, since A ( C p 0 ( p ) , F p ( q ) ) , for every x C p 0 ( p ) we can find l x such that
sup r , s | k , l a ( m , n , r , s , k , l ) x k l l x | q m n 0 .
So l x = k , l α k l x k l and
sup r , s | k , l ( a ( m , n , r , s , k , l ) α k l ) x k l | q m n 0 .
Hence, the matrix ( a m n k l α k l ) is in ( C p 0 ( p ) , F 0 p ( q ) ) , thus the condition (M3) holds by Theorem 1.
Sufficiency. Suppose that the conditions (A1), (B1)–(B4), and (M1)–(M3) are satisfied; we shall prove that A ( C p 0 ( p ) , F p ( q ) ) .
By Proposition 3, we have ( a ( m , n , r , s , k , l ) ) m , n , k , l : C p 0 ( p ) C p ( q ) for every r , s N ; so, in particular, k , l a ( m , n , r , s , k , l ) x k l converges for every x C p 0 ( p ) .
In the necessity proof, we verified that ( α k l ) C p 0 ( p ) β ( p ) .
By Theorem 1, the matrix ( a m n k l α k l ) is in ( C p 0 ( p ) , F 0 p ( q ) ) .
Let x C p 0 ( p ) be given, then
sup r , s | k , l a ( m , n , r , s , k , l ) x k l k , l α k l x k l | q m n = sup r , s | k , l ( a ( m , n , r , s , k , l ) α k l ) x k l | q m n 0 .
Hence, A x F p ( q ) and Formula (3) follows. □
Remark 1. 
The coefficients α k l represent the asymptotic values of the Cesàro-averaged matrix entries
a ( m , n , r , s , k , l )
as the averaging window ( m , n ) grows. In this sense, they describe the limiting behavior of the matrix transformation in the almost convergence framework and provide the coefficients of the corresponding limiting operator.
Theorem 3. 
A ( C p ( p ) , F p ( q ) ) ν if and only if the conditions (A1), (B1)–(B4), and (M1)–(M3) in Theorem 2 hold and
(A2) 
( α ) : lim m , n sup r , s | ν - k , l a ( m , n , r , s , k , l ) α | q m n = 0 .
Moreover, in this case,
F p ( q ) lim A x = k , l α k l x k l C p ( p ) lim x + α · C p ( p ) lim x
for each x C p ( p ) .
Proof. 
Necessity and Sufficiency of (A1), (A2), (B1)–(B4), and (M1)–(M3) follow since
C p ( p ) = C p 0 ( p ) e .
To prove Formula (5), let x C p ( p ) with | x k l l | p k l 0 be given. Then by Theorem 2
sup r , s k , l ( a ( m , n , r , s , k , l ) α k l ) ( x k l l ) q m n 0 .
Let Q : = sup k , l q k l . In view of (A2) and
k , l a ( m , n , r , s , k , l ) x k l k , l α k l ( x k l l ) l α q m n / Q k , l ( a ( m , n , r , s , k , l ) α k l ) ( x k l l ) q m n / Q + l k , l a ( m , n , r , s , k , l ) α q m n / Q ,
(5) follows. □
To find the conditions for a matrix A to be in ( M u ( p ) , F 0 p ( q ) ) , we use the following results:
Proposition 4 
(Theorem 3.6 in [8]).  A ( M u ( p ) , C p 0 ( q ) ) if and only if the following conditions hold:
(i) 
M , m , n N : k , l | a m n k l | M 1 / p k l < ;
(ii) 
M N : lim m , n k , l | a m n k l | M 1 / p k l q m n = 0 .
Proposition 5 
(Theorem 3.4 in [8]).  A ( M u ( p ) , M u ( q ) ) if and only if the following condition holds:
M N : sup m , n k , l | a m n k l | M 1 / p k l q m n < .
Now, using these propositions we find conditions for a matrix A = ( a m n k l ) to map M u ( p ) to F 0 p ( q ) .
Theorem 4. 
A ( M u ( p ) , F 0 p ( q ) ) if and only if the following conditions hold:
(B1) 
M N : sup m , n k , l | a m n k l | M 1 / p k l q m n < ;
(A1) 
M N : lim m , n sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l q m n = 0 .
Proof. 
Necessity. (B1) follows from Lemma 2 and Proposition 5.
To prove the necessity of (A1), we first note that by Lemma 2 and Proposition 5 for ( q m n ) = e , we have
M N : sup m , n k , l | a m n k l | M 1 / p k l < .
Therefore,
M N : sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < ( m , n N ) .
Now, suppose on the contrary that
lim m , n sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l q m n 0
for some M N .
Hence, we can find index sequences ( m i ) , ( n i ) , sequences of integers ( r i ) , ( s i ) , and ε > 0 such that
k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l q m i n i > ε ( i N ) .
We consider the matrix C = ( c i j k l ) with c i i k l = a ( m i , n i , r i , s i , k , l ) and c i j k l = 0 for i j ( i , j , k , l N ) .
Then, by Proposition 4, the matrix C does not map M u ( p ) to C p 0 ( ( q m i n j ) i , j ) .
Hence there exists x M u ( p ) such that C x C p 0 ( ( q m i n j ) i , j ) .
Then, in the same way as in the proof of Theorem 1, we obtain that A x F 0 p ( q ) , which yields a contradiction.
Sufficiency. From (B1) it follows that A x exists for each x M u ( p ) .
From (A1) we obtain (7).
Hence by Proposition 5, the matrix ( a ( m , n , r , s , k , l ) ) m , n , r , s maps ( M u ( p ) , M u ) for each k , l N .
Therefore,
sup r , s | k , l a ( m , n , r , s , k , l ) x k l | q m n < ( x M u ( p ) ; m , n N ) .
Now suppose on the contrary that A x F 0 p ( q ) for some x M u ( p ) .
In the same way as in Theorem 1, we obtain index sequences ( m i ) , ( n i ) , sequences ( r i ) , ( s i ) , and ε > 0 such that
| k , l a ( m i , n i , r i , s i , k , l ) x k l | q m i n i > ε .
We consider the matrix C = ( c i j k l ) as above.
Then C does not map M u ( p ) to C p 0 ( ( q m i n j ) i , j ) .
Hence C violates at least one of the conditions (i), (ii) in Proposition 4.
Condition (i) holds by (7), therefore
lim i k , l | c i i k l | M 1 / p k l q m i n i = lim i k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l q m i n i 0 .
Since
sup r , s k , l | a ( m i , n i , r , s , k , l ) | M 1 / p k l q m i n i k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l q m i n i ( i N ) ,
we obtain
lim m , n sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l q m n 0 .
This yields a contradiction. □
To find the conditions for a matrix A to be in ( M u ( p ) , F p ( q ) ) , we use the following proposition:
Proposition 6 
(Theorem 3.5 in [8]).  A ( M u ( p ) , C p ( q ) ) if and only if the following conditions hold:
(i) 
M , m , n N : k , l | a m n k l | M 1 / p k l < ;
(ii) 
M N D N : sup m , n > D k , l | a m n k l | M 1 / p k l < ;
(iii) 
( a k l ) M N : lim m , n ( k , l | a m n k l a k l | M 1 / p k l ) q m n = 0 .
Applying this theorem, we obtain the conditions for a three-dimensional matrix to map M u ( p ) to c ( q ) .
Corollary 3. 
A = ( a n k l ) ( M u ( p ) , c ( q ) ) if and only if the following conditions hold:
(i) 
M , n N : k , l | a n k l | M 1 / p k l < ;
(ii) 
M N : sup n k , l | a n k l | M 1 / p k l < ;
(iii) 
( a k l ) M N : lim n ( k , l | a n k l a k l | M 1 / p k l ) q n = 0 .
Now, using these proposition and corollary, we find conditions for a matrix A = ( a m n k l ) to map M u ( p ) to F p ( q ) .
Theorem 5. 
A ( M u ( p ) , F p ( q ) ) if and only if the following conditions hold:
(M1) 
M , m , n N : k , l | a m n k l | M 1 / p k l < ;
(B1) 
M N D N :
sup m , n > D sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < ;
(A1) 
( α k l ) :
M N : lim m , n sup r , s k , l | a ( m , n , r , s , k , l ) α k l | M 1 / p k l q m n = 0 .
Moreover, in this case,
F p ( q ) lim A x = k , l α k l x k l ( x ( M u ( p ) ) .
Proof. 
Necessity. (M1) follows, since M u ( p ) β ( ν ) = M 2 ( p ) .
In the same way as in Theorem 4, we obtain
M N : sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l < ( m , n N ) .
To prove the necessity of (B1), suppose on the contrary that there exists M N such that
D N : sup m , n > D sup r , s k , l | a ( m , n , r , s , k , l ) | M 1 / p k l = .
Hence, we can find index sequences ( m i ) , ( n i ) and integers ( r i ) , ( s i ) such that
k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l > i ( i N ) .
Define the matrix C = ( c i k l ) with c i k l = a ( m i , n i , r i , s i , k , l ) . Then
k , l | c i k l | M 1 / p k l > i ( i N ) .
Hence, by Corollary 3, the matrix C is not in ( M u ( p ) , c ( ( q m i n i ) i ) ) . Thus there exists x M u ( p ) such that C x c ( ( q m i n i ) i ) .
Now, in the same way as in the proof of (M2) of Theorem 2, we conclude that A x F p ( q ) , which yields a contradiction.
To prove the necessity of (A1), note first that A ( M u ( p ) , F p ( q ) ) implies that the matrix ( a ( m , n , r , s , k , l ) ) m , n , k , l maps ( M u ( p ) , C p ( q ) ) for each r , s N .
Hence, by Proposition 6,
( α k l r s ) M N : lim m , n k , l | a ( m , n , r , s , k , l ) α k l r s | M 1 / p k l q m n = 0 .
Since e k l M u ( p ) , there exists a sequence ( α k l ) such that
lim m , n sup r , s | a ( m , n , r , s , k , l ) α k l | q m n = 0 ( k , l N ) .
From the inequality
| a ( m , n , r , s , k , l ) α k l r s | q m n k , l | a ( m , n , r , s , k , l ) α k l r s | 1 1 / p k l q m n ,
we obtain
lim m , n | a ( m , n , r , s , k , l ) α k l r s | q m n = 0 ,
hence α k l r s = α k l .
Therefore, for x M u ( p ) with | x k l | p k l M , we have
| k , l ( a ( m , n , r , s , k , l ) α k l ) x k l | q m n k , l | a ( m , n , r , s , k , l ) α k l | M 1 / p k l q m n 0 .
Hence, A ( M u ( p ) , F p ( q ) ) implies F p ( q ) lim A x = k , l α k l x k l .
Thus ( a m n k l α k l ) is in ( M u ( p ) , F 0 p ( q ) ) and the necessity of (A1) follows from Theorem 4.
Sufficiency. From (A1) and (10) it follows that ( a m n k l α k l ) is in ( M u ( p ) , F 0 p ( q ) ) .
From (B1) and (A1) it follows that ( α k l ) M u ( p ) β ( ν ) .
Hence the series k , l α k l x k l converges for every x M u ( p ) .
Therefore,
lim m , n sup r , s | k , l a ( m , n , r , s , k , l ) x k l k , l α k l x k l | q m n = lim m , n sup r , s | k , l ( a ( m , n , r , s , k , l ) α k l ) x k l | q m n = 0 .
Hence A x F p ( q ) and F p ( q ) lim A x = k , l α k l x k l . □
To find the conditions for A ( M 0 2 ( p ) , F 0 p ( q ) ) , we first find the conditions for a matrix to map M 0 2 ( p ) into C p 0 ( q ) .
Theorem 6. 
A ( M 0 2 ( p ) , C p 0 ( q ) ) if and only if
(C1) 
lim m , n | a m n k l | q m n = 0 ( k , l N ) ,
(M1) 
L , M N D N : sup m , n > D sup k , l | a m n k l | M 1 / p k l L 1 / q m n < .
Proof. 
We identify the double sequence space M 0 2 ( p ) with the sequence space M 0 ( r ) , where r = T ( p ) , via the isomorphism T between the spaces Ω and ω introduced in [26], and the four-dimensional matrix A with the three-dimensional matrix B = ( b m n k ) ( ( b m n i ) i : = T ( ( a m n k l ) k , l ) ( m , n N ) ).
By Corollary 3.3 (c) in [8], B ( M 0 ( r ) , C p 0 ( q ) ) if and only if for every index sequences ( m i ) , ( n i ) , we have ( b m i n i k ) i , k ( M 0 ( r ) , c 0 ( ( q m i n i ) i ) ) .
By Theorem 2.18 in [6], this is equivalent to the following:
(a) index sequences ( m i ) , ( n i ) : lim i | b m i n i k | q m i n i = 0 ( k N ) ,
(b) L , M N index sequences ( m i ) , ( n i ) :
sup i , k | b m i n i k | M 1 / r k L q m i n i < .
By Proposition 3 (e) in [10], the statement (a) is equivalent to
lim m , n | b m n k | q m n = 0 ( k N ) ,
which is equivalent to (C1).
By Proposition 3 (a) in [10], the statement (b) is equivalent to
L , M N D N : sup m , n > D sup k | b m n k | M 1 / r k L 1 / q m n < ,
which is equivalent to (M1). □
Identifying the double sequence spaces M 0 2 ( p ) , M u ( q ) with the sequence spaces M 0 ( r ) ( r = T ( p ) ), ( s ) ( s = T ( q ) ), and applying the conditions for A ( M 0 ( p ) , ( q ) ) (Theorem 2.20 in [6]), we can find the conditions for A ( M 0 2 ( p ) , M u ( q ) ) :
Proposition 7 
(Theorem 2.20 in [6]).  A ( M 0 2 ( p ) , M u ( q ) ) if and only if
(i) 
L N M N : sup m , n , k , l | a m n k l | M 1 / p k l L 1 / q m n < .
Now, using these theorems, we find conditions for a matrix A = ( a m n k l ) to map M 0 2 ( p ) into F 0 p ( q ) .
Theorem 7. 
A ( M 0 2 ( p ) , F 0 p ( q ) ) if and only if
(A1) 
lim m , n sup r , s | a ( m , n , r , s , k , l ) | q m n = 0 ( k , l N ) ;
(B1) 
L , M N D N :
sup m , n > D sup k , l , r , s | a ( m , n , r , s , k , l ) | M 1 / p k l L 1 / q m n < ;
(M1) 
M N : sup k , l | a m n k l | M 1 / p k l < ( m , n N ) .
Proof. 
Necessity. The necessity of (A1) follows since e k l M 0 2 ( p ) .
The necessity of (B1) follows in the same way as the necessity of (B1) in Theorem 5 by applying Theorem 6.
The necessity of (M1) follows since
( a m n k l ) k , l ( M 0 2 ( p ) ) β ( ν ) = M N { ( y k l ) : sup k , l | y k l | M 1 / p k l } ( m , n N ) .
Sufficiency. From (B1) it follows that
M N D : sup k , l , r , s | a ( m , n , r , s , k , l ) | M 1 / p k l < ( m , n > D ) .
Thus, by Proposition 7, the matrix ( a ( m , n , r , s , k , l ) ) r , s , k , l ( M 0 2 ( p ) , M u ( q ) ) for every m , n > D .
Therefore,
sup r , s k , l a ( m , n , r , s , k , l ) x k l q m n < ( x M 0 2 ( p ) ; m , n > D ) .
If we suppose, on the contrary, that A x F 0 p ( q ) for some x M 0 2 ( p ) , then in the same way as in Theorem 1, we obtain ε > 0 , index sequences ( m i ) , ( n i ) and integers ( r i ) , ( s i ) such that
k , l a ( m i , n i , r i , s i , k , l ) x k l q m i n i > ε .
We consider the matrix C = ( c i j k l ) with c i i k l = a ( m i , n i , r i , s i , k , l ) and c i j k l = 0 for i j .
Then the matrix C does not map M 0 2 ( p ) to C p 0 ( ( q m i n j ) i , j ) .
Therefore (cf. the proof of Theorem 1), the condition (B1) is not satisfied in Theorem 6 for the matrix C.
Thus there exist L , M N such that
sup i , k , l | c i i k l | M 1 / p k l L 1 / q m i n i = sup i , k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l L 1 / q m i n i = .
By (M1),
sup k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l L 1 / q m i n i < ( i N ) .
Since
sup k , l , r , s | a ( m i , n i , r , s , k , l ) | M 1 / p k l L 1 / q m i n i sup k , l | a ( m i , n i , r i , s i , k , l ) | M 1 / p k l L 1 / q m i n i ( i N ) ,
it follows that
sup m , n > D sup k , l , r , s | a ( m , n , r , s , k , l ) | M 1 / p k l L 1 / q m n =
for every D N , which yields a contradiction. □
To obtain the conditions for A = ( a n k ) to be in ( M 0 2 ( p ) , F p ( q ) ) , in the same way as for Theorem 7, we first derive the conditions for a matrix to map M 0 2 ( p ) into C p ( q ) :
Theorem 8. 
A ( M 0 2 ( p ) , C p ( q ) ) if and only if
(C1) 
( a k l ) such that
lim m , n | a m n k l a k l | q m n = 0 ( k , l N ) ;
(B1) 
L N D N : sup m , n > D sup k , l | a m n k l | L 1 / q m n < ;
(M1) 
L , M N D N : sup m , n > D sup k , l | a m n k l a k l | M 1 / p k l L 1 / q m n < .
Moreover, in this case:
C p ( q ) lim A x = k , l a k l x k l ( x M 0 2 ( p ) ) .
Proof. 
As in the proof of Theorem 6, we identify the double sequence space M 0 2 ( p ) with the sequence space M 0 ( r ) , where r = T ( p ) , and the four-dimensional matrix A with the three-dimensional matrix B = ( b m n k ) .
By Corollary 3.3 (a) in [8], B ( M 0 ( r ) , C p ( q ) ) if and only if for every index sequences ( m i ) , ( n i ) the matrix ( b m i n i k ) i , k ( M 0 ( r ) , c ( ( q m i n i ) i ) ) and all these matrices are pairwise consistent on M 0 ( r ) .
By Theorem 2.22 in [6], this is equivalent to the following conditions:
(a) L N ∀ index sequences ( m i ) , ( n i )
sup i , k | b m i n i k | L 1 / p k < ;
(b) ( b k ) such that
lim i | b m i n i k b k | q m i n i = 0 ( k N ) ;
(c) L , M N ∀ index sequences ( m i ) , ( n i )
sup i , k | b m i n i k b k | M 1 / r k L 1 / q m i n i < .
Moreover,
c ( q ) lim ( B x ) m i n i = k b k x k ( x M 0 ( r ) ) .
By Proposition 3 (a) in [10], statement (a) is equivalent to
L N D N : sup m , n > D sup k | b m n k | L 1 / q m n < ,
which is equivalent to (B1).
By Proposition 3 (d) in [10], statement (b) is equivalent to
lim m , n | b m n k b k | q m n = 0 ( k N ) .
Denoting ( a k l ) = T 1 ( ( b k ) ) , we obtain (C1).
By Proposition 3 (a) in [10], statement (c) is equivalent to
L , M N D N : sup m , n > D sup k | b m n k b k | M 1 / r k L 1 / q m n < ,
which is equivalent to (M1).
Since for s = ( s k ) , we have (cf. [7]):
c 0 ( s ) = N { x ω : ( | x k | N 1 / s k ) c 0 } ,
(12) is equivalent to
( m i ) , ( n i ) L N :
lim i | ( B x ) m i n i k b k x k | L 1 / q m i n i = 0 .
By Proposition 3 (d) in [10], this is equivalent to
lim m , n | ( B x ) m n k b k x k | L 1 / q m n = 0 ( x M 0 ( p ) ) lim m , n | ( A x ) m n k , l a k l x k l | L 1 / q m n = 0 ( x M 0 2 ( p ) ) .
So by (1), Formula (11) holds. □
Now, with the help of this theorem, we get the conditions for a matrix to be in ( M 0 2 ( p ) , F p ( q ) ) .
Theorem 9. 
A ( M 0 2 ( p ) , F p ( q ) ) if and only if
(A1) 
( α k l ) such that lim m , n sup r , s | a ( m , n , r , s , k , l ) α k l | q m n = 0 ( k , l N ) ;
(M1) 
L , M N D N :
sup m , n > D sup k , l , r , s | a ( m , n , r , s , k , l ) α k l | M 1 / p k l L 1 / q m n < ;
(B1) 
M N D N :
sup m , n > D sup k , l , r , s | a ( m , n , r , s , k , l ) | M 1 / p k l < ;
(M2) 
M N : sup k , l | a m n k l | M 1 / p k l < ( m , n N ) .
Moreover, in this case,
F p ( q ) lim A x = k , l α k l x k l ( x M 0 2 ( p ) ) .
Proof. 
Necessity. The necessity of (A1) follows since e k l M 0 2 ( p ) ( k , l N ) .
The necessity of (B1) follows in the same way as the necessity of (B1) in Theorem 5 by applying Theorem 8.
The necessity of (M2) follows since ( a m n k l ) k , l ( M 0 2 ( p ) ) β ( ν )   ( m , n N ) .
Since A ( M 0 2 ( p ) , F p ( q ) ) implies ( a ( m , n , r , s , k , l ) ) m , n , k , l ( M 0 2 ( p ) , C p ( q ) ) for every r , s N , by Theorem 8, for every x M 0 2 ( p ) and r , s N , we have
k , l ( a ( m , n , r , s , k , l ) α k l ) x k l q m n = k , l a ( m , n , r , s , k , l ) x k l k , l α k l x k l q m n 0 .
Therefore,
F p ( q ) lim A x = k , l α k l x k l .
Hence ( a m n k l α k l ) m , n , k , l ( M 0 2 ( p ) , F 0 p ( q ) ) , so (M1) holds by Theorem 7.
Sufficiency. Conditions (A1) and (B1) imply that sup k , l | α k l | M 1 / p k l < for every M N .
Hence, ( α k l ) ( M 0 2 ( p ) ) β ( ν ) .
By Theorem 7, it follows that ( a m n k l α k l ) m , n , k , l ( M 0 2 ( p ) , F 0 p ( q ) ) .
So, for every x M 0 2 ( p ) ,
k , l a ( m , n , r , s , k , l ) x k l k , l α k l x k l q m n = k , l ( a ( m , n , r , s , k , l ) α k l ) x k l q m n 0 .
Hence, A ( M 0 2 ( p ) , F p ( q ) ) . □
Set K 1 : = { ( k , l ) N 2 | p k l 1 } , K 2 : = { ( k , l ) N 2 | p k l > 1 } and p k l : = p k l / ( p k l 1 ) ( ( k , l ) K 2 ) .
To obtain the conditions for a matrix to map L u ( p ) into F p ( q ) , we first derive the conditions for A ( L u ( p ) , C p ( q ) ) .
Theorem 10. 
A ( L u ( p ) , C p ( q ) ) if and only if
(B1) 
D N : sup m , n > D sup ( k , l ) K 1 | a m n k l | p k l < ;
(B2) 
M , D N : sup m , n > D ( k , l ) K 2 | a m n k l M 1 | p k l < ;
(C1) 
( a k l ) such that lim m , n | a m n k l a k l | q m n = 0 ( k , l N ) ;
(M1) 
L N D N :
sup m , n > D sup ( k , l ) K 1 ( | a m n k l a k l | L 1 / q m n ) p k l < ;
(M2) 
L N M , D N :
sup m , n > D ( k , l ) K 2 ( | a m n k l a k l | L 1 / q m n M 1 ) p k l < .
To prove this theorem, we use the same reasoning as in Theorem 8 by applying Corollary 3.3 (a) in [8] and Theorem 5.1, part 8 in [7]. Now, with the help of this theorem and using a standard argument, we obtain the conditions for a matrix to be in ( L u ( p ) , F p ( q ) ) .
Theorem 11. 
A ( L u ( p ) , F p ( q ) ) if and only if
(B1) 
D N : sup m , n > D sup r , s sup ( k , l ) K 1 | a ( m , n , r , s , k , l ) | p k l < ;
(B2) 
M , D N : sup m , n > D sup r , s ( k , l ) K 2 | a ( m , n , r , s , k , l ) M 1 | p k l < ;
(A1) 
( α k l ) such that lim m , n sup r , s | a ( m , n , r , s , k , l ) α k l | q m n = 0 ( k , l N ) ;
(M1) 
L N D N :
sup m , n > D sup r , s sup ( k , l ) K 1 ( | a ( m , n , r , s , k , l ) α k l | L 1 / q m n ) p k l < ;
(M2) 
L N M , D N :
sup m , n > D sup r , s ( k , l ) K 2 ( | a ( m , n , r , s , k , l ) α k l | L 1 / q m n M 1 ) p k l < .
To obtain the conditions for a matrix to map L u ( p ) into F 0 p ( q ) , we first derive the conditions for A ( L u ( p ) , C p 0 ( q ) ) .
Theorem 12. 
A ( L u ( p ) , C p 0 ( q ) ) if and only if
(C1) 
lim m , n | a m n k l | q m n = 0 ( k , l N ) ;
(M1) 
L N D N :
sup m , n > D sup ( k , l ) K 1 ( | a m n k l | L 1 / q m n ) p k l < ;
(M2) 
L N M , D N :
sup m , n > D ( k , l ) K 2 ( | a m n k l | L 1 / q m n M 1 ) p k l < .
To prove this theorem, we use the same reasoning as in Theorem 8 by applying Corollary 3.3 (c) in [8] and Theorem 5.1, part 4 in [7]. Now, with the help of this theorem and using a standard argument, we obtain the conditions for a matrix to be in ( L u ( p ) , F 0 p ( q ) ) .
Theorem 13. 
A ( L u ( p ) , F 0 p ( q ) ) if and only if
(A1) 
lim m , n sup r , s | a ( m , n , r , s , k , l ) | q m n = 0 ( k , l N ) ;
(M1) 
L N D N :
sup m , n > D sup r , s sup ( k , l ) K 1 ( | a ( m , n , r , s , k , l ) | L 1 / q m n ) p k l < ;
(M2) 
L N M , D N :
sup m , n > D sup r , s ( k , l ) K 2 ( | a ( m , n , r , s , k , l ) | L 1 / q m n M 1 ) p k l < .
To obtain the conditions for A ( B V , F p ( q ) ) , we use Theorem 9.
Theorem 14. 
A ( B V , F p ( q ) ) if and only if
(B1) 
D N : sup m , n > D sup r , s , k , l i = 1 k j = 1 l a ( m , n , r , s , i , j ) < ;
(A1) 
( α k l ) such that lim m , n sup r , s | a ( m , n , r , s , k , l ) α k l | q m n = 0 ( k , l N ) ;
(M1) 
L N D N :
sup m , n > D sup r , s , k , l i = 1 k j = 1 l ( a ( m , n , r , s , i , j ) α i j ) L 1 / q m n p k l < ;
(A2) 
α such that lim m , n sup r , s k , l a ( m , n , r , s , k , l ) α q m n = 0 .
Moreover, in this case,
F p ( q ) lim A x = k , l Δ ( 11 ) x k l i = 1 k j = 1 l α i j + α lim k , l x k l ( x B V ) .
Proof. 
Necessity of (A1) and (A2) follows since e , e k l B V ( k , l N ) . To prove the necessity of (B1) and (M1), we note that by Abel’s summation formula for x B V and i , j , m , n N , we have
k = 1 i l = 1 j a m n k l x k l = k = 1 i 1 l = 1 j 1 Δ ( 11 ) x k l A m n k l + k = 1 i 1 Δ ( 10 ) x k j A m n k j + l = 1 j 1 Δ ( 01 ) x i l A m n i l + x i j A m n i j ,
where
A m n k l : = s = 1 k t = 1 l a m n s t ( m , n , k , l N ) .
Since A ( B V , F p ( q ) ) implies ( a m n k l ) k , l B V β ( ν ) ( m , n N ) , then sup k , l | A m n k l | < ( m , n N ), so
| k = 1 i 1 Δ ( 10 ) x k j A m n k j | sup k , l | A m n k l | k l = j | Δ ( 11 ) x k l | 0 as i , j ( m , n N ) .
Analogously,
l = 1 j 1 Δ ( 01 ) x i l A m n i l 0 as i , j ( m , n N ) .
Moreover, A ( B V , F p ( q ) ) implies that the double series k , l a m n k l converges (regularly). By Proposition 8.11 in [27], we have x C r . So
k , l a m n k l x k l = k , l Δ ( 11 ) x k l A m n k l + lim k , l x k l k , l a m n k l .
By considering B V C r 0 , we find that the matrix ( A m n k l ) m , n , k , l is in ( L u ( p ) , F p ( q ) ) . So the necessity of (B1) and (M1) follows from Theorem 11.
Sufficiency. Let Q : = sup k , l q k l . Since
i = 1 k j = 1 l a ( m , n , r , s , i , j ) i = 1 k j = 1 l α i j q m n Q i = 1 k j = 1 l | a ( m , n , r , s , i , j ) α i j | q m n Q
for any k , l N , the matrix ( i = 1 k j = 1 l a m n i j ) m , n , k , l is in ( L u ( p ) , F p ( q ) ) by Theorem 11.
Hence, the first summand in the right part of (16) is in F p ( q ) .
Moreover, from (A2) it follows that the second summand in the right part of (16) is in F p ( q ) .
Hence, A x F p ( q ) and (15) follows. □
From this theorem, we easily get conditions for a matrix to be in ( B V , F 0 p ( q ) ) .
Corollary 4. 
A matrix A = ( a m n k l ) is in A ( B V , F 0 p ( q ) ) if and only if the conditions of Theorem 14 hold with α k l = 0 ( k , l N ) and α = 0 .
Proof. 
The result follows directly from Theorem 14 by applying (15) and using the identities α k l = F p ( q ) lim A e k l ( k , l N ) and α = F p ( q ) - lim A e . □
We summarize our results in the Table 1. The number indicates the result where the characterization of ( E , F ) can be found.
In the following examples, we illustrate how the previously discussed theorems can be applied to four-dimensional matrices.
Example 2. 
Let p k l = 1 / ( k + l ) , q k l = 1 ( k , l N ) . We consider the matrix A = ( a m n k l ) defined by a m n k l = 1 k ! l ! m n for k m , l n and a m n k l = 0 otherwise ( m , n , k , l N ). Then, A ( C p 0 ( p ) ) , F 0 p ( q ) ) , since conditions (B3), (B4) of Theorem 1 are not satisfied. Analogously, A ( C p ( p ) ) , F 0 p ( q ) ) , A ( C p 0 ( p ) ) , F p ( q ) ) and A ( C p ( p ) ) , F p ( q ) ) .
Now we verify that both conditions of Theorem 4 are satisfied. Let M N be fixed, then
sup m , n k , l | a m n k l | M 1 / p k l q m n = sup m , n 1 m n k = 1 m M k k ! l = 1 n M l l ! sup m , n ( e M 1 ) 2 m n = ( e M 1 ) 2 .
Hence, condition (B1) of Theorem 4 is satisfied. Moreover,
k , l | a m n k l | M 1 / p k l q m n 0 as m , n .
Since the averaged element a ( m , n , r , s , k , l ) is a Cesàro mean of terms that tend to 0, the limit of the supremum over r , s is also 0. So, condition (A1) of Theorem 4 also follows, and we have A ( M u ( p ) , F 0 p ( q ) ) . Consequently, A ( M u ( p ) , F p ( q ) ) .
Next we show that A ( M 0 2 ( p ) , F 0 p ( q ) ) . Condition (A1) of Theorem 7 requires lim m , n sup r , s | a ( m , n , r , s , k , l ) | = 0 . For our matrix,
a m n k l = 1 k ! l ! m n 0 as m , n ,
and hence the Cesàro averages also tend to 0. Since M k + l k ! l ! m n is bounded for any fixed M and m , n N , condition (C1) of Theorem 7 follows. Condition (B1) of Theorem 7 requires boundedness of the weighted matrix elements. Since M k + l k ! l ! m n is bounded for any fixed M, and the average preserves this, the condition holds. Therefore, by Theorem 7, A ( M 0 2 ( p ) , F 0 p ( q ) ) , and consequently A ( M 0 2 ( p ) , F p ( q ) ) .
Now we verify that A ( L u ( p ) , F 0 p ( q ) ) (Theorem 13). Condition (A1) of Theorem 13 has already been verified. We check condition (M1) of Theorem 13 for K 1 = N 2 (since p k l 1 ):
sup m , n > D sup r , s sup k , l ( | a ( m , n , r , s , k , l ) | L ) p k l < .
First we estimate | a ( m , n , r , s , k , l ) | :
a ( m , n , r , s , k , l ) 1 k ! l ! · 1 ( m + 1 ) ( n + 1 ) i = 0 m j = 0 n 1 ( r + i ) ( s + j ) 1 ( m + 1 ) ( n + 1 ) i = 1 m + 1 1 i j = 1 n + 1 1 j 1 ( m + 1 ) ( n + 1 ) ( ln ( m + 1 ) + γ ) ( ln ( n + 1 ) + γ ) < 1 .
Thus, the term inside the parentheses is bounded by L 1 / 2 , and condition (M1) of Theorem 13 follows. Condition (M2) of Theorem 13 holds trivially since K 2 = . Thus, by Theorem 13, A ( L u ( p ) , F 0 p ( q ) ) , and consequently A ( L u ( p ) , F p ( q ) ) .
Finally, we will show that A ( B V , F 0 p ( q ) ) . Condition (B1) of Theorem 14 involves the partial sums A m n k l = i = 1 k j = 1 l a ( m , n , r , s , i , j ) :
A m n k l 1 ( m + 1 ) ( n + 1 ) i = 1 k 1 i ! j = 1 l 1 j ! μ = 0 m 1 r + μ η = 0 n 1 s + η < ( e 1 ) 2 · 1 + ln ( m + 1 ) m + 1 · 1 + ln ( n + 1 ) n + 1 ( e 1 ) 2 .
So condition (B1) of Theorem 14 follows. We have seen already that condition (A1) of Theorem 14 is satisfied for α k l = 0 ( k , l N ). For condition (M1) of Theorem 14, we have:
| i = 1 k j = 1 l ( a ( m , n , r , s , i , j ) α k l ) | L 1 / q m n p k l = ( | A m n k l | L ) 1 / ( k + l ) ,
and
sup m , n > D sup r , s , k , l ( | A m n k l | L ) 1 / ( k + l ) sup k , l ( ( e 1 ) 2 L ) 1 / ( k + l ) = ( ( e 1 ) 2 L ) 1 / 2 .
Condition (M2) of Theorem 14 requires
lim m , n sup r , s | k , l a ( m , n , r , s , k , l ) α | = 0 .
In a similar way to condition (B1), we get
k , l a ( m , n , r , s , k , l ) ( e 1 ) 2 · 1 + ln ( m + 1 ) m + 1 · 1 + ln ( n + 1 ) n + 1 .
So (A2) follows with α = 0 . Hence, by Theorem 14, A ( B V , F 0 p ( q ) ) and consequently A ( B V , F p ( q ) ) .
We now modify the previous example slightly so that it satisfies Theorems 1–3, as well as Corollary 1.
Example 3. 
Let p k l = 1 / ( k + l ) , q k l = 1 ( k , l N ) . We consider the matrix A = ( a m n k l ) with a m n k l = 0 for k > min { m , 2 l } or l > min { 2 k , n } and a m n k l = ( k ! l ! m n ) 1 otherwise ( m , n , k , l N ) (cf. Example 2.17 in [9]).
Then, evidently, conditions (B1)–(B4) of Theorem 1 are satisfied. Condition (M1) holds since
k , l | a m n k l | M 1 / p k l = k = 1 m l = 1 n | a m n k l | M 1 / p k l < .
Using the estimate
a ( m , n , r , s , k , l ) 1 ( m + 1 ) ( n + 1 ) ( ln ( m + 1 ) + γ ) ( ln ( n + 1 ) + γ )
from the previous example, we obtain (A1). For condition (M2), we estimate
Σ = L 1 / q m n k = 1 l = 1 | a ( m , n , r , s , k , l ) | M k l L 1 ( m + 1 ) ( n + 1 ) k = 1 l = 1 M k M l k ! l ! i = 0 m 1 r + i j = 0 n 1 s + j L ( e M 1 ) 2 ( m + 1 ) ( n + 1 ) 1 + ln 1 + m 1 + ln 1 + n L ( e M 1 ) 2 .
Hence, condition (M2) of Theorem 1 follows. Therefore, A ( C p 0 ( p ) ) , F 0 p ( q ) ) , and consequently A ( C p ( p ) ) , F 0 p ( q ) ) .
Condition (A2) of Corollary 1 follows in a similar way to condition (A2) of Theorem 14 in the previous example. Thus, by Corollary 1, A ( C p ( p ) , F 0 p ( q ) ) ν , and consequently A ( C p ( p ) ) , F p ( q ) ) ν .

3. Conclusions

In this paper, we have studied four-dimensional matrix transformations between spaces of generalized almost convergent double sequences with powers and Maddox-type double sequence spaces with variable exponents. The obtained characterizations extend classical one-dimensional results of Lorentz, Maddox, and Nanda to a genuinely two-dimensional framework.
A key feature of the analysis is the use of Cesàro-type averaging and the reduction method, which allows the treatment of matrix maps between double sequence spaces via suitable representations in terms of sequence spaces.
The presented framework unifies several known summability results and provides a systematic approach to multidimensional convergence under nonuniform growth conditions.
Future research may include further extensions to more general index sets, connections with ideal convergence, and potential applications to stability analysis of discrete operators arising in numerical analysis and approximation theory.

Author Contributions

Conceptualization E.S.; methodology, M.Z.; writing—original draft preparation, M.Z.; writing—review and editing, M.Z. and E.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Toeplitz, O. Über allgemeine lineare Mittelbildungen. Prace Mat.-Fiz. 1911, 22, 113–119. [Google Scholar]
  2. Lorentz, G.G. A contribution to the theory of divergent sequences. Acta Math. 1948, 80, 167–190. [Google Scholar] [CrossRef]
  3. Maddox, I.J. Spaces of strongly summable sequences. Q. J. Math. 1967, 18, 345–355. [Google Scholar] [CrossRef]
  4. Nanda, S. Infinite matrices and almost convergence. J. Indian Math. Soc. 1976, 40, 173–184. [Google Scholar]
  5. Nanda, S. Matrix transformations and almost convergence. Mat. Vesnik 1976, 28, 305–312. [Google Scholar]
  6. Savas, E.; Zeltser, M. Matrix transformations involving generalized almost convergent sequences. Anal. Math. 2019, 45, 413–441. [Google Scholar] [CrossRef]
  7. Grosse-Erdmann, K.-G. Matrix transformations between the sequence spaces of Maddox. J. Math. Anal. Appl. 1993, 180, 223–238. [Google Scholar] [CrossRef]
  8. Zeltser, M.; Sezgek, Ş. Matrix transformations of double convergent sequences with powers. Proc. Est. Acad. Sci. 2024, 73, 379–395. [Google Scholar] [CrossRef]
  9. Zeltser, M.; Sezgek, Ş. Matrix transformations of double convergent sequences with powers for the Pringsheim convergence. Mathematics 2025, 13, 930. [Google Scholar] [CrossRef]
  10. Boos, J.; Seydel, D. Theorems of Toeplitz–Silverman type for maps defined by sequences of matrices. J. Anal. 2001, 9, 149–181. [Google Scholar]
  11. Nakano, H. Modulared sequence spaces. Proc. Jpn. Acad. 1951, 27, 508–512. [Google Scholar] [CrossRef]
  12. Maddox, I.J. Continuous and Köthe–Toeplitz duals of certain sequence spaces. Proc. Camb. Philos. Soc. 1969, 65, 431–435. [Google Scholar] [CrossRef]
  13. Lascarides, C.G. A study of certain sequence spaces of Maddox and a generalization of a theorem of Iyer. Pac. J. Math. 1971, 38, 487–500. [Google Scholar] [CrossRef]
  14. Lascarides, C.G.; Maddox, I.J. Matrix transformations between some classes of sequences. Proc. Camb. Philos. Soc. 1970, 68, 99–104. [Google Scholar] [CrossRef]
  15. Zeltser, M. Investigation of Double Sequence Spaces by Soft and Hard Analytical Methods. Ph.D. Thesis, University of Tartu, Tartu, Estonia, 2001. [Google Scholar]
  16. Yeşilkayagil, M.; Başar, F. On the paranormed space of bounded variation double sequences. Bull. Malays. Math. Sci. Soc. 2020, 43, 2701–2712. [Google Scholar] [CrossRef]
  17. Gökhan, A.; Çolak, R. The double sequence spaces c2P(p) and c2PB(p). Appl. Math. Comput. 2004, 157, 491–501. [Google Scholar] [CrossRef]
  18. Gökhan, A.; Çolak, R. Double sequence space 2(p). Appl. Math. Comput. 2005, 160, 147–153. [Google Scholar]
  19. Gökhan, A.; Çolak, R. On double sequence spaces 0c2P(p), 0c2PB(p) and 2(p). Int. J. Pure Appl. Math. 2006, 30, 309–321. [Google Scholar]
  20. Moritz, F.; Rhoades, B.E. Almost convergence of double sequences and strong regularity of summability matrices. Math. Proc. Camb. Philos. Soc. 1988, 104, 283–294. [Google Scholar] [CrossRef]
  21. Bellman, R. Introduction to Matrix Analysis, 2nd ed.; SIAM: Philadelphia, PA, USA, 1997. [Google Scholar]
  22. Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd ed.; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
  23. Samar, M.; Li, H.; Wei, Y. Condition numbers for the K-weighted pseudoinverse and their statistical estimation. Linear Multilinear Algebra 2021, 69, 752–770. [Google Scholar] [CrossRef]
  24. Samar, M.; Lin, F.-R. Perturbation analysis and condition numbers for the Tikhonov regularization of total least squares problem and their statistical estimation. J. Comput. Appl. Math. 2022, 411, 114230. [Google Scholar] [CrossRef]
  25. Kostyrko, P.; Salat, T.; Wilczynski, W. I-convergence. Real Anal. Exch. 2001, 26, 669–686. [Google Scholar] [CrossRef]
  26. Zeltser, M.; Boos, J.; Leiger, T. Sequences of 0’s and 1’s: New results via double sequence spaces. J. Math. Anal. Appl. 2002, 275, 883–899. [Google Scholar] [CrossRef]
  27. Liflyand, E.; Debernardi, A.; Tikhonov, S.; Zeltser, M. Single and Multiple Number Series; Cambridge University Press & Assessment: Cambridge, UK, to appear.
Table 1. Characterization of matrix transformations ( E , F ) .
Table 1. Characterization of matrix transformations ( E , F ) .
F
E F 0 p ( q ) F p ( q )
C p 0 ( p ) Thm. 1Thm. 2
C p ( p ) Cor. 1Thm. 3
M u ( p ) Thm. 4Thm. 5
M 0 2 ( p ) Thm. 7Thm. 9
L u ( p ) Thm. 13Thm. 16
B V Cor. 4Thm. 14
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

Zeltser, M.; Savas, E. Matrix Transformations of Generalized Almost Convergent Double Sequences. Axioms 2026, 15, 247. https://doi.org/10.3390/axioms15040247

AMA Style

Zeltser M, Savas E. Matrix Transformations of Generalized Almost Convergent Double Sequences. Axioms. 2026; 15(4):247. https://doi.org/10.3390/axioms15040247

Chicago/Turabian Style

Zeltser, Maria, and Ekrem Savas. 2026. "Matrix Transformations of Generalized Almost Convergent Double Sequences" Axioms 15, no. 4: 247. https://doi.org/10.3390/axioms15040247

APA Style

Zeltser, M., & Savas, E. (2026). Matrix Transformations of Generalized Almost Convergent Double Sequences. Axioms, 15(4), 247. https://doi.org/10.3390/axioms15040247

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