= Orthogonal polynomial
{title2=$\langle p_n,p_k\rangle_w=h_n\delta_{nk}$}
{wiki}
An <orthogonal polynomial> family chooses <polynomials> that do not overlap under a specified <inner product>. For real <polynomials> on an interval $(a,b)$, use the <weighted inner product>
$$
\langle p,q\rangle_w=\int_a^b p(x)q(x)w(x)\,dx,\qquad \|p\|_w^2=\langle p,p\rangle_w.
$$
Assume $a<b$, the weight $w$ is measurable and positive <almost everywhere>, and its absolute moments $\int_a^b |x|^k w(x)\,dx$ are finite for every <integer> $k\geq0$. These conditions make the <integrals> finite and give every nonzero <polynomial> positive squared <norm>. A sequence $p_0,p_1,\ldots$ is an <orthogonal polynomial> family when $p_n$ has real <coefficients> and <polynomial degree> exactly $n$, and $\langle p_n,p_k\rangle_w=0$ for $n\ne k$.<NIST Digital Library of Mathematical Functions/18 Orthogonal Polynomials>[NIST Digital Library of Mathematical Functions; Koornwinder, Wong, Koekoek, Swarttouw and Reinhardt, NIST DLMF Chapter 18, §18.2(i), equations 18.2.1 and 18.2.1_5: interval orthogonality and finite absolute moments]{ref}
Here $h_n=\|p_n\|_w^2>0$ and $\delta_{nk}$ is the <Kronecker delta>. <Orthogonality> does not require $h_n=1$: an <orthonormal set> is obtained only after replacing $p_n$ by $p_n/\sqrt{h_n}$. Multiplying each member by any nonzero real constant preserves <orthogonality>, but changes its <norm> and the corresponding expansion <coefficient>. The <monic orthogonal polynomial> convention instead fixes each leading <coefficient> to one.
The first four <Legendre polynomials>, named for <Adrien-Marie Legendre>, use $w=1$ on $[-1,1]$ and the normalization $P_n(1)=1$:
$$
P_0(x)=1,\qquad P_1(x)=x,\qquad P_2(x)=\frac{3x^2-1}{2},\qquad P_3(x)=\frac{5x^3-3x}{2}.
$$
Their <orthogonality> and squared <norms> are
$$
\int_{-1}^1 P_n(x)P_k(x)\,dx=\frac{2}{2n+1}\delta_{nk}.
$$
Thus their <Gram matrix> has a positive diagonal and zero entries elsewhere, although their <function graphs> cross and overlap on the page. <Orthogonality> measures an <integral> of products, rather than separation of <function graphs>.<NIST Digital Library of Mathematical Functions/18 Orthogonal Polynomials>[NIST Digital Library of Mathematical Functions; Koornwinder and collaborators, NIST DLMF Chapter 18, Table 18.3.1, Legendre row: interval, unit weight, squared norm and normalization]{ref}
\Image[/legendre-polynomial-shapes-and-gram-matrix.png]
{title=The first four Legendre polynomials and their exact integral Gram matrix: orthogonal, with unequal squared norms}
For these four <polynomials>, a short verification expands each product and uses $\int_{-1}^1x^{2j+1}\,dx=0$ and $\int_{-1}^1x^{2j}\,dx=2/(2j+1)$. For example, $\langle P_0,P_2\rangle=(3(2/3)-2)/2=0$ and $\langle P_1,P_3\rangle=(5(2/5)-3(2/3))/2=0$. The same calculation gives the diagonal entries $2,2/3,2/5,2/7$. More generally, apply the <Gram-Schmidt process> to the <monomial basis> $1,x,x^2,\ldots$: at step $n$, subtract projections onto the earlier <polynomials>. The result retains its leading term, has degree $n$, and has positive <norm>, proving existence without a differential equation. Different degrees also give <linear independence>, so $p_0,\ldots,p_m$ form a <basis> of the <polynomials> of degree at most $m$.
This <basis> turns <least-squares solutions> for <functions> into independent scalar calculations, as the <decoupled coefficients of orthogonal polynomial projections> show. In a <spectral method>, increasing the degree enlarges the approximation space while keeping earlier projection <coefficients> fixed. Weighted <integrals> also connect the same <orthogonal polynomials> to <Gaussian quadrature>: its nodes are <polynomial roots> of a member of the family. The projection problem minimizes an integrated squared error; <Gaussian quadrature> uses the family to choose evaluation points for an <integral>.
Back to article page