Scinovex
article Open Access

On fuzzy sublattice of a lattice

T KannanS Mohanavalli

Abstract

The definition of fuzzy sublattice of a lattice and its properties are discussed. Characterization is given through level sublattice of that lattice. The concepts of fuzzy sublattice and level sublattice are studied and their properties are discussed. The characterization Theorem of a fuzzy sublattice is presented through the level sublattice. The concept of level sublattice of a lattice is studied. Then the necessary and sufficient condition of a fuzzy subset of a lattice to be a fuzzy sublattice of that lattice is proved. Further, the necessary and sufficient condition of equality of two level sublattices in a family of level sublattices is obtained. The union and intersection of two level sublattices are defined. Also, the complement of a level sublattice is defined. Then a chain of level sublattices of a fuzzy sublattice is obtained. The relation between a non-empty subset of a lattice and the fuzzy sublattice of the lattice, defined in terms of that subset, is established. We made an attempt to study the algebraic nature of fuzzy subset of lattice especially fuzzy sublattice, by using the ideas of fuzzy theory and lattice theory.

Full Text

Tables and figures are in the full-text PDF.

Introduction

The notion of fuzzy sets was introduced by Lofti. A. Zadeh in 1965. Zadeh had initiated fuzzy set theory as a modification of the ordinary set theory. The concept of lattice was first defined by Dedekind in 1897, and then developed by Birkhoff G. in 1933. Here we made an attempt to study the algebraic nature of fuzzy subset of lattice especially fuzzy sublattice, by using the ideas of fuzzy theory and lattice theory.

Preliminaries

Some well -known definitions and preliminary results are recalled Definition 1.1 A relation defined on a set S which is reflexive, antisymmetric and transitive is called a partial ordering on S. A set S with a partial ordering  defined on it is called a partially ordered set or a poset and is denoted by (S, ).

Definition 1.2

Let (P, ≤) be a poset. Let A be a non-empty subset of P.An element u  P is called an upper bound of A if a ≤ u for all aA. An element u P is called the least upper bound (l.u.b) of A if 1. u is an upper bound of A. 2. if v is any other upper bound of A, then u ≤ v.

An element l P is called the lower boundof A if l ≤ a for all a A. An element l  P is called the greatest lower bound (g.l.b) of A if 1. l is an lower bound of A. 2. if m is any other lower bound of A, then m ≤ l.

Definition 1.3

A lattice is a poset in which any two elements have a g.l.b and a l.u.b. We denote the l.u.b of a ˅ b and g.l.b by a ˄ b.

Consider the function, µ(x)

where s, t  [0, 1], s > t.

Assume that µ is a fuzzy sublattice of L. Then, 1. µ(x  y) ≥ min {µ(x), µ(y)} 2. µ(x  y) ≥ min {µ(x), µ(y)}  To prove H is a sublattice of L.

 Let a, b  H be arbitrary.  This proves that H is a sublattice of L.

Theorem: 2.6

If H is any sublattice of a lattice L, H  L, then the fuzzy subset µ of L defined by µ(x)

Where s, t[0, 1], s > t is a fuzzy sublattice of L.

Proof

Let H be any sublattice of a lattice L, H  L. Consider the fuzzy subset µ of L, defined by µ(x)

 To prove µ is a fuzzy sublattice of L.

It is enough to prove that

We prove this in three cases

Here, x, y  H That is, ¥H

If a nonempty subset H of a lattice L, is a sublattice of L, then ¥H is a fuzzy sublattice of L.

From theorem 2.5 and theorem 2.6, we have, Theorem: 2.9 Let H be any nonempty subset of a lattice L, H  L. Let µ be any fuzzy subset of L defined by µ(x)

Where s, t[0, 1], s > t. Then µ is a fuzzy sublattice of L if and only if, H is a sublattice of L.

Here, the concept of level sublattice of a lattice is studied. Then the necessary and sufficient condition of a fuzzy subset of a lattice to be a fuzzy sublattice of that lattice is proved. Further, the necessary and sufficient condition of equality of two level sublattices in a family of level sublattices is obtained.

Proposition: 2.10

Let µ be any fuzzy sublattice of L. Then the level subsets µt, t Im µ are sublattices of L.

Theorem: 2.11 [Characterization Theorem]

A fuzzy subset µ of a lattice L, is a fuzzy sublattice of L if and only if, the level subsetsµt, t Im µ are sublattices of L.

Proof

 First part is shown Proposition 2.10.

 Conversely,assume that the level subsets µt, t Im µ are sublattices of L.

 To prove: µ is a fuzzy sublattice of L.

 Let x, y  L be arbitrary.  µ(xy) ≥ r; µ(xy) ≥ r -------- ( 1)

To prove µ(xy) ≥ min {µ(x), µ(y)}.

That is to prove s1 ≥ r Suppose s1< r. ------------- (3)

From ( 2) and ( 3), we have, µ(xy) = s1< r.

 µ(xy) < r, which is a contradiction to (1).

Theorem: 2.16

Let µ be any fuzzy sublattice of a lattice L. Let µt and µs be any two level sublattices of µ. Then µt  µs and µt  µs are also level sublattices of µ.

Proof

Let µ be any fuzzy sublattices of a lattice L. Let µt and µs be any two level sublattices of µ.  µt and µs are sublattices of L.

To prove (i) µt µs and (ii) µt µs are level sublattices of µ. That is to prove:µt µs and µt µs are sublattices of L.

For (i)

Let x, y  µt µs be arbitrary.

 x, y L such that µ(x) ≥ min {t, s} and µ(y) ≥ min {t, s} ------------- ( 1)

 xy, xy  µt, since µt is a sublattice of L.

 xy, xy  L such that µ(xy) ≥ t; µ(xy) ≥ t.

 xy, xy  L such that µ(xy) ≥ min {t, s}; µ(xy) ≥ min {t, s}, by the assumption in this case.

Hence µt µs is a sublattice of L. Thus, µt µs is a level sublattice of µ. Hence µt µs is a sublattice of L.Thus, µt µs is a level sublattice of µ.

For (ii)

Again, let x, y  µt µs be arbitrary.

 x  L such that µ(x) ≥ max {t, s} and y L such that µ(y) ≥ max {t, s}-- ( 2)

References

  1. Ajmal N, Thomas KV. Fuzzy lattices. Inform Sci. 1994;79:271-291.
  2. Ali T, Ray AK. Fuzzy sublattices and fuzzy ideals. FSAI. 2004;10(1-2):5-13.
  3. Birkhoff G. On the lattice theory of ideals. Bull Am Math Soc. 1934;40:613-619.
  4. Birkhoff G, Frink O. Representations of lattices by sets. Trans Am Math Soc. 1948;64:299-316.
  5. Dixit VN, Kumar R, Ajmal N. Level subgroups and union of fuzzy subgroups. Fuzzy Sets Syst. 1990;37:359-371.
  6. Gratzer G. General lattice theory. Basel: Birkhauser Verlag; 1978.
  7. Hashimoto J. Ideal theory for lattices. Math Jpn. 1952;2:149-186.
  8. Mohanavalli S. On fuzzy prime filters of a lattice. Int J Appl Math Sci. 2016;9(1):45-59.
  9. Mordeson JN, Malik DS. Fuzzy commutative algebra. Singapore: World Scientific Publishing Co.; 1998.
  10. Nanda S. Fuzzy lattice. Bull Cal Math Soc. 1989;81:201-202.
  11. Rosenfeld A. Fuzzy groups. J Math Anal Appl. 1971;35:512-517.
  12. Seselja B. Lattice of partially ordered fuzzy subalgebras. Fuzzy Sets Syst. 1996;81:265-269.
  13. Seselja B, Tepavcevic A. Representation of lattices by fuzzy sets. Inform Sci. 1994;79:171-180.
  14. Seselja B, Tepavcevic A. On a representation of posets by fuzzy sets. Fuzzy Sets Syst. 1998;98:127-132.
  15. Seselja B, Tepavcevic A. Representing ordered structures by fuzzy sets: an overview. Fuzzy Sets Syst. 2003;136:21-39.
  16. Swamy UM, Raju DV. Algebraic fuzzy systems. Fuzzy Sets Syst. 1991;41:187-194.
  17. Tepavcevic A, Trajkovski G. L-fuzzy lattices: an introduction. Fuzzy Sets Syst. 2001;123:209-216.
  18. Yuan B, Wu W. Fuzzy ideals on a distributive lattice. Fuzzy Sets Syst. 1990;35:231-240.
  19. Zadeh LA. Fuzzy sets. Inform Control. 1965;8:338-353.
  20. Zimmermann HJ. Fuzzy set theory and its applications. Dordrecht: Kluwer/Nijhoff; 1985.
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
75%
vs. same field & year
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.