In Kaye, Laflamme and Mosca (2007) pg106 they write the following (in the context of Simon's algorithm):
...where $S=\{\mathbf{0},\mathbf{s}\}$ is a $2$-dimensional vector space spanned by $\mathbf{s}$.
this is not the only place I have seen this vector space referred to as "2-dimensional". But surely the fact that it is only spanned by one vector, $\mathbf{s}$, means (by definition) that it is only "1-dimensional"?
Am I missing something here or is the use of the term "dimension" different in this area?
More Context
As mentioned above the context is Simon's Algorithm. I.e. there exists a oracle $f:\{0,1\}^n\rightarrow \{0,1\}^n$ such that $f(x)=f(y)$ if and only if $x=y\oplus \mathbf{s}$ where $\mathbf{s}\in \{0,1\}^n$ and $\oplus$ is addition in $\Bbb{Z}_2^n$ (i.e. bit-wise). The aim of the algorithm is to find $\mathbf{s}$.
After applying a relevant circuit the output is a uniform distribution of $\mathbf{z}\in \{0,1\}^n$ such that $\mathbf{z}\cdot\mathbf{s}=z_1s_1+z_2s_2\cdots+ z_ns_n=0$. The statement I have quoted above is refering to the fact that since $\mathbf{0}$ and $\mathbf{s}$ are are solution to this problem you only need $n-1$ linearly independent vectors $\mathbf{z}$ to find $\mathbf{s}$.
Edit
The term is also used in the same context at the end of Pg 4 of this pdf (Wayback Machine version).