[Math] complement of sum equals intersection of complements

linear algebra

I have difficulties with the following exercise:

We have two subspaces of $F^n$, $A_1$ and $A_2$. Prove the following statement:

$$(A_1 + A_2)^{\perp} = A_1^{\perp} \cap A_2^{\perp}$$

To my understanding, the sum of two subspaces is defined as follows:

If $A_1$ and $A_2$ are subspaces of some vector space $V$, then $A_1 + A_2 = \{a_1 + a_2 \mid a_1 \in A_1, a_2 \in A_2\}$

The intersection of two subspaces is simply the set of elements (vectors in the case of subspaces) that are in both $A_1$ and $A_2$.

The orthogonal complement of a subspace $A_1$ is the subspace $A_1^\perp$ that contains the vectors orthogonal to all the vectors in $A_1$.

I'm pretty sure I grasp all of these concepts, but I still am blank when it comes to this proof. I also have trouble visualizing why it would be true, but maybe that's an unnecessary luxury anyway. How does this proof work?

Best Answer

Suppose $v\in A_1^{\perp}\cap A_2^{\perp}$. Then $v\cdot a_1=v \cdot a_2=0$ for all $a_1 \in A_1$ and all $a_2 \in A_2$. Then for all $a_1+a_2 \in A_1+A_2$, $v\cdot (a_1+a_2)=v\cdot a_1+v \cdot a_2=0+0=0$. Thus $v\in (A_1+A_2)^{\perp}$.

Conversely, if $v\not\in A_1^{\perp}\cap A_2^{\perp}$ then without loss of generality let $v\not\in A_1^{\perp}$. Then there is $a_1\in A_1$ with $v\cdot a_1 \neq 0$. We know $0\in A_2$, so $v\cdot (a_1 +0)=v\cdot a_1 \neq 0$. Thus $v \not \in v\in (A_1+A_2)^{\perp}$.