mu-filters of Almost Distributive Lattices

Authors

  • Noorbhasha Rafi
  • Ravi Kumar Bandaru

Keywords:

Almost Distributive Lattice(ADL), mu-filter, Co-dense, minimal prime filter, dual annihilator filter, Boolean algebra

Abstract

The concept of gif.latex?\mu-filters is introduced in an Almost Distributive Lattice(ADL) and studied their properties in terms of dual annihilator filters of an ADL. Observed that the set of all dual annihilator filters of an ADL forms a complete Boolean algebra. Derived equivalent conditions for every filter of an ADL becomes a dual annihilator filter by assuming the property that every proper filter is non co-dense. Also, observed that gif.latex?\mu is homomorphism of gif.latex?F(L) in to gif.latex?I(\mathfrak{A}^{+}(L)). Characterized gif.latex?\mu-filter in element wise and veried that every minimal prime filter of an ADL is a gif.latex?\mu-filter. Finally, we proved that the intersection of all prime gif.latex?\mu-filters is the set of all maximal elements of an ADL.

Downloads

Published

2019-12-22

Issue

Section

Research Articles