$A$ is a non-invertable $n$ by $n$ matrix over a field $K$. Show that there are invertable matrices $S,T$ such that $SAT$ is nilpotent.
2026-04-03 01:42:33.1775180553
Turn non-invertable matrix into nilpotent
85 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in MATRIX-DECOMPOSITION
- Real eigenvalues of a non-symmetric matrix $A$ ?.
- Swapping row $n$ with row $m$ by using permutation matrix
- Block diagonalizing a Hermitian matrix
- $A \in M_n$ is reducible if and only if there is a permutation $i_1, ... , i_n$ of $1,... , n$
- Simplify $x^TA(AA^T+I)^{-1}A^Tx$
- Diagonalize real symmetric matrix
- How to solve for $L$ in $X = LL^T$?
- Q of the QR decomposition is an upper Hessenberg matrix
- Question involving orthogonal matrix and congruent matrices $P^{t}AP=I$
- Singular values by QR decomposition
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Suppose $A$ is a $n \times n$ matrix. It is a basic result that we can find invertible $n \times n$ matrices $S'$ and $T'$ such that $$ S' A T' = \begin{pmatrix} 1 & 0 & \cdots & 0 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \ddots & 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 1 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & 0 & 0 & \cdots & 0 \end{pmatrix}. $$ (To see this take a basis $(b_1, \dotsc, b_k)$ of $\ker(A)$ and extend this to a basis $\mathcal{B} = (b_1, \dotsc, b_k, b_{k+1}, \dotsc, b_n)$ of $K^n$. Then $\{Ab_{k+1}, \dotsc Ab_n\}$ generates $\mathrm{im}(A)$, so we can choose a basis of $\mathrm{im}(A)$ of the form $(Ab_{i_1}, \dotsc, Ab_{i_r})$ for $r = \mathrm{rang}(A)$ and $k+1 \leq i_1 < \dotsb < i_r \leq n$. Extend this to a basis $\mathcal{C} = (Ab_{i_1}, \dotsc, Ab_{i_r},c_{r+1},\dotsc,c_n)$ of $K^n$. If we rearrange $\mathcal{B}$ and $\mathcal{C}$, and take $\mathcal{B}$ as a basis of the domain of the linear map $f \colon K^n \to K^n$, $x \mapsto Ax$ and $\mathcal{C}$ as a basis of its codomain, then with respect to these bases $f$ is represented by the above matrix.)
It sufficies to show the statement for $S' A T'$, so can assume w.l.o.g. that $A$ is of the above form. Then for $r = \mathrm{rang}(A)$ we have $A e_i = e_i$ for every $1 \leq i \leq r$ and $A e_i = 0$ for $r < i \leq n$ (that $r < n$ corresponds to the fact that $A$ is not inverible).
Consider the $n \times n$ permutation matrix $S$ with $Se_i = e_{i+1}$ for every $1 \leq i < n$ and $Se_n = e_1$ and let $T$ be the identity matrix. Then $SAT e_i = e_{i+1}$ for all $1 \leq i \leq r$ and $SAT e_i = 0$ for all $r < i \leq n$, so $SAT$ is nilpotent.