# Matrix Transformations between Certain Sequence Spaces over the Non-Newtonian Complex Field

Authors: Uğur Kadak; Hakan Efe
Journal: The Scientific World Journal
 (2014)

---

## Abstract

In some cases, the most general linear operator between two sequence spaces is given by an infinite
matrix. So the theory of matrix transformations has always been of great interest in the study of sequence spaces.
In the present paper, we introduce the matrix transformations in sequence spaces over the fieldC
* and characterize
some classes of infinite matrices with respect to the non-Newtonian calculus. Also we give the necessary and
sufficient conditions on an infinite matrix transforming one of the classical sets over C
* to another one.
Furthermore, the concept for sequence-to-sequence and series-to-series methods of summability is given with
some illustrated examples.


---

## Body

## 1. Introduction

The theory of sequence spaces is the fundamental of summability. Summability is a wide field of mathematics, mainly in analysis and functional analysis, and has many applications, for instance, in numerical analysis to speed up the rate of convergence, in operator theory, the theory of orthogonal series, and approximation theory. This subsection serves as a motivation of what follows. The classical summability theory deals with the generalization of the convergence of sequences or series of real or complex numbers. The idea is to assign a limit of some sort to divergent sequences or series by considering a transform of a sequence or series rather than the original sequence or series. One can ask why we employ the special transformations represented by infinite matrices instead of general linear operators. The answer to this question is that, in many cases, the most general linear operators between two sequence spaces are given by an infinite matrix. Many authors have extensively developed the theory of the matrix transformations between some sequence spaces we refer the reader to [1–13].As an alternative to the classical calculus, Grossman and Katz [14–16] introduced the non-Newtonian calculus consisting of the branches of geometric, quadratic, and harmonic calculus, and so forth. All these calculi can be described simultaneously within the framework of a general theory. We decided to use the adjectivenon-Newtonian to indicate any of calculi other than the classical calculus. Every property in classical calculus has an analogue in non-Newtonian calculus which is a methodology that allows one to have a different look at problems which can be investigated via calculus. In some cases, for example, for wage-rate (in dollars, euro, etc.) related problems, the use of bigeometric calculus which is a kind of non-Newtonian calculus is advocated instead of a traditional Newtonian one.Bashirov et al. [17, 18] have recently concentrated on the non-Newtonian calculus and gave the results with applications corresponding to the well-known properties of derivatives and integrals in the classical calculus. Also, Uzer [19] has extended the non-Newtonian calculus to the complex valued functions and was interested in the statements of some fundamental theorems and concepts of multiplicative complex calculus and demonstrated some analogies between the multiplicative complex calculus and classical calculus by theoretical and numerical examples. Further, Misirli and Gurefe have introduced multiplicative Adams Bashforth-Moulton methods for differential equations in [20]. Quite recently, Kadak [21, 22] have determinated Köthe-Toeplitz dual between classical sets of sequences over the non-Newtonian complex field and have constructed Hilbert spaces over the non-Newtonian field.The main purpose of the present paper is to characterize some matrix classes between certain sequence spaces over the non-Newtonian complex field.


## 2.β-Arithmetics and Some Related Applications

Agenerator is a one-to-one function whose domain is R and whose range is a subset of B
⊆
R, the set of real numbers. Each generator generates exactly one arithmetic, and, conversely, each arithmetic is generated by exactly one generator. For example, the identity function generates classical arithmetic and exponential function generates geometric arithmetic. As a generator, we choose the function β such that its basic algebraic basic algebraic operations are defined as follows:
(1)
β
-addition
x
+
¨
y
=
β
{
β
-
1
(
x
)
+
β
-
1
(
y
)
}
;
β
-subtraction
x
-
¨
y
=
β
{
β
-
1
(
x
)
-
β
-
1
(
y
)
}
,
β
-multiplication
x
×
¨
y
=
β
{
β
-
1
(
x
)
×
β
-
1
(
y
)
}
;
β
-division
x
/
¨
y
,
x
y
∶
=
β
{
β
-
1
(
x
)
÷
β
-
1
(
y
)
}
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
(
β
-
1
(
y
)
≠
0
)
,
β
-order
x
<
¨
y
⟺
β
-
1
(
x
)
<
β
-
1
(
y
)
,
for all x
,
y
∈
R
β where the non-Newtonian real field R
β
∶
=
{
β
{
x
}
:
x
∈
R
} as in [23].Theβ-positive real numbers, denoted by R
β
+, are the numbers x in R
β such that 0
¨
<
¨
x; the β-negative real numbers, denoted by R
β
-, are those for which x
<
¨
0
¨. The b
e
t
a-zero, 0
¨, and the b
e
t
a-one, 1
¨, turn out to be β
(
0
) and β
(
1
). Further, β
(
-
p
)
=
β
{
β
-
1
(
p
¨
)
}
=
-
¨
p
¨ holds for all p
∈
Z
+. Thus the set of all β-integers turns out to be the following:
(2)
Z
β
=
{
…
,
β
(
-
2
)
,
β
(
-
1
)
,
β
(
0
)
,
β
(
1
)
,
β
(
2
)
,
…
}
=
{
…
,
-
¨
2
¨
,
-
¨
1
¨
,
0
¨
,
1
¨
,
2
¨
,
…
}
.Definition 1 (see [21]).
LetX be a nonempty set and let d
*
:
X
×
X
→
R
β be a function such that for all x, y, z
∈
X, then the following axioms hold: (NM1)
d
*
(
x
,
y
)
=
0
¨ if and only if x
=
y,
(NM2)
d
*
(
x
,
y
)
=
d
*
(
y
,
x
),
(NM3)
d
*
(
x
,
y
)
≤
¨
d
*
(
x
,
z
)
+
¨
d
*
(
z
,
y
). Then, the pair (
X
,
d
*
) and d
* are called a non-Newtonian metric space and a non-Newtonian metric on X, respectively.Definition 2 (see [23]).
LetX
=
(
X
,
d
*
) be a non-Newtonian metric space. Then the basic notions can be defined as follows. (a)
A sequencex
=
(
x
k
) is a function from the set N into the set R
β. The β-real number x
k denotes the value of the function at k
∈
N and is called thekth term of the sequence.
(b)
A sequence(
x
n
) in a metric space X
=
(
X
,
d
*
) is said to be *-convergent if for every given ε
>
¨
0
¨ there exists an n
0
=
n
0
(
ε
)
∈
N and x
∈
X such that d
*
(
x
n
,
x
)
<
¨
ε for all n
>
n
0 and is denoted by *
lim
⁡
n
→
∞
x
n
=
x or x
n
→
*
x, as n
→
∞.
(c)
A sequence(
x
n
) in X
=
(
X
,
d
*
) is said to be non-Newtonian Cauchy (*-Cauchy) if for every ε
>
¨
0
¨ there is an n
0
=
n
0
(
ε
)
∈
N such that d
*
(
x
n
,
x
m
)
<
¨
ε for all m
,
n
>
n
0.Remark 3 (see [21]).
Letb
¨
∈
B
⊆
R. Then the number b
¨
×
¨
b
¨ is called the β-square and is denoted by b
¨
2
¨. Let b
¨
∈
R
β
+. Then β
{
β
-
1
(
b
¨
)
} is called the β-square root of b
¨ and is denoted by b
¨
.
.. Further, for each b
¨
∈
B we can write b
¨
p
¨
=
β
{
[
β
-
1
(
b
¨
)
]
p
}
=
β
{
b
p
} for all p
∈
N.Theβ-absolute value of a number x in B
⊂
R
(
N
) is defined as β
(
|
β
-
1
(
x
)
|
) and is denoted by |
x
|
β. For each number x in A
⊂
R
(
N
), x
¨
2
¨
.
.
=
|
x
|
β
=
β
(
|
β
-
1
(
x
)
|
). Then we say
(3)
|
x
|
β
=
{
x
,
x
>
¨
0
¨
0
,
¨
x
=
0
¨
=
β
{
|
β
-
1
(
x
)
|
}
0
¨
-
¨
x
,
x
<
¨
0
¨
.
The non-Newtonian distance between two numbers x
1 and x
2 is defined by |
x
1
-
¨
x
2
|
β
=
β
{
|
β
-
1
(
x
1
)
-
β
-
1
(
x
2
)
|
}
=
β
{
|
β
-
1
(
x
2
)
-
β
-
1
(
x
1
)
|
}
=
|
x
2
-
¨
x
1
|
β. Similarly, by taking into account the definition for a
l
p
h
a-generator in (3), one can conclude that the equality |
x
1
-
˙
x
2
|
α
=
|
x
2
-
˙
x
1
|
α holds for all x
1
,
x
2
∈
R.Now, we give a new type calculus for non-Newtonian complex terms, denoted by*-calculus, which is a branch of non-Newtonian calculus. From now on we will use *-calculus type with respect to two arbitrarily selected generator functions.


### 2.1.*-Arithmetic

Suppose thatα and β are two arbitrarily selected generators and (“star-”) also is the ordered pair of arithmetics (β-arithmetic, α-arithmetic). The sets (
B
,
+
¨
,
-
¨
,
×
¨
,
/
¨
) and (
A
,
+
˙
,
-
˙
,
×
˙
,
/
˙
) are complete ordered fields and b
e
t
a
(
a
l
p
h
a
)-generator generates b
e
t
a
(
a
l
p
h
a
)-arithmetics, respectively. Definitions given for β-arithmetic are also valid for α-arithmetic.The important point to note here is thatα-arithmetic is used for arguments and β-arithmetic is used for values; in particular, changes in arguments and values are measured by α-differences and β-differences, respectively. The operators of this calculus type are applied only to functions with arguments in A and values in B. The *-limit of a function f at an element a in A is, if it exists, the unique number b in B such that for every sequence (
a
n
) of arguments of f distinct from a, if (
a
n
) is α-convergent to a, then {
f
(
a
n
)
}  β-converges to b and is denoted by *


lim
⁡
x
→
a
f
(
x
)
=
b. That is,
(4)
*


lim
⁡
x
→
a
f
(
x
)
=
b
⟺
∀
ε
>
¨
0
¨
,
∃
δ
>
˙
0
˙
∋
|
f
(
x
)
-
¨
b
|
β
<
¨
ε
∀
x
∈
A
,
|
x
-
˙
a
|
α
<
˙
δ
.
A function f is *-continuous at a point a in A if and only if a is an argument of f and *
lim
⁡
x
→
a
⁡
f
(
x
)
=
f
(
a
). When α and β are the identity function I, the concepts of *-limit and *-continuity are identical with those of classical limit and classical continuity.The isomorphism fromα-arithmetic to β-arithmetic is the unique function ι (iota) that possesses the following three properties.(i)
ι is one to one.
(ii)
ι is from A onto B.
(iii)
For any numbersu and v in A,
(5)
ι
(
u
+
˙
v
)
=
ι
(
u
)
+
¨
ι
(
v
)
,
ι
(
u
-
˙
v
)
=
ι
(
u
)
-
¨
ι
(
v
)
,
ι
(
u
×
˙
v
)
=
ι
(
u
)
×
¨
ι
(
v
)
,
ι
(
u
/
˙
v
)
=
ι
(
u
)
/
¨
ι
(
v
)
;
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
v
≠
0
˙
,
u
≤
v
⟺
ι
(
u
)
≤
¨
ι
(
v
)
. It turns out that ι
(
x
)
=
β
{
α
-
1
(
x
)
} for every x in A and that ι
(
n
˙
)
=
n
¨ for every integer n. Since, for example, u
+
˙
v
=
ι
-
1
{
ι
(
u
)
+
¨
ι
(
v
)
}, it should be clear that any statement in α-arithmetic can readily be transformed into a statement in β-arithmetic.


### 2.2. Non-Newtonian Complex Field and Some Inequalities

Letα
(
a
)
=
a
˙
∈
(
A
,
+
˙
,
-
˙
,
×
˙
,
/
˙
) and β
(
b
)
=
b
¨
∈
(
B
,
+
¨
,
-
¨
,
×
¨
,
/
¨
) be arbitrarily chosen elements from corresponding arithmetics. Then the ordered pair (
a
˙
,
b
¨
) is called a *-point. The set of all *-points is called the set of *-complex numbers and is denoted by C
*; that is,
(6)
C
*
∶
=
{
z
*
=
(
a
˙
,
b
¨
)
∣
a
˙
∈
A
⊆
R
,
b
¨
∈
B
⊆
R
}
.
Define the binary operations addition (
⊕
) and multiplication (
⊙
) of *-complex numbers z
1
*
=
(
a
˙
1
,
b
¨
1
) and z
2
*
=
(
a
˙
2
,
b
¨
2
) as follows:
(7)
⊕
:
C
*
×
C
*
⟶
C
*
(
z
1
*
,
z
2
*
)
⟼
z
1
*
⊕
z
2
*
iiiiiiiiiiiiiiiiii
=
(
α
{
a
1
+
a
2
}
,
β
{
b
1
+
b
2
}
)
iiiiiiiiiiiiiiiiii
=
(
a
˙
1
+
˙
a
˙
2
,
b
¨
1
+
¨
b
¨
2
)
⊙
:
C
*
×
C
*
⟶
C
*
iiiiiiiiiiiiiiiiii
(
z
1
*
,
z
2
*
)
⟼
z
1
*
⊙
z
2
*
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
=
(
α
{
a
1
a
2
-
b
1
b
2
}
,
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
β
{
a
1
b
2
+
b
1
a
2
}
)
,
where a
˙
1
,
a
˙
2
∈
A and b
¨
1
,
b
¨
2
∈
B.Theorem 4 (see [24]).
(
C
*
,
⊕
,
⊙
) is a field.Following Grossman and Katz [15], we can give the definition of *-distance and some applications with respect to the *-calculus which is a kind of calculi of non-Newtonian calculus.The*-distance d
* between two arbitrarily elements z
1
*
=
(
a
˙
1
,
b
¨
1
) and z
2
*
=
(
a
˙
2
,
b
¨
2
) of the set C
* is defined by
(8)
d
*
:
C
*
×
C
*
⟶
[
0
¨
,
∞
)
=
B
′
⊂
B
(
z
1
*
,
z
2
*
)
⟼
d
*
(
z
1
*
,
z
2
*
)
iiiiiiiiiiiiiiiiii
=
[
ι
(
a
˙
1
-
˙
a
˙
2
)
]
2
¨
+
¨
(
b
¨
1
-
¨
b
¨
2
)
2
¨
.
.
iiiiiiiiiiiiiiiiii
=
β
{
(
a
1
-
a
2
)
2
+
(
b
1
-
b
2
)
2
}
.
Up to now, we know that C
* is a field and the distance between two points in C
* is computed by the function d
*, defined by (8).Definition 5 (see [21]).
Given a sequence(
z
k
*
) of *-complex numbers, the formal notation
(9)
*


∑
k
=
0
∞
‍
z
k
*
=
z
0
*
⊕
z
1
*
⊕
z
2
*
⊕
⋯
⊕
z
k
*
⊕
⋯
,
∀
k
∈
N
,
is called an infinite series with *-complex terms, or simply complex N-series. Also, for integers n
∈
N, the finite *-sums s
n
*
=
*



∑
k
=
0
n
‍
z
k
* are called the partial sums of complex N-series. If the sequence *-converges to a complex number s
* then we say that the series  *-converges and write s
*
=
*



∑
n
=
0
∞
‍
z
n
*. The number s
* is then called the *-sum of this series. If (
s
n
)
*-diverges, we say that the series *-diverges, or that it is *-divergent.Remark 6.
Given a sequence(
x
k
) of β-real numbers R
β, the formal notation
(10)
β

∑
k
=
0
∞
‍
x
k
=
β
{
∑
k
=
0
∞
‍
β
-
1
{
x
k
}
}
=
x
1
+
¨
x
2
+
¨
x
3
+
¨
⋯
+
¨
x
k
+
¨
⋯
is called an infinite non-Newtonian series with β real terms. Also, for integers n
∈
N, the finite sums s
n
=
β

∑
k
=
0
n
‍
x
k are called the partial sums of the N-series. If the sequence β-converges to a real number s then we say that the series β-converges and write s
=
β

∑
n
=
0
∞
‍
x
k. The number s is then called the sum of this series. If (
s
n
)  β-diverges, we say that the N-series is β-divergent.Proposition 7 (see [24]).
For anyz
1
*
,
z
2
*
∈
C
*. Then the following statements hold. (i)
∥
¨
z
1
*
⊕
z
2
*
∥
¨
≤
¨
∥
¨
z
1
*
∥
¨
+
¨
∥
¨
z
2
*
∥
¨. 											(
*
-triangle inequality)
(ii)
∥
¨
z
1
*
⊙
z
2
*
∥
¨
=
∥
¨
z
1
*
∥
¨
×
¨
∥
¨
z
2
*
∥
¨.
(iii)
Let
p
>
¨
1
¨
and
z
k
*
,
t
k
*
∈
C
*
for
k
∈
{
0,1
,
2,3
,
…
,
n
}
. Then,
(11)
(
*


∑
k
=
0
n
‍
∥
¨
z
k
*
⊕
t
k
*
∥
¨
p
)
1
/
¨
p
≤
¨
(
*


∑
k
=
0
n
∥
¨
z
k
*
∥
¨
p
‍
)
1
/
¨
p
+
¨
(
*


∑
k
=
0
n
‍
∥
¨
t
k
*
∥
¨
p
)
1
/
¨
p
d
d
d
d
i
d
d
d
d
i
i
(
Minkowski'
s
inequality
)
.Folllowing Tekin and Başar [24], we can give the *-norm and next derive some required inequalities in the sense of non-Newtonian complex calculus.Letz
*
∈
C
* be an arbitrary element. The distance function d
*
(
z
*
,
θ
*
) is called *-norm of z
* and is denoted by ∥
¨
·
∥
¨. In other words,
(12)
∥
¨
z
*
∥
¨
=
d
*
(
z
*
,
θ
*
)
=
[
ι
(
a
˙
-
˙
0
˙
)
]
2
¨
+
¨
(
b
¨
-
¨
0
¨
)
2
¨
.
.
=
β
{
a
2
+
b
2
}
,
where z
*
=
(
a
˙
,
b
¨
) and θ
*
=
(
0
˙
,
0
¨
). Moreover, since for all z
1
*
,
z
2
*
∈
C
* we have d
*
(
z
1
*
,
z
2
*
)
=
∥
¨
z
1
*
⊖
z
2
*
∥
¨ which d
* is the induced metric from ∥
¨
·
∥
¨ norm.Definition 8 (see [21], complex conjugate).
Letz
*
=
(
a
˙
,
b
¨
)
∈
C
*. We define the *-complex conjugate z
¯
* of z
* by z
¯
*
=
(
α
{
a
}
,
β
{
-
β
-
1
(
b
¨
)
}
)
=
(
a
˙
,
-
¨
b
¨
). Conjugation changes the sign of the imaginary part of z
* but leaves the real part the same. Thus,
(13)
R
e
(
z
¯
*
)
=
R
e
(
z
*
)
=
(
z
*
⊕
z
¯
*
)
/
˙
2
˙
=
a
˙
,
I
m
(
z
¯
*
)
=
-
¨
I
m
(
z
*
)
=
(
z
*
⊖
z
¯
*
)
/
¨
2
¨
=
b
¨
.Theorem 9 (see [24]).
(
C
*
,
d
*
) is a complete metric space, where d
* is defined by (8).Corollary 10 (see [24]).
C
* is a Banach space with the *-norm ∥
¨
·
∥
¨ defined by ∥
¨
z
*
∥
¨
=
[
ι
(
a
˙
)
]
2
¨
+
(
b
¨
)
2
¨
.
.; z
*
=
(
a
˙
,
b
¨
)
∈
C
*.


## 2.1.*-Arithmetic

Suppose thatα and β are two arbitrarily selected generators and (“star-”) also is the ordered pair of arithmetics (β-arithmetic, α-arithmetic). The sets (
B
,
+
¨
,
-
¨
,
×
¨
,
/
¨
) and (
A
,
+
˙
,
-
˙
,
×
˙
,
/
˙
) are complete ordered fields and b
e
t
a
(
a
l
p
h
a
)-generator generates b
e
t
a
(
a
l
p
h
a
)-arithmetics, respectively. Definitions given for β-arithmetic are also valid for α-arithmetic.The important point to note here is thatα-arithmetic is used for arguments and β-arithmetic is used for values; in particular, changes in arguments and values are measured by α-differences and β-differences, respectively. The operators of this calculus type are applied only to functions with arguments in A and values in B. The *-limit of a function f at an element a in A is, if it exists, the unique number b in B such that for every sequence (
a
n
) of arguments of f distinct from a, if (
a
n
) is α-convergent to a, then {
f
(
a
n
)
}  β-converges to b and is denoted by *


lim
⁡
x
→
a
f
(
x
)
=
b. That is,
(4)
*


lim
⁡
x
→
a
f
(
x
)
=
b
⟺
∀
ε
>
¨
0
¨
,
∃
δ
>
˙
0
˙
∋
|
f
(
x
)
-
¨
b
|
β
<
¨
ε
∀
x
∈
A
,
|
x
-
˙
a
|
α
<
˙
δ
.
A function f is *-continuous at a point a in A if and only if a is an argument of f and *
lim
⁡
x
→
a
⁡
f
(
x
)
=
f
(
a
). When α and β are the identity function I, the concepts of *-limit and *-continuity are identical with those of classical limit and classical continuity.The isomorphism fromα-arithmetic to β-arithmetic is the unique function ι (iota) that possesses the following three properties.(i)
ι is one to one.
(ii)
ι is from A onto B.
(iii)
For any numbersu and v in A,
(5)
ι
(
u
+
˙
v
)
=
ι
(
u
)
+
¨
ι
(
v
)
,
ι
(
u
-
˙
v
)
=
ι
(
u
)
-
¨
ι
(
v
)
,
ι
(
u
×
˙
v
)
=
ι
(
u
)
×
¨
ι
(
v
)
,
ι
(
u
/
˙
v
)
=
ι
(
u
)
/
¨
ι
(
v
)
;
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
v
≠
0
˙
,
u
≤
v
⟺
ι
(
u
)
≤
¨
ι
(
v
)
. It turns out that ι
(
x
)
=
β
{
α
-
1
(
x
)
} for every x in A and that ι
(
n
˙
)
=
n
¨ for every integer n. Since, for example, u
+
˙
v
=
ι
-
1
{
ι
(
u
)
+
¨
ι
(
v
)
}, it should be clear that any statement in α-arithmetic can readily be transformed into a statement in β-arithmetic.


## 2.2. Non-Newtonian Complex Field and Some Inequalities

Letα
(
a
)
=
a
˙
∈
(
A
,
+
˙
,
-
˙
,
×
˙
,
/
˙
) and β
(
b
)
=
b
¨
∈
(
B
,
+
¨
,
-
¨
,
×
¨
,
/
¨
) be arbitrarily chosen elements from corresponding arithmetics. Then the ordered pair (
a
˙
,
b
¨
) is called a *-point. The set of all *-points is called the set of *-complex numbers and is denoted by C
*; that is,
(6)
C
*
∶
=
{
z
*
=
(
a
˙
,
b
¨
)
∣
a
˙
∈
A
⊆
R
,
b
¨
∈
B
⊆
R
}
.
Define the binary operations addition (
⊕
) and multiplication (
⊙
) of *-complex numbers z
1
*
=
(
a
˙
1
,
b
¨
1
) and z
2
*
=
(
a
˙
2
,
b
¨
2
) as follows:
(7)
⊕
:
C
*
×
C
*
⟶
C
*
(
z
1
*
,
z
2
*
)
⟼
z
1
*
⊕
z
2
*
iiiiiiiiiiiiiiiiii
=
(
α
{
a
1
+
a
2
}
,
β
{
b
1
+
b
2
}
)
iiiiiiiiiiiiiiiiii
=
(
a
˙
1
+
˙
a
˙
2
,
b
¨
1
+
¨
b
¨
2
)
⊙
:
C
*
×
C
*
⟶
C
*
iiiiiiiiiiiiiiiiii
(
z
1
*
,
z
2
*
)
⟼
z
1
*
⊙
z
2
*
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
=
(
α
{
a
1
a
2
-
b
1
b
2
}
,
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
β
{
a
1
b
2
+
b
1
a
2
}
)
,
where a
˙
1
,
a
˙
2
∈
A and b
¨
1
,
b
¨
2
∈
B.Theorem 4 (see [24]).
(
C
*
,
⊕
,
⊙
) is a field.Following Grossman and Katz [15], we can give the definition of *-distance and some applications with respect to the *-calculus which is a kind of calculi of non-Newtonian calculus.The*-distance d
* between two arbitrarily elements z
1
*
=
(
a
˙
1
,
b
¨
1
) and z
2
*
=
(
a
˙
2
,
b
¨
2
) of the set C
* is defined by
(8)
d
*
:
C
*
×
C
*
⟶
[
0
¨
,
∞
)
=
B
′
⊂
B
(
z
1
*
,
z
2
*
)
⟼
d
*
(
z
1
*
,
z
2
*
)
iiiiiiiiiiiiiiiiii
=
[
ι
(
a
˙
1
-
˙
a
˙
2
)
]
2
¨
+
¨
(
b
¨
1
-
¨
b
¨
2
)
2
¨
.
.
iiiiiiiiiiiiiiiiii
=
β
{
(
a
1
-
a
2
)
2
+
(
b
1
-
b
2
)
2
}
.
Up to now, we know that C
* is a field and the distance between two points in C
* is computed by the function d
*, defined by (8).Definition 5 (see [21]).
Given a sequence(
z
k
*
) of *-complex numbers, the formal notation
(9)
*


∑
k
=
0
∞
‍
z
k
*
=
z
0
*
⊕
z
1
*
⊕
z
2
*
⊕
⋯
⊕
z
k
*
⊕
⋯
,
∀
k
∈
N
,
is called an infinite series with *-complex terms, or simply complex N-series. Also, for integers n
∈
N, the finite *-sums s
n
*
=
*



∑
k
=
0
n
‍
z
k
* are called the partial sums of complex N-series. If the sequence *-converges to a complex number s
* then we say that the series  *-converges and write s
*
=
*



∑
n
=
0
∞
‍
z
n
*. The number s
* is then called the *-sum of this series. If (
s
n
)
*-diverges, we say that the series *-diverges, or that it is *-divergent.Remark 6.
Given a sequence(
x
k
) of β-real numbers R
β, the formal notation
(10)
β

∑
k
=
0
∞
‍
x
k
=
β
{
∑
k
=
0
∞
‍
β
-
1
{
x
k
}
}
=
x
1
+
¨
x
2
+
¨
x
3
+
¨
⋯
+
¨
x
k
+
¨
⋯
is called an infinite non-Newtonian series with β real terms. Also, for integers n
∈
N, the finite sums s
n
=
β

∑
k
=
0
n
‍
x
k are called the partial sums of the N-series. If the sequence β-converges to a real number s then we say that the series β-converges and write s
=
β

∑
n
=
0
∞
‍
x
k. The number s is then called the sum of this series. If (
s
n
)  β-diverges, we say that the N-series is β-divergent.Proposition 7 (see [24]).
For anyz
1
*
,
z
2
*
∈
C
*. Then the following statements hold. (i)
∥
¨
z
1
*
⊕
z
2
*
∥
¨
≤
¨
∥
¨
z
1
*
∥
¨
+
¨
∥
¨
z
2
*
∥
¨. 											(
*
-triangle inequality)
(ii)
∥
¨
z
1
*
⊙
z
2
*
∥
¨
=
∥
¨
z
1
*
∥
¨
×
¨
∥
¨
z
2
*
∥
¨.
(iii)
Let
p
>
¨
1
¨
and
z
k
*
,
t
k
*
∈
C
*
for
k
∈
{
0,1
,
2,3
,
…
,
n
}
. Then,
(11)
(
*


∑
k
=
0
n
‍
∥
¨
z
k
*
⊕
t
k
*
∥
¨
p
)
1
/
¨
p
≤
¨
(
*


∑
k
=
0
n
∥
¨
z
k
*
∥
¨
p
‍
)
1
/
¨
p
+
¨
(
*


∑
k
=
0
n
‍
∥
¨
t
k
*
∥
¨
p
)
1
/
¨
p
d
d
d
d
i
d
d
d
d
i
i
(
Minkowski'
s
inequality
)
.Folllowing Tekin and Başar [24], we can give the *-norm and next derive some required inequalities in the sense of non-Newtonian complex calculus.Letz
*
∈
C
* be an arbitrary element. The distance function d
*
(
z
*
,
θ
*
) is called *-norm of z
* and is denoted by ∥
¨
·
∥
¨. In other words,
(12)
∥
¨
z
*
∥
¨
=
d
*
(
z
*
,
θ
*
)
=
[
ι
(
a
˙
-
˙
0
˙
)
]
2
¨
+
¨
(
b
¨
-
¨
0
¨
)
2
¨
.
.
=
β
{
a
2
+
b
2
}
,
where z
*
=
(
a
˙
,
b
¨
) and θ
*
=
(
0
˙
,
0
¨
). Moreover, since for all z
1
*
,
z
2
*
∈
C
* we have d
*
(
z
1
*
,
z
2
*
)
=
∥
¨
z
1
*
⊖
z
2
*
∥
¨ which d
* is the induced metric from ∥
¨
·
∥
¨ norm.Definition 8 (see [21], complex conjugate).
Letz
*
=
(
a
˙
,
b
¨
)
∈
C
*. We define the *-complex conjugate z
¯
* of z
* by z
¯
*
=
(
α
{
a
}
,
β
{
-
β
-
1
(
b
¨
)
}
)
=
(
a
˙
,
-
¨
b
¨
). Conjugation changes the sign of the imaginary part of z
* but leaves the real part the same. Thus,
(13)
R
e
(
z
¯
*
)
=
R
e
(
z
*
)
=
(
z
*
⊕
z
¯
*
)
/
˙
2
˙
=
a
˙
,
I
m
(
z
¯
*
)
=
-
¨
I
m
(
z
*
)
=
(
z
*
⊖
z
¯
*
)
/
¨
2
¨
=
b
¨
.Theorem 9 (see [24]).
(
C
*
,
d
*
) is a complete metric space, where d
* is defined by (8).Corollary 10 (see [24]).
C
* is a Banach space with the *-norm ∥
¨
·
∥
¨ defined by ∥
¨
z
*
∥
¨
=
[
ι
(
a
˙
)
]
2
¨
+
(
b
¨
)
2
¨
.
.; z
*
=
(
a
˙
,
b
¨
)
∈
C
*.


## 3. Non-Newtonian Infinite Matrices

A non-Newtonian infinite matrixA
=
(
a
i
j
*
) of non-Newtonian complex numbers is a double sequence of complex numbers defined by a function A from the set N
×
N into the complex field C
*, where N denotes the set of natural numbers, that is, N
=
{
0,1
,
2
,
…
}. The complex number a
i
j
* denotes the value of the function at (
i
,
j
)
∈
N
×
N and is called the entry of the matrix in theith row andjth column.The addition(
⊕
) and scalar multiplication (
⊙
) of the infinite matrices A
=
(
a
i
j
*
)
=
(
ϵ
˙
i
j
,
δ
¨
i
j
) and B
=
(
b
i
j
*
)
=
(
μ
˙
i
j
,
η
¨
i
j
) are defined by
(14)
A
⊕
B
=
(
a
i
j
*
⊕
b
i
j
*
)
=
(
ϵ
˙
i
j
,
δ
¨
i
j
)
⊕
(
μ
˙
i
j
,
η
¨
i
j
)
=
(
ϵ
˙
i
j
+
˙
μ
˙
i
j
,
δ
¨
i
j
+
¨
η
¨
i
j
)
=
(
α
{
ϵ
i
j
+
μ
i
j
}
,
β
{
δ
i
j
+
η
i
j
}
)
,
λ
*
⊙
A
=
(
λ
*
⊙
a
i
j
*
)
=
(
λ
˙
,
λ
¨
)
⊙
(
ϵ
˙
i
j
,
δ
¨
i
j
)
=
(
α
{
λ
ϵ
i
j
-
λ
δ
i
j
}
,
β
{
λ
ϵ
i
j
+
λ
δ
i
j
}
)
,
where the elements ε, δ, μ, η are in R and λ
*
=
(
λ
˙
,
λ
¨
) is a non-Newtonian scalar in C
*. The product A
⊙
B of the infinite matrices A
=
(
a
i
j
*
) and B
=
(
b
i
j
*
) is defined by
(15)
(
A
⊙
B
)
i
j
=
*


∑
k
=
0
∞
‍
a
i
k
*
⊙
b
k
j
*
=
(
α
{
∑
k
=
0
∞
‍
(
ε
i
k
μ
k
j
-
δ
i
k
η
k
j
)
}
,
i
i
i
i
i
β
{
∑
k
=
0
∞
‍
(
ε
i
k
η
k
j
+
δ
i
k
μ
k
j
)
}
)
,
∀
i
,
j
∈
N
,
provided that the series on the right hand side of (15) *-converge for all i
,
j
∈
N, where (
A
⊙
B
)
i
j denotes the entry of the matrix A
⊙
B in theith row andjth column. For simplicity in notation, here and in what follows, the summation without limits runs from 0 to ∞. On the other hand, the series on the right hand side of (15) *-converges if and only if
(16)
∑
k
‍
(
ε
i
k
μ
k
j
-
δ
i
k
η
k
j
)
,
∑
k
‍
(
ε
i
k
η
k
j
+
δ
i
k
μ
k
j
)
are convergent classically for all k
,
n
∈
N. However the series (15) may *-diverge for some, or all, values of i
,
j; the product A
⊙
B of the infinite matrices may not exist.Definition 11 (see [25]).
Consider the following system of an infinite number of linear equations in infinitely many unknownx
0
*
,
x
1
*
,
x
2
*
,
… elements by *


∑
k
‍
a
i
k
*
⊙
x
k
*
=
y
i for all i
∈
N. If we construct a non-Newtonian infinite matrix A
=
(
a
i
k
*
) with the coefficients a
i
k
* of the unknowns x
k
* and denote the *-vectors of unknowns and constants by X and Y, then the above sum can be expressed in matrix form as A
⊙
X
=
Y. Also I
*
⊙
A
=
A
⊙
I
*
=
A, where I
*
=
(
δ
i
j
*
) is called *-unit matrix and is defined by
(17)
δ
i
j
*
=
{
1
*
=
(
1
˙
,
1
¨
)
,
i
=
j
,
θ
*
=
(
0
˙
,
0
¨
)
,
i
≠
j
.A very important application of infinite matrices is used in the theory of summability of divergent sequences and series which is considered based on non-Newtonian mean in next chapter. A simple example of the non-Newtonian Cesaro mean, denoted by*-Cesaro mean of order one, which is the analog of the well-known method of summability given below.Example 12 (Cesàro mean).
Define the matrixC
1
*
=
(
c
n
k
*
) by
(18)
c
n
k
*
=
{
(
1
n
+
1
)
*
,
0
≤
k
≤
n
,
θ
*
,
k
>
n
.
If we choose the generator functions as α
=
exp
⁡ and β
=
exp
⁡ the calculus is bigeometric calculus [14, 15], then we obtain an infinite matrix with complex terms as follows:(19)
(
(
e
,
e
)
(
1,1
)
⋯
⋯
⋯
⋯
(
e
,
e
)
(
e
,
e
)
(
1,1
)
⋯
⋯
⋯
(
e
3
,
e
3
)
(
e
3
,
e
3
)
(
e
3
,
e
3
)
(
1,1
)
⋯
⋯
⋮
⋮
⋮
⋱
⋮
⋮
(
e
n
+
1
,
e
n
+
1
)
(
e
n
+
1
,
e
n
+
1
)
(
e
n
+
1
,
e
n
+
1
)
⋯
(
e
n
+
1
,
e
n
+
1
)
⋯
⋮
⋮
⋮
⋯
⋮
⋱
)
,where θ
*
=
(
α
(
0
)
,
β
(
0
)
)
=
(
1,1
) and e is a logarithmic number. The important point to note here is that the infinite matrix can be obtained in a similar way by using different generator functions above mentioned.The*-zero matrix θ
* is the matrix whose entries are all equal to θ
*. Thus, it is obvious that A
⊙
θ
*
=
θ
*
⊙
A
=
θ
*. But, as classical, A
⊙
B
=
θ
* does not imply A
=
θ
* or B
=
θ
*. Further, the conjugate A
¯ of a complex matrix A
=
(
a
i
j
*
) is the matrix A
¯
=
(
a
¯
i
j
*
) where a
¯
i
j
* is the conjugate of the complex number a
i
j
* in Definition 8.


### 3.1. Non-Newtonian Matrix Transformations

Letμ
1
*, μ
2
*
⊂
w
* and A
=
(
a
n
k
*
)
=
(
ε
˙
n
k
,
δ
¨
n
k
) be an infinite matrix of non-Newtonian complex numbers for all ε
˙
k
∈
R
α and δ
¨
k
∈
R
β. Then, we say that A defines a matrix mapping from μ
1
* into μ
2
* and denote it by writing A
:
μ
1
*
→
μ
2
*, if for every sequence z
=
(
z
k
*
)
∈
μ
1
* the sequence A
⊙
z
=
{
(
A
z
)
n
}, the A-transform of z, exists and is in μ
2
*, where
(20)
A
⊙
z
=
(
a
00
*
a
01
*
⋯
a
0
k
*
⋯
a
10
*
a
11
*
⋯
a
1
k
*
⋯
⋮
⋮
⋮
⋯
⋮
⋯
a
n
0
*
a
n
1
*
⋯
a
n
k
*
⋯
⋮
⋮
⋮
⋯
⋮
⋯
)
⊙
(
z
0
*
z
1
*
⋮
z
k
*
⋮
)
=
(
a
00
*
⊙
z
0
*
⊗
a
01
*
⊙
z
1
*
⊕
⋯
a
10
*
⊙
z
0
*
⊗
a
11
*
⊙
z
1
*
⊕
⋯
⋮
a
n
0
*
⊙
z
0
*
⊗
a
n
1
*
⊙
z
1
*
⊕
⋯
⋮
)
=
(










*


∑
k
‍
a
0
k
*
⊙
z
k
*






*


∑
k
‍
a
1
k
*
⊙
z
k
*
⋮






*


∑
k
‍
a
n
k
*
⊙
z
k
*
⋮
)
=
(
(
A
z
)
0
(
A
z
)
1
⋮
(
A
z
)
n
⋮
)
,
and, in this way, we transform the sequence z
=
(
z
k
*
)
=
(
μ
˙
k
,
η
¨
k
), with μ
˙
k
∈
R
α and η
¨
k
∈
R
β, into the sequence {
(
A
z
)
n
} by
(21)
(
A
z
)
n
∶
=




*


∑
k
‍
a
n
k
*
⊙
z
k
*
=
(
α
{
∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
)
}
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
β
{
∑
k
(
ε
n
k
η
k
+
δ
n
k
μ
k
)
‍
}
)
for all n
∈
N
0 and ε
,
δ
,
μ
,
η
∈
R. Thus, A
∈
(
μ
1
*
:
μ
2
*
) if and only if the series on the right side of (21) *-converges for each n
∈
N and every z
∈
μ
1
*, and we have A
⊙
z
=
{
(
A
z
)
n
}
n
∈
N
∈
μ
2
* for all z
∈
μ
1
*. On the other hand, we say A
∈
(
μ
1
*
:
μ
2
*
) if and only if the series ∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
) and ∑
k
‍
(
ε
n
k
η
k
+
δ
n
k
μ
k
) are convergent classically for all k
,
n
∈
N
0. A sequence z is said to be A-summable to γ if A
⊙
z
*-converges to γ
∈
C
* which is called as the A-
*


lim
⁡ of z. We denote thenth row of a matrix A
=
(
a
n
k
*
) by A
n
* for all n
∈
N; that is, A
n
*
∶
=
{
a
n
k
*
}
k
=
0
∞ for all n
∈
N. Following Başar [25], we give some lines about ordinary and absolute summability of non-Newtonian complex numbers.LetA
=
(
a
n
k
*
) be an infinite matrix of non-Newtonian complex numbers throughout. We define two kinds of summability: ordinary and absolute summability, as shortly mentioned, below.(a) Ordinary Summability. A sequence z
=
(
z
k
)
∈
w
* is said to be summable A to a γ
∈
C
* if the A-
*


lim
⁡ of z is γ
=
(
γ
˙
1
,
γ
¨
2
) for all γ
1
,
γ
2
∈
R; that is, *
lim
⁡
n
→
∞
d
*
(
(
A
z
)
n
,
γ
)
=
θ
* which implies that
(22)
∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
)
⟶
γ
1
,
∑
k
‍
(
ε
n
k
η
k
+
δ
n
k
μ
k
)
⟶
γ
2
in classical mean for each k
,
n
∈
N
0. The matrix A defines a summability method A or a matrix transformation by (21).(b) Absolute Summability. A sequence z
=
(
z
k
)
∈
w
* is said to be absolutely summable with index p to a number ζ
∈
C
* if the series on the right hand side of (21) *-converge for each n
∈
N and
(23)
∑
n
=
0
∞
‍
d
*
(
(
A
z
)
n
,
θ
*
)
p
¨
=
ζ
(
1
<
p
<
∞
)
.The Cesàro transform of a sequencez
=
(
z
k
*
)
∈
w
* is given by C
1
*
⊙
z
=
{
(
C
1
*
z
)
n
}
n
∈
N, where the Cesàro method C
1
* of one order is given by Example 12. Now, following Example 12, we may state the Cesàro summability with respect to the non-Newtonian calculus which is analogous to the classical Cesàro summable.Example 13.
Suppose thatz
=
(
z
k
*
) is an infinite sequence defined by
(24)
z
k
*
=
{
1
*
,
k
even
,
⊖
1
*
,
k
odd
,
where ⊖
1
*
=
(
-
˙
1
˙
,
-
¨
1
¨
)
∈
C
*. One can easily conclude that z
k
*
∈
l
∞
*
∖
c
*. Then, since θ
*
≤
¨
∥
¨
(
C
1
*
z
)
n
∥
¨
≤
¨
(
1
/
(
n
+
1
)
)
* for all n
∈
N, *
lim
⁡
n
→
∞
⁡
(
C
1
*
z
)
n
=
θ
*. This means that the *-divergent sequence (
z
k
*
) is C
1
*-summable to θ
*.Tekin and Başar [24] have introduced the sets l
∞
*, c
*, c
0
* and l
p
* of all bounded, convergent, null, and absolutely p-summable sequences over the complex field C
* which correspond to the sets l
∞
,
c
,
c
0 and l
p over the complex field C, respectively. That is to say that
(25)
l
∞
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
sup
⁡
k
∈
N
∥
¨
z
k
*
∥
¨
<
∞
}
,
c
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
∃
l
∈
C
*
∋
*


lim
⁡
k
→
∞
z
k
*
=
l
}
,
c
0
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
*


lim
⁡
k
→
∞
z
k
*
=
θ
*
}
,
l
p
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
*



∑
k
=
1
∞
‍
∥
¨
z
k
*
∥
¨
p
¨
<
∞
}
,
(
1
≤
p
<
∞
)
.
It is not hard to show that the sets l
∞
*, c
*, c
0
*, and l
p
* are the subspaces of the space ω
*. This means that l
∞
*, c
*, c
0
*, and l
p
* are classical sequence spaces over the field C
* and complete metric spaces with corresponding metrics.Quite recently, Kadak [21] have introduced the sets b
s
*, c
s
*, and c
s
0
* consisting of the sets of all bounded, convergent, and null series based on the non-Newtonian calculus, as follows:
(26)
b
s
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
∥
x
∥
b
s
*
=
sup
⁡
n
∈
N
∥
¨
*


∑
k
=
0
n
‍
x
k
∥
¨
<
∞
}
,
c
s
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
(



*


∑
k
=
0
n
‍
x
k
)
∈
c
*
}
,
c
s
0
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
(
*


∑
k
=
0
n
‍
x
k
)
∈
c
0
*
}
,
i
ω
*
=
{
x
=
(
x
k
)
:
x
k
∈
C
*
∀
k
∈
N
}
.Theorem 14 (see [24]).
The following statements hold.(a)
The setsl
∞
*, c
*, c
0
*, and l
p
*; p
≥
1 are sequence spaces.
(b)
Letλ
* denote any of the spaces l
∞
*, c
*, and c
0
* and z
=
(
z
k
*
), t
=
(
t
k
*
)
∈
λ
*. Define d
∞
* on the space λ
* by d
∞
*
(
z
,
t
)
=
sup
⁡
k
∈
N
∥
¨
z
k
*
⊖
t
k
*
∥
¨. Then, (
λ
*
,
d
∞
*
) is a complete metric space.
(c)
The spacesl
∞
*, c
*, and c
0
* are Banach spaces with the norm ∥
z
∥
∞
* defined by
(27)
∥
z
∥
∞
*
∶
=
sup
⁡
k
∈
N
∥
¨
z
k
*
∥
¨
;
z
=
(
z
k
*
)
∈
λ
*
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
λ
∈
{
l
∞
,
c
,
c
0
}
.
(d)
The spacel
p
* is Banach spaces with the norm ∥
z
∥
p
* defined by
(28)
∥
z
∥
p
*
∶
=
(
*


∑
k
=
0
∞
‍
∥
¨
z
k
*
∥
¨
p
¨
)
1
¨
/
¨
p
¨
;
z
=
(
z
k
*
)
∈
l
p
*
.Theorem 15 (see [21]).
Letμ
* denote any of the spaces b
s
*, c
s
*, and c
s
0
*, and z
=
(
z
k
*
), t
=
(
t
k
*
)
∈
μ
*. Define d
∞
N on the space μ
* by
(29)
d
∞
N
:
μ
*
×
μ
*
⟶
R
β
(
z
,
t
)
⟶
d
∞
N
(
z
,
t
)
i
i
i
i
i
i
i
i
i
i
i
i
∶
=
sup
⁡
n
∈
N
{
d
*
(




*


∑
k
=
0
n
‍
z
k
*
,


*


∑
k
=
0
n
‍
t
k
*
)
}
for arbitrarily chosen α
,
β operators and corresponding function ι
=
β
α
-
1. Then, (
μ
*
,
d
∞
N
) is a complete metric space.Corollary 16 (see [21]).
The spacesb
s
*, c
s
*, and c
s
0
* are Banach spaces with the norm ∥
x
∥
b
s
* defined by
(30)
∥
x
∥
b
s
*
=
∥
x
∥
c
s
*
=
sup
⁡
n
∈
N
∥
¨



*


∑
k
=
1
n
‍
x
k
∥
¨
;
x
=
(
x
n
)
∈
λ
*
,
λ
∈
{
b
s
,
c
s
,
c
s
0
}
.Theorem 17 (see [21]).
Letd
Δ be defined on the space b
v
* by
(31)
d
Δ
:
b
v
*
×
b
v
*
⟶
R
β
(
z
,
t
)
⟶
d
Δ
(
z
,
t
)
i
i
i
i
i
i
i
i
i
i
i
i
∶
=



*


∑
k
=
0
∞
‍
{
d
*
[
(
Δ
z
)
k
′
,
(
Δ
t
)
k
′
]
}
,
where z
=
(
z
k
), t
=
(
t
k
)
∈
b
v
*, and (
Δ
z
)
k
′
=
z
k
⊖
z
k
+
1. Then, (
b
v
*
,
d
Δ
) is a complete metric space.Firstly, we give the alpha-, beta-, and gamma-duals of a setλ
*
⊂
ω
* which are, respectively, denoted by {
λ
*
}
α, {
λ
*
}
β, and {
λ
*
}
γ, as follows:
(32)
{
λ
*
}
α
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
i
=
(
w
k
*
⊙
z
k
*
)
∈
l
1
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
{
λ
*
}
β
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
=
(
w
k
*
⊙
z
k
*
)
∈
c
s
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
{
λ
*
}
γ
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
i
=
(
w
k
*
⊙
z
k
*
)
∈
b
s
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
where (
w
k
*
⊙
z
k
*
) is the coordinatewise product of *-complex numbers w and z for all k
∈
N. Then {
λ
*
}
β is called beta-dual of λ
* or the set of all convergence factor sequences of λ
* in c
s
*. Firstly, we give a remark concerning with the *-convergence factor sequences.Theorem 18 (see [21]).
The following statements hold.(a)
{
c
0
*
}
β
=
{
c
*
}
β
=
{
l
∞
*
}
β
=
l
1
*.
(b)
{
l
1
*
}
β
=
l
∞
*.Theorem 19 (see [21]).
The following statements hold.(a)
{
c
s
*
}
α
=
{
b
v
*
}
α
=
{
b
v
0
*
}
α
=
l
1
*.
(b)
{
c
s
*
}
β
=
b
v
*, {
b
v
*
}
β
=
c
s
*, {
b
v
0
*
}
β
=
b
s
*, {
b
s
*
}
β
=
b
v
0
*.
(c)
{
c
s
*
}
γ
=
b
v
*, {
b
v
*
}
γ
=
b
s
*, {
b
v
0
*
}
γ
=
b
s
*, {
b
s
*
}
γ
=
b
v
*.Now, we give the characterizations of some matrix classes and state the necessary and sufficient condition on non-Newtonian matrix transformations by using the results given on Köthe-Toeplitz duals in [21].Theorem 20.
The following statements hold:(i)
A
=
(
a
n
k
)
∈
(
l
∞
*
:
l
∞
*
) if and only if
(33)
M
=
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
<
¨
∞
.
(ii)
A
=
(
a
n
k
)
∈
(
c
*
:
l
∞
*
) if and only if (33) holds.
(iii)
A
=
(
a
n
k
)
∈
(
c
0
*
:
l
∞
*
) if and only if (33) holds.
(iv)
A
=
(
a
n
k
)
∈
(
l
p
*
:
l
∞
*
) if and only if
(34)
C
=
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
p
¨
<
¨
∞
,
(
0
¨
≤
p
¨
<
∞
)
.Proof.
Since the proof can also be obtained in the similar way for other cases, to avoid the repetition of the similar statements, we prove only case (i).
Suppose that condition (33) holds and x
=
(
x
k
)
∈
l
∞
*. In this situation, since (
a
n
k
*
)
k
∈
N
∈
{
l
∞
*
}
β
=
l
1
* for every fixed n
∈
N, the *
A-transform of x exists. Taking into account the hypothesis, one can easily observe that
(35)
sup
⁡
n
∈
N
d
*
(
(
A
x
)
n
,
θ
*
)
=
sup
⁡
n
∈
N
d
*
(




*


∑
k
‍
a
n
k
*
⊙
x
k
,
θ
*
)
≤
¨
∥
x
∥
∞
*
×
¨
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
<
∞
,
which leads us to the fact that A
⊙
x
∈
l
∞
*, as desired.
Conversely, suppose thatA
∈
(
l
∞
*
:
l
∞
*
). Put A
⊙
x
=
{
(
A
x
)
n
}
n
∈
N and observe that (
A
x
)
n is a sequence of bounded linear operators on l
∞
* such that sup
⁡
n
d
*
(
(
A
x
)
n
,
θ
*
)
<
∞. Hence the results are obtained similarly from an application of Banach-Steinhaus theorem in classical mean.Example 21.
Let(
x
k
*
)
=
(
ε
˙
k
,
δ
¨
k
)
∈
l
∞
* and define the matrix A
=
(
a
n
k
*
) by
(36)
a
n
k
*
∶
=
{
x
k
*
,
k
=
n
,
θ
*
,
k
≠
n
,
for all k
,
n
∈
N. Then ∥
¨
a
n
k
*
∥
¨
=
β
{
ε
k
2
+
δ
k
2
} holds for k
=
n otherwise θ
*. By taking into account (
x
k
*
)
∈
l
∞
*, we obtain
(37)
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
=
sup
⁡
n
∈
N
{
β
ε
0
2
+
δ
0
2
,
β
ε
1
2
+
δ
1
2
,
…
,
β
ε
n
2
+
δ
n
2
,
…
,
}
<
∞
for all ε
k
,
δ
k
∈
R. This shows, by (i) of Theorem 20, that A
=
(
a
n
k
*
)
∈
(
l
∞
*
:
l
∞
*
).We state and prove the Kojima-Schur theorem which gives the necessary and sufficient conditions on an infinite matrix with respect to the non-Newtonian calculus, that maps the spacec
* into itself. A matrix satisfying the conditions of the Kojima-Schur theorem is called a conservative matrix or convergence preserving matrix.Theorem 22 (Kojima-Schur).
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
) if and only if (33) holds, and there exist α
k
,
l
∈
C
* such that
(38)
*



lim
⁡
n
→
∞
a
n
k
*
=
α
k
f
o
r
e
a
c
h
k
∈
N
,
(39)
*



lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
=
l
.Proof.
Suppose that the conditions (33), (38), and (39) hold and x
=
(
x
k
*
)
∈
c
* with x
k
*
→
s
∈
C
* as k
→
∞. Then, since (
a
n
k
)
k
∈
N
∈
{
c
*
}
β
=
l
1
* for each n
∈
N, the *
A-transform of x exists. In this situation, the equality
(40)
*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{




*


∑
k
‍
a
n
k
*
⊙
(
x
k
*
⊖
s
)
}
⊕
{
s
⊙




*


∑
k
‍
a
n
k
*
}
holds for each n
∈
N. In (40), since the terms on the right hand side tend to*


∑
k
‍
α
k
⊙
(
x
k
*
⊖
s
) by (38) and the second term on the right hand side tends to l
⊙
s by (39) as n
→
∞, in the sense of *-limit, we have
(41)
*


lim
⁡
n
→
∞



*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{



*


∑
k
‍
α
k
⊙
(
x
k
*
⊖
s
)
}
⊕
l
⊙
s
.
Hence, A
x
∈
c
*; that is the conditions are sufficient.
Conversely, suppose thatA
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
). Then A
⊙
x exists for every x
∈
c
*. By e and e
(
n
), we denote the sequences such that e
k
=
1
* for k
=
0,1
,
…, and e
n
(
n
)
=
1
* and e
k
(
n
)
=
θ
*
(
k
≠
n
). The necessity of the conditions (38) and (39) is immediate by taking x
=
e
(
k
) and x
=
e, respectively. Since c
*
⊂
l
∞
*, the necessity of the condition (33) is obtained from Theorem 20(i).Theorem 23.
A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
) if and only if (33) holds and there exists (
α
k
*
)
∈
w
* such that
(42)
*



lim
⁡
n
→
∞
d
*
(
a
n
k
*
,
α
k
*
)
=
θ
*
for each k
∈
N. If A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
), then (
α
k
*
)
∈
l
1
* and *


lim
⁡
n
→
∞

*

∑
k
‍
a
n
k
*
⊙
z
k
*
=

*

∑
k
‍
α
k
*
⊙
z
k
*.Proof.
Suppose that (33) and (42) hold. Then there exists an n
K
∈
N for K
∈
N and ε
¨
>
¨
0 such that
(43)
β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
α
k
*
)
<
ε
¨
,
for all n
≥
n
K. Since
(44)
β

∑
k
=
0
k
‍
d
*
(
α
k
*
,
θ
*
)
≤
¨




β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
α
k
*
)
+
¨
β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
θ
*
)
≤
ε
¨
+
¨
M
for n
≥
n
K, by (42), one can see that (
α
k
*
)
∈
l
1
* and β
∑
k
‍
d
*
(
α
k
*
,
θ
*
)
≤
M
0. Let z
=
(
z
k
*
)
∈
c
0
*. Then, one can choose a k
0
∈
N for ε
¨
1
>
¨
0 such that d
*
(
z
k
*
,
θ
*
)
<
¨
ε
¨
1 for each fixed k
≥
k
0. Additionally, since a
n
k
*
→
*
α
k
*, as n
→
∞ by (42), we have a
n
k
*
⊙
z
k
*
→
*
α
k
*
⊙
z
k
*, as n
→
∞ for each fixed k
∈
N. That is to say that*
lim
⁡
n
→
∞
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
=
θ
*. Hence, there exists an N
=
N
(
k
0
)
∈
N such that β

∑
k
=
0
k
0
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
<
¨
ε
¨
2 for all n
≥
N. Thus, since
(45)
d
*
(




*


∑
k
‍
a
n
k
*
⊙
z
k
*
,



*


∑
k
‍
α
k
*
⊙
z
k
*
)
≤
¨



β

∑
k
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
=



β

∑
k
=
0
k
0
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
+
¨


β



∑
k
=
k
0
+
1
∞
d
*
(
a
n
k
*
z
k
*
,
α
k
*
z
k
*
)
≤
¨
ε
¨
2
+
¨


β



∑
k
=
k
0
+
1
∞
‍
[
d
*
(
a
n
k
*
⊙
z
k
*
,
θ
*
)
+
¨
d
*
(
α
k
*
⊙
z
k
*
,
θ
*
)
]
≤
¨
ε
¨
2
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
a
n
k
*
,
θ
*
)
d
*
(
z
k
*
,
θ
*
)
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
α
k
*
,
θ
*
)
d
*
(
z
k
*
,
θ
*
)
≤
¨
ε
¨
2
+
¨
{
ε
1
×
¨
(




β



∑
k
=
k
0
+
1
∞
‍
d
*
(
a
n
k
*
,
θ
*
)
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
α
k
*
,
θ
*
)
)
}
≤
¨
ε
¨
2
+
¨
[
ε
1
×
¨
(
M
+
¨
M
0
)
]
for all n
≥
N, the series *

∑
k
‍
a
n
k
*
⊙
z
k
* are *-convergent for each n
∈
N and *

∑
k
‍
a
n
k
*
⊙
z
k
*
→
*
*



∑
‍
α
k
*
⊙
z
k
*, as n
→
∞. This means that A
⊙
z
∈
c
*.
Conversely, letA
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
) and let z
=
(
z
k
*
)
∈
c
0
*. Then, since A
⊙
z
∈
c
* exists and the inclusion (
c
0
*
:
c
*
)
⊂
(
c
0
*
:
l
∞
*
) holds, the necessity of (33) is trivial by (iii) of Theorem 20. Now, if we take the sequence z
(
n
)
=
{
z
k
(
n
)
}
∈
c
0
*, then A
⊙
z
(
n
)
=
{
a
n
k
*
}
n
=
0
∞
∈
c
* holds for each fixed k
∈
N; that is, condition (42) is also necessary. Thus, the proof is completed.As an easy consequence of Theorem23, we have the following corollary.Corollary 24.
A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
0
*
) if and only if (33) holds and (42) also holds with α
k
*
=
θ
* for all k
∈
N.Example 25.
Letk
,
n
,
r
∈
N and r
≥
0. The Cesaro means of order r is defined by the matrix C
r
*
=
(
c
n
k
*
(
r
)
) as
(46)
(
c
n
k
*
(
r
)
)
=
{
(
(
n
-
k
+
r
-
1
n
-
k
)
(
n
+
r
n
)
)
*
;
if
k
≤
n
0
*
;
otherwise
.
Taking r
=
2 we obtain an infinite matrix as follows: (47)
C
2
*
=
(
1
*
θ
*
θ
*
θ
*
θ
*
⋯
(
2
3
)
*
(
1
3
)
*
θ
*
θ
*
θ
*
⋯
(
3
6
)
*
(
2
6
)
*
(
1
6
)
*
θ
*
θ
*
⋯
⋮
⋮
⋮
⋮
⋮
⋮
(
2
n
+
2
)
*
(
2
n
(
n
+
1
)
(
n
+
2
)
)
*
⋯
(
2
(
n
-
k
+
1
)
(
n
+
1
)
(
n
+
2
)
)
*
θ
*
⋯
⋮
⋮
⋮
⋮
⋮
⋮
)
.One can easily conclude that sup
⁡
n
∈
N
β

∑
k
‍
∥
¨
c
n
k
*
(
2
)
∥
¨
<
¨
∞ for all k
∈
N and (33) holds. On the other hand,
(48)
*



lim
⁡
n
→
∞
∥
¨
c
n
k
*
(
2
)
∥
¨
=

*



lim
⁡
n
→
∞
∥
¨
(
2
(
n
-
k
+
1
)
(
n
+
1
)
(
n
+
2
)
)
*
∥
¨
=
θ
*
so (42) also holds with α
k
*
=
θ
* for all k
∈
N. Therefore C
2
*
∈
(
c
0
*
:
c
0
*
).A matrix satisfying the conditions of the Silverman-Toeplitz theorem is called a Toeplitz matrix or regular matrix. By(
c
*
:
c
*
;
p
), we denote the class of Toeplitz matrices. Now, we may give the corollaries characterizing the classes of (
c
*
:
c
*
;
p
).Corollary 26 (Silverman-Toeplitz Theorem).
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
;
p
) if and only if (33) holds and (38) and (39) also hold with α
k
*
=
θ
* for all k
∈
N and l
=
1
*, respectively.Example 27.
Example25 can be given as an example of Silverman-Toeplitz theorem. Because the conditions (33) and (38) hold with α
k
*
=
θ
*. Furthermore we have *


lim
⁡
n
→
∞

∑
k
‍
∥
¨
c
n
k
*
(
2
)
∥
¨
=
1
* and (39) also holds.Theorem 28.
A
=
(
a
n
k
*
)
∈
(
l
∞
*
:
c
0
*
) if and only if
(49)
*



lim
⁡
n
→
∞


*


∑
k
d
*
(
a
n
k
*
,
θ
*
)
=
θ
*
.Proof.
LetA
=
(
a
n
k
*
)
∈
(
l
∞
*
:
c
0
*
) and u
=
(
u
k
*
)
∈
l
∞
*. Then, the series *


∑
k
‍
a
n
k
*
⊙
u
k
*
*-converges to θ
* for each fixed n
∈
N, since A
⊙
u exists. Hence, A
n
*
∶
=
{
a
n
k
*
}
k
=
0
∞
∈
{
l
∞
*
}
β for all n
∈
N. Define the sequence u
=
(
u
k
*
)
∈
l
∞
* by u
k
*
∶
=
(
1
*
,
1
*
,
1
*
,
…
,
) for all k
∈
N. Then, A
⊙
u
∈
c
0
* which yields for all n
∈
N that
(50)
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
u
k
*
=
i
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
1
*
=
i
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
=
θ
*
.
Furthermore we obtain
(51)
*


lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
*
,
θ
*
)
=
i
*


lim
⁡
n
→
∞


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
≤
¨
∥
¨
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
∥
¨
=
θ
*
.
Conversely, suppose that (49) holds and u
=
(
u
k
*
)
∈
l
∞
*. Then, since A
n
*
∈
{
l
∞
*
}
β
=
l
1
* for each n
∈
N, A
⊙
u exists. Therefore, one can observe, by using condition (49), that
(52)
*


lim
⁡
n
→
∞
d
*
(
(
A
u
)
n
,
θ
*
)
=
*



lim
⁡
n
→
∞
d
*
(




*


∑
k
‍
a
n
k
*
⊙
u
k
*
,
θ
*
)
≤
¨
*



lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
⊙
u
k
,
θ
*
)
≤
¨
*



lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
,
θ
*
)
×
¨
d
*
(
u
k
,
θ
*
)
≤
¨
sup
⁡
k
∈
N
d
*
(
u
k
,
θ
*
)
×
¨
*


lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
,
θ
*
)
=
θ
*
which means that A
⊙
u
∈
c
0
*, as desired.Theorem 29.
A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
*
) if and only if (38) holds, and
(53)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(
Δ
a
n
k
*
,
θ
*
)
<
¨
∞
w
h
e
r
e
Δ
a
n
k
*
=
a
n
k
*
⊖
a
n
,
k
+
1
*
∀
n
,
k
∈
N
.Proof.
Letx
=
(
x
k
*
)
∈
c
s
* with *


∑
k
‍
x
k
*
=
s and y
k
*
=
*


∑
j
=
0
k
‍
x
j
* for all k
∈
N. Define the infinite matrix B
=
(
b
n
k
*
) by B
=
(
b
n
k
*
)
=
(
Δ
a
n
k
*
) for all k
,
n
∈
N. Suppose that A
∈
(
c
s
*
:
c
*
). Then, A
⊙
x exists for every x
=
(
x
k
*
)
∈
c
s
* and is in c
*. Since this also holds for x
=
e
(
k
)
∈
c
s
* for each fixed k
∈
N, the necessity of (38) is clear. Consider the following relation obtained frommth-partial sums of the series *


∑
k
‍
a
n
k
*
⊙
x
k
* by applying Abel's partial summation. In this situation, the equalities
(54)
*


∑
k
=
0
m
‍
a
n
k
*
⊙
x
k
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
y
k
*
}
⊕
a
n
m
*
⊙
y
m
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
(
y
k
*
⊖
s
)
}
⊕
{
s
⊙



*


∑
k
=
0
m
-
1
‍
Δ
a
n
k
*
}
⊕
a
n
m
*
⊙
y
m
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
(
y
k
*
⊖
s
)
}
⊕
[
s
⊙
(
a
n
0
*
⊖
a
n
m
*
)
]
⊕
a
n
m
*
⊙
y
m
*
∀
m
,
n
∈
N
.
Therefore, we derive by passing to limit in (54) as m
→
∞ that
(55)
(
A
x
)
n
=




*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{




*


∑
k
‍
b
n
k
*
⊙
(
y
k
*
⊖
s
)
}
⊕
(
s
⊙
a
n
0
*
)
for all n
∈
N. Since*
lim
⁡
n
(
A
x
)
n exists and*
lim
⁡
n
a
n
0
*
=
α
0
*, we see by letting n
→
∞ in (55) that*
lim
⁡
n
*


∑
k
‍
b
n
k
*
⊙
(
y
k
*
⊖
s
) also exist. This yields the fact that B
∈
(
c
0
*
:
c
*
), because y
⊖
s
∈
c
0
* if and only if x
∈
c
s
*. Hence, the matrix B
=
(
b
n
k
*
) satisfies the condition (33) which is equivalent to the condition (53); that is the condition (53) is necessary.
Conversely, suppose that conditions (38) and (53) hold. First, (53) implies A
n
*
=
(
a
n
k
*
)
k
∈
N
∈
{
c
s
*
}
β
=
b
v
*
⊂
l
∞
* for every fixed n
∈
N; hence, A
⊙
x exists for every x
∈
c
s
*. Also (38) and (53) imply by Corollary 24 that B
=
(
b
n
k
*
)
∈
(
c
0
*
:
c
0
*
). Thus, it follows from (55) that
(56)
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
s
⊙
α
0
*
.
Hence A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
*
). This completes the proof.Theorem 30.
A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
s
*
) if and only if
(57)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(




*


∑
j
=
0
n
‍
Δ
a
j
k
*
,
θ
*
)
<
¨
∞
,
(58)
*


lim
⁡
n
→
∞
d
*
(




*


∑
n
‍
a
n
k
*
,
α
k
*
)
=
θ
*
,
where α
k
*
∈
C
* for each k
∈
N.Proof.
Letx
=
(
x
k
*
)
∈
c
s
* and define the matrix C
=
(
c
n
k
*
) by c
n
k
=
*


∑
j
=
0
n
‍
a
j
k
* as follows:(59)
C
=
(
a
00
*
a
01
*
a
02
*
⋯
a
0
k
*
a
00
*
⊕
a
10
*
a
01
*
⊕
a
11
*
a
02
*
⊕
a
12
*
⋯
a
0
k
*
⊕
a
1
k
*
a
00
*
⊕
a
10
*
⊕
a
20
*
a
01
*
⊕
a
11
*
⊕
a
21
*
a
02
*
⊕
a
12
*
⊕
a
22
*
⋯
a
0
k
*
⊕
a
1
k
*
⊕
a
2
k
*
⋮
⋮
⋮
⋯
⋮
a
00
*
⊕
a
10
*
⊕
⋯
⊕
a
n
0
*
a
01
*
⊕
a
11
*
⊕
⋯
⊕
a
n
1
*
a
02
*
⊕
a
12
*
⊕
⋯
⊕
a
n
2
*
⋯
a
0
k
*
⊕
a
1
k
*
⊕
⋯
⊕
a
n
k
*
)for all k
,
n
∈
N. Suppose that A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
s
*
). Then, A
⊙
x exists for every x
=
(
x
k
*
)
∈
c
s
* and is in c
s
*. This yields for x
=
e
(
k
)
∈
c
s
* for each fixed k
∈
N that the condition (58) is necessary. It is clear that the following equality
(60)
*


∑
j
=
0
n



‍
*


∑
k
=
0
m
‍
a
j
k
*
⊙
x
k
*
=



*


∑
k
=
0
m



*


‍
∑
j
=
0
n
‍
a
j
k
*
⊙
x
k
*
=




*


∑
k
=
0
m
‍
c
n
k
*
⊙
x
k
*
derived fromnth andmth-partial sums of the double series *


∑
j
*


∑
k
‍
a
j
k
*
⊙
x
k
* holds for all m
,
n
∈
N. Therefore, by letting m
→
∞ in (60) we have
(61)
*


∑
j
=
0
n
‍
(
A
x
)
j
=
(
C
x
)
n
∀
n
∈
N
.
Then, since A
⊙
x
∈
c
s
* by the hypothesis, *
lim
⁡
n
∑
j
=
0
n
‍
(
A
x
)
j exists, on the left hand side of (61), which leads us to the consequence that C
=
(
c
n
k
*
)
∈
(
c
s
*
:
c
*
). Therefore, condition (53) of Theorem 29 is satisfied by the matrix C
=
(
c
n
k
*
) which is equivalent to condition (57).
Conversely, suppose that conditions (57) and (58) hold, which imply the existence of the A-transform of x
∈
c
s
*. Then, since (61) also holds, the matrix C satisfies the conditions of Theorem 29. Hence, *
lim
⁡
n
(
C
x
)
n exists which says by (61) that A
⊙
x
∈
c
s
*, as was desired.Theorem 31.
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
s
*
) if and only if (58) holds and
(62)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(
∑
j
=
0
n
‍
a
j
k
*
,
θ
*
)
<
¨
∞
,
(63)
*


∑
n



‍
*


∑
k
‍
a
n
k
*
is
*


-
c
o
n
v
e
r
g
e
n
t
,
∀
k
,
n
∈
N
0
.Proof.
Letx
=
(
x
k
*
)
∈
c
* and define the matrix C
=
(
c
n
k
*
) as in the proof of Theorem 30. Suppose that A
=
(
a
n
k
*
)
∈
(
c
*
:
c
s
*
). Then, A
⊙
x exists for every x
∈
c
* and is in c
s
*. This yields for x
=
e
(
k
)
∈
c
* and x
=
e
∈
c
* which give the necessity of the conditions (58) and (63), respectively. It is clear that we have the relation (61), derived by the same way used in the proof of Theorem 30. Then, since A
⊙
x
∈
c
s
*, that is, the series *

∑
j
‍
(
A
x
)
j  *-converges by the hypothesis *
lim
⁡
n
*

∑
j
=
0
n
‍
(
A
x
)
j exists, on the left hand side of (61), which leads us to the consequence that C
=
(
c
n
k
*
)
∈
(
c
*
:
c
*
). Therefore, condition (33) in Kojima-Schur theorem, is satisfied by the matrix C
=
(
c
n
k
*
) which is equivalent to condition (62).
Conversely, suppose that conditions (58), (62), and (63) hold, which imply the existence of the A-transform of x
∈
c
*. Then, since (61) also holds, the matrix C
=
(
c
n
k
*
) satisfies the conditions of Kojima-Schur theorem. Hence, *
lim
⁡
n
(
C
x
)
n exists which says by (61) that A
⊙
x
∈
c
s
*, as was desired.


## 3.1. Non-Newtonian Matrix Transformations

Letμ
1
*, μ
2
*
⊂
w
* and A
=
(
a
n
k
*
)
=
(
ε
˙
n
k
,
δ
¨
n
k
) be an infinite matrix of non-Newtonian complex numbers for all ε
˙
k
∈
R
α and δ
¨
k
∈
R
β. Then, we say that A defines a matrix mapping from μ
1
* into μ
2
* and denote it by writing A
:
μ
1
*
→
μ
2
*, if for every sequence z
=
(
z
k
*
)
∈
μ
1
* the sequence A
⊙
z
=
{
(
A
z
)
n
}, the A-transform of z, exists and is in μ
2
*, where
(20)
A
⊙
z
=
(
a
00
*
a
01
*
⋯
a
0
k
*
⋯
a
10
*
a
11
*
⋯
a
1
k
*
⋯
⋮
⋮
⋮
⋯
⋮
⋯
a
n
0
*
a
n
1
*
⋯
a
n
k
*
⋯
⋮
⋮
⋮
⋯
⋮
⋯
)
⊙
(
z
0
*
z
1
*
⋮
z
k
*
⋮
)
=
(
a
00
*
⊙
z
0
*
⊗
a
01
*
⊙
z
1
*
⊕
⋯
a
10
*
⊙
z
0
*
⊗
a
11
*
⊙
z
1
*
⊕
⋯
⋮
a
n
0
*
⊙
z
0
*
⊗
a
n
1
*
⊙
z
1
*
⊕
⋯
⋮
)
=
(










*


∑
k
‍
a
0
k
*
⊙
z
k
*






*


∑
k
‍
a
1
k
*
⊙
z
k
*
⋮






*


∑
k
‍
a
n
k
*
⊙
z
k
*
⋮
)
=
(
(
A
z
)
0
(
A
z
)
1
⋮
(
A
z
)
n
⋮
)
,
and, in this way, we transform the sequence z
=
(
z
k
*
)
=
(
μ
˙
k
,
η
¨
k
), with μ
˙
k
∈
R
α and η
¨
k
∈
R
β, into the sequence {
(
A
z
)
n
} by
(21)
(
A
z
)
n
∶
=




*


∑
k
‍
a
n
k
*
⊙
z
k
*
=
(
α
{
∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
)
}
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
β
{
∑
k
(
ε
n
k
η
k
+
δ
n
k
μ
k
)
‍
}
)
for all n
∈
N
0 and ε
,
δ
,
μ
,
η
∈
R. Thus, A
∈
(
μ
1
*
:
μ
2
*
) if and only if the series on the right side of (21) *-converges for each n
∈
N and every z
∈
μ
1
*, and we have A
⊙
z
=
{
(
A
z
)
n
}
n
∈
N
∈
μ
2
* for all z
∈
μ
1
*. On the other hand, we say A
∈
(
μ
1
*
:
μ
2
*
) if and only if the series ∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
) and ∑
k
‍
(
ε
n
k
η
k
+
δ
n
k
μ
k
) are convergent classically for all k
,
n
∈
N
0. A sequence z is said to be A-summable to γ if A
⊙
z
*-converges to γ
∈
C
* which is called as the A-
*


lim
⁡ of z. We denote thenth row of a matrix A
=
(
a
n
k
*
) by A
n
* for all n
∈
N; that is, A
n
*
∶
=
{
a
n
k
*
}
k
=
0
∞ for all n
∈
N. Following Başar [25], we give some lines about ordinary and absolute summability of non-Newtonian complex numbers.LetA
=
(
a
n
k
*
) be an infinite matrix of non-Newtonian complex numbers throughout. We define two kinds of summability: ordinary and absolute summability, as shortly mentioned, below.(a) Ordinary Summability. A sequence z
=
(
z
k
)
∈
w
* is said to be summable A to a γ
∈
C
* if the A-
*


lim
⁡ of z is γ
=
(
γ
˙
1
,
γ
¨
2
) for all γ
1
,
γ
2
∈
R; that is, *
lim
⁡
n
→
∞
d
*
(
(
A
z
)
n
,
γ
)
=
θ
* which implies that
(22)
∑
k
‍
(
ε
n
k
μ
k
-
δ
n
k
η
k
)
⟶
γ
1
,
∑
k
‍
(
ε
n
k
η
k
+
δ
n
k
μ
k
)
⟶
γ
2
in classical mean for each k
,
n
∈
N
0. The matrix A defines a summability method A or a matrix transformation by (21).(b) Absolute Summability. A sequence z
=
(
z
k
)
∈
w
* is said to be absolutely summable with index p to a number ζ
∈
C
* if the series on the right hand side of (21) *-converge for each n
∈
N and
(23)
∑
n
=
0
∞
‍
d
*
(
(
A
z
)
n
,
θ
*
)
p
¨
=
ζ
(
1
<
p
<
∞
)
.The Cesàro transform of a sequencez
=
(
z
k
*
)
∈
w
* is given by C
1
*
⊙
z
=
{
(
C
1
*
z
)
n
}
n
∈
N, where the Cesàro method C
1
* of one order is given by Example 12. Now, following Example 12, we may state the Cesàro summability with respect to the non-Newtonian calculus which is analogous to the classical Cesàro summable.Example 13.
Suppose thatz
=
(
z
k
*
) is an infinite sequence defined by
(24)
z
k
*
=
{
1
*
,
k
even
,
⊖
1
*
,
k
odd
,
where ⊖
1
*
=
(
-
˙
1
˙
,
-
¨
1
¨
)
∈
C
*. One can easily conclude that z
k
*
∈
l
∞
*
∖
c
*. Then, since θ
*
≤
¨
∥
¨
(
C
1
*
z
)
n
∥
¨
≤
¨
(
1
/
(
n
+
1
)
)
* for all n
∈
N, *
lim
⁡
n
→
∞
⁡
(
C
1
*
z
)
n
=
θ
*. This means that the *-divergent sequence (
z
k
*
) is C
1
*-summable to θ
*.Tekin and Başar [24] have introduced the sets l
∞
*, c
*, c
0
* and l
p
* of all bounded, convergent, null, and absolutely p-summable sequences over the complex field C
* which correspond to the sets l
∞
,
c
,
c
0 and l
p over the complex field C, respectively. That is to say that
(25)
l
∞
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
sup
⁡
k
∈
N
∥
¨
z
k
*
∥
¨
<
∞
}
,
c
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
∃
l
∈
C
*
∋
*


lim
⁡
k
→
∞
z
k
*
=
l
}
,
c
0
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
*


lim
⁡
k
→
∞
z
k
*
=
θ
*
}
,
l
p
*
=
{
z
*
=
(
z
k
*
)
∈
ω
*
:
*



∑
k
=
1
∞
‍
∥
¨
z
k
*
∥
¨
p
¨
<
∞
}
,
(
1
≤
p
<
∞
)
.
It is not hard to show that the sets l
∞
*, c
*, c
0
*, and l
p
* are the subspaces of the space ω
*. This means that l
∞
*, c
*, c
0
*, and l
p
* are classical sequence spaces over the field C
* and complete metric spaces with corresponding metrics.Quite recently, Kadak [21] have introduced the sets b
s
*, c
s
*, and c
s
0
* consisting of the sets of all bounded, convergent, and null series based on the non-Newtonian calculus, as follows:
(26)
b
s
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
∥
x
∥
b
s
*
=
sup
⁡
n
∈
N
∥
¨
*


∑
k
=
0
n
‍
x
k
∥
¨
<
∞
}
,
c
s
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
(



*


∑
k
=
0
n
‍
x
k
)
∈
c
*
}
,
c
s
0
*
∶
=
{
x
=
(
x
k
)
∈
ω
*
:
(
*


∑
k
=
0
n
‍
x
k
)
∈
c
0
*
}
,
i
ω
*
=
{
x
=
(
x
k
)
:
x
k
∈
C
*
∀
k
∈
N
}
.Theorem 14 (see [24]).
The following statements hold.(a)
The setsl
∞
*, c
*, c
0
*, and l
p
*; p
≥
1 are sequence spaces.
(b)
Letλ
* denote any of the spaces l
∞
*, c
*, and c
0
* and z
=
(
z
k
*
), t
=
(
t
k
*
)
∈
λ
*. Define d
∞
* on the space λ
* by d
∞
*
(
z
,
t
)
=
sup
⁡
k
∈
N
∥
¨
z
k
*
⊖
t
k
*
∥
¨. Then, (
λ
*
,
d
∞
*
) is a complete metric space.
(c)
The spacesl
∞
*, c
*, and c
0
* are Banach spaces with the norm ∥
z
∥
∞
* defined by
(27)
∥
z
∥
∞
*
∶
=
sup
⁡
k
∈
N
∥
¨
z
k
*
∥
¨
;
z
=
(
z
k
*
)
∈
λ
*
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
λ
∈
{
l
∞
,
c
,
c
0
}
.
(d)
The spacel
p
* is Banach spaces with the norm ∥
z
∥
p
* defined by
(28)
∥
z
∥
p
*
∶
=
(
*


∑
k
=
0
∞
‍
∥
¨
z
k
*
∥
¨
p
¨
)
1
¨
/
¨
p
¨
;
z
=
(
z
k
*
)
∈
l
p
*
.Theorem 15 (see [21]).
Letμ
* denote any of the spaces b
s
*, c
s
*, and c
s
0
*, and z
=
(
z
k
*
), t
=
(
t
k
*
)
∈
μ
*. Define d
∞
N on the space μ
* by
(29)
d
∞
N
:
μ
*
×
μ
*
⟶
R
β
(
z
,
t
)
⟶
d
∞
N
(
z
,
t
)
i
i
i
i
i
i
i
i
i
i
i
i
∶
=
sup
⁡
n
∈
N
{
d
*
(




*


∑
k
=
0
n
‍
z
k
*
,


*


∑
k
=
0
n
‍
t
k
*
)
}
for arbitrarily chosen α
,
β operators and corresponding function ι
=
β
α
-
1. Then, (
μ
*
,
d
∞
N
) is a complete metric space.Corollary 16 (see [21]).
The spacesb
s
*, c
s
*, and c
s
0
* are Banach spaces with the norm ∥
x
∥
b
s
* defined by
(30)
∥
x
∥
b
s
*
=
∥
x
∥
c
s
*
=
sup
⁡
n
∈
N
∥
¨



*


∑
k
=
1
n
‍
x
k
∥
¨
;
x
=
(
x
n
)
∈
λ
*
,
λ
∈
{
b
s
,
c
s
,
c
s
0
}
.Theorem 17 (see [21]).
Letd
Δ be defined on the space b
v
* by
(31)
d
Δ
:
b
v
*
×
b
v
*
⟶
R
β
(
z
,
t
)
⟶
d
Δ
(
z
,
t
)
i
i
i
i
i
i
i
i
i
i
i
i
∶
=



*


∑
k
=
0
∞
‍
{
d
*
[
(
Δ
z
)
k
′
,
(
Δ
t
)
k
′
]
}
,
where z
=
(
z
k
), t
=
(
t
k
)
∈
b
v
*, and (
Δ
z
)
k
′
=
z
k
⊖
z
k
+
1. Then, (
b
v
*
,
d
Δ
) is a complete metric space.Firstly, we give the alpha-, beta-, and gamma-duals of a setλ
*
⊂
ω
* which are, respectively, denoted by {
λ
*
}
α, {
λ
*
}
β, and {
λ
*
}
γ, as follows:
(32)
{
λ
*
}
α
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
i
=
(
w
k
*
⊙
z
k
*
)
∈
l
1
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
{
λ
*
}
β
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
=
(
w
k
*
⊙
z
k
*
)
∈
c
s
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
{
λ
*
}
γ
∶
=
{
w
=
(
w
k
*
)
∈
ω
*
:
w
⊙
z
iiiii
i
=
(
w
k
*
⊙
z
k
*
)
∈
b
s
*
∀
z
=
(
z
k
*
)
∈
λ
*
}
,
where (
w
k
*
⊙
z
k
*
) is the coordinatewise product of *-complex numbers w and z for all k
∈
N. Then {
λ
*
}
β is called beta-dual of λ
* or the set of all convergence factor sequences of λ
* in c
s
*. Firstly, we give a remark concerning with the *-convergence factor sequences.Theorem 18 (see [21]).
The following statements hold.(a)
{
c
0
*
}
β
=
{
c
*
}
β
=
{
l
∞
*
}
β
=
l
1
*.
(b)
{
l
1
*
}
β
=
l
∞
*.Theorem 19 (see [21]).
The following statements hold.(a)
{
c
s
*
}
α
=
{
b
v
*
}
α
=
{
b
v
0
*
}
α
=
l
1
*.
(b)
{
c
s
*
}
β
=
b
v
*, {
b
v
*
}
β
=
c
s
*, {
b
v
0
*
}
β
=
b
s
*, {
b
s
*
}
β
=
b
v
0
*.
(c)
{
c
s
*
}
γ
=
b
v
*, {
b
v
*
}
γ
=
b
s
*, {
b
v
0
*
}
γ
=
b
s
*, {
b
s
*
}
γ
=
b
v
*.Now, we give the characterizations of some matrix classes and state the necessary and sufficient condition on non-Newtonian matrix transformations by using the results given on Köthe-Toeplitz duals in [21].Theorem 20.
The following statements hold:(i)
A
=
(
a
n
k
)
∈
(
l
∞
*
:
l
∞
*
) if and only if
(33)
M
=
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
<
¨
∞
.
(ii)
A
=
(
a
n
k
)
∈
(
c
*
:
l
∞
*
) if and only if (33) holds.
(iii)
A
=
(
a
n
k
)
∈
(
c
0
*
:
l
∞
*
) if and only if (33) holds.
(iv)
A
=
(
a
n
k
)
∈
(
l
p
*
:
l
∞
*
) if and only if
(34)
C
=
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
p
¨
<
¨
∞
,
(
0
¨
≤
p
¨
<
∞
)
.Proof.
Since the proof can also be obtained in the similar way for other cases, to avoid the repetition of the similar statements, we prove only case (i).
Suppose that condition (33) holds and x
=
(
x
k
)
∈
l
∞
*. In this situation, since (
a
n
k
*
)
k
∈
N
∈
{
l
∞
*
}
β
=
l
1
* for every fixed n
∈
N, the *
A-transform of x exists. Taking into account the hypothesis, one can easily observe that
(35)
sup
⁡
n
∈
N
d
*
(
(
A
x
)
n
,
θ
*
)
=
sup
⁡
n
∈
N
d
*
(




*


∑
k
‍
a
n
k
*
⊙
x
k
,
θ
*
)
≤
¨
∥
x
∥
∞
*
×
¨
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
<
∞
,
which leads us to the fact that A
⊙
x
∈
l
∞
*, as desired.
Conversely, suppose thatA
∈
(
l
∞
*
:
l
∞
*
). Put A
⊙
x
=
{
(
A
x
)
n
}
n
∈
N and observe that (
A
x
)
n is a sequence of bounded linear operators on l
∞
* such that sup
⁡
n
d
*
(
(
A
x
)
n
,
θ
*
)
<
∞. Hence the results are obtained similarly from an application of Banach-Steinhaus theorem in classical mean.Example 21.
Let(
x
k
*
)
=
(
ε
˙
k
,
δ
¨
k
)
∈
l
∞
* and define the matrix A
=
(
a
n
k
*
) by
(36)
a
n
k
*
∶
=
{
x
k
*
,
k
=
n
,
θ
*
,
k
≠
n
,
for all k
,
n
∈
N. Then ∥
¨
a
n
k
*
∥
¨
=
β
{
ε
k
2
+
δ
k
2
} holds for k
=
n otherwise θ
*. By taking into account (
x
k
*
)
∈
l
∞
*, we obtain
(37)
sup
⁡
n
∈
N


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
=
sup
⁡
n
∈
N
{
β
ε
0
2
+
δ
0
2
,
β
ε
1
2
+
δ
1
2
,
…
,
β
ε
n
2
+
δ
n
2
,
…
,
}
<
∞
for all ε
k
,
δ
k
∈
R. This shows, by (i) of Theorem 20, that A
=
(
a
n
k
*
)
∈
(
l
∞
*
:
l
∞
*
).We state and prove the Kojima-Schur theorem which gives the necessary and sufficient conditions on an infinite matrix with respect to the non-Newtonian calculus, that maps the spacec
* into itself. A matrix satisfying the conditions of the Kojima-Schur theorem is called a conservative matrix or convergence preserving matrix.Theorem 22 (Kojima-Schur).
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
) if and only if (33) holds, and there exist α
k
,
l
∈
C
* such that
(38)
*



lim
⁡
n
→
∞
a
n
k
*
=
α
k
f
o
r
e
a
c
h
k
∈
N
,
(39)
*



lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
=
l
.Proof.
Suppose that the conditions (33), (38), and (39) hold and x
=
(
x
k
*
)
∈
c
* with x
k
*
→
s
∈
C
* as k
→
∞. Then, since (
a
n
k
)
k
∈
N
∈
{
c
*
}
β
=
l
1
* for each n
∈
N, the *
A-transform of x exists. In this situation, the equality
(40)
*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{




*


∑
k
‍
a
n
k
*
⊙
(
x
k
*
⊖
s
)
}
⊕
{
s
⊙




*


∑
k
‍
a
n
k
*
}
holds for each n
∈
N. In (40), since the terms on the right hand side tend to*


∑
k
‍
α
k
⊙
(
x
k
*
⊖
s
) by (38) and the second term on the right hand side tends to l
⊙
s by (39) as n
→
∞, in the sense of *-limit, we have
(41)
*


lim
⁡
n
→
∞



*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{



*


∑
k
‍
α
k
⊙
(
x
k
*
⊖
s
)
}
⊕
l
⊙
s
.
Hence, A
x
∈
c
*; that is the conditions are sufficient.
Conversely, suppose thatA
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
). Then A
⊙
x exists for every x
∈
c
*. By e and e
(
n
), we denote the sequences such that e
k
=
1
* for k
=
0,1
,
…, and e
n
(
n
)
=
1
* and e
k
(
n
)
=
θ
*
(
k
≠
n
). The necessity of the conditions (38) and (39) is immediate by taking x
=
e
(
k
) and x
=
e, respectively. Since c
*
⊂
l
∞
*, the necessity of the condition (33) is obtained from Theorem 20(i).Theorem 23.
A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
) if and only if (33) holds and there exists (
α
k
*
)
∈
w
* such that
(42)
*



lim
⁡
n
→
∞
d
*
(
a
n
k
*
,
α
k
*
)
=
θ
*
for each k
∈
N. If A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
), then (
α
k
*
)
∈
l
1
* and *


lim
⁡
n
→
∞

*

∑
k
‍
a
n
k
*
⊙
z
k
*
=

*

∑
k
‍
α
k
*
⊙
z
k
*.Proof.
Suppose that (33) and (42) hold. Then there exists an n
K
∈
N for K
∈
N and ε
¨
>
¨
0 such that
(43)
β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
α
k
*
)
<
ε
¨
,
for all n
≥
n
K. Since
(44)
β

∑
k
=
0
k
‍
d
*
(
α
k
*
,
θ
*
)
≤
¨




β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
α
k
*
)
+
¨
β

∑
k
=
0
k
‍
d
*
(
a
n
k
*
,
θ
*
)
≤
ε
¨
+
¨
M
for n
≥
n
K, by (42), one can see that (
α
k
*
)
∈
l
1
* and β
∑
k
‍
d
*
(
α
k
*
,
θ
*
)
≤
M
0. Let z
=
(
z
k
*
)
∈
c
0
*. Then, one can choose a k
0
∈
N for ε
¨
1
>
¨
0 such that d
*
(
z
k
*
,
θ
*
)
<
¨
ε
¨
1 for each fixed k
≥
k
0. Additionally, since a
n
k
*
→
*
α
k
*, as n
→
∞ by (42), we have a
n
k
*
⊙
z
k
*
→
*
α
k
*
⊙
z
k
*, as n
→
∞ for each fixed k
∈
N. That is to say that*
lim
⁡
n
→
∞
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
=
θ
*. Hence, there exists an N
=
N
(
k
0
)
∈
N such that β

∑
k
=
0
k
0
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
<
¨
ε
¨
2 for all n
≥
N. Thus, since
(45)
d
*
(




*


∑
k
‍
a
n
k
*
⊙
z
k
*
,



*


∑
k
‍
α
k
*
⊙
z
k
*
)
≤
¨



β

∑
k
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
=



β

∑
k
=
0
k
0
‍
d
*
(
a
n
k
*
⊙
z
k
*
,
α
k
*
⊙
z
k
*
)
+
¨


β



∑
k
=
k
0
+
1
∞
d
*
(
a
n
k
*
z
k
*
,
α
k
*
z
k
*
)
≤
¨
ε
¨
2
+
¨


β



∑
k
=
k
0
+
1
∞
‍
[
d
*
(
a
n
k
*
⊙
z
k
*
,
θ
*
)
+
¨
d
*
(
α
k
*
⊙
z
k
*
,
θ
*
)
]
≤
¨
ε
¨
2
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
a
n
k
*
,
θ
*
)
d
*
(
z
k
*
,
θ
*
)
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
α
k
*
,
θ
*
)
d
*
(
z
k
*
,
θ
*
)
≤
¨
ε
¨
2
+
¨
{
ε
1
×
¨
(




β



∑
k
=
k
0
+
1
∞
‍
d
*
(
a
n
k
*
,
θ
*
)
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
+
¨


β



∑
k
=
k
0
+
1
∞
‍
d
*
(
α
k
*
,
θ
*
)
)
}
≤
¨
ε
¨
2
+
¨
[
ε
1
×
¨
(
M
+
¨
M
0
)
]
for all n
≥
N, the series *

∑
k
‍
a
n
k
*
⊙
z
k
* are *-convergent for each n
∈
N and *

∑
k
‍
a
n
k
*
⊙
z
k
*
→
*
*



∑
‍
α
k
*
⊙
z
k
*, as n
→
∞. This means that A
⊙
z
∈
c
*.
Conversely, letA
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
*
) and let z
=
(
z
k
*
)
∈
c
0
*. Then, since A
⊙
z
∈
c
* exists and the inclusion (
c
0
*
:
c
*
)
⊂
(
c
0
*
:
l
∞
*
) holds, the necessity of (33) is trivial by (iii) of Theorem 20. Now, if we take the sequence z
(
n
)
=
{
z
k
(
n
)
}
∈
c
0
*, then A
⊙
z
(
n
)
=
{
a
n
k
*
}
n
=
0
∞
∈
c
* holds for each fixed k
∈
N; that is, condition (42) is also necessary. Thus, the proof is completed.As an easy consequence of Theorem23, we have the following corollary.Corollary 24.
A
=
(
a
n
k
*
)
∈
(
c
0
*
:
c
0
*
) if and only if (33) holds and (42) also holds with α
k
*
=
θ
* for all k
∈
N.Example 25.
Letk
,
n
,
r
∈
N and r
≥
0. The Cesaro means of order r is defined by the matrix C
r
*
=
(
c
n
k
*
(
r
)
) as
(46)
(
c
n
k
*
(
r
)
)
=
{
(
(
n
-
k
+
r
-
1
n
-
k
)
(
n
+
r
n
)
)
*
;
if
k
≤
n
0
*
;
otherwise
.
Taking r
=
2 we obtain an infinite matrix as follows: (47)
C
2
*
=
(
1
*
θ
*
θ
*
θ
*
θ
*
⋯
(
2
3
)
*
(
1
3
)
*
θ
*
θ
*
θ
*
⋯
(
3
6
)
*
(
2
6
)
*
(
1
6
)
*
θ
*
θ
*
⋯
⋮
⋮
⋮
⋮
⋮
⋮
(
2
n
+
2
)
*
(
2
n
(
n
+
1
)
(
n
+
2
)
)
*
⋯
(
2
(
n
-
k
+
1
)
(
n
+
1
)
(
n
+
2
)
)
*
θ
*
⋯
⋮
⋮
⋮
⋮
⋮
⋮
)
.One can easily conclude that sup
⁡
n
∈
N
β

∑
k
‍
∥
¨
c
n
k
*
(
2
)
∥
¨
<
¨
∞ for all k
∈
N and (33) holds. On the other hand,
(48)
*



lim
⁡
n
→
∞
∥
¨
c
n
k
*
(
2
)
∥
¨
=

*



lim
⁡
n
→
∞
∥
¨
(
2
(
n
-
k
+
1
)
(
n
+
1
)
(
n
+
2
)
)
*
∥
¨
=
θ
*
so (42) also holds with α
k
*
=
θ
* for all k
∈
N. Therefore C
2
*
∈
(
c
0
*
:
c
0
*
).A matrix satisfying the conditions of the Silverman-Toeplitz theorem is called a Toeplitz matrix or regular matrix. By(
c
*
:
c
*
;
p
), we denote the class of Toeplitz matrices. Now, we may give the corollaries characterizing the classes of (
c
*
:
c
*
;
p
).Corollary 26 (Silverman-Toeplitz Theorem).
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
*
;
p
) if and only if (33) holds and (38) and (39) also hold with α
k
*
=
θ
* for all k
∈
N and l
=
1
*, respectively.Example 27.
Example25 can be given as an example of Silverman-Toeplitz theorem. Because the conditions (33) and (38) hold with α
k
*
=
θ
*. Furthermore we have *


lim
⁡
n
→
∞

∑
k
‍
∥
¨
c
n
k
*
(
2
)
∥
¨
=
1
* and (39) also holds.Theorem 28.
A
=
(
a
n
k
*
)
∈
(
l
∞
*
:
c
0
*
) if and only if
(49)
*



lim
⁡
n
→
∞


*


∑
k
d
*
(
a
n
k
*
,
θ
*
)
=
θ
*
.Proof.
LetA
=
(
a
n
k
*
)
∈
(
l
∞
*
:
c
0
*
) and u
=
(
u
k
*
)
∈
l
∞
*. Then, the series *


∑
k
‍
a
n
k
*
⊙
u
k
*
*-converges to θ
* for each fixed n
∈
N, since A
⊙
u exists. Hence, A
n
*
∶
=
{
a
n
k
*
}
k
=
0
∞
∈
{
l
∞
*
}
β for all n
∈
N. Define the sequence u
=
(
u
k
*
)
∈
l
∞
* by u
k
*
∶
=
(
1
*
,
1
*
,
1
*
,
…
,
) for all k
∈
N. Then, A
⊙
u
∈
c
0
* which yields for all n
∈
N that
(50)
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
u
k
*
=
i
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
1
*
=
i
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
=
θ
*
.
Furthermore we obtain
(51)
*


lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
*
,
θ
*
)
=
i
*


lim
⁡
n
→
∞


β

∑
k
‍
∥
¨
a
n
k
*
∥
¨
≤
¨
∥
¨
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
∥
¨
=
θ
*
.
Conversely, suppose that (49) holds and u
=
(
u
k
*
)
∈
l
∞
*. Then, since A
n
*
∈
{
l
∞
*
}
β
=
l
1
* for each n
∈
N, A
⊙
u exists. Therefore, one can observe, by using condition (49), that
(52)
*


lim
⁡
n
→
∞
d
*
(
(
A
u
)
n
,
θ
*
)
=
*



lim
⁡
n
→
∞
d
*
(




*


∑
k
‍
a
n
k
*
⊙
u
k
*
,
θ
*
)
≤
¨
*



lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
⊙
u
k
,
θ
*
)
≤
¨
*



lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
,
θ
*
)
×
¨
d
*
(
u
k
,
θ
*
)
≤
¨
sup
⁡
k
∈
N
d
*
(
u
k
,
θ
*
)
×
¨
*


lim
⁡
n
→
∞


*


∑
k
‍
d
*
(
a
n
k
,
θ
*
)
=
θ
*
which means that A
⊙
u
∈
c
0
*, as desired.Theorem 29.
A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
*
) if and only if (38) holds, and
(53)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(
Δ
a
n
k
*
,
θ
*
)
<
¨
∞
w
h
e
r
e
Δ
a
n
k
*
=
a
n
k
*
⊖
a
n
,
k
+
1
*
∀
n
,
k
∈
N
.Proof.
Letx
=
(
x
k
*
)
∈
c
s
* with *


∑
k
‍
x
k
*
=
s and y
k
*
=
*


∑
j
=
0
k
‍
x
j
* for all k
∈
N. Define the infinite matrix B
=
(
b
n
k
*
) by B
=
(
b
n
k
*
)
=
(
Δ
a
n
k
*
) for all k
,
n
∈
N. Suppose that A
∈
(
c
s
*
:
c
*
). Then, A
⊙
x exists for every x
=
(
x
k
*
)
∈
c
s
* and is in c
*. Since this also holds for x
=
e
(
k
)
∈
c
s
* for each fixed k
∈
N, the necessity of (38) is clear. Consider the following relation obtained frommth-partial sums of the series *


∑
k
‍
a
n
k
*
⊙
x
k
* by applying Abel's partial summation. In this situation, the equalities
(54)
*


∑
k
=
0
m
‍
a
n
k
*
⊙
x
k
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
y
k
*
}
⊕
a
n
m
*
⊙
y
m
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
(
y
k
*
⊖
s
)
}
⊕
{
s
⊙



*


∑
k
=
0
m
-
1
‍
Δ
a
n
k
*
}
⊕
a
n
m
*
⊙
y
m
*
=
{



*


∑
k
=
0
m
-
1
‍
(
Δ
a
n
k
*
)
⊙
(
y
k
*
⊖
s
)
}
⊕
[
s
⊙
(
a
n
0
*
⊖
a
n
m
*
)
]
⊕
a
n
m
*
⊙
y
m
*
∀
m
,
n
∈
N
.
Therefore, we derive by passing to limit in (54) as m
→
∞ that
(55)
(
A
x
)
n
=




*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
{




*


∑
k
‍
b
n
k
*
⊙
(
y
k
*
⊖
s
)
}
⊕
(
s
⊙
a
n
0
*
)
for all n
∈
N. Since*
lim
⁡
n
(
A
x
)
n exists and*
lim
⁡
n
a
n
0
*
=
α
0
*, we see by letting n
→
∞ in (55) that*
lim
⁡
n
*


∑
k
‍
b
n
k
*
⊙
(
y
k
*
⊖
s
) also exist. This yields the fact that B
∈
(
c
0
*
:
c
*
), because y
⊖
s
∈
c
0
* if and only if x
∈
c
s
*. Hence, the matrix B
=
(
b
n
k
*
) satisfies the condition (33) which is equivalent to the condition (53); that is the condition (53) is necessary.
Conversely, suppose that conditions (38) and (53) hold. First, (53) implies A
n
*
=
(
a
n
k
*
)
k
∈
N
∈
{
c
s
*
}
β
=
b
v
*
⊂
l
∞
* for every fixed n
∈
N; hence, A
⊙
x exists for every x
∈
c
s
*. Also (38) and (53) imply by Corollary 24 that B
=
(
b
n
k
*
)
∈
(
c
0
*
:
c
0
*
). Thus, it follows from (55) that
(56)
*


lim
⁡
n
→
∞


*


∑
k
‍
a
n
k
*
⊙
x
k
*
=
s
⊙
α
0
*
.
Hence A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
*
). This completes the proof.Theorem 30.
A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
s
*
) if and only if
(57)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(




*


∑
j
=
0
n
‍
Δ
a
j
k
*
,
θ
*
)
<
¨
∞
,
(58)
*


lim
⁡
n
→
∞
d
*
(




*


∑
n
‍
a
n
k
*
,
α
k
*
)
=
θ
*
,
where α
k
*
∈
C
* for each k
∈
N.Proof.
Letx
=
(
x
k
*
)
∈
c
s
* and define the matrix C
=
(
c
n
k
*
) by c
n
k
=
*


∑
j
=
0
n
‍
a
j
k
* as follows:(59)
C
=
(
a
00
*
a
01
*
a
02
*
⋯
a
0
k
*
a
00
*
⊕
a
10
*
a
01
*
⊕
a
11
*
a
02
*
⊕
a
12
*
⋯
a
0
k
*
⊕
a
1
k
*
a
00
*
⊕
a
10
*
⊕
a
20
*
a
01
*
⊕
a
11
*
⊕
a
21
*
a
02
*
⊕
a
12
*
⊕
a
22
*
⋯
a
0
k
*
⊕
a
1
k
*
⊕
a
2
k
*
⋮
⋮
⋮
⋯
⋮
a
00
*
⊕
a
10
*
⊕
⋯
⊕
a
n
0
*
a
01
*
⊕
a
11
*
⊕
⋯
⊕
a
n
1
*
a
02
*
⊕
a
12
*
⊕
⋯
⊕
a
n
2
*
⋯
a
0
k
*
⊕
a
1
k
*
⊕
⋯
⊕
a
n
k
*
)for all k
,
n
∈
N. Suppose that A
=
(
a
n
k
*
)
∈
(
c
s
*
:
c
s
*
). Then, A
⊙
x exists for every x
=
(
x
k
*
)
∈
c
s
* and is in c
s
*. This yields for x
=
e
(
k
)
∈
c
s
* for each fixed k
∈
N that the condition (58) is necessary. It is clear that the following equality
(60)
*


∑
j
=
0
n



‍
*


∑
k
=
0
m
‍
a
j
k
*
⊙
x
k
*
=



*


∑
k
=
0
m



*


‍
∑
j
=
0
n
‍
a
j
k
*
⊙
x
k
*
=




*


∑
k
=
0
m
‍
c
n
k
*
⊙
x
k
*
derived fromnth andmth-partial sums of the double series *


∑
j
*


∑
k
‍
a
j
k
*
⊙
x
k
* holds for all m
,
n
∈
N. Therefore, by letting m
→
∞ in (60) we have
(61)
*


∑
j
=
0
n
‍
(
A
x
)
j
=
(
C
x
)
n
∀
n
∈
N
.
Then, since A
⊙
x
∈
c
s
* by the hypothesis, *
lim
⁡
n
∑
j
=
0
n
‍
(
A
x
)
j exists, on the left hand side of (61), which leads us to the consequence that C
=
(
c
n
k
*
)
∈
(
c
s
*
:
c
*
). Therefore, condition (53) of Theorem 29 is satisfied by the matrix C
=
(
c
n
k
*
) which is equivalent to condition (57).
Conversely, suppose that conditions (57) and (58) hold, which imply the existence of the A-transform of x
∈
c
s
*. Then, since (61) also holds, the matrix C satisfies the conditions of Theorem 29. Hence, *
lim
⁡
n
(
C
x
)
n exists which says by (61) that A
⊙
x
∈
c
s
*, as was desired.Theorem 31.
A
=
(
a
n
k
*
)
∈
(
c
*
:
c
s
*
) if and only if (58) holds and
(62)
sup
⁡
n
∈
N



*


∑
k
‍
d
*
(
∑
j
=
0
n
‍
a
j
k
*
,
θ
*
)
<
¨
∞
,
(63)
*


∑
n



‍
*


∑
k
‍
a
n
k
*
is
*


-
c
o
n
v
e
r
g
e
n
t
,
∀
k
,
n
∈
N
0
.Proof.
Letx
=
(
x
k
*
)
∈
c
* and define the matrix C
=
(
c
n
k
*
) as in the proof of Theorem 30. Suppose that A
=
(
a
n
k
*
)
∈
(
c
*
:
c
s
*
). Then, A
⊙
x exists for every x
∈
c
* and is in c
s
*. This yields for x
=
e
(
k
)
∈
c
* and x
=
e
∈
c
* which give the necessity of the conditions (58) and (63), respectively. It is clear that we have the relation (61), derived by the same way used in the proof of Theorem 30. Then, since A
⊙
x
∈
c
s
*, that is, the series *

∑
j
‍
(
A
x
)
j  *-converges by the hypothesis *
lim
⁡
n
*

∑
j
=
0
n
‍
(
A
x
)
j exists, on the left hand side of (61), which leads us to the consequence that C
=
(
c
n
k
*
)
∈
(
c
*
:
c
*
). Therefore, condition (33) in Kojima-Schur theorem, is satisfied by the matrix C
=
(
c
n
k
*
) which is equivalent to condition (62).
Conversely, suppose that conditions (58), (62), and (63) hold, which imply the existence of the A-transform of x
∈
c
*. Then, since (61) also holds, the matrix C
=
(
c
n
k
*
) satisfies the conditions of Kojima-Schur theorem. Hence, *
lim
⁡
n
(
C
x
)
n exists which says by (61) that A
⊙
x
∈
c
s
*, as was desired.


## 4. Conclusion

At the beginning of 1981, the wage-rate in dollars per hour at a certain company wasw
0 and the cost of living index for the United States was c
0. At the end of 1981, the amounts were w
1 and c
1, respectively. Company and union negotiators had agreed at the beginning of 1981 that, thereafter, the wage-rate would be adjusted to reflect changes in the cost of living index. Assuming that the cost of living index is always increasing and that the wage-rate changes “uniformly” and continuously relative to the cost of living index, find the wage-rate w
t at time t in terms of the constants c
0, c
1, w
0, and w
1 the cost of living index c
t at time t. There is no unique solution to this problem; we shall give two reasonable solutions (cf. [14]).Firstly, since the wage-rate changes “uniformly” relative to the cost of living index, we may reasonably assume that equal differences in the cost of living index give rise to equal differences in the wage-rate. Furthermore, since the changes are “continuously” relative to the cost of living index, it can be proved that(64)
w
t
=
w
0
+
[
w
1
-
w
0
c
1
-
c
0
]
(
c
t
-
c
0
)
.
Secondly, since the changes are “continuously” relative to the cost of living index, it can be given that
(65)
w
t
=
w
0
[
(
w
1
w
0
)
1
/
(
ln
⁡
c
1
-
ln
⁡
c
0
)
]
ln
⁡
c
t
-
ln
⁡
c
0
.We shall see that the expression within the brackets represents a new gradient that plays a fundamental role in the bigeometric calculus which is a branch of non-Newtonian calculus. On the other hand, in the mathematical solution of many fundamental physical problems we are naturally led to series whose terms contain factors which are the mathematical representations of the damping factors of the physicist. These same factors may be interpreted as convergence factors for summable series, since they satisfy the conditions of the general theorems. Thus, the use of convergence factor theorems and the theory of summable series frequently serves to extend the domain of applicability of the mathematical solution of physical problems.The table on the characterizations of the matrix transformations between certain spaces of sequences with real or complex terms was given by Stieglitz and Tietz [26]. To prepare the corresponding table for certain sequence spaces over the non-Newtonian complex field C
*, we characterize some classes of infinite matrices. Of course, to complete the table of matrix transformations from the set μ
1
* to the set μ
2
*, there are several open problems depending on the choice of generator functions.The main results given in final section of the present paper will be based on examining the domain of some matrices in the classical sets of sequences. This is a new development of the matrix transformations between sequence spaces overC
*. Finally, we should note from now on that our next papers will be devoted to the matrix domains of the classical sets of sequences over C
*.



---

*Source: 705818-2014-06-19.xml*