# The Relations among Fuzzyt-Filters on Residuated Lattices

Authors: Huarong Zhang; Qingguo Li
Journal: The Scientific World Journal
 (2014)

---

## Abstract

We give the simple general principle of studying the relations among fuzzyt-filters on residuated lattices. Using the general principle, we can easily determine the relations among fuzzy t-filters on different logical algebras.


---

## Body

## 1. Introduction

Residuated lattices, invented by Ward and Dilworth [1], constitute the semantics of Höhle’s Monoidal Logic [2]. Residuated lattices are very useful and are basic algebraic structures. Many logical algebras, such as Boolean algebras, MV-algebras, BL-algebras, MTL-algebras, Gödel algebras, NM algebras, and R0-algebras, are particular residuated lattices. Besides their logical interest, residuated lattices have lots of interesting properties. In [3], Idziak proved that the varieties of residuated lattices are equational.Filters play a vital role in investigating logical algebras and the completeness of the corresponding nonclassical logics. From logical points of view, filters correspond to sets of provable formulae. At present, the filter theory on different logical algebras has been widely studied. Only on residuated lattices, such literatures are as follows: [4–11]. In [8, 9], Ma et al. found the common features of filters on residuated lattices. They, respectively, proposed the notion of τ-filters and t-filters on residuated lattices. In [9], Víta studied some basic properties of t-filters and gave the simple general framework of special types of filters.After Zadeh [12] proposed the theory of fuzzy sets, it has been applied to many branches in mathematics. The fuzzification of the filters was originated in 1995 [13]. Subsequently, a large amount of papers about special types of fuzzy filters was published in many journals on different logical algebras [10, 11, 14–24]. In [23], Víta found the common features of fuzzy filters on residuated lattices. He proposed the notion of fuzzy t-filters and proved its basic properties. However, the relations among fuzzy t-filters were not discussed. Usually, when studying the relations among special types of fuzzy filters, the equivalent characterizations of special types of fuzzy filters were firstly discussed. Then, resorting to the properties of the logical algebras, the relations among special types of fuzzy filters were given. The proofs were tedious in many literatures. The motivation of this paper is to give the simple general principle of studying the relations among fuzzy t-filters on residuated lattices. In contrast to proofs of particular results for concrete special types of fuzzy filters, proofs of those general theorems in this paper are simple. And the general principle can be applied to all the subvarieties of residuated lattices.


## 2. Preliminary

Definition 1 (see [1, 25]).
A residuated lattice is an algebraL
=
(
L
,
∧
,
∨
,
⊗
,
→
,
0,1
) such that for all x, y, z
∈
L,(1)
(
L
,
∧
,
∨
,
0,1
) is a bounded lattice;
(2)
(
L
,
⊗
,
1
) is a commutative monoid;
(3)
(
⊗
,
→
) forms an adjoint pair; that is, x
⊗
y
≤
z if and only if x
≤
y
→
z.
We denotex
→
0
=
x
*.Definition 2 (see [11, 25–30]).
LetL be a residuated lattice. Then L is called (i)
an MTL-algebra if(
x
→
y
)
∨
(
y
→
x
)
=
1 for all x, y
∈
L (prelinear axiom);
(ii)
an Rl-monoid ifx
∧
y
=
x
⊗
(
x
→
y
) for all x, y
∈
L (divisible axiom);
(iii)
a Heyting algebra ifx
⊗
y
=
x
∧
y for all x, y
∈
L, which is equivalent to an idempotent residuated lattice; that is, x
=
x
⊗
x
=
x
2 for x
∈
L;
(iv)
a regular residuated lattice if it satisfies double negation; that is,x
*
*
=
x for x
∈
L;
(v)
a BL-algebra if it satisfies both prelinear and divisible axioms;
(vi)
an MV-algebra if it is a regular Rl-monoid;
(vii)
a Gödel algebra if it is an idempotent BL-algebra;
(viii)
a Boolean algebra if it is an idempotent MV-algebra;
(ix)
a R0-algebra (NM algebra) if it satisfies prelinear axiom, double negation, and(
x
⊗
y
→
0
)
∨
(
x
∧
y
→
x
⊗
y
)
=
1.Definition 3 (see [25, 31, 32]).
LetL be a residuated lattice. Then, a nonempty subset F of L is called a filter if(1)
for allx
∈
F and y
∈
L, x
≤
y implies y
∈
F,
(2)
for allx, y
∈
F, x
⊗
y
∈
F.Definition 4 (see [5–11]).
LetF be a filter of L. Then, F is called(i)
an implicative filter ifx
→
x
2
∈
F for all x
∈
L,
(ii)
a regular filter ifx
*
*
→
x
∈
F for all x
∈
L,
(iii)
a divisible filter if(
x
∧
y
)
→
(
x
⊗
(
x
→
y
)
)
∈
F for all x, y
∈
L,
(iv)
a prelinear filter if(
x
→
y
)
∨
(
y
→
x
)
∈
F for all x, y
∈
L,
(v)
a Boolean filter ifx
∨
x
*
∈
F for all x
∈
L,
(vi)
a fantastic filter if(
y
→
x
)
→
(
(
(
x
→
y
)
→
y
)
→
x
)
∈
F for all x, y
∈
L,
(vii)
ann-contractive filter if x
n
→
x
n
+
1
∈
F for all x
∈
L, where x
n
+
1
=
x
n
⊗
x, n
≥
1.Remark 5.
On residuated lattices,x
→
(
y
→
z
)
=
y
→
(
x
→
z
) holds (see [31]). Using these properties, we have that F is a fantastic filter if (
(
x
→
y
)
→
y
)
→
(
(
y
→
x
)
→
x
)
∈
F.We now review some fuzzy concepts. A fuzzy set on residuated lattice is a functionμ
:
L
→
[
0,1
]. For any α
∈
[
0,1
] and an arbitrary fuzzy set μ, we denote the set {
x
∈
L
∣
μ
(
x
)
≥
α
} (i.e., the α-cut) by the symbol μ
α.Definition 6 (see [10, 11]).
A fuzzy setμ is a fuzzy filter on L if and only if it satisfies the following two conditions for all x
,
y
∈
L:(1)
μ
(
x
⊗
y
)
≥
min
⁡
{
μ
(
x
)
,
μ
(
y
)
},
(2)
ifx
≤
y, then μ
(
x
)
≤
μ
(
y
).
In the following, by the symbolx
- we denote the abbreviation of x
,
y
,
…; that is, x
- is a formal listing of variables used in a given content. By the term t, it is always meant as a term in the language of residuated lattices.Definition 7 (see [9]).
Lett be an arbitrary term on the language of residuated lattices. A filter F on L is a t-filter if t
(
x
-
)
∈
F for all x
-
∈
L.Definition 8 (see [23]).
A fuzzy filterμ on L is called a fuzzy t-filter on L, if for all x
-
∈
L it satisfies μ
(
t
(
x
-
)
)
=
μ
(
1
).Example 9 (see [11]).
Fuzzy Boolean filters are fuzzyt-filters for t equal to x
∨
x
*.Example 10 (see [11]).
Fuzzy regular filters are fuzzyt-filters for t equal to x
*
*
→
x.Example 11 (see [11]).
Fuzzy fantastic filters are fuzzyt-filters for t equal to (
(
x
→
y
)
→
y
)
→
(
(
y
→
x
)
→
x
).Remark 12.
Using the notion of fuzzyt-filter, fuzzy implicative filters are fuzzy t-filters for t equal to x
→
x
2. Fuzzy divisible filters are fuzzy t-filters for t equal to (
x
∧
y
)
→
(
x
⊗
(
x
→
y
)
) and so forth.Let us assume that since now,t is an arbitrary term in the language of residuated lattices. We also use another useful convention: given a variety B of residuated lattices, we denote its subvariety given by the equation t
=
1 by the symbol B
[
t
]; we call this algebra t-algebra.The next part of this paper concerns fuzzy quotient constructions. We recall some known results and constructions concerning fuzzy quotients residuated lattices.Theorem 13 (see [11]).
Letμ be a fuzzy filter on L and x
,
y
∈
L. For any z
∈
L, we define μ
x
:
L
→
[
0,1
], μ
x
(
z
)
=
min
⁡
{
μ
(
x
→
z
)
,
μ
(
z
→
x
)
}. Then, μ
x
=
μ
y if and only if μ
(
x
→
y
)
=
μ
(
y
→
x
)
=
μ
(
1
).Theorem 14 (see [11]).
Letμ be a fuzzy filter on L and L
/
μ
:
=
{
μ
x
∣
x
∈
L
}. For any μ
x
,
μ
y
∈
L
/
μ, we defineμ
x
∧
μ
y
=
μ
x
∧
y,
μ
x
∨
μ
y
=
μ
x
∨
y,
μ
x
⊗
μ
y
=
μ
x
⊗
y,
μ
x
→
μ
y
=
μ
x
→
y.Then, L
/
μ
=
(
L
/
μ
,
∧
,
∨
,
⊗
,
→
,
μ
0
,
μ
1
) is a residuated lattice called the fuzzy quotient residuated lattice.Theorem 15 (quotient characteristics [23]).
LetB be a variety of residuated lattices and L
∈
B. Let μ be a fuzzy filter on L. Then, the fuzzy quotient L/μ belongs to B
[
t
] if and only if μ is a fuzzy t-filter on L.


## 3. The General Principle of the Relation among Fuzzyt-Filters and Its Application

In the following, letB be a variety of residuated lattices. L
∈
B and μ is a fuzzy filter on L.Theorem 16.
Suppose that there are fuzzyt
1-filter and fuzzy t
2-filter on L and B
[
t
1
]
⊆
B
[
t
2
]. If μ is a fuzzy t
1-filter, then μ is a fuzzy t
2-filter.Proof.
μ is a fuzzy t
1-filter ⇒
L
/
μ
∈
B
[
t
1
]
⇒
L
/
μ
∈
B
[
t
2
]
⇒
μ is a fuzzy t
2-filter.Theorem 17.
Suppose there are fuzzyt
1-filter and fuzzy t
2-filter on L. If B
[
t
1
]
=
B
[
t
2
], then μ is a fuzzy t
1-filter if and only if μ is a fuzzy t
2-filter.Proof.
μ is a fuzzy t
1-filter ⇔
L
/
μ
∈
B
[
t
1
]
⇔
L
/
μ
∈
B
[
t
2
]
⇔
μ is a fuzzy t
2-filter.Remark 18.
The above results give the general principle of the relations among fuzzyt-filters. If we want to judge the relations among fuzzy t-filter, we only resort to the relations among t-algebras. Since the relations among t-algebras are known to us, we can easily obtain the relations among fuzzy t-filters.Theorem 19.
LetL be a residuated lattice. If μ is a fuzzy implicative filter, then μ is a fuzzy n-contractive filter.Proof.
It is obvious thatB
[
x
→
x
2
]
⊆
B
[
x
n
→
x
n
+
1
]. By Theorem 16, the result is clear.Lemma 20 (see [5, 27]).
LetL be a residuated lattice. If L is a Heyting algebra, then L is an Rl-monoid.Lemma 21 (see [11]).
LetL be a residuated lattice. Then the following are equivalent:(1)
L is an MV-algebra;
(2)
(
x
→
y
)
→
y
=
(
y
→
x
)
→
x
,
∀
x
,
y
∈
L.Lemma 22 (see [25]).
LetL be a residuated lattice. Then L is an MV-algebra if and only if L is a regular BL-algebra.Lemma 23.
LetL be a residuated lattice. Then the following are equivalent:(1)
L is a Boolean algebra;
(2)
x
∨
x
*
=
1, ∀
x
∈
L;
(3)
L is regular and idempotent.Proof.
(1)⇔(2) Reference [11], Proposition 2.10.
(1)⇒(3) If L is a Boolean algebra, then L is an idempotent MV-algebra. Thus, L is regular and idempotent.
(3)⇒(1) If L is regular and idempotent, then L is a regular Rl-monoid. Thus, L is an MV-algebra. Also, L is idempotent; therefore, L is a Boolean algebra.Lemma 24.
LetL be a residuated lattice. Then the following are equivalent:(1)
L is a Boolean algebra;
(2)
L is an idempotent R0-algebra.Proof.
(1)⇒(2) If L is a Boolean algebra, then L is a R0-algebra ([30], Example 8.5
.
1) and L is idempotent.
(2)⇒(1) Suppose L is an idempotent R0-algebra. Since L is a R0-algebra, then L is regular. By Lemma 23, we have that L is a Boolean algebra.Lemma 25.
LetL be a residuated lattice. t
1 and t
2 are arbitrary terms on L. Then, B
[
t
1
⊗
t
2
]
=
B
[
t
1
]
∩
B
[
t
2
].Proof.
L
∈
B
[
t
1
⊗
t
2
]
⇔
L
∈
B and t
1
⊗
t
2
=
1
⇔
L
∈
B; t
1
=
1 and t
2
=
1
⇔
L
∈
B
[
t
1
]
∩
B
[
t
2
].Theorem 26.
LetL be a residuated lattice. Then, μ is a fuzzy Boolean filter if and only if μ is both a fuzzy regular and a fuzzy implicative filter.Proof.
μ is a fuzzy Boolean filter ⇔
L
/
μ
∈
B
[
x
∨
x
*
]
⇔
L
/
μ
∈
B
[
(
x
*
*
→
x
)
⊗
(
x
→
x
2
)
]
⇔
L
/
μ
∈
B
[
x
*
*
→
x
]
∩
B
[
x
→
x
2
]
⇔
L
/
μ
∈
B
[
x
*
*
→
x
] and L
/
μ
∈
B
[
x
→
x
2
]
⇔
μ is both a fuzzy regular and a fuzzy implicative filter.Remark 27.
Using the same method, we can easily obtain the following results.Theorem 28.
LetL be a residuated lattice. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy fantastic and fuzzy implicative filter;
(2)
μ is a fuzzy fantastic filter if and only if μ is a fuzzy regular and fuzzy divisible filter;
(3)
every fuzzy implicative filter is a fuzzy divisible one;
(4)
ifμ is a fuzzy prelinear filter, then μ is a fuzzy fantastic filter if and only if μ is both a fuzzy regular and a fuzzy divisible filter;
(5)
ifμ is a fuzzy Boolean filter, then μ is a fuzzy n-contractive filter.Remark 29.
The notion of fuzzyt-filter and the general principle are not only applicable on residuated lattices, but also even transferable to all their subvarieties. Taking advantage of the relations among t-algebras, we can easily obtain the following results.Theorem 30.
LetL be a Boolean-algebra. Then the fuzzy prelinear filter, fuzzy fantastic filter, fuzzy divisible filter, fuzzy regular filter, and fuzzy n-contractive and fuzzy Boolean filter coincide.Theorem 31.
LetL be an MV-algebra. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy implicative filter;
(2)
the fuzzy prelinear filter, fuzzy fantastic filter, fuzzy divisible filter, and fuzzy regular filter coincide.Theorem 32.
LetL be a Gödel-algebra. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy regular filter if and only if μ is a fuzzy fantastic filter;
(2)
the fuzzy prelinear filter, fuzzy divisible filter, fuzzyn-contractive filter, and fuzzy implicative filter coincide.Theorem 33.
LetL be a BL-algebra; then(1)
μ is a fuzzy Boolean filter if and only if μ is both a fuzzy implicative and a fuzzy regular filter;
(2)
μ is a fuzzy Boolean filter if and only if μ is both a fuzzy implicative and a fuzzy fantastic filter;
(3)
μ is a fuzzy fantastic filter if and only if μ is a fuzzy regular filter;
(4)
the fuzzy prelinear filter and fuzzy divisible filter coincide.Theorem 34.
LetL be an MTL-algebra. Then,(1)
μ is a fuzzy Boolean filter if and only if μ is both a fuzzy implicative and a fuzzy regular filter;
(2)
μ is a fuzzy Boolean filter if and only if μ is both a fuzzy implicative and a fuzzy fantastic filter;
(3)
μ is a fantastic filter if and only if μ is a regular and divisible filter;
(4)
ifμ is a fuzzy implicative filter, then μ is a fuzzy divisible filter.Theorem 35.
LetL be a Heyting-algebra. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy regular filter if and only if μ is a fuzzy fantastic filter;
(2)
the fuzzy implicative filter, fuzzy divisible filter, and fuzzyn-contractive filter coincide.Theorem 36.
LetL be a R0-algebra; then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy implicative filter;
(2)
every fuzzy Boolean filter is a fuzzy fantastic filter;
(3)
μ is a fuzzy fantastic filter if and only if μ is a fuzzy divisible filter;
(4)
the fuzzy prelinear filter and fuzzy regular filter coincide;
(5)
every fuzzy implicative filter is a fuzzy divisible one.Theorem 37.
LetL be a regular residuated lattice. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy implicative filter;
(2)
μ is a fuzzy fantastic filter if and only if μ is a fuzzy divisible filter;
(3)
every fuzzy Boolean filter is a fuzzy fantastic filter;
(4)
every fuzzy implicative filter is a fuzzy divisible one.Theorem 38.
LetL be a Rl-monoid. Then(1)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy implicative and fuzzy fantastic filter;
(2)
μ is a fuzzy Boolean filter if and only if μ is a fuzzy implicative and fuzzy regular filter;
(3)
μ is a fuzzy fantastic filter if and only if μ is a fuzzy regular filter;
(4)
every fuzzy implicative filter is a fuzzy divisible one.



---

*Source: 894346-2014-10-20.xml*