Let V be a n-dimensional vector space over a finite field F with p elements.

A k-dimensional space is spanned by k independent vectors. As shown in my previous reply to your post (link), there are choices for picking k-independent vectors from an n-dimensional space. Among them, we should consider the cases for which k-independent vectors span the same subspace. Two sets of k-independent vectors span the same subspace W of V if and only if they are both bases of the k-dimensional space W. The number of distinct bases for the k-dimensional space W is We divide by in order to get the number of subspaces of an n-dimensional vector space V of dimension k ( ).

is the required number of subspaces of an n-dimensional vector space V of dimension k.

For your problem, , n=3 and p = 5. You can compute the number of subspaces for k=1, 2 using the above formula.

Below is a simple example that you can easily check.

Let where .

There are six distinct basis for W.

{(1,0)(0,1)}, {(1,0),(1,1)}, {(0,1),(1,0)}, {(0,1),(1,1)} {(1,1)},{(0,1)}, {(1,1), (1,0)}

Note that the above is an ordered basis, which implies that {(1,0)(0,1)} and {(0,1),(1,0)} are not the same.

Now consider and 2-dimensional subspace W of V. Assume W is spanned by two independent vectors . The number of distinct choices of basis for is , since V contains 8 vectors including 0. This number should be divided by 6, because each 6 distinct basis (shown in the above example) basically span the same subspace. Thus, the number of subspace W of dimension 2 in V of dimension 3 is 42/6=7 (They are both vector spaces over ).