Sublattices of lattices of convex subsets of vector spaces
Texte intégral
Documents relatifs
It is well-known that one of the disconcerting facts in the theory of infinite-dimensional compact convex sets is that the closure of a face need not be a face.. The main purpose
In order to guarantee that the resulting partial order remains a lattice, we need to enforce two properties about C. The first one says that if the join of two.. For this, it
Using polytopal approximations we extend our results to general convex sets, and we achieve the minimax rate up to a logarithmic factor.. In addition we provide an estimator that
What is the minimum positive integer n such that every set of n points in general position in R d has the property that the convex hulls of all k-sets do not have a transversal (d
(6) All finite subdirectly irreducible members of SUB( LO ) are projective within SUB( LO ) (Theorem 12.4), and every subquasivariety of SUB( LO ) is a variety (Theorem 12.5).. The
Lattices of clopen sets for poset and semilattice type Some of the results that we have established in earlier sections, in the partic- ular cases of semilattices (Reg S and Clop S)
Lattice, complete, ideal, filter, upper continuous, lower continuous, al- gebraic, dually algebraic, join-dependency, lower bounded, fermentable, dually zipper distributive,
On the other hand, it follows from Theorem 7.7(iii) that if a finite lattice L without D-cycle embeds into some Co(P), then it embeds into Co(R) for some finite, tree-like poset R..