SOLVER7 Study. Nothing Else.
Miscellaneous Examples chapter 3 Q23

If \[A= \left[\begin{array}\text cos\theta&sin\theta\\ -sin\theta&cos\theta\end{array} \right]\] ,\[\text then\ prove\ that\ A^n = \left[\begin{array}\text cos \space n\theta&sin \space n\theta\\ -sin \space n\theta&cos \space n\theta\end{array} \right],\] \(n\in N.\)

CBSE Class 12 Maths · Matrices

Solution

👶 Simple Explanation

Simple Explanation

Imagine a spinning wheel that turns by a fixed angle each time you push it. The matrix \( A \) is like one push of that wheel, rotating by angle \( \theta \). Multiplying the matrix by itself \( n \) times is like pushing the wheel \( n \) times total. Each push adds another \( \theta \) to the total turn. So after \( n \) pushes, the wheel has turned by \( n\theta \) altogether, and the result looks exactly like the original matrix but with \( n\theta \) in place of \( \theta \).

Answer: For all \(n \in N\), \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}.\] Hence the statement is proved.

📖 Proving A^n by Mathematical Induction

Detailed Explanation

The matrix \(A = \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}\) is a rotation-type matrix. To prove a statement that must hold for every natural number \(n\), we use the Principle of Mathematical Induction. This has two parts: first we verify the statement for the base case \(n = 1\); then we assume it is true for some \(n = k\) (the inductive hypothesis) and use that assumption together with matrix multiplication to prove it for \(n = k+1\). If both parts hold, the statement is true for all \(n \in N\). The key algebraic tools here are the trigonometric compound-angle identities for \(\cos(k\theta + \theta)\) and \(\sin(k\theta + \theta)\).

Formula Used

Matrix multiplication rule with the identities \[\cos(k\theta + \theta) = \cos k\theta \cos\theta - \sin k\theta \sin\theta\] \[\sin(k\theta + \theta) = \sin k\theta \cos\theta + \cos k\theta \sin\theta\]

Solution

  1. Step 1: State the statement to be proved. Let \(P(n)\) be the statement \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}.\] We will prove \(P(n)\) is true for all \(n \in N\) using mathematical induction.
  2. Step 2: Check the base case \(n = 1\). Putting \(n = 1\) in the formula gives \[\begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix},\] which is exactly \(A\). So \(P(1)\) is true.
  3. Step 3: State the inductive hypothesis. Assume \(P(k)\) is true for some \(k \in N\), that is \[A^k = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix}.\] We must now show \(P(k+1)\) holds.
  4. Step 4: Write \(A^{k+1}\) as a product and multiply. Using \(A^{k+1} = A^k \cdot A\), we get \[A^{k+1} = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix} \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}.\] Multiplying row by column gives \[A^{k+1} = \begin{bmatrix} \cos k\theta \cos\theta - \sin k\theta \sin\theta & \cos k\theta \sin\theta + \sin k\theta \cos\theta \\ -\sin k\theta \cos\theta - \cos k\theta \sin\theta & -\sin k\theta \sin\theta + \cos k\theta \cos\theta \end{bmatrix}.\]
  5. Step 5: Apply the compound-angle identities to simplify each entry. Using \(\cos(k\theta+\theta) = \cos k\theta \cos\theta - \sin k\theta \sin\theta\) and \(\sin(k\theta+\theta) = \sin k\theta \cos\theta + \cos k\theta \sin\theta\), each entry simplifies so that \[A^{k+1} = \begin{bmatrix} \cos(k+1)\theta & \sin(k+1)\theta \\ -\sin(k+1)\theta & \cos(k+1)\theta \end{bmatrix}.\] This is exactly the formula with \(n = k+1\), so \(P(k+1)\) is true.
  6. Step 6: Conclude by induction. Since \(P(1)\) is true and \(P(k)\) true implies \(P(k+1)\) true, by the Principle of Mathematical Induction \(P(n)\) holds for all \(n \in N\).

Final Answer

For all \(n \in N\), \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}.\] Hence the statement is proved.

Common Mistake

A common mistake is to only verify the formula for \(n = 1\) or \(n = 2\) and treat that as a proof. Checking a few cases is NOT a proof; you must complete the inductive step by assuming \(P(k)\) and deriving \(P(k+1)\), and correctly apply the trigonometric identities without sign errors.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the proposition to be proved. Let \(P(n)\) denote the statement \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}\] for all \(n \in N\). — Reason: Clearly naming the proposition \(P(n)\) keeps the induction argument organised and precise.
  2. Step 2: Verify the base case \(n = 1\). Substituting \(n = 1\) into the right-hand side gives \[\begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}\] which is exactly the given matrix \(A\), so \(A^1 = A\). Therefore \(P(1)\) is true. — Reason: The base case anchors the induction; without it, the chain of reasoning has no starting point.
  3. Step 3: State the inductive hypothesis. Assume \(P(k)\) is true for some arbitrary \(k \in N\), that is, assume \[A^k = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix}.\] — Reason: This assumption is the engine of induction; we will use it to deduce the result for \(n = k+1\).
  4. Step 4: Express \(A^{k+1}\) using the inductive hypothesis. Write \(A^{k+1} = A^k \cdot A\), then substitute the assumed form of \(A^k\): \[A^{k+1} = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix} \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}.\] — Reason: Rewriting \(A^{k+1}\) as \(A^k \cdot A\) lets us plug in the hypothesis and reduce the problem to ordinary matrix multiplication.
  5. Step 5: Carry out the matrix multiplication entry by entry. The \((1,1)\) entry is \(\cos k\theta \cos\theta - \sin k\theta \sin\theta\), the \((1,2)\) entry is \(\cos k\theta \sin\theta + \sin k\theta \cos\theta\), the \((2,1)\) entry is \(-\sin k\theta \cos\theta - \cos k\theta \sin\theta\), and the \((2,2)\) entry is \(-\sin k\theta \sin\theta + \cos k\theta \cos\theta\). So we get \[A^{k+1} = \begin{bmatrix} \cos k\theta \cos\theta - \sin k\theta \sin\theta & \cos k\theta \sin\theta + \sin k\theta \cos\theta \\ -(\sin k\theta \cos\theta + \cos k\theta \sin\theta) & \cos k\theta \cos\theta - \sin k\theta \sin\theta \end{bmatrix}.\] — Reason: Explicit multiplication shows exactly where the trigonometric identities will be applied in the next step.
  6. Step 6: Apply the compound-angle identities to simplify. Using \(\cos(k\theta + \theta) = \cos k\theta \cos\theta - \sin k\theta \sin\theta\) and \(\sin(k\theta + \theta) = \sin k\theta \cos\theta + \cos k\theta \sin\theta\), the matrix becomes \[A^{k+1} = \begin{bmatrix} \cos(k+1)\theta & \sin(k+1)\theta \\ -\sin(k+1)\theta & \cos(k+1)\theta \end{bmatrix}.\] — Reason: The compound-angle identities are the key algebraic tool that collapses the four separate trig products into the compact form required by \(P(k+1)\).
  7. Step 7: Conclude the induction. The expression obtained is precisely the matrix predicted by \(P(n)\) when \(n = k+1\). Since \(P(1)\) is true, and \(P(k)\) being true implies \(P(k+1)\) is true, by the Principle of Mathematical Induction \(P(n)\) holds for all \(n \in N\). — Reason: Both pillars of induction are now established, so the proof is complete.

Final Answer

For all \(n \in N\), \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}.\] Hence the statement is proved.

Common Mistake

One common mistake: forgetting to verify the base case \(P(1)\) and jumping straight to the inductive step — without confirming \(P(1)\), the chain of implications starts from nothing and the proof is invalid.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Base Case: For \(n = 1\): \[A^1 = \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}\] which equals \(A\). So \(P(1)\) is true.
  2. Inductive Hypothesis: Assume \(P(k)\) is true: \[A^k = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix}\]
  3. Inductive Step: Compute \(A^{k+1} = A^k \cdot A\): \[A^{k+1} = \begin{bmatrix} \cos k\theta & \sin k\theta \\ -\sin k\theta & \cos k\theta \end{bmatrix} \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}\] \[= \begin{bmatrix} \cos k\theta\cos\theta - \sin k\theta\sin\theta & \cos k\theta\sin\theta + \sin k\theta\cos\theta \\ -\sin k\theta\cos\theta - \cos k\theta\sin\theta & -\sin k\theta\sin\theta + \cos k\theta\cos\theta \end{bmatrix}\] Using compound-angle identities \(\cos(k\theta+\theta) = \cos k\theta\cos\theta - \sin k\theta\sin\theta\) and \(\sin(k\theta+\theta) = \sin k\theta\cos\theta + \cos k\theta\sin\theta\): \[A^{k+1} = \begin{bmatrix} \cos(k+1)\theta & \sin(k+1)\theta \\ -\sin(k+1)\theta & \cos(k+1)\theta \end{bmatrix}\] So \(P(k+1)\) is true.

Answer: For all \(n \in N\), \[A^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}.\] Hence the statement is proved.

➕ More Examples

More Examples

Example 1

Question: If \[B = \begin{bmatrix} \cos\phi & -\sin\phi \\ \sin\phi & \cos\phi \end{bmatrix}\] then prove by mathematical induction that \[B^n = \begin{bmatrix} \cos n\phi & -\sin n\phi \\ \sin n\phi & \cos n\phi \end{bmatrix}\] for all \(n \in \mathbb{N}\).

Solution: We prove the result by the Principle of Mathematical Induction. Step 1 — Base Case (n = 1): For \(n = 1\), we need to check that \(B^1 = \begin{bmatrix} \cos\phi & -\sin\phi \\ \sin\phi & \cos\phi \end{bmatrix}\). This is exactly the given matrix \(B\), so the base case holds. Step 2 — Inductive Hypothesis: Assume the result is true for \(n = k\), i.e., assume \[B^k = \begin{bmatrix} \cos k\phi & -\sin k\phi \\ \sin k\phi & \cos k\phi \end{bmatrix}\] Step 3 — Inductive Step (show true for n = k+1): We compute \(B^{k+1} = B^k \cdot B\): \[B^{k+1} = \begin{bmatrix} \cos k\phi & -\sin k\phi \\ \sin k\phi & \cos k\phi \end{bmatrix} \begin{bmatrix} \cos\phi & -\sin\phi \\ \sin\phi & \cos\phi \end{bmatrix}\] Multiplying row by column: Entry (1,1): \(\cos k\phi \cdot \cos\phi + (-\sin k\phi)(\sin\phi) = \cos k\phi \cos\phi - \sin k\phi \sin\phi\) Using the cosine addition formula: \(\cos k\phi \cos\phi - \sin k\phi \sin\phi = \cos(k\phi + \phi) = \cos(k+1)\phi\) Entry (1,2): \(\cos k\phi \cdot (-\sin\phi) + (-\sin k\phi)(\cos\phi) = -(\cos k\phi \sin\phi + \sin k\phi \cos\phi)\) Using the sine addition formula: \(-(\sin k\phi \cos\phi + \cos k\phi \sin\phi) = -\sin(k\phi + \phi) = -\sin(k+1)\phi\) Entry (2,1): \(\sin k\phi \cdot \cos\phi + \cos k\phi \cdot \sin\phi = \sin(k\phi + \phi) = \sin(k+1)\phi\) Entry (2,2): \(\sin k\phi \cdot (-\sin\phi) + \cos k\phi \cdot \cos\phi = \cos k\phi \cos\phi - \sin k\phi \sin\phi = \cos(k+1)\phi\) Therefore: \[B^{k+1} = \begin{bmatrix} \cos(k+1)\phi & -\sin(k+1)\phi \\ \sin(k+1)\phi & \cos(k+1)\phi \end{bmatrix}\] This is exactly the formula with \(n = k+1\). Conclusion: By the Principle of Mathematical Induction, the result holds for all \(n \in \mathbb{N}\).

Answer: Proved: \(B^n = \begin{bmatrix} \cos n\phi & -\sin n\phi \\ \sin n\phi & \cos n\phi \end{bmatrix}\) for all \(n \in \mathbb{N}\).

Example 2

Question: Let \[M = \begin{bmatrix} \cos 2\alpha & \sin 2\alpha \\ -\sin 2\alpha & \cos 2\alpha \end{bmatrix}\] Prove by mathematical induction that \[M^n = \begin{bmatrix} \cos 2n\alpha & \sin 2n\alpha \\ -\sin 2n\alpha & \cos 2n\alpha \end{bmatrix}\] for all \(n \in \mathbb{N}\).

Solution: We use the Principle of Mathematical Induction. Let \(\theta = 2\alpha\) for convenience, so \[M = \begin{bmatrix} \cos\theta & \sin\theta \\ -\sin\theta & \cos\theta \end{bmatrix}\] and we wish to prove \[M^n = \begin{bmatrix} \cos n\theta & \sin n\theta \\ -\sin n\theta & \cos n\theta \end{bmatrix}\] which, restoring \(\theta = 2\alpha\), becomes \[M^n = \begin{bmatrix} \cos 2n\alpha & \sin 2n\alpha \\ -\sin 2n\alpha & \cos 2n\alpha \end{bmatrix}\] Step 1 — Base Case (n = 1): For \(n = 1\): \[M^1 = \begin{bmatrix} \cos 2\alpha & \sin 2\alpha \\ -\sin 2\alpha & \cos 2\alpha \end{bmatrix}\] which equals \(M\) itself. The base case is verified. Step 2 — Inductive Hypothesis: Assume the formula holds for \(n = k\), i.e., \[M^k = \begin{bmatrix} \cos 2k\alpha & \sin 2k\alpha \\ -\sin 2k\alpha & \cos 2k\alpha \end{bmatrix}\] Step 3 — Inductive Step: We compute \(M^{k+1} = M^k \cdot M\): \[M^{k+1} = \begin{bmatrix} \cos 2k\alpha & \sin 2k\alpha \\ -\sin 2k\alpha & \cos 2k\alpha \end{bmatrix} \begin{bmatrix} \cos 2\alpha & \sin 2\alpha \\ -\sin 2\alpha & \cos 2\alpha \end{bmatrix}\] Entry (1,1): \(\cos 2k\alpha \cos 2\alpha + \sin 2k\alpha (-\sin 2\alpha) = \cos 2k\alpha \cos 2\alpha - \sin 2k\alpha \sin 2\alpha\) Applying the cosine addition formula: \(\cos(2k\alpha + 2\alpha) = \cos 2(k+1)\alpha\) Entry (1,2): \(\cos 2k\alpha \sin 2\alpha + \sin 2k\alpha \cos 2\alpha\) Applying the sine addition formula: \(\sin(2k\alpha + 2\alpha) = \sin 2(k+1)\alpha\) Entry (2,1): \(-\sin 2k\alpha \cos 2\alpha + \cos 2k\alpha (-\sin 2\alpha) = -(\sin 2k\alpha \cos 2\alpha + \cos 2k\alpha \sin 2\alpha)\) Applying the sine addition formula: \(-\sin(2k\alpha + 2\alpha) = -\sin 2(k+1)\alpha\) Entry (2,2): \(-\sin 2k\alpha \sin 2\alpha + \cos 2k\alpha \cos 2\alpha = \cos 2k\alpha \cos 2\alpha - \sin 2k\alpha \sin 2\alpha\) Applying the cosine addition formula: \(\cos(2k\alpha + 2\alpha) = \cos 2(k+1)\alpha\) Therefore: \[M^{k+1} = \begin{bmatrix} \cos 2(k+1)\alpha & \sin 2(k+1)\alpha \\ -\sin 2(k+1)\alpha & \cos 2(k+1)\alpha \end{bmatrix}\] This is precisely the formula for \(n = k+1\). Conclusion: By the Principle of Mathematical Induction, the result \[M^n = \begin{bmatrix} \cos 2n\alpha & \sin 2n\alpha \\ -\sin 2n\alpha & \cos 2n\alpha \end{bmatrix}\] holds for all \(n \in \mathbb{N}\).

Answer: Proved: \(M^n = \begin{bmatrix} \cos 2n\alpha & \sin 2n\alpha \\ -\sin 2n\alpha & \cos 2n\alpha \end{bmatrix}\) for all \(n \in \mathbb{N}\).

🎯 Try a Similar Question

Try a Similar Question

Question: If \[B = \begin{bmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{bmatrix}\] then prove by the principle of mathematical induction that \[B^n = \begin{bmatrix} \cos n\theta & -\sin n\theta \\ \sin n\theta & \cos n\theta \end{bmatrix}\] for all \(n \in \mathbb{N}\).

Solution

  1. Step 1: State the proposition: Let \(P(n)\) denote the statement: \[B^n = \begin{bmatrix} \cos n\theta & -\sin n\theta \\ \sin n\theta & \cos n\theta \end{bmatrix}\] We need to prove \(P(n)\) is true for all \(n \in \mathbb{N}\).
  2. Step 2: Base Case — Verify P(1): For \(n = 1\): \[B^1 = B = \begin{bmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{bmatrix} = \begin{bmatrix} \cos(1 \cdot \theta) & -\sin(1 \cdot \theta) \\ \sin(1 \cdot \theta) & \cos(1 \cdot \theta) \end{bmatrix}\] So \(P(1)\) is true.
  3. Step 3: Inductive Hypothesis — Assume P(k) is true: Assume \(P(k)\) is true for some \(k \in \mathbb{N}\), i.e., assume \[B^k = \begin{bmatrix} \cos k\theta & -\sin k\theta \\ \sin k\theta & \cos k\theta \end{bmatrix}\]
  4. Step 4: Prove P(k+1) — Compute B^(k+1): We need to show that \[B^{k+1} = \begin{bmatrix} \cos(k+1)\theta & -\sin(k+1)\theta \\ \sin(k+1)\theta & \cos(k+1)\theta \end{bmatrix}\] Now, \(B^{k+1} = B^k \cdot B\). Using the inductive hypothesis: \[B^{k+1} = \begin{bmatrix} \cos k\theta & -\sin k\theta \\ \sin k\theta & \cos k\theta \end{bmatrix} \begin{bmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{bmatrix}\]
  5. Step 5: Perform the matrix multiplication: Multiplying the two matrices: The (1,1) entry is \(\cos k\theta \cdot \cos\theta + (-\sin k\theta)(\sin\theta) = \cos k\theta \cos\theta - \sin k\theta \sin\theta = \cos(k\theta + \theta)\). The (1,2) entry is \(\cos k\theta \cdot (-\sin\theta) + (-\sin k\theta)(\cos\theta) = -\cos k\theta \sin\theta - \sin k\theta \cos\theta = -(\sin k\theta \cos\theta + \cos k\theta \sin\theta) = -\sin(k\theta + \theta)\). The (2,1) entry is \(\sin k\theta \cdot \cos\theta + \cos k\theta \cdot \sin\theta = \sin(k\theta + \theta)\). The (2,2) entry is \(\sin k\theta \cdot (-\sin\theta) + \cos k\theta \cdot \cos\theta = \cos k\theta \cos\theta - \sin k\theta \sin\theta = \cos(k\theta + \theta)\).
  6. Step 6: Conclude the inductive step: Therefore: \[B^{k+1} = \begin{bmatrix} \cos(k+1)\theta & -\sin(k+1)\theta \\ \sin(k+1)\theta & \cos(k+1)\theta \end{bmatrix}\] This shows \(P(k+1)\) is true whenever \(P(k)\) is true.
  7. Step 7: Conclusion by Mathematical Induction: Since \(P(1)\) is true and \(P(k) \Rightarrow P(k+1)\) for all \(k \in \mathbb{N}\), by the principle of mathematical induction, \(P(n)\) is true for all \(n \in \mathbb{N}\).

Answer: For all \(n \in \mathbb{N}\): \[B^n = \begin{bmatrix} \cos n\theta & -\sin n\theta \\ \sin n\theta & \cos n\theta \end{bmatrix}\] Hence the statement is proved.

Everything you get with Solver7

More questions in Matrices

Chapter 3 Examples Q1 65/1/1 2023 / Section A Q1 65/2/1 2024 / Section A Q1 65/3/1 2023 / Section A Q1 65/3/1 2024 / Section A Q1 65/4/1 2023 / Section A Q1 65/5/1 2026 / Section A Q1 Chapter 3 Examples Q2 65(B) 2026 / Section A Q2 65/1/1 2024 / Section A Q2 65/1/1 2026 / Section A Q2 65/3/1 2026 / Section A Q2 65/4/1 2023 / Section A Q2 65/4/1 2026 / Section A Q2 65/5/1 2026 / Section A Q2 Chapter 3 Examples Q3 65(B) 2026 / Section A Q3 65/1/1 2026 / Section A Q3 65/3/1 2023 / Section A Q3 65/3/1 2026 / Section A Q3 65/4/1 2023 / Section A Q3 Chapter 3 Examples Q4 65/1/1 2023 / Section A Q4 65/3/1 2023 / Section A Q4 65/3/1 2026 / Section A Q4 65/4/1 2023 / Section A Q4 65/5/1 2026 / Section A Q4 Chapter 3 Examples Q5 65/1/1 2024 / Section A Q5 65/3/1 2026 / Section A Q5 65/4/2 2024 / Section A Q5 Chapter 3 Examples Q6 65/1/1 2026 / Section A Q6 65/2/3 2026 / Section A Q6 Chapter 3 Examples Q7 65/2/3 2026 / Section A Q7 Chapter 3 Examples Q8 65/2/3 2026 / Section A Q8 Chapter 3 Examples Q9 65/2/3 2026 / Section A Q9 Chapter 3 Examples Q10 65/4/2 2024 / Section A Q10 Chapter 3 Examples Q11(i) 65/4/2 2024 / Section A Q11 Chapter 3 Examples Q11(ii) 65/2/1 2024 / Section A Q12 65/3/1 2024 / Section A Q12 65/4/2 2024 / Section A Q12 Chapter 3 Examples Q11(iii) Chapter 3 Examples Q12 65/1/1 2023 / Section A Q14 Chapter 3 Examples Q13 65/2/2 2023 / Section A Q15 Chapter 3 Examples Q14 65/2/2 2023 / Section A Q16 Chapter 3 Examples Q15 65/2/1 2024 / Section A Q17 Chapter 3 Examples Q16 65/1/1 2024 / Section A Q18 65/3/1 2024 / Section A Q18