A converse to the Sholander embedding (Q1174172): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1042320
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Melvin F. Janowitz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medians in median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of ordered sets in problems of comparison and consensus of classifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formal Theory of Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median procedure in cluster analysis and social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semilattice of weak orders of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medians, Lattices, and Trees / rank
 
Normal rank

Latest revision as of 08:52, 15 May 2024

scientific article
Language Label Description Also known as
English
A converse to the Sholander embedding
scientific article

    Statements

    A converse to the Sholander embedding (English)
    0 references
    25 June 1992
    0 references
    A median semilattice is a meet semilattice \(M\) such that (i) every principal lower end \((x]=\{a\in M; y\leq x\}\) is a distributive lattice and (ii) any three elements of \(M\) have an upper bound whenever each pair of them have an upper bound. \textit{M. Sholander} [Proc. Am. Math. Soc. 5, 808--812 (1954; Zbl 0056.26201)] proved that any median semilattice \(M\) may be embedded into a distributive lattice \(L\) in such a way that \(M\) is a lower end in \(L\) and every element of \(L\) is the join of finitely many elements of \(M\). The converse is not true in general: Not every lower set of a distributive lattice need be a median semilattice. Example: Let \(L\) be the power set lattice of \(\{a,b,c\}\) and put \(M:=L\backslash\{a,b,c\}\); then \(M\) is obviously a lower end in \(L\), but the singleton sets have no upper bound in \(M\) while any two of them have. The present paper provides several equivalent conditions for a lower set \(M\) of a distributive lattice \(L\) which (singly) guarantee that \(M\) is indeed a median semilattice under the meet operation inherited from \(L\).
    0 references
    order ideal
    0 references
    median semilattice
    0 references
    meet semilattice
    0 references
    lower end
    0 references
    distributive lattice
    0 references
    0 references

    Identifiers