Study guide
6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem
Coal India Management Trainee CIL MT
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: CIL MT Exam Overview & Coal Sector Landscape
1.1 CIL MT Exam Pattern, Marking Scheme & Strategy 1.2 Coal India Limited: Corporate Structure, Maharatna Status & Subsidiaries 1.3 Indian Coal Mining Sector, Energy Mix & Environmental Regulations
2 Chapter 2: Paper-I General Awareness, Polity & Current Affairs
2.1 Indian Constitution, Governance & Statutory Bodies 2.2 Indian Economy, Union Budget & Economic Planning 2.3 Indian Geography, Mineral Belts & Environmental Ecology 2.4 Modern Indian History, Freedom Struggle & Cultural Heritage 2.5 General Science: Physics, Chemistry & Biology Fundamentals 2.6 Inventions, Discoveries & Scientific-Technological Development 2.7 Uses of Internet, Computer Awareness & Digital Governance 2.8 National & International Organisations 2.9 Awards, Honours & Sports 2.10 Books & Authors, Important Monuments & Places of India 2.11 Ports, Power Plants & Infrastructure of India 2.12 Climate Change, SDGs, National Parks & Wildlife Sanctuaries 2.13 Flagship Government Programmes & Current Affairs Method 2.14 World Physical, Social & Economic Geography
3 Chapter 3: Paper-I Reasoning & Logical Ability
3.1 Series Completion, Coding-Decoding & Semantic Analogies 3.2 Syllogisms, Logical Deduction & Venn Diagrams 3.3 Seating Arrangements, Linear/Circular Alignments & Puzzles 3.4 Direction Sense, Blood Relations & Order/Ranking 3.5 Alphabetical & Alphanumeric Series 3.6 Statement & Conclusions, Statement & Arguments 3.7 Clocks & Calendars 3.8 Cubes, Dice & Figure Counting 3.9 Mirror Images, Water Images, Embedded Figures & Non-Verbal Series 3.10 Decision Making & Data Analysis in Reasoning
4 Chapter 4: Paper-I Numerical Ability & Quantitative Aptitude
4.1 Arithmetic Foundations: Percentages, Profit & Loss, Ratio & Proportion 4.2 Averages, Simple/Compound Interest, Alligations & Mixtures 4.3 Time & Work, Pipes & Cisterns, Time, Speed & Distance 4.4 Algebra, Mensuration, Geometry & Data Interpretation (DI) 4.5 Number System, LCM, HCF & Decimal Fractions 4.6 Surds, Indices & Simplification 4.7 Problems on Ages 4.8 Boats & Streams and Problems on Trains 4.9 Permutations & Combinations 4.10 Probability for Quantitative Aptitude
5 Chapter 5: Paper-I General English & Verbal Ability
5.1 English Grammar, Error Spotting & Sentence Correction 5.2 Vocabulary Building: Synonyms, Antonyms, Idioms & Phrases 5.3 Reading Comprehension, Cloze Tests & Para Jumbles 5.4 Fill in the Blanks, Cloze Passages & Sentence Completion 5.5 Jumbled Sentences & Sentence Improvement
6 Chapter 6: Paper-II Engineering Mathematics
6.1 Matrix Algebra, Rank & Systems of Linear Equations 6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem 6.3 Limits, Continuity, Differentiability & Mean Value Theorems 6.4 Maxima-Minima, Indeterminate Forms & Taylor Series 6.5 Definite, Improper, Double & Triple Integrals 6.6 Partial Derivatives, Total Derivative & Multivariable Optimisation 6.7 First-Order Differential Equations: Linear & Non-Linear 6.8 Higher-Order Linear Differential Equations & Engineering Applications 6.9 Laplace Transforms & Transfer-Function Methods 6.10 Probability, Conditional Probability & Bayes' Theorem 6.11 Random Variables, Distributions & Descriptive Statistics 6.12 Numerical Methods: Root Finding, Integration & ODE Solvers
7 Chapter 7: Paper-II Engineering Mechanics & Statics-Dynamics
7.1 Force Systems, Coplanar Equilibrium & Lami's Theorem 7.2 Plane Trusses, Friction Mechanics & Screws/Wedges 7.3 Centroids, Center of Gravity & Moment of Inertia 7.4 Kinematics, Kinetics of Particles & Rigid Body Dynamics 7.5 Virtual Work & Lagrange's Equation 7.6 Rolling Friction, Belt-Pulley Drives, Brakes, Clutches & Vehicle Dynamics
8 Chapter 8: Paper-II Mechanics of Materials & Structural Integrity
8.1 Simple Stresses, Strains, Elastic Moduli & Thermal Stresses 8.2 Principal Stresses, Strain Energy & Mohr's Circle 8.3 Shear Force & Bending Moment Diagrams, Beam Bending & Shear Stresses 8.4 Torsion of Circular Shafts, Springs & Column Buckling 8.5 Thin Cylinders, Spheres & Thick-Walled Pressure Vessels 8.6 Deflection of Beams: Double Integration, Macaulay & Moment-Area 8.7 Shear Centre & Unsymmetrical Bending 8.8 Strain Gauges, Rosettes & Experimental Stress Analysis 8.9 Mechanical Testing: Universal Testing Machine, Hardness & Impact
9 Chapter 9: Paper-II Theory of Machines & Mechanical Vibrations
9.1 Simple Mechanisms, Kinematic Inversions & Velocity/Acceleration Diagrams 9.2 Cams & Followers, Toothed Gearing & Epicyclic Gear Trains 9.3 Flywheels, Centrifugal/Inertia Governors & Rotor Balancing 9.4 Free, Damped & Forced Single-Degree-of-Freedom Vibrations 9.5 Gyroscopic Couple & Gyroscopic Effects
10 Chapter 10: Paper-II Machine Design & Failure Theories
10.1 Static Failure Theories & Variable/Fatigue Loading 10.2 Design of Threaded Fasteners, Welded & Riveted Joints 10.3 Design of Shafts, Keys, Couplings & Rolling/Sliding Bearings 10.4 Design of Spur, Helical, Bevel & Worm Gears 10.5 Design of Helical, Leaf & Torsion Springs 10.6 Design of Brakes & Clutches: Energy, Lining Pressure & Heat
11 Chapter 11: Paper-II Fluid Mechanics & Hydraulic Machinery
11.1 Fluid Properties, Hydrostatic Forces & Buoyancy 11.2 Fluid Kinematics, Continuity & Bernoulli's Equation 11.3 Viscous Flow in Pipes, Boundary Layer & Minor Losses 11.4 Hydraulic Turbines, Centrifugal & Reciprocating Pumps 11.5 Dimensional Analysis, Similitude & Model Testing 11.6 Control-Volume Analysis: Continuity, Momentum & Energy
12 Chapter 12: Paper-II Thermodynamics, Thermal Cycles & Turbomachinery
12.1 Fundamental Concepts, First & Second Laws of Thermodynamics 12.2 Entropy, Availability, Exergy & Properties of Pure Substances 12.3 Air-Standard Gas Power Cycles: Otto, Diesel, Dual & Brayton 12.4 Vapour Power Cycles: Ideal, Reheat & Regenerative Rankine Cycles 12.5 Thermodynamic Relations: Maxwell, Clausius-Clapeyron & Joule-Thomson 12.6 Behaviour of Ideal & Real Gases and Equations of State 12.7 Air & Gas Compressors: Reciprocating, Rotary & Multi-Stage 12.8 Steam & Gas Turbines: Impulse, Reaction & Velocity Diagrams
13 Chapter 13: Paper-II Heat Transfer, Refrigeration & Air Conditioning
13.1 Steady & Unsteady Conduction, Extended Surfaces (Fins) 13.2 Forced/Natural Convection, Radiation & Heat Exchanger LMTD/NTU 13.3 Vapour Compression & Vapour Absorption Refrigeration Systems 13.4 Psychrometric Properties, Processes & Air Conditioning Systems 13.5 Gas Refrigeration, Heat Pump Cycles & Cryogenics
14 Chapter 14: Paper-II Materials Science, Metallurgy & Manufacturing Technology
14.1 Crystal Structures, Phase Diagrams & Iron-Iron Carbide Equilibrium 14.2 Heat Treatment Processes & Engineering Alloy Steels 14.3 Casting Processes, Metal Forming & Welding Metallurgy 14.4 Metal Cutting Mechanics, Tool Life & Machine Tools 14.5 Plastic Deformation, Yield Criteria & Load Estimation in Bulk Forming 14.6 Sheet Metal Forming: Shearing, Bending & Deep Drawing 14.7 Powder Metallurgy 14.8 Brazing, Soldering & Adhesive Bonding 14.9 Non-Traditional Machining: EDM, ECM, USM, AJM, LBM & EBM 14.10 Abrasive Machining, Grinding & Superfinishing 14.11 Principles of Work Holding, Jigs & Fixtures 14.12 Economics of Machining & Tool Life Optimisation
15 Chapter 15: Paper-II Metrology, Quality Control & Industrial Engineering / OR
15.1 Limits, Fits, Tolerances, Gauges & Surface Metrology 15.2 Production Planning, Forecasting & Inventory Control Models 15.3 Operations Research: Linear Programming & Transportation/Assignment 15.4 Project Management: CPM, PERT, Network Analysis & Crashing 15.5 Comparators & Interferometry 15.6 Coordinate Measuring Machines & Machine Tool Alignment Testing 15.7 Computer Integrated Manufacturing: CAD/CAM & Integration Tools 15.8 NC/CNC Machines & CNC Part Programming 15.9 Material Requirements Planning, Scheduling & Sequencing 15.10 Queuing Theory & Simple Queuing Models 15.11 Network Flow Models: Shortest Route, Maximal Flow & Spanning Tree
6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem
Key Takeaways Explain This Topic AI
The sum of the eigenvalues of a square matrix equals its trace, and the product of the eigenvalues equals its determinant — two one-line checks that solve most CIL eigenvalue items without factorising anything.
Eigenvalues of a triangular or diagonal matrix are simply the diagonal entries, and a real symmetric matrix always has real eigenvalues with mutually orthogonal eigenvectors.
If lambda is an eigenvalue of A, then k*lambda belongs to kA, lambda^n to A^n, 1/lambda to A-inverse, and lambda + k to A + kI, while the eigenvector stays unchanged.
The Cayley-Hamilton theorem states that every square matrix satisfies its own characteristic equation, which gives a fast route to A-inverse and to high powers of A.
A repeated eigenvalue blocks diagonalisation only when its geometric multiplicity, n minus the rank of A minus lambda I, falls short of its algebraic multiplicity; a real symmetric matrix is never defective.
Last updated: August 2026
The Eigenvalue Problem
For a square matrix A A A of order n n n , a non-zero vector X X X and a scalar λ \lambda λ satisfying A X = λ X ⟹ ( A − λ I ) X = 0 AX = \lambda X \quad \Longrightarrow \quad (A - \lambda I)X = 0 A X = λ X ⟹ ( A − λ I ) X = 0
are called an eigenvector and its eigenvalue . Because X ≠ 0 X \neq 0 X = 0 is demanded, the homogeneous system must be singular, which gives the characteristic equation det ( A − λ I ) = 0 \det(A - \lambda I) = 0 det ( A − λ I ) = 0
This is exactly the condition developed in the previous section, and it is the same mathematics that produces buckling loads for a strut and natural frequencies for a shaft — a genuine cross-link inside Paper-II.
For a 3 × 3 3 \times 3 3 × 3 matrix the characteristic polynomial expands to λ 3 − S 1 λ 2 + S 2 λ − S 3 = 0 \lambda^3 - S_1\lambda^2 + S_2\lambda - S_3 = 0 λ 3 − S 1 λ 2 + S 2 λ − S 3 = 0
where S 1 S_1 S 1 is the trace (sum of diagonal entries), S 2 S_2 S 2 is the sum of the three principal 2 × 2 2\times2 2 × 2 minors, and S 3 = det A S_3 = \det A S 3 = det A .
The Two Shortcuts That Win Marks
Because CIL gives one mark per item with no negative marking and a 3-hour budget for 200 questions, speed matters more than rigour. Two identities let you answer most eigenvalue items in seconds: ∑ i = 1 n λ i = trace ( A ) , ∏ i = 1 n λ i = det ( A ) \sum_{i=1}^{n} \lambda_i = \text{trace}(A), \qquad \prod_{i=1}^{n} \lambda_i = \det(A) i = 1 ∑ n λ i = trace ( A ) , i = 1 ∏ n λ i = det ( A )
If a question gives you two of three eigenvalues and the trace, the third follows by subtraction. If it asks for the determinant and lists the eigenvalues, multiply.
Properties You Must Recall Cold
- Matrix Its eigenvalues Eigenvectors
- A T A^T A T Same as A A A Generally different
- k A kA k A k λ i k\lambda_i k λ i Unchanged
- A n A^n A n λ i n \lambda_i^{\,n} λ i n Unchanged
- A − 1 A^{-1} A − 1 1 / λ i 1/\lambda_i 1/ λ i Unchanged
- A + k I A + kI A + k I λ i + k \lambda_i + k λ i + k Unchanged
- Triangular / diagonal The diagonal entries —
Further standard results:
A real symmetric matrix has all-real eigenvalues, and eigenvectors of distinct eigenvalues are orthogonal. This is why principal stresses are always real.
A skew-symmetric real matrix has eigenvalues that are zero or purely imaginary.
An orthogonal matrix has eigenvalues of unit modulus.
A A A is singular if and only if at least one eigenvalue is zero.
Idempotent matrices ( A 2 = A A^2 = A A 2 = A ) have eigenvalues only 0 0 0 or 1 1 1 .
- Worked Example: Eigenvalues of a 2x2 Matrix
- Take A = [ 4 1 2 3 ] A = \begin{bmatrix} 4 & 1 \\ 2 & 3 \end{bmatrix} A = [ 4 2 1 3 ]
Trace = 7 = 7 = 7 and det A = 4 ( 3 ) − 1 ( 2 ) = 10 \det A = 4(3) - 1(2) = 10 det A = 4 ( 3 ) − 1 ( 2 ) = 10 . The characteristic equation is therefore λ 2 − 7 λ + 10 = 0 \lambda^2 - 7\lambda + 10 = 0 λ 2 − 7 λ + 10 = 0 , giving λ = 5 \lambda = 5 λ = 5 and λ = 2 \lambda = 2 λ = 2 . Check: 5 + 2 = 7 5 + 2 = 7 5 + 2 = 7 and 5 × 2 = 10 5 \times 2 = 10 5 × 2 = 10 .
For λ = 5 \lambda = 5 λ = 5 , solve ( A − 5 I ) X = 0 (A - 5I)X = 0 ( A − 5 I ) X = 0 : [ − 1 1 2 − 2 ] [ x 1 x 2 ] = [ 0 0 ] \begin{bmatrix} -1 & 1 \\ 2 & -2 \end{bmatrix}\begin{bmatrix} x_1 \\ x_2 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} [ − 1 2 1 − 2 ] [ x 1 x 2 ] = [ 0 0 ]
Both rows give x 1 = x 2 x_1 = x_2 x 1 = x 2 , so the eigenvector is any non-zero multiple of [ 1 1 ] T [1 \;\; 1]^T [ 1 1 ] T . For λ = 2 \lambda = 2 λ = 2 the same procedure gives 2 x 1 + x 2 = 0 2x_1 + x_2 = 0 2 x 1 + x 2 = 0 , i.e. [ 1 − 2 ] T [1 \;\; -2]^T [ 1 − 2 ] T .
Notice that the eigenvector is only ever determined up to a scale factor — options that differ only by a constant multiple are the same answer, and CIL exploits this by listing scaled versions as distractors.
The Cayley-Hamilton Theorem
Every square matrix satisfies its own characteristic equation. For the matrix above, whose characteristic equation is λ 2 − 7 λ + 10 = 0 \lambda^2 - 7\lambda + 10 = 0 λ 2 − 7 λ + 10 = 0 , the theorem asserts A 2 − 7 A + 10 I = 0 A^2 - 7A + 10I = 0 A 2 − 7 A + 10 I = 0
This has two high-value uses.
Finding the inverse. Multiply through by A − 1 A^{-1} A − 1 : A − 7 I + 10 A − 1 = 0 ⟹ A − 1 = 1 10 ( 7 I − A ) A - 7I + 10A^{-1} = 0 \quad \Longrightarrow \quad A^{-1} = \frac{1}{10}\left(7I - A\right) A − 7 I + 10 A − 1 = 0 ⟹ A − 1 = 10 1 ( 7 I − A )
Substituting gives A − 1 = 1 10 [ 3 − 1 − 2 4 ] A^{-1} = \frac{1}{10}\begin{bmatrix} 3 & -1 \\ -2 & 4 \end{bmatrix} A − 1 = 10 1 [ 3 − 2 − 1 4 ]
which you can verify equals the standard adjoint-over-determinant formula. For a 3 × 3 3\times3 3 × 3 matrix this route is usually faster than computing nine cofactors.
Reducing high powers. From A 2 = 7 A − 10 I A^2 = 7A - 10I A 2 = 7 A − 10 I , any power collapses by repeated substitution: A 3 = 7 A 2 − 10 A = 7 ( 7 A − 10 I ) − 10 A = 39 A − 70 I A^3 = 7A^2 - 10A = 7(7A - 10I) - 10A = 39A - 70I A 3 = 7 A 2 − 10 A = 7 ( 7 A − 10 I ) − 10 A = 39 A − 70 I . A question asking for A 4 A^4 A 4 or A 5 A^5 A 5 is therefore arithmetic, not matrix multiplication.
Diagonalisation in One Line
If A A A has n n n linearly independent eigenvectors forming the columns of P P P , then P − 1 A P = D P^{-1}AP = D P − 1 A P = D , a diagonal matrix of eigenvalues. Consequently A k = P D k P − 1 A^k = PD^kP^{-1} A k = P D k P − 1 , and D k D^k D k is just each eigenvalue raised to the power k k k . A matrix with n n n distinct eigenvalues is always diagonalisable; repeated eigenvalues may or may not be.
Worked Example: A 3x3 Matrix End to End
CIL 3x3 items are usually built from small integer matrices carrying a repeated root, because that is exactly where candidates go wrong. Take A = [ 2 1 1 1 2 1 1 1 2 ] A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{bmatrix} A = 2 1 1 1 2 1 1 1 2
Compute the three invariants rather than expanding the determinant symbolically. S 1 = 2 + 2 + 2 = 6 S_1 = 2 + 2 + 2 = 6 S 1 = 2 + 2 + 2 = 6 . Each of the three principal 2 × 2 2\times2 2 × 2 minors equals 2 ( 2 ) − 1 ( 1 ) = 3 2(2) - 1(1) = 3 2 ( 2 ) − 1 ( 1 ) = 3 , so S 2 = 9 S_2 = 9 S 2 = 9 . Expanding once, S 3 = det A = 2 ( 3 ) − 1 ( 1 ) + 1 ( − 1 ) = 4 S_3 = \det A = 2(3) - 1(1) + 1(-1) = 4 S 3 = det A = 2 ( 3 ) − 1 ( 1 ) + 1 ( − 1 ) = 4 . The characteristic equation is therefore λ 3 − 6 λ 2 + 9 λ − 4 = 0 \lambda^3 - 6\lambda^2 + 9\lambda - 4 = 0 λ 3 − 6 λ 2 + 9 λ − 4 = 0
Test the small divisors of the constant term first. λ = 1 \lambda = 1 λ = 1 gives 1 − 6 + 9 − 4 = 0 1 - 6 + 9 - 4 = 0 1 − 6 + 9 − 4 = 0 , so ( λ − 1 ) (\lambda - 1) ( λ − 1 ) divides the cubic and leaves λ 2 − 5 λ + 4 = ( λ − 1 ) ( λ − 4 ) \lambda^2 - 5\lambda + 4 = (\lambda - 1)(\lambda - 4) λ 2 − 5 λ + 4 = ( λ − 1 ) ( λ − 4 ) . The eigenvalues are λ = 4 , 1 , 1 \lambda = 4, 1, 1 λ = 4 , 1 , 1 . Both shortcuts check out: 4 + 1 + 1 = 6 = S 1 4 + 1 + 1 = 6 = S_1 4 + 1 + 1 = 6 = S 1 , and 4 × 1 × 1 = 4 = det A 4 \times 1 \times 1 = 4 = \det A 4 × 1 × 1 = 4 = det A .
For λ = 4 \lambda = 4 λ = 4 , the system ( A − 4 I ) X = 0 (A - 4I)X = 0 ( A − 4 I ) X = 0 collapses to x 1 = x 2 = x 3 x_1 = x_2 = x_3 x 1 = x 2 = x 3 , giving the eigenvector [ 1 1 1 ] T [1 \;\; 1 \;\; 1]^T [ 1 1 1 ] T . For λ = 1 \lambda = 1 λ = 1 , A − I A - I A − I is the all-ones matrix, so all three rows repeat the single condition x 1 + x 2 + x 3 = 0 x_1 + x_2 + x_3 = 0 x 1 + x 2 + x 3 = 0 — two free parameters, and therefore two independent eigenvectors such as [ 1 − 1 0 ] T [1 \;\; -1 \;\; 0]^T [ 1 − 1 0 ] T and [ 1 0 − 1 ] T [1 \;\; 0 \;\; -1]^T [ 1 0 − 1 ] T . A A A is real symmetric, and sure enough [ 1 1 1 ] T [1 \;\; 1 \;\; 1]^T [ 1 1 1 ] T is orthogonal to both of them.
Algebraic Versus Geometric Multiplicity
A repeated eigenvalue does not by itself prevent diagonalisation. This is the single most misremembered rule in the topic, and CIL sets it directly.
The algebraic multiplicity of an eigenvalue is the number of times it repeats as a root of the characteristic equation.
The geometric multiplicity is the number of independent eigenvectors it yields, which equals n − rank ( A − λ I ) n - \text{rank}(A - \lambda I) n − rank ( A − λ I ) .
Geometric multiplicity is always at least 1 and never exceeds the algebraic multiplicity. A matrix is diagonalisable exactly when the two agree for every eigenvalue.
In the worked example, λ = 1 \lambda = 1 λ = 1 has algebraic multiplicity 2, and rank ( A − I ) = 1 \text{rank}(A - I) = 1 rank ( A − I ) = 1 gives geometric multiplicity 3 − 1 = 2 3 - 1 = 2 3 − 1 = 2 . They agree, so A A A is diagonalisable despite the repeat. Contrast that with B = [ 2 1 0 2 ] B = \begin{bmatrix} 2 & 1 \\ 0 & 2 \end{bmatrix} B = [ 2 0 1 2 ]
whose only eigenvalue is 2 with algebraic multiplicity 2, while rank ( B − 2 I ) = 1 \text{rank}(B - 2I) = 1 rank ( B − 2 I ) = 1 leaves geometric multiplicity 1. B B B is defective : there is no second independent eigenvector, so it cannot be diagonalised. A real symmetric matrix is never defective, which is why the symmetric case is always safe to assume diagonalisable.
Cayley-Hamilton on the 3x3
Applying the theorem to the same matrix gives A 3 − 6 A 2 + 9 A − 4 I = 0 A^3 - 6A^2 + 9A - 4I = 0 A 3 − 6 A 2 + 9 A − 4 I = 0 , and multiplying through by A − 1 A^{-1} A − 1 isolates the inverse: A − 1 = 1 4 ( A 2 − 6 A + 9 I ) A^{-1} = \tfrac{1}{4}\left(A^2 - 6A + 9I\right) A − 1 = 4 1 ( A 2 − 6 A + 9 I )
With A 2 A^2 A 2 equal to A 2 = [ 6 5 5 5 6 5 5 5 6 ] A^2 = \begin{bmatrix} 6 & 5 & 5 \\ 5 & 6 & 5 \\ 5 & 5 & 6 \end{bmatrix} A 2 = 6 5 5 5 6 5 5 5 6
this evaluates to A − 1 = 1 4 [ 3 − 1 − 1 − 1 3 − 1 − 1 − 1 3 ] A^{-1} = \frac{1}{4}\begin{bmatrix} 3 & -1 & -1 \\ -1 & 3 & -1 \\ -1 & -1 & 3 \end{bmatrix} A − 1 = 4 1 3 − 1 − 1 − 1 3 − 1 − 1 − 1 3
Two independent checks confirm the result without multiplying anything out. The eigenvalues of A − 1 A^{-1} A − 1 must be 1 / 4 , 1 , 1 1/4, 1, 1 1/4 , 1 , 1 , whose sum is 9 / 4 9/4 9/4 — and the trace of the computed matrix is indeed ( 3 + 3 + 3 ) / 4 = 9 / 4 (3 + 3 + 3)/4 = 9/4 ( 3 + 3 + 3 ) /4 = 9/4 . Its determinant must be 1 / det A = 1 / 4 1/\det A = 1/4 1/ det A = 1/4 . Note that the method fails cleanly on a singular matrix: if det A = 0 \det A = 0 det A = 0 the constant term vanishes, so there is no A − 1 A^{-1} A − 1 term to isolate, which is correct because no inverse exists.
Where This Returns Later in Paper-II
The same characteristic-equation machinery is reused across the Mechanical syllabus, so marks earned here are earned twice.
Later topic The eigenvalue problem in disguise
Principal stresses and Mohr's circle Eigenvalues of the Cauchy stress tensor; the principal directions are its eigenvectors, and S 1 S_1 S 1 , S 2 S_2 S 2 , S 3 S_3 S 3 are the stress invariants
Multi-degree-of-freedom vibration Natural frequencies satisfy det ( K − ω 2 M ) = 0 \det(K - \omega^2 M) = 0 det ( K − ω 2 M ) = 0 , so the ω 2 \omega^2 ω 2 are eigenvalues of M − 1 K M^{-1}K M − 1 K and the mode shapes are the eigenvectors
Euler buckling of a strut The critical load is the smallest eigenvalue of the discretised column problem
Mass moment of inertia The principal axes are eigenvectors of the inertia tensor, and about them the products of inertia vanish
Because principal stresses are the eigenvalues of a symmetric tensor, they are guaranteed real and their planes mutually perpendicular. That is the theoretical justification for Mohr's circle which a purely graphical treatment never supplies.
Five Traps CIL Sets on This Topic
Offering the trace when the stem asks for the determinant, or the reverse. Both come from the same eigenvalue list in one line, so the wrong one is always sitting among the options.
Treating a repeated eigenvalue as automatic proof that a matrix cannot be diagonalised.
Forgetting that an eigenvector is fixed only up to scale , then rejecting the correct option because it is printed as a multiple of the vector you derived.
Extending " A T A^T A T has the same eigenvalues as A A A " to the eigenvectors as well, which are generally different.
Reaching for Cayley-Hamilton to invert a singular matrix.