Any nonvoid lattice of subspaces from R(n) is known to be a complete l
attice, and hence it has a largest and smallest element. Here we show
that for a specific class of subspaces also the converse is true. If t
his class has a largest and a smallest element, then it is a complete
lattice. Within the context of algebraic Riccati equations, it follows
that the usual classes of real symmetric and positive semidefinite so
lutions are lattices if and only if these classes contain extremal ele
ments, and if this is the case, then these lattices are modular, yet n
ot necessarily distributive, as is demonstrated by a counterexample.