Subspace of a Vector Space must be non-empty. I am in the process of teaching some first year students about subspaces of $\mathbb{R}^{n}$ and need to stress that to check that $V\subseteq\mathbb{R}^{n}$ is a subspace, then you need to show that it is non empty. Specifically, they know that a subset $V\subseteq \mathbb{R}^{n}$ is a subspace if and only if the following three conditions hold:


*

*$V\neq\emptyset$;

*If $x,y\in V$, then $(x+y)\in V$; and

*If $x\in V$ and $\lambda\in\mathbb{R}$, then $\lambda\cdot x\in V$.


Is there actually an example of a subset $\emptyset=V\subseteq\mathbb{R}^{n}$ that is defined by a set of conditions such that if $x$ and $y$ were to satisfy those conditions, then $(x+y)$ and $\lambda\cdot x$ would also satisfy those conditions?
Edit: So specifically, has anyone got an example of a set of conditions on the coefficients of vectors in $\mathbb{R}^{n}$ such that
$V=\left\{\left(\begin{array}{c} a_{1} \\ a_{2} \\ \vdots \\ a_{n} \end{array}\right):a_{1},\ldots,a_{n}\text{ satisfy certain conditions}\right\}=\emptyset$
but that if $(a_{1},\ldots,a_{n})^{T}$ and  $(b_{1},\ldots,b_{n})^{T}$ were to satisfy the conditions, then so would $a_{1}+b_{1}$ etc. So basically I want a set of conditions that are closed under addition and scalare multiplication, but together are inconsistent.
For example, $3\vert a_{1}$ is a condition that is closed under addition but not under scalar multiplication, $\vert a_{1}\vert \geq \vert a_{2}\vert$ is closed under scalar multiplication but not addition etc.
I hope that clarifies things a bit.
 A: I think the problem lies in the fact the zero vector is always an element of a vector space.
A: As far as I understand, you are asking for a set of conditions $\{C_i\mid i\in I\}$ on vectors in $\mathbb{R}^n$, say, such that each $V_i := \{v\in \mathbb{R}^n\mid v \;\mathrm{satisfies} \;C_i\}$ is a vector space, but $\cap_{i\in I} V_i$, i.e. the set of all vectors in $\mathbb{R}^n$ satisfying all the conditions $C_i$, is empty.
This is not possible, because every vector space contains $0$, and hence the intersection of a collection of vector spaces always contains $0$ and is therefore non-empty.
EDIT:  Or do you actually only want the $V_i$ to be closed under addition and scalar multiplication, rather than satisfy the full vector space axioms?  In that case it is still not possible, since any set closed under addition and multiplication by scalars from a field still contains $0$.
FURTHER EDIT:  What I think you possibly really mean to ask, though, is whether if $V=\emptyset$, then the conditions 2. and 3. are satisfied.  And the answer to that is yes, trivially.  The empty set has no elements, and so every statement of the form "For all $x\in \emptyset$, $P(x)$" is true.  
YET ANOTHER EDIT/QUESTION:  It just occurred to me that maybe what you are really asking for is a clever, non-obvious definition of the empty set as the set of vectors in $\mathbb{R}^n$ satisfying some set of conditions?  The bit about closure under addition etc. is a distraction if that is the case, since, as I said, the empty set will always satisfy those anyway.
A: Well, if you want your cleverly written empty set to be closed under addition (seen  simply by the given conditions, syntactically), then the $0$ will be very hard to exclude. 
As Tara B noted, the emptyset, let be defined anyhow, is for sure closed under whatever operations. So, in that, any definition of the empty set is ok, and probably the easiest to present to students is


Let $V:=\emptyset$: this satisfies conditions 2. and 3. but not 1.


Another example,  if you prefer (working over $\Bbb R$):
$$V:=\left\{\pmatrix{x\\y} \in \Bbb R^2 : x=y,\ xy<0\right\} \ . $$
A: It is rather an algebra question than a linear algebra one. In fact a subset $H$ of a given group $G$ is defined as a subgroup if the identity element of $G$ is contained in $H$. Now a subspace is first of all a subgroup, so it must respect this request, which the empty set does not. On the other hand an empty set isn't even a group.
The problem about an empty set is of a logic order. In fact you cannot affirm for example:$$\exists e \in \emptyset : \forall x \in \emptyset, x\star e=e\star x=x,$$ because there does not exist an $e\in\emptyset.$ But on the other hand you can't affirm the converse, because you don't have $x\in\emptyset$. So you can affirm everything of an empty set, which is much alike affirming nothing.
A: You can try the intuitive approach that a vector subspace may be regarded as the space of solutions of a system of homoegeneous equations, which then can never be empty (you always have the trivial solution $\vec{v}=0$). Note that a solution of non-homogeneous system is not a vector space but an affine space.
