Improving vaccination coverage and offering vaccine to all school-age children allowed uninterrupted in-person schooling in King County, WA: Modeling analysis

1.   Introduction

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.

2.   Preliminaries

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

2.1.   Interval neutrosophic 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 $T_{A(x)}$, an indeterminacy-membership function $I_{A(x)}$, and a falsity-membership function $F_{A(x)}$.The functions $T_{A(x)}$, $I_{A(x)}$, $F_{A(x)}$ are real standard or non-standard subsets of $] 0^{-}, 1^{+}[$. That is $T_{A}(x) : X \rightarrow] 0^{-}, 1^{+}\left[I_{A}(x) : X \rightarrow\right] 0^{-}, 1^{+}$ and $F_{A}(x) : X \rightarrow] 0^{-}, 1^{+}[$.

There is restriction on the sum of $T_{A}(x), I_{A}(x)$ and $F_{A}(x)$, so $0^{-} \leq \sup T_{A}(x)+\sup I_{A}(x)+\sup F_{A}(x) \leq 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 $T_{N(x)}$, an indeterminacy-membership function $I_{N(x)}$, and a falsity-membership function $F_{N(x)}$. Then an INS $A$ can be denoted as follows:

where $T_{A}(x) = \left[T_{A}^{L}(x), T_{A}^{U}(x)\right]$, $I_{A}(x) = \left[I_{A}^{L}(x), I_{A}^{U}(x)\right]$, $F_{A}(x) = \left[F_{A}^{L}(x), F_{A}^{U}(x)\right] \subseteq[0, 1]$ for $\forall x \in X$. Meanwhile, the sum of $T_{A}(x) I_{A}(x),$ and $F_{A}(x)$ fulfills the condition $0 \leq T_{A}(x)+I_{A}(x)+F_{A}(x) \leq 3.$

For convenience, we refer to $A = \langle T_{A}, I_{A}, F_{A}\rangle = \langle\left[T_{A}^{L}, T_{A}^{U}\right], \left[I_{A}^{L}, I_{A}^{U}\right], \left[F_{A}^{L}, F_{A}^{U}\right]\rangle$ as an interval neutrosophic number (INN), which is a basic unit of INS. In addition, let $X = \langle[1,1], [0, 0], [0, 0]\rangle$ be the biggest interval neutrosophic number, and $\emptyset = \langle[0, 0], [1,1], [1,1]\rangle$ be the smallest interval neutrosophic number.

Definition 2.3.^[13] The complement of an INS $A = \langle T_{A}, I_{A}, F_{A}\rangle = \langle\left[T_{A}^{L}, T_{A}^{U}\right], \left[I_{A}^{L}, I_{A}^{U}\right], \left[F_{A}^{L}, F_{A}^{U}\right]\rangle$ is denoted by $A^{C}$ and which is defined as $A^{C} = \langle\left[F_{A}^{L}, F_{A}^{U}\right], \left[1-I_{A}^{U}, 1-I_{A}^{L}\right], \left[T_{A}^{L}, T_{A}^{U}\right]\rangle$. For any $x, y \in X$, an INS $1_{y}$ and its complement $1_{X-\{y\}}$ are defined as follows:

Definition 2.4.^[16] $A = \left\{\langle x, T_{A}(x), I_{A}(x), F_{A}(x)\rangle\right\}$ and $B = \left\{\langle x, T_{B}(x), I_{B}(x), F_{B}(x)\rangle\right\}$ are two interval neutrosophic sets, where $T_{A}(x) = \left[T_{A}^{L}(x), T_{A}^{U}(x)\right]$, $I_{A}(x) = \left[I_{A}^{L}(x), I_{A}^{U}(x)\right]$, $F_{A}(x) = \left[F_{A}^{L}(x), F_{A}^{U}(x)\right]$, and $T_{B}(x) = \left[T_{B}^{L}(x), T_{B}^{U}(x)\right]$, $I_{B}(x) = \left[I_{B}^{L}(x), I_{B}^{U}(x)\right]$, $F_{B}(x) = \left[F_{B}^{L}(x), F_{B}^{U}(x)\right]$, then

And it satisfies that:

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.

2.2.   Covering rough sets

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 $x \in X$, the lower and upper approximations of $A$ are defined as below:

where

If $R^{-}(A)\neq R^{+}(A)$, $A$ is called a rough set.

Definition 2.7.^[3] Let $X$ be a space of points (objects) and $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be a family of subsets of $X$. If none of the elements in $C$ is empty and $\bigcup_{i = 1}^{m} C_{i} = 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 $x \in X$, the neighborhood of $x$ is defined as $\bigcap_{i = 1}^{m}\left\{C_{i} \in C | x \in C_{i}\right\}$, which is denoted by $N_{x}$.

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

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

3.   The notion of interval neutrosophic covering rough sets

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] \in[0, 1]$ and $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$, where $C_{i} = \left\{T_{c, i} I_{c_{i}}, F_{c_{i}}\right\}$ and $C_{i} \in INS(i = 1, 2, \cdots, m)$. For $\forall x \in X, \exists C_{k} \in C$, then $C_{k}(x) \geq[s, t]$, where $T_{C_{k}}(x) \geq[s, t], I_{C_{k}}(x) \leq[1-t, 1-s]$, $F_{C_{k}}(x) \leq[1-t, 1-s]$. Then $C$ is called a interval neutrosophic $[s, t]$ covering of $X$.

Definition 3.2. Let $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be an interval neutrosophic $[s, t]$ covering of $X$. If $0 \leq\left[s^{\prime}, t^{\prime}\right] \leq[s, t]$, $C$ is an interval neutrosophic $\left[s^{\prime}, t^{\prime}\right]$covering of $X$.

Proof. $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ is a interval neutrosophic $[s, t]$ covering of $X$. Thus$C_{k}(x) \geq[s, t]$, and satisfy $T_{C_{k}}(x) \geq[s, t], I_{C_{k}}(x) \leq[1-t, 1-s]$, $F_{C_{k}}(x) \leq[1-t, 1-s]$. when $0\le [{s}', {t}']\le [s, t]$, we can get $0\le [{s}', {t}']\le [s, t]\le {{T}_{{{C}_{k}}}}(x)$ and $0\le {{I}_{{{C}_{k}}}}(x)\le [1-s, 1-t]\le [1-{s}', 1-{t}'], 0\le {{F}_{{{C}_{k}}}}(x)\le [1-s, 1-t]\le [1-{s}', 1-{t}'].$ So $C$ is a interval neutrosophic left$[{s}', {t}']$ covering of $X$.

Definition 3.3.^[26] Suppose $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ is an interval neutrosophic $[s, t]$ covering of $X$. If$s = t = \beta$, then $C$ is called a interval neutrosophic $\beta$ covering of $X$.

Definition 3.4. Suppose $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ is an interval neutrosophic $[s, t]$ covering of $X$, where $C_{i} = \left\{T_{c, i} I_{c_{i}}, F_{c_{i}}\right\}$ and $C_{i} \in INS(i = 1, 2, \cdots, m)$. For $\forall x \in X$, the interval neutrosophic $[s, t]$ neighborhood of $x$ is defined as follows:

Definition 3.5.^[26] Let $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be an interval neutrosophic $[s, t]$ covering of $X$, where $C_{i} = \left\{T_{c, i} I_{c_{i}}, F_{c_{i}}\right\}$ and $C_{i} \in INS(i = 1, 2, \cdots, m)$. If $s = t = \beta$, then the interval neutrosophic $[s, t]$ neighborhood of $x$ is degraded as the interval neutrosophic $\beta$ neighborhood of $x$.

Theorem 3.6. Let $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be an interval neutrosophic $[s, t]$ covering of $X$, where $C_{i} = \left\{T_{c, i} I_{c_{i}}, F_{c_{i}}\right\}$ and $C_{i} \in INS(i = 1, 2, \cdots, m)$. $\forall x, y, z\in X$, some propositions are shown as follows:

(1) $N_{x}^{\left[s, t \right]}\left(x \right)\geq[s, t]$;

(2) if $N_{x}^{[s, t]}(y)\ge [s, t]$ and $N_{y}^{[s, t]}(z)\ge [s, t]$, then $N_{x}^{[s, t]}(z)\ge [s, t]$;

(3) ${{C}_{i}}\supseteq \bigcup\nolimits_{x\in X}{\left\{ N_{x}^{[s, t]}|{{C}_{i}}(x)\ge [s, t] \right\}, i\in \left\{ 1, 2, \cdots, m \right\} }$;

(4) if $[{{s}_{1}}, {{t}_{1}}]\le [{{s}_{2}}, {{t}_{2}}]\le [s, t]$, then $N_{x}^{[{{s}_{1}}, {{t}_{1}}]}\subseteq N_{x}^{[{{s}_{2}}, {{t}_{2}}]}$.

Proof. (1)

(2)

If $N_{x}^{\left[s, t \right]}\left(y \right)\geq[s, t]$, then $N_{x}^{[s, t]}(y) = ({{\bigcap }_{{{T}_{{{C}_{i}}}}(x)\ge [s, t], {{I}_{{{C}_{i}}}}(x)\le [1-t, 1-s], {{F}_{{{C}_{i}}}}(x)\le [1-t, 1-s]}}{{C}_{i}})(y)$ $= ({{\bigcap }_{{{C}_{i}}(x)\ge [s, t]}}{{C}_{i}})(y) = {{\wedge }_{{{C}_{i}}(x)\ge [s, t]}}{{C}_{i}}(y)\ge [s, t]$, thus ${{C}_{i}}(x)\ge [s, t]\Rightarrow {{C}_{i}}(y)\ge [s, t]$, similarly, it can be obtained that ${{C}_{i}}(y)\ge [s, t]\Rightarrow {{C}_{i}}(z)\ge [s, t]$. So ${{C}_{i}}(x)\ge [s, t]\Rightarrow {{C}_{i}}(z)\ge [s, t]$, thus $N_{x}^{[s, t]}(z) = ({{\bigcap }_{{{T}_{{{C}_{i}}}}(x)\ge [s, t], {{I}_{{{C}_{i}}}}(x)\le [1-t, 1-s], {{F}_{{{C}_{i}}}}(x)\le [1-t, 1-s]}}{{C}_{i}})(z) = ({{\bigcap }_{{{C}_{i}}(x)\ge [s, t]}}{{C}_{i}})(z) = {{\wedge }_{{{C}_{i}}(x)\ge [s, t]}}{{C}_{i}}(z)\ge [s, t]$

(3)

$N_{x}^{\left[s, t \right]} = \bigcap\{C_{i}\in C|T_{C_{i}}\left(x \right)\geq\left[s, t \right], I_{C_{i}}\left(x \right)\leq\left[1-t, 1-s \right], F_{C_{i}}\left(x \right)\leq\left[1-t, 1-s \right]\} = \left(\bigcap_{C_{i}\left(x \right)\geq\left[s, t \right]}C_{i}\right)\subseteq C_{i}$, hence for any $x\in X$, it can be obtained that $C_{i}\supseteq \bigcup_{x\in X}\{N_{x}^{\left[s, t \right]}\left(x \right)|C_{i}(x)\geq[s, t]\}, (i = 1, 2, \cdots, m)$

(4)

$\left\{ {{C}_{i}}\in C|{{T}_{{{C}_{i}}}}(x)\ge [{{s}_{1}}, {{t}_{1}}], {{I}_{{{C}_{i}}}}(x)\le [1-{{t}_{1}}, 1-{{s}_{1}}], {{F}_{{{C}_{i}}}}(x)\le [1-{{t}_{1}}, 1-{{s}_{1}}] \right\} = \left\{ {{C}_{i}}\in C|{{C}_{i}}(x)\ge [{{s}_{1}}, {{t}_{1}}] \right\}$. When $\left[s_{1}, t_{1} \right]\leq\left[s_{2}, t_{2} \right]$, it is obvious that $\left\{ {{C}_{i}}\in C|{{C}_{i}}(x)\ge [{{s}_{1}}, {{t}_{1}}] \right\}\subseteq \left\{ {{C}_{i}}\in C|{{C}_{i}}(x)\ge [{{s}_{2}}, {{t}_{2}}] \right\}$, then $\bigcap \left\{ {{C}_{i}}\in C|{{C}_{i}}(x)\ge [{{s}_{1}}, {{t}_{1}}] \right\}\subseteq \bigcap \left\{ {{C}_{i}}\in C|{{C}_{i}}(x)\ge [{{s}_{2}}, {{t}_{2}}] \right\},$, that is $N_{x}^{\left[s_{1}, t_{1} \right]}\geq N_{x}^{\left[s_{2}, t_{2} \right]}$.

Example 1. Let $X$ be a space of a points(objects), with a class of elements in $X$ denoted by $x$, $C = \{C_{1}, C_{2}, C_{3}, C_{4}\}$ 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$.

$N_{x_{1}}^{\left[0.4, 0.5 \right]} = C_{1}\cap C_{2}\cap C_{3}, N_{x_{2}}^{\left[0.4, 0.5 \right]} = C_{1}\cap C_{2}\cap C_{4}, N_{x_{3}}^{\left[0.4, 0.5 \right]} = C_{2}\cap C_{4}, N_{x_{4}}^{\left[0.4, 0.5 \right]} = C_{1}\cap C_{2}.$

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

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 = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be an interval neutrosophic $[s, t]$ covering of $X$, where $C_{i} = \left\{T_{c_i} I_{c_{i}}, F_{c_{i}}\right\}$ and $C_{i} \in INS(i = 1, 2, \cdots, m)$. Then $\left(X, C\right)$ is called a interval neutrosophic $[s, t]$ covering approximation space.

Definition 3.8. Let $\left(X, C\right)$ be an interval neutrosophic $[s, t]$ covering approximation space, for any $A\in$ INS, the lower approximation operator ${{\underline{C}}^{[s, t]}}(A)$ and the upper approximation operator ${{\overline{C}}^{[s, t]}}(A)$ of interval neutrosophic $A$ are defined as follows: ${{\underline{C}}^{[s, t]}}(A) = \left\{ {{T}_{{{\underline{C}}^{[s, t]}}(A)}}, {{I}_{{{\underline{C}}^{[s, t]}}(A)}}, {{F}_{{{\underline{C}}^{[s, t]}}(A)}} \right\}, {{\overline{C}}^{[s, t]}}(A) = \left\{ {{T}_{{{\overline{C}}^{[s, t]}}(A)}}, {{I}_{{{\overline{C}}^{[s, t]}}(A)}}, {{F}_{{{\overline{C}}^{[s, t]}}(A)}} \right\}$, where

For any $x\in X$, then $A$ is called an interval neutrosophic $[s, t]$ covering rough set, if ${{\underline{C}}^{[s, t]}}(A)\ne {{\overline{C}}^{[s, t]}}(A)$.

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

Then the lower approximation operator ${{\underline{C}}^{[0.4, 0.5]}}(A)$ and the upper approximation operator ${{\overline{C}}^{[0.4, 0.5]}}(A)$ of interval neutrosophic $A$ can be calculated by Definition 3.8.

4.   Some theorems and their proofs of interval neutrosophic covering rough sets

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

Theorem 1. (1) ${{\underline{C}}^{[s, t]}}(X) = X, {{\overline{C}}^{[s, t]}}(\emptyset) = \emptyset$;

(2) ${{\underline{C}}^{[s, t]}}({{A}^{C}}) = {{({{\overline{C}}^{[s, t]}}(A))}^{C}}, {{\overline{C}}^{[s.t]}}({{A}^{C}}) = {{({{\underline{C}}^{[s, t]}}(A))}^{C}}$;

(3) ${{\underline{C}}^{[s, t]}}(A\bigcap B) = {{\underline{C}}^{[s, t]}}(A)\bigcap {{\underline{C}}^{[s, t]}}(B), {{\overline{C}}^{[s, t]}}(A\bigcup B) = {{\overline{C}}^{[s, t]}}(A)\bigcup {{\overline{C}}^{[s, t]}}(B)$;

(4) If $A\subseteq B$, then ${{\underline{C}}^{[s, t]}}(A)\subseteq {{\underline{C}}^{[s, t]}}(B), {{\overline{C}}^{[s, t]}}(A)\subseteq {{\overline{C}}^{[s, t]}}(B)$;

(5) ${{\underline{C}}^{[s, t]}}(A\bigcup B)\supseteq {{\underline{C}}^{[s, t]}}(A)\bigcup {{\underline{C}}^{[s, t]}}(B), {{\overline{C}}^{[s, t]}}(A\bigcap B)\subseteq {{\overline{C}}^{[s, t]}}(A)\bigcap {{\overline{C}}^{[s, t]}}(B)$;

(6) If $0\le [{{s}^{'}}, {{t}^{'}}]\le [s, t]$, then ${{\underline{C}}^{[{{s}^{'}}, {{t}^{'}}]}}(A)\supseteq {{\underline{C}}^{[s, t]}}(A), {{\overline{C}}^{[{{s}^{'}}, {{t}^{'}}]}}(A)\subseteq {{\overline{C}}^{[s, t]}}(A).$

proof. (1) ${{T}_{{{\underline{C}}^{[s, t]}}(X)}} = \wedge \left\{ {{T}_{X}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [1,1]$,

${{I}_{{{\underline{C}}^{[s, t]}}(X)}} = \vee \left\{ {{I}_{X}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\} = [0, 0],$

${{F}_{{{\underline{C}}^{[s, t]}}(X)}} = \vee \left\{ {{F}_{X}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [0, 0]$,

${{\underline{C}}^{[s, t]}}(X) = \langle {{T}_{{{\underline{C}}^{[s, t]}}(X)}}, {{I}_{{{\underline{C}}^{[s, t]}}(X)}}, {{F}_{{{\underline{C}}^{[s, t]}}(X)}} \rangle = \langle [1,1], [0, 0], [0, 0] \rangle = X$;

${{T}_{{{\overline{C}}^{[s, t]}}(\emptyset)}} = \vee \left\{ {{T}_{\emptyset }}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [0, 0],$

${{I}_{{{\overline{C}}^{[s, t]}}(\emptyset)}} = \wedge \left\{ {{I}_{\emptyset }}(y)\vee {{I}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [1,1]$,

${{F}_{{{\overline{C}}^{[s, t]}}(\emptyset)}} = \wedge \left\{ {{F}_{\emptyset }}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [1,1],$

${{\overline{C}}^{[s, t]}}(\emptyset) = \langle {{T}_{{{\overline{C}}^{[s, t]}}(\emptyset)}}, {{I}_{{{\overline{C}}^{[s, t]}}(\emptyset)}}, {{F}_{{{\overline{C}}^{[s, t]}}(\emptyset)}} \rangle = \langle [0, 0], [1,1], [1,1] \rangle = \emptyset$.

(2) ${{A}^{C}} = \langle {{F}_{A}}, [1,1]-{{I}_{A}}, {{T}_{A}} \rangle$,

${{T}_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}} = \wedge \left\{ {{F}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = {{F}_{{{\overline{C}}^{[s, t]}}(A)}}$,

${{I}_{_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}}} = \vee \left\{ ([1,1]-{{I}_{A}}(y))\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}$

$= [1,1]-\wedge \left\{ {{I}_{A}}(y)\vee {{I}_{N_{x}^{[s, t]}}}(y)|y\in X \right\} = [1,1]-{{I}_{{{\overline{C}}^{[s, t]}}(A)}}$

${{F}_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}} = \vee \left\{ {{T}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = {{T}_{{{\overline{C}}^{[s, t]}}(A)}}$,

${{\underline{C}}^{[s, t]}}({{A}^{C}}) = \left\{ {{T}_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}}, {{I}_{_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}}}, {{F}_{_{{{\underline{C}}^{[s, t]}}({{A}^{C}})}}} \right\} = \left\{ {{F}_{{{\overline{C}}^{[s, t]}}(A)}}, [1,1]-{{I}_{{{\overline{C}}^{[s, t]}}(A)}}, {{T}_{{{\overline{C}}^{[s, t]}}(A)}} \right\}$

${{({{\overline{C}}^{[s, t]}}(A))}^{C}} = \left\{ {{F}_{{{\overline{C}}^{[s, t]}}(A)}}, [1,1]-{{I}_{{{\overline{C}}^{[s, t]}}(A)}}, {{T}_{{{\overline{C}}^{[s, t]}}(A)}} \right\} = {{\underline{C}}^{[s, t]}}({{A}^{C}})$.

Similarly, it can be gotten that ${{\overline{C}}^{[s.t]}}({{A}^{C}}) = {{({{\underline{C}}^{[s, t]}}(A))}^{C}}$

(3) $A\bigcap B = \left\{ {{T}_{A}}\bigcap {{T}_{B}}, {{I}_{A}}\bigcup {{I}_{B}}, {{F}_{A}}\bigcup {{F}_{B}} \right\}$,

${{T}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}} = \wedge \left\{ ({{T}_{A}}(y)\bigcap {{T}_{B}}(y))\vee {{F}_{N_{x}^{[s, t]}}}(y)|y\in X \right\}$

$= \wedge \left\{ ({{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y))\bigcap ({{T}_{B}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y))|y\in X \right\} = {{T}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcap {{T}_{{{\underline{C}}^{[s, t]}}(B)}}$,

${{I}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}} = \vee \left\{ ({{I}_{A}}(y)\bigcup {{I}_{B}}(y))\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}$

$= \vee \left\{ ({{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)))\bigcup ({{I}_{B}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)))|y\in X \right\}$ $= {{I}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcup {{I}_{{{\underline{C}}^{[s, t]}}(A)}},$

${{F}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}} = \vee \left\{ ({{F}_{A}}(y)\bigcup {{F}_{B}}(y))\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= \vee \left\{ ({{F}_{A}}(y)\wedge ({{T}_{N_{x}^{[s, t]}}}(y)))\bigcup ({{F}_{B}}(y)\wedge ({{T}_{N_{x}^{[s, t]}}}(y)))|y\in X \right\} = {{F}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcup {{F}_{{{\underline{C}}^{[s, t]}}(A)}}$,

${{\underline{C}}^{[s, t]}}(A\bigcap B) = \left\{ {{T}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}}, {{I}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}}, {{F}_{{{\underline{C}}^{[s, t]}}(A\bigcap B)}} \right\}$

$= \left\{ {{T}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcap {{T}_{{{\underline{C}}^{[s, t]}}(B)}}, {{I}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcup {{I}_{{{\underline{C}}^{[s, t]}}(A)}}, {{F}_{{{\underline{C}}^{[s, t]}}(A)}}\bigcup {{F}_{{{\underline{C}}^{[s, t]}}(A)}} \right\} = {{\underline{C}}^{[s, t]}}(A)\bigcap {{\underline{C}}^{[s, t]}}(B).$

Similarly, it can be gotten that ${{\overline{C}}^{[s, t]}}(A\bigcup B) = {{\overline{C}}^{[s, t]}}(A)\bigcup {{\overline{C}}^{[s, t]}}(B)$

(4) If $A\subseteq B$, then ${{T}_{A}}\subseteq {{T}_{B}}, {{I}_{A}}\supseteq {{I}_{B}}, {{F}_{A}}\supseteq {{F}_{B}}.$

When ${{T}_{A}}\subseteq {{T}_{B}}$, then $\left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\subseteq \left\{ {{T}_{B}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$,

thus $\wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$ $\subseteq$ $\left\{ {{T}_{B}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$

hence $\left\{ {{T}_{B}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$ $\subseteq$ $\wedge \left\{ {{T}_{B}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$ that is ${{T}_{{{\underline{C}}^{[s, t]}}(A)}}\subseteq {{T}_{{{\underline{C}}^{[s, t]}}(B)}}$.

When ${{I}_{A}}\supseteq {{I}_{B}},$ then $\left\{ {{I}_{A}}(y)\wedge (1-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}\supseteq \left\{ {{I}_{B}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}$.

Thus $\vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}\supseteq \vee \left\{ {{I}_{B}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\},$

hence ${{I}_{{{\underline{C}}^{[s, t]}}(A)}}\supseteq {{I}_{{{\underline{C}}^{[s, t]}}(A)}}$.

When ${{F}_{A}}\supseteq {{F}_{B}},$ then $\left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\supseteq \left\{ {{F}_{B}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$,

thus $\vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\supseteq \vee \left\{ {{F}_{B}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$, so ${{F}_{{{\underline{C}}^{[s, t]}}(A)}}\supseteq {{F}_{{{\underline{C}}^{[s, t]}}(A)}}, {{\underline{C}}^{[s, t]}}(A)\subseteq {{\underline{C}}^{[s, t]}}(B)$.

Similarly, it can be gotten that ${{\overline{C}}^{[s, t]}}(A)\subseteq {{\overline{C}}^{[s, t]}}(B)$.

(5) It is obvious that $A\subseteq A\bigcup B, B\subseteq A\bigcup B,$ $A\bigcap B\subseteq A, A\bigcap B\subseteq B.$

So ${{\underline{C}}^{[s, t]}}(A)\subseteq {{\underline{C}}^{[s, t]}}(A\bigcup B), {{\underline{C}}^{[s, t]}}(B)\subseteq {{\underline{C}}^{[s, t]}}(A\bigcup B),$ ${{\overline{C}}^{[s, t]}}(A\bigcap B)\subseteq {{\overline{C}}^{[s, t]}}(A),$ ${{\overline{C}}^{[s, t]}}(A\bigcap B)\subseteq {{\overline{C}}^{[s, t]}}(B).$

Hence ${{\underline{C}}^{[s, t]}}(A)\bigcup {{\underline{C}}^{[s, t]}}(B)\subseteq {{C}^{[s, t]}}(A\bigcup B),$ ${{\overline{C}}^{[s, t]}}(A\bigcap B)\subseteq {{\overline{C}}^{[s, t]}}(A)\bigcap {{\overline{C}}^{[s, t]}}(B).$

(6) If $0\le [{{s}^{'}}, {{t}^{'}}]\le [s, t]$, then $N_{x}^{[{{s}^{'}}, {{t}^{'}}]}\subseteq N_{x}^{[s, t]}.$ Thus ${{T}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}\subseteq {{T}_{N_{x}^{[s, t]}}},$ ${{I}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}\supseteq {{I}_{N_{x}^{[s, t]}}},$ ${{F}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}\supseteq {{F}_{N_{x}^{[s, t]}}},$ hence $\wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}(y) |y\in X \right\}\supseteq \wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$

$\vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}(y))|y\in X \right\}\subseteq \vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\},$

$\vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[{{s}^{'}}, {{t}^{'}}]}}}(y) |y\in X \right\}\subseteq \vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$.

That is ${{\underline{C}}^{[{{s}^{'}}, {{t}^{'}}]}}(A)\supseteq {{\underline{C}}^{[s, t]}}(A).$ Similarly, it can be gotten that ${{\overline{C}}^{[{{s}^{'}}, {{t}^{'}}]}}(A)\subseteq {{\overline{C}}^{[s, t]}}(A).$

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

(1) ${{\underline{C}}^{[s, t]}}(\emptyset) = \emptyset;$

(2) ${{\overline{C}}^{[s, t]}}(X) = X;$

(3) For any$x\in X$, $\left\{ y\in X|\forall {{C}_{i}}\in C(({{C}_{i}}(x)\ge [s, t])\Rightarrow ({{C}_{i}}(y) = X)) \right\}\ne \emptyset$.

Proof. $\left\{ y\in X|\forall {{C}_{i}}\in C(({{C}_{i}}(x)\ge [s, t])\Rightarrow ({{C}_{i}}(y) = X)) \right\}\ne \emptyset$ means for each $x\in X$ and $C_{i}\left(x\right)\geq\left[s, t\right], \exists y \in X$ such that $C_{i}\left(y\right) = X$, satisfying $N_{x}^{[s, t]}(y) = X$.

$(1)\Rightarrow (3)$ If ${{\underline{C}}^{[s, t]}}(\emptyset) = \emptyset$, then

${{\underline{C}}^{[s, t]}}(\emptyset) = \left\{ \wedge {{F}_{N_{x}^{[s, t]}}}(y), \vee ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)), \vee {{T}_{N_{x}^{[s, t]}}}(y)|y\in X \right\} = \emptyset$ $\Rightarrow \exists y\in X,$

$\wedge {{F}_{N_{x}^{[s, t]}}}(y) = [0, 0], \wedge {{I}_{N_{x}^{[s, t]}}}(y) = [0, 0], \vee {{T}_{N_{x}^{[s, t]}}}(y) = [1,1],$ that is $N_{x}^{[s, t]}(y) = X.$

$(3)\Rightarrow (2)$ If $N_{x}^{[s, t]}(y) = X,$ then

${{\overline{C}}^{[s, t]}}(X) = \left\{ \vee {{T}_{N_{x}^{[s, t]}}}(y), \wedge {{I}_{N_{x}^{[s, t]}}}(y), \wedge {{F}_{N_{x}^{[s, t]}}}(y)|y\in X \right\} = \left\{ [1,1], [0, 0], [0, 0] \right\} = X$.

$(2)\Rightarrow (1)$ It is proved by the rotation of $\underline{C}$ and $\overline{C}$. So they are equivalent.

Theorem 3. Let $(X, C)$ be an interval neutrosophic $[s, t]$ covering approximation space. $A$is an INS and $B$ is an constant interval neutrosophic set, where $B = \langle [{{\alpha }^{-}}, {{\alpha }^{+}}], [{{\beta }^{-}}, {{\beta }^{+}}], [{{\gamma }^{-}}, {{\gamma }^{+}}] \rangle$. It satisfies that for any $x\in X$, $\langle [{{\alpha }^{-}}, {{\alpha }^{+}}], [{{\beta }^{-}}, {{\beta }^{+}}], [{{\gamma }^{-}}, {{\gamma }^{+}}] \rangle (x) = \langle [{{\alpha }^{-}}, {{\alpha }^{+}}], [{{\beta }^{-}}, {{\beta }^{+}}], [{{\gamma }^{-}}, {{\gamma }^{+}}] \rangle$.

If $\left\{ y\in X|\forall {{C}_{i}}\in C(({{C}_{i}}(x)\ge [s, t])\Rightarrow ({{C}_{i}}(y) = X)) \right\}\ne \emptyset$, then

(1) ${{\underline{C}}^{[s, t]}}(B) = B, {{\overline{C}}^{[s, t]}}(B) = B;$

(2) ${{\underline{C}}^{[s, t]}}(A\bigcup B) = {{\underline{C}}^{[s, t]}}(A)\bigcup B, {{\overline{C}}^{[s, t]}}(A\bigcap B) = {{\overline{C}}^{[s, t]}}(A)\bigcap B.$

Proof. (1) $\left\{ y\in X|\forall {{C}_{i}}\in C(({{C}_{i}}(x)\ge [s, t])\Rightarrow ({{C}_{i}}(y) = X)) \right\}\ne \emptyset$ means for each $x\in X$ and ${{C}_{i}}(x)\ge [s, t]$, $\exists y\in X$, such that ${{C}_{i}}(y) = X$, then $N_{x}^{[s, t]}(y) = X$.

${{T}_{{{\underline{B}}^{[s, t]}}}} = \wedge \left\{ [{{\alpha }^{-}}, {{\alpha }^{+}}]\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [{{\alpha }^{-}}, {{\alpha }^{+}}]$,

${{I}_{{{\underline{B}}^{[s, t]}}}} = \vee \left\{ [{{\beta }^{-}}, {{\beta }^{+}}]\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\} = [{{\beta }^{-}}, {{\beta }^{+}}]$,

${{F}_{{{\underline{B}}^{[s, t]}}}} = \vee \left\{ [{{\gamma }^{-}}, {{\gamma }^{+}}]\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = [{{\gamma }^{-}}, {{\gamma }^{+}}].$

So that ${{\underline{C}}^{[s, t]}}(B) = B.$ Similarly, it can be gotten that ${{\overline{C}}^{[s, t]}}(B) = B$.

(2) ${{T}_{{{\underline{C}}^{[s, t]}}(A\bigcup B)}} = \wedge \left\{ ({{T}_{A}}(y)\bigcup [{{\alpha }^{-}}, {{\alpha }^{+}}])\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\\ = \wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\bigcup [{{\alpha }^{-}}, {{\alpha }^{+}}],$

${{I}_{{{\underline{C}}^{[s, t]}}(A\bigcup B)}} = \vee \left\{ ({{I}_{A}}(y)\bigcup [{{\beta }^{-}}, {{\beta }^{+}}])\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}$

$= \vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}\bigcup [{{\beta }^{-}}, {{\beta }^{+}}],$

${{F}_{{{\underline{C}}^{[s, t]}}(A\bigcup B)}} = \vee \left\{ ({{F}_{A}}(y)\bigcup [{{\gamma }^{-}}, {{\gamma }^{+}}])\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\bigcup [{{\gamma }^{-}}, {{\gamma }^{+}}],$

Thus ${{\underline{C}}^{[s, t]}}(A\bigcup B) = {{\underline{C}}^{[s, t]}}(A)\bigcup B.$ Similarly, it can be proofed that ${{\overline{C}}^{[s, t]}}(A\bigcap B) = {{\overline{C}}^{[s, t]}}(A)\bigcap B.$

Corollary. When ${{\alpha }^{-}} = {{\alpha }^{+}} = \alpha, {{\beta }^{-}} = {{\beta }^{+}} = \beta, {{\gamma }^{-}} = {{\gamma }^{+}} = \gamma, B = \langle \alpha, \beta, \gamma \rangle$ It can be gotten that

(1) ${{\underline{C}}^{[s, t]}}\langle \alpha, \beta, \gamma \rangle = \langle \alpha, \beta, \gamma \rangle, {{\overline{C}}^{[s, t]}}\langle \alpha, \beta, \gamma \rangle = \langle \alpha, \beta, \gamma \rangle;$

(2) ${{\underline{C}}^{[s, t]}}(A\bigcup \langle \alpha, \beta, \gamma \rangle) = {{\underline{C}}^{[s, t]}}(A)\bigcup \langle \alpha, \beta, \gamma \rangle, {{\overline{C}}^{[s, t]}}(A\bigcap \langle \alpha, \beta, \gamma \rangle = {{\overline{C}}^{[s, t]}}(A)\bigcap \langle \alpha, \beta, \gamma \rangle.$

The proof is omitted.

Theorem 4. Let $(X, C)$ be an interval neutrosophic $[s, t]$ covering approximation space. $A$is an INS and $A\in X$, for any $x\in X$, there are

(1) ${{\overline{C}}^{[s, t]}}({{1}_{y}})(x) = N_{x}^{[s, t]}(y);$

(2) ${{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})(x) = {{(N_{x}^{[s, t]}(y))}^{C}}.$

Proof. ${{T}_{{{\overline{C}}^{[s, t]}}({{1}_{y}})}}(x) = \vee \left\{ {{T}_{{{1}_{y}}}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(z) |z\in X \right\}$

$= ({{T}_{{{1}_{y}}}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y))\vee ({{\vee }_{z\in X-\{y\}}}({{T}_{{{1}_{y}}}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(z)))$

$= ([1,1]\wedge {{T}_{N_{x}^{[s, t]}}}(y))\vee ([0, 0]\wedge {{T}_{N_{x}^{[s, t]}}}(z)) = {{T}_{N_{x}^{[s, t]}}}(y),$

${{I}_{{{\overline{C}}^{[s, t]}}({{1}_{y}})}}(x) = \wedge \left\{ {{I}_{{{1}_{y}}}}(z)\vee {{I}_{N_{x}^{[s, t]}}}(z) |z\in X \right\}$

$= ({{I}_{{{1}_{y}}}}(y)\vee {{I}_{N_{x}^{[s, t]}}}(y))\wedge ({{\wedge }_{z\in X-\{y\}}}({{I}_{{{1}_{y}}}}(z)\vee {{I}_{N_{x}^{[s, t]}}}(z)))$

$= ([0, 0]\vee {{I}_{N_{x}^{[s, t]}}}(y))\wedge ([1,1]\vee {{I}_{N_{x}^{[s, t]}}}(z)) = {{I}_{N_{x}^{[s, t]}}}(y),$

${{F}_{{{\overline{C}}^{[s, t]}}({{1}_{y}})}}(x) = \wedge \left\{ {{F}_{{{1}_{y}}}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(z) |z\in X \right\}$

$= ({{F}_{{{1}_{y}}}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y))\wedge ({{\wedge }_{z\in X-\{y\}}}({{F}_{{{1}_{y}}}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(z)))$

$= ([0, 0]\vee {{F}_{N_{x}^{[s, t]}}}(y))\wedge ([1,1]\vee {{F}_{N_{x}^{[s, t]}}}(z)) = {{F}_{N_{x}^{[s, t]}}}(y).$

So ${{\overline{C}}^{[s, t]}}({{1}_{y}})(x) = N_{x}^{[s, t]}(y).$

Similarly, it can be gotten that ${{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})(x) = {{(N_{x}^{[s, t]}(y))}^{C}},$ and the proof process is omitted.

Theorem 5. Let $(X, C)$ be an interval neutrosophic $[s, t]$ covering approximation space. $A$is an INS and $A\in X$, for any $x\in X$, if $\left(N_{x}^{[s, t]}\right)^{C} \leq A \leq N_{x}^{[s, t]},$ then ${{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A))\subseteq {{\underline{C}}^{[s, t]}}(A)\subseteq A\subseteq {{\overline{C}}^{[s, t]}}(A)\subseteq {{\overline{C}}^{[s, t]}}({{\overline{C}}^{[s, t]}}(A)).$

Proof. ${{(N_{x}^{[s, t]})}^{C}} = \langle {{F}_{N_{x}^{[s, t]}}}, ([1,1]-{{I}_{N_{x}^{[s, t]}}}), {{T}_{N_{x}^{[s, t]}}} \rangle.$

When ${{(N_{x}^{[s, t]})}^{C}}\le A,$thus ${{F}_{N_{x}^{[s, t]}}}\le {{T}_{A}},$ $[1,1]-{{I}_{N_{x}^{[s, t]}}}\ge {{I}_{A}}, {{T}_{N_{x}^{[s, t]}}}\ge {{F}_{A}},$

so ${{T}_{{{\underline{C}}^{[s, t]}}(A)}} = \wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \wedge \left\{ {{T}_{A}}(y) |y\in X \right\}\le {{T}_{A}},$

${{I}_{{{\underline{C}}^{[s, t]}}(A)}} = \vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\} = \vee \left\{ {{I}_{A}}(y)|y\in X \right\}\ge {{I}_{A}},$

${{F}_{{{\underline{C}}^{[s, t]}}(A)}} = \vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \vee \left\{ {{F}_{A}}(y) |y\in X \right\}\ge {{F}_{A}}.$

That is ${{\underline{C}}^{[s, t]}}(A)\subseteq A$. Similarly, $A\subseteq {{\overline{C}}^{[s, t]}}(A)$.

According to theorem 1(4), ${{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A))\subseteq {{\underline{C}}^{[s, t]}}(A)\subseteq A\subseteq {{\overline{C}}^{[s, t]}}(A)\subseteq {{\overline{C}}^{[s, t]}}({{\overline{C}}^{[s, t]}}(A)).$

Theorem 5 gives a sufficient condition for ${{\underline{C}}^{[s, t]}}(A)\subseteq A\subseteq {{\overline{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. $A \in X,$ if $\quad \forall x \in X, C_{i}(x) \geq[s, t] \Rightarrow C_{i}(x) = X(i = \{1, 2, \cdots m\}),$ and then

$\underline{C}^{[s, t]}(A) \subseteq A \subseteq \bar{C}^{[s, t]}(A)$.

Proof. $\forall x\in X, {{C}_{i}}(x)\ge [s, t]\Rightarrow {{C}_{i}}(x) = X(i = \left\{ 1, 2, \cdots m \right\})$, which means $\forall x\in X, N_{x}^{[s, t]} = X = \langle [1,1], [0, 0], [0, 0] \rangle.$

${{T}_{{{\underline{C}}^{[s, t]}}(A)}} = \wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \wedge \left\{ {{T}_{A}}(y)\vee [0, 0]|y\in X \right\} = \wedge \left\{ {{T}_{A}}(y)|y\in X \right\}\le {{T}_{A}}$,

${{I}_{{{\underline{C}}^{[s, t]}}(A)}} = \vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\} = \vee \left\{ {{I}_{A}}(y)\wedge [1,1]|y\in X \right\} = \vee \left\{ {{I}_{A}}(y)|y\in X \right\}\ge {{I}_{A}}$,

${{F}_{{{\underline{C}}^{[s, t]}}(A)}} = \vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \vee \left\{ {{F}_{A}}(y)\wedge [1,1] |y\in X \right\} = \vee \left\{ {{F}_{A}}(y) |y\in X \right\}\ge {{F}_{A}}.$

So ${{\underline{C}}^{[s, t]}}(A)\subseteq A$.

${{T}_{{{\overline{C}}^{[s, t]}}(A)}} = \vee \left\{ {{T}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \vee \left\{ {{T}_{A}}(y) |y\in X \right\}\ge {{T}_{A}},$

${{I}_{{{\overline{C}}^{[s, t]}}(A)}} = \wedge \left\{ {{I}_{A}}(y)\vee {{I}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \wedge \left\{ {{I}_{A}}(y) |y\in X \right\}\le {{I}_{A}},$

${{F}_{{{\overline{C}}^{[s, t]}}(A)}} = \wedge \left\{ {{F}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \wedge \left\{ {{F}_{A}}(y) |y\in X \right\}\le {{F}_{A}}.$

So $A\subseteq {{\overline{C}}^{[s, t]}}(A)$.

Hence ${{\underline{C}}^{[s, t]}}(A)\subseteq A\subseteq {{\overline{C}}^{[s, t]}}(A)$.

Theorem 7. Let $C = \left\{C_{1}, C_{2}, \cdots, C_{m}\right\}$ be an interval neutrosophic $[s, t]$ covering of $X. A \in I N S, \overline{C}$ and $\underline{C}$ are the upper and lower approximation operator, which are defined in defination $3.8.$ Then we can get that:

$\begin{aligned} \text { (1) } \text { C is serial } & \Leftrightarrow \underline{C}^{[s, t]}\langle\alpha, \beta, \lambda\rangle = \langle\alpha, \beta, \lambda\rangle, \forall \alpha, \beta, \lambda \in[0, 1], \\ & \Leftrightarrow \underline{C}^{[s, t]}(\emptyset) = \emptyset, \\ & \Leftrightarrow \bar{C}^{[s, t]}\langle\alpha, \beta, \lambda\rangle = \langle\alpha, \beta, \lambda\rangle, \forall \alpha, \beta, \lambda \in[0, 1], \\ & \Leftrightarrow \bar{C}^{[s, t]}(X) = X; \end{aligned}$

$\begin{aligned}\text { (2) } C \text { is reflexive } & \Leftrightarrow \underline{C}^{[s, t]}(A) \subseteq A, \\ & \Leftrightarrow A \subseteq \bar{C}^{[s, t]}(A); \end{aligned}$

$\begin{aligned}\text { (3) } C \text { is symmetric } \Leftrightarrow & \underline{C}^{[s, t]}\left(1_{X-(y\})}\right)(x) = \underline{C}^{[s, t]}\left(1_{X-\{x\}}\right)(y), \forall x, y \in X, \\ & \Leftrightarrow \bar{C}^{[s, t]}\left(1_{y}\right)(x) = \bar{C}^{[s, t]}\left(1_{x}\right)(y), \forall x, y \in X; \end{aligned}$

$\begin{aligned}\text { (4) } C \text { is transitive } \Leftrightarrow & \underline{C}^{[s, t]}(A) \subseteq \underline{C}^{[s, t]}\left(\underline{C}^{[s, t]}(A)\right), \\ & \Leftrightarrow \bar{C}^{[s, t]}\left(\bar{C}^{[s, t]}(A)\right) \subseteq \bar{C}^{[s, t]}(A). \end{aligned}$

Proof. (1) When $C$ is serial, then it satisfies $\exists y \in X$ and $N_{x}^{[s, t]}(y) = X.$ So it can be proved by Theorem $3,$ Theorem 4 and Deduction.

(2) $\Rightarrow$ When $C$ is reflexive, then $N_{x}^{[s, t]}(x) = X = \langle[1,1], [0, 0], [0, 0]\rangle$

${{T}_{{{\underline{C}}^{[s, t]}}(A)}}(x) = \wedge \left\{ {{T}_{A}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}\le {{T}_{A}}(x)\vee {{F}_{N_{x}^{[s, t]}}}(x) = {{T}_{A}}(x),$

${{I}_{{{\underline{C}}^{[s, t]}}(A)}}(x) = \vee \left\{ {{I}_{A}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}\ge {{I}_{A}}(x)\wedge [1,1] = {{I}_{A}}(x),$

${{F}_{{{\underline{C}}^{[s, t]}}(A)}}(x) = \vee \left\{ {{F}_{A}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y)|y\in X \right\}\ge {{F}_{A}}(x)\wedge [1,1] = {{F}_{A}}(x).$

That is ${{\underline{C}}^{[s, t]}}(A)\subseteq A$.

$\Leftarrow$ If $\underline{C}^{[s, t]}(A) \subseteq A,$ let $A = 1_{X-(x)},$ and $\forall x, y \in X,$ then

${{T}_{N_{x}^{[s, t]}}}(x) = ({{T}_{N_{x}^{[s, t]}}}(x)\wedge [1,1])\vee [0, 0]$

$= ({{T}_{N_{x}^{[s, t]}}}(x)\wedge {{F}_{({{1}_{X-\{x\}}})}}(x))\vee ({{\vee }_{y\in X-\left\{ x \right\}}}({{T}_{N_{x}^{[s, t]}}}(y)\wedge {{F}_{({{1}_{X-\{x\}}})}}(y)))$

$= \vee \left\{ {{T}_{N_{x}^{[s, t]}}}(y)\wedge {{F}_{({{1}_{X-\{x\}}})}}(y)|y\in X \right\}$

$= {{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(x) \ge {{F}_{({{1}_{X-\{x\}}})}}(x) = [1,1],$

$[1,1]-{{I}_{N_{x}^{[s, t]}}}(x) = \left\{ ([1,1]-{{I}_{N_{x}^{[s, t]}}}(x))\wedge [1,1] \right\}\vee [0, 0]$

$= \left\{ ([1,1]-{{I}_{N_{x}^{[s, t]}}}(x))\wedge {{I}_{({{1}_{X-\{x\}}})}}(x) \right\}\vee \left\{ {{\vee }_{y\in X-\left\{ x \right\}}}(([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))\wedge {{I}_{({{1}_{X-\{x\}}})}}(y)) \right\}$

$= \vee \left\{ {{I}_{({{1}_{X-\{x\}}})}}(x)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}$

$= {{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(x)\ge {{I}_{({{1}_{X-\{x\}}})}}(x) = [1,1],$

so ${{I}_{N_{x}^{[s, t]}}}(x) = [0, 0].$

${{F}_{N_{x}^{[s, t]}}}(x) = \left\{ {{F}_{N_{x}^{[s, t]}}}(x))\vee [0, 0] \right\}\wedge [1,1]$

$= \left\{ {{F}_{N_{x}^{[s, t]}}}(x)\vee {{T}_{({{1}_{X-\{x\}}})}}(x) \right\}\wedge \left\{ {{\wedge }_{y\in X-\left\{ x \right\}}}({{F}_{N_{x}^{[s, t]}}}(y)\vee {{T}_{({{1}_{X-\{x\}}})}}(y)) \right\}$

$= \wedge \left\{ {{T}_{({{1}_{X-\{x\}}})}}(x)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= {{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(x)\le {{T}_{({{1}_{X-\{x\}}})}}(x) = [0, 0].$

That is $N_{x}^{[s, t]}(x) = \langle[1,1], [0, 0], [0, 0]\rangle = X.$ So $C$ is reflexive. Meanwhile, it is easy to prove the other part by the same way.

(3) ${{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = \wedge \left\{ {{T}_{({{1}_{X-\{x\}}})}}(z)\vee {{F}_{N_{y}^{[s, t]}}}(z) |z\in X \right\}$

$= \left\{ {{F}_{N_{y}^{[s, t]}}}(x)\vee {{T}_{({{1}_{X-\{x\}}})}}(x) \right\}\wedge \left\{ {{\wedge }_{z\in X-\left\{ x \right\}}}({{F}_{N_{y}^{[s, t]}}}(z)\vee {{T}_{({{1}_{X-\{x\}}})}}(z)) \right\}$

$= \left\{ {{F}_{N_{y}^{[s, t]}}}(x)\vee [0, 0] \right\}\wedge [1,1] \\ $ $= {{F}_{N_{y}^{[s, t]}}}(x), \\ $ ${{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x) = \wedge \left\{ {{T}_{({{1}_{X-\{y\}}})}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(z) |z\in X \right\}$

$= \left\{ {{F}_{N_{x}^{[s, t]}}}(y)\vee {{T}_{({{1}_{X-\{y\}}})}}(y) \right\}\wedge \left\{ {{\wedge }_{z\in X-\left\{ y \right\}}}({{F}_{N_{x}^{[s, t]}}}(z)\vee {{T}_{({{1}_{X-\{y\}}})}}(z)) \right\}$

$= \left\{ {{F}_{N_{x}^{[s, t]}}}(y)\vee [0, 0] \right\}\wedge [1,1]$

$= {{F}_{N_{x}^{[s, t]}}}(y),$

${{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = \vee \left\{ {{I}_{({{1}_{X-\{x\}}})}}(z)\wedge ([1,1]-{{I}_{N_{y}^{[s, t]}}}(z)) |z\in X \right\}$

$= \left\{ ([1,1]-{{I}_{N_{y}^{[s, t]}}}(x))\wedge {{I}_{({{1}_{X-\{x\}}})}}(x) \right\}\vee \left\{ {{\vee }_{z\in X-\left\{ x \right\}}}(([1,1]-{{I}_{N_{y}^{[s, t]}}}(z))\wedge {{I}_{({{1}_{X-\{x\}}})}}(z)) \right\}$

$= \left\{ ([1,1]-{{I}_{N_{y}^{[s, t]}}}(x))\wedge [1,1] \right\}\vee [0, 0]$

$= [1,1]-{{I}_{N_{y}^{[s, t]}}}(x),$

${{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x) = \vee \left\{ {{I}_{({{1}_{X-\{y\}}})}}(z)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(z)) |z\in X \right\}$

$= \left\{ ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))\wedge {{I}_{({{1}_{X-\{y\}}})}}(y) \right\}\vee \left\{ {{\vee }_{z\in X-\left\{ y \right\}}}(([1,1]-{{I}_{N_{x}^{[s, t]}}}(z))\wedge {{I}_{({{1}_{X-\{y\}}})}}(z)) \right\}$

$= \left\{ ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y))\wedge [1,1] \right\}\vee [0, 0]$

$= [1,1]-{{I}_{N_{x}^{[s, t]}}}(y),$

${{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = \vee \left\{ {{F}_{({{1}_{X-\{x\}}})}}(z)\wedge {{T}_{N_{y}^{[s, t]}}}(z) |z\in X \right\}$

$= \left\{ {{T}_{N_{y}^{[s, t]}}}(x)\wedge {{F}_{({{1}_{X-\{x\}}})}}(x) \right\}\vee \left\{ {{\vee }_{z\in X-\left\{ x \right\}}}({{T}_{N_{y}^{[s, t]}}}(z)\wedge {{F}_{({{1}_{X-\{x\}}})}}(z)) \right\}$

$= \left\{ {{T}_{N_{y}^{[s, t]}}}(x)\wedge [1,1] \right\}\vee [0, 0]$

$= {{T}_{N_{y}^{[s, t]}}}(x),$

${{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x) = \vee \left\{ {{F}_{({{1}_{X-\{y\}}})}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(z) |z\in X \right\}$

$= \left\{ {{T}_{N_{x}^{[s, t]}}}(y)\wedge {{F}_{({{1}_{X-\{y\}}})}}(y) \right\}\vee \left\{ {{\vee }_{z\in X-\left\{ y \right\}}}({{T}_{N_{x}^{[s, t]}}}(z)\wedge {{F}_{({{1}_{X-\{y\}}})}}(z)) \right\}$

$= \left\{ {{T}_{N_{x}^{[s, t]}}}(y)\wedge [1,1] \right\}\vee [0, 0]$

$= {{T}_{N_{x}^{[s, t]}}}(y).$

So when is symmetric, it satisfies ${{T}_{N_{x}^{[s, t]}}}(y) = {{T}_{N_{y}^{[s, t]}}}(x), {{I}_{N_{x}^{[s, t]}}}(y) = {{I}_{N_{y}^{[s, t]}}}(x),$ ${{F}_{N_{x}^{[s, t]}}}(y) = {{F}_{N_{y}^{[s, t]}}}(x),$ that is $N_{x}^{[s, t]}(y) = N_{y}^{[s, t]}(x),$ then

${{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = {{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x),$

${{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = {{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x), \\{{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})}}(y) = {{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})}}(x)$

That is ${{\underline{C}}^{[s, t]}}({{1}_{X-\{x\}}})(y) = {{\underline{C}}^{[s, t]}}({{1}_{X-\{y\}}})(x).$

It is similar to get ${{\overline{C}}^{[s, t]}}({{1}_{y}})(x) = {{\overline{C}}^{[s, t]}}({{1}_{x}})(y),$ and the proof is omitted.

(4) $\Rightarrow$ If $C$ is transitive, then $\vee\left\{T_{N_{x}^{[s, t]}}(y) \wedge T_{N_{y}^{[s, t]}}(z) | y \in X\right\} \leq T_{N_{x}^{[s, t]}}(z)$,

$\wedge\left\{I_{N_{x}^{[s, t]}}(y) \vee I_{N_{y}^{[s, t]}}(z) | y \in X\right\} \geq I_{N_{x}^{[s, t]}}(z)$, $\wedge\left\{F_{N_{x}^{[s, t]}}(y) \vee F_{N_{y}^{[s, t]}}(z) | y \in X\right\} \geq F_{N_{x}^{[s, t]}}(z)$.

${{T}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A))}}(x) = \wedge \left\{ {{T}_{{{\underline{C}}^{[s, t]}}(A)}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \wedge \left\{ \wedge \left\{ {{T}_{A}}(z)\vee {{F}_{N_{y}^{[s, t]}}}(z) |z\in X \right\}\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= {{\wedge }_{y\in X}}{{\wedge }_{z\in X}}({{T}_{A}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(y)) = {{\wedge }_{z\in X}}({{\wedge }_{y\in X}}({{F}_{N_{y}^{[s, t]}}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(y))\vee {{T}_{A}}(z))$

$\ge {{\wedge }_{z\in X}}({{F}_{N_{x}^{[s, t]}}}(z)\vee {{T}_{A}}(z)) = {{T}_{{{\underline{C}}^{[s, t]}}(A)}}(x),$

${{I}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A))}}(x) = \vee \left\{ {{I}_{{{\underline{C}}^{[s, t]}}(A)}}(z)\wedge (1-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}$

$= \vee \left\{ \vee \left\{ {{I}_{A}}(z)\wedge (1-{{I}_{N_{y}^{[s, t]}}}(z))|z\in X \right\}\wedge (1-{{I}_{N_{x}^{[s, t]}}}(y))|y\in X \right\}$

$= {{\vee }_{y\in X}}{{\vee }_{z\in X}}({{I}_{A}}(z)\wedge (1-{{I}_{N_{y}^{[s, t]}}}(z))\wedge (1-{{I}_{N_{x}^{[s, t]}}}(y)) = {{\vee }_{z\in X}}((1-{{\wedge }_{y\in X}}({{I}_{N_{y}^{[s, t]}}}(z)\vee {{I}_{N_{x}^{[s, t]}}}(y))\wedge {{I}_{A}}(z)$

$\le {{\vee }_{z\in X}}(1-{{I}_{N_{x}^{[s, t]}}}(z))\wedge {{I}_{A}}(z) = {{I}_{{{\underline{C}}^{[s, t]}}(A)}}(x),$

${{F}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A))}}(x) = \vee \left\{ {{F}_{{{\underline{C}}^{[s, t]}}(A)}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\} = \vee \left\{ \vee \left\{ {{F}_{A}}(z)\wedge {{T}_{N_{y}^{[s, t]}}}(z) |z\in X \right\}\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= {{\vee }_{y\in X}}{{\vee }_{z\in X}}({{F}_{A}}(z)\wedge {{T}_{N_{y}^{[s, t]}}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(y)) = {{\vee }_{z\in X}}({{\vee }_{y\in X}}({{T}_{N_{y}^{[s, t]}}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(y)))\wedge {{F}_{A}}(z)$

$\le {{\vee }_{z\in X}}({{T}_{N_{x}^{[s, t]}}}(z)\wedge {{F}_{A}}(z)) = {{F}_{{{\underline{C}}^{[s, t]}}(A)}}(x),$

so ${{\underline{C}}^{[s, t]}}(A)\subseteq {{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}(A)).$

Similarly, it can be gotten that ${{\overline{C}}^{[s, t]}}({{\overline{C}}^{[s, t]}}(A))\subseteq {{\overline{C}}^{[s, t]}}(A).$ $\Leftarrow$ If $\underline{C}^{[s, t]}(A)\subseteq\underline{C}^{[s, t]}\left(\underline{C}^{[s, t]}(A)\right)$, let $A = 1_{X-\{x\}}$ and $\forall x, y, z\in X$, \\ from the proving process of (3), we have

${{T}_{N_{x}^{[s, t]}}}(z) = {{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)\ge {{F}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)$ $= \vee \left\{ {{F}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(y)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= \vee \left\{ {{T}_{N_{y}^{[s, t]}}}(z)\wedge {{T}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$

$[1,1]-{{I}_{N_{x}^{[s, t]}}}(z) = {{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)\ge {{I}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)$ $\vee \left\{ {{I}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(y)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)) |y\in X \right\}$

$= \vee \left\{ ([1,1]-{{I}_{N_{y}^{[s, t]}}}(z)\wedge ([1,1]-{{I}_{N_{x}^{[s, t]}}}(y)|y\in X \right\},$

Thus ${{I}_{N_{x}^{[s, t]}}}(z)\le \wedge \left\{ {{I}_{N_{y}^{[s, t]}}}(z)\vee {{I}_{N_{x}^{[s, t]}}}(y)|y\in X \right\}.$

${{F}_{N_{x}^{[s, t]}}}(z) = {{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)\le {{T}_{{{\underline{C}}^{[s, t]}}({{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(x)$ $= \wedge \left\{ {{T}_{{{\underline{C}}^{[s, t]}}({{1}_{X-\{z\}}})}}(y)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\}$

$= \wedge \left\{ {{F}_{N_{y}^{[s, t]}}}(z)\vee {{F}_{N_{x}^{[s, t]}}}(y) |y\in X \right\},$

Therefore $C$ is transitive. When ${{\overline{C}}^{[s, t]}}({{\overline{C}}^{[s, t]}}(A))\subseteq {{\overline{C}}^{[s, t]}}(A),$ it can be proved $C$ is transitive by the same way.

5.   Application of interval neutrosophic covering rough sets

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

Let $[s, t]$ be the evaluation range. For each drug${{x}_{j}}\in X$, if there is at least one symptom ${{y}_{i}}\in V$ that causes the effective value of drug ${{x}_{j}}$ for the treatment of symptom ${{y}_{i}}$ to be in the $[s, t]$ interval, then$C = \left\{ {{C}_{i}}:i = 1, 2, \cdots, m \right\}$ is the interval neutrosophic $[s, t]$ covering on $X$. Thus, for each drug ${{x}_{j}}$, we consider the set of symptoms $\left\{ {{y}_{i}}:{{C}_{i}}({{x}_{j}})\ge [s, t] \right\}$.

The interval neutrosophic $[s, t]$ neighborhood of ${{x}_{j}}$ is $N_{x_{j}}^{\left[s, t \right]} = \bigcap\{C_{i}\in C|T_{C_{i}}\left(x_{j} \right)\geq\left[s, t \right], I_{C_{i}}\left(x_{j} \right)\leq\left[1-t, 1-s \right], F_{C_{i}}\left(x_{j} \right)\leq\left[1-t, 1-s \right]\}(x_{k}) = \left(\bigcap_{C_{i}\left(x \right)\geq\left[s, t \right]}C_{i}\right)\subseteq C_{i}(x_{k}, k = 1, 2, \ldots, n.$ This represents the effective value interval for each drug${{x}_{k}}$ for all symptoms in the symptom set $\left\{ {{y}_{i}}:{{C}_{i}}({{x}_{j}})\ge [s, t] \right\}$. 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 $A$is imprecise, we consider the approximation of $A$, that is, the lower approximation and the upper approximation of interval neutrosophic covering rough.

Example 3. Let$X$ 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_{{{x}_{1}}}^{[0.4, 0.5]} = {{C}_{1}}\bigcap {{C}_{2}}\bigcap {{C}_{3}}, N_{{{x}_{2}}}^{[0.4, 0.5]} = {{C}_{1}}\bigcap {{C}_{4}}, N_{{{x}_{3}}}^{[0.4, 0.5]} = {{C}_{2}}\bigcap {{C}_{4}}, N_{{{x}_{4}}}^{[0.4, 0.5]} = {{C}_{2}}\bigcap {{C}_{3}}$. The interval neutrosophic $[s, t]$neighborhood of ${{x}_{i}}(i = 1, 2, 3, 4)$ is shown in Table 4. Obviously, the interval neutrosophic$[s, t]$neighborhood of ${{x}_{i}}(i = 1, 2, 3, 4)$ is covering of $X$.

Let $A$ be an interval neutrosophic set, and

$A({{x}_{1}}) = \langle [0.2, 0.4], [0.2, 0.4], [0.3, 0.4] \rangle, A({{x}_{2}}) = \langle [0.5, 0.7], [0.1, 0.3], [0.2, 0.4] \rangle, \\ A({{x}_{3}}) = \langle [0.3, 0.4], [0.2, 0.5], [0.3, 0.5] \rangle, A({{x}_{4}}) = \langle [0.5, 0.6], [0.2, 0.4], [0.4, 0.6] \rangle.$

The lower approximation operator ${{\underline{C}}^{[0.4, 0.5]}}(A)$ and the upper approximation operator ${{\overline{C}}^{[0.4, 0.5]}}(A)$ of the intelligent set $A$ in the interval can be obtained by definition 3.9.

${{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{1}}) = \langle [0.4, 0.5], [0.2, 0.5], [0.4, 0.6] \rangle, {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{2}}) = \langle [0.4, 0.5], [0.2, 0.5], [0.3, 0.5] \rangle, \\ {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{3}}) = \langle [0.3, 0.5], [0.2, 0.5], [0.3, 0.5] \rangle, {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{4}}) = \langle [0.3, 0.5], [0.2, 0.5], [0.4, 0.6] \rangle. \\ {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{1}}) = \langle [0.5, 0.6], [0.2, 0.4], [0.4, 0.5] \rangle, {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{2}}) = \langle [0.5, 0.7], [0.2, 0.3], [0.4, 0.5] \rangle, \\ {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{3}}) = \langle [0.3, 0.5], [0.2, 0.3], [0.3, 0.5] \rangle, {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{4}}) = \langle [0.5, 0.6], [0.2, 0.4], [0.3, 0.5] \rangle.$

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

And we can get that

(1) $A({{x}_{2}})\ge [0.4.0.5], {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{2}})\ge [0.4.0.5], {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{2}})\ge [0.4.0.5]$. Therefore, drug ${{x}_{2}}$plays an important role in the treatment of disease$A$.

(2) $A({{x}_{3}}) < [0.4.0.5], {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{3}}) < [0.4.0.5], {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{3}}) < [0.4.0.5]$. So drug ${{x}_{3}}$ has no effect on the treatment of disease$A$.

(3) $A({{x}_{1}}) < [0.4.0.5], {{\underline{C}}^{[0.4, 0.5]}}(A)({{x}_{1}})\ge [0.4.0.5], {{\overline{C}}^{[0.4, 0.5]}}(A)({{x}_{1}})\ge [0.4.0.5]$. Therefore, drug ${{x}_{1}}$ has less effect on the treatment of disease $A$ than drug ${{x}_{2}}$ and drug ${{x}_{4}}$.

6.   Conclusions

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.

Acknowledgments

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).

Conflict of interest

The authors declare that there is no conflict of interest.