Linear Algebra pre-requisites
- Page ID
- 155142
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\dsum}{\displaystyle\sum\limits} \)
\( \newcommand{\dint}{\displaystyle\int\limits} \)
\( \newcommand{\dlim}{\displaystyle\lim\limits} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\(\newcommand{\longvect}{\overrightarrow}\)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\ket}[1]{\left| #1 \right>}\)
\(\newcommand{\bra}[1]{\left< #1 \right|}\)
\(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
\(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
\(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
\(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
\(\newcommand{\expect}[1]{\langle #1 \rangle}\)
\(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)
We say that \(\mathbf{b}_{\mathbf{1}}, \ldots, \mathbf{b}_{\mathbf{n}}\) are linearly independent if \(
c_1 \mathbf{b}_{\mathbf{1}}+c_2 \mathbf{b}_{\mathbf{2}}+\ldots+c_n \mathbf{b}_{\mathbf{n}}=d_1 \mathbf{b}_{\mathbf{1}}+d_2 \mathbf{b}_{\mathbf{2}}+\ldots+d_n \mathbf{b}_{\mathbf{n}} \text { implies } c_1=d_1, c_2=d_2 \ldots, c_n=d_n\) or, equivalently,\(\mathbf{b}_{\mathbf{1}}, \ldots, \mathbf{b}_{\mathbf{n}}\) are linearly independent if \(
c_1 \mathbf{b}_{\mathbf{1}}+c_2 \mathbf{b}_{\mathbf{2}}+\ldots+c_n \mathbf{b}_{\mathbf{n}}=0 \text { implies } c_1=c_2=\ldots =c_n=0 \text {. }
\)
Example 1: Lets look at the vectors \(\mathbf{b}_{\mathbf{1}}=(1,0,0), \mathbf{b}_{\mathbf{2}}=(0,1,0), \mathbf{b}_{\mathbf{3}}=(0,0,1)\) . Observe that if \( a\mathbf{b}_{\mathbf{1}} + b\mathbf{b}_{\mathbf{2}} + c\mathbf{b}_{\mathbf{3}} = (1,2,3), \text{ then } a=1, b=2, \text{ and } c=3 \) and there is no other values for \(a,b, \text{ and } c \) to give the vector \((1,2,3)\). Next let's for the same values of \(\mathbf{b}_{\mathbf{1}}, \mathbf{b}_{\mathbf{2}}, \text{ and }\mathbf{b}_{\mathbf{3}}\), the only values of \(a,b, \text{ and } c \) such that \( a\mathbf{b}_{\mathbf{1}} + b\mathbf{b}_{\mathbf{2}} + c\mathbf{b}_{\mathbf{3}} = (0,0,0)\) is \(a=0, b=0, \text{ and } c=0. \) Therefore vectors \(\mathbf{b}_{\mathbf{1}}=(1,0,0), \mathbf{b}_{\mathbf{2}}=(0,1,0), \mathbf{b}_{\mathbf{3}}=(0,0,1)\) are linearly independent.
Example 2: \(\mathbf{b}_{\mathbf{1}}=1, \mathbf{b}_{\mathbf{2}}=t, \mathbf{b}_{\mathbf{3}}=t^2\).
\[
1+2 t+3 t^2 \neq 1+2 t+4 t^2 .
\]
If \(a+b t+c t^2=1+2 t+3 t^2\) then \(a=1, b=2, c=3\).
Application: Partial Fractions
\[
\frac{4}{\left(x^2+1\right)(x-3)}=\frac{A x+B}{x^2+1}+\frac{C}{x-3}
\]
If you don't like denominators, get rid of them:
\[
\begin{aligned}
& 4=(A x+B)(x-3)+C\left(x^2+1\right) \\
4= & A x^2+B x-3 A x-3 B+C x^2+C \\
4= & (A+C) x^2+(B-3 A) x-3 B+C
\end{aligned}
\]
I.e., \(0 x^2+0 x+4=(A+C) x^2+(B-3 A) x-3 B+C\)
Thus \(0=A+C, \quad 0=B-3 A, \quad 4=-3 B+C\).
\[
C=-A, \quad B=3 A, 4=-3(3 A)+-A \Rightarrow 4=-10 A \text {. }
\]
Hence \(A=-\frac{2}{5}, B=3\left(-\frac{2}{5}\right)=-\frac{6}{5}, C=\frac{2}{5}\).
Thus,
\[
\begin{aligned}
\frac{4}{\left(x^2+1\right)(x-3)} & =\frac{-\frac{2}{5} x-\frac{6}{5}}{x^2+1}+\frac{\frac{2}{5}}{x-3} \\
& =\frac{-2 x-6}{5\left(x^2+1\right)}+\frac{2}{5(x-3)}
\end{aligned}
\]
Alternatively, can plug in \(x=3\) to quickly find \(C\) and then solve for \(A\) and \(B\). We can also use matrices to solve linear equations.


