- #1
mathmari
Gold Member
MHB
- 5,049
- 7
Hey!
Suppose we have the matrix $A_n=(A_{ij})\in \mathbb{C}^{n\times n}$ with $a_{ij}=\left\{\begin{matrix}
1 , & i=j\\
-1 , & i=j-1\\
j^2, & i=j+1\\
0 , & \text{ otherwise}
\end{matrix}\right.$ for $1\leq i,j\leq n$.
I want to find the determinant using induction.
I have done the following:
To see the patern I have made some examples:
For $n=2$ we have the matrix $A_2=\begin{pmatrix}1& -1 \\ 1& 1\end{pmatrix}$. The determinant is $|A_2|=\begin{vmatrix}1& -1 \\ 1& 1\end{vmatrix}=2=n(n-1)$.
For $n=3$ we have the matrix $A_3=\begin{pmatrix}1& -1& 0 \\ 1 & 1 & -1 \\ 0 & 4 & 1\end{pmatrix}$. The determinant is $|A_3|=\begin{vmatrix}1& -1& 0 \\ 1 & 1 & -1 \\ 0 & 4 & 1\end{vmatrix} \ \ \overset{R_2=R_2-R_1}{ = } \ \ \begin{vmatrix}1& -1& 0 \\ 0 & 2 & -1 \\ 0 & 4 & 1\end{vmatrix}=\begin{vmatrix} 2 & -1 \\ 4 & 1\end{vmatrix}=2-(-4)=6=n(n-1)$. So, we want to prove that the determinant is $|A_n|=n(n-1)$, for $n\geq 2$, right? (Wondering) Induction on $n$.
Base case: For $n=2$, as shown above, it holds.
Inductive hypothesis: We suppose that it holds for $n=k$, i.e., $|A_k|=k(k-1)$.
Inductive step: We want to prove it for $n=k+1$, i.e., that it holds that $|A_{k+1}|=(k+1)k$. When we consider the matrix without the last row and without the last column, it is the matrix $A_k$.
But what is the relation between the determinant of $A_k$ and that of $A_{k+1}$ ? (Wondering)
Suppose we have the matrix $A_n=(A_{ij})\in \mathbb{C}^{n\times n}$ with $a_{ij}=\left\{\begin{matrix}
1 , & i=j\\
-1 , & i=j-1\\
j^2, & i=j+1\\
0 , & \text{ otherwise}
\end{matrix}\right.$ for $1\leq i,j\leq n$.
I want to find the determinant using induction.
I have done the following:
To see the patern I have made some examples:
For $n=2$ we have the matrix $A_2=\begin{pmatrix}1& -1 \\ 1& 1\end{pmatrix}$. The determinant is $|A_2|=\begin{vmatrix}1& -1 \\ 1& 1\end{vmatrix}=2=n(n-1)$.
For $n=3$ we have the matrix $A_3=\begin{pmatrix}1& -1& 0 \\ 1 & 1 & -1 \\ 0 & 4 & 1\end{pmatrix}$. The determinant is $|A_3|=\begin{vmatrix}1& -1& 0 \\ 1 & 1 & -1 \\ 0 & 4 & 1\end{vmatrix} \ \ \overset{R_2=R_2-R_1}{ = } \ \ \begin{vmatrix}1& -1& 0 \\ 0 & 2 & -1 \\ 0 & 4 & 1\end{vmatrix}=\begin{vmatrix} 2 & -1 \\ 4 & 1\end{vmatrix}=2-(-4)=6=n(n-1)$. So, we want to prove that the determinant is $|A_n|=n(n-1)$, for $n\geq 2$, right? (Wondering) Induction on $n$.
Base case: For $n=2$, as shown above, it holds.
Inductive hypothesis: We suppose that it holds for $n=k$, i.e., $|A_k|=k(k-1)$.
Inductive step: We want to prove it for $n=k+1$, i.e., that it holds that $|A_{k+1}|=(k+1)k$. When we consider the matrix without the last row and without the last column, it is the matrix $A_k$.
But what is the relation between the determinant of $A_k$ and that of $A_{k+1}$ ? (Wondering)