3. Rough ––Statistical Convergence of Order in
The notion of rough I––statistical convergence of order in is formally introduced in this section. In order to better represent uncertainty and variability in data sequences, especially in environments driven by indeterminacy, this idea generalizes current convergence conceptions. After defining the novel convergence and demonstrating its applicability, we use theorems to investigate its fundamental characteristics. Illustrative examples are provided for each finding to help explain its importance and possible uses.
Definition 13. Let be an . A sequence in is said to be – of order γ to a point with respect to the neutrosophic components , if for every and every , the following condition is satisfied: In this case, we denote the limit as
From Definition 13, it is evident that every sequence that converges with respect to is also – of order with respect to the same neutrosophic components.
Remark 1. For in (1), the sequence is referred to as – to u relative to the neutrosophic components . Furthermore, by specifying and , Definition 13 reduces to the classical notion of in the neutrosophic normed structure . Definition 14. Let be an and be a sequence in . For a fixed nonnegative real number , the sequence is said to be rough I––statistically convergent (denoted by ––) of order γ to with respect to the neutrosophic components , if for every , , and ,
This convergence is denoted by
It follows directly from Definition 14 that any sequence which is with respect to is necessarily rough –– of order with respect to the same neutrosophic structure.
Remark 2. Let be an , and let be a sequence in . Then, the following special cases of –– of order γ with respect to are identified
- (1)
If the ideal I is taken as in (2), then the sequence is said to be –– of order γ to with respect to . - (2)
If in (2), then the sequence is referred to as of order γ to with respect to , and this is denoted by
Let be an . Suppose a sequence in and . Then,
- (a)
The limit
may not be unique, provided it exists. We write
to denote the set of all limits of
–
–
of order
of the sequence
. We say that
is
–
–
of order
if
for some
.
- (b)
From Definition 14, it is clear that
- (1)
If
for a fixed
, then
- (2)
If for a fixed , then implies .
Example 1. Consider the , where is the usual normed space, for all and are defined by , and and . For , define and
Assign and . Then, for any , , and Hence . Now, given and , consider We obtain since . Assign an infinitely small value to . The R.H.S. of (3) then reduces to Consider the following: . We have gotfor any given arbitrary small . Using again from (3), we havebut does not belong to . In the same way, if ,
Therefore,
It is evident that neither of the sequences nor exhibits convergence with respect to the neutrosophic structure .
In classical convergence within a neutrosophic normed structure , it is a well-established fact that every subsequence of a convergent sequence remains convergent with respect to the neutrosophic triplet . However, this property does not extend to the framework of –– of order . Specifically, the condition does not necessarily imply that .
To illustrate this, consider the sequence , the index sequences , , and a fixed as specified in Example 1. Then, for any nontrivial admissible ideal I and , the rough I––statistical limit set of order satisfies .
Nonetheless, for the subsequence , which is trivially a subsequence of , the corresponding rough I––statistical limit set is empty, i.e., for all .
Lemma 1. Let be a sequence in a neutrosophic normed space . If the sequence is – of order γ to , then the sequence is also –– of order γ to holds for every roughness parameter .
Proof. Assigning
and taking the ideal
I as the finite ideal
, Equation (
2) becomes identical to Equation (
1). Consequently, the result is established. □
Lemma 1 does not admit a converse in general. This is demonstrated through the subsequent example.
Example 2. Consider as defined in Example 1. Define Take and , where . Then does not exist, whereasfor every I. Lemma 2. Let be an , and let be a sequence in . Suppose a roughness parameter is fixed. Then, for any given positive real numbers ϵ and ς, and for any , the following conditions are equivalent:
- (a)
.
- (b)
,
and
.
- (c)
- (d)
,
and
.
- (e)
In [
40], Theorem 2.9 states that in an
, the set of rough statistically convergent sequences (with fixed roughness degree
) is closed under addition and scalar multiplication of sequences. However, when considering rough
–
–
of order
in an
, this analogous closure property does not hold in general. To illustrate this limitation, we present the following proposition along with a corresponding example.
Proposition 1. Let be an . Consider two sequences and in . Then, for certain nonnegative parameters and , the statements below are satisfied.
- (1)
If and , then .
- (2)
If , then for any .
Proof. The proof of part (1) is trivial. We only prove part (2). For
, there is nothing to prove. Suppose
. For given
,
such that
. For given
, consider
Since
, the set
for each
. Take
. Then,
Now, for ,
and
Hence, .
Consequently, for , this means that
.
Hence, .
Therefore,
.
From (
4), it follows that
.
Hence, by Lemma 2, . □
Remark 3. Let be an , and let with . Then, the following assertions hold:
- (a)
If and , where one of and is positive, then there exists such that .
- (b)
If for then there exists such that
Example 3. Consider as defined in Example 1. Define
and
Consider , , and , then and for any I.
Now, .
Then .
Put and . Hence and .
However, for any , we obtain .
Now, take . Clearly and
Now, for ,
and .
Now, take . Then .
As established in Remark 3, it can be readily inferred that, unlike the space of classically convergent sequences, the set of sequences exhibiting –– of order fails to satisfy the conditions of a linear space for any fixed .
Theorem 1. Let be an . Consider in . Then, for some , if ∃
a sequence in with such that for every and ∀.
Proof. For given such that and . Suppose and (5) holds. Then, ∀,
.
Let . Then
.
Now, define .
Then, for , we obtain
and
.
Hence, .
⇒
.
Since and , we get
.
As a result, . □
In view of Theorem 1, for any fixed roughness threshold , it follows that every sequence exhibiting –– of order in an can be approximated by a sequence which is –– of the same order , such that the deviation between corresponding terms does not exceed . Moreover, the limit of the rough convergent sequence satisfies
It is important to note that, unlike standard convergence where the limit is unique, the limit of a –– sequence of order generally forms a set. Therefore, an in-depth analysis of both the topological and geometric characteristics of the limit set is of interest. The upcoming theorems examine its convexity and closedness properties.
Theorem 2. Let be an . The set is closed for every for a sequence in .
Proof. Given that such that , and .
Let , the closure of .
Then, there exists a sequence in such that ,
, i.e., assuming :
.
Hence, for any and the set
we have
for every . Let . Then,
.
Hence, .
That being said, for , we get
.
Thus, .
Hence, and thus is closed. □
When the roughness parameter is set to zero, the notion of –– of order coincides with the standard –– of order for the sequence. Under this condition, the corresponding limit set degenerates to a singleton, which is trivially a closed set.
Theorem 3. Let be an . Then, for any sequence in , and for each , is convex.
Proof. Let and be given. Then, such that , and . The requirement is to show that , assuming any . When or 1, the outcome is evident.
Consider . Given , define
and
.
Evidently, for each ,
and
.
Therefore,
.
In order to have , select . Then, the set
Hence, for ,
implies
) = .
Now, take
. Then,
As a result, we have
.
Therefore,
.
Therefore, . □
Evidently, when , the limit set reduces to a singleton, which is trivially convex.
However, for , the limit set may consist of multiple elements. In such cases, it becomes natural to investigate the extent of this set. With this motivation, we establish the following result concerning its diameter.
Theorem 4. Let be an . Then, for any , there do not exist elements satisfying the following condition: for each , where .
Proof. Given a value of in the interval (0,1), there exists such that , and . Ideally, let such that for some .
When , take into consideration
and
.
Since , by Lemma 2 we have
and
.
Hence, for every ,
.
Let and . Then
.
As a result, we have .
For some , use since . Let . Next, we have the following three cases:
Firstly, if
, then
secondly, if
, then
and finally, if
, then
This yields a contradiction in each of the above scenarios. Hence, all possible cases result in inconsistencies. Therefore, the proof is complete. □
Theorem 4 establishes that the diameter of the limit set does not exceed .
Theorem 5. Let be an . For a sequence in , if then ∃ such that for a certain .
Proof. When is given, there exists such that , and . Suppose . Then,
for each . Considering , we obtain
.
Now, let for some . Then and .
Define .
Thus, for , similarly to above, we have and .
Therefore,
and hence
.
This means that
.
Because of and , we get
Therefore, , and hence, . □
4. Rough Ideal Cluster Points
We present and explore the concept of a –cluster point of in an in this section.
Definition 15. Let , . A point for a sequence in and some is called –cluster point w.r.t. of if and ,
.
Let us represent the set of all –cluster points of w.r.t. by . We say is –cluster point of w.r.t. for , and represents the set of such cluster points.
Theorem 6. Let , . The set is closed if for every and in .
Proof. This proof’s outline is similar to that of Theorem 2’s proof. □
Lemma 3. For a given , is a sequence in an . Assume that and , and for . Then .
Proof. Since the outcome is obvious, the proof is not needed. □
The following theorem explores the connection between the set of –cluster points and the set of –cluster points.
Theorem 7. Let , and a sequence in . Then for such that .
Proof. For a given such that and . Let .
Then, there exists such that , i.e., and .
Considering that , where is specified, the set
.
Define, .
Then, similar to above, we obtain
Take . Then,
.
Therefore, it follows from (
6) that
.
.
Thus, we obtain
.
Since , the collection
.
Therefore,
. Hence,
Conversely, assume that
, but
. Then
for any
. Therefore,
follows from Lemma 3, which defies what we assumed. Thus,
From (
7) and (
8), the result follows. □
We illustrate this relationship in the corollary that follows, where we consider the collection of –cluster points and the limit set of –– of order .
Corollary 1. Let be an . For in , if exists then for some .
Proof. Suppose
. Then
. Hence, by Theorem 7,
for some
and
. The result is derived from (
9) and Theorem 5. □