Examius
🇮🇳 GATE Statistics · subject
GATE Statistics Matrix Theory Syllabus
Every chapter and topic of Matrix Theory examined in GATE Statistics — 10 chapters, 12 topics, plus 50 flashcards written against it.
Matrix Theory syllabus — full chapter and topic list
Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Matrix Theory in GATE Statistics, not a summary of it.
-
Subspaces of a matrix
3 topics- Span
- Linear Independence
- Basis and Dimension
-
Row Space and Column Space of a Matrix
2 topics- Rank and Nullity
- Row Reduced Echelon Form
-
Trace and Determinant
overviewExamined as a single unit within Matrix Theory — no further topic split in the official outline.
-
Inverse of a Matrix
overviewExamined as a single unit within Matrix Theory — no further topic split in the official outline.
-
Systems of Linear Equations
overviewExamined as a single unit within Matrix Theory — no further topic split in the official outline.
-
Inner Products in R^n
1 topic- Gram-Schmidt Orthonormalization
-
Eigen Values and Eigen Vectors
2 topics- Characteristic Polynomial
- Cayley-Hamilton Theorem
-
Symmetric, Skew-Symmetric, Hermitian, Skew-Hermitian, Orthogonal, Unitary Matrices and their Eigen Values
3 topics- Change of Basis Matrix
- Equivalence and Similarity
- Diagonalizability
-
Positive Definite and Positive Semi-Definite Matrices and their Properties
1 topic- Quadratic Forms
-
Singular Value Decomposition
overviewExamined as a single unit within Matrix Theory — no further topic split in the official outline.
Matrix Theory flashcards for GATE Statistics
20 of 50 cards from the Matrix Theory deck — real questions with worked answers.
What is the span of a set of vectors $\{v_1, v_2, \dots, v_k\}$ in a vector space $V$?
The span is the set of all linear combinations of those vectors: $\text{span}\{v_1,\dots,v_k\} = \{ c_1 v_1 + c_2 v_2 + \cdots + c_k v_k : c_i \in \mathbb{F}\}$. It is always a subspace of $V$.
What does it mean for a set of vectors to be a spanning set of a vector space $V$?
Every vector in $V$ can be written as a linear combination of the set; that is, $\text{span}\{v_1,\dots,v_k\} = V$.
When are vectors $v_1, v_2, \dots, v_k$ said to be linearly independent?
When the only solution to $c_1 v_1 + c_2 v_2 + \cdots + c_k v_k = \vec{0}$ is the trivial one $c_1 = c_2 = \cdots = c_k = 0$.
When is a set of vectors linearly dependent?
When there exist scalars $c_1,\dots,c_k$, not all zero, such that $c_1 v_1 + \cdots + c_k v_k = \vec{0}$. Equivalently, at least one vector is a linear combination of the others.
How can linear independence of $n$ vectors in $\mathbb{R}^{n}$ be tested using a determinant?
Form the matrix $A$ whose columns are the vectors. They are linearly independent if and only if $\det(A) \neq 0$ (equivalently $A$ is invertible).
What is the maximum number of linearly independent vectors possible in $\mathbb{R}^{n}$?
At most $n$. Any set of more than $n$ vectors in $\mathbb{R}^{n}$ is necessarily linearly dependent.
What is a basis of a vector space $V$?
A set of vectors that is both linearly independent and spans $V$. Every vector in $V$ then has a unique representation as a linear combination of the basis vectors.
Define the dimension of a vector space $V$.
The number of vectors in any basis of $V$, denoted $\dim(V)$. All bases of a finite-dimensional space have the same number of elements.
What is the standard (canonical) basis of $\mathbb{R}^{n}$?
The set $\{e_1, e_2, \dots, e_n\}$ where $e_i$ has a $1$ in the $i$-th position and $0$ elsewhere. Its dimension is $n$.
In an $n$-dimensional space, what is true of any set of exactly $n$ linearly independent vectors?
It automatically forms a basis (it must also span the space). Likewise any spanning set of exactly $n$ vectors is automatically linearly independent and a basis.
Define the rank of a matrix $A$.
The dimension of its column space (equal to the dimension of its row space). It equals the number of pivots / number of nonzero rows in its row echelon form, i.e. the number of linearly independent rows or columns.
Define the nullity of a matrix $A$.
The dimension of its null space (kernel): $\text{nullity}(A) = \dim\{x : Ax = \vec{0}\}$. It equals the number of free variables in the system $Ax = \vec{0}$.
State the Rank-Nullity Theorem for an $m \times n$ matrix $A$.
$$\text{rank}(A) + \text{nullity}(A) = n$$ where $n$ is the number of columns (the dimension of the domain).
Why does the row rank of a matrix always equal its column rank?
It is a fundamental theorem of linear algebra: for any matrix, the dimension of the row space equals the dimension of the column space, so a single number 'rank' is well defined.
For an $m \times n$ matrix $A$, what is the maximum possible value of $\text{rank}(A)$?
$\text{rank}(A) \leq \min(m, n)$. When equality holds, $A$ is said to have full rank.
What is the relationship between the rank of an $n \times n$ matrix and its invertibility?
An $n \times n$ matrix $A$ is invertible if and only if $\text{rank}(A) = n$ (full rank), equivalently $\det(A) \neq 0$ and $\text{nullity}(A) = 0$.
What are the defining conditions for a matrix to be in Row Reduced Echelon Form (RREF)?
(1) Every leading entry (pivot) is $1$; (2) each pivot $1$ is the only nonzero entry in its column; (3) each pivot lies to the right of the pivot in the row above; (4) all zero rows are at the bottom.
How does the difference between Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) appear?
REF requires zeros only below each pivot (pivots need not be $1$). RREF additionally requires leading entries equal to $1$ and zeros both above and below each pivot. RREF is unique; REF is not.
Which three elementary row operations are used to reach RREF?
(1) Swap two rows; (2) multiply a row by a nonzero scalar; (3) add a scalar multiple of one row to another. These preserve the row space and the solution set.
How do you read off the rank of a matrix from its RREF?
The rank equals the number of nonzero rows (equivalently the number of pivot/leading-1 columns) in the RREF.
Planning Matrix Theory for GATE Statistics
Matrix Theory is about 10% of the GATE Statistics syllabus by topic count — 12 of 116 topics, spread over 10 chapters. At roughly 45 minutes per topic plus 12 minutes per sub-topic, a first pass runs to about 9 hours.
The heaviest chapters are Subspaces of a matrix (3 topics), Symmetric, Skew-Symmetric, Hermitian, Skew-Hermitian, Orthogonal, Unitary Matrices and their Eigen Values (3 topics), Row Space and Column Space of a Matrix (2 topics) . Front-load those while your energy is high; the short chapters are better revision filler later.
Work top-down: read the chapter, then tick topics off individually rather than marking the whole chapter done. Sub-topics are where silent gaps hide.
Matrix Theory (GATE Statistics) FAQ
What is in the GATE Statistics Matrix Theory syllabus?
Matrix Theory is split into 10 chapters — Subspaces of a matrix, Row Space and Column Space of a Matrix, Trace and Determinant, Inverse of a Matrix, Systems of Linear Equations and Inner Products in R^n, and 4 more, containing 12 topics and 0 sub-topics in total.
How many chapters are there in Matrix Theory for GATE Statistics?
10 chapters. Matrix Theory accounts for about 10% of the topics in the whole GATE Statistics syllabus (12 of 116).
How long should I spend on Matrix Theory for GATE Statistics?
Budget around 9 hours for a first pass through Matrix Theory — about 45 minutes per topic plus 12 minutes per sub-topic across its 12 topics. Add revision cycles on top.
Are there flashcards for GATE Statistics Matrix Theory?
Yes — a 50-card Matrix Theory deck. Sample cards are printed on this page, and the full deck is free in the Examius app with spaced repetition scheduling.