Processing math: 100%
Research article Special Issues

Galerkin time discretization scheme for the transmission dynamics of HIV infection with non-linear supply rate

  • Received: 17 December 2021 Revised: 19 March 2022 Accepted: 28 March 2022 Published: 11 April 2022
  • MSC : 34A12, 34K28

  • The present work implements the continuous Galerkin-Petrov method (cGP(2)-method) to compute an approximate solution of the model for HIV infection of CD4+ T-cells. We discuss and analyse the influence of different clinical parameters on the model. The work also depicts graphically that how the level of CD4+ T-cells varies with respect to the emerging parameters in the model. Simultaneously, the model is solved using the fourth-order Runge Kutta (RK4) method. Finally, the validity and reliability of the proposed scheme are verified by comparing the numerical and graphical results with those obtained through the RK4 method. A numerical comparison between the results of the cGP (2) method and the RK4 method reveals that the proposed technique is a promising tool for the approximate solution of non-linear systems of differential equations. The present study highlights the accuracy and efficiency of the proposed schemes as in comparison to the other traditional schemes, for example, the Laplace adomian decomposition method (LADM), variational iteration method (VIM), homotopy analysis method (HAM), homotopy perturbation method (HAPM), etc. In this study, two different versions of the HIV model are considered. In the first one, the supply of new CD4+ T-cells from the thymus is constant, while in the second, we consider the production of these cells as a monotonically decreasing function of viral load. The experiments show that the lateral model provides more reasonable predictions than the former model.

    Citation: Attaullah, Ramzi Drissi, Wajaree Weera. Galerkin time discretization scheme for the transmission dynamics of HIV infection with non-linear supply rate[J]. AIMS Mathematics, 2022, 7(6): 11292-11310. doi: 10.3934/math.2022630

    Related Papers:

    [1] Ridha Dida, Hamid Boulares, Bahaaeldin Abdalla, Manar A. Alqudah, Thabet Abdeljawad . On positive solutions of fractional pantograph equations within function-dependent kernel Caputo derivatives. AIMS Mathematics, 2023, 8(10): 23032-23045. doi: 10.3934/math.20231172
    [2] Wedad Albalawi, Muhammad Imran Liaqat, Fahim Ud Din, Kottakkaran Sooppy Nisar, Abdel-Haleem Abdel-Aty . Significant results in the pth moment for Hilfer fractional stochastic delay differential equations. AIMS Mathematics, 2025, 10(4): 9852-9881. doi: 10.3934/math.2025451
    [3] Waleed M. Alfaqih, Abdullah Aldurayhim, Mohammad Imdad, Atiya Perveen . Relation-theoretic fixed point theorems under a new implicit function with applications to ordinary differential equations. AIMS Mathematics, 2020, 5(6): 6766-6781. doi: 10.3934/math.2020435
    [4] Xianying Huang, Yongkun Li . Besicovitch almost periodic solutions for a stochastic generalized Mackey-Glass hematopoietic model. AIMS Mathematics, 2024, 9(10): 26602-26630. doi: 10.3934/math.20241294
    [5] Yanli Ma, Hamza Khalil, Akbar Zada, Ioan-Lucian Popa . Existence theory and stability analysis of neutral ψ–Hilfer fractional stochastic differential system with fractional noises and non-instantaneous impulses. AIMS Mathematics, 2024, 9(4): 8148-8173. doi: 10.3934/math.2024396
    [6] Amjad Ali, Kamal Shah, Dildar Ahmad, Ghaus Ur Rahman, Nabil Mlaiki, Thabet Abdeljawad . Study of multi term delay fractional order impulsive differential equation using fixed point approach. AIMS Mathematics, 2022, 7(7): 11551-11580. doi: 10.3934/math.2022644
    [7] Ugyen Samdrup Tshering, Ekkarath Thailert, Sotiris K. Ntouyas . Existence and stability results for a coupled system of Hilfer-Hadamard sequential fractional differential equations with multi-point fractional integral boundary conditions. AIMS Mathematics, 2024, 9(9): 25849-25878. doi: 10.3934/math.20241263
    [8] M. Syed Ali, M. Hymavathi, Bandana Priya, Syeda Asma Kauser, Ganesh Kumar Thakur . Stability analysis of stochastic fractional-order competitive neural networks with leakage delay. AIMS Mathematics, 2021, 6(4): 3205-3241. doi: 10.3934/math.2021193
    [9] Hasanen A. Hammad, Doha A. Kattan . Strong tripled fixed points under a new class of F-contractive mappings with supportive applications. AIMS Mathematics, 2025, 10(3): 5785-5805. doi: 10.3934/math.2025266
    [10] Songkran Pleumpreedaporn, Chanidaporn Pleumpreedaporn, Weerawat Sudsutad, Jutarat Kongson, Chatthai Thaiprayoon, Jehad Alzabut . On a novel impulsive boundary value pantograph problem under Caputo proportional fractional derivative operator with respect to another function. AIMS Mathematics, 2022, 7(5): 7817-7846. doi: 10.3934/math.2022438
  • The present work implements the continuous Galerkin-Petrov method (cGP(2)-method) to compute an approximate solution of the model for HIV infection of CD4+ T-cells. We discuss and analyse the influence of different clinical parameters on the model. The work also depicts graphically that how the level of CD4+ T-cells varies with respect to the emerging parameters in the model. Simultaneously, the model is solved using the fourth-order Runge Kutta (RK4) method. Finally, the validity and reliability of the proposed scheme are verified by comparing the numerical and graphical results with those obtained through the RK4 method. A numerical comparison between the results of the cGP (2) method and the RK4 method reveals that the proposed technique is a promising tool for the approximate solution of non-linear systems of differential equations. The present study highlights the accuracy and efficiency of the proposed schemes as in comparison to the other traditional schemes, for example, the Laplace adomian decomposition method (LADM), variational iteration method (VIM), homotopy analysis method (HAM), homotopy perturbation method (HAPM), etc. In this study, two different versions of the HIV model are considered. In the first one, the supply of new CD4+ T-cells from the thymus is constant, while in the second, we consider the production of these cells as a monotonically decreasing function of viral load. The experiments show that the lateral model provides more reasonable predictions than the former model.



    Rough set theory was initially developed by Pawlak [1] as a new mathematical methodology to deal with the vagueness and uncertainty in information systems. Covering rough set (CRS) theory is a generalization of traditional rough set theory, which is characterized by coverings instead of partitions. Degang Chen et al.[2] proposed belief and plausibility functions to characterize neighborhood-covering rough sets. Essentially, they developed a numerical method for finding reductions using belief functions. Liwen Ma[3] defined the complementary neighborhood of an arbitrary element in the universe and discussed its properties. Based on the concepts of neighborhood and complementary neighborhood, an equivalent definition of a class of CRS is defined or given. Bin Yang and Bao Qing Hu [4] introduced some new definitions of fuzzy-covering approximation spaces and studied the properties of fuzzy-covering approximation spaces and Mas fuzzy covering-based rough set models. On this basis, they proposed three rough set models based on fuzzy coverage as the generalization of Ma model. Yan-Lan Zhang and Mao-Kang Luo[5] studied the relation between relation-based rough sets and covering-based rough sets. In a rough set framework based on relation, they unified five kinds of covering-based rough sets. The equivalence relations of covering-based rough sets and the type of relation-based rough sets were established. Lynn Deer et al. [6] studied 24 such neighborhood operators, which can be derived from a single covering. They also verified the equality between them, reducing the original set to 13 different neighborhood operators. For the latter, they established a partial order showing which operators produce smaller or larger neighborhoods than the others. Li Zhang et al.[7,8] combined the extended rough set theory with the mature MADM problem solving methods and proposed several types of covering-based general multigranulation intuitionistic fuzzy rough set models by using four types of intuitionistic fuzzy neighborhoods. Sang-Eon Han [9,10] set a starting point for establishing a CRS for an LFC-Space and developed the notions of accuracy of rough set approximations. Further, he gave two kinds of rough membership functions and two new rough concepts of digital topological rough set. Qingyuan Xu et al.[11] proposed a rough set method to deal with a class of set covering problem, called unicost set covering problem, which is a well-known problem in binary optimization. Liwen Ma[12] considered some types of neighborhood-related covering rough sets by introducing a new notion of complementary neighborhood. Smarandache[13] proposed the concept of neutrosophic sets in 1999, pointing out that neutrosophic sets is a set composed of the truth-membership, indeterminacy-membership and falsity-membership. Compared with previous models, it can better describe the support, neutrality and opposition of fuzzy concepts. Because of the complexity of practical problems in real life, Wang et al.[14] proposed interval neutrosophic sets(INS) and proved various properties of interval neutrosophic sets, which are connected to operations and relations over interval neutrosophic sets. Nguyen Tho Thong et al.[15] presented a new concept called dynamic interval-valued neutrosophic sets for such the dynamic decision-making applications. Irfan Deli[16] defined the notion of the interval valued neutrosophic soft sets, which is a combination of an interval valued neutrosophic sets and a soft sets. And introduced some definition and properties of interval valued neutrosophic soft sets. Hua Ma et al. [17,18] utilized the INS theory to propose a time-aware trustworthiness ranking prediction approach to selecting the highly trustworthy cloud service meeting the user-specific requirements and a time-aware trustworthy service selection approach with tradeoffs between performance costs and potential risks because of the deficiency of the traditional value prediction approaches. Ye jun[19] defined the Hamming and Euclidean distances between INS and proposed the similarity measures between INS based on the relationship between similarity measures and distances. Hongyu Zhang et al.[20] Defined the operations for INS and put forward a comparison approach based on the related research of interval valued intuitionistic fuzzy sets. Wei Yang et al.[21] developed a new multiple attribute decision-making method based on the INS and linear assignment. Meanwhile he considered the correlation of information by using the Choquet integral. Peide Liu and Guolin Tang[22] combined power average and generalized weighted agammaegation operators to INS, and proposed some agammaegation operators to apply in decision making problem.

    In recent years, many scholars have studied the combined application of rough sets and neutrosophic sets. In order to make a comprehensive overview for neutrosophic fusion of rough set theory Xue Zhan-Ao et al.[23] defifined a new covering rough intuitionistic fuzzy set model in covering approximation space, which is combined by CRS and intuitionistic fuzzy sets. They discussed the properties of lower and upper approximation operators and extended covering rough intuitionistic fuzzy set in rough sets from single-granulation to multi-granulation. Hai-Long Yang et al.[24] proposed single valued neutrosophic rough sets by combining single valued neutrosophic sets and rough sets. They also studied the hybrid model by constructive and axiomatic approaches. Hai-Long Yang et al.[25] combined INS with rough sets and proposed a generalized interval neutrosophic rough sets based on interval neutrosophic relation.They explored the hybrid model through the construction method and the axiomatic method. At the same time, the generalized interval neutrosophic approximation lower and upper approximation operators were defined by the construction method. In this paper we will study the interval neutrosophic covering rough set (INCRS), which is combined by the CRS and INS, and discuss the properties of it. Further we will give the complete proof of them. In order to do so, the remainder of this paper is shown as follows. In Section 2, we briefly review the basic concepts and operational rules of INS and CRS. In Section 3, we propose the definition and the properties of INCRS and give some easy cases to describe it. In Section 4, we discuss some theorems for INCRS and prove them completely. In Section 5, we give a simple application of Interval Neutrosophic Covering Rough Sets. In Section 6, we conclude the paper.

    This section gives a brief overview of concepts and definitions of interval neutrosophic sets, and covering rough sets.

    Definition 2.1.[13] Let X be a space of points (objects), with a class of elements in X denoted by x. A neutrosophic set A in X is summarized by a truth-membership function TA(x), an indeterminacy-membership function IA(x), and a falsity-membership function FA(x).The functions TA(x), IA(x), FA(x) are real standard or non-standard subsets of ]0,1+[. That is TA(x):X]0,1+[IA(x):X]0,1+ and FA(x):X]0,1+[.

    There is restriction on the sum of TA(x),IA(x) and FA(x), so 0supTA(x)+supIA(x)+supFA(x)3+. As mentioned above, it is hard to apply the neutrosophic set to solve some real problems. Hence, Wang et al presented interval neutrosophic set, which is a subclass of the neutrosophic set and mentioned the definition as follows:

    Definition 2.2.[13] Let X be a space of points (objects), with a class of elements in X denoted by x. A single-valued neutrosophic set N in X is summarized by a truth-membership function TN(x), an indeterminacy-membership function IN(x), and a falsity-membership function FN(x). Then an INS A can be denoted as follows:

    A={x,TA(x),IA(x),FA(x)xX} (2.1)

    where TA(x)=[TLA(x),TUA(x)], IA(x)=[ILA(x),IUA(x)], FA(x)=[FLA(x),FUA(x)][0,1] for xX. Meanwhile, the sum of TA(x)IA(x), and FA(x) fulfills the condition 0TA(x)+IA(x)+FA(x)3.

    For convenience, we refer to A=TA,IA,FA=[TLA,TUA],[ILA,IUA],[FLA,FUA] as an interval neutrosophic number (INN), which is a basic unit of INS. In addition, let X=[1,1],[0,0],[0,0] be the biggest interval neutrosophic number, and =[0,0],[1,1],[1,1] be the smallest interval neutrosophic number.

    Definition 2.3.[13] The complement of an INS A=TA,IA,FA=[TLA,TUA],[ILA,IUA],[FLA,FUA] is denoted by AC and which is defined as AC=[FLA,FUA],[1IUA,1ILA],[TLA,TUA]. For any x,yX, an INS 1y and its complement 1X{y} are defined as follows:

    T1y(x)={[1,1],x=y[0,0],xy,I1y(x)=F1y(x)={[0,0],x=y[1,1],xy
    T1x(y)(x)={[0,0],x=y[1,1],xy,I1x1y(x)=F1x(y)(x)={[1,1],x=y[0,0],xy

    Definition 2.4.[16] A={x,TA(x),IA(x),FA(x)} and B={x,TB(x),IB(x),FB(x)} are two interval neutrosophic sets, where TA(x)=[TLA(x),TUA(x)], IA(x)=[ILA(x),IUA(x)], FA(x)=[FLA(x),FUA(x)], and TB(x)=[TLB(x),TUB(x)], IB(x)=[ILB(x),IUB(x)], FB(x)=[FLB(x),FUB(x)], then

    ABTA(x)TB(x),IA(x)IB(x),FA(x)FB(x)ABTA(x)TB(x),IA(x)IB(x),FA(x)FB(x)A=BTA(x)=TB(x),IA(x)=IB(x),FA(x)=FB(x)

    And it satisfies that:

    TA(x)TB(x)TLA(x)TLB(x),TUA(x)TUB(x)TA(x)TB(x)TLA(x)TLB(x),TUA(x)TUB(x)TA(x)=TB(x)TLA(x)=TLB(x),TUA(x)=TUB(x)

    If A and B do not satisfy the above relationship, then they are said to be incompatible.

    Definition 2.5. A and B are two INNs, we have the following basic properties of INNs.

     (1) AAB,BAB (2) ABA,ABB (3) (AB)c=ACBC; (4) (AC)C=A

    Definition 2.6.[25] Let X be a finite set space of points (objects), and R be an equivalence relation on X. Denote by X/R the family of all equivalence classes induced by R. Obviously X/R gives a partition of X. (X, R) is called an interval neutrosophic approximation space. For xX, the lower and upper approximations of A are defined as below:

    R(A)={xX|[x]RA},R+(A)={xX|[x]RA},

    where

    [x]R={yX|(x,y)R}. It follows that R(A)AR+(A)

    If R(A)R+(A), A is called a rough set.

    Definition 2.7.[3] Let X be a space of points (objects) and C={C1,C2,,Cm} be a family of subsets of X. If none of the elements in C is empty and mi=1Ci=X, then C is called a covering of X, and (X,C) is called a covering approximation space.

    Definition 2.8.[3] Let (X,C) be a covering approximation space. For any xX, the neighborhood of x is defined as mi=1{CiC|xCi}, which is denoted by Nx.

    Definition 2.9.[24] Let (X,C) be a covering approximation space. For any xX, the lower and upper approximations of A are defined as below:

    C(A)={xX|NxA},C+(A)={xX|NxA}

    Based on the definition of neighborhood, the new covering rough models can be obtained.

    We will give the definition of interval neutrosophic covering rough sets in this section, meanwhile we'll also use some examples for the sake of intuition. In addition, we will given some properties and their proofs of INCRS.

    Definition 3.1. Let X be a space of points (objects). For any [s,t][0,1] and C={C1,C2,,Cm}, where Ci={Tc,iIci,Fci} and CiINS(i=1,2,,m). For xX,CkC, then Ck(x)[s,t], where TCk(x)[s,t],ICk(x)[1t,1s], FCk(x)[1t,1s]. Then C is called a interval neutrosophic [s,t] covering of X.

    Definition 3.2. Let C={C1,C2,,Cm} be an interval neutrosophic [s,t] covering of X. If 0[s,t][s,t], C is an interval neutrosophic [s,t]covering of X.

    Proof. C={C1,C2,,Cm} is a interval neutrosophic [s,t] covering of X. ThusCk(x)[s,t], and satisfy TCk(x)[s,t],ICk(x)[1t,1s], FCk(x)[1t,1s]. when 0[s,t][s,t], we can get 0[s,t][s,t]TCk(x) and 0ICk(x)[1s,1t][1s,1t],0FCk(x)[1s,1t][1s,1t]. So C is a interval neutrosophic left[s,t] covering of X.

    Definition 3.3.[26] Suppose C={C1,C2,,Cm} is an interval neutrosophic [s,t] covering of X. Ifs=t=β, then C is called a interval neutrosophic β covering of X.

    Definition 3.4. Suppose C={C1,C2,,Cm} is an interval neutrosophic [s,t] covering of X, where Ci={Tc,iIci,Fci} and CiINS(i=1,2,,m). For xX, the interval neutrosophic [s,t] neighborhood of x is defined as follows:

    N[s,t]x(y)={CiC|TCi(x)[s,t],ICi(x)[1t,1s],FCi(x)[1t,1s]}.

    Definition 3.5.[26] Let C={C1,C2,,Cm} be an interval neutrosophic [s,t] covering of X, where Ci={Tc,iIci,Fci} and CiINS(i=1,2,,m). If s=t=β, then the interval neutrosophic [s,t] neighborhood of x is degraded as the interval neutrosophic β neighborhood of x.

    Theorem 3.6. Let C={C1,C2,,Cm} be an interval neutrosophic [s,t] covering of X, where Ci={Tc,iIci,Fci} and CiINS(i=1,2,,m). x,y,zX, some propositions are shown as follows:

    (1) N[s,t]x(x)[s,t];

    (2) if N[s,t]x(y)[s,t] and N[s,t]y(z)[s,t], then N[s,t]x(z)[s,t];

    (3) CixX{N[s,t]x|Ci(x)[s,t]},i{1,2,,m};

    (4) if [s1,t1][s2,t2][s,t], then N[s1,t1]xN[s2,t2]x.

    Proof. (1)

    N[s,t]x(x)=(TCi(x)[s,t],ICi(x)[1t,1s],FCi(x)[1t,1s])(x)=(Ci(x)[s,t]Ci)(x)=Ci(x)[s,t]Ci(x)[s,t].

    (2)

    If N[s,t]x(y)[s,t], then N[s,t]x(y)=(TCi(x)[s,t],ICi(x)[1t,1s],FCi(x)[1t,1s]Ci)(y) =(Ci(x)[s,t]Ci)(y)=Ci(x)[s,t]Ci(y)[s,t], thus Ci(x)[s,t]Ci(y)[s,t], similarly, it can be obtained that Ci(y)[s,t]Ci(z)[s,t]. So Ci(x)[s,t]Ci(z)[s,t], thus N[s,t]x(z)=(TCi(x)[s,t],ICi(x)[1t,1s],FCi(x)[1t,1s]Ci)(z)=(Ci(x)[s,t]Ci)(z)=Ci(x)[s,t]Ci(z)[s,t]

    (3)

    N[s,t]x={CiC|TCi(x)[s,t],ICi(x)[1t,1s],FCi(x)[1t,1s]}=(Ci(x)[s,t]Ci)Ci, hence for any xX, it can be obtained that CixX{N[s,t]x(x)|Ci(x)[s,t]},(i=1,2,,m)

    (4)

    {CiC|TCi(x)[s1,t1],ICi(x)[1t1,1s1],FCi(x)[1t1,1s1]}={CiC|Ci(x)[s1,t1]}. When [s1,t1][s2,t2], it is obvious that {CiC|Ci(x)[s1,t1]}{CiC|Ci(x)[s2,t2]}, then {CiC|Ci(x)[s1,t1]}{CiC|Ci(x)[s2,t2]},, that is N[s1,t1]xN[s2,t2]x.

    Example 1. Let X be a space of a points(objects), with a class of elements in X denoted by x, C={C1,C2,C3,C4} is a interval neutrosophic covering of X, which is shown in Table 1. Set [s,t]=[0.4,0.5], and it can be gotten that C is a interval neutrosophic [0.4,0.5] covering of X.

    Table 1.  The interval neutrosophic [0.4,0.5] covering of X.
    C1 C2 C3 C4
    x1 [0.4,0.5],[0.2,0.3],[0.3,0.4] [0.4,0.6],[0.1,0.3],[0.2,0.4] [0.7,0.9],[0.2,0.3],[0.4,0.5] [0.4,0.5],[0.3,0.4],[0.5,0.7]
    x2 [0.6,0.7],[0.1,0.2],[0.2,0.3] [0.6,0.7],[0.1,0.2],[0.2,0.3] [0.3,0.6],[0.2,0.3],[0.3,0.4] [0.5,0.7],[0.2,0.3],[0.1,0.3]
    x3 [0.3,0.6],[0.3,0.5],[0.8,0.9] [0.5,0.6],[0.2,0.3],[0.3,0.4] [0.4,0.5],[0.2,0.4],[0.7,0.9] [0.3,0.5],[0.0,0.2],[0.2,0.4]
    x4 [0.7,0.8],[0.0,0.1],[0.1,0.2] [0.6,0.7],[0.1,0.2],[0.1,0.3] [0.6,0.7],[0.3,0.4],[0.8,0.9] [0.4,0.5],[0.5,0.6],[0.3,0.4]

     | Show Table
    DownLoad: CSV

    N[0.4,0.5]x1=C1C2C3,N[0.4,0.5]x2=C1C2C4,N[0.4,0.5]x3=C2C4,N[0.4,0.5]x4=C1C2.

    The interval neutrosophic [0.4,0.5] neighborhood of xi(i=1,2,3,4) is shown in Table 2. Obviously, the interval neutrosophic [0.4,0.5] neighborhood of xi(i=1,2,3,4) is covering of X.

    Table 2.  The interval neutrosophic [0.4,0.5] neighborhood of xi(i=1,2,3,4).
    x1 x2 x3 x4
    N[0.4,0.5]x1 [0.4,0.5],[0.2,0.3],[0.4,0.5] [0.3,0.6],[0.3,0.5],[0.8,0.9] [0.3,0.5],[0.2,0.4],[0.7,0.9] [0.6,0.7],[0.3,0.4],[0.8,0.9]
    N[0.4,0.5]x2 [0.4,0.5],[0.3,0.4],[0.5,0.7] [0.5,0.7],[0.2,0.3],[0.2,0.3] [0.3,0.5],[0.2,0.4],[0.3,0.4] [0.4,0.5],[0.5,0.6],[0.3,0.4]
    N[0.4,0.5]x3 [0.4,0.5],[0.3,0.4],[0.5,0.7] [0.5,0.7],[0.2,0.3],[0.2,0.3] [0.3,0.5],[0.2,0.3],[0.3,0.4] [0.4,0.5],[0.5,0.6],[0.3,0.4]
    N[0.4,0.5]x4 [0.4,0.5],[0.2,0.3],[0.3,0.4] [0.6,0.7],[0.1,0.2],[0.2,0.3] [0.3,0.6],[0.2,0.3],[0.3,0.4] [0.6,0.7],[0.1,0.2],[0.1.0.3]

     | Show Table
    DownLoad: CSV

    The interval neutrosophic [s,t] covering was presented in the previous section. Based on this, the coverage approximation space can be obtained.

    Definition 3.7.[26] Let C={C1,C2,,Cm} be an interval neutrosophic [s,t] covering of X, where Ci={TciIci,Fci} and CiINS(i=1,2,,m). Then (X,C) is called a interval neutrosophic [s,t] covering approximation space.

    Definition 3.8. Let (X,C) be an interval neutrosophic [s,t] covering approximation space, for any A INS, the lower approximation operator C_[s,t](A) and the upper approximation operator ¯C[s,t](A) of interval neutrosophic A are defined as follows: C_[s,t](A)={TC_[s,t](A),IC_[s,t](A),FC_[s,t](A)},¯C[s,t](A)={T¯C[s,t](A),I¯C[s,t](A),F¯C[s,t](A)}, where

    TC_[s,t](A)={TA(y)FN[s,t]x(y)|yX},IC_[s,t](A)={IA(y)([1,1]IN[s,t]x(y))|yX},
    FC_[s,t](A)={FA(y)TN[s,t]x(y)|yX},T¯C[s,t](A)={TA(y)TN[s,t]x(y)|yX},
    I¯C[s,t](A)={IA(y)IN[s,t]x(y))T|yX},F¯C[s,t](A)={FA(y)FN[s,t]x(y)|yX}.

    For any xX, then A is called an interval neutrosophic [s,t] covering rough set, if C_[s,t](A)¯C[s,t](A).

    Example 2. Let A be a interval neutrosophic set, where

    A(x1)=[0.4,0.6],[0.2,0.4],[0.3,0.4],A(x2)=[0.4,0.5],[0.1,0.3],[0.2,0.4],
    A(x3)=[0.4,0.5],[0.2,0.5],[0.3,0.6],A(x4)=[0.3,0.5],[0.2,0.4],[0.4,0.6].

    Then the lower approximation operator C_[0.4,0.5](A) and the upper approximation operator ¯C[0.4,0.5](A) of interval neutrosophic A can be calculated by Definition 3.8.

    C_[0.4,0.5](A)(x1)=[0.4,0.6],[0.2,0.5],[0.4,0.6],C_[0.4,0.5](A)(x2)=[0.3,0.5],[0.2,0.5],[0.4,0.5],
    C_[0.4,0.5](A)(x3)=[0.3,0.5],[0.2,0.5],[0.4,0.5],C_[0.4,0.5](A)(x4)=[0.3,0.5],[0.2,0.5],[0.4,0.6].
    ¯C[0.4,0.5](A)(x1)=[0.4,0.5],[0.2,0.4],[0.4,0.5],¯C[0.4,0.5](A)(x2)=[0.4,0.5],[0.2,0.3],[0.2,0.4],
    ¯C[0.4,0.5](A)(x1)=[0.4,0.5],[0.2,0.3],[0.2,0.4],¯C[0.4,0.5](A)(x2)=[0.4,0.5],[0.1,0.3],[0.2,0.4].

    In this section we'll give you some theorems about INCRS and a complete proof of them.

    Theorem 1. (1) C_[s,t](X)=X,¯C[s,t]()=;

    (2) C_[s,t](AC)=(¯C[s,t](A))C,¯C[s.t](AC)=(C_[s,t](A))C;

    (3) C_[s,t](AB)=C_[s,t](A)C_[s,t](B),¯C[s,t](AB)=¯C[s,t](A)¯C[s,t](B);

    (4) If AB, then C_[s,t](A)C_[s,t](B),¯C[s,t](A)¯C[s,t](B);

    (5) C_[s,t](AB)C_[s,t](A)C_[s,t](B),¯C[s,t](AB)¯C[s,t](A)¯C[s,t](B);

    (6) If 0[s,t][s,t], then C_[s,t](A)C_[s,t](A),¯C[s,t](A)¯C[s,t](A).

    proof. (1) TC_[s,t](X)={TX(y)FN[s,t]x(y)|yX}=[1,1],

    IC_[s,t](X)={IX(y)([1,1]IN[s,t]x(y))|yX}=[0,0],

    FC_[s,t](X)={FX(y)TN[s,t]x(y)|yX}=[0,0],

    C_[s,t](X)=TC_[s,t](X),IC_[s,t](X),FC_[s,t](X)=[1,1],[0,0],[0,0]=X;

    T¯C[s,t]()={T(y)TN[s,t]x(y)|yX}=[0,0],

    I¯C[s,t]()={I(y)IN[s,t]x(y)|yX}=[1,1],

    F¯C[s,t]()={F(y)FN[s,t]x(y)|yX}=[1,1],

    ¯C[s,t]()=T¯C[s,t](),I¯C[s,t](),F¯C[s,t]()=[0,0],[1,1],[1,1]=.

    (2) AC=FA,[1,1]IA,TA,

    TC_[s,t](AC)={FA(y)FN[s,t]x(y)|yX}=F¯C[s,t](A),

    IC_[s,t](AC)={([1,1]IA(y))([1,1]IN[s,t]x(y))|yX}

    =[1,1]{IA(y)IN[s,t]x(y)|yX}=[1,1]I¯C[s,t](A)

    FC_[s,t](AC)={TA(y)TN[s,t]x(y)|yX}=T¯C[s,t](A),

    C_[s,t](AC)={TC_[s,t](AC),IC_[s,t](AC),FC_[s,t](AC)}={F¯C[s,t](A),[1,1]I¯C[s,t](A),T¯C[s,t](A)}

    (¯C[s,t](A))C={F¯C[s,t](A),[1,1]I¯C[s,t](A),T¯C[s,t](A)}=C_[s,t](AC).

    Similarly, it can be gotten that ¯C[s.t](AC)=(C_[s,t](A))C

    (3) AB={TATB,IAIB,FAFB},

    TC_[s,t](AB)={(TA(y)TB(y))FN[s,t]x(y)|yX}

    ={(TA(y)FN[s,t]x(y))(TB(y)FN[s,t]x(y))|yX}=TC_[s,t](A)TC_[s,t](B),

    IC_[s,t](AB)={(IA(y)IB(y))([1,1]IN[s,t]x(y))|yX}

    ={(IA(y)([1,1]IN[s,t]x(y)))(IB(y)([1,1]IN[s,t]x(y)))|yX} =IC_[s,t](A)IC_[s,t](A),

    FC_[s,t](AB)={(FA(y)FB(y))TN[s,t]x(y)|yX}

    ={(FA(y)(TN[s,t]x(y)))(FB(y)(TN[s,t]x(y)))|yX}=FC_[s,t](A)FC_[s,t](A),

    C_[s,t](AB)={TC_[s,t](AB),IC_[s,t](AB),FC_[s,t](AB)}

    ={TC_[s,t](A)TC_[s,t](B),IC_[s,t](A)IC_[s,t](A),FC_[s,t](A)FC_[s,t](A)}=C_[s,t](A)C_[s,t](B).

    Similarly, it can be gotten that ¯C[s,t](AB)=¯C[s,t](A)¯C[s,t](B)

    (4) If AB, then TATB,IAIB,FAFB.

    When TATB, then {TA(y)FN[s,t]x(y)|yX}{TB(y)FN[s,t]x(y)|yX},

    thus {TA(y)FN[s,t]x(y)|yX} {TB(y)FN[s,t]x(y)|yX},

    hence {TB(y)FN[s,t]x(y)|yX}, {TB(y)FN[s,t]x(y)|yX}, that is TC_[s,t](A)TC_[s,t](B).

    When IAIB, then {IA(y)(1IN[s,t]x(y))|yX}{IB(y)([1,1]IN[s,t]x(y))|yX}.

    Thus {IA(y)([1,1]IN[s,t]x(y))|yX}{IB(y)([1,1]IN[s,t]x(y))|yX},

    hence IC_[s,t](A)IC_[s,t](A).

    When FAFB, then {FA(y)TN[s,t]x(y)|yX}{FB(y)TN[s,t]x(y)|yX},

    thus {FA(y)TN[s,t]x(y)|yX}{FB(y)TN[s,t]x(y)|yX}, so FC_[s,t](A)FC_[s,t](A),C_[s,t](A)C_[s,t](B).

    Similarly, it can be gotten that ¯C[s,t](A)¯C[s,t](B).

    (5) It is obvious that AAB,BAB, ABA,ABB.

    So C_[s,t](A)C_[s,t](AB),C_[s,t](B)C_[s,t](AB), ¯C[s,t](AB)¯C[s,t](A), ¯C[s,t](AB)¯C[s,t](B).

    Hence C_[s,t](A)C_[s,t](B)C[s,t](AB), ¯C[s,t](AB)¯C[s,t](A)¯C[s,t](B).

    (6) If 0[s,t][s,t], then N[s,t]xN[s,t]x. Thus TN[s,t]xTN[s,t]x, IN[s,t]xIN[s,t]x, FN[s,t]xFN[s,t]x, hence {TA(y)FN[s,t]x(y)|yX}{TA(y)FN[s,t]x(y)|yX},

    {IA(y)([1,1]IN[s,t]x(y))|yX}{IA(y)([1,1]IN[s,t]x(y))|yX},

    {FA(y)TN[s,t]x(y)|yX}{FA(y)TN[s,t]x(y)|yX}.

    That is C_[s,t](A)C_[s,t](A). Similarly, it can be gotten that ¯C[s,t](A)¯C[s,t](A).

    Theorem 2. Let (X,C) be an interval neutrosophic [s,t] covering approximation space, then the following statements are equivalent:

    (1) C_[s,t]()=;

    (2) ¯C[s,t](X)=X;

    (3) For anyxX, {yX|CiC((Ci(x)[s,t])(Ci(y)=X))}.

    Proof. {yX|CiC((Ci(x)[s,t])(Ci(y)=X))} means for each xX and Ci(x)[s,t],yX such that Ci(y)=X, satisfying N[s,t]x(y)=X.

    (1)(3) If C_[s,t]()=, then

    C_[s,t]()={FN[s,t]x(y),([1,1]IN[s,t]x(y)),TN[s,t]x(y)|yX}= yX,

    FN[s,t]x(y)=[0,0],IN[s,t]x(y)=[0,0],TN[s,t]x(y)=[1,1], that is N[s,t]x(y)=X.

    (3)(2) If N[s,t]x(y)=X, then

    ¯C[s,t](X)={TN[s,t]x(y),IN[s,t]x(y),FN[s,t]x(y)|yX}={[1,1],[0,0],[0,0]}=X.

    (2)(1) It is proved by the rotation of C_ and ¯C. So they are equivalent.

    Theorem 3. Let (X,C) be an interval neutrosophic [s,t] covering approximation space. Ais an INS and B is an constant interval neutrosophic set, where B=[α,α+],[β,β+],[γ,γ+]. It satisfies that for any xX, [α,α+],[β,β+],[γ,γ+](x)=[α,α+],[β,β+],[γ,γ+].

    If {yX|CiC((Ci(x)[s,t])(Ci(y)=X))}, then

    (1) C_[s,t](B)=B,¯C[s,t](B)=B;

    (2) C_[s,t](AB)=C_[s,t](A)B,¯C[s,t](AB)=¯C[s,t](A)B.

    Proof. (1) {yX|CiC((Ci(x)[s,t])(Ci(y)=X))} means for each xX and Ci(x)[s,t], yX, such that Ci(y)=X, then N[s,t]x(y)=X.

    TB_[s,t]={[α,α+]FN[s,t]x(y)|yX}=[α,α+],

    IB_[s,t]={[β,β+]([1,1]IN[s,t]x(y))|yX}=[β,β+],

    FB_[s,t]={[γ,γ+]TN[s,t]x(y)|yX}=[γ,γ+].

    So that C_[s,t](B)=B. Similarly, it can be gotten that ¯C[s,t](B)=B.

    (2) TC_[s,t](AB)={(TA(y)[α,α+])FN[s,t]x(y)|yX}={TA(y)FN[s,t]x(y)|yX}[α,α+],

    IC_[s,t](AB)={(IA(y)[β,β+])([1,1]IN[s,t]x(y))|yX}

    ={IA(y)([1,1]IN[s,t]x(y))|yX}[β,β+],

    FC_[s,t](AB)={(FA(y)[γ,γ+])TN[s,t]x(y)|yX}={FA(y)TN[s,t]x(y)|yX}[γ,γ+],

    Thus C_[s,t](AB)=C_[s,t](A)B. Similarly, it can be proofed that ¯C[s,t](AB)=¯C[s,t](A)B.

    Corollary. When α=α+=α,β=β+=β,γ=γ+=γ,B=α,β,γ It can be gotten that

    (1) C_[s,t]α,β,γ=α,β,γ,¯C[s,t]α,β,γ=α,β,γ;

    (2) C_[s,t](Aα,β,γ)=C_[s,t](A)α,β,γ,¯C[s,t](Aα,β,γ=¯C[s,t](A)α,β,γ.

    The proof is omitted.

    Theorem 4. Let (X,C) be an interval neutrosophic [s,t] covering approximation space. Ais an INS and AX, for any xX, there are

    (1) ¯C[s,t](1y)(x)=N[s,t]x(y);

    (2) C_[s,t](1X{y})(x)=(N[s,t]x(y))C.

    Proof. T¯C[s,t](1y)(x)={T1y(z)TN[s,t]x(z)|zX}

    =(T1y(y)TN[s,t]x(y))(zX{y}(T1y(z)TN[s,t]x(z)))

    =([1,1]TN[s,t]x(y))([0,0]TN[s,t]x(z))=TN[s,t]x(y),

    I¯C[s,t](1y)(x)={I1y(z)IN[s,t]x(z)|zX}

    =(I1y(y)IN[s,t]x(y))(zX{y}(I1y(z)IN[s,t]x(z)))

    =([0,0]IN[s,t]x(y))([1,1]IN[s,t]x(z))=IN[s,t]x(y),

    F¯C[s,t](1y)(x)={F1y(z)FN[s,t]x(z)|zX}

    =(F1y(y)FN[s,t]x(y))(zX{y}(F1y(z)FN[s,t]x(z)))

    =([0,0]FN[s,t]x(y))([1,1]FN[s,t]x(z))=FN[s,t]x(y).

    So ¯C[s,t](1y)(x)=N[s,t]x(y).

    Similarly, it can be gotten that C_[s,t](1X{y})(x)=(N[s,t]x(y))C, and the proof process is omitted.

    Theorem 5. Let (X,C) be an interval neutrosophic [s,t] covering approximation space. Ais an INS and AX, for any xX, if (N[s,t]x)CAN[s,t]x, then C_[s,t](C_[s,t](A))C_[s,t](A)A¯C[s,t](A)¯C[s,t](¯C[s,t](A)).

    Proof. (N[s,t]x)C=FN[s,t]x,([1,1]IN[s,t]x),TN[s,t]x.

    When (N[s,t]x)CA,thus FN[s,t]xTA, [1,1]IN[s,t]xIA,TN[s,t]xFA,

    so TC_[s,t](A)={TA(y)FN[s,t]x(y)|yX}={TA(y)|yX}TA,

    IC_[s,t](A)={IA(y)([1,1]IN[s,t]x(y))|yX}={IA(y)|yX}IA,

    FC_[s,t](A)={FA(y)TN[s,t]x(y)|yX}={FA(y)|yX}FA.

    That is C_[s,t](A)A. Similarly, A¯C[s,t](A).

    According to theorem 1(4), C_[s,t](C_[s,t](A))C_[s,t](A)A¯C[s,t](A)¯C[s,t](¯C[s,t](A)).

    Theorem 5 gives a sufficient condition for C_[s,t](A)A¯C[s,t](A), and then theorem 6 will give the necessary condition.

    Theorem 6. Let (X,C) be an interval neutrosophic [s,t] covering approximation space. AX, if xX,Ci(x)[s,t]Ci(x)=X(i={1,2,m}), and then

    C_[s,t](A)AˉC[s,t](A).

    Proof. xX,Ci(x)[s,t]Ci(x)=X(i={1,2,m}), which means xX,N[s,t]x=X=[1,1],[0,0],[0,0].

    TC_[s,t](A)={TA(y)FN[s,t]x(y)|yX}={TA(y)[0,0]|yX}={TA(y)|yX}TA,

    IC_[s,t](A)={IA(y)([1,1]IN[s,t]x(y))|yX}={IA(y)[1,1]|yX}={IA(y)|yX}IA,

    FC_[s,t](A)={FA(y)TN[s,t]x(y)|yX}={FA(y)[1,1]|yX}={FA(y)|yX}FA.

    So C_[s,t](A)A.

    T¯C[s,t](A)={TA(y)TN[s,t]x(y)|yX}={TA(y)|yX}TA,

    I¯C[s,t](A)={IA(y)IN[s,t]x(y)|yX}={IA(y)|yX}IA,

    F¯C[s,t](A)={FA(y)FN[s,t]x(y)|yX}={FA(y)|yX}FA.

    So A¯C[s,t](A).

    Hence C_[s,t](A)A¯C[s,t](A).

    Theorem 7. Let C={C1,C2,,Cm} be an interval neutrosophic [s,t] covering of X.AINS,¯C and C_ are the upper and lower approximation operator, which are defined in defination 3.8. Then we can get that:

     (1)  C is serial C_[s,t]α,β,λ=α,β,λ,α,β,λ[0,1],C_[s,t]()=,ˉC[s,t]α,β,λ=α,β,λ,α,β,λ[0,1],ˉC[s,t](X)=X;

     (2) C is reflexive C_[s,t](A)A,AˉC[s,t](A);

     (3) C is symmetric C_[s,t](1X(y}))(x)=C_[s,t](1X{x})(y),x,yX,ˉC[s,t](1y)(x)=ˉC[s,t](1x)(y),x,yX;

     (4) C is transitive C_[s,t](A)C_[s,t](C_[s,t](A)),ˉC[s,t](ˉC[s,t](A))ˉC[s,t](A).

    Proof. (1) When C is serial, then it satisfies yX and N[s,t]x(y)=X. So it can be proved by Theorem 3, Theorem 4 and Deduction.

    (2) When C is reflexive, then N[s,t]x(x)=X=[1,1],[0,0],[0,0]

    TC_[s,t](A)(x)={TA(y)FN[s,t]x(y)|yX}TA(x)FN[s,t]x(x)=TA(x),

    IC_[s,t](A)(x)={IA(y)([1,1]IN[s,t]x(y))|yX}IA(x)[1,1]=IA(x),

    FC_[s,t](A)(x)={FA(y)TN[s,t]x(y)|yX}FA(x)[1,1]=FA(x).

    That is C_[s,t](A)A.

    If C_[s,t](A)A, let A=1X(x), and x,yX, then

    TN[s,t]x(x)=(TN[s,t]x(x)[1,1])[0,0]

    =(TN[s,t]x(x)F(1X{x})(x))(yX{x}(TN[s,t]x(y)F(1X{x})(y)))

    ={TN[s,t]x(y)F(1X{x})(y)|yX}

    =FC_[s,t](1X{x})(x)F(1X{x})(x)=[1,1],

    [1,1]IN[s,t]x(x)={([1,1]IN[s,t]x(x))[1,1]}[0,0]

    ={([1,1]IN[s,t]x(x))I(1X{x})(x)}{yX{x}(([1,1]IN[s,t]x(y))I(1X{x})(y))}

    ={I(1X{x})(x)([1,1]IN[s,t]x(y))|yX}

    =IC_[s,t](1X{x})(x)I(1X{x})(x)=[1,1],

    so IN[s,t]x(x)=[0,0].

    FN[s,t]x(x)={FN[s,t]x(x))[0,0]}[1,1]

    ={FN[s,t]x(x)T(1X{x})(x)}{yX{x}(FN[s,t]x(y)T(1X{x})(y))}

    ={T(1X{x})(x)FN[s,t]x(y)|yX}

    =TC_[s,t](1X{x})(x)T(1X{x})(x)=[0,0].

    That is N[s,t]x(x)=[1,1],[0,0],[0,0]=X. So C is reflexive. Meanwhile, it is easy to prove the other part by the same way.

    (3) TC_[s,t](1X{x})(y)={T(1X{x})(z)FN[s,t]y(z)|zX}

    ={FN[s,t]y(x)T(1X{x})(x)}{zX{x}(FN[s,t]y(z)T(1X{x})(z))}

    ={FN[s,t]y(x)[0,0]}[1,1] =FN[s,t]y(x), TC_[s,t](1X{y})(x)={T(1X{y})(z)FN[s,t]x(z)|zX}

    ={FN[s,t]x(y)T(1X{y})(y)}{zX{y}(FN[s,t]x(z)T(1X{y})(z))}

    ={FN[s,t]x(y)[0,0]}[1,1]

    =FN[s,t]x(y),

    IC_[s,t](1X{x})(y)={I(1X{x})(z)([1,1]IN[s,t]y(z))|zX}

    ={([1,1]IN[s,t]y(x))I(1X{x})(x)}{zX{x}(([1,1]IN[s,t]y(z))I(1X{x})(z))}

    ={([1,1]IN[s,t]y(x))[1,1]}[0,0]

    =[1,1]IN[s,t]y(x),

    IC_[s,t](1X{y})(x)={I(1X{y})(z)([1,1]IN[s,t]x(z))|zX}

    ={([1,1]IN[s,t]x(y))I(1X{y})(y)}{zX{y}(([1,1]IN[s,t]x(z))I(1X{y})(z))}

    ={([1,1]IN[s,t]x(y))[1,1]}[0,0]

    =[1,1]IN[s,t]x(y),

    FC_[s,t](1X{x})(y)={F(1X{x})(z)TN[s,t]y(z)|zX}

    ={TN[s,t]y(x)F(1X{x})(x)}{zX{x}(TN[s,t]y(z)F(1X{x})(z))}

    ={TN[s,t]y(x)[1,1]}[0,0]

    =TN[s,t]y(x),

    FC_[s,t](1X{y})(x)={F(1X{y})(z)TN[s,t]x(z)|zX}

    ={TN[s,t]x(y)F(1X{y})(y)}{zX{y}(TN[s,t]x(z)F(1X{y})(z))}

    ={TN[s,t]x(y)[1,1]}[0,0]

    =TN[s,t]x(y).

    So when is symmetric, it satisfies TN[s,t]x(y)=TN[s,t]y(x),IN[s,t]x(y)=IN[s,t]y(x), FN[s,t]x(y)=FN[s,t]y(x), that is N[s,t]x(y)=N[s,t]y(x), then

    TC_[s,t](1X{x})(y)=TC_[s,t](1X{y})(x),

    IC_[s,t](1X{x})(y)=IC_[s,t](1X{y})(x),FC_[s,t](1X{x})(y)=FC_[s,t](1X{y})(x)

    That is C_[s,t](1X{x})(y)=C_[s,t](1X{y})(x).

    It is similar to get ¯C[s,t](1y)(x)=¯C[s,t](1x)(y), and the proof is omitted.

    (4) If C is transitive, then {TN[s,t]x(y)TN[s,t]y(z)|yX}TN[s,t]x(z),

    {IN[s,t]x(y)IN[s,t]y(z)|yX}IN[s,t]x(z), {FN[s,t]x(y)FN[s,t]y(z)|yX}FN[s,t]x(z).

    TC_[s,t](C_[s,t](A))(x)={TC_[s,t](A)(y)FN[s,t]x(y)|yX}={{TA(z)FN[s,t]y(z)|zX}FN[s,t]x(y)|yX}

    =yXzX(TA(z)FN[s,t]x(z)FN[s,t]x(y))=zX(yX(FN[s,t]y(z)FN[s,t]x(y))TA(z))

    zX(FN[s,t]x(z)TA(z))=TC_[s,t](A)(x),

    IC_[s,t](C_[s,t](A))(x)={IC_[s,t](A)(z)(1IN[s,t]x(y))|yX}

    ={{IA(z)(1IN[s,t]y(z))|zX}(1IN[s,t]x(y))|yX}

    =yXzX(IA(z)(1IN[s,t]y(z))(1IN[s,t]x(y))=zX((1yX(IN[s,t]y(z)IN[s,t]x(y))IA(z)

    zX(1IN[s,t]x(z))IA(z)=IC_[s,t](A)(x),

    FC_[s,t](C_[s,t](A))(x)={FC_[s,t](A)(y)TN[s,t]x(y)|yX}={{FA(z)TN[s,t]y(z)|zX}TN[s,t]x(y)|yX}

    =yXzX(FA(z)TN[s,t]y(z)TN[s,t]x(y))=zX(yX(TN[s,t]y(z)TN[s,t]x(y)))FA(z)

    zX(TN[s,t]x(z)FA(z))=FC_[s,t](A)(x),

    so C_[s,t](A)C_[s,t](C_[s,t](A)).

    Similarly, it can be gotten that ¯C[s,t](¯C[s,t](A))¯C[s,t](A). If C_[s,t](A)C_[s,t](C_[s,t](A)), let A=1X{x} and x,y,zX, \\ from the proving process of (3), we have

    TN[s,t]x(z)=FC_[s,t](1X{z})(x)FC_[s,t](C_[s,t](1X{z})(x) ={FC_[s,t](1X{z})(y)TN[s,t]x(y)|yX}

    ={TN[s,t]y(z)TN[s,t]x(y)|yX},

    [1,1]IN[s,t]x(z)=IC_[s,t](1X{z})(x)IC_[s,t](C_[s,t](1X{z})(x) {IC_[s,t](1X{z})(y)([1,1]IN[s,t]x(y))|yX}

    ={([1,1]IN[s,t]y(z)([1,1]IN[s,t]x(y)|yX},

    Thus IN[s,t]x(z){IN[s,t]y(z)IN[s,t]x(y)|yX}.

    FN[s,t]x(z)=TC_[s,t](1X{z})(x)TC_[s,t](C_[s,t](1X{z})(x) ={TC_[s,t](1X{z})(y)FN[s,t]x(y)|yX}

    ={FN[s,t]y(z)FN[s,t]x(y)|yX},

    Therefore C is transitive. When ¯C[s,t](¯C[s,t](A))¯C[s,t](A), it can be proved C is transitive by the same way.

    In medicine, a combination of drugs is usually used to cure a disease. Suppose, X={xj,j=1,2,,n} is a collection of n drugs, V={yi,i=1,2,,m} are m important symptom (such as fever, cough, fatigue, phlegm, etc.) of diseases (such as: 2019-NCOV, etc.), and Ci(xj) represents the effective value of medication for the treatment of symptoms.

    Let [s,t] be the evaluation range. For each drugxjX, if there is at least one symptom yiV that causes the effective value of drug xj for the treatment of symptom yi to be in the [s,t] interval, thenC={Ci:i=1,2,,m} is the interval neutrosophic [s,t] covering on X. Thus, for each drug xj, we consider the set of symptoms {yi:Ci(xj)[s,t]}.

    The interval neutrosophic [s,t] neighborhood of xj is N[s,t]xj={CiC|TCi(xj)[s,t],ICi(xj)[1t,1s],FCi(xj)[1t,1s]}(xk)=(Ci(x)[s,t]Ci)Ci(xk,k=1,2,,n. This represents the effective value interval for each drugxk for all symptoms in the symptom set {yi:Ci(xj)[s,t]}. We consider as the upper and lower thresholds of effective values of s and t. If they are lower than the lower threshold, there will be no therapeutic effect; if they are higher than the upper threshold, the therapeutic effect will be too strong, and it is easy to cause other side effects to the body during the treatment (regardless of the situation of reducing the usage). Let an interval neutrosophic set of A represent the therapeutic ability of all drugs in X that can cure disease X. Since Ais imprecise, we consider the approximation of A, that is, the lower approximation and the upper approximation of interval neutrosophic covering rough.

    Example 3. LetX be a space of a points (objects), with a class of elements in X denoted by x, being a interval neutrosophic covering of X, which is shown in Table 3. Set [s,t]=[0.4,0.5], and it can be gotten that C is a interval neutrosophic [s,t] covering of X. N[0.4,0.5]x1=C1C2C3,N[0.4,0.5]x2=C1C4,N[0.4,0.5]x3=C2C4,N[0.4,0.5]x4=C2C3. The interval neutrosophic [s,t]neighborhood of xi(i=1,2,3,4) is shown in Table 4. Obviously, the interval neutrosophic[s,t]neighborhood of xi(i=1,2,3,4) is covering of X.

    Table 3.  The interval neutrosophic [0.4,0.5] neighborhood of xi(i=1,2,3,4).
    C1 C2 C3 C4
    x1 [0.4,0.5],[0.2,0.3],[0.4,0.5] [0.4,0.6],[0.1,0.3],[0.3,0.5] [0.7,0.9],[0.2,0.3],[0.4,0.5] [0.4,0.5],[0.3,0.4],[0.6,0.7]
    x2 [0.6,0.7],[0.1,0.2],[0.2,0.3] [0.2,0.4],[0.1,0.2],[0.2,0.3] [0.3,0.6],[0.3,0.5],[0.8,0.9] [0.5,0.7],[0.2,0.3],[0.4,0.6]
    x3 [0.3,0.5],[0.2,0.3],[0.4,0.5] [0.5,0.6],[0.2,0.3],[0.3,0.4] [0.3,0.5],[0.2,0.4],[0.3,0.4] [0.5,0.6],[0.0,0.2],[0.3,0.4]
    x4 [0.7,0.8],[0.6,0.7],[0.1,0.2] [0.6,0.7],[0.1,0.2],[0.1,0.3] [0.6,0.7],[0.3,0.4],[0.3,0.5] [0.3,0.5],[0.5,0.6],[0.6,0.7]

     | Show Table
    DownLoad: CSV
    Table 4.  The interval neutrosophic [0.4,0.5] covering of X.
    C1 C2 C3 C4
    x1 [0.4,0.5],[0.2,0.3],[0.4,0.5] [0.2,0.4],[0.3,0.5],[0.8,0.9] [0.3,0.5],[0.2,0.4],[0.4,0.5] [0.6,0.7],[0.6,0.7],[0.3,0.5]
    x2 [0.4,0.5],[0.3,0.4],[0.6,0.7] [0.5,0.7],[0.2,0.3],[0.4,0.6] [0.3,0.5],[0.2,0.3],[0.4,0.5] [0.3,0.5],[0.6,0.7],[0.6,0.7]
    x3 [0.4,0.5],[0.3,0.4],[0.6,0.7] [0.2,0.4],[0.2,0.3],[0.4,0.6] [0.5,0.6],[0.2,0.3],[0.3,0.5] [0.3,0.5],[0.5,0.6],[0.6,0.7]
    x4 [0.4,0.6],[0.2,0.3],[0.4,0.5] [0.2,0.4],[0.3,0.5],[0.8,0.9] [0.3,0.5],[0.2,0.4],[0.3,0.5] [0.6,0.7],[0.3,0.4],[0.3,0.5]

     | Show Table
    DownLoad: CSV

    Let A be an interval neutrosophic set, and

    A(x1)=[0.2,0.4],[0.2,0.4],[0.3,0.4],A(x2)=[0.5,0.7],[0.1,0.3],[0.2,0.4],A(x3)=[0.3,0.4],[0.2,0.5],[0.3,0.5],A(x4)=[0.5,0.6],[0.2,0.4],[0.4,0.6].

    The lower approximation operator C_[0.4,0.5](A) and the upper approximation operator ¯C[0.4,0.5](A) of the intelligent set A in the interval can be obtained by definition 3.9.

    C_[0.4,0.5](A)(x1)=[0.4,0.5],[0.2,0.5],[0.4,0.6],C_[0.4,0.5](A)(x2)=[0.4,0.5],[0.2,0.5],[0.3,0.5],C_[0.4,0.5](A)(x3)=[0.3,0.5],[0.2,0.5],[0.3,0.5],C_[0.4,0.5](A)(x4)=[0.3,0.5],[0.2,0.5],[0.4,0.6].¯C[0.4,0.5](A)(x1)=[0.5,0.6],[0.2,0.4],[0.4,0.5],¯C[0.4,0.5](A)(x2)=[0.5,0.7],[0.2,0.3],[0.4,0.5],¯C[0.4,0.5](A)(x3)=[0.3,0.5],[0.2,0.3],[0.3,0.5],¯C[0.4,0.5](A)(x4)=[0.5,0.6],[0.2,0.4],[0.3,0.5].

    Then A is the interval neutrosophic [s,t] covering of X.

    And we can get that

    (1) A(x2)[0.4.0.5],C_[0.4,0.5](A)(x2)[0.4.0.5],¯C[0.4,0.5](A)(x2)[0.4.0.5]. Therefore, drug x2plays an important role in the treatment of diseaseA.

    (2) A(x3)<[0.4.0.5],C_[0.4,0.5](A)(x3)<[0.4.0.5],¯C[0.4,0.5](A)(x3)<[0.4.0.5]. So drug x3 has no effect on the treatment of diseaseA.

    (3) A(x1)<[0.4.0.5],C_[0.4,0.5](A)(x1)[0.4.0.5],¯C[0.4,0.5](A)(x1)[0.4.0.5]. Therefore, drug x1 has less effect on the treatment of disease A than drug x2 and drug x4.

    In this paper, we propose the interval neutrosophic covering rough sets by combining the CRS and INS. Firstly, the paper introduces the definition of interval neutrosophic sets and covering rough sets, where the covering rough set is defined by neighborhood. Secondly, Some basic properties and operation rules of interval neutrosophic sets and covering rough sets are discussed. Thirdly, the definition of interval neutrosophic covering rough sets are proposed. Then, this paper put forward some theorems and give their proofs of interval neutrosophic covering rough sets. Lastly, we give the numerical example to apply the interval neutrosophic covering rough sets in the real life.

    The authors wish to thank the editors and referees for their valuable guidance and support in improving the quality of this paper. This research was funded by the Humanities and Social Sciences Foundation of Ministry of Education of the Peoples Republic of China (17YJA630115).

    The authors declare that there is no conflict of interest.



    [1] S. Perelson, Modeling the interaction of the immune system with HIV, In: Mathematical and statistical approaches to AIDS epidemiology, Berlin: Springer, 1989,350–370. https://doi.org/10.1007/978-3-642-93454-4_17
    [2] A. S. Perelson, D. E. Kirschner, R. De Boer, Dynamics of HIV infection of CD4+ T-cells, Math. Biosci., 114 (1993), 81–125. https://doi.org/10.1016/0025-5564(93)90043-a doi: 10.1016/0025-5564(93)90043-a
    [3] R. V. Culshaw, S. Ruan, A delay- differential equation model of HIV infection of CD4+ T-cells, Math. Biosci., 165 (2000), 27–39. https://doi.org/10.1016/S0025-5564(00)00006-7 doi: 10.1016/S0025-5564(00)00006-7
    [4] X. Wang, X. Song, Global stability and periodic solution of a model for HIV infection of CD4+ T-cells, Appl. Math. Comput., 189 (2007), 1331–1340. https://doi.org/10.1016/j.amc.2006.12.044 doi: 10.1016/j.amc.2006.12.044
    [5] M. S. Mechee, N. Haitham, Application of lie symmetry for mathematical model of HIV infection of CD4+ t-cells, Int. J. Appl. Eng. Res., 13 (2018), 5069–5074.
    [6] Q. Li, Y. Xiao, Global dynamics of a virus immune system with virus guided therapy and saturation growth of virus, J. Mathe. Prob. Engi., 2018 (2018), 4710586. https://doi.org/10.1155/2018/4710586 doi: 10.1155/2018/4710586
    [7] L. J. G. Lima, M. S. Espindola, L. S. Soares, F. A. Zambuzi, M. Cacemiro, C. Fontanari, et al. Classical and alternative macrophages have impaired function during acute and chronic HIV-1 infection, Braz. J. Infect. Dis., 21 (2017), 42–50. https://doi.org/10.1016/j.bjid.2016.10.004 doi: 10.1016/j.bjid.2016.10.004
    [8] S. A. Kinner, K. Snow, A. L. Wirtz, F. L. Altice, C. Beyrer, K. Dolan, et al. Age-specific global prevalence of hepatitis B, hepatitis C, HIV and tuberculosis among incarcerated people: A systematic review, J. Math. Biol., 62 (2018), 18–26. https://doi.org/10.1016/j.jadohealth.2017.09.030 doi: 10.1016/j.jadohealth.2017.09.030
    [9] J. M. C. Angulo, T. A. C. Cuesta, E. P. Menezes, C. Pedroso, C. Brites, A systematic review on the influence of HLA-B polymorphisms on HIV-1 mother to child transmission, Braz. J. Infect. Dis., 23 (2019), 53–59. https://doi.org/10.1016/j.bjid.2018.12.002 doi: 10.1016/j.bjid.2018.12.002
    [10] K. Theys, P. Libin, A. C. P. Pena, A. Nowe, A. M. Vandamme, A. B. Abecasis, The impact of HIV-1 within host evolution on transmission dynamics, Curr. Opin. Virol., 28 (2018), 92–101. https://doi.org/10.1016/j.coviro.2017.12.001 doi: 10.1016/j.coviro.2017.12.001
    [11] D. Hallberg, T. D. Kimario, C. Mtuya, M. Msuya, G. Bjorling, Factors affecting HIV disclosure among partners in morongo, tanzania, Int. J. Afr. Nurs. Sci., 10 (2019), 49–54. https://doi.org/10.1016/j.ijans.2019.01.006 doi: 10.1016/j.ijans.2019.01.006
    [12] Y. Ransome, K. A. Thurber, M. Swen, N. D. Crawford, D. Germane, L. T. Dean, Social capital and HIV/AIDS in the united states: Knowledge, gaps and future directions, SSM-Popul. Heal., 5 (2018), 73–85. https://doi.org/10.1016/j.ssmph.2018.05.007 doi: 10.1016/j.ssmph.2018.05.007
    [13] K. Naidoo, S. Gengiah, S. Singh, J. Stillo, N. Padayatchi, Quality of tb care among people living with HIV: Gaps and solutions, J. liCnical Tuberc. Mycobacterial Dis., 17 (2019), 100122. https://doi.org/10.1016/j.jctube.2019.100122 doi: 10.1016/j.jctube.2019.100122
    [14] E. O. Omondi, W. R. Mbogo, L. S. Luboobi, A mathematical modeling study of HIV infection in two heterosexual age groups in kenya, J. Infect. Dis. Model., 4 (2019), 83–98. https://doi.org/10.1016/j.idm.2019.04.003 doi: 10.1016/j.idm.2019.04.003
    [15] W. M. Sweileh, Global research activity on mathematical modeling of transmission and control of 23 selected infectious disease outbreak, Global. Health, 18 (2022), 4. https://doi.org/10.1186/s12992-022-00803-x doi: 10.1186/s12992-022-00803-x
    [16] Y. Wu, S. Ahmad, A. Ullah, K. Shah, Study of the fractional-order hiv-1 infection model with uncertainty in initial data, Math. Probl. Eng., 2022 (2022), 7286460. https://doi.org/10.1155/2022/7286460 doi: 10.1155/2022/7286460
    [17] T. K. Ayele, E. F. D. Goufo, S. Mugisha, Mathematical modeling of HIV/AIDS with optimal control: A case study in ethiopia, Results Phys., 26 (2021), 104263. https://doi.org/10.1016/j.rinp.2021.104263 doi: 10.1016/j.rinp.2021.104263
    [18] N. H. Aljahdaly, R. Alharbey, Fractional numerical simulation of mathematical model of hiv-1 infection with stem cell therapy, AIMS Math., 6 (2021), 6715–6726. https://doi.org/10.3934/math.2021394 doi: 10.3934/math.2021394
    [19] N. Sultanoglu, F. Saad, T. Sanlidag, E. Hincal, M. Sayan, K. Suer, Analysis of hiv infection in cyprus using a mathematical model, Erciyes Med. J., 44 (2022), 63–68.
    [20] R. Duro, N. R. Pereira, C. Figueiredo, C. Pineiro, C. Caldas, R. Serrao, et al. Routine CD4 monitoring in HIV patients with viral suppression: Is it really necessary? A portuguese cohort, J. Microbiol. Immunol., 52 (2018), 593–597. https://doi.org/10.1016/j.jmii.2016.09.003 doi: 10.1016/j.jmii.2016.09.003
    [21] M. A. Khan, A. Atangana, Modeling the dynamics of novel coronavirus (2019-ncov) with fractional derivative, Alex. Eng. J., 59 (2020), 2379–2389, http://dx.doi.org/https://doi.org/10.1016/j.aej.2020.02.033 doi: 10.1016/j.aej.2020.02.033
    [22] M. Medan, Homotopy perturbation method for solving a model for HIV infection of CD4+ T-cells, Istanbul Ticaret Universitesi Fen Bilimleri Dergisi, 12 (2007), 39–52.
    [23] M. Y. Ongun, The laplace adomian decomposition method for solving a model for HIV infection of CD4+ T-cells, Math. Comput. Model., 53 (2011), 597–603. https://doi.org/10.1016/j.mcm.2010.09.009 doi: 10.1016/j.mcm.2010.09.009
    [24] M. Ghoreishi, A. I. B. Ismail, A. K. Alomari, Application of the homotopy analysis method for solving a model for HIV infection of CD4+ T-cells, Math. Comput. Model., 54 (2011), 3007–3015. https://doi.org/10.1016/j.mcm.2011.07.029 doi: 10.1016/j.mcm.2011.07.029
    [25] N. Ali, S. Ahmad, S. Aziz, G. Zaman, The adomian decomposition method for solving HIV infection model of latently infected cells, MSMK, 3 (2019), 5–8. https://doi.org/10.26480/msmk.01.2019.05.08 doi: 10.26480/msmk.01.2019.05.08
    [26] Attaullah, R. Jan, Ş. Yüzbaşı, Dynamical behaviour of hiv infection with the influence of variable source term through galerkin method, Chaos Soliton. Fract., 152 (2021), 111429. https://doi.org/10.1016/j.chaos.2021.111429 doi: 10.1016/j.chaos.2021.111429
    [27] S. Yuzbasi, M. Karacayir, An exponential galerkin method for solution of HIV infected model of CD4+ t-cells, Comput. Biol. Chem., 67 (2017), 205–212. https://doi.org/10.1016/j.compbiolchem.2016.12.006 doi: 10.1016/j.compbiolchem.2016.12.006
    [28] Attaullah, M. Sohaib, Mathematical modeling and numerical simulation of HIV infection model, Results Appl. Math., 7 (2020), 10118. https://doi.org/10.1016/j.rinam.2020.100118 doi: 10.1016/j.rinam.2020.100118
    [29] D. Kirschner, S. Lenhart, S. Serbin, Optimal control of the chemotherapy of HIV, J. Math. Biol., 35 (1997), 775–792. https://doi.org/10.1007/s002850050076 doi: 10.1007/s002850050076
    [30] Attaullah, R. Jan, A. Jabeen, Solution of the hiv infection model with full logistic proliferation and variable source term using galerkin scheme, Matrix Sci. Math., 4 (2020), 37–43. https://doi.org/10.26480/msmk.02.2020.37.43 doi: 10.26480/msmk.02.2020.37.43
    [31] Attaullah, S. Hussain, S. M. Bakhtiar, Numerical solution of the model for HIV infection of CD4+ T-cells, LAP LAMBERT Academic Publishing, 2016.
    [32] W. Kutta, Beitrag zur naerungsweisen integration totaler differential gleichungen, Z. Math. Phys., 46 (1901), 435–453.
    [33] J. Butcher, Numerical methods for ordinary differential equations, John Wiley & Sons, 2016. https://doi.org/10.1002/9781119121534
    [34] R. Conner, H. Mohri, Y. Cao, D. Ho, Increased viral burden and cytopathicity correlate temporally with CD4+ T-cells lymphocyte decline and clinical progression in HIV-1 infected individuals, J. Virol., 67 (1993) 1772–1777. https://doi.org/10.1128/jvi.67.4.1772-1777.1993
  • This article has been cited by:

    1. Reny George, Zoran D. Mitrović, Ali Turab, Ana Savić, Wajahat Ali, On a Unique Solution of a Class of Stochastic Predator–Prey Models with Two-Choice Behavior of Predator Animals, 2022, 14, 2073-8994, 846, 10.3390/sym14050846
    2. Ali Turab, On a unique solution and stability analysis of a class of stochastic functional equations arising in learning theory, 2022, 42, 0174-4747, 261, 10.1515/anly-2022-1052
    3. Ali Turab, Nabil Mlaiki, Nahid Fatima, Zoran D. Mitrović, Wajahat Ali, Analysis of a Class of Stochastic Animal Behavior Models under Specific Choice Preferences, 2022, 10, 2227-7390, 1975, 10.3390/math10121975
    4. Muhammad Nazam, Sumit Chandok, Aftab Hussain, Hamed H. Al Sulmi, On the Iterative Multivalued ⊥-Preserving Mappings and an Application to Fractional Differential Equation, 2023, 12, 2075-1680, 53, 10.3390/axioms12010053
    5. Ismat Beg, Mujahid Abbas, Muhammad Waseem Asghar, Approximation of the Solution of Split Equality Fixed Point Problem for Family of Multivalued Demicontractive Operators with Application, 2023, 11, 2227-7390, 959, 10.3390/math11040959
    6. Ali Turab, Norhayati Rosli, Wajahat Ali, Juan J. Nieto, The existence and uniqueness of solutions to a functional equation arising in psychological learning theory, 2023, 56, 2391-4661, 10.1515/dema-2022-0231
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2275) PDF downloads(78) Cited by(9)

Figures and Tables

Figures(3)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog