## Annihilators in modular lattices.(English)Zbl 0613.06004

For elements a, b of a lattice L, the (dual) annihilator is $<a,b>_ d:=<x\in L| \quad x\vee a\geq b\}\quad and\quad <a,b>:=\{x\in L| \quad x\wedge a\leq b\}.$ The annihilator $$<a,b>$$ is called prime if $$<a,b>\cup <b,a>_ d=L$$ and $$<a,a\wedge b>\cap <a\wedge b,a>_ d=\emptyset$$. The Prime-Annihilator Condition for L requires that every annihilator is an intersection of prime annihilators. The authors prove an analogue of the result that a lattice is distributive iff every ideal is an intersection of prime ideals: A lattice is modular and weakly atomic iff it satisfies the Prime-Annihilator Condition. For finite distributive lattices prime ideals and prime annihilators coincide. A lattice is modular iff its lattice of ideals satisfies the Prime- Annihilator Condition.
Reviewer: G.Kalmbach

### MSC:

 06B05 Structure theory of lattices 06B10 Lattice ideals, congruence relations 06D05 Structure and representation theory of distributive lattices 06C05 Modular lattices, Desarguesian lattices
Full Text:

### References:

 [1] R. Beazer,Hierarchies of distributive lattices satisfying annihilator conditions, J. London Math. Soc. (2)11 (1975), 216-222. · Zbl 0335.06008 [2] W. H. Cornish,Normal lattices, J. Austral. Math. Soc.14 (1972), 200-215. · Zbl 0247.06009 [3] W. H. Cornish,n-Normal lattices, Proc. Amer. Math. Soc.45 (1974), 48-54. · Zbl 0294.06008 [4] W. H. Cornish,The multiplier extension of a distributive lattice, J. Algebra32 (1974), 339-355. · Zbl 0318.06016 [5] B. A. Davey,Some annihilator conditions on distributive lattices, Algebra Universalis4 (1974), 316-322. · Zbl 0299.06007 [6] M. Mandelker,Relative annihilators in lattices, Duke Math. J.40 (1970), 377-386. · Zbl 0206.29701
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.