Study guide
2.3 Matrices, Determinants, Inverses & Systems of Linear Equations
Pakistan ECAT Engineering Colleges Admission Test
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: ECAT Exam Structure, Scoring & Strategy
1.1 ECAT Exam Pattern, Scoring Scheme & UET Merit Aggregate 1.2 Time Management, Pacing & MCQ Problem-Solving Tactics
2 Chapter 2: Mathematics — Number Systems, Sets & Algebra
2.1 Real Numbers, Sets, Logic, Binary Operations & Groups 2.2 Complex Numbers, Modulus, Conjugates & De Moivre's Theorem 2.3 Matrices, Determinants, Inverses & Systems of Linear Equations 2.4 Quadratic Equations, Relations Between Roots & Factor/Remainder Theorems
3 Chapter 3: Mathematics — Sequences, Series & Combinatorics
3.1 Arithmetic, Geometric & Harmonic Progressions (AP, GP, HP) 3.2 Permutations, Combinations & Probability Distributions 3.3 Mathematical Induction & the Binomial Theorem
4 Chapter 4: Mathematics — Trigonometry & Trigonometric Equations
4.1 Fundamental Trigonometric Identities & Angle Addition Formulas 4.2 Graphs of Trigonometric Functions & Inverse Trigonometric Functions 4.3 Solutions of Triangles (Sine/Cosine Laws) & Trigonometric Equations
5 Chapter 5: Mathematics — Functions, Limits & Continuity
5.1 Real-Valued Functions, Types, Domains & Ranges 5.2 Limits of Functions, Indeterminate Forms & Squeeze Theorem 5.3 Continuity, Types of Discontinuity & Asymptotes
6 Chapter 6: Mathematics — Differential Calculus
6.1 Definition of Derivative, Power, Product, Quotient & Chain Rules 6.2 Derivatives of Trigonometric, Exponential & Logarithmic Functions 6.3 Implicit Differentiation, Parametric Equations & Higher-Order Derivatives 6.4 Tangents, Normals, Increasing/Decreasing Functions & Extrema
7 Chapter 7: Mathematics — Integral Calculus
7.1 Indefinite Integration Formulas & Integration by Substitution 7.2 Integration by Parts & Partial Fractions 7.3 Definite Integrals, Properties & Fundamental Theorem of Calculus 7.4 Area Under Curves & First-Order Differential Equations
8 Chapter 8: Mathematics — Analytic Geometry, Linear Programming & Vectors
8.1 Coordinates, Slopes, Straight Line Equations & Distances 8.2 Linear Inequalities & Linear Programming 8.3 Circle Equations, Tangents, Normals & Intersections 8.4 Conic Sections: Parabola, Ellipse & Hyperbola Characteristics 8.5 Vectors in 2D and 3D, Dot Product, Cross Product & Scalar Triple Product
9 Chapter 9: Physics — Measurements, Vectors & Equilibrium
9.1 Physical Quantities, SI Units, Errors & Dimensional Analysis 9.2 Vector Addition, Components, Scalar & Vector Products in Physics 9.3 Equilibrium Conditions, Torque & Rotational Equilibrium
10 Chapter 10: Physics — Kinematics, Dynamics & Energy
10.1 Kinematics: Displacement, Velocity, Acceleration & Motion Equations 10.2 Newton's Laws of Motion, Momentum, Impulse & Elastic Collisions 10.3 Projectile Motion: Trajectory, Height, Flight Time & Range 10.4 Work, Energy, Work-Energy Theorem, Conservative Forces & Power
11 Chapter 11: Physics — Circular Motion, Gravitation, Fluids & Oscillations
11.1 Uniform Circular Motion, Centripetal Force & Moment of Inertia 11.2 Gravitation, Escape Velocity, Satellites & Weightlessness 11.3 Viscosity, Drag Force, Equation of Continuity & Bernoulli's Principle 11.4 Simple Harmonic Motion (SHM), Pendulum, Mass-Spring & Resonance
12 Chapter 12: Physics — Waves, Optics, Optical Instruments & Thermodynamics
12.1 Waves, Speed of Sound, Standing Waves & Doppler Effect 12.2 Wave Theory of Light, Interference & Young's Double-Slit Experiment 12.3 Diffraction Grating, Resolving Power & Polarization of Light 12.4 Optical Instruments: Magnifiers, Microscopes, Telescopes, Spectrometer & Fibre Optics 12.5 Kinetic Theory of Gases, First Law, Heat Engines & Carnot Cycle
13 Chapter 13: Physics — Electrostatics, Current Electricity & Electromagnetism
13.1 Coulomb's Law, Electric Fields, Gauss's Law & Capacitors 13.2 Electric Current, Resistance, Ohm's Law, Kirchhoff's Rules & Potentiometer 13.3 Magnetic Fields, Ampere's Law, Faraday's Law, Lenz's Law & Transformers
14 Chapter 14: Physics — Alternating Current, Physics of Solids & Electronics
14.1 Alternating Current: RMS Values, Reactance, Impedance, Resonance & Power 14.2 Physics of Solids: Elasticity, Band Theory, Superconductors & Magnetic Materials 14.3 Electronics: p-n Junction, Rectifiers, Transistors, Op-Amps & Logic Gates
15 Chapter 15: Physics — Modern, Atomic & Nuclear Physics
15.1 Special Relativity, Mass–Energy Equivalence, Pair Production & Annihilation 15.2 Photoelectric Effect, Photons, Atomic Spectra, X-Rays & Nuclear Reactions 15.3 Lasers, Nuclear Reactors, Radiation Detectors, Dosimetry & Elementary Particles
16 Chapter 16: Chemistry — Basic Concepts, Atomic Structure, Bonding & States of Matter
16.1 Mole Concept, Stoichiometry, Limiting Reactants, Isotopes & Experimental Techniques 16.2 Atomic Structure, Bohr's Model, Quantum Numbers & Electronic Configurations 16.3 Chemical Bonding: Ionic, Covalent & Coordinate Bonds, VSEPR, Hybridization & MOT 16.4 Gas Laws, Ideal Gas Equation, Kinetic Molecular Theory & Real Gases 16.5 Liquids, Intermolecular Forces, Hydrogen Bonding & Crystal Lattices
17 Chapter 17: Chemistry — Energetics, Equilibrium & Kinetics
17.1 Enthalpy Changes, Calorimetry, Hess's Law & Born-Haber Cycle 17.2 Reversible Reactions, Equilibrium Constants (Kc, Kp), Le Chatelier & Ksp 17.3 Solutions, Concentration Units, Colligative Properties & Raoult's Law 17.4 Reaction Rates, Rate Equations, Order of Reaction & Activation Energy
18 Chapter 18: Chemistry — Periodic Trends, s-, p- & d-Block Elements & Electrochemistry
18.1 Periodic Trends: Atomic Radii, Ionization Energies & Electronegativities 18.2 Chemistry of s-Block and p-Block Elements (Groups I, II, III, IV, VII) 18.3 Groups V-A & VI-A: Nitrogen, Phosphorus, Oxygen & Sulphur Compounds 18.4 Transition Elements: Electronic Configurations, Complexes & Colors 18.5 Oxidation Numbers, Electrochemical Cells, Standard Potentials & Batteries
19 Chapter 19: Chemistry — Organic Chemistry & Reaction Mechanisms
19.1 Organic Functional Groups, IUPAC Nomenclature & Structural/Stereoisomerism 19.2 Aliphatic Hydrocarbons: Alkanes, Alkenes, Alkynes & Addition Reactions 19.3 Benzene: Electronic Structure, Resonance Stability & Electrophilic Substitution 19.4 Alkyl Halides (SN1/SN2), Grignard Reagents & Functional-Group Tests 19.5 Alcohols, Phenols & Ethers: Preparation and Reactions 19.6 Aldehydes, Ketones, Carboxylic Acids, Acid Derivatives & Amino Acids
20 Chapter 20: Chemistry — Macromolecules, Chemical Industries & Environment
20.1 Macromolecules: Polymers, Carbohydrates, Proteins, Lipids, Enzymes & Nucleic Acids 20.2 Chemical Industries in Pakistan & Environmental Chemistry
21 Chapter 21: English — Reading Comprehension, Vocabulary & Grammar
21.1 Reading Comprehension Strategies, Main Ideas, Inferences & Tone 21.2 Academic Vocabulary, Context Clues, Synonyms & Antonyms 21.3 Subject-Verb Agreement, Tenses & Grammatical Concord 21.4 Sentence Correction, Parallelism, Modifiers & Prepositions
2.3 Matrices, Determinants, Inverses & Systems of Linear Equations
Key Takeaways Explain This Topic AI
Special matrix types are characterized by transposition and conjugate symmetries: symmetric ( A T = A A^T = A A T = A ), skew-symmetric ( A T = − A A^T = -A A T = − A , with zero diagonal entries), Hermitian ( A † = A A^\dagger = A A † = A , with real diagonal entries), and orthogonal ( A A T = I A A^T = I A A T = I ).
Determinants scale as ∣ k A ∣ = k n ∣ A ∣ |kA| = k^n |A| ∣ k A ∣ = k n ∣ A ∣ for an n × n n \times n n × n matrix, satisfy ∣ A B ∣ = ∣ A ∣ ∣ B ∣ |AB| = |A||B| ∣ A B ∣ = ∣ A ∣∣ B ∣ and ∣ A − 1 ∣ = 1 ∣ A ∣ |A^{-1}| = \frac{1}{|A|} ∣ A − 1 ∣ = ∣ A ∣ 1 , and vanish if any two rows or columns are identical or proportional.
The inverse of a non-singular matrix ( ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 ) is A − 1 = adj ( A ) ∣ A ∣ A^{-1} = \frac{\text{adj}(A)}{|A|} A − 1 = ∣ A ∣ adj ( A ) , and the adjoint determinant satisfies ∣ adj ( A ) ∣ = ∣ A ∣ n − 1 |\text{adj}(A)| = |A|^{n-1} ∣ adj ( A ) ∣ = ∣ A ∣ n − 1 .
A system of linear equations A X = B AX = B A X = B has a unique solution if and only if ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 ; if ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 , it has no solution when adj ( A ) ⋅ B ≠ 0 \text{adj}(A) \cdot B \neq 0 adj ( A ) ⋅ B = 0 , while adj ( A ) ⋅ B = 0 \text{adj}(A) \cdot B = 0 adj ( A ) ⋅ B = 0 leaves both infinitely many and no solutions possible, so compare rank ( A ) \text{rank}(A) rank ( A ) with rank ( [ A ∣ B ] ) \text{rank}([A|B]) rank ([ A ∣ B ]) .
Homogeneous linear systems A X = 0 AX = 0 A X = 0 always possess the trivial solution X = 0 X = 0 X = 0 ; non-trivial (infinite) solutions occur if and only if the coefficient determinant vanishes ( ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 ).
Last updated: October 2026
Matrices, Determinants, Inverses & Systems of Linear Equations
Matrices and determinants are a core FSc Part I Mathematics topic, and UET's admission FAQ names linear algebra among the ECAT Mathematics topics. Questions frequently demand fast classification of matrix symmetries, evaluation of determinants via row and column operations, rapid calculation of matrix inverses, and rigorous classification of solutions for homogeneous and non-homogeneous linear systems.
1. Classification of Square Matrices
Let A = [ a i j ] A = [a_{ij}] A = [ a ij ] be a square matrix of order n × n n \times n n × n with real or complex entries.
Real Matrix Classifications
Symmetric Matrix: A real matrix A A A is symmetric if its transpose equals itself:
A T = A ⟺ a i j = a j i ∀ i , j A^T = A \iff a_{ij} = a_{ji} \quad \forall i, j A T = A ⟺ a ij = a ji ∀ i , j
Skew-Symmetric Matrix: A matrix A A A is skew-symmetric if:
A T = − A ⟺ a i j = − a j i ∀ i , j A^T = -A \iff a_{ij} = -a_{ji} \quad \forall i, j A T = − A ⟺ a ij = − a ji ∀ i , j
Setting i = j i = j i = j along the principal diagonal gives a i i = − a i i ⟹ 2 a i i = 0 ⟹ a i i = 0 a_{ii} = -a_{ii} \implies 2a_{ii} = 0 \implies a_{ii} = 0 a ii = − a ii ⟹ 2 a ii = 0 ⟹ a ii = 0 . Thus, all diagonal elements of a skew-symmetric matrix must be zero .
Theorem: Every square matrix A A A can be uniquely decomposed into the sum of a symmetric matrix P P P and a skew-symmetric matrix Q Q Q :
A = 1 2 ( A + A T ) + 1 2 ( A − A T ) A = \frac{1}{2}(A + A^T) + \frac{1}{2}(A - A^T) A = 2 1 ( A + A T ) + 2 1 ( A − A T )
Orthogonal Matrix: A square matrix A A A is orthogonal if its transpose equals its inverse:
A A T = A T A = I ⟹ A − 1 = A T A A^T = A^T A = I \implies A^{-1} = A^T A A T = A T A = I ⟹ A − 1 = A T
Taking the determinant of both sides: ∣ A A T ∣ = ∣ A ∣ ∣ A T ∣ = ∣ A ∣ 2 = ∣ I ∣ = 1 ⟹ ∣ A ∣ = ± 1 |A A^T| = |A| |A^T| = |A|^2 = |I| = 1 \implies |A| = \pm 1 ∣ A A T ∣ = ∣ A ∣∣ A T ∣ = ∣ A ∣ 2 = ∣ I ∣ = 1 ⟹ ∣ A ∣ = ± 1 .
Complex Matrix Classifications
Let A † = ( A ‾ ) T A^\dagger = (\overline{A})^T A † = ( A ) T denote the conjugate transpose (Hermitian conjugate) of A A A :
Hermitian Matrix: A † = A ⟺ a i j = a j i ‾ A^\dagger = A \iff a_{ij} = \overline{a_{ji}} A † = A ⟺ a ij = a ji For diagonal elements: a i i = a i i ‾ a_{ii} = \overline{a_{ii}} a ii = a ii , which proves that all diagonal elements of a Hermitian matrix must be purely real .
Skew-Hermitian Matrix: A † = − A ⟺ a i j = − a j i ‾ A^\dagger = -A \iff a_{ij} = -\overline{a_{ji}} A † = − A ⟺ a ij = − a ji For diagonal elements: a i i = − a i i ‾ a_{ii} = -\overline{a_{ii}} a ii = − a ii , proving that all diagonal elements of a skew-Hermitian matrix must be either 0 or purely imaginary .
Unitary Matrix: A † A = A A † = I ⟹ ∣ A ∣ = e i ϕ ⟹ ∣ ∣ A ∣ ∣ = 1 A^\dagger A = A A^\dagger = I \implies |A| = e^{i\phi} \implies \lvert |A| \rvert = 1 A † A = A A † = I ⟹ ∣ A ∣ = e i ϕ ⟹ ∣ ∣ A ∣ ∣ = 1
Special Algebraic Forms
Idempotent Matrix: A 2 = A A^2 = A A 2 = A .
Involutory Matrix: A 2 = I ⟹ A − 1 = A A^2 = I \implies A^{-1} = A A 2 = I ⟹ A − 1 = A .
Nilpotent Matrix: A k = 0 A^k = 0 A k = 0 for some positive integer k k k ; the smallest such k k k is the index of nilpotency. (Every eigenvalue and the determinant of a nilpotent matrix are 0).
Matrix Symmetries Summary
- Matrix Type Mathematical Definition Diagonal Elements Determinant Value
- Symmetric A T = A A^T = A A T = A Any real numbers Any real scalar
Skew-Symmetric A T = − A A^T = -A A T = − A All must be 0 Zero if order n n n is odd; perfect square if n n n is even
Hermitian ( A ‾ ) T = A (\overline{A})^T = A ( A ) T = A Purely real numbers Purely real
Skew-Hermitian ( A ‾ ) T = − A (\overline{A})^T = -A ( A ) T = − A Purely imaginary or zero Purely imaginary or zero (odd order)
- Orthogonal A A T = I A A^T = I A A T = I Real numbers ± 1 \pm 1 ± 1
- 2. Properties of Determinants
The determinant ∣ A ∣ = det ( A ) |A| = \det(A) ∣ A ∣ = det ( A ) is a scalar function mapping an n × n n \times n n × n matrix to a number. Understanding its algebraic properties is key to solving ECAT questions without expanding cumbersome polynomials.
Core Properties of Determinants
Scalar Multiplication: For an n × n n \times n n × n matrix A A A and scalar k k k :
∣ k A ∣ = k n ∣ A ∣ |kA| = k^n |A| ∣ k A ∣ = k n ∣ A ∣
(A common student mistake is writing ∣ k A ∣ = k ∣ A ∣ |kA| = k|A| ∣ k A ∣ = k ∣ A ∣ ; remember that k k k is factored out of all n n n rows simultaneously).
Multiplicative Identity: For square matrices A A A and B B B of the same order:
∣ A B ∣ = ∣ A ∣ ∣ B ∣ |AB| = |A| |B| ∣ A B ∣ = ∣ A ∣∣ B ∣
Transposition Invariance: The determinant is invariant under transposition:
∣ A T ∣ = ∣ A ∣ |A^T| = |A| ∣ A T ∣ = ∣ A ∣
Row/Column Interchange: Swapping any two rows or any two columns changes the algebraic sign of the determinant:
R i ↔ R j ⟹ ∣ A ′ ∣ = − ∣ A ∣ R_i \leftrightarrow R_j \implies |A'| = -|A| R i ↔ R j ⟹ ∣ A ′ ∣ = − ∣ A ∣
Vanishing Determinant Conditions: ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 if:
An entire row or column consists solely of zeros.
Any two rows or two columns are identical ( R i = R j R_i = R_j R i = R j ).
Any two rows or two columns are proportional ( R i = k R j R_i = k R_j R i = k R j ).
Elementary Row Operations: Adding a scalar multiple of one row to another row leaves the determinant completely unchanged:
R i → R i + k R j ⟹ ∣ A ′ ∣ = ∣ A ∣ R_i \to R_i + k R_j \implies |A'| = |A| R i → R i + k R j ⟹ ∣ A ′ ∣ = ∣ A ∣
Triangular Matrices: For an upper triangular, lower triangular, or diagonal matrix, the determinant is the product of its main diagonal elements:
∣ A ∣ = a 11 ⋅ a 22 … a n n = ∏ i = 1 n a i i |A| = a_{11} \cdot a_{22} \dots a_{nn} = \prod_{i=1}^n a_{ii} ∣ A ∣ = a 11 ⋅ a 22 … a nn = ∏ i = 1 n a ii
Inverse Determinant: For a non-singular matrix A A A :
- ∣ A − 1 ∣ = 1 ∣ A ∣ |A^{-1}| = \frac{1}{|A|} ∣ A − 1 ∣ = ∣ A ∣ 1
- 3. Minors, Cofactors, Adjoint, and Inverses
- Minors and Cofactors
The minor M i j M_{ij} M ij of an entry a i j a_{ij} a ij is the determinant of the ( n − 1 ) × ( n − 1 ) (n-1) \times (n-1) ( n − 1 ) × ( n − 1 ) submatrix left after striking out row i i i and column j j j .
The cofactor C i j C_{ij} C ij is defined with its signed parity:
- C i j = ( − 1 ) i + j M i j C_{ij} = (-1)^{i+j} M_{ij} C ij = ( − 1 ) i + j M ij
- Expansion Theorem
Expanding along row i i i :
∣ A ∣ = ∑ j = 1 n a i j C i j = a i 1 C i 1 + a i 2 C i 2 + ⋯ + a i n C i n |A| = \sum_{j=1}^n a_{ij} C_{ij} = a_{i1} C_{i1} + a_{i2} C_{i2} + \dots + a_{in} C_{in} ∣ A ∣ = ∑ j = 1 n a ij C ij = a i 1 C i 1 + a i 2 C i 2 + ⋯ + a in C in
Orthogonality Property of Cofactors: If the elements of a row are multiplied by the cofactors of a different row, the sum is identically zero:
∑ j = 1 n a i j C k j = 0 for i ≠ k \sum_{j=1}^n a_{ij} C_{kj} = 0 \quad \text{for } i \neq k ∑ j = 1 n a ij C kj = 0 for i = k
The Adjoint Matrix
The adjoint (or adjugate) adj ( A ) \text{adj}(A) adj ( A ) is the transpose of the cofactor matrix :
adj ( A ) = [ C i j ] T = ( C 11 C 21 … C n 1 C 12 C 22 … C n 2 ⋮ ⋮ ⋱ ⋮ C 1 n C 2 n … C n n ) \text{adj}(A) = [C_{ij}]^T = \begin{pmatrix} C_{11} & C_{21} & \dots & C_{n1} \\ C_{12} & C_{22} & \dots & C_{n2} \\ \vdots & \vdots & \ddots & \vdots \\ C_{1n} & C_{2n} & \dots & C_{nn} \end{pmatrix} adj ( A ) = [ C ij ] T = C 11 C 12 ⋮ C 1 n C 21 C 22 ⋮ C 2 n … … ⋱ … C n 1 C n 2 ⋮ C nn
Fundamental Adjoint Identities
A ⋅ adj ( A ) = adj ( A ) ⋅ A = ∣ A ∣ I n A \cdot \text{adj}(A) = \text{adj}(A) \cdot A = |A| I_n A ⋅ adj ( A ) = adj ( A ) ⋅ A = ∣ A ∣ I n
Determinant of the adjoint:
∣ adj ( A ) ∣ = ∣ A ∣ n − 1 |\text{adj}(A)| = |A|^{n-1} ∣ adj ( A ) ∣ = ∣ A ∣ n − 1
Adjoint of an adjoint:
adj ( adj ( A ) ) = ∣ A ∣ n − 2 A \text{adj}(\text{adj}(A)) = |A|^{n-2} A adj ( adj ( A )) = ∣ A ∣ n − 2 A
∣ adj ( adj ( A ) ) ∣ = ∣ A ∣ ( n − 1 ) 2 |\text{adj}(\text{adj}(A))| = |A|^{(n-1)^2} ∣ adj ( adj ( A )) ∣ = ∣ A ∣ ( n − 1 ) 2
Matrix Inversion
A square matrix A A A is invertible (non-singular) if and only if ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 . The inverse A − 1 A^{-1} A − 1 satisfies A A − 1 = A − 1 A = I A A^{-1} = A^{-1} A = I A A − 1 = A − 1 A = I and is given by:
A − 1 = adj ( A ) ∣ A ∣ A^{-1} = \frac{\text{adj}(A)}{|A|} A − 1 = ∣ A ∣ adj ( A )
For a 2 × 2 2 \times 2 2 × 2 matrix A = ( a b c d ) A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} A = ( a c b d ) with ∣ A ∣ = a d − b c ≠ 0 |A| = ad - bc \neq 0 ∣ A ∣ = a d − b c = 0 , the inverse shortcut is:
A − 1 = 1 a d − b c ( d − b − c a ) A^{-1} = \frac{1}{ad - bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix} A − 1 = a d − b c 1 ( d − c − b a )
(Swap main diagonal elements, negate off-diagonal elements, divide by determinant).
4. Systems of Linear Equations
A system of m m m linear equations in n n n unknowns can be represented in matrix form:
A X = B AX = B A X = B
where A A A is the m × n m \times n m × n coefficient matrix, X = [ x 1 , x 2 , … , x n ] T X = [x_1, x_2, \dots, x_n]^T X = [ x 1 , x 2 , … , x n ] T is the column vector of unknowns, and B = [ b 1 , b 2 , … , b m ] T B = [b_1, b_2, \dots, b_m]^T B = [ b 1 , b 2 , … , b m ] T is the constant vector.
1. Matrix Inversion Method ( n × n n \times n n × n )
If A A A is non-singular ( ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 ):
X = A − 1 B = adj ( A ) ⋅ B ∣ A ∣ X = A^{-1} B = \frac{\text{adj}(A) \cdot B}{|A|} X = A − 1 B = ∣ A ∣ adj ( A ) ⋅ B
2. Cramer's Rule
If ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 , the unique solution is given by:
x i = ∣ A i ∣ ∣ A ∣ , i = 1 , 2 , … , n x_i = \frac{|A_i|}{|A|}, \quad i = 1, 2, \dots, n x i = ∣ A ∣ ∣ A i ∣ , i = 1 , 2 , … , n
where A i A_i A i is the matrix formed by replacing the i i i -th column of A A A with the constant vector B B B .
3. Consistency and Solvability Criteria
For an n × n n \times n n × n non-homogeneous system A X = B AX = B A X = B :
Unique Solution (Consistent & Independent): ∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 The rank of the coefficient matrix equals the rank of the augmented matrix: rank ( A ) = rank ( [ A ∣ B ] ) = n \text{rank}(A) = \text{rank}([A|B]) = n rank ( A ) = rank ([ A ∣ B ]) = n .
Infinitely Many Solutions (Consistent & Dependent): ∣ A ∣ = 0 and rank ( A ) = rank ( [ A ∣ B ] ) < n |A| = 0 \quad \text{and} \quad \text{rank}(A) = \text{rank}([A|B]) < n ∣ A ∣ = 0 and rank ( A ) = rank ([ A ∣ B ]) < n The determinant check adj ( A ) ⋅ B = 0 \text{adj}(A) \cdot B = 0 adj ( A ) ⋅ B = 0 (equivalently ∣ A 1 ∣ = ∣ A 2 ∣ = ⋯ = ∣ A n ∣ = 0 |A_1| = |A_2| = \dots = |A_n| = 0 ∣ A 1 ∣ = ∣ A 2 ∣ = ⋯ = ∣ A n ∣ = 0 ) is necessary but not sufficient for 3 × 3 3 \times 3 3 × 3 systems. For example, x + y + z = 1 x + y + z = 1 x + y + z = 1 , x + y + z = 2 x + y + z = 2 x + y + z = 2 , x + y + z = 3 x + y + z = 3 x + y + z = 3 gives ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 , adj ( A ) = 0 \text{adj}(A) = 0 adj ( A ) = 0 and every ∣ A i ∣ = 0 |A_i| = 0 ∣ A i ∣ = 0 , yet the three parallel planes have no common point. When the determinant test is inconclusive, row-reduce the augmented matrix and compare ranks.
No Solution (Inconsistent): rank ( A ) < rank ( [ A ∣ B ] ) \text{rank}(A) < \text{rank}([A|B]) rank ( A ) < rank ([ A ∣ B ]) A quick sufficient test: if ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 and adj ( A ) ⋅ B ≠ 0 \text{adj}(A) \cdot B \neq 0 adj ( A ) ⋅ B = 0 (at least one ∣ A i ∣ ≠ 0 |A_i| \neq 0 ∣ A i ∣ = 0 ), the system is certainly inconsistent.
5. Homogeneous Linear Systems ( A X = 0 AX = 0 A X = 0 )
When B = 0 B = 0 B = 0 , the system is termed homogeneous :
a 11 x 1 + a 12 x 2 + ⋯ + a 1 n x n = 0 a_{11}x_1 + a_{12}x_2 + \dots + a_{1n}x_n = 0 a 11 x 1 + a 12 x 2 + ⋯ + a 1 n x n = 0
Trivial Solution: x 1 = x 2 = ⋯ = x n = 0 x_1 = x_2 = \dots = x_n = 0 x 1 = x 2 = ⋯ = x n = 0 is always a valid solution.
Non-Trivial Solutions: Non-zero solutions exist if and only if the coefficient matrix is singular:
∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0
When ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 , the system has an infinite number of non-trivial solutions, and the dimension of the solution space is the nullity n − rank ( A ) n - \text{rank}(A) n − rank ( A ) .
ECAT Recurring Pattern: Problems asking for a parameter λ \lambda λ such that a homogeneous system has "non-zero solutions" or "non-trivial solutions" simply require setting ∣ A ∣ = 0 |A| = 0 ∣ A ∣ = 0 and solving the resulting polynomial for λ \lambda λ .
- 6. High-Speed ECAT Determinant Shortcuts
- Shortcut 1: Circulant Determinant
The cyclic determinant occurs frequently in ECAT algebra:
∣ a b c b c a c a b ∣ = − ( a + b + c ) ( a 2 + b 2 + c 2 − a b − b c − c a ) = 3 a b c − a 3 − b 3 − c 3 \begin{vmatrix} a & b & c \\ b & c & a \\ c & a & b \end{vmatrix} = -(a + b + c)(a^2 + b^2 + c^2 - ab - bc - ca) = 3abc - a^3 - b^3 - c^3 a b c b c a c a b = − ( a + b + c ) ( a 2 + b 2 + c 2 − ab − b c − c a ) = 3 ab c − a 3 − b 3 − c 3
If a + b + c = 0 a + b + c = 0 a + b + c = 0 , the determinant vanishes instantly.
Shortcut 2: Skew-Symmetric Matrices of Odd Order
If A A A is skew-symmetric of order n × n n \times n n × n where n n n is odd, then:
∣ A ∣ = ∣ A T ∣ = ∣ − A ∣ = ( − 1 ) n ∣ A ∣ = − ∣ A ∣ ⟹ 2 ∣ A ∣ = 0 ⟹ ∣ A ∣ = 0 |A| = |A^T| = |-A| = (-1)^n |A| = -|A| \implies 2|A| = 0 \implies |A| = 0 ∣ A ∣ = ∣ A T ∣ = ∣ − A ∣ = ( − 1 ) n ∣ A ∣ = − ∣ A ∣ ⟹ 2∣ A ∣ = 0 ⟹ ∣ A ∣ = 0
Any 3 × 3 3 \times 3 3 × 3 or 5 × 5 5 \times 5 5 × 5 skew-symmetric matrix has a determinant of 0 without calculating any products!
Shortcut 3: Linearly Dependent Rows/Columns via Inspection
Check if adding two rows creates a multiple of the third row. For instance, if R 1 + R 2 = R 3 R_1 + R_2 = R_3 R 1 + R 2 = R 3 , the determinant is zero immediately.