Direct sum of two subspace Given the definition on textbook: Let $V$ be a subspace of $\mathbb R^n.$ Every vector $u \in \mathbb R^n$ can be written uniquely as $u = n + p.$ I still don't understand what it means because i am ask to do with a question that ask me the prove the uniqueness claim in the definition. 
The question is asking: 
Let $v\in \mathbb R^n$. Suppose $p_1, p_2 \in V$ and $n_1,n_2 \in V^\bot$ are such that $v=p_1+n_1 = p_2 + n_2.$ Prove that $p_1 = p_2$ and $n_1 = n_2$. 
Anyone can help me answer to this question? 

Let's look at an easy example.
Let $n=2$ and $V= <\begin{pmatrix} 1\\0 \end{pmatrix}>$. Then $V^{\perp}=<\begin{pmatrix} 0\\1 \end{pmatrix}>$. Now pick some $x\in\mathbb{R}^2$, say, $x=\begin{pmatrix} x_1\\ x_2 \end{pmatrix}$. Then $x=n+p$ where $n=x_1\begin{pmatrix} 1\\0 \end{pmatrix}\in V$ and $p=x_2\begin{pmatrix} 0\\1 \end{pmatrix}\in V^{\perp}$. The theorem tells you that these are your only choices of $n$ and $p$ such that $x=n+p$. 
Now to the proof: 
Let $v=n_1+p_1$ and $v=n_2+p_2$. where $n_i\in V$ and $p_i\in V^{\perp}$ for $i=1,2$. Then $$0=(p_1-p_2)+(n_1-n_2)$$. Since $V$ and $V^{\perp}$ are subspaces of $\mathbb{R}^n$, we have that $p_1-p_2\in V$ and $n_1-n_2\in V^{\perp}$. By definition of $V$ and $V^{\perp}$, we get that $p_1-p_2 \perp n_1-n_2$. But if two vectors are orthogonal, they must be linearly independent. Hence we have that 0 is written as a linear combination of two linearly independent vectors, hence these two vectors must be zero, yielding $p_1-p_2=0$ and $n_1-n_2=0$ which proves that they were the same.
