3. Anti-Intuitionistic Fuzzy Soft a-Ideal
In what follows, we write to denote a -algebra and for intuitionistic fuzzy sets and we will introduce an abbreviation for the notions in the following definitions to be used in the rest of the paper.
Definition 6. Let be an intuitionistic fuzzy soft set (abbr. ). Afterwards, is an anti-intuitionistic fuzzy soft ideal (abbr. of Ω if and is an of Ω satisfies the following assertions:
- (i)
and ,
- (ii)
,
- (iii)
,
for all and
Definition 7. An is called an anti-intuitionistic fuzzy soft a-ideal (abbr. ) of Ω if and is an of Ω satisfies the following assertions:
- (i)
and ,
- (ii)
,
- (iii)
,
for all and
Example 1. Suppose that there are four patients in the initial universe set given by⊙ | | | | |
| | | | |
| | | | |
| | | | |
| | | | |
Afterwards, is a -algebra.
Let a set of parameters, we consider be a status of patients, in which
f stands for the parameter "fever" can be treated by antibiotic,
s stands for the parameter "sneezing" can be treated by antiallergic,
n stands for the parameter "nosal block" can be treated by nosal drops.
Subsequently, , and are over Ω
represented by: | | | | |
f | [0.1, 0.8] | [0.1, 0.8] | [0.2, 0.6] | [0.2, 0.6] |
s | [0.0, 0.9] | [0.0, 0.9] | [0.3, 0.7] | [0.3, 0.7] |
n | [0.2, 0.7] | [0.2, 0.7] | [0.4, 0.6] | [0.4, 0.6] |
Therefore, , and are an of Ω
with respect to , and n, respectively. Hence, is an of Ω.
Proposition 1. For any of Ω, the following inequalities hold: and , for any and .
Proof. Let be an of .
Subsequently, and is an of .
Thus, for every and ,
and
.
By substituting , we get,
and
. □
Theorem 1. Over Ω, any is an .
Proof. Let be an of .
Subsequently, and is an of .
Thus, for every and ,
and
.
By substituting we obtain,
and
.
Because we know that , therefore
and
.
Thus,
and
,
i.e., and is an of .
Hence is an of .□
The converse of Theorem 1 is not true in general i.e., an might not be an , as shown in the next example and we will give in the latter theorem a condition for this converse to be true.
Example 2. Let with Cayley table:⊙ | 0 | p | q | r | s |
0 | 0 | 0 | s | r | q |
p | p | 0 | s | r | q |
q | q | q | 0 | s | r |
r | r | r | q | 0 | s |
s | s | s | r | q | 0 |
Subsequently, is a -algebra.
Let be a set of parameters and consider the over Ω
. Then , and are over Ω
represented by: | 0 | p | q | r | s |
| [0.1, 0.9] | [0.4, 0.4] | [0.3, 0.6] | [0.2, 0.8] | [0.5, 0.1] |
| [0, 0.9] | [0.1, 0.7] | [0.4, 0.4] | [0.3, 0.5] | [0.2, 0.6] |
| [0, 1] | [0.2, 0.6] | [0.3, 0.5] | [0.4, 0.3] | [0.1, 0.7] |
Afterwards, is an of Ω, but since
and
,
i.e., and is not an of Ω.
Therefore is not an of Ω with respect to ϑ.
Hence is not an of Ω.
Theorem 2. Let be an over Ω. If for any and , and , then is an over Ω.
Proof. Let be an over .
Therefore, and is an of .
Thus, for any and ,
and
and is an of .
Hence is an over .
Theorem 3. If is an of Ω, then for any parameter and , and .
Proof. Let be an of .
Because .
Therefore, .
By Theorem 1, is an of .
Thus, and is an of .
Thus, for every and ,
and
□
Definition 8. Let and be two over Ω. Then “AND” written as is of Ω, where for all .
Theorem 4. If and are two of Ω, then is also an of Ω.
Proof. By definition, , where
For any and ,
and
.
For any , and ,
and
=
= .
Thus, is an of for any .
Hence is an of for any .□
Definition 9. The "extended intersection" of two and denoted by is , where and for every , Theorem 5. If and are of Ω, then is an of Ω.
Proof. We know that
, where
and for every
,
For any , if , then is an of .
Likewise, if , , which is an of .
Moreover if , such that , then is also an of .
Therefore, is an of .
Hence, is an of .
We deduce the following Corollary.
Corollary 1. The “restricted intersection” of two is an .
Definition 10. Let and be two over Ω
. Subsequently, the "union" denoted by is , where and for every , The union of two is not necessarily an , as shown in the next example.
Example 3. Let with Cayley table given by:⊙ | 0 | p | q | r | s |
0 | 0 | 0 | q | r | s |
p | p | 0 | q | r | s |
q | q | q | 0 | s | r |
r | r | r | s | 0 | q |
s | s | s | r | q | 0 |
Subsequently, is a -algebra.
Let and be two collections of parameters and consider the over Ω
. Afterwards, and are over Ω
given by: | 0 | p | q | r | s |
| [0, 0.9] | [0, 0.9] | [0.3, 0.4] | [0.1, 0.4] | [0.3, 0.4] |
| [0.2, 0.6] | [0.2, 0.6] | [0.4, 0.3] | [0.4, 0.3] | [0.3, 0.5] |
| [0.1, 0.8] | [0.1, 0.8] | [0.5, 0.2] | [0.3, 0.5] | [0.5, 0.2] |
| [0.2, 0.7] | [0.2, 0.7] | [0.3, 0.5] | [0.5, 0.3] | [0.5, 0.3] |
Then is an of Ω with respect to , and δ.
Thus is an of Ω.
Now let be an over Ω
. Then and are over Ω
given by: | 0 | p | q | r | s |
| [0, 0.7] | [0, 0.7] | [0.3, 0.5] | [0.5, 0.2] | [0.5, 0.2] |
| [0.2, 0.6] | [0.2, 0.6] | [0.5, 0.2] | [0.5, 0.2] | [0.3, 0.4] |
| [0, 0.9] | [0, 0.9] | [0.3, 0.4] | [0.1, 0.6] | [0.3, 0.4] |
Subsequently, is an of Ω with respect to κ, δ, and η.
Thus, is an of Ω.
Note that is not an of Ω based on If , then the union is an of Ω proved in the next theorem.
Theorem 6. Let and be two of Ω. If , then is an of Ω.
Proof. We know that
, where
and for every
,
Because , then either or for all .
If , then , which is an of .
Thus, is an of .
Similarly , then is an of .
Thus, is an of .
Hence, is an of .
Definition 11. Let be an anti-soft -algebra (abbr. ) over Ω. An over Ω is an of , written as , if and for any ,
.
Definition 12. Let be an over Ω. An over Ω is an of , denoted by , if and for any ,
.
Example 4. Let with Cayley table:⊙ | 0 | p | q | r | s |
0 | 0 | 0 | q | r | s |
p | p | 0 | q | r | s |
q | q | q | 0 | s | r |
r | r | r | s | 0 | q |
s | s | s | r | q | 0 |
Subsequently, is a -algebra.
Let be a set of parameters and let be a soft set over Ω and so let , , that are all sub-algebras of Ω.
Hence, is an over Ω.
Let be an over Ω
, where . Afterwards, and are in Ω
defined by: | 0 | p | q | r | s |
| [0.2, 0.7] | [0.2, 0.7] | [0.2, 0.7] | [0.4, 0.1] | [0.4, 0.1] |
| [0.3, 0.7] | [0.3, 0.7] | [0.3, 0.7] | [0.5, 0.4] | [0.5, 0.4] |
Afterwards, and are of Ω related to and , respectively.
Hence, .
Any of an is an of , but the converse is not true, as proved by the next example.
Example 5. Let with Cayley table.⊙ | 0 | p | q | r | s |
0 | 0 | 0 | 0 | 0 | 0 |
p | p | 0 | 0 | 0 | 0 |
q | q | q | 0 | q | 0 |
r | r | r | r | 0 | 0 |
s | s | s | r | q | 0 |
Subsequently, is a “-algebra” and, thus, a “-algebra”.
Let be a set of parameters.
Let be a soft set over Ω and so we let , and , that are all subalgebras of Ω.
Hence, is a over Ω.
Suppose that is an over Ω
, where . Afterwards, and are an in Ω
represented by: | 0 | p | q | r | s |
| [0, 0.7] | [0.1, 0.6] | [0.2, 0.5] | [0.3, 0.3] | [0.3, 0.3] |
| [0.1, 0.8] | [0.2, 0.7] | [0.3, 0.6] | [0.4, 0.4] | [0.4, 0.4] |
| [0.1, 0.5] | [0.2, 0.4] | [0.3, 0.3] | [0.4, 0.1] | [0.4, 0.1] |
Subsequently, is an of , but since
and
.
i.e., is not an of Ω related to .
Therefore is not an of .
Theorem 7. Let be an over Ω. If and are of , then the “extended intersection" of and is an of .
Proof. We know that
, where
and for every
,
For any , if , then , since .
Likewise, if , then , since .
Moreover if , such that , then .
Therefore, for any .
Hence, .□
Next corollary follows directly.
Corollary 2. Let and be two of an . If , then the “union” is an of .
4. Characterization of Anti-Intuitionistic Fuzzy Soft a-Ideals
In this section, we give characterizations of an over while using the idea of a soft -level set, , for any and .
Theorem 8. An over Ω is an over the non-empty soft -level set, is an a-ideal of Ω, for any and .
Proof. Let be an over .
Afterwards, is an of , for any .
Let , for any and .
Subsequently, for any ,
and ,
i.e., 0 .
Now, let and , for any .
Subsequently,
and
.
Thus, for any ,
.
.
i.e., .
Hence, is an a-ideal of , for any and .
Conversely assume that is an a-ideal of , for any and .
If for some and , and , then and , for some .
This implies that and that , this contradicts the hypothesis that is an a-ideal of .
Thus and , for any and .
Moreover, if there are elements and , such that
and
.
Afterwards, for some ,
and
.
i.e., , again a contradiction.
Thus, for any and for any ,
and
i.e., is an of , for any .
Hence, is an over .□
From the above Theorem we get the following corollary.
Corollary 3. An over Ω is an over the non-empty soft -level set, , is an a-ideal of Ω, for any and .
Theorem 9. A non-empty soft -level set, , is an a-ideal of Ω, for any and the following conditions hold:
(i) and ,
(ii) ,
(iii) ,
for any and .
Proof. Let the non-empty soft -level set, be an a-ideal of , for any and .
If for some and ,
and .
Then there are , such that
and .
This implies that and .
i.e., but , which gives a contradiction to the assumption that is an a-ideal of , for any and .
Thus, (i) is valid.
Moreover, if there are elements and , such that
and
.
Subsequently, for some ,
and
.
i.e.,
and
.
i.e.,
and
but , which—again—contradicts the assumption that is an a-ideal of , for any and .
Hence, (ii) and (iii) are valid.
Conversely, suppose that the conditions (i), (ii), and (iii) are valid.
Let , for any and .
Subsequently, for any ,
and
which implies and .
Thus, .
Now let and , for any .
Subsequently, ,
and
, .
Thus, from (ii), we get,
and
.
This implies, and .
Thus, .
Therefore, is an a-ideal of , for any and