zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Semiprime ideals in general lattices. (English) Zbl 0665.06006

An ideal of a lattice L is called semiprime if for every x,y,zL, whenever xyI and xzI, then x(yz)I. Semiprime filters are dually defined.

Main Theorem. Let L be a lattice and I an ideal of L. The following conditions are equivalent: (1) I is semiprime. (2) I is the kernel of some homomorphism of L onto a distributive lattice with zero. (3) I is the kernel of a homomorphism of L onto a semiprime lattice (if the zero ideal is semiprime).

The following Birkhoff-Stone prime separation theorem generalization is obtained: Corollary. The following statements are equivalent in Zermelo- Fraenkel set theory (without Choice): (a) The Ultrafilter Principle. (b) If a lattice L contains an ideal I and a filter F which are disjoint and such that either I or F is semiprime, then there exists a partition of L by a prime ideal P and a prime filter Q=L-P such that IP and FQ·

Moreover, the author proves several other results such as: Theorem 4.2. Every semiprime ideal of a lattice is representable as an intersection of prime ideals iff the Ultrafilter Principle holds. Theorem 5.2. A lattice is distributive iff, for every ideal I and filter F of L such that IF=, there is an ideal J and a filter G of L such that IJ, FG, JG=, and either J or G is semiprime.

Reviewer: G.Călugăreanu

06B10Ideals, etc. (lattices)