Study on the Algebraic Structure of Refined Neutrosophic Numbers

Abstract

This paper aims to explore the algebra structure of refined neutrosophic numbers. Firstly, the algebra structure of neutrosophic quadruple numbers on a general field is studied. Secondly, The addition operator ⊕ and multiplication operator ⊗ on refined neutrosophic numbers are proposed and the algebra structure is discussed. We reveal that the set of neutrosophic refined numbers with an additive operation is an abelian group and the set of neutrosophic refined numbers with a multiplication operation is a neutrosophic extended triplet group. Moreover, algorithms for solving the neutral element and opposite elements of each refined neutrosophic number are given.

1. Introduction

The notion of neutrosophic set was proposed by F. Smarandache [1], which is an extension of fuzzy set and in order to solve real-world problems. A neutrosophic set has three membership functions, and each membership degree is a real standard or non-standard subset of the nonstandard unit interval $]0^{-},1^{+}[=0^{-}\cup [0,1]\cup 1^{+}$.

In recent years, the idea of neutrosophic set has been applicable in related algebraic structures. Among these algebraic structures, Smarandache and Ali [2] proposed the algebraic system neutrosophic triplet group (NTG), which is an extension of the classical group but the neutral element is different from the classical algebraic unit element. To regard the unit element as a special neutral element, the neutrosophic extended triplet group (NETG) has been proposed [3,4] and the classical group is regarded as a special case of a NETG. Moreover, some research papers have carried out in-depth research based on NTG (NETG). For example, the inclusion relations of neutrosophic sets [5], neutrosophic triplet coset [6], neutrosophic duplet semi-groups [7], generalized neutrosophic extended triplet group [8], AG-neutrosophic extended triplet loops [9,10], the neutrosophic set theory to pseudo-BCI algebras [11], neutrosophic triplet ring and a neutrosophic triplet field [12,13], neutrosophic triplet normed space [14], neutrosophic soft sets [15], neutrosophic vector spaces [16] and so on have been studied.

As an example of NETG, Ma [8] revealed that for each $n\in Z^{+},n\ge 2,(Z_n,\otimes )$ is a commutative NETG if and only if the factorization of n is a product of single factors. As another example, Ma [17] showed that the set of neutrosophic quadruple numbers with a multiplication operation is a NETG. The concept of neutrosophic numbers of the form $a+bI$, where I is the indeterminacy with $I^n=I$, and, a and are real or complex numbers. If I into many types of indeterminacies $I_1,I_2,\cdots ,I_q$, in [18], Smarandache extended the neutrosophic numbers $a+bI$ into refined neutrosophic numbers of the form $a+b_1{I}_1+b_2{I}_2+\cdots +b_n{I}_n$, where $a,b_1,b_2,\cdots ,b_n$ are real or complex numbers and considered the refined neutrosophic set based on these refined neutrosophic numbers. The notion of neutrosophic quadruple number, which has form: $NQ=a+bT+cI+dF$ where $a,b,c,d$ are real (or complex) numbers; and T is the truth/membership/probability; I is the indeterminacy; and F is the false/membership/improbability are called Neutrosophic Quadruple (Real, respectively, Complex) Numbers. “a” is called the known part of $NQ$, while $bT+cI+dF$ is called the unknown part of $NQ$. Similar to refined neutrosophic numbers, if T can be split into many types of truths, $T_1,T_2,\cdots ,T_p$, I into many types of indeterminacies, $I_1,I_2,\cdots ,I_r$, and F into many types of falsities, $F_1,F_2,\cdots ,F_r$, we can get the refined neutrosophic quadruple numbers. We know that the set of neutrosophic quadruple numbers with a multiplication operation is a NETG. In this paper, we explore the algebra structure of refined neutrosophic numbers (refined neutrosophic quadruple numbers) and give new examples of NETG. In fact, the solving method of the neutral element and opposite elements for each refined neutrosophic number is different from the solving method for each neutrosophic quadruple number.

The paper is organized as follows. Section 2 gives the basic concepts. In Section 3, we show that the set of neutrosophic quadruple numbers on the general field with a multiplication operation also consists of a NETG. In Section 4, the algebra structure of refined neutrosophic numbers and refined neutrosophic quadruple numbers are studied. Finally, the summary and future work is presented in Section 5.

2. Basic Concepts

In this section, we provide the related basic definitions and properties of NETG, neutrosophic quadruple numbers, and refined neutrosophic numbers (for details, see [3,4,18,19,20]).

Definition 1

([3,4]). Let N be a non-empty set together with a binary operation *. Then, N is called a neutrosophic extended triplet set if, for any $a\in N$, there exists a neutral of “a” (denote by $neut\left(a\right)$), and an opposite of “a”(denote by $anti\left(a\right))$, such that $neut\left(a\right)\in N$, $anti\left(a\right)\in N$ and:

$$a\ast neut\left(a\right)=neut\left(a\right)\ast a=a,a\ast anti\left(a\right)=anti\left(a\right)\ast a=neut\left(a\right).$$

The triplet $(a,neut(a),anti(a\left)\right)$ is called a neutrosophic extended triplet.

Definition 2

([3,4]). Let $(N,\ast )$ be a neutrosophic extended triplet set. Then, N is called a neutrosophic extended triplet group (NETG), if the following conditions are satisfied:

(1) 

$(N,\ast )$ is well-defined, i.e., for any $a,b\in N$, one has $a\ast b\in N$.

(2) 

$(N,\ast )$ is associative, i.e., $(a\ast b)\ast c=a\ast (b\ast c)$ for all $a,b,c\in N$.

A NETG N is called a commutative NETG if for all $a,b\in N,a\ast b=b\ast a$.

Proposition 1

([4]). $(N,\ast )$ be a NETG. We have:

(1) 

$neut\left(a\right)$ is unique for any $a\in N$.

(2) 

$neut\left(a\right)\ast neut\left(a\right)=neut\left(a\right)$ for any $a\in N$.

(3) 

$neut\left(neut\right(a\left)\right)=neut\left(a\right)$ for any $a\in N$.

Definition 3

([18,19]). A neutrosophic number is a number of the form $(a,bI)$, where I is the indeterminacy with $I^2=I$, and a and b are real or complex numbers. A refined neutrosophic number is a number of the form $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)$, where $I_1,I_2,\cdots ,I_n$ are different types of indeterminacies, and $a_0,a_1,a_2,\cdots ,a_n$ are real or complex numbers. The set $NN$ defined by

$$NN=\left\{\right(a,bI\left)\right|a,b\in \mathbb{R}\mathrm{or}\mathbb{C}\}.$$

(1)

is called a neutrosophic set of neutrosophic numbers. The set $RNN$ defined by

$$RNN=\left\{(a_0,a{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)\right|a_0,a_1,a_2,\cdots ,a_n\in \mathbb{R}\mathrm{or}\mathbb{C}\}.$$

(2)

is called a neutrosophic set of refined neutrosophic numbers.

Definition 4

([18,20]). A neutrosophic quadruple number is a number of the form $(a,bT,cI,dF)$, where $T,I$ and F have their usual neutrosophic logic meanings, i.e., truth, indeterminacy and false, respectively, and $a,b,c,d\in \mathbb{R}$ or $\mathbb{C}$. The set $NQ$ defined by

$$NQ=\left\{\right(a,bT,cI,dF\left)\right|a,b,c,d\in \mathbb{R}\mathrm{or}\mathbb{C}\}.$$

(3)

is called a neutrosophic set of quadruple numbers. For a neutrosophic quadruple number $(a,bT,cI,dF)$, a is called the known part and $(bT,cI,dF)$ is called the unknown part. The set $RNQ$ defined by

$$\begin{array}{cc}RNQ=\hfill & \left\{(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)\right|\hfill \\ & a,b_1,b_2,\cdots ,b_p,c_1,c_2,\cdots ,c_q,d_1,d_2,\cdots ,d_r\in \mathbb{R}\mathrm{or}\mathbb{C}\}.\hfill \end{array}$$

(4)

is called a neutrosophic set of refined neutrosophic quadruple numbers.

Definition 5

([18,20]). Let N be a set, endowed with a total order $a\prec b$, named “a prevailed by b”, “a less stronger than b” or “a less preferred than b”. We consider $a⪯b$ as “a prevailed by or equal to b”, “a less stronger than or equal to b”, or “a less preferred than or equal to b”.

For any elements $a,b\in N$, with $a⪯b$, one has the absorbance law:

$$a·b=b·a=\mathrm{absorb}(a,b)=max(a,b)=b.$$

(5)

which means that the bigger element absorbs the smaller element. Clearly,

$$a·a=a^2=\mathrm{absorb}(a,a)=max(a,a)=a.$$

(6)

and

$$a_1·a_2\cdots a_n=max(a_1,a_2,\cdots ,a_n).$$

(7)

Analogously, we say that “$a\succ b$” and we read: “a prevails to b”, “a is stronger than b” or “a is preferred to b”. In addition, $a⪰b$, and we read: “a prevails or is equal to b”, “a is stronger than or equal to b”, or “a is preferred or equal to b”.

Definition 6

([18,20]). Consider the set $\{T,I,F\}$. Suppose in an optimistic way we consider the prevalence order $T\succ I\succ F$. Then, we have: $TI=IT=max(T,I)=T,$ $TF=FT=max(T,F)=T,$ $IF=FI=max(I,F)=I,$ $TT=T^2=T,$ $II=I^2=I,$ $FF=F^2=F$.

Analogously, suppose in a pessimistic way we consider the prevalence order $T\prec I\prec F$. Then, we have: $TI=IT=max(T,I)=I,$ $TF=FT=max(T,F)=F,$ $IF=FI=max(I,F)=F,$ $TT=T^2=T,$ $II=I^2=I,$ $FF=F^2=F$.

Definition 7

([18,20]). Let $a=(a_1,a_{2}T,a_{3}I,a_{4}F),b=(b_1,b_{2}T,b_{3}I,b_{4}F)\in NQ$. Suppose, in an pessimistic way, the neutrosophic expert considers the prevalence order $T\prec I\prec F$. Then, the multiplication operation is defined as follows:

$$\begin{array}{cc}a\ast b=\hfill & (a_1,a_{2}T,a_{3}I,a_{4}F)\ast (b_1,b_{2}T,b_{3}I,b_{4}F)\hfill \\ & =(a_1{b}_1,(a_1{b}_2+a_2{b}_1+a_2{b}_2)T,(a_1{b}_3+a_2{b}_3+a_3{b}_1+a_3{b}_2+a_3{b}_3)I,\hfill \\ & (a_1{b}_4+a_2{b}_4+a_3{b}_4+a_4{b}_1+a_4{b}_2+a_4{b}_3+a_4{b}_4)F).\hfill \end{array}$$

(8)

Suppose in an optimistic way the neutrosophic expert considers the prevalence order $T\succ I\succ F$. Then,

$$\begin{array}{cc}a★b=\hfill & (a_1,a_{2}T,a_{3}I,a_{4}F)★(b_1,b_{2}T,b_{3}I,b_{4}F)\hfill \\ & =(a_1{b}_1,(a_1{b}_2+a_2{b}_1+a_2{b}_2+a_3{b}_2+a_4{b}_2+a_2{b}_3+a_2{b}_4)T,\hfill \\ & (a_1{b}_3+a_3{b}_1+a_3{b}_3+a_3{b}_4+a_4{b}_3)I,(a_1{b}_4+a_4{b}_1+a_4{b}_4)F).\hfill \end{array}$$

(9)

Proposition 2

([18,20]). Let $NQ=\left\{\right(a,bT,cI,dF):a,b,c,d\in \mathbb{R}\mathrm{or}\mathbb{C}\}$. We have:

(1) 

$(NQ,\ast )$ is a commutative monoid.

(2) 

$(NQ,★)$ is a commutative monoid.

Theorem 1.

[17] For the algebra system $(NQ,\ast )$(or $(NQ,★)$), for every element $a\in NQ$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, which means that the algebra system $(NQ,\ast )$ (or $(NQ,★)$) is a NETG.

3. The Algebra Structure of Neutrosophic Quadruple Numbers on General Field

From the above section, we can see that the neutrosophic quadruple numbers are defined on number field $\mathbb{R}$ or $\mathbb{C}$. In this section, the notions of the neutrosophic quadruple numbers on a general field are introduced and the algebra structure of the neutrosophic quadruple numbers on general field is explored.

Let $(\mathbb{F},+,·)$ be a field, and 0 and 1 are the unit elements for operator + and ·, respectively. For every $a\in \mathbb{F}$, $-a$ is the inverse element of a for operator +, and $a^{-1}$ is the inverse element of a for operator ·. In the following, field $(\mathbb{F},+,·)$ is denoted by $\mathbb{F}$ for short and $a·b$ is denoted by $ab$.

Definition 8.

Let $\mathbb{F}$ be a field; a neutrosophic quadruple number is a number of the form $(a,bT,cI,dF)$, where $T,I,F$ have their usual neutrosophic logic meanings, i.e., truth, indeterminacy and false, respectively, and $a,b,c,d\in \mathbb{F}$. The set $NQF$ defined by

$$NQF=\left\{\right(a,bT,cI,dF\left)\right|a,b,c,d\in \mathbb{F}\}.$$

(10)

is called a neutrosophic set of quadruple numbers on field $\mathbb{F}$.

Definition 9.

Let $a=(a_1,a_{2}T,a_{3}I,a_{4}F),b=(b_1,b_{2}T,b_{3}I,b_{4}F)\in NQF$, then the addition operator is defined as follows:

$$a\oplus b=(a_1+b_1,(a_2+b_2)T,(a_3+b_3)I,(a_4+b_4)F).$$

(11)

Definition 10.

Let $a=(a_1,a_{2}T,a_{3}I,a_{4}F),b=(b_1,b_{2}T,b_{3}I,b_{4}F)\in NQF$. Suppose, in an pessimistic way, the neutrosophic expert considers the prevalence order $T\prec I\prec F$. Then, the multiplication operation is defined as follows:

$$\begin{array}{cc}a\ast b=\hfill & (a_1,a_{2}T,a_{3}I,a_{4}F)\ast (b_1,b_{2}T,b_{3}I,b_{4}F)\hfill \\ & =(a_1{b}_1,(a_1{b}_2+a_2{b}_1+a_2{b}_2)T,(a_1{b}_3+a_2{b}_3+a_3{b}_1+a_3{b}_2+a_3{b}_3)I,\hfill \\ & (a_1{b}_4+a_2{b}_4+a_3{b}_4+a_4{b}_1+a_4{b}_2+a_4{b}_3+a_4{b}_4)F).\hfill \end{array}$$

(12)

Suppose in an optimistic way the neutrosophic expert considers the prevalence order $T\succ I\succ F$. Then,

$$\begin{array}{cc}a★b=\hfill & (a_1,a_{2}T,a_{3}I,a_{4}F)★(b_1,b_{2}T,b_{3}I,b_{4}F)\hfill \\ & =(a_1{b}_1,(a_1{b}_2+a_2{b}_1+a_2{b}_2+a_3{b}_2+a_4{b}_2+a_2{b}_3+a_2{b}_4)T,\hfill \\ & (a_1{b}_3+a_3{b}_1+a_3{b}_3+a_3{b}_4+a_4{b}_3)I,(a_1{b}_4+a_4{b}_1+a_4{b}_4)F).\hfill \end{array}$$

(13)

Theorem 2.

$(NQF,\oplus )$ is an abelian group.

Proof. 

It is obvious. □

Theorem 3.

For the algebra system $(NQF,\ast )$ (or $(NQF,★)$), for every element $a\in NQF$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, thus the algebra system $(NQF,\ast )$ (or $(NQF,★)$) is a NETG.

The proof’s method is similar to the proof when $\mathbb{F}=\mathbb{R}$ in [17]. The detailed proof is omitted. For algebra system $(NQF,\ast )$, Table 1 gives all the subsets which have the same neutral element, and the corresponding neutral element and opposite elements. In the following, from two examples, we show that how to solve the the neutral element and opposite elements of each element for algebra system $(NQF,\ast )$ on different fields.

Table 1. The corresponding neutral element and opposite elements for $(NQF,\ast )$.

The Subset of $\mathit{NQF}$	Neutral Element	Opposite Elements $({\mathit{c}}_1,{\mathit{c}}_2\mathit{T},{\mathit{c}}_3\mathit{I},{\mathit{c}}_4\mathit{F})$
$\left\{\right(0,0,0,0\left)\right\}$	$(0,0,0,0)$	$c_i\in \mathbb{F}$
$\left\{(0,0,0,a_{4}F)\right|a_4\ne 0\}$	$(0,0,0,F)$	$c_1+c_2+c_3+c_4=a_4^{-1}$
$\left\{(0,0,a_{3}I,-a_{3}F)\right|a_3\ne 0\}$	$(0,0,I,-F)$	$c_1+c_2+c_3=a_3^{-1},c_4\in \mathbb{F}$
$\left\{(0,0,a_{3}I,a_{4}F)\right|a_3\ne 0,a_3+a_4\ne 0\}$	$(0,0,I,0)$	$c_1+c_2+c_3=a_3^{-1},c_4=-(a_4{a}_3^{-1}{(a_3+a_4)}^{-1})$
$\left\{(0,a_{2}T,-a_{2}I,0)\right|a_2\ne 0$ }	$(0,T,-I,0)\}$	$c_1+c_2=a_2^{-1},c_3,c_4\in \mathbb{F}$
$\left\{(0,a_{2}T,-a_{2}I,a_{4}F)\right|a_2\ne 0,a_4\ne 0\}$	$(0,T,-I,F)$	$c_1+c_2=a_2^{-1},c_3+c_4=a_4^{-1}+(-a_2^{-1})$
$\left\{(0,a_{2}T,a_{3}I,a_{4}F)\right|a_2\ne 0,a_2+a_3\ne 0,a_2+a_3+a_4=0\}$	$(0,T,0,-F)$	$c_1+c_2=a_2^{-1},c_3=-(a_3{a}_2^{-1}{(a_2+a_3)}^{-1}),$ $c_4\in \mathbb{F}$
$\left\{(0,a_{2}T,a_{3}I,a_{4}F)\right|a_2\ne 0,a_2+a_3\ne 0,a_2+a_3+a_4\ne 0\}$	$(0,T,0,0)$	$c_1+c_2=a_2^{-1},c_3=-(a_3{a}_2^{-1}{(a_2+a_3)}^{-1}),$ c4 = −(a4(a2 + a3)−1(a2 + a3 + a4)−1)
$\left\{(a_1,-a_{1}T,0,0)\right|a_1\ne 0\}$	$(1,-T,0,0)\}$	$c_1=a_1^{-1},c_2,c_3,c_4\in \mathbb{F}$
$\left\{(a_1,-a_{1}T,0,a_{4}F)\right|a_1\ne 0,a_4\ne 0\}$	$(1,-T,0,F)$	$c_1=a_1^{-1},c_2+c_3+c_4=a_4^{-1}+(-a_1^{-1})$
$\left\{(a_1,-a_{1}T,a_{3}I,-a_{3}F)\right|a_1\ne 0,a_3\ne 0\}$	$(1,-T,I,-F)$	$c_1=a_1^{-1},c_2+c_3=a_3^{-1}-a_1^{-1},c_4\in \mathbb{F}$
$\left\{(a_1,-a_{1}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_3\ne 0,a_3+a_4\ne 0\}$	$(1,-T,I,0)$	$c_1=a_1^{-1},c_2+c_3=a_3^{-1}+(-a_1^{-1}),$ c4 = −(a4a3−1(a3 + a4)−1)
$\left\{(a_1,a_{2}T,a_{3}I,0)\right|a_1\ne 0,a_1+a_2\ne 0,a_1+a_2+a_3=0\}$	$(1,0,-I,0)$	$c_1=a_1^{-1},c_2=-(a_2{a}_1^{-1}{(a_1+a_2)}^{-1}),$ $c_3,c_4\in \mathbb{F}$
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_2\ne 0,a_1+a_2+a_3=0,a_4\ne 0\}$	$(1,0,-I,F)$	$c_1=a_1^{-1},c_2=-(a_2{a}_1^{-1}{(a_1+a_2)}^{-1}),$ c3 + c4 = a4−1 + (−(a1 + a2)−1)
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_2\ne 0,a_1+a_2+a_3\ne 0,a_1+a_2+a_3+a_4=0\}$	$(1,0,0,-F)$	$c_1=a_1^{-1},c_2=-(a_2{a}_1^{-1}{(a_1+a_2)}^{-1}),$ c3 = −(a3(a1 + a2)−1(a1 + a2 + a3)−1), $c_4\in \mathbb{F}$
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_2\ne 0,a_1+a_2+a_3\ne 0,a_1+a_2+a_3+a_4\ne 0\}$	$(1,0,0,0)$	$c_1=a_1^{-1},c_2=-(a_2{a}_1^{-1}{(a_1+a_2)}^{-1}),$ c3 = −(a3(a1 + a2)−1(a1 + a2 + a3)−1), c4 = −(a4(a1 + a2 + a3)−1(a1 + a2 + a3 + a4)−1)

Example 1.

Let $\mathbb{F}=Z_5=\{\left[0\right],\left[1\right],\left[2\right],\left[3\right],\left[4\right]\}$, then $(Z_5,+,·)$ is a field, where + and · are the classical mod addition and multiplication, respectively. For algebra system $(NQF,\ast )$, if $a=(a_1,a_{2}T,a_{3}I,a_{4}F)=(\left[2\right],\left[4\right]T,\left[3\right]I,\left[1\right]F)$, i.e., $a_1\ne \left[0\right],a_1+a_2\ne \left[0\right],a_1+a_2+a_3\ne \left[0\right],a_1+a_2+a_3+a_4=\left[0\right]$, then, from Table 1, we can get $neut\left(a\right)=\left(\right[1],[0],[0],[4\left]F\right)$. Let $anti\left(a\right)=(c_1,c_{2}T,c_{3}I,c_{4}F)$, so $c_1=a_1^{-1}=\left[3\right],c_2=\left[3\right],c_3=\left[3\right],c_4\in Z_5$, thus $anti\left(a\right)=(\left[3\right],\left[3\right]T,\left[3\right]I,c_{4}F)$, where $c_4\in Z_5$. Thus, we can easily get the neutral element and opposite elements of each neutrosophic quadruple number on general field. For more examples, see the following:

1. 

Let $b=\left(\right[1],[2]T,[1]I,[3\left]F\right)$, then $neut\left(b\right)=\left(\right[1],[0],[0],[0\left]\right)$ and $anti\left(b\right)=\left(\right[1],[1]T,[2]I,[4\left]F\right)$.

2. 

Let $c=\left(\right[0],[0],[1]I,[4\left]F\right)$, then $neut\left(c\right)=\left(\right[0],[0],[1],[4\left]\right)$ and $anti\left(c\right)=(c_1,c_{2}T,c_{3}I,c_{4}F)$, where $c_1\oplus c_2\oplus c_3=\left[1\right],c_4\in Z_5$.

3. 

Let $d=\left(\right[0],[1]T,[1]I,[1\left]F\right)$, then $neut\left(d\right)=\left(\right[0],[1]T,[0],[0\left]\right)$ and $anti\left(d\right)=(c_1,c_{2}T,\left[2\right]I,\left[4\right]F)$, where $c_1\oplus c_2=\left[1\right]$.

Example 2.

Let ${\mathbb{F}}_4=\{0,1,x,y\}$, the operators + and · on ${\mathbb{F}}_4$ is defined by Table 2.

Table 2. The operators + and · on ${\mathbb{F}}_4$.

+	0	1	x	y	·	0	1	x	y
0	0	1	x	y	0	0	0	0	0
1	1	0	y	x	1	0	1	x	y
x	x	y	0	1	x	0	x	y	1
y	y	x	1	0	y	0	y	1	x

Then, $({\mathbb{F}}_4,+,·)$ is a field. Set $NQF=\left\{(a,bT,cI,dF)\right|a,b,c,d\in {\mathbb{F}}_4\}$. We have:

1. 

Let $a=(0,0,xI,xF)$, then $neut\left(a\right)=(0,0,I,F)$ and $anti\left(a\right)=(c_1,c_{2}T,c_{3}I,c_{4}F)$, where $c_1+c_2+c_3=y,c_4\in {\mathbb{F}}_4$.

2. 

Let $b=(0,xT,xI,yF)$, then $neut\left(b\right)=(0,T,I,F)$ and $anti\left(b\right)=(c_1,c_{2}T,c_{3}I,c_{4}F)$, where $c_1+c_2=y,c_3+c_4=1$.

3. 

Let $c=(x,xT,0,0)$, then $neut\left(c\right)=(1,T,0,0)$ and $anti\left(c\right)=(y,c_{2}T,c_{3}I,c_{4}F)$, where $c_2,c_3,c_4\in {\mathbb{F}}_4$.

In the same way, for algebra system $(NQF,★)$, Table 3 gives all the subsets which have the same neutral element, and the corresponding neutral element and opposite elements.

Table 3. The corresponding neutral element and opposite elements for $(NQF,★)$.

The Subset of $\mathit{NQF}$	Neutral Element	Opposite Elements $({\mathit{c}}_1,{\mathit{c}}_2\mathit{T},{\mathit{c}}_3\mathit{I},{\mathit{c}}_4\mathit{F})$
$\left\{\right(0,0,0,0\left)\right\}$	$(0,0,0,0)$	$c_i\in \mathbb{F}$
$\left\{(0,a_{2}T,0,0)\right|a_2\ne 0\}$	$(0,T,0,0)$	$c_1+c_2+c_3+c_4=a_2^{-1}$
$\left\{(0,-a_{3}T,a_{3}I,0)\right|a_3\ne 0\}$	$(0,-T,I,0)$	$c_1+c_3+c_4=a_3^{-1},c_2\in \mathbb{F}$
$\left\{(0,a_{2}T,a_{3}I,a_{4}F)\right|a_3\ne 0,a_2+a_3\ne 0\}$	$(0,0,I,0)$	$c_1+c_3+c_4=a_3^{-1},$ c2 = −(a2a3−1(a2 + a3)−1)
$\left\{(0,0,-a_{4}I,a_{4}F)\right|a_4\ne 0\}$	$(0,0,-I,F)\}$	$c_1+c_4=a_4^{-1},c_2,c_3\in \mathbb{F}$
$\left\{(0,a_{2}T,-a_{4}I,a_{4}F)\right|a_2\ne 0,a_4\ne 0\}$	$(0,T,-I,F)$	$c_1+c_4=a_4^{-1},c_2+c_3=a_2^{-1}+(-a_4^{-1})$
$\left\{(0,a_{2}T,a_{3}I,a_{4}F)\right|a_4\ne 0,a_3+a_4\ne 0,a_2+a_3+a_4=0\}$	$(0,-T,0,F)$	$c_1+c_4=a_4^{-1},c_3=-(a_3{a}_4^{-1}{(a_3+a_4)}^{-1}),$ $c_2\in \mathbb{F}$
$\left\{(0,a_{2}T,a_{3}I,a_{4}F)\right|a_4\ne 0,a_3+a_4\ne 0,a_2+a_3+a_4\ne 0\}$	$(0,0,0,F)$	$c_1+c_4=a_4^{-1},c_3=-(a_3{a}_4^{-1}{(a_3+a_4)}^{-1}),$c2 = −(a2(a3 + a4)−1(a2 + a3 + a4)−1)
$\left\{(a_1,0,0,-a_{1}F)\right|a_1\ne 0\}$	$(1,0,0,-F)\}$	$c_1=a_1^{-1},c_2,c_3,c_4\in \mathbb{F}$
$\left\{(a_1,a_{2}T,0,-a_{1}F)\right|a_1\ne 0,a_2\ne 0\}$	$(1,T,0,-F)$	$c_1=a_1^{-1},c_2+c_3+c_4=a_2^{-1}+(-a_1^{-1})$
$\left\{(a_1,-a_{3}T,a_{3}I,-a_{1}F)\right|a_1\ne 0,a_3\ne 0\}$	$(1,-T,I,-F)$	$c_1=a_1^{-1},c_3+c_4=a_3^{-1}+(-a_1^{-1}),c_4\in \mathbb{F}$
$\left\{(a_1,a_{2}T,a_{3}I,-a_{1}F)\right|a_1\ne 0,a_3\ne 0,a_2+a_3\ne 0\}$	$(1,0,I,-F)$	$c_1=a_1^{-1},c_3+c_4=a_3^{-1}+(-a_1^{-1}),$ c2 = −(a2a3−1(a2 + a3)−1)
$\left\{(a_1,0,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_4\ne 0,a_1+a_3+a_4=0\}$	$(1,0,-I,0)$	$c_1=a_1^{-1},c_4=-(a_4{a}_1^{-1}{(a_1+a_4)}^{-1}),$ c2, $c_3\in \mathbb{F}$
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_4\ne 0,a_1+a_3+a_4=0,a_2\ne 0\}$	$(1,T,-I,0)$	$c_1=a_1^{-1},c_4=-(a_4{a}_1^{-1}{(a_1+a_4)}^{-1}),$ c2 + c3 = a2−1 + (−(a1 + a4)−1)
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_4\ne 0,a_1+a_3+a_4\ne 0,a_1+a_2+a_3+a_4=0\}$	$(1,-T,0,0)$	$c_1=a_1^{-1},c_4=-(a_4{a}_1^{-1}{(a_1+a_4)}^{-1}),$ c3 = −(a3(a1 + a4)−1(a1 + a3 + a4)−1), $c_2\in \mathbb{F}$
$\left\{(a_1,a_{2}T,a_{3}I,a_{4}F)\right|a_1\ne 0,a_1+a_4\ne 0,a_1+a_3+a_4\ne 0,a_1+a_2+a_3+a_4\ne 0\}$	$(1,0,0,0)$	$c_1=a_1^{-1},c_4=-(a_4{a}_1^{-1}{(a_1+a_4)}^{-1}),$ c3 = −(a3(a1 + a4)−1(a1 + a3 + a4)−1), c2 = −(a2(a1 + a3 + a4)−1(a1 + a2 + a3 + a4)−1)

4. The Algebra Structure of Refined Neutrosophic Numbers on General Field

In the above section, we reveal that the algebra structure of the neutrosophic quadruple numbers on general field. In this section, we explore the the algebra structure of the refined neutrosophic numbers (refined neutrosophic quadruple numbers) on general field.

Definition 11.

Let $\mathbb{F}$ be a field; a refined n-ary neutrosophic number is a number of the form $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)$, where $I_1,I_2,\cdots$, and $I_n$ are different types of indeterminacies, and $a_0,a_1,a_2,\cdots ,a_n\in \mathbb{F}$. The set $RN{F}_n$ defined by

$$RN{F}_n=\left\{(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)\right|a_0,a_1,a_2,\cdots ,a_n\in \mathbb{F}\}.$$

(14)

is called a refined neutrosophic set on field $\mathbb{F}$.

Definition 12.

Let $x=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n),y=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)\in RN{F}_n$, then the addition operator on $RN{F}_n$ is defined as follows:

$$x\oplus y=(a_0+b_0,(a_1+b_1)I_1,(a_2+b_2)I_2,\cdots ,(a_n+b_n)I_n).$$

(15)

Definition 13.

Let $x=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n),y=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)\in RN{F}_n$, the neutrosophic expert considers the prevalence order $I_1\prec I_2\prec \cdots \prec I_n$. Then, the multiplication operation is defined as follows:

$$\begin{array}{cc}x\ast y=\hfill & (a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)\ast (b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)\hfill \\ & =(a_0{b}_0,(a_0{b}_1+a_1{b}_1+a_1{b}_2)I_1,(a_0{b}_2+a_1{b}_2+a_2{b}_0+a_2{b}_1+a_2{b}_2)I_2,\hfill \\ & \cdots ,(a_0{b}_n+a_1{b}_n+a_2{b}_n+\cdots +a_{n-1}{b}_n+a_n{b}_0+a_n{b}_1+\cdots +a_n{b}_n)I_n).\hfill \end{array}$$

(16)

The neutrosophic expert considers the prevalence order $I_1\succ I_2\succ \cdots \succ I_n$. Then,

$$\begin{array}{cc}x★y=\hfill & (a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)★(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)\hfill \\ & =(a_0{b}_0,(a_0{b}_1+a_1{b}_1+\cdots +a_n{b}_1+a_1{b}_0+a_1{b}_2+a_1{b}_3+\cdots +a_1{b}_n)I_1,\cdots ,\hfill \\ & (a_0{b}_{n-1}+a_{n-1}{b}_0+a_{n-1}{b}_{n-1}+a_{n-1}{b}_n+a_n{b}_{n-1})I_{n-1},(a_0{b}_n+a_n{b}_0+a_n{b}_n)I_n).\hfill \end{array}$$

(17)

Theorem 4.

$(RN{F}_n,\oplus )$ is an abelian group.

Proof. 

The proof is obvious. □

Theorem 5.

For the algebra system $(RN{F}_n,\ast )$ (or $(RN{F}_n,★)$), for every element $a\in RN{F}_n$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, thus the algebra system $(RN{F}_n,\ast )$ (or $(RN{F}_n,★)$) is a NETG.

Proof. 

We use applied mathematical induction for n and only discuss the algebra system $(RN{F}_n,\ast )$. The algebra system $(RN{F}_n,★)$ has a similar proof.

If $n=2$, for refined 2-ary neutrosophic set, which is same as neutrosophic binary numbers set in [17], from Theorem 7 in [17], we can see that for every element $a\in RN{F}_2$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, thus the algebra system $(RN{F}_2,\ast )$ is a NETG.

Assume that the refined n-ary neutrosophic set $RN{F}_n$ is a NETG. That is, for every element $a\in RN{F}_n$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$. In the following, we prove that for the refined $(n+1)$-ary neutrosophic set, which is a NETG.

For each $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_{n+1}{I}_{n+1})\in RN{F}_{n+1}$, let $a^{\prime }=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)$, being $a^{\prime }\in RN{F}_n$, then, from the above assumption condition, $neut\left(a^{\prime }\right)$ and $anti\left(a^{\prime }\right)$ exist and let $neut\left(a^{\prime }\right)=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)$, $anti\left(a^{\prime }\right)=(c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n)$. We prove for $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_{n+1}{I}_{n+1})$, $neut\left(a\right)$ and $anti\left(a\right)$ exist. We discuss from the different cases of $a_{n+1}$.

Case A: If $a_{n+1}=0$, Being $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,0)\ast (b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,b_{n+1}{I}_{n+1})=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,0)$, that is $(a_0+a_1+\cdots +a_n)b_{n+1}=0$, thus we discuss from $a_0+a_1+\cdots +a_n=0$ or $a_0+a_1+\cdots +a_n\ne 0$.

Case A1: If $a_{n+1}=0,a_0+a_1+\cdots +a_n=0$, so $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,0)\ast (c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n,c_{n+1}{I}_{n+1})=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,b_{n+1}{I}_{n+1})$, that is $b_{n+1}=0$ and $c_{n+1}$ can be chosen arbitrarily in $\mathbb{F}$.

Case A2: If $a_{n+1}=0,a_0+a_1+\cdots +a_n\ne 0$, so from $(a_0+a_1+\cdots +a_n)b_{n+1}=0$, we have $b_{n+1}=0$, from $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,0)\ast (c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n,c_{n+1}{I}_{n+1})=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,0)$, thus $c_{n+1}=0$.

Case B: If $a_{n+1}\ne 0$, being $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,a_{n+1}{I}_{n+1})\ast (b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,b_{n+1}{I}_{n+1})=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,a_{n+1}{I}_{n+1})$, that is $(a_0+a_1+\cdots +a_{n+1})b_{n+1}+a_{n+1}(b_0+b_1+\cdots +b_n)=a_{n+1}$, that is $(a_0+a_1+\cdots +a_{n+1})b_{n+1}=a_{n+1}(1-b_0-b_1-\cdots -b_n)$, we discuss from $a_0+a_1+\cdots +a_{n+1}=0$ or $a_0+a_1+\cdots +a_{n+1}\ne 0$.

Case B1: If $a_{n+1}\ne 0,a_0+a_1+\cdots +a_{n+1}=0$, we have $b_0+b_1+\cdots +b_n=1$, so from $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,a_{n+1}{I}_{n+1})\ast (c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n,c_{n+1}{I}_{n+1})=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,b_{n+1}{I}_{n+1})$, that is $b_{n+1}=(c_0+c_1+\cdots +c_n)a_{n+1}=b_{n+1}$ and $c_{n+1}$ can be chosen arbitrarily in $\mathbb{F}$.

Case B2: If $a_{n+1}\ne 0,a_0+a_1+\cdots +a_{n+1}\ne 0$, we have $b_{n+1}=a_{n+1}(1-b_0-b_1-\cdots -b_n){(a_0+a_1+a_2\cdots a_n)}^{-1}$, so from $(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n,a_{n+1}{I}_{n+1})\ast (c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n,c_{n+1}{I}_{n+1})=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n,b_{n+1}{I}_{n+1})$, that is and $c_{n+1}=(b_{n+1}-a_{n+1}(c_0+c_1+\cdots +c_n)){(a_0+a_1+\cdots +a_{n+1})}^{-1}$.

From the above analysis, we can see that, for each $a\in RN{F}_n$, which has the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, from the mathematical induction method, we can obtain that the algebra system $(RNF,\ast )$ is a NETG. □

For algebra system $(RN{F}_{n+1},\ast )$, if $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_{n+1}{I}_{n+1})$, let $a^{\prime }=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n)\in RN{F}_n$, if we have $neut\left(a^{\prime }\right)=(b_0,b_1{I}_1,b_2{I}_2,\cdots ,b_n{I}_n)$, $anti\left(a^{\prime }\right)=(c_0,c_1{I}_1,c_2{I}_2,\cdots ,c_n{I}_n)$. Then, the corresponding neutral element and opposite elements of a are given in Table 4 according to the different cases of $a_{n+1}$.

Table 4. The corresponding neutral element and opposite elements for $(RN{F}_{n+1},\ast )$

The Subset $\left\{({\mathit{a}}_0,{\mathit{a}}_1{\mathit{I}}_1,\cdots ,{\mathit{a}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})\right\}$	Neutral Element $({\mathit{b}}_0,{\mathit{b}}_1{\mathit{I}}_1,\cdots ,{\mathit{b}}_{\mathit{n}}{\mathit{I}}_{\mathit{n}},{\mathit{b}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})$	Opposite Elements $({\mathit{c}}_0,{\mathit{c}}_1{\mathit{I}}_1,\cdots ,{\mathit{c}}_{\mathit{n}}{\mathit{I}}_{\mathit{n}},{\mathit{c}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})$
$a_{n+1}=0,$ a0 + a1 + … + an = 0	$b_{n+1}=0$	$c_{n+1}\in \mathbb{F}$
$a_{n+1}=0,$ a0 + a1 + … + an ≠ 0	$b_{n+1}=0$	$c_{n+1}=0$
$a_{n+1}\ne 0,$ a0 + a1 + … + an + an+1 = 0	$b_{n+1}=(c_0+c_1+\cdots +c_n)a_{n+1}$	$c_{n+1}\in \mathbb{F}$
$a_{n+1}\ne 0,$ a0 + a1 + … + an + an+1 ≠ 0	$b_{n+1}=a_{n+1}(1-b_0-b_1-\cdots -b_n){(a_0+a_1+a_2+\cdots +a_n)}^{-1})$	$c_{n+1}=(b_{n+1}-a_{n+1}(c_0+c_1+\cdots +c_n)){(a_0+a_1+\cdots +a_{n+1})}^{-1}$

For algebra system $(RN{F}_n,\ast )$, according to the results in Tables 3 and 4 in [17], we can easily obtain the neutral element and opposite elements when $n=1,2$ on general fields. In Table 1, we can get the neutral element and opposite elements when $n=3$ on general field. Thus, from Theorem 5, we can get the neutral element and opposite elements of each element in $RN{F}_n$ step-by-step. The solving method is given by Algorithm 1 and the following example is used to explain the algorithm.

Algorithm 1 Solving the neutral element and opposite elements of each element in $(RN{F}_n,\ast )$.

Input: $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n),n\ge 3$ 1: $i=3$; 2: For $i=3:n$ 3:    $A_i=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_i{I}_i)$; 4:       If $i==3$ 5:           Obtain $neut\left(A_i\right),anti\left(A_i\right)$ by Table 1; 6:       else 7:           Obtain $neut\left(A_i\right),anti\left(A_i\right)$ by Table 4 combining the values of $neut\left(A_{i-1}\right)$ and $anti\left(A_{i-1}\right)$; 8:       end 9:    Save $neut\left(A_i\right),anti\left(A_i\right)$; 10: end Output: $neut\left(a\right)=neut\left(A_n\right),anti\left(a\right)=anti\left(A_n\right)$

Example 3.

For algebra system $(RN{F}_2,\ast )$, and set $\mathbb{F}=\mathbb{R}$. If $a=(a_0,a_1{I}_1)=(0,-I_1)$, from Table 3 in [17], we can get $neut\left(a\right)=(0,I_1)$ and $anti\left(a\right)=(c_0,c_1{I}_1)$, where $c_0+c_1=-1$.

In the following, we use two methods to solve the the neutral element and opposite elements of $b=(a_0,a_1{I}_1,a-2I_2)=(0,-I_1,I_2)\in RN{F}_3$ and we get the same results.

1. 

Algorithm 1: From Table 2, being $a_3\ne 0$ and $a_0+a_1+a_2=0$, thus $b_2=(c_0+c_1)·1=-1$, that is $neut\left(b\right)=(0,I_1,-I_2)$ and $anti\left(a\right)=(c_0,c_1{I}_1,c_2{I}_2)$, where $c_0+c_1=-1$ and $c_2$ can be chosen arbitrarily in $\mathbb{R}$.

2. 

Rsults from Table 4 in [17]: Being $a_2\ne 0$ and $a_0+a_1+a_2=0$, thus $neut\left(b\right)=(0,I_1,-I_2)$ and $anti\left(a\right)=(c_0,c_1{I}_1,c_2{I}_2)$, where $c_0+c_1=-1$ and $c_2$ can be chosen arbitrarily in $\mathbb{R}$.

Example 4.

For algebra system $(RN{F}_3,\ast )$, and set $\mathbb{F}=\mathbb{R}$. If $a=(a_0,a_1{I}_1,a_2{I}_2)=(1,-I_1,I_2)\in RN{F}_3$, from Table 4 in [17], we can get $neut\left(a\right)=(1,-I_1,I_2)$ and $anti\left(a\right)=(1,c_1{I}_1,c_2{I}_2)$, where $c_1+c_2=0$.

In the same way, we use two methods to solve the the neutral element and opposite elements of $b=(a_0,a_1{I}_1,a_2{I}_2,a_3{I}_3)=(1,-I_1,I_2,I_3)\in RN{F}_4$.

1. 

Algorithm 1: From Table 2, being $a_3\ne 0$ and $a_0+a_1+a_2+a_3\ne 0$, thus $b_3=0$, that is $neut\left(b\right)=(0,-I_1,I_2,0)$ and $c_3=(0-1·1·\frac{1}{2})=-\frac{1}{2}$, thus $anti\left(a\right)=(1,c_1{I}_1,c_2{I}_2,-\frac{1}{2}{I}_3)$, where $c_1+c_2=0$.

2. 

Results from Table 1 in [17]: Being $a_0\ne 0,a_2\ne 0$ and $a_2+a_3\ne 0$, thus $neut\left(b\right)=(1,-I_1,I_2,0)$ and $c_0=1$, $c_1+c_2=0,c_3=-\frac{1}{1·(1+1)}=-\frac{1}{2}$, thus $anti\left(a\right)=(1,c_1{I}_1,c_2{I}_2,-\frac{1}{2}{I}_3)$, where $c_1+c_2=0$.

For algebra system $(RN{F}_{n+1},★)$, set $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_{n+1}{I}_{n+1})$, being the order $I_1\succ I_2\succ \cdots \succ I_n$, thus we should obtain the neutral element and opposite elements of $a^{\prime }=(a_0,a_2{I}_2,\cdots ,a_{n+1}{I}_{n+1})$. Knowing that $neut\left(a^{\prime }\right)=(b_0,b_2{I}_2,b_3{I}_3,\cdots ,b_n{I}_n)$, $anti\left(a^{\prime }\right)=(c_0,c_2{I}_2,c_3{I}_3,\cdots ,c_n{I}_n)$, then the corresponding neutral element and opposite elements of a are given in Table 5 according to the different cases of $a_1$.

Table 5. The corresponding neutral element and opposite elements for $(RNF,★)$.

The Subset $\left\{({\mathit{a}}_0,{\mathit{a}}_1{\mathit{I}}_1,\cdots ,{\mathit{a}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})\right\}$	Neutral Element $({\mathit{b}}_0,{\mathit{b}}_1{\mathit{I}}_1,\cdots ,{\mathit{b}}_{\mathit{n}}{\mathit{I}}_{\mathit{n}},{\mathit{b}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})$	Opposite Elements $({\mathit{c}}_0,{\mathit{c}}_1{\mathit{I}}_1,\cdots ,{\mathit{c}}_{\mathit{n}}{\mathit{I}}_{\mathit{n}},{\mathit{c}}_{\mathit{n}+1}{\mathit{I}}_{\mathit{n}+1})$
$a_1=0,$ a0 + a2 + … + an+1 = 0	$b_1=0$	$c_1\in \mathbb{F}$
$a_1=0,$ a0 + a2 + … + an+1 ≠ 0	$b_1=0$	$c_1=0$
$a_1\ne 0,$ a0 + a1 + … + an + an+1 = 0	$b_1=(c_0+c_2+\cdots +c_{n+1})a_1$	$c_1\in \mathbb{F}$
$a_1\ne 0,$ a0 + a1 + … + an + an+1 ≠ 0	$b_1=a_1(1-(b_0+b_2+\cdots +b_{n+1})){(a_0+a_1+\cdots +a_{n+1})}^{-1}$	$c_1=(b_1-a_1(c_0+c_2+\cdots +c_{n+1})){(a_0+a_1+\cdots +a_{n+1})}^{-1}$

Similarly, we also can get the neutral element and opposite elements of each element in $(RN{F}_n,★)$ step-by-step. The solving method is given by Algorithm 2 and the following example is used to explain the algorithm.

Algorithm 2 Solving the neutral element and opposite elements of each element in $(RN{F}_n,★)$.

Input: $a=(a_0,a_1{I}_1,a_2{I}_2,\cdots ,a_n{I}_n),n\ge 3$ 1: $i=n-2$; 2: While $i\ge 1$ 3:    $A_i=(a_0,a_i{I}_i,\cdots ,a_{n-1}{I}_{n-1},a_n{I}_n)$; 4:       If $i==n-2$ 5:           Obtain $neut\left(A_i\right),anti\left(A_i\right)$ by Table 3; 6:       else 7:           Obtain $neut\left(A_i\right),anti\left(A_i\right)$ by Table 5 combining the values of $neut\left(A_{i+1}\right)$ and $anti\left(A_{i+1}\right)$; 8:       end 9:    Save $neut\left(A_i\right),anti\left(A_i\right)$; 10:      $i=i-1$; 11: end Output: $neut\left(a\right)=neut\left(A_1\right),anti\left(a\right)=anti\left(A_1\right)$

Example 5.

For algebra system $(RN{F}_6,★)$, and set $\mathbb{F}=\mathbb{R}$, $a=(0,0,-2I_2,-I_3,I_4,0)$, solve the neutral element and opposite elements of a.

According Algorithm 2 for algebra system $(RN{F}_6,★)$: Firstly, we solve the neutral element and opposite elements of $a^{\prime }=(0,-I_3,I_4,0)$ from Table 3, and then solve the neutral element and opposite elements of $a^{″}=(0,-2I_2,-I_3,I_4,0)$ from Table 5, lastly, we solve the neutral element and opposite elements of a from Table 5.

1. 

From Table 3: $neut\left(a^{\prime }\right)=(0,-I_3,I_4,0)$ and $anti\left(a^{\prime }\right)=(c_0,c_3{I}_3,c_4{I}_4,c_5{I}_5)$, where $c_0+c_4+c_5=1$, $c_3\in \mathbb{R}$.

2. 

From Table 5 and combining the results of the above step: Being $-2\ne 0$ and $0+(-2)+(-1)+1+0\ne 0$, thus $neut\left(a^{″}\right)=(0,I_2,-I_3,I_4,0)$ and $anti\left(a^{″}\right)=(c_0,c_2{I}_2,c_3{I}_3,c_4{I}_4,c_5{I}_5)$, where $c_0+c_4+c_5=1$, $c_2+c_3=-\frac{3}{2}$.

3. 

From Table 5 and combining the results of the above step: Being $0=0$ and $0+0+(-2)+(-1)+1+0\ne 0$, thus $neut\left(a\right)=(0,0,I_2,-I_3,I_4,0)$ and $anti\left(a\right)=(c_0,0,c_2{I}_2,c_3{I}_3,c_4{I}_4,c_5{I}_5)$, where $c_0+c_4+c_5=1$, $c_2+c_3=-\frac{3}{2}$.

Similarly, we explore the the algebra structure of the refined neutrosophic quadruple numbers on general field in the following.

Definition 14.

Let $\mathbb{F}$ be a field; a refined neutrosophic quadruple number is a number of the form $(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)$, where $a,b_1,b_2,\cdots ,b_p,c_1,c_2,\cdots ,c_q,d_1,d_2,\cdots ,d_r\in \mathbb{F}$. The set $RNQ{F}_{pqr}$ defined by

$$\begin{array}{cc}RNQ{F}_{pqr}=\hfill & \left\{(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)\right|\hfill \\ & a,b_1,b_2,\cdots ,b_p,c_1,c_2,\cdots ,c_q,d_1,d_2,\cdots ,d_r\in \mathbb{F}\}.\hfill \end{array}$$

(18)

is called a refined neutrosophic quadruple set on field $\mathbb{F}$.

Definition 15.

Let $x=(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)$, $y=(e,f_1{T}_1,f_2{T}_2,\cdots ,f_p{T}_p,g_1{I}_1,g_2{I}_2,\cdots ,g_q{I}_q,h_1{F}_1,h_2{F}_2,\cdots ,h_r{F}_r)\in RNQ{F}_{pqr}$, then the addition operator is defined as follows:

$$\begin{array}{cc}x\oplus y=\hfill & (a+e,(b_1+f_1)T_1,(b_2+f_2)T_2,\cdots ,(b_p+f_p)T_p,(c_1+g_1)I_1,(c_2+g_2)I_2,\cdots ,\hfill \\ & (c_q+g_q)I_q,(d_1+h_1)F_1,(d_2+h_2)F_2,\cdots ,(d_r+h_r)F_r).\hfill \end{array}$$

(19)

Definition 16.

Let $x=(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)$, $y=(e,f_1{T}_1,f_2{T}_2,\cdots ,f_p{T}_p,g_1{I}_1,g_2{I}_2,\cdots ,g_q{I}_q,h_1{F}_1,h_2{F}_2,\cdots ,h_r{F}_r)\in RNQ{F}_{pqr}$; the neutrosophic expert considers the prevalence order $T_1\prec T_2\prec \cdots \prec T_p\prec I_1\prec I_2\prec \cdots \prec I_q\prec F_1\prec F_2\prec \cdots \prec F_r$. Then, the multiplication operation is defined as follows:

$$\begin{array}{cc}x\ast y\hfill & =(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)\hfill \\ & \ast (e,f_1{T}_1,f_2{T}_2,\cdots ,f_p{T}_p,g_1{I}_1,g_2{I}_2,\cdots ,g_q{I}_q,h_1{F}_1,h_2{F}_2,\cdots ,h_r{F}_r)\hfill \\ \hfill & =(ae,(a{f}_1+b_{1}e+b_1{f}_1)T_1,(a{f}_2+b_1{f}_2+b_{2}e+b_2{f}_1+b_2{f}_2)T_2,\hfill \\ & \cdots ,(a{h}_r+b_1{h}_r+b_2{h}_r+\cdots +d_{r-1}{h}_r+d_{r}e+d_r{f}_1+\cdots +d_r{h}_r)F_r).\hfill \end{array}$$

(20)

The neutrosophic expert considers the prevalence order $T_1\succ T_2\succ \cdots \succ T_p\succ I_1\succ I_2\succ \cdots \succ I_q\succ F_1\succ F_2\succ \cdots \succ F_r$. Then,

$$\begin{array}{cc}x★y\hfill & =(a,b_1{T}_1,b_2{T}_2,\cdots ,b_p{T}_p,c_1{I}_1,c_2{I}_2,\cdots ,c_q{I}_q,d_1{F}_1,d_2{F}_2,\cdots ,d_r{F}_r)\hfill \\ & ★(e,f_1{T}_1,f_2{T}_2,\cdots ,f_p{T}_p,g_1{I}_1,g_2{I}_2,\cdots ,g_q{I}_q,h_1{F}_1,h_2{F}_2,\cdots ,h_r{F}_r)\hfill \\ & =(ae,(a{f}_1+b_1{f}_1+\cdots +d_r{f}_1+b_{1}e+b_1{f}_2+b_1{f}_3+\cdots +b_1{h}_r)T_1,\hfill \\ & \cdots ,(a{h}_{r-1}+d_{r-1}e+d_{r-1}{h}_{r-1}+d_{r-1}{h}_r+d_r{h}_{r-1})F_{r-1},(a{h}_r+d_{r}e+d_r{h}_r)F_r).\hfill \end{array}$$

(21)

Similarly, we also have the following results.

Theorem 6.

$(RNQ{F}_{pqr},\oplus )$ is an abelian group.

Theorem 7.

For the algebra system $(RNQ{F}_{pqr},\ast )$ (or $(RNQ{F}_{pqr},★)$), for every element $a\in RNQ{F}_{pqr}$, there exists the neutral element $neut\left(a\right)$ and opposite element $anti\left(a\right)$, thus the algebra system $(RNQ{F}_{pqr},\ast )$ (or $(RNQ{F}_{pqr},★)$) is a NETG.

Example 6.

For algebra system $(RNQ{F}_{213},\ast )$, and set $\mathbb{F}=\mathbb{R}$, $a=(1,0,2T_2,-3I_1,2F_1,0,-2F_3)$, solve the neutral element and opposite elements of a.

According Algorithm 1 for algebra system $(RN{F}_{213},\ast )$, firstly, we solve the neutral element and opposite elements of $a^{\prime }=(1,0,2T_2,-3I_1)$ from Table 1. We then solve the neutral element and opposite elements of $a^{″}=(1,0,2T_2,-3I_1,2F_1)$ from Table 4. Next we solve the neutral element and opposite elements of $a^{‴}=(1,0,2T_2,-3I_1,2F_1,0)$ from Table 4. Finally, we solve the neutral element and opposite elements of a from Table 4.

1. 

From Table 1, $neut\left(a^{\prime }\right)=(1,0,0,-I_1)$ and $anti\left(a^{\prime }\right)=(1,0,-\frac{2}{3}{T}_2,c_4{I}_1)$, where $c_4\in \mathbb{R}$.

2. 

From Table 4 and combining the results of the above step: Being $2\ne 0$ and $1+0+2+(-3)+2\ne 0$, thus $neut\left(a^{″}\right)=(1,0,0,-I_1,F_1)$ and $anti\left(a^{″}\right)=(1,0,-\frac{2}{3}{T}_2,c_4{I}_1,c_5{F}_1)$, where $c_4+c_5=\frac{1}{6}$.

3. 

From Table 4 and combining the results of the above step: Being $0=0$ and $1+0+2+(-3)+2+0\ne 0$, thus $neut\left(a^{‴}\right)=(1,0,0,-I_2,F_1,0)$ and $anti\left(a^{‴}\right)=(1,0,-\frac{2}{3}{T}_2,c_4{I}_1,c_5{F}_1,0)$, where $c_4+c_5=\frac{1}{6}$.

4. 

From Table 4 and combining the results of the above step: Being $-2\ne 0$ and $1+0+2+(-3)+2+0+(-2)=0$, thus $neut\left(a\right)=(1,0,0,-I_1,F_1,0,-F_3)$ and $anti\left(a\right)=(1,0,-\frac{2}{3}{T}_2,c_4{I}_1,c_5{F}_1,0,c_7{F}_3)$, where $c_4+c_5=\frac{1}{6},c_7\in \mathbb{R}$.

Example 7.

For algebra system $(RNQ{F}_{213},\ast )$, and set $\mathbb{F}=Z_5=\{\left[0\right],\left[1\right],\left[2\right],\left[3\right],\left[4\right]\}$, $a=(\left[1\right],\left[0\right],\left[2\right]T_2,$$\left[2\right]I_1,\left[2\right]F_1,0,\left[3\right]F_3)$, solve the neutral element and opposite elements of a.

Similar to Example 6, according Algorithm 1 for algebra system $(RN{F}_{213},\ast )$, firstly, we solve the neutral element and opposite elements of $a^{\prime }=(\left[1\right],\left[0\right],\left[2\right]T_2,\left[2\right]I_1)$ from Table 1. We then solve the neutral element and opposite elements of $a^{″}=(\left[1\right],\left[0\right],\left[2\right]T_2,\left[2\right]I_1,\left[2\right]F_1)$ from Table 4. Next, we solve the neutral element and opposite elements of $a^{‴}=(\left[1\right],\left[0\right],\left[2\right]T_2,\left[2\right]I_1,\left[2\right]F_1,\left[0\right])$ from Table 4. Finally, we solve the neutral element and opposite elements of a from Table 4.

1. 

From Table 1, $neut\left(a^{\prime }\right)=(\left[1\right],\left[0\right],\left[0\right],\left[4\right]I_1)$ and $anti\left(a^{\prime }\right)=(\left[1\right],\left[0\right],\left[1\right]T_2,c_4{I}_1)$, where $c_4\in \mathbb{F}$.

2. 

From Table 4 and combining the results of the above step: Being $\left[2\right]\ne \left[0\right]$ and $\left[1\right]+\left[0\right]+\left[2\right]+\left[2\right]+\left[2\right]\ne \left[0\right]$, thus $neut\left(a^{″}\right)=(\left[1\right],\left[0\right],\left[0\right],\left[4\right]I_1,\left[1\right]F_1)$ and $anti\left(a^{″}\right)=(\left[1\right],\left[0\right],\left[1\right]T_2,c_4{I}_1,c_5{F}_1)$, where $c_4+c_5=\left[1\right]$.

3. 

From Table 4 and combining the results of the above step: Being $\left[0\right]=\left[0\right]$ and $\left[1\right]+\left[0\right]+\left[2\right]+\left[2\right]+\left[2\right]+\left[0\right]\ne 0$, thus $neut\left(a^{‴}\right)=(\left[1\right],\left[0\right],\left[0\right],\left[4\right]I_1,\left[1\right]F_1,\left[0\right])$ and $anti\left(a^{‴}\right)=(\left[1\right],\left[0\right],\left[1\right]T_2,c_4{I}_1,c_5{F}_1,\left[0\right])$, where $c_4+c_5=\left[1\right]$.

4. 

From Table 4 and combining the results of the above step: Being $\left[3\right]\ne \left[0\right]$ and $\left[1\right]+\left[0\right]+\left[2\right]+\left[2\right]+\left[2\right]+\left[0\right]+\left[3\right]=0$, thus $neut\left(a\right)=(\left[1\right],\left[0\right],\left[0\right],\left[4\right]I_1,\left[1\right]F_1,\left[0\right],\left[4\right]F_3)$ and $anti\left(a\right)=(\left[1\right],\left[0\right],\left[1\right]T_2,c_4{I}_1,c_5{F}_1,\left[0\right],c_7{F}_3)$, where $c_4+c_5=\left[1\right],c_7\in \mathbb{F}$.

5. Conclusions

In this paper, we study the algebra structure of $(NQF(RN{F}_n,RNQ{F}_n),\oplus ),(NQF(RN{F}_n,RNQ{F}_n),\ast )$ and $(NQF(RN{F}_n,RNQ{F}_n),★)$, and we prove that $(NQF(RN{F}_n,RNQ{F}_n),\ast )$ (or $\left(NQF\right(RN{F}_n,$$RNQ{F}_n),★)$) is a neutrosophic extended triplet group, and provide new examples of neutrosophic extended triplet group and the neutral element and opposite elements of each refined n-ary neutrosophic number (refined neutrosophic quadruple number) can be obtained by given algorithms. In the following, we can explore the algebra structure of $(NQF(RN{F}_n,RNQ{F}_n),\oplus ,\ast )$ or $(NQF(RN{F}_n,RNQ{F}_n),\oplus ,★)$. We can also explore the relation of neutrosophic quadruple numbers and other algebra systems in papers [21,22,23]. Moreover, on the one hand, we will discuss the neutrosophic quadruple numbers based on some particular ring which can form a neutrosophic extended triplet group, while, on the other hand, we will introduce a new operation ∘ in order to guarantee $(NQF(RN{F}_n,RNQ{F}_n),\ast ,\circ )$ is a neutrosophic triplet ring.