7. Linear Algebra

Dimension of a vector space

The dimension of a vector space is defined as the cardinality of any of its bases, representing the maximal number of linearly independent vectors or the minimal number of generators.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade

📖 Topic progress

○ Mark as complete

Definition and statement

Invariance of Dimension Theorem

If $V$ is a finitely generated vector space over a field $\mathbb{F}$, then any two bases of $V$ have the exact same number of elements. Furthermore, if $\dim(V) = n$, then any linearly independent set of $n$ vectors is a basis, and any spanning set of $n$ vectors is a basis.

📐 Geometric Interpretation

Geometrically, dimension describes the degrees of freedom or independent directions available in a space (e.g., a line is 1-dimensional, a plane is 2-dimensional, and physical space is 3-dimensional).

⚙️ Algebraic & Structural Meaning

Algebraically, it establishes that vector spaces over the same field are isomorphic if and only if their dimensions are equal, reducing structural problems to scalar dimension counting.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition	Domain / Interval	Necessity	What Fails If Condition Dropped
Finitely Generated Vector Space	`Algebraic Structure over field $\mathbb{F}$`	Strictly Mandatory / Necessary	Infinite-dimensional spaces (such as $\mathbb{R}[x]$ or the space of continuous functions) do not possess a finite basis, making standard dimension formulas inapplicable.
Linear Independence of Basis	`Subset of $V$`	Strictly Mandatory	If a generating set contains linearly dependent vectors, removing them alters the count, and the cardinality ceases to be a unique invariant until a maximal linearly independent subset is extracted.
Field Consistency	`Scalars in $\mathbb{F}$`	Essential for scalar multiplication	The dimension of a vector space depends crucially on the underlying field. For instance, $\mathbb{C}$ as a vector space over $\mathbb{C}$ has dimension $1$, but over $\mathbb{R}$ it has dimension $2$.

Useful results and shortcuts

Use these identities and results when their conditions apply:

Dimension of Polynomial Spaces

$$\dim(P_n) = n + 1$$

Rule: The space of polynomials of degree at most $n$, denoted $P_n$ or $\mathbb{R}_n[x]$, has dimension $n+1$ because the standard basis is $\{1, x, x^2, \dots, x^n\}.

Application: Frequently asked in UP PGT and KVS PGT to find dimensions of restricted polynomial subspaces.

Dimension of Matrix Spaces

$$\dim(M_{m \times n}(\mathbb{F})) = m \times n$$

Rule: The vector space of all $m \times n$ matrices has dimension $mn$. For square matrices of order $n$: Symmetric matrices have dimension $\frac{n(n+1)}{2}$, Skew-symmetric matrices have dimension $\frac{n(n-1)}{2}$, and Diagonal matrices have dimension $n$.

Dimension of Subspace Intersections and Sums

$$\dim(W_1 + W_2) = \dim(W_1) + \dim(W_2) - \dim(W_1 \cap W_2)$$

Rule: Use the modular identity to instantly compute the missing dimension when three of the four values are provided.

Complex vs. Real Dimensions

$$\dim_{\mathbb{R}}(V_{\mathbb{C}}) = 2 \times \dim_{\mathbb{C}}(V_{\mathbb{C}})$$

Rule: When a complex vector space of dimension $n$ is viewed as a real vector space, its dimension is doubled.

Application: Tricky conceptual question appearing in PGT screening tests.

Rank-Nullity Theorem Shortcut

$$\dim(V) = \text{Rank}(T) + \text{Nullity}(T)$$

Rule: For a linear transformation $T: V \to W$, the dimension of the domain equals the rank plus the nullity.

Trace Zero Matrix Subspace

$$\dim(\{A \in M_{n \times n}(\mathbb{F}) : \text{tr}(A) = 0\}) = n^2 - 1$$

Rule: Imposing a single homogeneous linear constraint (like trace zero) reduces the dimension of the space by exactly 1.

Application: Asked to test deeper understanding of subspace constraints in UP PGT.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

Field Dependence Fallacy

Common Pitfall: Assuming the dimension of a vector space is absolute regardless of the scalar field.

Counterexample: $V = \mathbb{C}$, $\dim_{\mathbb{C}}(\mathbb{C}) = 1$ vs $\dim_{\mathbb{R}}(\mathbb{C}) = 2$

Why it fails: The choice of the underlying scalar field dictates scalar multiplication rules and consequently the basis set.

🛡️ Exam Defense: Always read the subscript of the vector space notation carefully: $V(\mathbb{F})$ or $\dim_{\mathbb{F}}(V)$.

⚠️ COMMON ERROR #02

Dimension of Union Subspace Mistake

Common Pitfall: Writing $\dim(W_1 \cup W_2) = \dim(W_1) + \dim(W_2)$.

Counterexample: $W_1$ and $W_2$ are intersecting subspaces

Why it fails: The union of two subspaces is generally not a subspace unless one is contained in the other. The dimension formula applies to the sum $W_1 + W_2$, not the union.

🛡️ Exam Defense: Never add dimensions for unions; always use the sum formula for vector spaces.

Comparison

Concept / Theorem	Hypotheses / Assumptions	Key Formula / Outcome	Geometric Meaning	Exam Identification Clue
Full Matrix Space $M_{n \times n}$	All $n \times n$ matrices over $\mathbb{F}$	$\dim = n^2$	Total unconstrained scalar entries	Keyword: 'all matrices'
Symmetric Matrices	$A = A^T$	$\dim = \frac{n(n+1)}{2}$	Main diagonal and upper triangle free	Keyword: 'symmetric'
Skew-Symmetric Matrices	$A = -A^T$	$\dim = \frac{n(n-1)}{2}$	Zero diagonal, upper triangle free	Keyword: 'skew-symmetric'
Trace Zero Matrices	$\text{tr}(A) = 0$	$\dim = n^2 - 1$	Hyperplane cut inside matrix space	Keyword: 'trace zero' or 'spur zero'

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

Find the dimension of the vector space of all symmetric matrices of order $n$ with trace equal to zero over the field $\mathbb{R}$.

(A) $\frac{n(n+1)}{2}$(B) $\frac{n(n+1)}{2} - 1$(C) $\frac{n(n-1)}{2}$(D) $n^2 - 1$

📚 Method A: Formal Textbook Derivation

Step 1: The dimension of symmetric matrices of order $n$ is $\frac{n(n+1)}{2}$. Step 2: The trace condition $\text{tr}(A) = 0$ imposes 1 independent linear constraint on the diagonal elements. Step 3: Subtract 1 from the dimension, yielding $\frac{n(n+1)}{2} - 1$.

⚡ Method B: 25-Second Exam Shortcut

Start with symmetric dimension $\frac{n(n+1)}{2}$ and subtract 1 for the trace condition.

💡 Tip: Watch out for combined constraints in matrix subspaces.

CANONICAL PROBLEM 02 Dual-Method Breakdown

If $W_1$ and $W_2$ are two subspaces of a vector space $V$ such that $\dim(W_1) = 3$, $\dim(W_2) = 4$, and $\dim(W_1 \cap W_2) = 1$, then what is $\dim(W_1 + W_2)$?

(A) 7(B) 6(C) 5(D) 8

📚 Method A: Formal Textbook Derivation

Step 1: Apply modular identity $\dim(W_1 + W_2) = \dim(W_1) + \dim(W_2) - \dim(W_1 \cap W_2)$. Step 2: Substitute values: $3 + 4 - 1 = 6$.

⚡ Method B: 25-Second Exam Shortcut

Direct arithmetic: $3 + 4 - 1 = 6$.

💡 Tip: Standard formula substitution question; solve.

Practice questions

Choose an answer to check it and see the solution:

What is the dimension of the vector space $\mathbb{C}$ over the field $\mathbb{R}$?

A 1

B 2

C 0

D Infinite

Derivation & Analysis:

The basis for $\mathbb{C}$ over $\mathbb{R}$ is $\{1, i\}$, which contains 2 elements. Hence, the dimension is 2.

What is the dimension of the vector space of all diagonal matrices of order $n$?

A $n^2$

B $n$

C $n(n-1)/2$

D $n(n+1)/2$

Derivation & Analysis:

A diagonal matrix has only its diagonal entries non-zero, yielding $n$ independent free parameters.

If $V$ is a vector space of dimension $n$, then any subset of $V$ containing more than $n$ vectors is:

A Linearly independent

B A basis

C Linearly dependent

D A spanning set

Derivation & Analysis:

By fundamental dimension theorems, any set containing more than $n$ vectors in an $n$-dimensional space must be linearly dependent.

What is the dimension of the zero vector space $\{0\}$?

A 1

B 0

C Not defined

D Infinity

Derivation & Analysis:

The zero vector space has the empty set as its basis. The cardinality of the empty set is 0.

What is the dimension of the vector space of all polynomials of degree at most $n$?

A $n$

B $n-1$

C $n+1$

D $2n$

Derivation & Analysis:

The standard basis is $\{1, x, x^2, \dots, x^n\}$, which has $n+1$ elements.

Let $W$ be the subspace of $M_{3 \times 3}(\mathbb{R})$ consisting of skew-symmetric matrices. What is $\dim(W)$?

A 9

B 6

C 3

D 4

Derivation & Analysis:

For a skew-symmetric matrix of order $n=3$, the dimension is $\frac{n(n-1)}{2} = \frac{3(2)}{2} = 3$.

If $W_1$ and $W_2$ are subspaces of dimensions 3 and 5 respectively, what is the minimum possible dimension of $W_1 \cap W_2$?

A 0

B 3

C 2

D 1

Derivation & Analysis:

Using modular identity and maximal possible sum dimension $\dim(W_1 + W_2) \le \dim(V)$, the intersection can be 0 if they are direct sums.

What is the dimension of $\mathbb{R}$ considered as a vector space over the field of rational numbers $\mathbb{Q}$?

A 1

B Countable

C Uncountable (Infinite)

D Zero

Derivation & Analysis:

$\mathbb{R}$ is an uncountable dimensional vector space over $\mathbb{Q}$.

If $T: \mathbb{R}^5 \to \mathbb{R}^3$ is a linear transformation, what is the maximum possible rank of $T$?

A 5

B 3

C 2

D 8

Derivation & Analysis:

By rank-nullity theorem, $\text{Rank}(T) + \text{Nullity}(T) = 5$, and image is a subspace of $\mathbb{R}^3$, so $\text{Rank}(T) \le 3$.

Q10

Which of the following sets forms a basis for $\mathbb{R}^2$?

A $\{(1, 2), (2, 4)\}$

B $\{(1, 0), (0, 1), (1, 1)\}$

C $\{(1, 1), (1, -1)\}$

D $\{(0, 0), (1, 1)\}$

Derivation & Analysis:

The vectors $(1, 1)$ and $(1, -1)$ are linearly independent and span $\mathbb{R}^2$ as there are 2 vectors with non-zero determinant.

Common questions

No, dimension is defined as the cardinality of a basis set, which is always a non-negative integer or infinity.

Students forget that the underlying field dictates scalar multiplication. A complex space has twice the dimension when treated over the real field because both the real and imaginary parts act as independent scalar components.

Memorize standard formulas: $n^2$ for full matrices, $\frac{n(n+1)}{2}$ for symmetric matrices, and $\frac{n(n-1)}{2}$ for skew-symmetric matrices, subtracting 1 for each independent linear constraint like trace zero.

← Previous Topic

Basis of a vector space

Next Topic →

Direct sum of subspaces