If $A=\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix}$,prove that $A^{n}=\begin{bmatrix} 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \end{bmatrix}$ for all $n \in N$.
(N/A) Given $A=\begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix}$.
We need to prove $P(n): A^{n}=\begin{bmatrix} 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \end{bmatrix}$ for all $n \in N$ using the principle of mathematical induction.
Step $1$: For $n=1$,$A^{1} = \begin{bmatrix} 3^{1-1} & 3^{1-1} & 3^{1-1} \\ 3^{1-1} & 3^{1-1} & 3^{1-1} \\ 3^{1-1} & 3^{1-1} & 3^{1-1} \end{bmatrix} = \begin{bmatrix} 3^{0} & 3^{0} & 3^{0} \\ 3^{0} & 3^{0} & 3^{0} \\ 3^{0} & 3^{0} & 3^{0} \end{bmatrix} = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix} = A$. Thus,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$A^{k} = \begin{bmatrix} 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \end{bmatrix}$.
Step $3$: We show $P(k+1)$ is true.
$A^{k+1} = A \cdot A^{k} = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix} \begin{bmatrix} 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \end{bmatrix}$.
Performing matrix multiplication,each element of the resulting matrix is $(1 \cdot 3^{k-1} + 1 \cdot 3^{k-1} + 1 \cdot 3^{k-1}) = 3 \cdot 3^{k-1} = 3^{k} = 3^{(k+1)-1}$.
Thus,$A^{k+1} = \begin{bmatrix} 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \\ 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \\ 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \end{bmatrix}$.
Therefore,by the principle of mathematical induction,the result holds for all $n \in N$.
We need to prove $P(n): A^{n}=\begin{bmatrix} 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \\ 3^{n-1} & 3^{n-1} & 3^{n-1} \end{bmatrix}$ for all $n \in N$ using the principle of mathematical induction.
Step $1$: For $n=1$,$A^{1} = \begin{bmatrix} 3^{1-1} & 3^{1-1} & 3^{1-1} \\ 3^{1-1} & 3^{1-1} & 3^{1-1} \\ 3^{1-1} & 3^{1-1} & 3^{1-1} \end{bmatrix} = \begin{bmatrix} 3^{0} & 3^{0} & 3^{0} \\ 3^{0} & 3^{0} & 3^{0} \\ 3^{0} & 3^{0} & 3^{0} \end{bmatrix} = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix} = A$. Thus,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$A^{k} = \begin{bmatrix} 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \end{bmatrix}$.
Step $3$: We show $P(k+1)$ is true.
$A^{k+1} = A \cdot A^{k} = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{bmatrix} \begin{bmatrix} 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \\ 3^{k-1} & 3^{k-1} & 3^{k-1} \end{bmatrix}$.
Performing matrix multiplication,each element of the resulting matrix is $(1 \cdot 3^{k-1} + 1 \cdot 3^{k-1} + 1 \cdot 3^{k-1}) = 3 \cdot 3^{k-1} = 3^{k} = 3^{(k+1)-1}$.
Thus,$A^{k+1} = \begin{bmatrix} 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \\ 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \\ 3^{(k+1)-1} & 3^{(k+1)-1} & 3^{(k+1)-1} \end{bmatrix}$.
Therefore,by the principle of mathematical induction,the result holds for all $n \in N$.
Explore More
Similar Questions
If $A$ is a square matrix of order $3$ and $A^2+A+2I=0$,then
DifficultAP EAMCET 2018
View SolutionLet $A$ and $B$ be real matrices of the form $\begin{bmatrix} \alpha & 0 \\ 0 & \beta \end{bmatrix}$ and $\begin{bmatrix} 0 & \gamma \\ \delta & 0 \end{bmatrix}$,respectively.
Statement $1$: $AB - BA$ is always an invertible matrix.
Statement $2$: $AB - BA$ is never an identity matrix.
Statement $1$: $AB - BA$ is always an invertible matrix.
Statement $2$: $AB - BA$ is never an identity matrix.
DifficultAIEEE 2012
View SolutionIf $a_{r} = \cos \frac{2 r \pi}{9} + i \sin \frac{2 r \pi}{9}$,$r = 1, 2, 3, \ldots$,$i = \sqrt{-1}$,then the determinant $\left|\begin{array}{lll}a_{1} & a_{2} & a_{3} \\ a_{4} & a_{5} & a_{6} \\ a_{7} & a_{8} & a_{9}\end{array}\right|$ is equal to:
If $\alpha = \cos \frac{\pi}{3} + i \sin \frac{\pi}{3}$,then the value of the determinant $\left| \begin{array}{ccc} 1 & \alpha & \alpha^2 \\ \alpha^2 & 1 & \alpha \\ \alpha & \alpha^2 & 1 \end{array} \right|$ is
Let $A = \begin{bmatrix} 1 & 0 & 0 \\ 0 & \cos t & \sin t \\ 0 & -\sin t & \cos t \end{bmatrix}$. Let $\lambda_{1}, \lambda_{2}, \lambda_{3}$ be the roots of $\det(A - \lambda I_{3}) = 0$,where $I_{3}$ denotes the identity matrix. If $\lambda_{1} + \lambda_{2} + \lambda_{3} = \sqrt{2} + 1$,then the set of possible values of $t$ for $-\pi \leq t < \pi$ is:
DifficultWBJEE 2021
View SolutionVedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo