\(*\)-independent subsets in modular lattices of breadth two (Q1332973): Difference between revisions

As a weaker version of weak independence, \textit{G. Czédli} and the author [ibid. 53, 169-171 (1989; Zbl 0679.06002)] introduced the notion of \(*\)-independence. Let \(L\) be a lattice and let \(H\) be a subset of \(L\). \(H\) is called \(*\)-independent if whenever \(h,h_ 1,\dots, h_ k\in H\) and \(h_ 1\vee\cdots\vee h_ k= h\), then \(h= h_ i\) for some \(1\leq i\leq k\). A maximal \(*\)-independent subset is called a \(*\)-basis of \(L\). If \(L\) is of finite length then any maximal chain and \(J(L)\), the set of all join-irreducible elements, are \(*\)-bases of \(L\). It was proved by Czédli and the author [loc. cit.] that if \(L\) is a finite distributive lattice and \(H\) is a \(*\)-basis of \(L\), then \(H\) has at least as many elements as any maximal chain, i.e., \(| H|\geq \ell(L)+ 1\) where \(\ell(L)\) is the length of \(L\). The authors also asked whether the same was true for modular lattices. Here we give a partial answer for modular lattices of breadth two.