Intereting Posts

Seminorms in a LCS also open?
$\frac{\partial^2 u}{\partial t^2}-c^2\frac{\partial^2u}{\partial x^2}=0\text{ implies } \frac{\partial^2 u}{\partial z \partial y}=0$
Center of Heisenberg group- Dummit and Foote, pg 54, 2.2
Order of matrices in $GL_2(\mathbb{Z})$
Fundamental theorem of Algebra using fundamental groups.
Can axis/angle notation match all possible orientations of a rotation matrix?
Questions about matrix rank, trace, and invertibility
Proof by induction: $n^{n+1} > (n + 1)^n$, $(1 + x)^n \ge 1 + nx$, other inequalities
map of arbitrary degree from compact oriented manifold into sphere
Theorems in complex analysis.
I have a answer to a question about trace. Is there an easier answer to this question?
Determine the Set of a Sum of Numbers
How to partition area of an ellipse into odd number of regions?
Show that $k/(xy-1)$ is not isomorphic to a polynomial ring in one variable.
Bijective holomorphic map with a fixed point

I want to prove that $\det(xI_m-AB)=x^{m-n}\det(xI_n-BA)$

If $A\in \mathbb{F}^{m\times n}$ and $B\in \mathbb{F}^{n\times m}$

It is easy to show that $0$ has algebraic multiplicity of at least $m-n$ for $AB$, but how can I show that the other eigenvalues of $AB$ are actually eigenvalues of $BA$ ? I know that the sum of eigenvalues of $AB$ and $BA$ are the same, because $\operatorname{trace}(AB)=\operatorname{trace}(BA)$, but …

- How to find the determinant of this $5 \times 5$ matrix?
- What is the fastest way to find the characteristic polynomial of a matrix?
- Circulant determinants
- Filling an array(Putnam)
- Determinant of the inverse matrix
- Non brute force proof of multiplicative property of determinants

I appreciate any help, thanks ! ${{{}}}$

- A determinant inequality
- Coefficient of det($xI+A$)
- Connection between eigenvalues and eigenvectors of a matrix in different bases
- System of differential equations, pure imaginary eigenvalues, show that the trajectory is an ellipse.
- Prove that determinant of a matrix (with polynomial entries) is non-zero
- The determinant of block triangular matrix as product of determinants of diagonal blocks
- Filling an array(Putnam)
- Invariant subspaces using matrix of linear operator
- Left/Right Eigenvectors
- Why do Markov matrices converge to the same vector after infinite steps irrespective of the starting vector?

Let $r=\operatorname{rank}(A)$

From a well-known theorem, derive that there exists $P,Q$ invertible $m\times m$ and $n \times n$ matrices such that $$A=P\begin{bmatrix}I_r& 0\\ 0 &0\end{bmatrix}Q $$

where $I_r$ denotes the $r\times r$ identity matrix.

By changes of basis, $$B=Q^{-1}\begin{bmatrix}E& F\\ G &H\end{bmatrix}P^{-1}$$

For some submatrices $E,F,G,H$.

Note that $AB=P\begin{bmatrix}E& F\\ 0&0\end{bmatrix}P^{-1}$ and $BA=Q^{-1}\begin{bmatrix}E& 0\\ G&0\end{bmatrix}Q$.

Hence $\chi_{AB}=\det(E-XI_r)(-X)^{m-r}$ and $\chi_{BA}=\det(E-XI_r)(-X)^{n-r}$

Hence $\chi_{BA}=(-X)^{n-m}\chi_{AB}$.

This proof is nothing new. It is a reformulation of Sylvester’s determinant theorem as suggested in Fabian’s comment.

Assume $x \ne 0$, we have

$$

\begin{bmatrix}I_n & B\\ A & xI_m\end{bmatrix}

\begin{bmatrix}I_n & -B\\ 0 & I_m\end{bmatrix} =

\begin{bmatrix}I_n & 0\\ A & xI_m – AB\end{bmatrix}$$

This implies

$$\det(xI_m – AB) =

\begin{vmatrix}I_n & 0\\ A & xI_m – AB\end{vmatrix}

=\begin{vmatrix}I_n & B\\ A & xI_m\end{vmatrix}\tag{*1}

$$

Notice

$$\begin{vmatrix}I_n & B\\ A & xI_m\end{vmatrix}

= (-)^{mn} \begin{vmatrix}A & xI_m\\I_n & B\end{vmatrix}

= \begin{vmatrix}xI_m & A\\B & I_n\end{vmatrix}

= x^{m+n}\begin{vmatrix}I_m & x^{-1}A\\x^{-1}B & x^{-1}I_n\end{vmatrix}

$$

Apply $(*1)$ with $x^{-1}B, x^{-1}A, x^{-1}I_n$ taking the roles of $A, B, xI_m$, we get

$$\begin{align}\det(xI_m-AB) &= x^{m+n}\det(x^{-1}I_n – x^{-2}BA) = x^{(m+n)-2n}\det(x I_n – BA)\\

&= x^{m-n}\det(xI_n – BA)\end{align}$$

This leave us with the special case $x = 0$,

- if $m = n$, the relation at hand reduces to $\det(-AB) = \det(-BA)$ which is trivially true.
- if $m > n$, LHS reduces to $\det(-AB)$ where $AB$ is a $m \times m$ matrix. Since the rank of $A$ and $B$ is at most $n < m$, this determinant is zero. RHS is zero because of the $x^{m-n}$ factor.

Combine all these, we have

$$\det(x I_m – AB ) = x^{m-n} \det(x I_n – BA)$$

unless $x = 0$ and $m < n$ where the RHS is an undefined expression.

- Solve a cubic polynomial?
- 2 regular graphs and permutations
- Computing $\lim_{x\to0} \frac 8 {x^8} \left$ without using L'Hospital
- Combining symbols with symmetry
- Notation and hierarchy of cartesian spaces, euclidean spaces, riemannian spaces and manifolds
- Induction Proof that $x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+\ldots+xy^{n-2}+y^{n-1})$
- Inequality with condition $x^2+y^2+z^2=1$.
- What is continuity, geometrically?
- Good books for self-studying algebra?
- Comb space has no simply connected cover
- what happens to rank of matrices when singular matrix multiply by non-singular matrix??
- how to solve $aX+bX^2=e^{cX}$
- Degree of a Divisor = Self Intersection?
- Convergence of $\int_{A_n} f$ to $0$
- Probability each of six different numbers will appear at least once?