Since $A{e}_i=r_i{e}_i$, the vector $e_i$ is an eigenvector with nonzero eigenvalue $r_i$. The assumption $r_i\ne 0$ also makes $r\ne 0$, so the kernel has dimension $n-1$. Choose its basis $u_1,\dots ,u_{n-1}$.

The vector $e_i$ is outside this kernel. Hence $(u_1,\dots ,u_{n-1},e_i)$ is a basis of ${\mathbb{R}}^n$ consisting of eigenvectors, with corresponding eigenvalues $0,\dots ,0,r_i$. In that basis, $A$ is the diagonal matrixThis proves that $A$ is a diagonalisable matrix, including the case $n=1$.

Write $r=(r_1,\dots ,r_n{)}^T$. The linear map represented by $A$ has the formThe image of a linear map here is contained in the one-dimensional linear span of $e_i$, so its matrix rank is at most one. The rank-nullity theorem yieldsThus the solution space of $Ax=0$, namely the zero eigenspace when zero is an eigenvalue, contains at least $n-1$ linearly independent vectors. If $r=0$ its dimension is $n$; otherwise it is $n-1$. When $n=1$ the asserted lower bound is zero, even if zero is not an eigenvalue.

Let $S$ be the vector subspace of symmetric matrices. A basis consists of $E_{ii}$ for $1\le i\le n$ and $E_{ij}+E_{ji}$ for $i<j$, soThe dimension formula for a sum of subspaces now givesChoose $0\ne A\in V\cap S$. It belongs to $V$ and is a symmetric matrix, so part (a)(i) makes it a diagonalisable matrix. The preceding example shows that the strict threshold is sharp.

Take the vector subspace of skew-symmetric matrices,It is closed under vector addition and scalar multiplication, and a basis isIndeed, its diagonal entries vanish, and its entries below the diagonal are forced by those above it. Hence $\boxed{\dim K=\left(\genfrac{}{}{0ex}{}{n}{2}\right)}$. Part (a)(ii) proves that the only diagonalisable matrix in $K$ is $0_n$.

The matrix units $E_{ij}$, $1\le i,j\le n$, form a basis of $M_n(\mathbb{R})$: each matrix has the unique expression $A={\sum }_{i,j}{a}_{ij}{E}_{ij}$. There are $n^2$ of them, so

Let $A$ be a skew-symmetric matrix. For every real vector $x$, the real scalar $x^{T}Ax$ equals its own transpose, butHence $x^{T}Ax=0$. If $Av=\lambda v$ is a real eigenvector equation with $v\ne 0$, it follows thatso $\lambda =0$. If $A$ is a diagonalisable matrix over $\mathbb{R}$, it has a real basis of eigenvectors, all with eigenvalue zero. Thus $A$ vanishes on a basis and $\boxed{A=0_n}$.

The field matters: a nonzero real skew-symmetric matrix can be a diagonalisable matrix over the complex numbers, for example $\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)$ with eigenvalues $i,-i$.

The real spectral theorem states that a symmetric matrix has an orthonormal basis of real eigenvectors, and hence is a diagonalisable matrix. Here is a proof in this setting.

For $n\ge 1$, the quadratic form $q(x)=x^{T}Ax$ attains a maximum on the unit sphere, by compactness and the extreme value theorem. Choose a unit maximizer $u$ and put $\lambda =u^{T}Au$. For any $w\perp u$, the Rayleigh quotient along $u+tw$ has a maximum at $t=0$, soThe last equality uses $A=A^T$ and $u^{T}w=0$. Thus $Au$ is orthogonal to every $w\perp u$, so $Au=\lambda u$.

The orthogonal complement $u^{\perp }$ is an invariant subspace, because for $x\perp u$,The restriction of $A$ to $u^{\perp }$ is again symmetric with respect to the induced inner product. By mathematical induction on dimension, it has an orthonormal basis of eigenvectors; adjoining $u$ gives one for ${\mathbb{R}}^n$. If $Q$ has those basis vectors as columns, then $Q^{T}AQ$ is a real diagonal matrix and $Q^{-1}=Q^T$.

The same matrix similarity preserves being a diagonalisable matrix. If $S^{-1}(AB)S=D$ is a diagonal matrix, thenTherefore $BA$ is a diagonalisable matrix whenever $AB$ is, and the converse follows by interchanging $A,B$. Thus they are either both diagonalisable matrices or neither is. In fact the previous part shows that one invertible factor suffices.

If $A$ is an invertible matrix, thenIf instead $B$ is an invertible matrix, thenThus in either case $AB$ and $BA$ are similar matrices. Explicitly, whenever $Y=P^{-1}XP$ and $Xu=\lambda u$ with $u\ne 0$, one has $Y(P^{-1}u)=\lambda P^{-1}u$ and $P^{-1}u\ne 0$. Applying the same argument with $P^{-1}$ in place of $P$ proves equality of the sets of eigenvalues, including zero.

Yes. The sums of the columns of $A$ are the sums of the rows of its transpose $A^T$. By the previous argument, $A^{T}1=\lambda 1$, so $\det (\lambda I_n-A^T)=0$. The determinant is unchanged by transpose, givingTherefore $\boxed{\lambda \text{ is an eigenvalue of }A}$. The vector $1$ need not itself be an eigenvector of $A$ in the column-sum case.

Take the nonzero vector $1=(1,\dots ,1{)}^T$. Its $i$th image entry under matrix multiplication is the sum of row $i$:Thus $A1=\lambda 1$, exhibiting $1$ as an eigenvector with eigenvalue $\boxed{\lambda }$.

We have $D(I_n)=\det A$. Define a function of the columns of $B$ byIt is an alternating multilinear map, because both summands are, and $F(I_n)=\det A+1-\det A=1$. Hence $F$ is a normalized determinantal function. By the asserted uniqueness of the determinant, $F(B)=\det B$ for every $B$. Rearranging yieldsThis argument also covers $\det A=0$ without dividing by it.

Write $B=[b_1,\dots ,b_n]$. Since $AB=[A{b}_1,\dots ,A{b}_n]$ and $b\mapsto Ab$ is a linear map, the multilinearity of the determinant gives, for any column position $j$,If $b_i=b_j$ for $i\ne j$, the corresponding columns $A{b}_i,A{b}_j$ also agree, so $D(B)=0$. Thus $D$ is an alternating multilinear map of the columns of $B$, even when $A$ is not invertible.

A scalar $\lambda$ is an eigenvalue of $A$ if and only if there is a nonzero vector $v$ with $Av=\lambda v$. By the preceding kernel criterion,The last condition is ${\chi }_A(\lambda )=0$, exactly the definition of a polynomial root. For a real matrix, this proves the assertion for real eigenvalues; the same proof over the complex numbers gives the usual complex version.

We use the monic polynomial convention for the characteristic polynomial of an $n\times n$ matrix:It has degree $n$, since the only contribution to the coefficient of $t^n$ in the determinant is the product of the $n$ diagonal terms $t$. The alternative convention $\det (A-t{I}_n)=(-1{)}^n{\chi }_A(t)$ has the same polynomial roots.

For the linear map $T_A:x\mapsto Ax$ on the finite-dimensional vector space ${\mathbb{R}}^n$, the rank-nullity theorem implies that injectivity and surjectivity are equivalent. Consequently $T_A$ is invertible if and only if $\ker T_A=\{0\}$.

Using the permitted equivalence between invertibility and a nonzero determinant, we obtain

If $T^{\prime }=\lambda T$ with $\lambda \ne 0$, then $T^{\prime }(x)=0$ if and only if $T(x)=0$, so their kernels agree. Conversely, suppose both nonzero linear functionals have kernel $K$. Choose $u$ with $T(u)=1$, by scaling a vector on which $T$ is nonzero. For each $x\in V$,Therefore $T^{\prime }(x)=T(x)T^{\prime }(u)$. Moreover $T^{\prime }(u)\ne 0$, since $u\notin K$. Thus $\boxed{T^{\prime }=T^{\prime }(u)T}$, with a nonzero scalar.

Every nonzero linear functional $V\to {\mathbb{F}}_p$ is surjective, so its kernel has dimension $n-1$ by the rank-nullity theorem. Conversely, every hyperplane $K$ is such a kernel: extend a basis of $K$ by one vector $u$, and assign value zero on that basis and value one on $u$. Hence the hyperplanes containing $v$ are exactly the kernels of the $p^{n-1}-1$ nonzero linear functionals counted above. Each kernel occurs for exactly $p-1$ of them, its distinct nonzero scalar multiples. The required number is

Put $L=\mathrm{span}\{v\}$. Every two-dimensional vector subspace containing $v$ is $W=\mathrm{span}\{v,w\}$ for some $w\notin L$. There are $p^n-p$ choices for $w$ in $V$. Within any one such $W$, exactly $p^2-p$ choices of $w\in W\setminus L$ yield that same $W$: each forms a linearly independent pair with $v$, and that pair is a basis of $W$.

These sets of choices partition $V\setminus L$, because $w$ determines $\mathrm{span}\{v,w\}$ uniquely. Thus the number isEquivalently these vector subspaces correspond to the one-dimensional vector subspaces of the quotient vector space $V/L$. For $n=1$ there are none and the formula gives zero.

Use basis extension to choose a basis $(v,v_2,\dots ,v_n)$ of the vector space $V$ over the finite field ${\mathbb{F}}_p={\mathbb{Z}}_p$. The condition $T(v)=0$ fixes the first value of a linear functional; its remaining $n-1$ values are arbitrary. There are $p^{n-1}$ such linear maps, exactly one of which is zero. Hence the required number isFor $n=1$ this is zero, as it should be: vanishing at a basis vector then forces the entire linear functional to vanish.

Every $v\in V$ has a unique basis expansion $v={\sum }_{i=1}^n{a}_i{v}_i$. Define the linear functionalUniqueness of the coordinates makes this definition well defined. The coordinates of a sum or a scalar multiple are the corresponding sums or scalar multiples of the coordinates, so this formula defines a linear map. It has $T(v_i)={\mu }_i$. Conversely, any linear map with those values must satisfy the same formula by linearity, proving uniqueness.

If the finite field $\mathbb{F}$ has $q$ elements, each of the $n$ values ${\mu }_i$ can be chosen independently in $q$ ways. The number of linear maps $V\to \mathbb{F}$ is therefore $\boxed{q^n}$, including the zero linear map.