Next Article in Journal
Overshoot Elimination for Control Systems with Parametric Uncertainty via a PID Controller
Next Article in Special Issue
Neutrosophic Modeling of Talcott Parsons’s Action and Decision-Making Applications for It
Previous Article in Journal
New Extensions of Kannan’s and Reich’s Fixed Point Theorems for Multivalued Maps Using Wardowski’s Technique with Application to Integral Equations
Previous Article in Special Issue
Neutrosophic Components Semigroups and Multiset Neutrosophic Components Semigroups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solution and Interpretation of Neutrosophic Homogeneous Difference Equation

1
Department of Applied Science, Maulana Abul Kalam Azad University of Technology, West Bengal, Haringhata 741249, Nadia, West Bengal, India
2
Department of Mathematics, Indian Institute of Engineering Science and Technology, Shibpur, Howrah 711103, West Bengal, India
3
Institute of Industry Revolution 4.0, The National University of Malaysia, Bangi 43600, Selangor, Malaysia
4
Faculty of Engineering and Natural Sciences, Bahcesehir University, Istanbul, Turkey
5
Center for Dynamics, Department of Mathematics, Technische Universität Dresden, 01062 Dresden, Germany
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(7), 1091; https://doi.org/10.3390/sym12071091
Submission received: 23 May 2020 / Revised: 17 June 2020 / Accepted: 19 June 2020 / Published: 1 July 2020

Abstract

:
In this manuscript, we focus on the brief study of finding the solution to and analyzingthe homogeneous linear difference equation in a neutrosophic environment, i.e., we interpreted the solution of the homogeneous difference equation with initial information, coefficient and both as a neutrosophic number. The idea for solving and analyzing the above using the characterization theorem is demonstrated. The whole theoretical work is followed by numerical examples and an application in actuarial science, which shows the great impact of neutrosophic set theory in mathematical modeling in a discrete system for better understanding the behavior of the system in an elegant manner. It is worthy to mention that symmetry measure of the systems is employed here, which shows important results in neutrosophic arena application in a discrete system.

1. Introduction

1.1. Uncertainty Theory and Neutrosophic Sets

The uncertainty theory becomes a very helpful tool for real life modeling in discrete and continuous systems. The different theories of the fuzzy uncertainty theory have been given a new direction since the setting of the fuzzy set, invented by Professor Zadeh [1]. This is generalized representation of [1] is established as an intuitionistic fuzzy set theory by Atanassov [2]. Atarasov gave a novel designusing the intuitionistic fuzzy theory, where he demonstrated the idea of a membership function and non-membership function by which degree of belongingness and non-belongingness, respectively, can be measured in a set. Liu and Yuan [3] ignited the perception of a triangular intuionistic fuzzy set, which is the affable blend of a triangular fuzzy number and a intuionistic fuzzy set theory. Ye [4] set up the idea for a trapezoidal intuionistic fuzzy set. Smarandache [5] found his more generalized idea as a neutrosophic set, considering terms of the truth membership function, the indeterminacy membership function, and the falsity membership function. This theory become more beneficial and germane, rather than the common fuzzy and intuitionistic fuzzy theory settings.
Several researchershave already worked in the neutrosophic field, some of which have developed the theory [6,7], while some have applied the related theories in an applied field [8,9]. Various kinds of forms and extensions of the Neutrosophic set, such as the triangular neutrosophic set [10], the bipolar neutrosophic sets [11,12,13,14], and the multi-valued neutrosophic sets [15], were also found.

1.2. Difference Equation in an Uncertain Environment

There exist some works associated with difference equation and uncertainty. Mostly, researchers have worked on the difference equation allied with fuzzy and intuitionistic fuzzy environments. We are now giving details descriptions of some related published work. In the literature [16], Deebaet al. found a strategy for solving the fuzzy difference equation with an interesting application. The model involving CO2 levels in blood streamflow is thinkingin the view ofthe fuzzy difference equation by Deebaet al. [17]. Lakshmikantham and Vatsala [18] talk abou tdifferent basic theories and properties of fuzzy difference equations. Papaschinopoulos et al. [19,20] and PapaschinopoulosandSchinas [21] discuss more findings in a similar context. Papaschinopoulos and Stefanidou [22] provide an explanation on boundedness with asymptotic behavior of a fuzzy difference equation. Umekkanet al. [23] give a finance application based on discrete system modeling in a fuzzy environment. Stefanidou et al. [24] treat the exponential-type fuzzy difference equation. The asymptotic behavior of a second order fuzzy difference equation is considered by Din [25]. The fuzzy non-linear difference equation is considered by Zhang et al. [26], where Memarbashi and Ghasemabadi [27] corporate with a volterra type rational form by Stefanidou and Papaschinopoulos [28]. The economics application is considered by Konstantinos et al. [29]. Mondal et al. [30] solve the second-order intuitionistic difference equation. Non-linear interval-valued fuzzy numbers and their relevance to difference equations are shown in [31]. National income determination models with fuzzy stability analysis in a discrete system are elaborately discussed by Sarkar et al. [32]. The fuzzy discrete logistic equation is taken and stability situations are found in the literature [33]. Zhang et al. [34] show the asymptotic performance of a discrete time fuzzy single species population model. On discrete time, a Beverton–Holt population replica with fuzzy environment is illustrated in [35]. Additionally, a different view of the fuzzy discrete logistic equation is taken under uncertainty in [36]. The existence and stability situation of the difference equation with a fuzzy setting is found by Mondal et al. [37]. Important results are also found for fuzzy difference equations by Khastan and Alijani [38] and Khastan [39].

1.3. Novelties of the Work

In this connection of the above idea, few advances can still be prepared, which include:
(1)
The homogeneous difference equation, solved and analyzed with a neutrosophic initial condition, neutrosophic coefficient, and neutrosophic coefficient and initial together as a different section, which was not done earlier.
(2)
Establishment of the corresponding characterization theorem for the neutrosophic set with a difference equation.
(3)
Different theorems, lemmas, and corollary drawn for the purpose of the study.
(4)
Numerical examples of the difference equation with a neutrosophic number, solved and illustrated for better understanding of our observations.
(5)
An application in actuarial science, illustrated in a neutrosophic environment for better understanding of the practical application of the proposed theoretical results.

1.4. Structure of the Paper

In Section 1, we recall the related work and write the novelties of our study. The preliminary concepts are addressed in Section 2. The difference equation with a neutrosophic variable is defined and corresponds with a necessary theory, for which a lemma is prepared for the study in Section 3. Section 4 shows the solution of the neutrosophic homogeneous difference equation. Two numerical examples are shown in Section 5. In Section 6, we take an appliance of an actuarial science problem in the neutrosophic data and solve it. The conclusion and future research scope are written in Section 7.

2. PreliminaryIdea

Definition 1.
Neutrosophicset: [6] Let X be a universe set. A single-valued neutrosophic set A on X is distinct as A = { ( T A ( x ) ,   I A ( x ) ,   F A ( x ) )   : x X } , where T A ( x ) ,   I A ( x ) ,   F A ( x )   : X [ 0 , 1 ] is the degree of membership, degree of indeterministic, and degree of non-membership, respectively, of the element x X , such that 0 T A ( x ) + I A ( x ) + F A ( x ) 3 .
Definition 2.
Neutrosophicfunction: If we take the set of all real numbers as notation R and real valued fuzzy numbers as notation R F , then the function W : R [ 0 , 1 ] is called a fuzzy number valued function if w satisfies the subsequent properties.
(1)
W is the upper semi continuous.
(2)
W is the fuzzy convex, i.e., W ( λ s 1 + ( 1 λ ) s 2 ) m i n { W ( s 1 ) , W ( s 2 ) } for all s 1 ,   s 2 R and λ [ 0 , 1 ] .
(3)
W   is normal, i.e., a s 0 R , such that W ( s 0 ) = 1
(4)
Closure of s u p p ( W ) is compact, where s u p p ( W ) = { s R |   W ( s ) > 0 } .
Definition 3.
Triangular neutrosophic number: [40] If we consider the measure of the truth, for which indeterminacy and falsity are not dependent, then a Triangular Neutrosophic number is taken as N ˜ = ( r 0 , r 1 , r 2 ; s 0 , s 1 , s 2 ; w 0 , w 1 , w 2 ) , where the truth membership, falsity, and indeterminacy membership function is treated as follows:
T   N ˜ ( y ) = { y r 0 r 1 r 0 when   r 0 y < r 1 1 when   y = r 1 r 2 y r 2 r 1 when   r 1 < y   r 2 0 otherwise
and
F   N ˜ ( y ) = { s 1 y s 1 s 0 when   s 0 y < s 1 0 when   y = s 1 y s 1 s 2 s 2   when   s 1 < y   s 2 1 otherwise
I   N ˜ ( y ) = { w 1 y w 1 w 0 when   w 0 y < w 1 0 when   y = w 1 y w 1 w 2 w 1 when   w 1 < y   w 2 1 otherwise
where   0 T   N ˜ ( y ) + F   N ˜ ( y ) + I   N ˜ ( y ) 1 , y N ˜ .
The parametric setting of the above number is ( N ˜ ) α , β , γ = [ T N e u 1 ( α ) , T N e u 2 ( α ) ; I N e u 1 ( β ) , I N e u 2 ( β ) ; F N e u 1 ( γ ) , F N e u 2 ( γ ) ] ,
where
N L 1 ( α ) = r 0 + α ( r 1 r 0 )
N R 1 ( α ) = r 2 α ( r 2 r 1 )
N L 2 ( β ) = s 1 β ( s 1 s 0 )
N R 2 ( β ) = s 1 + β ( s 2 s 1 )
N L 3 ( γ ) = w 1 γ ( w 1 w 0 )
N R 3 ( γ ) = w 1 + γ ( w 2 w 1 )
Here, 0 < α , β , γ 1 and 0 < α + β + γ 3
The verbal phrase with the number can be written as in Table 1:
Definition 4.
Hukuhara difference on neutrosophic function: Let E * be the set of all neutrosophicfunctions, s ˜ ,   t ˜ E * . If is a neutrosophic number, w ˜ E * and w ˜ suit the relation s ˜ = w ˜ + t ˜ , then w ˜ is assumed to be the Hukuhara difference of s ˜ and t ˜ , denoted by w ˜ = s ˜ t ˜ .

3. Difference Equation with a Neutrosophic Variable

Definition 5.
A difference equation (sometime named as a recurrence relation) is an equation that relates the consecutive terms of a sequence of numbers.
A q th order difference equation in the linear form can be articulated:
x n + q = d 1 x n + q 1 + d 2 x n + q 2 + + d q x n + b n
where d 1 ,   d 2 , , d q and b n are constants, which are known.
If b n = 0 for all n , then Equation (1) is the homogeneous difference equation. On the other hand, it will be the non-homogeneous difference equation if b n 0 , where b n is treated as the forcing factor.
We consider an autonomous linear homogeneous difference equation of the form:
x n + 1 = σ x n   , ( σ 0 )
with the initial condition x n = 0 = x 0 . The solution of Equation (2) can then be written as:
x n = σ n x 0
Theorem 1.
[41]Let m ,   m 2 . A linear homogeneous system of them first order difference equation is given in matrix form as:
X n + 1 = A X n
where, X n = ( X n 1 , X n 2 , , X n m ) T and A = ( a i j ) m × m ,   i , j = 1 ,   2 , , m
The solution of Equation (3) can then be written as:
X n = A n X 0 , n
The difference Equation (1) is considered as the neutrosophic difference equation if any one of the following conditions are added:
(i)
The initial condition or conditions are the neutrosophic number (Type I);
(ii)
The coefficient or coefficients are the neutrosophic number (Type II);
(iii)
The initial conditions and coefficient or the coefficients are both neutrosophic numbers (Type III).
Theorem 2.
Characterization theorem: Let us consider the neutrosophic difference equation problem:
x ˜ n + 1 = f ˜ ( x n , n ) ,
with initial value x ˜ n = 0 = x ˜ 0 as a neutrospohic number, where f : E * × 0 E * , such that
(1) 
The parametric form of the function is:
[ f ˜ ( ( x n , n ) ) ] ( α ,   β , γ ) = [ f L , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) ,   f R , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) ; f L , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) ,   f R , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) ; f L , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) ,   f R , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) ]
(2) 
The functions f L , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) , f R , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) , f L , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) , f R , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) , f L , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) and f R , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) are taken as continuous functions, i.e., for any 1 > 0   a δ 1 > 0 , such that:
| f L , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) f L , n 1 1 ( x L , n 1 1 ( α ) ,   x R , n 1 1 ( α ) , n 1 , α ) | < 1
for all α [ 0 , 1 ]
with ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) ( x L , n 1 1 ( α ) ,   x R , n 1 1 ( α ) , n 1 , α ) < δ 1 and for any 2 > 0   an δ 2 > 0 , such that:
| f R , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) f R , n 2 1 ( x L , n 2 1 ( α ) ,   x R , n 2 1 ( α ) , n 2 , α ) | < 2   for   all   α [ 0 , 1 ]
with ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α ) ( x L , n 2 1 ( α ) ,   x R , n 2 1 ( α ) , n 2 , α ) < δ 2 , where n ,   n 1 and n 2 0 .
In a similar way, the continuity of the remaining four functions, f L , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) , f R , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β ) , f L , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) and f R , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ ) , can be defined.
The difference Equation (6) then reduces to the system of six difference equations, as follows:
x L , n + 1 1 ( α ) = f L , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α )
x R , n + 1 1 ( α ) = f R , n 1 ( x L , n 1 ( α ) ,   x R , n 1 ( α ) , n , α )
x L , n + 1 2 ( β ) = f L , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β )
x R , n + 1 2 ( β ) = f R , n 2 ( x L , n 2 ( β ) ,   x R , n 2 ( β ) , n , β )
x L , n + 1 3 ( γ ) = f L , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ )
x R , n + 1 3 ( γ ) = f R , n 3 ( x L , n 3 ( γ ) ,   x R , n 3 ( γ ) , n , γ )
with the initial conditions:
x L , n = 0 1 ( α ) = x L , 0 1 ( α )
x R , n = 0 1 ( α ) = x R , 0 1 ( α )
x L , n = 0 1 ( β ) = x L , 0 1 ( β )
x R , n = 0 1 ( β ) = x R , 0 1 ( β )
x L , n = 0 1 ( γ ) = x L , 0 1 ( γ )
x R , n = 0 1 ( γ ) = x R , 0 1 ( γ )
Note 1.
By the characterization theorem, we can see that a neutrosopic difference equation is transformed into a system of six difference equations in crisp form. In this article, we have taken only a single neutrosophic difference equation in a neutrosophic environment. Hence, the difference equation converted into six crisp difference equations.
Definition 6.
Strong and weak solutions of a neutrosophic difference equation: The solutions of difference Equation (6), with initial condition (3.7) to be regarded as:
(1) 
A strong solution if
x L , n 1 ( α ) x R , n 1 ( α )
x L , n 1 ( β ) x R , n 1 ( β )
x L , n 1 ( γ ) x R , n 1 ( γ )
and
α [ x L , n 1 ( α ) ] > 0 ,   α [ x R , n 1 ( α ) ] < 0
β [ x L , n 1 ( β ) ] < 0 ,   β [ x R , n 1 ( β ) ] > 0
γ [ x L , n 1 ( γ ) ] < 0 ,   γ [ x R , n 1 ( γ ) ] > 0
for every α ,   β , γ [ 0 , 1 ] .
(2) 
A weak solution if
x L , n 1 ( α ) x R , n 1 ( α )
x L , n 1 ( β ) x R , n 1 ( β )
x L , n 1 ( γ ) x R , n 1 ( γ )
and
α [ x L , n 1 ( α ) ] < 0 ,   α [ x R , n 1 ( α ) ] > 0
β [ x L , n 1 ( β ) ] > 0 ,   β [ x R , n 1 ( β ) ] < 0
γ [ x L , n 1 ( γ ) ] > 0 ,   γ [ x R , n 1 ( γ ) ] < 0
for every α ,   β , γ [ 0 , 1 ] .
Definition 7.
Let p   a n d   q be neutrosophic numbers, where [ p ˜ ] ( α , β , γ ) = [ p L 1 ( α ) , p R 1 ( α ) ;   p L 2 ( β ) , p R 2 ( β ) ; p L 3 ( γ ) , p R 3 ( γ ) ] , [ q ˜ ] ( α , β , γ ) = [ q L 1 ( α ) , q R 1 ( α ) ;   q L 2 ( β ) , q R 2 ( β ) ; q L 3 ( γ ) , q R 3 ( γ ) ] , for all α , β , γ [ 0 , 1 ] . The metric on the neutrosophic number space is then defined as:
d ( p , q ) = s u p max α , β , γ [ 0 , 1 ] { | p L 1 ( α ) q L 1 ( α ) | , | p R 1 ( α ) q R 1 ( α ) | , | p L 2 ( β ) q L 2 ( β ) | , | p R 2 ( β ) q R 2 ( β ) | , | p L 3 ( γ ) q L 3 ( γ ) | , | p R 3 ( γ ) q R 3 ( γ ) | } .
Note 2.
For some cases, the solution may not become strictly strong or weak solution type. In this scenario, a specific time interval or specific interval of α , β , or γ becomes the strong or weak solution. The main objective is to find the strong solutions. For scenariosin which neitherthe strong nor weak solutions occur, we call them non-recommended neutrosophic solutions. We strongly recommended taking strong solutions.

4. Solution of Neutrosophic Homogeneous Difference Equation

Considering linear homogeneous difference equations:
u n + 1 = a u n
In a neutrosophic sense, another inequivalent form of is (7) taken as:
u n + 1 a u n = 0
Remarks 1.
Equations (7) and (8) are equivalent in a crisp sense, but in fuzzy sense they are not equivalent.
Proof 1. 
If we take the fuzzy difference Equation (7), it becomes Theorem 1.
[ u n + 1 ] ( α , β , γ ) = [ a u n ] ( α , β , γ )
or
[ u L , n + 1 1 ( α ) , u R , n + 1 1 ( α ) ; u L , n + 1 2 ( β ) , u R , n + 1 2 ( β ) ; u L , n + 1 3 ( γ ) , u R , n + 1 3 ( γ ) ] = a [ [ u L , n 1 ( α ) , u R , n 1 ( α ) ; u L , n 2 ( β ) , u R , n 2 ( β ) ; u L , n 3 ( γ ) , u R , n 3 ( γ ) ] ] ,
i.e.,
{ u L , n + 1 1 ( α ) = a u L , n 1 ( α ) u R , n + 1 1 ( α ) = a u R , n 1 ( α ) u L , n + 1 2 ( β ) = a u L , n 2 ( β ) u R , n + 1 2 ( β ) = a u R , n 2 ( β ) u L , n + 1 3 ( γ ) = a u L , n 3 ( γ ) u R , n + 1 3 ( γ ) = a u R , n 3 ( γ )
but when we take (8), it becomes Theorem 1.
[ u n + 1 ] ( α , β , γ ) [ a u n ] ( α , β , γ ) = 0
or
[ u L , n + 1 1 ( α ) , u R , n + 1 1 ( α ) ; u L , n + 1 2 ( β ) , u R , n + 1 2 ( β ) ; u L , n + 1 3 ( γ ) , u R , n + 1 3 ( γ ) ] a [ [ u L , n 1 ( α ) , u R , n 1 ( α ) ; u L , n 2 ( β ) , u R , n 2 ( β ) ; u L , n 3 ( γ ) , u R , n 3 ( γ ) ] ] = 0 ,
i.e.,
{ u L , n + 1 1 ( α ) a u R , n 1 ( α ) = 0 u R , n + 1 1 ( α ) a u L , n 1 ( α ) = 0 u L , n + 1 2 ( β ) a u R , n 2 ( β ) = 0 u R , n + 1 2 ( β ) a u L , n 2 ( β ) = 0 u L , n + 1 3 ( γ ) a u R , n 3 ( γ ) = 0 u R , n + 1 3 ( γ ) a u L , n 3 ( γ ) = 0
or
{ u L , n + 1 1 ( α ) = a u R , n 1 ( α ) u R , n + 1 1 ( α ) = a u L , n 1 ( α ) u L , n + 1 2 ( β ) = a u R , n 2 ( β ) u R , n + 1 2 ( β ) = a u L , n 2 ( β ) u L , n + 1 3 ( γ ) = a u R , n 3 ( γ ) u R , n + 1 3 ( γ ) = a u L , n 3 ( γ )
Clearly, from (9) and (10), we conclude that they are different.
Therefore, in a crisp sense, (7) and (8) are the same, but not in a neutrosophic sense. □
Theorem 3.
Supposea and u 0 are positive neutrosophic numbers, then is a unique positive solution for Equation (7).
Proof 2. 
Let the ( α ,   β ,   γ ) -cut of the positive neutrosophic number u ˜ 0 be defined as [ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ] and [ a ˜ ] ( α ,   β ,   γ ) = [ a L 1 ( α ) , a R 1 ( α ) ;   a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ] , α , β , γ [ 0 , 1 ] , and 0 α + β + γ 1 , and if   u ˜ 0 = [ ξ 1 , ξ 2 , ξ 3 ;   η 1 , η 2 , η 3 ; ζ 1 , ζ 2 , ζ 3 ] then,
{ u L , 0 1 ( α ) = ξ 1 + α ( ξ 2 ξ 1 ) u R , 0 1 ( α ) = ξ 3 α ( ξ 3 ξ 2 ) u L , 0 2 ( β ) = η 2 β ( η 2 η 1 ) u L , 0 2 ( β ) = η 2 + β ( η 3 η 2 ) u L , 0 3 ( γ ) = ζ 2 γ ( ζ 2 ζ 1 ) u L , 0 3 ( γ ) = ζ 2 + γ ( ζ 3 ζ 2 )
Suppose there exists a sequence of netrosophic numbers u n of Equation (7), with the positive netrosophic number u 0 . Taking the ( α ,   β ,   γ ) -cut of Equation (7), we have:
[ u n + 1 ] ( α , β , γ ) = [ a u n ] ( α , β , γ ) = [ a ] ( α , β , γ ) [ u n ] ( α , β , γ )
or
[ u L , n + 1 1 ( α ) ,   u R , n + 1 1 ( α ) ;   u L , n + 1 2 ( β ) ,   u R , n + 1 2 ( β ) ;   u L , n + 1 3 ( γ ) ,   u R , n + 1 3 ( γ ) ] = [ a L 1 ( α ) , a R 1 ( α ) ; a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ] [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
Equation (11) then forwards the following system of the crisp homogeneous linear difference equation for all α , β , and γ [ 0 , 1 ] , as follows:
{ u L , n + 1 1 ( α ) = a L 1 ( α ) u L , n 1 ( α ) u R , n + 1 1 ( α ) = a R 1 ( α ) u R , n 1 ( α ) u L , n + 1 2 ( β ) = a L 2 ( β ) u L , n 2 ( β ) u R , n + 1 2 ( β ) = a R 2 ( β ) u R , n 2 ( β ) u L , n + 1 3 ( γ ) = a L 3 ( γ ) u L , n 3 ( γ ) u R , n + 1 3 ( γ ) = a R 3 ( γ ) u R , n 3 ( γ )
and Equation (12) has unique solutions [ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n + 1 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ] with an initial condition [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ] .
(The unique solution concept of a difference equation is taken from [42])
Therefore, using Equation (3), solutions are as follows:
{ u L , n 1 ( α ) = ( a L 1 ( α ) ) n u L , 0 1 ( α ) u R , n 1 ( α ) = ( a R 1 ( α ) ) n u R , 0 1 ( α ) u L , n 2 ( β ) = ( a L 2 ( β ) ) n u L , 0 2 ( β ) u R , n 2 ( β ) = ( a R 2 ( β ) ) n u R , 0 2 ( β ) u L , n 3 ( γ ) = ( a L 3 ( γ ) ) n u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( a R 3 ( γ ) ) n u R , 0 3 ( γ )
We show that [ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ] , where each components are given (by 4.5) with the initial condition [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ] , which indicates the ( α ,   β ,   γ ) -cut of solution u ˜ n of (7) with initial condition u ˜ 0 , so that:
[ u n ] ( α , β , γ ) = [ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ]
Now,
[ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ] = [ ( a L 1 ( α ) ) n u L , 0 1 ( α ) , ( a R 1 ( α ) ) n u R , 0 1 ( α ) ; ( a L 2 ( β ) ) n u L , 0 2 ( β ) , ( a R 2 ( β ) ) n u R , 0 2 ( β ) ; ( a L 3 ( γ ) ) n u L , 0 3 ( γ ) , ( a R 3 ( γ ) ) n u R , 0 3 ( γ ) ] = [ a u n ] ( α , β , γ )
Therefore, [ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ] represents a positive neutrosophic number, such that u n = a n u 0 is the solution of (7).
To prove the uniqueness of the solution, let us assume that there exists an alternative solution u ^ n for Equation (4.1). Proceeding in asimilar way, we then have:
[ u ^ n ] ( α , β , γ ) = [ u L , n 1 ( α ) ,   u R , n 1 ( α ) ;   u L , n 2 ( β ) ,   u R , n 2 ( β ) ;   u L , n 3 ( γ ) ,   u R , n 3 ( γ ) ]   for   all   ( α , β , γ ) [ 0 , 1 ] .
Therefore, from Equations (14) and (15), we obtain [ u ^ n ] ( α , β , γ ) = [ u n ] ( α , β , γ ) for all ( α , β , γ ) [ 0 , 1 ] , i.e., u ^ n = u n . Thus, the theorem is proved. □
Theorem 4.
Let a and u 0 are positive neutrosophic numbers. There also exists a unique positive solution for Equation (8).
Proof 3. 
The proof of this theorem is almost similar to Theorem (3). □
Theorem 5.
Let a and u 0 b epositive neutrosophic numbers, and m a x { a L 1 ( α ) , a R 1 ( α ) ; a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) } < 1 ,   α   , β , γ [ 0 , 1 ] and s u p p ( u 0 ) [ M 1 , N 1 ] , where M 1 , N 1 are finite positive real numbers. All the sequences of positive neutrosophic solution of Equation (7) are then bounded and persist.
Proof 4. 
Let u n be a sequence of positive neutrosophic solutions of Equation (7). Since max { a L 1 ( α ) , a R 1 ( α ) ; a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) } < 1 , α , β , γ [ 0 , 1 ] and supp ( u 0 ) [ M 1 , N 1 ] , where M 1 , N 1 are finite positive real numbers, it is evident from Equation (9) that all the component solutions of neutrosophic positive solution u n converge to 0 as n i.e., u n 0 netro as n , where ( 0 neutro ) ( α , β , γ ) = [ 0 , 0 ; 0 , 0 ; 0 , 0 ] . Since every convergent sequence is bounded, the sequence of positive neutrosophic solutions u n of Equation (7) is bounded. □
Theorem 6.
Let a and u 0 bepositive neutrosophic numbers and m a x { a L 1 ( α ) , a R 1 ( α ) ; a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) } < 1 ,   α   , β , γ [ 0 , 1 ] and s u p p ( u 0 ) [ M 1 , N 1 ] , where M 1 , N 1 are finite positive real numbers. All the sequences of positive neutrosophic solutions of Equation (8) are then bounded and persist.

4.1. Solution of Homogeneous Difference Equation of Type I

Consider Equation (4.1) with the fuzzy initial condition u ˜ n = 0 = u ˜ 0 as a neutrosophic number.
Let [ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ] ,   α , β , γ [ 0 , 1 ] , and 0 < α + β + γ < 3 , where, [ u ˜ 0 ] ( α ,   β ,   γ ) is the ( α ,   β ,   γ ) -cut of u ˜ 0 and, if u ˜ 0 = [ ξ 1 , ξ 2 , ξ 3 ;   η 1 , η 2 , η 3 ; ζ 1 , ζ 2 , ζ 3 ] , then
{ u L , 0 1 ( α ) = ξ 1 + α ( ξ 2 ξ 1 ) u R , 0 1 ( α ) = ξ 3 α ( ξ 3 ξ 2 ) u L , 0 2 ( β ) = η 2 β ( η 2 η 1 ) u L , 0 2 ( β ) = η 2 + β ( η 3 η 2 ) u L , 0 3 ( γ ) = ζ 2 γ ( ζ 2 ζ 1 ) u L , 0 3 ( γ ) = ζ 2 + γ ( ζ 3 ζ 2 )

4.1.1. The Solution When a > 0 Is a Crisp Number and u 0 Is a Neutrosophic Number

Taking the ( α ,   β ,   γ ) -cut of Equation (7), we have the following equations:
{ u L , n + 1 1 ( α ) = a u L , n 1 ( α ) u R , n + 1 1 ( α ) = a u R , n 1 ( α ) u L , n + 1 2 ( β ) = a u L , n 2 ( β ) u R , n + 1 2 ( β ) = a u R , n 2 ( β ) u L , n + 1 3 ( γ ) = a u L , n 3 ( γ ) u R , n + 1 3 ( γ ) = a u R , n 3 ( γ )
Solutions of the above equations are:
{ u L , n 1 ( α ) = a n u L , 0 1 ( α ) u R , n 1 ( α ) = a n u R , 0 1 ( α ) u L , n 2 ( β ) = a n u L , 0 2 ( β ) u R , n 2 ( β ) = a n u R , 0 2 ( β ) u L , n 3 ( γ ) = a n u L , 0 3 ( γ ) u R , n 3 ( γ ) = a n u R , 0 3 ( γ )

4.1.2. The Solution When   a   = 1 and the Initial Value u 0 Is a Neutrosophic Number

In this case, a sequence of solutions is given by
{ u L , n 1 ( α ) = u L , 0 1 ( α ) u R , n 1 ( α ) = u R , 0 1 ( α ) u L , n 2 ( β ) = u L , 0 2 ( β ) u R , n 2 ( β ) = u R , 0 2 ( β ) u L , n 3 ( γ ) = u L , 0 3 ( γ ) u R , n 3 ( γ ) = u R , 0 3 ( γ )
which lead to convergent solutions.

4.1.3. The Solution When a < 0 and the Initial Value u 0 Is a Neutrosophic Number

Let a = µ ,   µ > 0 , the real valued number.
From Equation (7), we then have
[ u _ n + 1 ( α ) , u ¯ n + 1 ( α ) ] = µ [ u _ n ( α ) , u ¯ n ( α ) ]
Therefore, we obtain the following:
{ u L , n + 1 1 ( α ) = μ u R , n 1 ( α ) u R , n + 1 1 ( α ) = μ u L , n 1 ( α ) u L , n + 1 2 ( β ) = μ u R , n 2 ( β ) u R , n + 1 2 ( β ) = μ u L , n 2 ( β ) u L , n + 1 3 ( γ ) = μ u R , n 3 ( γ ) u R , n + 1 3 ( γ ) = μ u L , n 3 ( γ )
The first pairs of equations can be written in the matrix form as:
( u L , n + 1 1 ( α ) u R , n + 1 1 ( α ) ) = ( 0 µ µ 0 ) ( u L , n 1 ( α ) u R , n 1 ( α ) )
From Equation (22), let the co-efficient matrix be A 1 = ( 0 µ µ 0 )
Therefore,
A 1 n = { ( µ n 0 0 µ n )   w h e n   n   i s   a n   e v e n   n a t u r a l   n u m b e r ( 0 µ n µ n 0 )   w h e n   n   i s   a n   o d d   n a t u r a l   n u m b e r  
Therefore, the solution of (4.1.6), using Theorem (3.1), is given by:
( u L , n 1 ( α ) u R , n 1 ( α ) ) = A 1 n ( u L , 0 1 ( α ) u R , 0 1 ( α ) )
When n is an even natural number, the general solutions are:
{ u L , n 1 ( α ) = µ n u L , 0 1 ( α ) u R , n 1 ( α ) = µ n u R , 0 1 ( α ) u L , n 2 ( β ) = µ n u L , 0 2 ( β ) u R , n 2 ( β ) = µ n u R , 0 2 ( β ) u L , n 3 ( γ ) = µ n u L , 0 3 ( γ ) u R , n 3 ( γ ) = µ n u R , 0 3 ( γ )
When n is odd natural number, the general solutions are:
{ u L , n 1 ( α ) = µ n u R , 0 1 ( α ) u R , n 1 ( α ) = µ n u L , 0 1 ( α ) u L , n 2 ( β ) = µ n u R , 0 2 ( β ) u R , n 2 ( β ) = µ n u L , 0 2 ( β ) u L , n 3 ( γ ) = µ n u R , 0 3 ( γ ) u R , n 3 ( γ ) = µ n u L , 0 3 ( γ )

4.1.4. The Solution When a > 0 Is Aneutrosophic Number and the Initial Value u 0 Is a Crisp Number

Let [ a ˜ ] ( α ,   β ,   γ ) = [ a L 1 ( α ) , a R 1 ( α ) ;   a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ] ,   α   , β , γ [ 0 , 1 ] , and 0 α + β + γ 3 .
Taking the ( α ,   β ,   γ ) -cut of Equation (7), we have the following equation:
{ u L , n + 1 1 ( α ) = a L 1 ( α ) u L , n 1 ( α ) u R , n + 1 1 ( α ) = a R 1 ( α ) u R , n 1 ( α ) u L , n + 1 2 ( β ) = a L 2 ( β ) u L , n 2 ( β ) u R , n + 1 2 ( β ) = a R 2 ( β ) u R , n 2 ( β ) u L , n + 1 3 ( γ ) = a L 3 ( γ ) u L , n 3 ( γ ) u R , n + 1 3 ( γ ) = a R 3 ( γ ) u R , n 3 ( γ )
where   u 0 is the initial value. The solutions are as follows:
{ u L , n 1 ( α ) = ( a L 1 ( α ) ) n u 0 u R , n 1 ( α ) = ( a R 1 ( α ) ) n u 0 u L , n 2 ( β ) = ( a L 2 ( β ) ) n u 0 u R , n 2 ( β ) = ( a R 2 ( β ) ) n u 0 u L , n 3 ( γ ) = ( a L 3 ( γ ) ) n u 0 u R , n 3 ( γ ) = ( a R 3 ( γ ) ) n u 0

4.1.5. The Solution When a < 0 Is a Neutrosophic Number and the Initial Value u 0 Is a Crisp Number

Let a = µ , where µ is a positive fuzzy number. [ μ ˜ ] ( α ,   β , γ ) = [ μ L 1 ( α ) , μ R 1 ( α ) ;   μ L 2 ( β ) , μ R 2 ( β ) ;   μ L 3 ( γ ) , μ R 3 ( γ ) ] ,   α   , β , γ [ 0 , 1 ] , and 0 α + β + γ 3 .
Equation (7) then splits into the following equations:
{ u L , n + 1 1 ( α ) = μ R 1 ( α ) u R , n 1 ( α ) u R , n + 1 1 ( α ) = μ L 1 ( α ) u L , n 1 ( α ) u L , n + 1 2 ( β ) = μ R 2 ( β ) u R , n 2 ( β ) u R , n + 1 2 ( β ) = μ L 2 ( β ) u L , n 2 ( β ) u L , n + 1 3 ( γ ) = μ R 3 ( γ ) u R , n 3 ( γ ) u R , n + 1 3 ( γ ) = μ L 3 ( γ ) u L , n 3 ( γ )
In the matrix form, the first pairs of equations of Equation (28) can be written as:
( u L , n + 1 1 ( α ) u R , n + 1 1 ( α ) ) = ( 0 μ R 1 ( α ) μ L 1 ( α ) 0 ) ( u L , n 1 ( α ) u R , n 1 ( α ) )
The solution of (29) is given by:
( u L , n 1 ( α ) u R , n 1 ( α ) ) = A 2 n ( u 0 u 0 )
where,
A 2 = ( 0 μ R 1 ( α ) μ L 1 ( α ) 0 )
and
A 2 n = { ( ( μ L 1 ( α ) μ R 1 ( α ) ) n 2 0 0 ( μ L 1 ( α ) μ R 1 ( α ) ) n 2 )   w h e n   n   i s   e v e n ( 0 ( μ L 1 ( α ) ) n 1 2 ( μ L 1 ( α ) ) n + 1 2 ( μ R 1 ( α ) ) n 1 2 0 ( μ R 1 ( α ) ) n + 1 2 )   w h e n   n   i s   o d d
The solution of Equation (30) when n is even is:
{ u L , n 1 ( α ) = ( μ L 1 ( α )   μ R 1 ( α ) ) n 2 u 0 u R , n 1 ( α ) = ( μ L 1 ( α )   ( μ R 1 α ) ) n 2 u 0 u L , n 2 ( β ) = ( μ L 2 ( β )   μ R 2 ( β ) ) n 2 u 0 u R , n 2 ( β ) = ( μ L 2 ( β )   μ R 2 ( β ) ) n 2 u 0 u L , n 3 ( γ ) = ( μ L 3 ( γ )   μ R 3 ( γ ) ) n 2 u 0 u R , n 3 ( γ ) = ( μ L 3 ( γ )   μ R 3 ( γ ) ) n 2 u 0
In this case, solutions become crisp numbers, i.e., u n ( α ) = ( µ _ ( α )   µ ¯ ( α ) ) n 2 u 0 .
The solution of Equation (30) when n is odd:
{ u L , n 1 ( α ) = ( μ L 1 ( α ) ) n 1 2 ( μ R 1 ( α ) ) n + 1 2 u 0 u R , n 1 ( α ) = ( μ L 1 ( α )   ) ) n + 1 2 ( μ R 1 ( α ) ) n 1 2 u 0 u L , n 2 ( β ) = ( μ L 2 ( β ) ) n 1 2 ( μ R 2 ( β ) ) n + 1 2 u 0 u R , n 2 ( β ) = ( μ L 2 ( β )   ) ) n + 1 2 ( μ R 2 ( β ) ) n 1 2 u 0 u L , n 3 ( γ ) = ( μ L 3 ( γ ) ) n 1 2 ( μ R 3 ( γ ) ) n + 1 2 u 0 u R , n 3 ( γ ) = ( μ L 3 ( γ )   ) ) n + 1 2 ( μ R 3 ( γ ) ) n 1 2 u 0

4.1.6. The Solution When a > 0 and u 0 Are Bothneutrosophic Numbers

Let
[ a ˜ ] ( α ,   β ,   γ ) = [ a L 1 ( α ) , a R 1 ( α ) ;   a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ]
[ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
  α   , β , γ [ 0 , 1 ] and 0 α + β + γ 3 .
The solution of Equation (16), which follows from Equation (26), is thengiven by:
{ u L , n 1 ( α ) = ( a L 1 ( α ) ) n u L , 0 1 ( α ) u R , n 1 ( α ) = ( a R 1 ( α ) ) n u R , 0 1 ( α ) u L , n 2 ( β ) = ( a L 2 ( β ) ) n u L , 0 2 ( β ) u R , n 2 ( β ) = ( a R 2 ( β ) ) n u R , 0 2 ( β ) u L , n 3 ( γ ) = ( a L 3 ( γ ) ) n u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( a R 3 ( γ ) ) n u R , 0 3 ( γ )

4.1.7. The Solution When a < 0 and u 0 Are Both Neutrosophic Numbers

Let a = µ   ,   µ > 0 . Let [ μ ˜ ] ( α ,   β ,   γ ) = [ μ L 1 ( α ) , μ R 1 ( α ) ;   μ L 2 ( β ) , μ R 2 ( β ) ;   μ L 3 ( γ ) , μ R 3 ( γ ) ] and [ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
  α   , β , γ [ 0 , 1 ] and 0 α + β + γ 3 .
The solution of Equation (16), which is follows from Equation (31), is then given by:
{ u L , n 1 ( α ) = ( μ L 1 ( α )   μ R 1 ( α ) ) n 2 u L , 0 1 ( α ) u R , n 1 ( α ) = ( μ L 1 ( α )   μ R 1 ( α ) ) n 2 u R , 0 1 ( α ) u L , n 2 ( β ) = ( μ L 2 ( β )   μ R 2 ( β ) ) n 2 u L , 0 2 ( β ) u R , n 2 ( β ) = ( μ L 2 ( β )   μ R 2 ( β ) ) n 2 u R , 0 2 ( β ) u L , n 3 ( γ ) = ( μ L 3 ( γ )   μ R 3 ( γ ) ) n 2 u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( μ L 3 ( γ )   μ R 3 ( γ ) ) n 2 u R , 0 3 ( γ )
The above equations show that the solution for n is even only. When n is odd, the solutions, which follow from Equation (32), are as follows:
{ u L , n 1 ( α ) = ( μ L 1 ( α ) ) n 1 2 ( μ R 1 ( α ) ) n + 1 2 u L , 0 1 ( α ) u R , n 1 ( α ) = ( μ L 1 ( α ) ) n + 1 2 ( μ R 1 ( α ) ) n 1 2 u R , 0 1 ( α ) u L , n 2 ( β ) = ( μ L 2 ( β ) ) n 1 2 ( μ R 2 ( β ) ) n + 1 2 u L , 0 2 ( β ) u R , n 2 ( β ) = ( μ L 2 ( β ) ) n + 1 2 ( μ R 2 ( β ) ) n 1 2 u R , 0 2 ( β ) u L , n 3 ( γ ) = ( μ L 3 ( γ ) ) n 1 2 ( μ R 3 ( γ ) ) n + 1 2 u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( μ L 3 ( γ ) ) n + 1 2 ( μ R 3 ( γ ) ) n 1 2 u R , 0 3 ( γ )

4.2. Solution of Homogeneous Difference Equation of Type II

4.2.1. The Solution When a = 1 and the Initial Condition u 0 Is a Neutrosophic Number

Taking the ( α ,   β ,   γ ) -cut of Equation (8), we have the following:
{ u L , n + 1 1 ( α ) = u R , n 1 ( α ) u R , n + 1 1 ( α ) = u L , n 1 ( α ) u L , n + 1 2 ( β ) = u R , n 2 ( β ) u R , n + 1 2 ( β ) = u L , n 2 ( β ) u L , n + 1 3 ( α ) = u R , n 3 ( α ) u R , n + 1 3 ( α ) = u L , n 3 ( α )
In the matrix form, the first pairs of Equation (36) can be written as:
( u L , n + 1 1 ( α ) u R , n + 1 1 ( α ) ) = ( 0 1 1 0 ) ( u L , n 1 ( α ) u R , n 1 ( α ) )
The solution of Equation (37) is, when n is even:
{ u L , n 1 ( α ) = u L , 0 1 ( α ) u R , n 1 ( α ) = u R , 0 1 ( α )
When n is odd, the solutions are:
{ u L , n 1 ( α ) = u R , 0 1 ( α ) u R , n 1 ( α ) = u L , 0 1 ( α )
For both cases, when either n is even or odd, u L , n 1 ( α ) and u R , n 1 ( α ) leads to a convergent solution.
In a similar way, solutions of remaining equations are as follows:
when n is even:
{ u L , n 1 ( β ) = u L , 0 1 ( β ) u R , n 1 ( β ) = u R , 0 1 ( β ) u L , n 1 ( γ ) = u L , 0 1 ( γ ) u R , n 1 ( γ ) = u R , 0 1 ( γ )
When n is odd:
{ u L , n 1 ( β ) = u R , 0 1 ( β ) u R , n 1 ( β ) = u L , 0 1 ( β ) u L , n 1 ( γ ) = u R , 0 1 ( γ ) u R , n 1 ( γ ) = u L , 0 1 ( γ )

4.2.2. The Solution When a > 0 , a Real Valued Number, and the Initial Condition u 0 Is a Neutrosophic Number

Taking the ( α , β , γ ) -cut of (8), we get the following equations:
{ u L , n + 1 1 ( α ) a u R , n 1 ( α ) = 0 u R , n + 1 1 ( α ) a u L , n 1 ( α ) = 0 u L , n + 1 1 ( β ) a u R , n 1 ( β ) = 0 u R , n + 1 1 ( β ) a u L , n 1 ( β ) = 0 u L , n + 1 1 ( γ ) a u R , n 1 ( γ ) = 0 u R , n + 1 1 ( γ ) a u L , n 1 ( γ ) = 0
In the matrix form, the first pair of Equation (42) can be written as:
( u L , n + 1 1 ( α ) u R , n + 1 1 ( α ) ) = ( 0 a a 0 ) ( u L , n 1 ( α ) u R , n 1 ( α ) )
The solutions of (43) are, when n is even:
{ u L , n 1 ( α ) = a n u L , 0 1 ( α ) u R , n 1 ( α ) = a n u R , 0 1 ( α )
The solutions of (44) and (45) are, when   n is odd:
{ u L , n 1 ( α ) = a n u R , 0 1 ( α ) u R , n 1 ( α ) = a n u L , 0 1 ( α )
In a similar way, the solutions of the remaining Equation (42) are as follows:
When n is even:
{ u L , n 1 ( β ) = a n u L , 0 1 ( β ) u R , n 1 ( β ) = a n u R , 0 1 ( β ) u L , n 1 ( γ ) = a n u L , 0 1 ( γ ) u R , n 1 ( γ ) = a n u R , 0 1 ( γ )
When n is odd:
{ u L , n 1 ( β ) = a n u R , 0 1 ( β ) u R , n 1 ( β ) = a n u L , 0 1 ( β ) u L , n 1 ( γ ) = a n u R , 0 1 ( γ ) u R , n 1 ( γ ) = a n u L , 0 1 ( γ )

4.2.3. The Solution When a < 0 and when the Initial Condition u 0 Is a Neutrosophic Number

Let a = m   , m > 0 , a real valued number.
From Equation (8), after taking the ( α ,   β ,   γ ) -cut, we have the following sets of equations:
{ u L , n + 1 1 ( α ) + m u L , n 1 ( α ) = 0 u R , n + 1 1 ( α ) + m u R , n 1 ( α ) = 0 u L , n + 1 1 ( β ) + m u L , n 1 ( β ) = 0 u R , n + 1 1 ( β ) + m u R , n 1 ( β ) = 0 u L , n + 1 1 ( γ ) + m u L , n 1 ( γ ) = 0 u R , n + 1 1 ( γ ) + m u R , n 1 ( γ ) = 0
Solving the above equations, we get:
{ u L , n 1 ( α ) = ( m ) n u L , 0 1 ( α ) u R , n 1 ( α ) = ( m ) n u R , 0 1 ( α ) u L , n 2 ( β ) = ( m ) n u L , 0 2 ( β ) u R , n 2 ( β ) = ( m ) n u R , 0 2 ( β ) u L , n 3 ( γ ) = ( m ) n u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( m ) n u R , 0 3 ( γ )

4.2.4. The Solution When a > 0 Is a Positive Neutrosophic Number and the Initial Condition u 0 is nota Neutrosophic Number

Let [ a ˜ ] ( α ,   β ,   γ ) = [ a L 1 ( α ) , a R 1 ( α ) ;   a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ] ,   α   , β , γ [ 0 , 1 ] , and 0 α + β + γ 3 .
Taking the ( α ,   β ,   γ ) -cut of Equation (8), we have the following equation:
{ u L , n + 1 1 ( α ) = a L 1 ( α ) u R , n 1 ( α ) u R , n + 1 1 ( α ) = a R 1 ( α ) u L , n 1 ( α ) u L , n + 1 2 ( β ) = a L 2 ( β ) u R , n 2 ( β ) u R , n + 1 2 ( β ) = a R 2 ( β ) u L , n 2 ( β ) u L , n + 1 3 ( γ ) = a L 3 ( γ ) u R , n 3 ( γ ) u R , n + 1 3 ( γ ) = a R 3 ( γ ) u L , n 3 ( γ )
In the matrix form, among the above equations, the first pair of Equation (50) can be written as:
( u L , n + 1 1 ( α ) u R , n + 1 1 ( α ) ) = ( 0 a R 1 ( α ) a L 1 ( α ) 0 ) ( u L , n 1 ( α ) u R , n 1 ( α ) )
The solution of Equation (51), when n is even:
{ u L , n 1 ( α ) = ( a L 1 ( α )   a R 1 ( α ) ) n 2 u 0 u R , n 1 ( α ) = ( a L 1 ( α )   a R 1 ( α ) ) n 2 u 0 u L , n 2 ( β ) = ( a L 2 ( β )   a R 2 ( β ) ) n 2 u 0 u R , n 2 ( β ) = ( a L 2 ( β )   a R 2 ( β ) ) n 2 u 0 u L , n 3 ( γ ) = ( a L 3 ( γ )   a R 3 ( γ ) ) n 2 u 0 u R , n 3 ( γ ) = ( a L 3 ( γ )   a R 3 ( γ ) ) n 2 u 0
When n is odd:
{ u L , n 1 ( α ) = ( a L 1 ( α ) ) n 1 2 ( a R 1 ( α ) ) n + 1 2 u 0 u R , n 1 ( α ) = ( a L 1 ( α ) ) n + 1 2 ( a R 1 ( α ) ) n 1 2 u 0 u L , n 2 ( β ) = ( a L 2 ( β ) ) n 1 2 ( a R 2 ( β ) ) n + 1 2 u 0 u R , n 2 ( β ) = ( a L 2 ( β ) ) n + 1 2 ( a R 2 ( β ) ) n 1 2 u 0 u L , n 3 ( γ ) = ( a L 3 ( γ ) ) n 1 2 ( a R 3 ( γ ) ) n + 1 2 u 0 u R , n 3 ( γ ) = ( a L 3 ( γ ) ) n + 1 2 ( a R 3 ( γ ) ) n 1 2 u 0

4.2.5. The Solution When a < 0 Is a Neutrosophic Number and When the Initial Condition u 0 Is a Crisp Number

Let a = m   ,   m > 0 . Let [ m ˜ ] ( α ,   β ,   γ ) = [ m L 1 ( α ) , m R 1 ( α ) ;   m L 2 ( β ) , m R 2 ( β ) ;   m L 3 ( γ ) , m R 3 ( γ ) ] and
[ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
  α   , β , γ [ 0 , 1 ] and 0 α + β + γ 3 .
Taking the ( α ,   β ,   γ ) -cut of Equation (8), we have the following equations:
{ u L , n + 1 1 ( α ) = m L 1 ( α ) u L , n 1 ( α ) u R , n + 1 1 ( α ) = m R , n 1 ( α ) u R , n 1 ( α ) u L , n + 1 2 ( β ) = m L 2 ( β ) u L , n 2 ( β ) u R , n + 1 2 ( β ) = m R , n 2 ( β ) u R , n 2 ( β ) u L , n + 1 3 ( γ ) = m L 3 ( γ ) u L , n 3 ( γ ) u R , n + 1 3 ( γ ) = m R , n 3 ( γ ) u R , n 3 ( γ )
The general solutions of the above equations are as follows:
{ u L , n ( α ) = ( m L ( α ) ) n u 0 u R , n ( α ) = ( m R ( α ) ) n u 0 u L , n ( β ) = ( m L ( β ) ) n u 0 u R , n ( β ) = ( m R ( β ) ) n u 0 u L , n ( γ ) = ( m L ( γ ) ) n u 0 u R , n ( γ ) = ( m R ( γ ) ) n u 0

4.2.6. The Solution When the Initial Condition u 0 and a > 0 Are Both Neutrosophic Numbers

Let [ a ˜ ] ( α ,   β ,   γ ) = [ a L 1 ( α ) , a R 1 ( α ) ;   a L 2 ( β ) , a R 2 ( β ) ;   a L 3 ( γ ) , a R 3 ( γ ) ] and [ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
  α   , β , γ [ 0 , 1 ] and 0 α + β + γ 3 .
In this case, the solutions are given, following from Equation (50):
when   n is even:
{ u L , n 1 ( α ) = ( a L 1 ( α )   a R 1 ( α ) ) n 2 u L , 0 1 ( α ) u R , n 1 ( α ) = ( a L 1 ( α )   a R 1 ( α ) ) n 2 u R , 0 1 ( α ) u L , n 2 ( β ) = ( a L 2 ( β )   a R 2 ( β ) ) n 2 u L , 0 2 ( β ) u R , n 2 ( β ) = ( a L 2 ( β )   a R 2 ( β ) ) n 2 u R , 0 2 ( β ) u L , n 3 ( γ ) = ( a L 3 ( γ )   a R 3 ( γ ) ) n 2 u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( a L 3 ( γ )   a R 3 ( γ ) ) n 2 u R , 0 3 ( γ )
when n is odd:
{ u L , n 1 ( α ) = ( a L 1 ( α ) ) n 1 2 ( a R 1 ( α ) ) n + 1 2 u R , 0 1 ( α ) u R , n 1 ( α ) = ( a L 1 ( α ) ) n + 1 2 ( a R 1 ( α ) ) n 1 2 u L , 0 1 ( α ) u L , n 2 ( β ) = ( a L 2 ( β ) ) n 1 2 ( a R 2 ( β ) ) n + 1 2 u R , 0 2 ( β ) u R , n 2 ( β ) = ( a L 2 ( β ) ) n + 1 2 ( a R 2 ( β ) ) n 1 2 u L , 0 2 ( β ) u L , n 3 ( γ ) = ( a L 3 ( γ ) ) n 1 2 ( a R 3 ( γ ) ) n + 1 2 u R , 0 3 ( γ ) u R , n 3 ( γ ) = ( a L 3 ( γ ) ) n + 1 2 ( a R 3 ( γ ) ) n 1 2 u L , 0 3 ( γ )

4.2.7. The Solution When the Initial Condition u 0 and a < 0 Are Both Neutrosophic Numbers

Let a = m   ,   m > 0 . Let [ m ˜ ] ( α ,   β ,   γ ) = [ m L 1 ( α ) , m R 1 ( α ) ;   m L 2 ( β ) , m R 2 ( β ) ;   m L 3 ( γ ) , m R 3 ( γ ) ] and [ u ˜ 0 ] ( α ,   β ,   γ ) = [ u L , 0 1 ( α ) ,   u R , 0 1 ( α ) ;   u L , 0 2 ( β ) ,   u R , 0 2 ( β ) ;   u L , 0 3 ( γ ) ,   u R , 0 3 ( γ ) ]
  α   , β , γ [ 0 , 1 ] and 0 α + β + γ 3 .
In a similar way, as seen in Equation (54), we have the following solutions.
The general solutions of the above equations are as follows:
{ u L , n 1 ( α ) = ( m L ( α ) ) n u L , 0 1 ( α ) u R , n 1 ( α ) = ( m R ( α ) ) n u R , 0 1 ( α ) u L , n 2 ( β ) = ( m L ( β ) ) n u L , 0 2 ( β ) u R , n 2 ( β ) = ( m R ( β ) ) n u R , 0 2 ( β ) u L , n 3 ( γ ) = ( m L ( γ ) ) n u L , 0 3 ( γ ) u R , n 3 ( γ ) = ( m R ( γ ) ) n u R , 0 3 ( γ )

5. Numerical Example

Example 1.
Solve the difference equation:
u n + 1 = ( 2 , 4 , 6 ; 1 , 4 , 5 ; 2 , 4 , 5 ) u n
with the initial condition u ˜ n = 0 = ( 50 , 60 , 70 ; 55 , 60 , 75 ; 50 , 60 , 80 )
Solution 1.
If the [ u ˜ n ] ( α ,   β ,   γ ) is the ( α ,   β ,   γ )-cut of a sequence of neutrosophic numbers, then its components are as follows:
{ u L , n 1 ( α ) = ( 2 + 2 α ) n ( 50 + 10 α ) u R , n 1 ( α ) = ( 6 2 α ) n ( 70 10 α ) u L , n 2 ( β ) = ( 4 3 β ) n ( 60 5 β ) u R , n 2 ( β ) = ( 4 + β ) n ( 60 + 15 β ) u L , n 3 ( γ ) = ( 4 2 γ ) n ( 60 10 γ ) u R , n 3 ( γ ) = ( 4 + γ ) n ( 60 + 20 γ )
Remarks 2.
We plot the solution for n = 2 . From the above Table 2 and Figure 1, we see that u L , n 1 ( α ) is an increasing function and u R , n 1 ( α ) is a decreasing function, with respect to α . On the other hand, u L , n 2 ( β ) is a decreasing function and u R , n 2 ( β ) is an increasing function, with respect to β . Additionally, u L , n 3 ( γ ) is a decreasing function and u R , n 3 ( γ ) is an increasing function, with respect to γ . Therefore, using the concept of Definition 3.2, we call the solution a strong solution.
Remarks 3.
We plotted the solution for n = 5 . From the above Table 3 and Figure 2, we see that u L , n 1 ( α ) is an increasing function and u R , n 1 ( α ) is a decreasing function, with respect to α . On the other hand, u L , n 2 ( β ) is a decreasing function and u R , n 2 ( β ) is an increasing function, with respect to β . Additionally, u L , n 3 ( γ ) is a decreasing function and u R , n 3 ( γ ) is an increasing function, with respect to γ . Therefore, using the concept of Definition 6, we call the solution a strong solution.
We interpret the solution for fixed α , β , γ = 0.4 and different n in Table 4 and Figure 3.
Example 2.
Solve the difference equation:
u n + 1 4 u n = 0
with initial condition u ˜ n = 0 = ( 50 , 60 , 70 ; 55 , 60 , 75 ; 50 , 60 , 80 )
Solution 2.
If [ u ˜ n ] ( α ,   β ,   γ ) is the ( α ,   β ,   γ )-cut of a sequence of neutrosophic numbers, then it’s components are as follows:
when   n is even:
{ u L , n 1 ( α ) = 4 n ( 50 + 10 α ) u R , n 1 ( α ) = 4 n ( 70 10 α ) u L , n 1 ( β ) = 4 n ( 60 5 β ) u R , n 1 ( β ) = 4 n ( 60 + 15 β ) u L , n 1 ( γ ) = 4 n ( 60 10 γ ) u R , n 1 ( γ ) = 4 n ( 60 + 20 γ )
when   n is odd:
{ u L , n 1 ( α ) = 4 n ( 70 10 α ) u R , n 1 ( α ) = 4 n ( 50 + 10 α ) u L , n 1 ( β ) = 4 n ( 60 + 15 β ) u R , n 1 ( β ) = 4 n ( 60 5 β ) u L , n 1 ( γ ) = 4 n ( 60 + 20 γ ) u R , n 1 ( γ ) = 4 n ( 60 10 γ )
As previous examples, we easily interpret the solutions in a different manner.

6. Application of the Method in Actuarial Science

Let us consider that a sum S 0 is invested at a compound interest of i per unit amount and per unit of time and S t is the amount at the end of time t . We then get the difference equation associated with the problem, which is:
S t + 1 = S t + i S t = ( 1 + i ) S t
If, for some reason, i may vary, we are interested to find the possible amount after a certain time interval.
For this problem, let us consider hypothetical data and solve it. Suppose a person has initially invested S t = 0 = 10000 $ in a firm, where they get about 4 % interest (which may be considered a neutrosophic value).
As per Table 1, if we take the verbal phrase for a triangular neutrosophic number, we then set the interest rate as follows:
  • For the truth part: low as 3%, medium as 4%, high as 5%;
  • For the falsity portion: very low as 2%, medium as 4%, very high as 6%;
  • For the indeterminacy part: between low and very low 2.5%, medium 4%, between high and very high 5.5%,
i.e., we can take i ˜ = ( 3 , 4 , 5 ; 2 , 4 , 6 ; 2.5 , 4 , 5.5 ) %   per annum rate. We wish to predict the amount of money after 10 years.
Therefore, we get the fuzzy difference equation
S t + 1 = S t + i S t = ( 1 + i ˜ ) S t
With the initial conditions S t = 0 = 10000 $ and i ˜ = ( 3 , 4 , 5 ; 2 , 4 , 6 ; 2.5 , 4 , 5.5 ) % .
Solution 3.
Equation (65) is equivalent to
S t + 1 = S t + i S t = ( 1 + ( 0.03 , 0.04 , 0.05 ; 0.02 , 0.04 , 0.06 ; 0.025 , 0.04 , 0.055 ) ) S t
or
S t + 1 = ( 1.03 , 1.04 , 1.05 ; 1.02 , 1.04 , 1.06 ; 1.025 , 1.04 , 1.055 ) S t
with the initial condition S t = 0 = 10000 $ .
The solution of (66) can be written using the concept of (19), as follows:
{ S L , t 1 ( α ) = 10000 ( 1.03 + 0.01 α ) t S R , t 1 ( α ) = 10000 ( 1.05 0.01 α ) t S L , t 2 ( β ) = 10000 ( 1.04 0.02 β ) t S R , t 2 ( β ) = 10000 ( 1.04 + 0.02 β ) t S L , t 3 ( γ ) = 10000 ( 1.04 0.015 γ ) t S R , t 3 ( γ ) = 10000 ( 1.04 + 0.015 γ ) t
Remarks 4.
(1) We plot the solution for t = 10 . From the above Table 5 and Figure 4, we see that S L , n 1 ( α ) is an increasing function and S R , n 1 ( α ) is a decreasing function, with respect to α . On the other hand, S L , n 2 ( β ) is a decreasing function and S R , n 2 ( β ) is an increasing function, with respect to β . Additionally, S L , n 3 ( γ ) is a decreasing function and S R , n 3 ( γ ) is an increasing function, with respect to γ . Therefore, using the concept of Definition 3.2, we call the solution a strong solution. (2) From Table 5, we can see that we find the crisp solution at α = 1 , β , γ = 0 (since, at α = 1 , β , γ = 0 , the neutrosophic number becomes a crisp number) and for t = 10 is equal to 14802.4428. Therefore, we can say that after 10 years, the most probable chance to get the money is 14802.4428$.(3) If we consider α = 0 and β , γ = 1 , i.e., in the case that we get the most uncertain solution interval, we observe that the truthiness of the solution belongs to the interval [ 13439.1638 ,   16288.9463 ] , the falsity belongs to the interval [ 12189.9442 ,   17908.4770 ] , and the indeterminacy belongs to the interval [ 12800.8454 ,   17081.4446 ] .

7. Conclusions and Future Research Scope

In this paper, we find the solution strategy for solving and analyzing homogeneous linear difference equations with neutrosophic numbers, i.e., we found the solutions of the homogeneous difference equations with initial conditions and coefficients, both as neutrosophic numbers. We demonstrate the solution of different cases using the neutrosophic characterization theorem, which is established in this paper. The strong and weak solution concepts are also applied to different results.
Moreover, the outcomes of the study are as follows:
(1)
The difference type of the homogeneous difference equation is solved in a neutrosophic environment and the symmetric behavior between them is discussed.
(2)
The characterization theorem for the neutrosophic difference equations are established.
(3)
The strong and weak solution concept is applied for the neutrosophic difference equation.
(4)
Different examples and real-life applications in actuarial science are illustrated for better understanding of neutrosophic difference equations.
For some limitations, we did not study the different perspectives of related research in the theory of difference equations with uncertainty in this present work. From this work, anyone can take motivation and find a new theory and results in the following field, as follows:
(1)
The solution of difference equation can be found with different types of uncertainty, such as Type 2 fuzzy, interval valued fuzzy, hesitant fuzzy, rough fuzzy environment.
(2)
Finding several methods (analytical and numerical) for solving non-linear first and higher order difference equations or system of difference equations with uncertainty.
(3)
Solving the real-life model associated with the discrete system modeling with uncertain data.
As a final argument, we can surely say that this research is very helpful to the research community who deals with discrete system modeling with uncertainty.

Author Contributions

Conceptualization, S.P.M.; Data curation, A.A. (Abdul Alamin); Formal analysis, S.A.; Resources, S.P.M. Software; Supervision, A.A. (Ali Ahmadian); Visualization, A.A. (Ali Ahmadian); Writing—original draft, A.A. (Abdul Alamin) and S.A.; Writing—review & editing, A.A. (Ali Ahmadian), S.S. and M.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Li, J.; Niu, Q.; Dong, X.-C. Similarity Measure and Fuzzy Entropy of Fuzzy Number Intuitionistic Fuzzy Sets. Adv. Intell. Soft Comput. 2009, 54, 373–379. [Google Scholar] [CrossRef]
  4. Ye, J. Prioritized aggregation operators of trapezoidal intuitionistic fuzzy sets and their application to multicriteria decision-making. Neural Comput. Appl. 2014, 25, 1447–1454. [Google Scholar] [CrossRef]
  5. Smarandache, F. A Unifying Field in Logics Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1998. [Google Scholar]
  6. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single Valued Neutrosophic Sets. Multisspace Multistructure 2010, 4, 410–413. [Google Scholar]
  7. Ye, J. Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method. J. Intell. Syst. 2014, 23, 311–324. [Google Scholar] [CrossRef] [Green Version]
  8. Peng, J.-J.; Wang, J.-Q.; Wang, J.; Zhang, H.-Y.; Chen, X.-H. Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int. J. Syst. Sci. 2015, 47, 1–17. [Google Scholar] [CrossRef]
  9. Peng, X.; Smarandache, F. New multiparametric similarity measure for neutrosophic set with big data industry evaluation. Artif. Intell. Rev. 2019, 53, 3089–3125. [Google Scholar] [CrossRef]
  10. Chakraborty, A.; Mondal, S.P.; Ahmadian, A.; Senu, N.; Salahshour, S.; Alam, S. Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their Applications. Symmetry 2018, 10, 327. [Google Scholar] [CrossRef] [Green Version]
  11. Chakraborty, A.; Mondal, S.P.; Alam, S.; Ahmadian, A.; Senu, N.; De, D.; Salahshour, S. Disjunctive Representation of Triangular Bipolar Neutrosophic Numbers, De-Bipolarization Technique and Application in Multi-Criteria Decision-Making Problems. Symmetry 2019, 11, 932. [Google Scholar] [CrossRef] [Green Version]
  12. Deli, I.; Ali, M.; Smarandache, F. Bipolar Neutrosophic Sets and their Application Based on Multi-Criteria Decision Making Problems. In Proceedings of the 2015 International Conference on Advanced Mechatronic Systems (ICAMechS), Beijing, China, 22–24 August 2015; Institute of Electrical and Electronics Engineers (IEEE): Piscataway, NJ, USA, 2015; pp. 249–254. [Google Scholar]
  13. Lee, K.M. Bipolar-Valued Fuzzy Sets and their Operations. In Proceedings of the International Conference on Intelligent Technologies, Bangkok, Thailand, 12–14 December 2000; pp. 307–312. [Google Scholar]
  14. Kang, M.K.; Kang, J.G. Bipolar fuzzy set theory applied to sub-semigroups with operators in semi groups. J. Korean Soc. Math. Educ. Ser. B Pure Appl. Math. 2012, 19, 23–35. [Google Scholar]
  15. Smarandache, F. Neutrosophic Perspectives: Triplets, Duplets, Multisets, Hybrid Operators, Modal Logic, Hedge Algebras and Applications; Degree of Dependence and Independence of the (Sub) Components of Fuzzy Set and Neutrosophic Set. Neutrosophic Sets and Systems; Pons Publishing House: Stuttgart, Germany, 2016; Volume 11, pp. 95–97. [Google Scholar]
  16. Deeba, E.Y.; De Korvin, A.; Koh, E.L. A fuzzy difference equation with an application. J. Differ. Equ. Appl. 1996, 2, 365–374. [Google Scholar] [CrossRef]
  17. Deeba, E.; De Korvin, A. Analysis by fuzzy difference equations of a model of CO2 level in the blood. Appl. Math. Lett. 1999, 12, 33–40. [Google Scholar] [CrossRef] [Green Version]
  18. Lakshmikantham, V.; Vatsala, A. Basic Theory of Fuzzy Difference Equations. J. Differ. Equ. Appl. 2002, 8, 957–968. [Google Scholar] [CrossRef]
  19. Papaschinopoulos, G.; Papadopoulos, B.K. On the fuzzy difference equation x_(n+1)=A+B⁄x_n. Soft Comput. 2002, 6, 456–461. [Google Scholar] [CrossRef]
  20. Papaschinopoulos, G.; Papadopoulos, B.K. On the fuzzy difference equation x_(n+1)=A+x_n⁄x_(n-m). Fuzzy Sets Syst. 2002, 129, 73–81. [Google Scholar] [CrossRef]
  21. Papaschinopoulos, G.; Schinas, C.J. On the fuzzy difference equation x n + 1 k = 0 k = 1 A i x n i p i + 1 x n k p k . J. Differ. Equ. Appl. 2000, 6, 85–89. [Google Scholar] [CrossRef]
  22. Papaschinopoulos, G.; Stefanidou, G. Boundedness and asymptotic behavior of the solutions of a fuzzy difference equation. Fuzzy Sets Syst. 2003, 140, 523–539. [Google Scholar] [CrossRef]
  23. Umekkan, S.A.; Can, E.; Bayrak, M.A. Fuzzy difference equation in finance. IJSIMR 2014, 2, 729–735. [Google Scholar]
  24. Stefanidou, G.; Papaschinopoulosand, G.; Schinas, C.J. On an exponential–Type fuzzy Difference equation. Advanced in difference equations. Adv. Differ. Equ. 2010, 2010, 1–19. [Google Scholar] [CrossRef] [Green Version]
  25. Din, Q. Asymptotic Behavior of a Second-Order Fuzzy Rational Difference Equation. J. Discret. Math. 2015, 2015, 1–7. [Google Scholar] [CrossRef]
  26. Zhang, Q.H.; Yang, L.H.; Liao, D.X. Behaviour of solutions of to a fuzzy nonlinear difference equation. Iran. J. Fuzzy Syst. 2012, 9, 1–12. [Google Scholar]
  27. Memarbashi, R.; Ghasemabadi, A. Fuzzy difference equations of volterra type. Int. J. Nonlinear Anal. Appl. 2013, 4, 74–78. [Google Scholar]
  28. Stefanidou, G.; Papaschinopoulos, G. A fuzzy difference equation of a rational form. J. Nonlinear Math. Phys. 2005, 12, 300–315. [Google Scholar] [CrossRef] [Green Version]
  29. Chrysafis, K.A.; Papadopoulos, B.K.; Papaschinopoulos, G. On the fuzzy difference equations of finance. Fuzzy Sets Syst. 2008, 159, 3259–3270. [Google Scholar] [CrossRef]
  30. Mondal, S.P.; Vishwakarma, D.K.; Saha, A.K. Solution of second order linear fuzzy difference equation by Lagrange’s multiplier method. J. Soft Comput. Appl. 2016, 2016, 11–27. [Google Scholar] [CrossRef] [Green Version]
  31. Mondal, S.P.; Mandal, M.; Bhattacharya, D. Non-linear interval-valued fuzzy numbers and their application in difference equations. Granul. Comput. 2017, 3, 177–189. [Google Scholar] [CrossRef]
  32. Sarkar, B.; Mondal, S.P.; Hur, S.; Ahmadian, A.; Salahshour, S.; Guchhait, R.; Iqbal, M.W. An optimization technique for national income determination model with stability analysis of differential equation in discrete and continuous process under the uncertain environment. Rairo Oper. Res. 2019, 53, 1649–1674. [Google Scholar] [CrossRef] [Green Version]
  33. Zhang, Q.; Lin, F. On Dynamical Behavior of Discrete Time Fuzzy Logistic Equation. Discret. Dyn. Nat. Soc. 2018, 2018, 1–8. [Google Scholar] [CrossRef]
  34. Zhang, Q.; Lin, F.; Zhong, X. Asymptotic Behavior of Discrete Time Fuzzy Single Species Model. Discret. Dyn. Nat. Soc. 2019, 2019, 1–9. [Google Scholar] [CrossRef]
  35. Zhang, Q.; Lin, F.B.; Zhong, X.Y. On discrete time Beverton-Holt population model with fuzzy environment. Math. Biosci. Eng. 2019, 16, 1471–1488. [Google Scholar] [CrossRef] [PubMed]
  36. Khastan, A. Fuzzy logistic difference equation. Iran. J. Fuzzy Syst. 2018, 15, 55–66. [Google Scholar]
  37. Mondal, S.P.; Alam Khan, N.; Vishwakarma, D.; Saha, A.K. Existence and Stability of Difference Equation in Imprecise Environment. Nonlinear Eng. 2018, 7, 263–271. [Google Scholar] [CrossRef]
  38. Khastan, A.; Alijani, Z. On the new solutions to the fuzzy difference equation xn+1=A+Bxn. Fuzzy Sets Syst. 2019, 358, 64–83. [Google Scholar] [CrossRef]
  39. Khastan, A. New solutions for first order linear fuzzy difference equations. J. Comput. Appl. Math. 2017, 312, 156–166. [Google Scholar] [CrossRef]
  40. Abdel-Basset, M.; Mohamed, M.; Hussien, A.N.; Sangaiah, A.K. A novel group decision-making model based on triangular neutrosophic numbers. Soft Comput. 2018, 22, 6629–6643. [Google Scholar] [CrossRef]
  41. Jensen, A. Lecture Notes on Difference Equation; Department of mathematical Science, Aalborg University: Aalborg, Denmark, 18 July 2011; (It is lecture notes of the courses “Introduction to Mathematical Methods” and “Introduction to Mathematical Methods in Economics”). [Google Scholar]
  42. Elaydi, S.N. An Introduction to Difference Equations; Springer: Berlin/Heidelberg, Germany, 1995. [Google Scholar]
Figure 1. Graph for n = 2 .
Figure 1. Graph for n = 2 .
Symmetry 12 01091 g001
Figure 2. Graph for n = 5 .
Figure 2. Graph for n = 5 .
Symmetry 12 01091 g002
Figure 3. Graph for α , β , γ = 0.4 and different n .
Figure 3. Graph for α , β , γ = 0.4 and different n .
Symmetry 12 01091 g003
Figure 4. Graph for t = 10 .
Figure 4. Graph for t = 10 .
Symmetry 12 01091 g004
Table 1. The verbal phrase of different uncertain settings and neutrosophic numbers.
Table 1. The verbal phrase of different uncertain settings and neutrosophic numbers.
Type of Uncertain ParameterVerbal PhraseUsed Functionsand Their Roles
Triangular Fuzzy Number[Low, Medium, High]Membership function for measuring degree of belongingness
Triangular Intuitionistic Fuzzy Number[Low, Medium, High; Very Low, Medium, Very High]Membership and non-membership function for measuring degree of belongingness and non-belongingness
Triangular NeutrosophicNumber[Low, Medium, High; Very Low, Medium, Very High; Between low and very low; Medium; Between high and very high]Truthiness, falsity, and indeterminacy function for measuring
the degree of truth belongingness, strictly non-belongingness and indeterminacy
Table 2. Solution for n = 2 .
Table 2. Solution for n = 2 .
α , β , γ
u L , n 1 ( α )
u R , n 1 ( α )
u L , n 2 ( β )
u R , n 2 ( β )
u L , n 3 ( γ )
u R , n 3 ( γ )
0200.002520.00960.00960.00960.00960.00
0.1246.842321.16814.551033.81851.961042.22
0.2299.522132.48682.041111.32751.681128.96
0.3358.281953.72562.181192.60658.921220.34
0.4423.361784.64454.721277.76573.441316.48
0.5495.001625.00359.371366.87495.001417.50
0.6573.441474.56275.881460.04423.361523.52
0.7658.921333.08203.961557.34358.281634.66
0.8751.681200.32143.361658.88299.521751.04
0.9851.961076.0493.791764.73246.841872.78
1960.00960.0055.001875.00200.002000.00
Table 3. Solution for n = 5 .
Table 3. Solution for n = 5 .
α , β , γ
u L , n 1 ( α )
u R , n 1 ( α )
u L , n 2 ( β )
u R , n 2 ( β )
u L , n 3 ( γ )
u R , n 3 ( γ )
01600.00544,320.0061,440.0061,440.0061,440.0061,440.00
0.12628.35452,886.1641,259.6571,251.5646,748.7471,830.84
0.24140.56374,497.6026,806.9082,335.4735,070.3883,642.38
0.36297.12307,640.5616,748.0594,820.4425,898.1997,025.57
0.49293.59250,934.669982.01108,844.7018,790.48112,143.03
0.513,365.00203,125.005615.23124,556.4813,365.00129,169.68
0.618,790.48163,074.532937.57142,114.459293.59148,293.34
0.725,898.19129,756.671398.99161,688.226297.12169,715.30
0.835,070.38102,248.05587.20183,458.854140.56193,651.01
0.946,748.7479,721.65206.06207,619.302628.35220,330.69
161,440.0061,440.0055.00234,375.001600.00250,000.00
Table 4. Solution for α , β , γ = 0.4 and different n .
Table 4. Solution for α , β , γ = 0.4 and different n .
n
u L , n 1 ( α )
u R , n 1 ( α )
u L , n 2 ( β )
u R , n 2 ( β )
u L , n 3 ( γ )
u R , n 3 ( γ )
1151.20343.20162.40290.40179.20299.20
2381.931513.38410.231101.80510.471135.19
3964.796673.491036.264180.331454.144307.01
42437.1229,427.692617.6515,860.574142.3116,341.19
56156.31129,765.526612.3360,176.4011,799.8861,999.93
615,551.16572,219.0616,703.10228,314.5833,613.43235,233.20
739,283.042,523,279.3542,192.90866,245.6495,752.00892,495.51
899,231.0011,126,750.35106,581.443,286,612.28272,761.373,386,206.59
9250,662.6449,064,949.17269,230.2412,469,696.48776,994.3212,847,566.07
10633,186.78216,358,699.65680,089.5147,311,126.782,213,363.9348,744,797.29
Table 5. Solution for t = 10 .
Table 5. Solution for t = 10 .
α , β , γ
S L , t 1 ( α )
S R , t 1 ( α )
S L , t 2 ( β )
S R , t 2 ( β )
S L , t 3 ( γ )
S R , t 3 ( γ )
013,439.163816,288.946314,802.442814,802.442814,802.442814,802.4428
0.113,570.212616,134.476614,520.231315,089.581314,590.326415,017.3306
0.213,702.410515,981.326614,242.871415,381.723014,380.949615,235.0219
0.313,835.766215,829.486113,970.288915,678.945314,174.280815,455.5492
0.413,970.288915,678.945313,702.410515,981.326613,970.288915,678.9453
0.514,105.987615,529.694213,439.163816,288.946313,768.943015,905.2433
0.614,242.871415,381.723013,180.477616,601.884913,570.212616,134.4766
0.714,380.949615,235.021912,926.281416,920.224013,374.067516,366.6791
0.814,520.231315,089.581312,676.506017,244.046413,180.477616,601.8849
0.914,660.725914,945.391512,431.082817,573.435712,989.413316,840.1284
114,802.442814,802.442812,189.944217,908.477012,800.845417,081.4446

Share and Cite

MDPI and ACS Style

Alamin, A.; Mondal, S.P.; Alam, S.; Ahmadian, A.; Salahshour, S.; Salimi, M. Solution and Interpretation of Neutrosophic Homogeneous Difference Equation. Symmetry 2020, 12, 1091. https://doi.org/10.3390/sym12071091

AMA Style

Alamin A, Mondal SP, Alam S, Ahmadian A, Salahshour S, Salimi M. Solution and Interpretation of Neutrosophic Homogeneous Difference Equation. Symmetry. 2020; 12(7):1091. https://doi.org/10.3390/sym12071091

Chicago/Turabian Style

Alamin, Abdul, Sankar Prasad Mondal, Shariful Alam, Ali Ahmadian, Soheil Salahshour, and Mehdi Salimi. 2020. "Solution and Interpretation of Neutrosophic Homogeneous Difference Equation" Symmetry 12, no. 7: 1091. https://doi.org/10.3390/sym12071091

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

Article Metrics

Back to TopTop