Semimodular lattices and the Hall-Dilworth gluing construction (Q532072): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 00:32, 5 March 2024

scientific article
Language Label Description Also known as
English
Semimodular lattices and the Hall-Dilworth gluing construction
scientific article

    Statements

    Semimodular lattices and the Hall-Dilworth gluing construction (English)
    0 references
    26 April 2011
    0 references
    A gluing construction for lattices has been defined by \textit{M. Hall} and \textit{R. P. Dilworth} [Ann. Math. (2) 45, 450--456 (1944; Zbl 0060.06102)]. Another gluing construction was described by the author in a previous paper [Algebra Univers. 64, No. 1--2, 101--102 (2010; Zbl 1207.06007)]. Here, the lattices \(L\) and \(K\) under consideration are assumed to be semimodular of finite length and \(C\) be a maximal chain in \(L\); the result of gluing of \(L\) and \(K\) over \(C\) is denoted by \(L\cup_C K\). The main result of the paper under review is the following theorem. Under the notation as above, let \(G=L\cup_C K\). Then \(G\) is the cover-preserving join-homomorphic image of a semimodular lattice \(H\), \(\psi \colon H\rightarrow G\), such that: (1) \(H\) is the Hall-Dilworth gluing of the semimodular lattices \(P\) and \(K\) over a chain isomorphic to \(C\); (2) \(P\) is the direct power of a chain isomorphic to \(C\); (3) \(L\) is the cover-preserving join-homomorphic image of \(P\), \(\varphi \colon P\rightarrow L\); (4) the restriction of \(\psi \) to the filter \(P\) of \(H\) is \(\varphi\) and the restriction to \(K\) is the identity.
    0 references
    0 references
    semimodular lattice
    0 references
    maximal chain
    0 references
    gluing construction
    0 references
    cover-preserving join homomorphism
    0 references
    0 references

    Identifiers