TWMS J. App. and Eng. Math. [Link], [Link], 20xx, pp. ...

SOME PROPERTIES OF FUZZY DISJOINTNESS IN FUZZY

LATTICES

...

Abstract. In this paper, we introduce the concept of fuzzy general disjointness property
along with its notation. Our results indicate that a fuzzy section semi-complemented
lattice possesses the fuzzy atomic covering property if it meets the criteria for the fuzzy
atomic disjointness property. Furthermore, we establish that if a fuzzy section semi-
complemented lattice satisfies the fuzzy disjointness property, then it is both fuzzy ⊥-
modular and a fuzzy Birkhoff lattice.

Keywords: fuzzy lattices, fuzzy ⊥-distributive, fuzzy ⊥-modular, fuzzy general disjoint-
ness, fuzzy Birkhoff lattice, fuzzy atomic disjointness, fuzzy section semi-complemented
lattice.

AMS Subject Classification: 03B52, 03E72, 06D72, 06D99.

1. Introduction
Many researchers have investigated the generalization of distributivity, modularity, and
semi-modularity in various mathematical structures. Saarimäki and Sorjonen [10] defined
concepts such as 0-distributivity, the disjointness property, and the atomic disjointness
property within the context of a lattice. Waphare and Joshi [13] introduced the notions
of 0-distributivity and 0-modularity in partially ordered sets (posets), along with a gen-
eral definition of the disjointness property for posets, and explored a variety of related
properties.
The concept of a fuzzy set was introduced by Zadeh [18], leading to numerous researchers
proposing different ideas associated with fuzzy algebraic structures. For instance, Rosen-
feld [9] introduced fuzzy groups, while Ajmal et al. [1] and Chon [2] developed the concept
of fuzzy lattices, which has also been examined by Mezzomo et. al. [6, 7, 8].
Wasadikar and Khubchandani [14] put forward the idea of a fuzzy modular pair within a
fuzzy lattice. Additionally, Khubchandani and Khubchandani [4] introduced the concepts
and notation for fuzzy ⊥-distributive lattices and their corresponding dual concept of fuzzy
1,2
Department of Engineering, ....
e-mail: ...; ORCID: [Link]
e-mail: ...; ORCID: [Link]
∗
Corresponding author

§ Manuscript received: Month Day, Year; accepted: Month Day, Year.

TWMS Journal of Applied and Engineering Mathematics, [Link], [Link]; © Işık University, Depart-
ment of Mathematics, 20xx; all rights reserved.

1
2 TWMS J. APP. ENG. MATH. [Link], [Link], 20XX

⊤-distributive lattices. They demonstrated that a fuzzy section semicomplemented lattice

is fuzzy distributive if and only if it is fuzzy ⊥-distributive. Furthermore, they proved
that a fuzzy pseudo-complemented lattice is also a fuzzy ⊥-distributive lattice.
The motivation behind this paper is to further explore these concepts by building on
the innovative and insightful ideas of Khubchandani and Khubchandani [4]. The objective
is to enhance the existing understanding of the topic and contribute meaningfully to the
field. This current paper highlights the significance of Khubchandani’s work and how it
has inspired further research.
In section 3, we introduce several new notions, including the fuzzy general disjointness
property, fuzzy atomic disjointness property, fuzzy atomic exchange property, and fuzzy
atomic covering property. Additionally, we have proved that a fuzzy ⊥-modular lattice
possesses the fuzzy disjointness property.
In Section 4, we demonstrate that if a lattice exhibits the fuzzy atomic disjointness
property, then it inherently possesses the fuzzy atomic covering property. Moreover, if
(X, A) is fuzzy atomic, it can be classified as a fuzzy Birkhoff lattice.

2. Preliminaries
Throughout in this paper, (X, A) denotes a fuzzy lattice, where A is a fuzzy partial
order relation on a non empty set X.
For the definitions of a fuzzy partial order relation, fuzzy equivalence relation, fuzzy supre-
mum, fuzzy infimum, fuzzy lattice etc. we refer to Chon [2]. We use the notations a ∨F b
and a ∧F b to denote the fuzzy supremum and the fuzzy infimum of a, b ∈ X to distinguish
the supremum and infimum of a, b in the lattice sense, if these exist in X.
We recall some known results from Chon [2] which we shall use in this paper.
Proposition 2.1. [2, Proposition 3.3] and [5, Proposition 2.4] Let (X, A) be a fuzzy lattice.
For a, b, c ∈ X. The following statements hold:
(i) A(a, c) > 0 and A(b, c) > 0 implies A(a ∨F b, c) > 0;
(ii) A(a, b) > 0 iff a ∨F b = b;
(iii) A(a, b) > 0 iff a ∧F b = a.
Definition 2.1. (Chon [2]) Let (X, A) be a fuzzy lattice. (X, A) is called a fuzzy distribu-
tive lattice, if a ∧F (b ∨F c) = (a ∧F b) ∨F (a ∧F c) and
a ∨F (b ∧F c) = (a ∨F b) ∧F (a ∨F c) for all a, b, c ∈ X.
We recall some definitions from Khubchandani and Khubchandani [3, 4]
Definition 2.2. [3, Definition 3.1] A fuzzy lattice (X, A) is called fuzzy section semi-
complemented lattice (F SSC) if it satisfies the following condition:
If a ̸= b in X, then there exists c ∈ X such that c ̸= ⊥, A(c, a) > 0 and c ∧F b = ⊥.
Definition 2.3. [4, Definition 3.1] A fuzzy lattice (X, A) with ⊥ is called fuzzy ⊥-distributive
lattice if a ∧F b = ⊥, a ∧F c = ⊥ together imply a ∧F (b ∨F c) = ⊥, for all a, b, c ∈ X.
Definition 2.4. [4, Definition 3.2] A fuzzy lattice (X, A) with ⊤ is called fuzzy ⊤-distributive
lattice if a ∨F b = ⊤, a ∨F c = ⊤ together imply a ∨F (b ∧F c) = ⊤, for all a, b, c ∈ X.
Definition 2.5. [4, Definition 3.3] A fuzzy bounded lattice L = (X, A) which is both fuzzy
⊥-distributive lattice and fuzzy ⊤-distributive lattice is called fuzzy ⊥-⊤ distributive lattice.
Definition 2.6. [6, Definition 3.4] A fuzzy lattice L = (X, A) is bounded if there exist
elements ⊥ and ⊤ in X, such that A(⊥, a) > 0 and A(a, ⊤) > 0, for all a ∈ X. In this
case, ⊥ and ⊤ are called bottom and top elements, respectively.
 ...: SOME PROPERTIES OF FUZZY... 3

Definition 2.7. [14, Definition 3.3] Let P denote the set of all a ∈ X such that ⊥ ≺F a.
The elements of P are called fuzzy atoms.
Definition 2.8. [14, Definition 4.4] Let L = (X, A) be a fuzzy lattice. Let a, b ∈ X.
We say that a fuzzy covers b and write b ≺F a, if 0 < A(b, a) < 1 and A(b, c) > 0 and
A(c, a) > 0 imply c = a or c = b.
Lemma 2.1. [14, Lemma 4.2] If a ≺F a ∨F b and (a, b)F M then a ∧F b ≺F b.
Definition 2.9. [15, Definition 3.1] A fuzzy lattice L = (X, A) is called a fuzzy Birkhoff
lattice if in L, a ∧F b ≺F a, b implies that a, b ≺F a ∨F b for a, b ∈ X.
Definition 2.10. [16, Definition 5.1] A fuzzy lattice (X, A) with ⊥ is called fuzzy atomic
property if for a, b ∈ X with a ∧F b ̸= ⊥ then there exists a fuzzy atom p ∈ X such that
⊥ ≺F p and A(p, a ∧F b) > 0.
Corollary 2.1. [17, Corollary 3] Let (X, A) be a fuzzy lattice and a, b, c, d ∈ X. If
A(c, a) > 0 and A(d, b) > 0, then A(c ∧F d, a ∧F b) > 0 and A(c ∨F d, a ∨F b) > 0.

3. Fuzzy Disjointness Properties in Fuzzy Lattices

Wasadikar et. al. [14] and Khubchandani et. al. [4] have proved results related to fuzzy
modular and fuzzy ⊥-distributive lattice. Their work has motivated us to introduce and
study fuzzy general disjointness property in fuzzy lattice.
Definition 3.1. A fuzzy lattice (X, A) with ⊥ is said to have fuzzy general disjointness
property (FGD), if a ∧F b = ⊥ and (a ∨F b) ∧F c = ⊥ then a ∧F (b ∨F c) = ⊥, for all
a, b, c ∈ X.
Definition 3.2. A fuzzy lattice (X, A) with ⊥ is said to have fuzzy atomic disjointness
property (FAD) if for fuzzy atom p ∈ X, ⊥ ≺F p, a ∧F b = ⊥ and (a ∨F b) ∧F p = ⊥ then
a ∧F (b ∨F p) = ⊥ for all a, b ∈ X.
Definition 3.3. A fuzzy lattice (X, A) with ⊥ is said to have fuzzy atomic exchange
property (FAE) if for fuzzy atoms p, q ∈ X, ⊥ ≺F p, ⊥ ≺ q, a ∧F p = ⊥, A(p, a ∨F q) > 0
then A(q, a ∨F p) > 0, for a ∈ X.
Definition 3.4. A fuzzy lattice (X, A) with ⊥ is said to have fuzzy atomic covering prop-
erty (FAC) if for fuzzy atom p ∈ X,⊥ ≺F p and a ∧F p = ⊥, then a ≺F a ∨F p for
a ∈ X.
Remark 3.1. Fuzzy atomic disjoint property is implied by the fuzzy atomic covering which
in turns fulfilled in fuzzy Birkhoff lattice property.
Definition 3.5. [2, Definition 3.12] A fuzzy lattice (X, A) is called fuzzy modular if
A(c, b) > 0 implies c ∨F (a ∧F b) = (c ∨F a) ∧F b for a, b, c ∈ X.
An immediate consequence of the fuzzy modularity is the following result.
Definition 3.6. Let (X, A) be a fuzzy lattice with ⊥. (X, A) is said to be fuzzy ⊥-modular
if for a, b, c ∈ X, a ∧F b = ⊥ and A(c, b) > 0 together imply (c ∨F a) ∧F b = c.
Dually, we have the concept of fuzzy ⊤-modular lattice.
Lemma 3.1. Every fuzzy modular lattice is fuzzy ⊥-modular lattice.
Proof. Proof follows from the definition. □
In the following example we show that the converse of above Lemma 3.1 is not true.
4 TWMS J. APP. ENG. MATH. [Link], [Link], 20XX

Example 3.1. Let X = {⊥, a, b, c, ⊤}. Define a fuzzy relation A : X × X −→ [0, 1] on X

as follows such that
A(⊥, ⊥) = A(a, a) = A(b, b) = A(c, c) = A(⊤, ⊤) = 1,
A(⊥, a) = 0.6, A(⊥, b) = 0.6, A(⊥, c) = 0.6, A(⊥, ⊤) = 0.6,
A(a, ⊥) = 0, A(a, b) = 0, A(a, c) = 0, A(a, ⊤) = 0.04,
A(b, ⊥) = 0, A(b, a) = 0, A(b, c) = 0.3, A(b, ⊤) = 0.04,
A(c, ⊥) = 0, A(c, a) = 0, A(c, b) = 0, A(c, ⊤) = 0.04,
A(⊤, ⊥) = 0, A(⊤, a) = 0, A(⊤, b) = 0, A(⊤, c) = 0.
This fuzzy relation is shown in the following table:

A ⊥ a b c ⊤
⊥ 1.0 0.6 0.6 0.6 0.6
a 0.0 1.0 0.0 0.0 0.04
b 0.0 0.0 1.0 0.3 0.04
c 0.0 0.0 0.0 1.0 0.04
⊤ 0.0 0.0 0.0 0.0 1.0
The fuzzy join and fuzzy meet tables are as follows:
∨F ⊥ a b c ⊤ ∧F ⊥ a b c ⊤
⊥ ⊥ a b c ⊤ ⊥ ⊥ ⊥ ⊥ ⊥ ⊥
a a a ⊤ ⊤ ⊤ a ⊥ a ⊥ ⊥ a
b b ⊤ b c ⊤ b ⊥ ⊥ b b b
c c ⊤ c c ⊤ c ⊥ ⊥ b c c
⊤ ⊤ ⊤ ⊤ ⊤ ⊤ ⊤ ⊥ a b c ⊤
We note that (X, A) is a fuzzy lattice.
As a ∧F c = ⊥, A(b, c) > 0 and (b ∨F a) ∧F c = b.
Hence (X, A) is fuzzy ⊥-modular lattice.
As A(b, c) > 0 but (b ∨F a) ∧F c = c ̸= b ∨F (a ∧F c) = b.
Hence (X, A) is not fuzzy modular lattice.
Therefore (X, A) is Fuzzy ⊥-modular lattice but not fuzzy modular lattice.
Remark 3.2. A fuzzy modular lattice (X, A) with ⊥ also satisfies the fuzzy disjointness
property.
In the Remark below we show that a weaker assumption is sufficient.
Remark 3.3. Let L = (X, A) be a fuzzy lattice with ⊥. Let a, b ∈ X. We say (a, b) is a
fuzzy ⊥-modular pair if every disjoint pair (a, b) is fuzzy modular or in other words, if it
satisfies the condition a ∧F b = ⊥, A(c, b) > 0 implies c = (a ∨F c) ∧F b.
Theorem 3.1. Let (X, A) be a fuzzy lattice with ⊥. A fuzzy ⊥-modular lattice has the
fuzzy disjointness property.
Proof. Let (X, A) be a ⊥-modular lattice and let a, b, c be elements of X with a ∧F b = ⊥
and (a ∨F b) ∧F c = ⊥.
If we denote d = (a ∨F b) ∧F (b ∨F c) then by (iii) of Proposition 2.1 we have A(b, d) > 0
and A(d, b ∨F c) > 0. Taking join c on both sides we get
A(b ∨F c, d ∨F c) > 0 (1)
and
A(d ∨F c, b ∨F c) > 0. (2)
 ...: SOME PROPERTIES OF FUZZY... 5

From (1) and (2) by fuzzy antisymmetry of A we get b ∨F c = d ∨F c.

On the other hand A(d, a ∨F b) > 0.
Taking meet c on both sides we get A(d ∧F c, (a ∨F b) ∧F c) > 0 i.e.
A(d ∧F c, ⊥) > 0. (3)
And
A(⊥, d ∧F c) > 0 (4)
always holds.
From (3) and (4) by fuzzy antisymmetry of A we get d ∧F c = ⊥.
By assumption (c, d) is fuzzy ⊥-modular pair, so that b = (b ∨F c) ∧F d = d.
Finally we get
a ∧F (b ∨F c) = a ∧F d = a ∧F b = ⊥
which proves the assertion. □
Proposition 3.1. If (X, A) is a fuzzy lattice with ⊥ satisfies FAD, then it satisfies FAE.
In fuzzy atomic lattice FAD and FAE are equivalent.
Proof. Let (X, A) satisfies FAD. Assume that a ∧F p = ⊥ and A(p, a ∨F q) > 0 for fuzzy
atoms p, q ∈ X. If (a ∨F p) ∧F q = ⊥, then ⊥ = p ∧F (a ∨F q) = p by FAD, which is
impossible. Hence A(q, a ∨F p) > 0 and thus the condition FAE is fulfilled.
Assume (X, A) is fuzzy atomic and satisfies FAE. Let a ∧F b = ⊥ and (a ∨F b) ∧F p = ⊥
for a fuzzy atom p ∈ X. If a ∧F (b ∨F p) ̸= ⊥, then there exists a fuzzy atom q ∈ X such
that A(q, a ∧F (b ∨F p)) > 0. Since A(q, b ∨F p) > 0 and b ∧F p = ⊥, then A(p, b ∨F q) > 0
by FAE and so A(p, b ∨F a) > 0, a contradiction. Hence a ∧F (b ∨F p) = ⊥ and FAD is
satisfied. □
Proposition 3.2. A fuzzy modular lattice with a fuzzy least element satisfies FGD.
Proof. Let L = (X, A) be a fuzzy modular lattice with fuzzy least element ⊥.
Let a, b, c ∈ X with a ∧F b = ⊥ and (a ∨F b) ∧F c = ⊥. We have to show that the element
d = a ∧F (b ∨F c) (5)
is ⊥. By using modularity we get
b ∨F c = (a ∨F b ∨F c) ∧F (b ∨F c),
= {(a ∨F b) ∨F c} ∧F (b ∨F c),
= {(a ∨F b) ∧F (b ∨F c)} ∨F {c ∧F (b ∨F c)},
= {(a ∨F b) ∧F (b ∨F c)} ∨F c, by absorption
= e ∨F c
i.e.,
b ∨F c = e ∨F c (6)
where e = (a ∨F b) ∧F (b ∨F c). On the other hand
e ∧F c = (a ∨F b) ∧F (b ∨F c) ∧F c,
= (a ∨F b) ∧F c, by absorption
e ∧F c = ⊥, as (a ∨F b) ∧F c = ⊥
i.e.,
e ∧F c = ⊥. (7)
6 TWMS J. APP. ENG. MATH. [Link], [Link], 20XX

Hence again by modularity

e = e ∧F (e ∨F c),
= e ∧F (b ∨F c), by (6)
= b ∨F (e ∧F c), by modularity i.e., e ∧F (c ∨F b) = (e ∧F c) ∨F b
= b ∨F ⊥, by (7)
=b
By (5) we get
A(d, a) > 0. (8)
As A(a, a ∧F e) > 0 and b = e we get
A(a, a ∧F b) > 0. (9)
From (8) and (9) by fuzzy transitivity we get A(d, a ∧F b) > 0. But a ∧F b = ⊥.
Therefore we get
A(d, ⊥) > 0. (10)
As
A(⊥, d) > 0 (11)
always holds.
Therefore from (10) and (11) we get d = ⊥.
Putting d = ⊥ in (5) we get a ∧F (b ∨F c) = ⊥. □
Definition 3.7. A fuzzy lattice (X, A) is called fuzzy sectionally complemented lattice(FSC)
if it satisfies the following condition:
If for a ∈ X with 0 < A(a, ⊤) < 1, then there exists a fuzzy atom p ∈ X such that
a ∧F p = ⊥.
Proposition 3.3. A fuzzy sectionally complemented lattice satisfying FGD is fuzzy ⊥-
modular pair.
Proof. Let (X, A) be a FSC lattice satisfying FGD. Let a, b, c ∈ X.
To show that (a, b) is a fuzzy ⊥-modular pair, that is (c ∨F a) ∧F b = c ∨F (a ∧F b) for
every A(c, b) > 0.
Case i) Assume that a ∧F b = ⊥.
If A(c, b) > 0, then A(c ∨F (a ∧F b), (c ∨F a) ∧F b) > 0.
As a ∧F b = ⊥ so we have A(c, (c ∨F a) ∧F b) > 0.
′ ′ ′
By the assumption there exists an element c ∈ X with c∧F c = ⊥ and c∨F c = (c∨F a)∧F b.
Taking meet a on both sides we get
′
(c ∨F c ) ∧F a = {(c ∨F a) ∧F b} ∧F a,
= (c ∨F a) ∧F b ∧F a,
= (c ∨F a) ∧F ⊥, as a ∧F b = ⊥
=⊥
′
i.e., (c ∨F c ) ∧F a = ⊥.
′ ′
Applying the property to the triplet (c , c, a) we get c ∧F (c ∨F a) = ⊥. As
′ ′
A(c , (c ∨F c ) ∧F a) > 0 (12)
and
′ ′
A((c ∨F c ) ∧F a, c ∧F c ) > 0. (13)
 ...: SOME PROPERTIES OF FUZZY... 7

′
But c ∨F c = (c ∨F a) ∧F b. Therefore (13) reduces to
′
A((c ∨F c ) ∧ a, (c ∨F a) ∧F b) > 0. (14)
′
From (12) and (14) by fuzzy transitivity of A we get A(c , (c ∨F a) ∧F b) > 0.
But (c ∨F a) ∧F b = ⊥. Therefore
′
A(c , ⊥) > 0. (15)
As
′
A(⊥, c ) > 0 (16)
always holds.
′
Therefore form (15) and (16) we get c = ⊥. Hence c = (c ∨F a) ∧F b and (a, b) is a fuzzy
⊥-modular pair.
Case ii) Let a, b ∈ X and A(c, b) > 0. Let the element d ∈ X with d = a ∧F b has a
′ ′ ′
complement d ∈ X such that A(⊥, d ) > 0 and A(d , a) > 0. Since
′ ′
d ∧F b = d ∧F a ∧F b,
′
= d ∧F d,
=⊥
′
This shows that (d , b) is fuzzy ⊥-modular pair.
Using this and the observations A(c ∨F d, b) > 0 we get
′
(c ∨F a) ∧F b = (c ∨F d ∨F d ) ∧F b,
′ ′
= (c ∨F d) ∨F (d ∧F b), (d , b) is fuzzy ⊥-modular pair.
= (c ∨F d) ∨F ⊥,
= c ∨F d,
= c ∨F (a ∧F b), as d = a ∧F b
Hence (a, b) is a fuzzy ⊥-modular pair. □
Khubchandani and Khubchandani [4] defined fuzzy ⊥-distributive lattices in fuzzy lat-
tices. Using the same idea of FGD we define fuzzy ⊥-general disjointness property (⊥-
FGD), fuzzy ⊥-atomic disjointness (⊥-FAD) and fuzzy ⊥-atomic exchange (⊥-FAE).
Definition 3.8. A fuzzy lattice (X, A) with ⊥ is called fuzzy ⊥-general disjointness prop-
erty (⊥-FGD) if a ∧F b = ⊥ and (a ∨F b) ∧F c = ⊥ imply a ∧F (b ∨F c) = ⊥, for all
a, b, c ∈ X.
Definition 3.9. A fuzzy lattice (X, A) with ⊥ is called fuzzy ⊥-atomic disjointness (⊥-
FAD) if for a fuzzy atom p ∈ X, ⊥ ≺F p, a ∧F b = ⊥ and (a ∨F b) ∧F p = ⊥ imply
a ∧F (b ∨F p) = ⊥, for all a, b ∈ X.
Definition 3.10. A fuzzy lattice (X, A) with ⊥ is called fuzzy ⊥-atomic exchange (⊥-
FAE) if for fuzzy atoms p, q ∈ X, ⊥ ≺F p, ⊥ ≺F q, a ∧F p = ⊥ and A(p, a ∨F q) > 0
imply A(q, a ∨F p) > 0 for a ∈ X.
Proposition 3.4. Let (X, A) be a fuzzy lattice with ⊥. If (X, A) is FAD then (X, A) is
FAE. If (X, A) is fuzzy atomic lattice then fuzzy ⊥-FAD and fuzzy ⊥-FAE are equivalent
conditions.
Proof. Proof follows along the same lines as the proof of Proposition 3.1. □
8 TWMS J. APP. ENG. MATH. [Link], [Link], 20XX

Theorem 3.2. If a fuzzy complemented lattice is both fuzzy ⊥-distributive and fuzzy ⊥-
modular, then it is fuzzy distributive.
Proof. Let (X, A) be a fuzzy complemented lattice which is both fuzzy ⊥-distributive and
fuzzy ⊥-modular.
We first show that (X, A) is fuzzy modular.
Let a, b, c ∈ X with A(c, b) > 0 and let d = (a ∧F b) ∨F c and e = (a ∨F c) ∧F b. We have
′ ′
to show that d = e. Let d be fuzzy complement of d. The element b ∧F d is disjoint from
a and d, hence also from
a ∨F d = a ∨F c (17)
by fuzzy ⊥-distributivity.
′ ′
d ∧F e = d ∧F (a ∨F c) ∧F b,
′
= (b ∧F d ) ∧F (a ∨F c),
′
= (b ∧F d ) ∧F (a ∨F d), from (17)
=⊥
′
The fuzzy ⊥-modularity of (X, A) implies now that the pair (d , e) is ⊥-modular and hence
′
d = (d ∨F d ) ∧F e = ⊤ ∧F e = e.
Hence (X, A) is fuzzy modular.
If (X, A) is not fuzzy distributive. Let a, b, c, d, e ∈ X with
d = a ∧F b = a ∧F c = b ∧F c
and
e = a ∨F b = a ∨F c = b ∨F c.
′ ′
Let c be a fuzzy complement of c. The element b ∧ c is then disjoint from a and c,
′ ′
hence also from a ∨F c = e. This means that b ∧F c = ⊥. Further, e ∧F c = ⊥, by
fuzzy ⊥-distributivity again and thus c = e by fuzzy ⊥-modularity. This is however a
contradiction and thus (X, A) is distributive. □

4. Fuzzy Disjointness Properties in Fuzzy Semi-complemented Lattices

The notion of fuzzy Birkhoff lattice, introduced by Wasadikar and Khubchandani [15],
has motivated us to introduce and study fuzzy disjointness in Fuzzy Semi-complemented
lattices. In this section, we will prove that a fuzzy complemented ⊥-modular lattice is
fuzzy Birkhoff lattice.
Theorem 4.1. Let (X, A) be a fuzzy section semicomplemented lattice(FSSC). If (X, A)
has the fuzzy atomic disjointness property, then it has fuzzy atomic covering property(FAC).
If (X, A) is fuzzy atomic, then it is fuzzy Birkhoff lattice.
Proof. Let p ∈ X be fuzzy atom with ⊥ ≺F p and a ∧F p = ⊥.
We have to prove that a ≺F a ∨F p. Suppose there is an element b ∈ X such that
0 < A(a, b) < 1 and 0 < A(b, a ∨F p) < 1. As (X, A) is FSSC, there is a non-zero element
c ∈ X such that A(c, b) > 0 with c ∧F a = ⊥. By Corollary 2.1 we get A(a ∨F c, b) > 0.
Taking meet p on both sides we get
A((a ∨F c) ∧F p, b ∧F p) > 0. (18)
But b ∧F p = ⊥. Therefore (18) reduces to
A((a ∨F c) ∧F p, ⊥) > 0. (19)
 ...: SOME PROPERTIES OF FUZZY... 9

As
A(⊥, (a ∨F c) ∧F p) > 0 (20)
always holds.
Therefore from (19) and (20) by fuzzy antisymmetry we get (a ∨F c) ∧F p = ⊥.
By using fuzzy atomic disjointness property we obtain
c ∧F (a ∨F p) = ⊥ or c = ⊥,
Which is a contradiction. Hence (X, A) satisfies the fuzzy atomic covering property.
Let now (X, A) be fuzzy atomic and let a ∧F b ≺F b.
As fuzzy section semi-complemented and fuzzy atomic lattices are fuzzy atomistic, there
is fuzzy atom p ∈ X such that A(p, b) > 0 with (a ∧F b) ∧F p = ⊥.
Since b covers a ∧ b, it follows that b = (a ∧F b) ∨F p and since (X, A) has fuzzy atomic
covering property, we obtain a ≺F a∨F p which implies a∨F p = a∨F (a∧F b)∨F p = a∨F b.
This proves that (X, A) is fuzzy Birkhoff lattice. □
Corollary 4.1. A fuzzy atomistic lattice (X, A) with the fuzzy exchange property is fuzzy
Birkhoff lattice.
Proof. A fuzzy atomistic lattice is both fuzzy atomistic and fuzzy section semi-complemented.
Moreover by Propostion 3.1, a fuzzy atomistic lattice has the fuzzy atomic disjointness
property whenever it has the atomic exchange property. □

We define fuzzy strong neat using the terminology of Stern [11].

Definition 4.1. A fuzzy lattice (X, A) is strong neat if for every pair (a, b) with a ≺F b
there is a fuzzy atom p ∈ X such that a ∨F p = b.
Theorem 4.2. Let (X, A) be a fuzzy lattice. If a fuzzy strongly neat lattice has the fuzzy
atomistic covering property, then it is fuzzy Birkhoff lattice.
Proof. Let (X, A) be a fuzzy lattice. In a fuzzy strongly neat lattice (X, A) with the fuzzy
atomic covering property. Let a ∧F b ≺F b. Since (X, A) is fuzzy strongly neat, there is
an fuzzy atom p ∈ X such that (a ∧F b) ∨F p = b. Now a ∧F p = ⊥ and hence a ≺F a ∨F p,
by the fuzzy atomic covering property. Since a ∨F p = a ∨F (a ∧F b) ∨F p = a ∨F b, we
have proved that (X, A) fuzzy Birkhoff lattice. □
Theorem 4.3. Let (X, A) be a fuzzy lattice. If fuzzy section semi-complemented lattice
has the disjointness property, then it is fuzzy ⊥-modular and fuzzy Birkhoff lattice.
Proof. Let (X, A) be a fuzzy section semicomplemented lattice with fuzzy disjointess prop-
erty. Let a ∧F b = ⊥ and A(c, b) > 0 for a, b, c ∈ X.
Similarly as in the first part of Theorem 4.1 it can be shown that the element c ∈ X
cannot have any non-zero fuzzy complement in (a ∨F c) ∧F b.
Thus c = (a ∨F c) ∧F b, and disjoint pair (a, b) is fuzzy modular. This shows that (X, A)
is fuzzy ⊥-modular.
To show that (X, A) is fuzzy Birkhoff lattice.
Let a ∧ b ≺F b and d = a ∧F b. As (X, A) is fuzzy section semicomplemented, there is a
non-zero element c ∈ X such that d ∧F c = ⊥ and A(c, b) > 0.
Since b fuzzy covers d it follows that b = d ∨F c. By fuzzy ⊥-modularity (c, d) is a modular
pair and thus by Lemma 2.1, the element c is a fuzzy atom. Since now a ∨F b = a ∨F c,
the assertion a ≺F a ∨F b follows from the fuzzy atomic covering property implied by the
fuzzy ⊥-modularity. □
10 TWMS J. APP. ENG. MATH. [Link], [Link], 20XX

Now we shall prove that a fuzzy complemented ⊥-modular lattice is fuzzy Birkhoff
lattice.
Corollary 4.2. A fuzzy complemented ⊥-modular lattice is fuzzy Birkhoff lattice.
Proof. It is sufficient to note that a complemented ⊥-modular lattice (X, A) is fuzzy
′
section semicomplemented. If 0 < A(a, b) < 1 and a is a complement of a, then by fuzzy
′
⊥-modularity, the element b ∧F a is non-zero and is thus fuzzy semicomplement of a in
b. □

5. Conclusions
In this paper, we have presented the concept of the fuzzy general disjointness property,
along with its corresponding notation. We also defined several related concepts, includ-
ing fuzzy atomic disjointness property, fuzzy atomic exchange property, and fuzzy atomic
covering property, and explored the relationships among them. Furthermore, we demon-
strated that if a fuzzy section semi-complemented lattice possesses the fuzzy disjointness
property, it will necessarily be both fuzzy ⊥-modular and a fuzzy Birkhoff lattice.
References
[1] Ajmal, N. and Thomas, K., (1994), Fuzzy lattices, Information Sc., 79, pp. 271-291.
[2] Chon, I., (2009), Fuzzy partial order relations and fuzzy lattices, Korean J. Math., 17 (4), pp. 361-374.
[3] Khubchandani, P. and Khubchandani, J., Fuzzy Perspectivity in Fuzzy Lattices (Accepted by Journal
of Algebraic Systems)
[4] Khubchandani, P. and Khubchandani, J., (2025), Characterizations of Fuzzy ⊥-⊤ Distributive Lattice
in Fuzzy Lattices, TWMS J. App. and Eng. Math., 15 (2), pp. 377-386
[5] Mezzomo, I., Bedregal, B. and Santiago, R., (2012), On fuzzy ideals of fuzzy lattices, IEEE International
Conference on Fuzzy Systems, pp. 628-642.
[6] Mezzomo, I., Bedregal, B. and Santiago, R., (2013), Operations on bounded fuzzy lattices, IFSA
World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), pp. 151-156. doi:10.1109/IFSA-
NAFIPS.2013.6608391
[7] Mezzomo, I., Bedregal, B. and Santiago, R., (2014), On some operations on bounded fuzzy lattices,
The Journal of Fuzzy Mathematics, 22 (4), pp. 853-878. doi: 10.1109/FUZZ-IEEE.2012.6251307
[8] Mezzomo, I., Bedregal, B. and Santiago, R., (2015), Types of fuzzy ideals in fuzzy lattices, J. Intelligent
and Fuzzy Systems, 28 (2), pp. 929-945. doi: 10.3233/IFS-141374
[9] Rosenfeld, A., (1971), Fuzzy groups, J. Math. Anal. Appl., 35, pp. 512–517.
[Link]
[10] Saarimäki, M. and Sorjonen, P., (1991), On Banaschewski functions in lattices, Alg. Univ., 28, pp.
103-118.
[11] Stern, M., (1984), On atomistic algebraic lattices with covering property, Beiträge Alg. Geom., 17,
pp. 71-82.
[12] Varlet, J., (1968), A generalization of the notion of Pseudo-complementedness, Bull. Soc. Roy. Sci.
Liège, 36, pp. 149-158.
[13] Waphare, B. and Joshi, V., (2005), On Uniquely Complemented Posets, Order, 22, pp. 11-20.
[14] Wasadikar, M. and Khubchandani, P., (2019), Fuzzy modularity in fuzzy lattices, The Journal of
Fuzzy Mathematics, 27 (4), pp. 985-998.
[15] Wasadikar, M. and Khubchandani, P., (2022), Fuzzy modularity and complement in fuzzy lattices,
TWMS J. App. and Eng. Math., 12 (4), pp. 1368-1379.
[16] Wasadikar, M. and Khubchandani, P., (2023), Fuzzy semi-orthogonality in fuzzy lattices, Journal of
Hyperstructures, 12 (1), pp. 78–90.
[17] Wasadikar, M. and Khubchandani, P., (2022), Fuzzy distributive pairs in fuzzy lattices, Discussiones
Mathematicae General Algebra and Applications, 42(1), pp. 179–199.
[18] Zadeh, L., (1965), Fuzzy sets, Information and control, 8, pp. 338-353.
[19] Zadeh,L., (1971), Similarity relations and fuzzy orderings, Information Sc., 3, pp. 177-200.