Fibonacci Statistical Convergence on Intuitionistic Fuzzy Normed Spaces
Murat Kiri\c{s}ci

TL;DR
This paper explores Fibonacci statistical convergence within intuitionistic fuzzy normed spaces, defining new concepts like Fibonacci statistically Cauchy sequences and completeness to advance fuzzy analysis.
Contribution
It introduces the notions of Fibonacci statistical convergence, Cauchy sequences, and completeness specifically tailored for intuitionistic fuzzy normed spaces, expanding fuzzy analysis theory.
Findings
Defined Fibonacci statistically Cauchy sequences
Introduced Fibonacci statistical completeness
Established foundational properties in fuzzy normed spaces
Abstract
In this paper, we study the concept of Fibonacci statistical convergence on intuitionisitic fuzzy normed space. We define the Fibonacci statistically Cauchy sequences with respect to an intuitionisitic fuzzy normed space and introduce the Fibonacci statistical completenes with respect to an intuitionisitic fuzzy normed space.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Fibonacci Statistical Convergence on Intuitionistic Fuzzy Normed Spaces
Murat Kirişci
[Murat Kirişci] Department of Mathematical Education, Hasan Ali Yücel Education Faculty, Istanbul University-Cerrahpaşa, Vefa, 34470, Fatih, Istanbul, Turkey
Abstract.
In this paper, we study the concept of Fibonacci statistical convergence on intuitionisitic fuzzy normed space. We define the Fibonacci statistically Cauchy sequences with respect to an intuitionisitic fuzzy normed space and introduce the Fibonacci statistical completenes with respect to an intuitionisitic fuzzy normed space.
Key words and phrases:
intuitionistic fuzzy normed space, statistical convergence, Fibonacci numbers, t-norm, t-conorm, Fibonacci statistical Cauchy, statistical completeness
2010 Mathematics Subject Classification:
Primary 46S40, Secondary 11B39, 03E72, 40G15, 26E50
1. Introduction
Fuzziness has revolutionized many areas such as mathematics, science, engineering, medicine. This concept was initiated by Zadeh [32]. Not only Zadeh discovered this concept, but he also developed the infrastructure of today’s popular forms of use such as relations of similarity, decision making, and fuzzy programming in a short time.
Just like in the theory of sets, fuzzy sets(FS) also have led to the emergence of new mathematical concepts, research topics, and the design of engineering applications. Therefore, the nature of the classical set theory must be well known and understood. In particular, consider the two fundamental laws of Boolean algebra the law of excluded middle and law of contradiction. In logic, the proposition every proposition is either true or false excludes any third, or middle, possibility, which gave this principle the name of the law of excluded middle. When look at the principles of Boolean algebra, there are two items as prediction: ”True” or ”False”. Whether classical, Boolean or crisp, set theory can be defined as a characteristic function of the membership of an element in a set . For each elements of universal set , the function that generates the values [math] and is called the characteristic function.
In some real life problems in expert system, belief system, information fusion and so on , we must consider the truth-membership as well as the falsity-membership for proper description of an object in uncertain, ambiguous environment. Neither the fuzzy sets nor the interval valued fuzzy sets is appropriate for such a situation. Intuitionistic fuzzy sets introduced by Atanassov [2] is appropriate for such a situation. The intuitionistic fuzzy sets can only handle the incomplete information considering both the truth-membership ( or simply membership ) and falsity-membership ( or non-membership ) values. It does not handle the indeterminate and inconsistent information which exists in belief system.
The notion of intuitionistic fuzzy metric space has been introduced by Park [26]. Furthermore, The concept of intuitionistic fuzzy normed space is given by Saadati and Park [27].
The study of statistical convergence was initiated by Fast[7]. Schoenberg [28] studied statistical convergence as a summability method and listed some of the elementary properties of statistical convergence. Both of these mathematicians mentioned that if a bounded sequence is statistically convergent to then it is Cesàro summable to . Statistical convergence also arises as an example of ”convergence in density” as introduced by Buck[4]. In [33], Zygmund called this concept ”almost convergence” and established relation between statistical convergence and strong summability. The idea of statistical convergence has been studied in different branches of mathematics such as number theory[6], trigonometric series[33], summability theory[8], measure theory[21], Hausdorff locally convex topological vector spaces[20]. The concept of statistical convergence was introduced and studied by Aktuǧlu[1]. In [16], Karakaya and Karaisa have been extended the concept of statistical convergence. Also, they have been introduced the concept of weighted statistical convergence of order , weighted summmability of order of and strongly weighted summable sequences of order , in [16]. In [3], Braha gave a new weighted equi-statistical convergence and proved the Korovkin type theorems using the new definition.
In the present work, we will study Fibonacci statistical convergence, Fibonacci statistically Cauchy and Fibonacci statistical completeness with respect to the intuitionistic fuzzy normed space.
2. Preliminaries
The Fibonacci numbers are the sequence of numbers for defined by the linear recurrence equation
[TABLE]
From this definition, it means that the first two numbers in Fibonacci sequence are either and (or [math] and ) depending on the chosen starting point of the sequence and all subsequent number is the sum of the previous two. That is, we can choose or , .
Some of the fundamental properties of Fibonacci numbers are given as follows:
[TABLE]
It yields , if we can substituting for in Cassini’s formula.
Let be the th Fibonacci number for every . Then, we define the infinite matrix [11] by
[TABLE]
Let is a subset of positive integer. We consider the interval and select an integer in this interval, randomly. Then, the ratio of the number of elements of in to the total number of elements in is belong to , probably. For , if this probability exists, that is this probability tends to some limit, then this limit is used to as the asymptotic density of the set . This mentions us that the asymptotic density is a kind of probability of choosing a number from the set .
Now, we give some definitions and properties of asymptotic density:
The set of positive integers will be denoted by . Let and be subsets of . If the symmetric difference is finite, then, we can say is asymptotically equal to and denote . Freedman and Sember have introduced the concept of a lower asymptotic density and defined a concept of convergence in density, in [8].
Definition 2.1**.**
[8]** Let be a function which defined for all sets of natural numbers and take values in the interval . Then, the function is said to a lower asymptotic density, if the following conditions hold:
- i.
, if ,
- ii.
, if ,
- iii .
, for all ,
- iv.
.
We can define the upper density based on the definition of lower density as follows:
Let be any density. Then, for any set of natural numbers , the function is said to upper density associated with , if .
Consider the set . If , then we can say that the set has natural density with respect to . The term asymptotic density is often used for the function
[TABLE]
where and . Also the natural density of is given by where denotes the number of elements in .
Definition 2.2**.**
*A real numbers sequence is statistically convergent to provided that for every the set has natural density zero. The set of all statistical convergent sequence is denoted by . In this case, we write or .
Definition 2.3**.**
[9]** The sequence is statistically Cauchy sequence if for every there is a positive integer such that
[TABLE]
It can be seen from the definition that statistical convergence is a generalization of the usual of notion of convergence that parallels the usual theory of convergence. Kirisci and Karaisa [17] are defined Fibonacci statistical convergence and Fibonacci Cauchy sequence as follows:
Definition 2.4**.**
A sequence is said to be Fibonacci statistically convergence(or statistically convergence) if there is a number such that for every the set has natural density zero, i.e., . That is
[TABLE]
In this case we write or . The set of statistically convergent sequences will be denoted by . In the case , we will write .
Definition 2.5**.**
Let . The sequence is said to be statistically Cauchy if there exists a number such that
[TABLE]
*for every .
In 1965, fuzzy set theory has long been presented to handle vagueness, inexact and imprecise data by Zadeh [32]. After Zadeh, fuzzy sets, especially fuzzy numbers have been widely studied and applied to various fields, such as decision-making, pattern recognition, game theory and so on. In fuzzy sets, the degree of memberships of the elements in a universe is a single value but, those single values cannot provide any additional information because, in practice, information regarding elements corresponding to a fuzzy concept may be incomplete. The fuzzy set theory is not capable of dealing with the lack of knowledge with respect to degrees of memberships, Atanassov [2] proposed the theory of intuitionistic fuzzy sets the extension of Zadehs fuzzy sets by using a non-membership degree cope with the presence of vagueness and hesitancy originating from imprecise knowledge or information.
Definition 2.6**.**
[29*]** Let be a binary operation with and given the following properties:
- •
*, , *
- •
*, whenever and , *
- •
* is continuous,*
- •
* is commutative and associative.*
*If these conditions are satisfies, then the operation is called a continuous t-norm.
Definition 2.7**.**
[29*]** Let be a binary operation with and given the following properties:
- •
*, , *
- •
*, whenever and , *
- •
* is continuous,*
- •
* is commutative and associative.*
*If these conditions are satisfies, then the operation is called a continuous t-conorm.
The concept of intuitionistic fuzzy normed space is given with the continuous t-norm and continuous t-conorm as follows:
Definition 2.8**.**
[27*]** Let be a vector space, and be two fuzzy sets on and, and be a continuous t-norm and a continuous t-conorm, respectively. Consider the following conditions are hold:
- •
,
- •
,
- •
* if and only if ,*
- •
* for each ,*
- •
,
- •
* is continuous,*
- •
* and ,*
- •
,
- •
* if and only if ,*
- •
* for each ,*
- •
,
- •
* is continuous,*
- •
* and .*
*for every and . Then, the 5-tuple is called intuitionistic fuzzy normed space(IFNS). Therefore, is called an intuitionistic fuzzy norm(IFN).
The concepts of convergence and Cauchy sequences in IFNS as follows :
Definition 2.9**.**
[27*]** Consider the IFNS . Let . If there exists such that and for all , then, in IFN , a sequence is said to be convergent to . It is denoted by .
*If there exists such that and for all ,then, in IFN , a sequence is called Cauchy sequence.
3. Method
In the theory of numbers, there are many different definitions of density. It is well known that the most popular of these definitions is asymptotic density. But, asymptotic density does not exist for all sequences. New densities have been defined to fill those gaps and to serve different purposes.
The asymptotic density is one of the possibilities to measure how large a subset of the set of natural number. We know intuitively that positive integers are much more than perfect squares. Because, every perfect square is positive and many other positive integers exist besides. However, the set of positive integers is not in fact larger than the set of perfect squares: both sets are infinite and countable and can therefore be put in one-to-one correspondence. Nevertheless if one goes through the natural numbers, the squares become increasingly scarce. It is precisely in this case, natural density help us and makes this intuition precise.
The Fibonacci Sequence was firstly used in the Theory of Sequence Spaces by Kara and Başarır[12]. Afterward, Kara[11] defined the Fibonacci difference matrix by using the Fibonacci sequence for and introduced the new sequence spaces related to the matrix domain of .
The concept of the statistical convergence is studied in the intuitionistic fuzzy normed space ([13], [14], [15], [18], [19], [22], [24], [25]). Kirisci and Karaisa [17] defined Fibonacci type statistical convergence and investigated some fundamental properties. Further, in [17], various approximation results concerning the classical Korovkin theorem via Fibonacci type statistical convergence are given.
In this paper, by combining the definitions of Fibonacci sequence and statistical convergence with respect to the IFN , we will obtain a new concept of statistical convergence in IFNS and so on give a useful characterization for statistical convergence sequences on IFNS. We will examine some basic properties of new statistical convergence in IFNS. We will see that this new statistical convergence method on IFNS is stronger than the usual convergence on IFNS.
4. Main Results
4.1. Fibonacci Statistical Convergence in IFNS
Using the definitions and properties of density, statistical convergence, Fibonacci numbers and IFNS in Chapter 2 , we give new definitions as follows:
Definition 4.1**.**
Take an IFNS . A sequence is said to be Fibonacci statistical convergence with respect to IFN (briefly, FSC-IFN), if there is a number such that for every and , the set
[TABLE]
has natural density zero, i.e., . That is,
[TABLE]
In this case we write or . The set of FSC-IFN will be denoted by . In the case , we will write .
Example 4.2**.**
Let be a normed space and for all , and . For all and every , consider
[TABLE]
Then, is an IFNS. Define the . Since as and , then . Consider
[TABLE]
for and for any . When becomes sufficiently large, the quantity becomes less than and similarly the quantity becomes greater than . So, for and , .
The following lemma can be easily get by using the definitions and properties of density given in Chapter 2 and Definition 4.1.
Lemma 4.3**.**
Take an IFNS . For every and , the following statements are equivalent:
- i.
.
- ii.
\lim_{n}\frac{1}{n}\bigg{|}\big{\{}k\leq n:T(\widehat{F}x_{k}-\mathcal{L},t)\leq 1-\varepsilon\big{\}}\bigg{|}=\lim_{n}\frac{1}{n}\bigg{|}\big{\{}U(\widehat{F}x_{k}-\mathcal{L},t)\geq\varepsilon\big{\}}\bigg{|}=0.
- iii.
\lim_{n}\frac{1}{n}\bigg{|}\big{\{}k\leq n:T(\widehat{F}x_{k}-\mathcal{L},t)>1-\varepsilon\big{\}}\bigg{|}* and \lim_{n}\frac{1}{n}\bigg{|}\big{\{}k\leq n:U(\widehat{F}x_{k}-\mathcal{L},t)<\varepsilon\big{\}}\bigg{|}=1.*
- iv.
\lim_{n}\frac{1}{n}\bigg{|}\big{\{}k\leq n:T(\widehat{F}x_{k}-\mathcal{L},t)>1-\varepsilon\big{\}}\bigg{|}=\lim_{n}\frac{1}{n}\bigg{|}\big{\{}U(\widehat{F}x_{k}-\mathcal{L},t)<\varepsilon\big{\}}\bigg{|}=1.
- v.
* and .*
Theorem 4.4**.**
Take an IFNS . The is unique, when a sequence is FSC-IFN.
Proof.
For , suppose that and . Choose such that and , for a given . Define the following set, for any :
[TABLE]
Then, for all and using the Lemma 4.3, we have
[TABLE]
because of . Similarly, for all , we have
[TABLE]
because of . Let
[TABLE]
Hence reveal that which implies . Then, we have two possible cases, when take :
- i.
k\in\mathbb{N}/\big{(}K_{T,1}(\varepsilon,t)\cup K_{T,2}(\varepsilon,t)\big{)},
- ii.
k\in\mathbb{N}/\big{(}K_{U,1}(\varepsilon,t)\cup K_{U,2}(\varepsilon,t)\big{)}.
Firstly, consider (i). Then, we have
[TABLE]
In this case,
[TABLE]
because of .
Using the (4.1), for all , we obtain , where is arbitrary. From here, is obtained.
Moreover, then we can write that
[TABLE]
if we take k\in\mathbb{N}/\big{(}K_{U,1}(\varepsilon,t)\cup K_{U,2}(\varepsilon,t)\big{)}. Using , we see that
[TABLE]
For all , we obtain , where is arbitrary. Thus, and this step completes the proof.
∎
Theorem 4.5**.**
Take an IFNS . If , then .
Proof.
Let . Then, for every and , there is a number such that and , for all . It shows that the set
[TABLE]
has at most finitely many terms. Then,
[TABLE]
because of every finite subset of the natural numbers has density zero. This completes the proof. ∎
The converse of this theorem need not be true. Example 4.2 shows that the converse of Theorem 4.5 is not valid.
Theorem 4.6**.**
Let be an IFNS. if and only if there exists a increasing index sequence , when and .
Proof.
Assume that . For any and
[TABLE]
and
[TABLE]
Then, , since . Further, for and ,
[TABLE]
Since , it is clear that, for and ,
[TABLE]
Now, we will show that , . Suppose that for some , . Therefore there is and a positive integer such that for all , or . Let or , for all . Then, . Since , we have , which contradicts (4.2). Therefore , .
Suppose that there exists a subset such that and , i.e. there exists such that for every and , or . Now,
[TABLE]
Therefore . Hence . ∎
4.2. Fibonacci Statistical Complete IFNS
Definition 4.7**.**
Take an IFNS . A sequence is said to be Fibonacci statistical Cauchy with respect to IFN (briefly, ), if for every and , there exists such that
[TABLE]
has natural density zero, i.e., . That is,
[TABLE]
Theorem 4.8**.**
Let be an IFNS. If a sequence is , then it is .
Proof.
Let . For a given , choose such that and . Then, for , we have,
[TABLE]
which implies that
[TABLE]
Let . Then
[TABLE]
Now, let
[TABLE]
We need to show that . Let . Then we have
[TABLE]
in particular . Then
[TABLE]
which is not possible. On the other hand,
[TABLE]
in particular . Then
[TABLE]
which is not possible. Hence . Therefore, by 4.3 . Hence, is . ∎
Definition 4.9**.**
([27]) An IFNS is said to be complete if every Cauchy sequence is convergent in .
Definition 4.10**.**
An IFNS is said to be statistically complete is every statistically (, respectively) Cauchy sequence with respect to intuitionistic fuzzy norm is statistically (, respecitvely) convergent with respect to to intuitionistic fuzzy norm .
Theorem 4.11**.**
An IFNS is complete.
Proof.
Let be Cauchy but not convergent. For a given and , choose such that and . Now
[TABLE]
and
[TABLE]
since is not convergent. Therefore , where
[TABLE]
and so , which is a contradiction, since was Cauchy. So that must be convergent. Hence every IFNS is complete. ∎
We can give following theorem from Theorems 4.6, 4.8, 4.11.
Theorem 4.12**.**
*Let be an IFNS. Then, for any sequence , the following conditions are equivalent:
- i.
* is *convergent.
- ii.
* is *Cauchy.
- iii.
*IFNS is *complete.
- iv.
*There exists an increasing index sequence of natural numbers such that and the subsequence is a *Cauchy.
5. Conclusion
In this paper, the well-known concept of statistical convergence of real numbers combine with the definition of Fibonacci numbers is studied in intuitionistic fuzzy normed spaces. Firstly, the definition of Fibonacci statistical convergence with respect to intuitionistic fuzzy normed space(FSC-IFN) is given and some properties of FSC-IFN are investigated. After, the definitions of Fibonacci statistical Cauchy with respect to intuitionistic fuzzy normed space(FSCa-IFN) and FSC-IFN completeness are given. It shows that an IFNS is (FSC-IFN)-complete.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Aktuğlu, Korovkin type approximation theorems proved via α β − limit-from 𝛼 𝛽 \alpha\beta- statistical convergence , J. Comput.Appl. Math., 259 , (2014), 174–181.
- 2[2] K. T. Atanassov, Intuitionistic Fuzzy Sets , Fuzzy Sets and Systems 20(1) , (1986), 87–96.
- 3[3] N.L. Braha, Some weighted equi-statistical convergence and Korovkin type-Theorem , Results Math. 70(3) , (2016), 433–446.
- 4[4] R.C. Buck, Generalized asymptotic density , Amer. J. Math., 75 , (1953), 335–346.
- 5[5] E. Dündar, E. Ulusu, Asymptotically I − limit-from 𝐼 I- Cesaro equivalence of sequences of sets , Universal Journal of Mathematics and Applications, 1(2) , 2018, 101–105.
- 6[6] R. Erdos, G. Tenenbaum, Sur les densities de certaines suites d’entiers , Proc. Lon. Math. Soc., 3(59) , (1989), 417–438.
- 7[7] H. Fast, Sur la convergence statistique , Colloq. Math., 2 , (1951), 241–244.
- 8[8] A.R. Freedman, J.J. Sember, Densities and summability , Pac. J. Math., 95(2) , (1981), 293–305.
