Section 7.2

Rank and Determinants

[21/90%]
Show
LaTeX
Problem 7.2.1

Let MM be a matrix with entries in a field F\mathbf{F}. The row rank of MM over F\mathbf{F} is the maximal number of rows which are linearly independent (as vectors) over F\mathbf{F}. The column rank is similarly defined using columns instead of rows.

?
(1)

Prove row rank == column rank.

(2)

Find a maximal linearly independent set of columns of

(103−2212001−4411121012) \begin{pmatrix} 1 & 0 & 3 & -2 \\ 2 & 1 & 2 & 0 \\ 0 & 1 & -4 & 4 \\ 1 & 1 & 1 & 2 \\ 1 & 0 & 1 & 2 \end{pmatrix}

taking F=R\mathbf{F} = \mathbb {R}.

(3)

If F\mathbf{F} is a subfield of K\mathbf{K}, and MM has entries in F\mathbf{F}, how is the row rank of MM over F\mathbf{F} related to the row rank of MM over K\mathbf{K}?

Problem 7.2.2

Let the n×nn \times n real matrix AA be diagonalizable and have a one-dimensional null space. Prove that a nonzero left null vector of AA cannot be orthogonal to a nonzero right null vector of AA.

?
Problem 7.2.3

Let AA be an n×nn \times n real matrix and AtA^{t} its transpose. Show that AtAA^{t}A and AtA^{t} have the same range.

?
Problem 7.2.4

Suppose that PP and QQ are n×nn \times n matrices such that P2=PP^{2} = P, Q2=QQ^{2} = Q, and 1−(P+Q)1-(P+Q) is invertible. Show that PP and QQ have the same rank.

?
Problem 7.2.5

Let A(m,n)A(m,n) be the m×nm \times n matrix with entries

aij=ji(0≤i≤m−1, 0≤j≤n−1), a_{ij} = j^{i} \qquad (0 \leq i \leq m-1, \ 0 \leq j \leq n-1),

where 00=10^{0} = 1 by definition. Regarding the entries of A(m,n)A(m,n) as representing congruence classes (mod pp), determine the rank of A(m,n)A(m,n) over the finite field Fp=Zp\mathbf{F}_{p} = \mathbb {Z}^{p} for all m,n≥1m, n \geq 1 and all primes pp.

?
Problem 7.2.6

Let AA be an n×nn \times n matrix over a field KK. Prove that

rk⁡(A2)−rk⁡(A3)≤rk⁡(A)−rk⁡(A2) \operatorname {rk}\left(A^{2}\right)-\operatorname {rk}\left(A^{3}\right) \leq \operatorname {rk}\left(A\right)-\operatorname {rk}\left(A^{2}\right)
?
Problem 7.2.7

Let TT be a real, symmetric, n×nn \times n, tridiagonal matrix:

T=(a1b100⋯00b1a2b20⋯000b2a3b3⋯00⋮⋮⋮⋮⋱⋮⋮0000⋯an−1bn−10000⋯bn−1an) T = \begin{pmatrix} a_{1} & b_{1} & 0 & 0 & \cdots & 0 & 0 \\ b_{1} & a_{2} & b_{2} & 0 & \cdots & 0 & 0 \\ 0 & b_{2} & a_{3} & b_{3} & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & 0 & \cdots & a_{n-1} & b_{n-1} \\ 0 & 0 & 0 & 0 & \cdots & b_{n-1} & a_{n} \end{pmatrix}

(All entries not on the main diagonal or the diagonals just above and below the main one are zero.) Assume bj≠0b_{j} \neq 0 for all jj.

Prove:

?
(1)

rk⁡(T)≥n−1\operatorname {rk}\left(T\right) \geq n-1.

(2)

TT has nn distinct eigenvalues.

Problem 7.2.8

Let A=(aij)A = (a_{ij}) be an n×nn \times n real matrix satisfying the conditions:

aii>0(1≤i≤n),aij≤0(i≠j, 1≤i,j≤n),∑i=1naij>0(1≤j≤n). a_{ii} > 0 \quad (1 \leq i \leq n), \qquad a_{ij} \leq 0 \quad (i \neq j,\ 1 \leq i, j \leq n), \qquad \sum _{i=1}^{n} a_{ij} > 0 \quad (1 \leq j \leq n).

Show that det⁡(A)>0\operatorname {det}\left(A\right) > 0.

?
Problem 7.2.9

Let A=(aij)i,j=1rA = (a_{ij})_{i,j=1}^{r} be a square matrix with integer entries.

?
(1)

Prove that if an integer nn is an eigenvalue of AA, then nn is a divisor of det⁡A\det A, the determinant of AA.

(2)

Suppose that nn is an integer and that each row of AA has sum nn:

∑j=1raij=n,1≤i≤r. \sum _{j=1}^{r} a_{ij} = n, \qquad 1 \leq i \leq r.

Prove that nn is a divisor of det⁡A\det A.

Problem 7.2.10

Let AA be a symmetric n×nn \times n matrix over R\mathbb {R} of rank n−1n-1. Prove there is a kk in {1,2,…,n}\left\{ 1,2,\ldots ,n\right\} such that the matrix resulting from deletion of the kk-th row and kk-th column from AA has rank n−1n-1.

?
Problem 7.2.11

Let Rx1,…,xn\mathbb {R}^{x_{1}, \ldots , x_{n}} be the polynomial ring over the real field R\mathbb {R} in the nn variables x1,…,xnx_{1}, \ldots , x_{n}. Let the matrix AA be the n×nn \times n matrix whose ii-th row is (1,xi,xi2,…,xin−1)(1, x_{i}, x_{i}^{2}, \ldots , x_{i}^{n-1}), i=1,…,ni = 1, \ldots , n. Show that

det⁡A=∏i>j(xi−xj). \det A = \prod _{i>j}(x_{i}-x_{j}).
?
Problem 7.2.12

A matrix of the form

(1a0a02⋯a0n1a1a12⋯a1n⋮⋮⋮⋱⋮1anan2⋯ann) \begin{pmatrix} 1 & a_{0} & a_{0}^{2} & \cdots & a_{0}^{n} \\ 1 & a_{1} & a_{1}^{2} & \cdots & a_{1}^{n} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 1 & a_{n} & a_{n}^{2} & \cdots & a_{n}^{n} \end{pmatrix}

where the aia_{i} are complex numbers, is called a Vandermonde matrix.

?
(1)

Prove that the Vandermonde matrix is invertible if a0,a1,…,ana_{0}, a_{1}, \ldots , a_{n} are all different.

(2)

If a0,a1,…,ana_{0}, a_{1}, \ldots , a_{n} are all different, and b0,b1,…,bnb_{0}, b_{1}, \ldots , b_{n} are complex numbers, prove that there is a unique polynomial ff of degree nn with complex coefficients such that f(a0)=b0,f(a1)=b1,…,f(an)=bnf(a_{0}) = b_{0}, f(a_{1}) = b_{1}, \ldots , f(a_{n}) = b_{n}.

Problem 7.2.13

Let AA and BB be n×nn \times n complex unitary matrices. Prove that ∣det⁡(A+B)∣≤2n\left|\det (A+B)\right| \leq 2^{n}.

?
Problem 7.2.14

Give an example of a continuous function v:R→R3v : \mathbb {R} \to \mathbb {R}^{3} with the property that v(t1)v(t_{1}), v(t2)v(t_{2}), and v(t3)v(t_{3}) form a basis for R3\mathbb {R}^{3} whenever t1,t2t_{1}, t_{2}, and t3t_{3} are distinct points of R\mathbb {R}.

?
Problem 7.2.15

Let f1,f2,…,fnf_{1}, f_{2}, \ldots , f_{n} be continuous real valued functions on [a,b][a,b]. Show that the set {f1,…,fn}\left\{ f_{1}, \ldots , f_{n}\right\} is linearly dependent on [a,b][a,b] if and only if

det⁡(∫abfi(x)fj(x) dx)=0. \det \left(\int _{a}^{b} f_{i}(x)f_{j}(x)\, dx\right) = 0.
?
Problem 7.2.16

Let M2×2M_{2 \times 2} be the vector space of all real 2×22 \times 2 matrices. Let

A=(12−13)B=(2104) A = \begin{pmatrix} 1 & 2 \\ -1 & 3 \end{pmatrix} \qquad B = \begin{pmatrix} 2 & 1 \\ 0 & 4 \end{pmatrix}

and define a linear transformation L:M2×2→M2×2L : M_{2 \times 2} \to M_{2 \times 2} by L(X)=AXBL(X) = AXB. Compute the trace and the determinant of LL.

?
Problem 7.2.17

Let VV be the vector space of all real 3×33 \times 3 matrices and let AA be the diagonal matrix

(100020001). \begin{pmatrix} 1 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 1 \end{pmatrix}.

Calculate the determinant of the linear transformation TT on VV defined by T(X)=12(AX+XA)T(X) = \frac{1}{2}(AX+XA).

?
Problem 7.2.18

Let M3×3M_{3 \times 3} denote the vector space of real 3×33 \times 3 matrices. For any matrix A∈M3×3A \in M_{3 \times 3}, define the linear operator LA:M3×3→M3×3L_{A} : M_{3 \times 3} \to M_{3 \times 3}, LA(B)=ABL_{A}(B) = AB. Suppose that the determinant of AA is 3232 and the minimal polynomial is (t−4)(t−2)(t-4)(t-2). What is the trace of LAL_{A}?

?
Problem 7.2.19

Let SS denote the vector space of real n×nn \times n skew-symmetric matrices. For a nonsingular matrix AA, compute the determinant of the linear map TA:S→ST_{A} : S \to S, TA(X)=AXAtT_{A}(X) = AXA^{t}.

?
Problem 7.2.20

Let M7×7M_{7 \times 7} denote the vector space of real 7×77 \times 7 matrices. Let AA be a diagonal matrix in M7×7M_{7 \times 7} that has +1+1 in four diagonal positions and −1-1 in three diagonal positions. Define the linear transformation TT on M7×7M_{7 \times 7} by T(X)=AX−XAT(X) = AX-XA. What is the dimension of the range of TT?

?
Problem 7.2.21

Let F\mathbf{F} be a field. For mm and nn positive integers, let Mm×nM_{m \times n} be the vector space of m×nm \times n matrices over F\mathbf{F}. Fix mm and nn, and fix matrices AA and BB in Mm×nM_{m \times n}. Define the linear transformation TT from Mn×mM_{n \times m} to Mm×nM_{m \times n} by

T(X)=AXB. T(X) = AXB.

Prove that if m≠nm \neq n, then TT is not invertible.

?