Let $A=({a}_{ij})$ be an an $n\times n$ matrix such that $max|{a}_{ij}|<\frac{{\textstyle 1}}{{\textstyle n}}$. Show that I−A is invertible

Lisantiom
2022-10-08
Answered

Let $A=({a}_{ij})$ be an an $n\times n$ matrix such that $max|{a}_{ij}|<\frac{{\textstyle 1}}{{\textstyle n}}$. Show that I−A is invertible

You can still ask an expert for help

Jaylyn George

Answered 2022-10-09
Author has **6** answers

You can also approach this problem using the Gershgorin Circle theorem which says that any eigenvalue of $I-A$ has to be contained in some Gershgorin Disc $D(1-{a}_{ii},{R}_{i})$ where ${R}_{i}=\sum _{j\ne i}|{a}_{ij}|$. Using the fact that $\underset{i,j}{max}|{a}_{ij}|<\frac{1}{n}$ we can say ${R}_{i}<1-\frac{1}{n}$ and $|1-{a}_{ii}|\ge |1-|{a}_{ii}||>1-\frac{1}{n}$. So no Gershgorin Disc of $I-A$ will contain the origin implying $I-A$ cannot have a eigenvalue of 0 and $I-A$ must be nonsingular.

kasibug1v

Answered 2022-10-10
Author has **4** answers

The series $\sum _{i=0}^{\mathrm{\infty}}{A}^{i}$ converges due to the norm condition. Let us take the limit to be B it is clear that this is the inverse.

Another solution. I−A has 0 as an eigenvalue if and only if A has 1 as an eigenvalue. Suppose 1 is an eigenvalue of A, let v be an eigenvector for it. So $Av=v$ as a result ${A}^{n}v=v$ for all n. But as $max\mid {a}_{ij}\mid <1/n$ we see ${A}^{n}$ converges to 0. Giving us v=0 a contradiction.

Another solution. I−A has 0 as an eigenvalue if and only if A has 1 as an eigenvalue. Suppose 1 is an eigenvalue of A, let v be an eigenvector for it. So $Av=v$ as a result ${A}^{n}v=v$ for all n. But as $max\mid {a}_{ij}\mid <1/n$ we see ${A}^{n}$ converges to 0. Giving us v=0 a contradiction.

asked 2021-01-31

Find a basis for the space of $2\times 2$ diagonal matrices.

$\text{Basis}=\{\left[\begin{array}{cc}& \\ & \end{array}\right],\left[\begin{array}{cc}& \\ & \end{array}\right]\}$

asked 2021-02-08

Let B be a 4x4 matrix to which we apply the following operations:

1. double column 1,

2. halve row 3,

3. add row 3 to row 1,

4. interchange columns 1 and 4,

5. subtract row 2 from each of the other rows,

6. replace column 4 by column 3,

7. delete column 1 (column dimension is reduced by 1).

(a) Write the result as a product of eight matrices.

(b) Write it again as a product of ABC (same B) of three matrices.

1. double column 1,

2. halve row 3,

3. add row 3 to row 1,

4. interchange columns 1 and 4,

5. subtract row 2 from each of the other rows,

6. replace column 4 by column 3,

7. delete column 1 (column dimension is reduced by 1).

(a) Write the result as a product of eight matrices.

(b) Write it again as a product of ABC (same B) of three matrices.

asked 2021-06-14

One cake recipe calls for

asked 2022-11-11

Find the value of the following determinant.

$det\left(\begin{array}{ccc}{x}^{2}& (x+1{)}^{2}& (x+2{)}^{2}\\ \phantom{\rule{mediummathspace}{0ex}}{y}^{2}& (y+1{)}^{2}& (y+2{)}^{2}\\ \phantom{\rule{mediummathspace}{0ex}}{z}^{2}& (z+1{)}^{2}& (z+2{)}^{2}\end{array}\right)$

$det\left(\begin{array}{ccc}{x}^{2}& (x+1{)}^{2}& (x+2{)}^{2}\\ \phantom{\rule{mediummathspace}{0ex}}{y}^{2}& (y+1{)}^{2}& (y+2{)}^{2}\\ \phantom{\rule{mediummathspace}{0ex}}{z}^{2}& (z+1{)}^{2}& (z+2{)}^{2}\end{array}\right)$

asked 2022-10-23

If A is a complex matrix of order n and A is nilpotent, that is, there exists a positive integer s such that ${A}^{s}=0$. Let's say that ${e}^{A}=\sum _{k=0}^{\mathrm{\infty}}\frac{{A}^{k}}{k!}$. Prove that ${e}^{A}$ is similar to ${I}_{n}+A$, where ${I}_{n}$ is the identity matrix of order n.

asked 2021-03-04

Determine all $2\times 2$ matrices A such that AB = BA for
any $2\times 2$ matrix B.

asked 2020-12-28

Use the definition of the matrix exponential to compute eA for each of the following matrices:

$A=\left[\begin{array}{ccc}1& 0& -1\\ 0& 1& 0\\ 0& 0& 1\end{array}\right]$