Minimum Cutsets for an Element of a Subspace Lattice over a Finite Vector Space

Let L_n(q) denote the lattice of subspaces of ann-dimensional vector space over the finite field of q elements, ordered byinclusion. In this note, we prove that for all n and m the minimum cutsetfor an element A with is justL(A) if m < n/ 2, is U(A) if m > n/ 2, and both L(A) andU(A) if m = n/ 2, where L(A) is the collection of all such that and, and U(A) the collection of all such that and. Hence a finite vector space analog isgiven for the theorem of Griggs and Kleitman that determines all the minimumcutsets for an element of a Boolean algebra.