Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Examples from Rank-nullity

All examples from Rank-nullity.

Back to Rank-nullity

Kernel and image bases of a matrix

Consider

A=(1012011−11121).A= \begin{pmatrix} 1&0&1&2\\ 0&1&1&-1\\ 1&1&2&1 \end{pmatrix}.

The third row is the sum of the first two. Replacing R3R_3 by R3−R1−R2R_3-R_1-R_2 therefore gives a zero row, leaving pivots in columns 11 and 22. To find the kernel, let x3=λ3x_3=\lambda_3 and x4=λ4x_4=\lambda_4. The first two equations give

x1=−λ3−2λ4,x2=−λ3+λ4.x_1=-\lambda_3-2\lambda_4, \qquad x_2=-\lambda_3+\lambda_4.

Therefore a basis for the kernel is

{(−1−110),(−2101)}.\left\{ \begin{pmatrix} -1\\-1\\1\\0 \end{pmatrix}, \begin{pmatrix} -2\\1\\0\\1 \end{pmatrix} \right\}.

The pivot positions are in columns 11 and 22, so the corresponding columns of the original matrix give a basis for the image. (Their leading coordinates also make their linear independence immediate.)

{(101),(011)}.\left\{ \begin{pmatrix} 1\\0\\1 \end{pmatrix}, \begin{pmatrix} 0\\1\\1 \end{pmatrix} \right\}.

Hence nullity⁡(A)=2\operatorname{nullity}(A)=2, rank⁡(A)=2\operatorname{rank}(A)=2 and

rank⁡(A)+nullity⁡(A)=2+2=4,\operatorname{rank}(A)+\operatorname{nullity}(A)=2+2=4,

the number of columns.

Kernel basis of a row-echelon matrix

Consider the row-echelon matrix

A=(1234571500016826000019370000001800000000).A= \begin{pmatrix} 1&2&3&4&5&7&1&5\\ 0&0&0&1&6&8&2&6\\ 0&0&0&0&1&9&3&7\\ 0&0&0&0&0&0&1&8\\ 0&0&0&0&0&0&0&0 \end{pmatrix}.

The leading columns are 1,4,5,71,4,5,7, so the free variables are x2,x3,x6,x8x_2,x_3,x_6,x_8. Set

x2=a,x3=b,x6=c,x8=d.x_2=a,\qquad x_3=b,\qquad x_6=c,\qquad x_8=d.

Solving Ax=0Ax=0 from the bottom non-zero row upwards gives

x7=−8d,x5=−9c+17d,x4=46c−92d,x_7=-8d,\qquad x_5=-9c+17d,\qquad x_4=46c-92d,

The fourth row gives x7=−8dx_7=-8d and substituting this into the third row gives x5=−9c+17dx_5=-9c+17d. The second row then gives x4x_4 in the same way.

Finally, the first row gives

x1=−2a−3b−146c+286d.x_1=-2a-3b-146c+286d.

Setting each free parameter in turn to 11 and the others to 00 gives one kernel basis vector per free variable. Thus a basis for the kernel is

{(−21000000),(−30100000),(−1460046−9100),(28600−92170−81)}.\left\{ \begin{pmatrix} -2\\1\\0\\0\\0\\0\\0\\0 \end{pmatrix}, \begin{pmatrix} -3\\0\\1\\0\\0\\0\\0\\0 \end{pmatrix}, \begin{pmatrix} -146\\0\\0\\46\\-9\\1\\0\\0 \end{pmatrix}, \begin{pmatrix} 286\\0\\0\\-92\\17\\0\\-8\\1 \end{pmatrix} \right\}.

Because the displayed matrix is already row-echelon, no row operation has changed its columns. Its pivot columns therefore give a basis for the image:

{(10000),(41000),(56100),(12310)}.\left\{ \begin{pmatrix}1\\0\\0\\0\\0\end{pmatrix}, \begin{pmatrix}4\\1\\0\\0\\0\end{pmatrix}, \begin{pmatrix}5\\6\\1\\0\\0\end{pmatrix}, \begin{pmatrix}1\\2\\3\\1\\0\end{pmatrix} \right\}.

There are four pivot and four free columns, so

rank⁡(A)=4,nullity⁡(A)=4.\operatorname{rank}(A)=4,\qquad \operatorname{nullity}(A)=4.

General solution of an inhomogeneous system

For

A=(1012011−11121),b=(314),A= \begin{pmatrix} 1&0&1&2\\ 0&1&1&-1\\ 1&1&2&1 \end{pmatrix}, \qquad b= \begin{pmatrix} 3\\1\\4 \end{pmatrix},

take x3=λ3x_3=\lambda_3 and x4=λ4x_4=\lambda_4. Solving the first two equations gives

x1=3−λ3−2λ4,x2=1−λ3+λ4.x_1=3-\lambda_3-2\lambda_4, \qquad x_2=1-\lambda_3+\lambda_4.

Therefore

x=(3100) ⁣+λ3(−1−110) ⁣+λ4(−2101),λ3,λ4∈R.x= \begin{pmatrix} 3\\1\\0\\0 \end{pmatrix} \!+\lambda_3 \begin{pmatrix} -1\\-1\\1\\0 \end{pmatrix} \!+\lambda_4 \begin{pmatrix} -2\\1\\0\\1 \end{pmatrix}, \qquad \lambda_3,\lambda_4\in\mathbb R.

The two direction vectors are the kernel basis found in the first example and the constant vector is a particular solution: Axp=bAx_p=b.

Differentiation on polynomial spaces

Over R\mathbb R and for n≥1n\ge1, consider

D:Pn→Pn−1,D(p)=dp(x)dx.D:P_n\to P_{n-1}, \qquad D(p)=\frac{dp(x)}{dx}.

For p1,p2∈Pnp_1,p_2\in P_n and λ∈R\lambda\in\mathbb R,

D(p1+p2)=D(p1)+D(p2),D(λp1)=λD(p1),D(p_1+p_2)=D(p_1)+D(p_2), \qquad D(\lambda p_1)=\lambda D(p_1),

so DD is a linear map. If

p(x)=c0+c1x+⋯+cnxn,p(x)=c_0+c_1x+\cdots+c_nx^n,

then

D(p)=c1+2c2x+⋯+ncnxn−1.D(p)=c_1+2c_2x+\cdots+n c_nx^{n-1}.

Its kernel consists of the constant polynomials:

ker⁡(D)={α:α∈R}=span⁡{1}.\ker(D)=\{\alpha:\alpha\in\mathbb R\} =\operatorname{span}\{1\}.

Thus nullity⁡(D)=1\operatorname{nullity}(D)=1. Since dim⁡(Pn)=n+1\dim(P_n)=n+1, rank-nullity gives

rank⁡(D)=n.\operatorname{rank}(D)=n.

The image is Pn−1P_{n-1}: every polynomial of degree at most n−1n-1 has a polynomial antiderivative in PnP_n. Hence its dimension is also nn, agreeing with the rank calculation.

On this page