Recall that a filter on a lattice is called prime if and, whenever , then or . In other words, for every finite index set , for some whenever .
We now generalise from finitary joins to arbitrary joins: A filter on a complete lattice is completely prime if, for any index set whatsoever, for some whenever . Equivalently, a completely prime filter is given by a simultaneous suplattice and lattice homomorphism from to the lattice of truth values (which is classically the boolean domain ).
In particular, if is a frame, then a completely prime filter of is given by a frame homomorphism from to . Thinking of as a locale, this is the same as a point of .
Last revised on November 16, 2022 at 02:28:21. See the history of this page for a list of all contributions to it.