The lattice of closure relations on a poset (Q690091): Difference between revisions

The author investigates closure relations on finite posets. Main results: 1. The partial order of all closure relations on a finite poset \(P\) forms a lattice \(LC(P)\). The lattice \(LC(P)\) is supersolvable, i.e. it contains a maximal chain of modular elements. 2. Assume \(P\) has the greatest element 1. Then a closure relation \(H\) on \(P\) is a modular element of \(LC(P)\) iff \(H\) has the following cover property: For all \(x,y\in P\), if \(y\) covers \(x\) and \(H(x)\neq x\), then \(H(y)=H(x)\). 3. The lattice \(LC(P)\) is dually isomorphic to the lattice of closed sets in a convex geometry. 4. The characteristic polynomial of the lattice \(LC(P)\) is computed.