Computing the similarity between a vector a and this subspace B is computationally more expensive than for the negation of Theorem 1, because the scalar product of a with (up to) n vectors in an orthogonal basis for B must be computed.
the gain we get by comparing each document with the query a NOT b using only one scalar product operation is absent for disjunction.