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
Matrix $A$ satisfies $A^2 = 2A - I$,where $I$ is the identity matrix. Then for $n \ge 2$,$A^n$ is equal to $(n \in N)$:
Let $A = \begin{bmatrix} \frac{1}{6} & \frac{-1}{3} & \frac{-1}{6} \\ \frac{-1}{3} & \frac{2}{3} & \frac{1}{3} \\ \frac{-1}{6} & \frac{1}{3} & \frac{1}{6} \end{bmatrix}$. If $A^{2016l} + A^{2017m} + A^{2018n} = \frac{1}{\alpha} A$, for every $l, m, n \in N$, then the value of $\alpha$ is
Let $A = \begin{bmatrix} p & 13 \\ -13 & p \end{bmatrix}$ and $B = \begin{bmatrix} 4q & 85 \\ -2 & 1 \end{bmatrix}$ where $p, q \in N$. It is given that $|A| = |B|$ and $p, q \in [1, 1000]$. Then the total number of ordered pairs $(p, q)$ is:
$\left[\begin{array}{ccc} 1 & 2 & 3 \\ -1 & 1 & 2 \\ 3 & 0 & 2 \end{array}\right]^{\left|\begin{array}{cc} 2022 & 2024 \\ 2021 & 2023 \end{array}\right|}$ is equal to
DifficultAP EAMCET 2021
View SolutionIf the minimum and the maximum values of the function $f : \left[\frac{\pi}{4}, \frac{\pi}{2}\right] \rightarrow \mathbb{R}$,defined by $f(\theta) = \left|\begin{array}{ccc} -\sin^2 \theta & -1-\sin^2 \theta & 1 \\ -\cos^2 \theta & -1-\cos^2 \theta & 1 \\ 12 & 10 & -2 \end{array}\right|$ are $m$ and $M$ respectively,then the ordered pair $(m, M)$ is equal to:
DifficultJEE MAIN 2020
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