∫ SJ Maths Mathematics Notes
UP PGT Tracker UP TGT Tracker
7. Linear Algebra

Singular linear transformations

A linear transformation $T: V \to W$ is called singular if its kernel (null space) is non-trivial, meaning $\ker(T) \neq \{0\}$ or equivalently its determinant/rank is deficient. Geometrically, such transformations collapse higher-dimensional spaces into lower-dimensional subspaces, resulting in a non-invertible operator. This topic covers this concept.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade
📖 Topic progress
○ Mark as complete

Definition and statement

Singular Transformation & Rank-Nullity Theorem
Let $V$ and $W$ be finite-dimensional vector spaces over a field $\mathbb{F}$ with $\dim(V) = n$, and let $T: V \to W$ be a linear transformation. Then $T$ is singular if and only if $\text{nullity}(T) = \dim(\ker(T)) > 0$. Furthermore, by the Rank-Nullity Theorem, $\text{rank}(T) + \text{nullity}(T) = \dim(V)$, which implies $T$ is singular if and only if $\text{rank}(T) < \dim(V).$

📐 Geometric Interpretation

Geometrically, a singular linear transformation squashes or collapses entire subspaces (lines, planes, or volumes) into the origin or lower-dimensional manifolds. For instance, a singular operator on $\mathbb{R}^3$ may project all space onto a single plane or line, destroying volume.

⚙️ Algebraic & Structural Meaning

Algebraically, if $T$ is represented by a square matrix $A$ with respect to a basis, $T$ is singular if and only if $\det(A) = 0$. This means $A$ is non-invertible, has a zero eigenvalue, and possesses linear dependent columns or rows.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition Domain / Interval Necessity What Fails If Condition Dropped
Finite-dimensional Vector Spaces Vector space dimension $n < \infty$ Strictly Mandatory / Necessary In infinite-dimensional spaces, a linear operator can be injective yet not surjective (e.g., right shift operator), breaking standard matrix rank-nullity equivalences.
Linearity of the Mapping $T(cu + dv) = cT(u) + dT(v)$ Strictly Mandatory If non-linear, concepts of kernel, rank, and matrix determinants fail entirely.
Square Matrix Representation (for determinant test) $n \times n$ matrix $A$ Essential for determinant criterion Rectangular matrices cannot have a determinant; singularity must be tested strictly via rank or nullity.

Useful results and shortcuts

Use these identities and results when their conditions apply:

01

Determinant Zero Test for Matrix Operators

$$ \det(A) = 0 \iff T \text{ is singular} $$

Rule: For square matrix $A$ representing $T$, instantly calculate $\det(A) = 0$ instead of finding eigenvectors or kernel bases.

Application: Directly tested in UP PGT to find unknown parameters $k$ making a transformation non-invertible.
02

Zero Eigenvalue Condition

$$ \lambda = 0 \text{ is an eigenvalue of } A $$

Rule: A linear operator $T$ is singular if and only if $0$ is an eigenvalue of its matrix representation.

Application: Frequently used in KVS/NVS PGT matching lists and matrix property questions.
03

Rank Deficiency Rule

$$ \text{rank}(A) < n $$

Rule: If the row rank or column rank of the transformation matrix is less than its order $n$, it is singular.

04

Homogeneous System Non-Trivial Solution

$$ AX = 0 \text{ has non-zero solutions } X \neq 0 $$

Rule: A transformation is singular if the homogeneous equation has infinitely many solutions.

Application: Crucial for system of linear equations questions in UP TGT.
05

Trace and Product of Eigenvalues

$$ \prod_{i=1}^{n} \lambda_i = \det(A) = 0 $$

Rule: If the product of all eigenvalues is zero, at least one eigenvalue is zero, hence singular.

06

Rapid Elimination via Column Dependency

$$ \text{Col}_i = c \cdot \text{Col}_j $$

Rule: If any two columns or rows are proportional or linear combinations of others, $\det=0$, instantly mark as singular.

Common errors and counterexamples

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

⚠️ COMMON ERROR #01

Confusing Singular with Zero Transformation

Common Pitfall: Candidates assume a singular transformation must map every vector to zero ($T(v) = 0$ for all $v$).

Counterexample: $T(x, y) = (x, 0)$ on $\mathbb{R}^2$

Why it fails: Here $\ker(T) = \{(0, y) \mid y \in \mathbb{R}\} \neq \{(0,0)\}$, so $T$ is singular, but $T(1, 1) = (1, 0) \neq (0,0)$.

🛡️ Exam Defense: Singular only requires at least one non-zero vector to map to zero, not all vectors.
⚠️ COMMON ERROR #02

Assuming Left-Invertibility Implies Singularity Status

Common Pitfall: Forgetting that non-square transformations can be singular or non-singular based on injectivity/surjectivity definitions.

Counterexample: $T: \mathbb{R}^2 \to \mathbb{R}^3$

Why it fails: A linear transformation from a lower to a higher dimension can never be surjective, but can be injective (non-singular).

🛡️ Exam Defense: Always check domain and co-domain dimensions before applying determinant rules.

Comparison

Concept / TheoremHypotheses / AssumptionsKey Formula / OutcomeGeometric MeaningExam Identification Clue
Singular TransformationFinite-dimensional vector space $V$$\det(A) = 0$ or $\text{nullity} > 0$Collapses space, non-invertibleFind parameter for non-invertible matrix
Non-Singular TransformationFinite-dimensional vector space $V$$\det(A) \neq 0$ or $\text{nullity} = 0$Bijective, volume-preserving scaleInvertible operator questions
Rank-Nullity TheoremLinear map $T: V \to W$, $\dim(V) < \infty$$\text{rank}(T) + \text{nullity}(T) = \dim(V)$Dimension conservation lawGiven rank, find nullity or vice versa
Zero TransformationAny vector spaces $V, W$$T(v) = 0 \quad \forall v \in V$Maps everything to originTrivial kernel equals whole domain

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

Find the value of $k$ for which the linear transformation $T: \mathbb{R}^3 \to \mathbb{R}^3$ given by matrix $A = \begin{pmatrix} 1 & 2 & 3 \\ 2 & k & 6 \\ 3 & 6 & 9 \end{pmatrix}$ is singular.

(A) $4$(B) $5$(C) Any real number / $4$(D) $0$
✓ Correct Answer: (C)
📚 Method A: Formal Textbook Derivation
Step 1: Compute $\det(A)$. Notice that row 3 is $3$ times row 1. Step 2: Since rows are linearly dependent, $\det(A) = 0$ for any value of $k$ unless row 2 introduces independence, but even with general $k$, observe row 2 and row 3. Specifically, if $k=4$, row 2 is $(2, 4, 6)$, which is $2 \times$ row 1, making $\det=0$. Wait, let's examine row 1 $(1,2,3)$ and row 3 $(3,6,9)$. They are proportional. Hence $\det(A) = 0$ regardless of $k$!
⚡ Method B: 25-Second Exam Shortcut
Instantly observe that Row 3 = $3 \times$ Row 1. A matrix with proportional rows has determinant zero for all values of $k$. Thus $T$ is singular for all $k \in \mathbb{R}$.
💡 Tip: Always scan rows and columns for proportional vectors before calculating lengthy determinants.
CANONICAL PROBLEM 02 Dual-Method Breakdown

If $T: \mathbb{R}^2 \to \mathbb{R}^2$ is a linear transformation defined by $T(x, y) = (x + ky, 2x + 4y)$ is singular, then $k = $?

(A) $1$(B) $2$(C) $3$(D) $4$
✓ Correct Answer: (B)
📚 Method A: Formal Textbook Derivation
Step 1. Write the matrix of $T$: $A = \begin{pmatrix} 1 & k \\ 2 & 4 \end{pmatrix}$. Step 2. For $T$ to be singular, $\det(A) = 0$. Step 3. $\det(A) = (1)(4) - (k)(2) = 4 - 2k = 0 \implies 2k = 4 \implies k = 2$.
⚡ Method B: 25-Second Exam Shortcut
Set matrix determinant to zero: $1(4) - k(2) = 0 \implies k = 2$. Takes 5 seconds.
💡 Tip: Convert coordinate transformation rules into standard matrix form immediately.

Practice questions

Choose an answer to check it and see the solution:

Q1
MCQ 1: A linear transformation $T: V \to W$ is singular if:
A $\ker(T) = \{0\}$
B $\text{nullity}(T) > 0$
C $T$ is injective
D $T$ is bijective
Derivation & Analysis:

By definition, a linear transformation is singular if its kernel contains non-zero vectors, i.e., nullity $> 0$.

Q2
MCQ 2: If $A$ is a $4 \times 4$ matrix representing a singular linear operator $T$, then its rank can be:
A $4$
B $3$ or less
C Always $0$
D Always $2$
Derivation & Analysis:

Since $T$ is singular, $\det(A) = 0$, so $\text{rank}(A) < 4$. Thus rank can be $3, 2, 1$, or $0$.

Q3
MCQ 3: If $\dim(V) = 5$ and $T: V \to V$ is a singular linear transformation with $\text{rank}(T) = 3$, then $\text{nullity}(T)$ is:
A $0$
B $1$
C $2$
D $5$
Derivation & Analysis:

By Rank-Nullity Theorem: $\text{rank}(T) + \text{nullity}(T) = \dim(V) \implies 3 + \text{nullity}(T) = 5 \implies \text{nullity}(T) = 2$.

Q4
MCQ 4: Which of the following matrices represents a singular linear transformation on $\mathbb{R}^2$?
A $\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$
B $\begin{pmatrix} 2 & 3 \\ 4 & 6 \end{pmatrix}$
C $\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}$
D $\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}$
Derivation & Analysis:

For $\begin{pmatrix} 2 & 3 \\ 4 & 6 \end{pmatrix}$, $\det = (2)(6) - (3)(4) = 12 - 12 = 0$. Hence it is singular.

Q5
MCQ 5: If $T(x, y, z) = (x + y, y + z, x + z)$ on $\mathbb{R}^3$, then $T$ is:
A Singular
B Non-singular
C Zero transformation
D Invertible
Derivation & Analysis:

The matrix of $T$ is $\begin{pmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 1 \end{pmatrix}$. Its determinant is $1(1) - 1(-1) = 2 \neq 0$. Thus it is non-singular.

Q6
MCQ 6: If $T: V \to W$ is a singular linear transformation, which statement is always true?
A $T$ is one-to-one
B $T$ is onto
C $T$ is not invertible
D $W$ is trivial
Derivation & Analysis:

Singular linear operators have a non-trivial kernel, meaning they are not injective and hence not invertible.

Q7
MCQ 7: The eigenvalues of a singular linear operator always include:
A $1$
B $-1$
C $0$
D Imaginary numbers
Derivation & Analysis:

A linear operator is singular if and only if zero is an eigenvalue ($\det(A - 0I) = \det(A) = 0$).

Q8
MCQ 8: Assertion (A): Every linear transformation from $\mathbb{R}^3$ to $\mathbb{R}^2$ is singular. Reason (R): The dimension of the domain exceeds the dimension of the co-domain.
A Both (A) and (R) are true and (R) is the correct explanation of (A)
B Both (A) and (R) are true but (R) is not the correct explanation
C (A) is true but (R) is false
D (A) is false but (R) is true
Derivation & Analysis:

By Rank-Nullity, $\text{rank} + \text{nullity} = 3$. Since $\text{rank} \le \dim(\mathbb{R}^2) = 2$, nullity must be at least $1$. Thus $T$ is always singular.

Q9
MCQ 9: If $A$ is a square matrix of order $n$ and $\det(A) = 0$, then the dimension of the solution space of $AX = 0$ is:
A $0$
B $n$
C At least $1$
D Equal to $n$
Derivation & Analysis:

Since $\det(A) = 0$, the transformation is singular, so $\text{nullity} = \dim(\ker(T)) \ge 1$.

Q10
MCQ 10: Let $T: \mathbb{R}^2 \to \mathbb{R}^2$ be a projection onto the x-axis. Then $T$ is:
A Non-singular
B Singular
C Invertible
D Identity
Derivation & Analysis:

The matrix for projection onto x-axis is $\begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix}$. Its determinant is $0$, making it a singular transformation.

Common questions

Yes, if the transformation maps from a higher-dimensional space to a lower-dimensional space (e.g., $T: \mathbb{R}^3 \to \mathbb{R}^2$), it can be surjective while still being singular because its kernel is non-trivial.

For square matrices, compute the determinant $\det(A)$. If $\det(A) = 0$, it is singular. For general linear maps, check if the columns/rows are linearly dependent or if the nullity is strictly greater than zero.

Look for row/column linear dependencies, proportional rows, or zero rows. If any exist, the determinant is instantly zero, identifying the transformation as singular without full expansion.

← Previous Topic
Rank of linear transformation
Next Topic →
Transpose of a linear transformation