nLab
completely prime filter

Recall that a filter F on a lattice L is called prime if F and, whenever xyF, then xF or yF. In other words, for every finite index set I, x kF for some k whenever k:Ix iF.

We now generalise from finitary joins to arbitrary joins: A filter F on a complete lattice L is completely prime if, for any index set I whatsoever, x kF for some k whenever k:Ix iF. Equivalently, a completely prime filter is given by a simlutaneous suplattice and lattice homomorphism from L to the lattice TV of truth values (which is classically the boolean domain 𝟚).

In particular, if L is a frame, then a completely prime filter of L is given by a frame homomorphism from L to TV. Thinking of L as a locale, this is the same as a point of L.