3.4: Inner Product Spaces
- Page ID
- 96154
\( \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{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)We have discussed the inner product (or dot product) between two column matrices. Recall that the inner product between, say, two three-by-one column matrices
\[\text{u}=\left(\begin{array}{c}u_1\\u_2\\u_3\end{array}\right),\quad\text{v}=\left(\begin{array}{c}v_1\\v_2\\v_3\end{array}\right)\nonumber \]
is given by
\[\text{u}^{\text{T}}\text{v}=u_1v_1+u_2v_2+u_3v_3.\nonumber \]
We now generalize the inner product so that it is applicable to any vector space, including those containing functions.
We will denote the inner product between any two vectors \(\text{u}\) and \(\text{v}\) as \((\text{u}, \text{v})\), and require the inner product to satisfy the same arithmetic rules that are satisfied by the dot product. With \(\text{u}\), \(\text{v}\), \(\text{w}\) vectors and \(c\) a scalar, these rules can be written as
\[(\text{u},\text{v})=(\text{v},\text{u}),\quad (\text{u}+\text{v},\text{w})=(\text{u},\text{w})+(\text{v},\text{w}),\quad (\text{cu},\text{v})=\text{c}(\text{u},\text{v})=(\text{u},\text{cv});\nonumber \]
and \((\text{u},\text{u})\geq 0\), where the equality holds if and only if \(\text{u}=0\).
Generalizing our definitions for column matrices, the norm of a vector \(\text{u}\) is defined as
\[||\text{u}||=(\text{u},\text{u})^{1/2}.\nonumber \]
A unit vector is a vector whose norm is one. Unit vectors are said to be normalized to unity, though sometimes we just say that they are normalized. We say two vectors are orthogonal if their inner product is zero. We also say that a basis is orthonormal (as in an orthonormal basis) if all the vectors are mutually orthogonal and are normalized to unity. For an orthonormal basis consisting of the vectors \(v_1,\: v_2,\cdots , v_n\), we write
\[(v_i,v_j)=\delta_{ij},\nonumber \]
where \(\delta_{ij}\) is called the Kronecker delta, defined as
\[\delta_{ij}=\left\{\begin{array}{ll}1,&\text{if }i=j; \\ 0,&\text{if }i\neq j.\end{array}\right.\nonumber \]
Oftentimes, basis vectors are used that are orthogonal but are normalized to other values besides unity.
Define an inner product for \(\mathbb{P}_n\).
Solution
Let \(p(x)\) and \(q(x)\) be two polynomials in \(\mathbb{P}_n\). One possible definition of an inner product is given by
\[(p,q)=\int_{-1}^1 p(x)q(x)dx.\nonumber \]
You can check that all the conditions of an inner product are satisfied.
Show that the first four Legendre polynomials form an orthogonal basis for \(\mathbb{P}_3\) using the inner product defined above.
Solution
The first four Legendre polynomials are given by
\[P_0(x)=1,\quad P_1(x)=x,\quad P_2(x)=\frac{1}{2}(3x^2-1),\quad P_3(x)=\frac{1}{2}(5x^3-3x),\nonumber \]
and these four polynomials form a basis for \(\mathbb{P}_3\). With an inner product defined on \(\mathbb{P}_n\) as
\[(p,q)=\int_{-1}^1p(x)q(x)dx,\nonumber \]
it can be shown by explicit integration that
\[(P_m,P_n)=\frac{2}{2n+1}\delta_{m,n},\nonumber \]
so that the first four Legendre polynomials are mutually orthogonal. They are normalized so that \(P_n(1) = 1\).
Define an inner product on \(\mathbb{P}_n\) such that the Hermite polynomials are orthogonal.
Solution
For instance, the first four Hermite polynomials are given by
\[H_0(x)=1,\quad H_1(x)=2x,\quad H_2(x)=4x^2-2,\quad H_3(x)=8x^3-12x,\nonumber \]
which also form a basis for \(\mathbb{P}_3\). Here, define an inner product on \(\mathbb{P}_n\) as
\[(p,q)=\int_{-\infty}^\infty p(x)q(x)e^{-x^2}dx.\nonumber \]
It can be shown that
\[(H_m,H_n)=2^n\pi^{1/2}n!\delta_{m,n},\nonumber \]
so that the Hermite polynomials are orthogonal with this definition of the inner product. These Hermite polynomials are normalized so that the leading coefficient of \(H_n\) is given by \(2^n\).


