Scribd
Upload
308 views4 pages

MMT-002 Linear Algebra Assignment Guide

The document is an assignment booklet for the M.Sc. program in Mathematics with Applications in Computer Science, specifically for the course on Linear Algebra, valid for the year 2025. It includes detailed instructions for formatting assignments, submission guidelines, and a list of problems to solve for evaluation, which accounts for 30% of the course grade. Students are advised to follow the provided format strictly and submit their assignments by the due date to avoid penalties.

Uploaded by

rk.rs9038
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
308 views4 pages

MMT-002 Linear Algebra Assignment Guide

The document is an assignment booklet for the M.Sc. program in Mathematics with Applications in Computer Science, specifically for the course on Linear Algebra, valid for the year 2025. It includes detailed instructions for formatting assignments, submission guidelines, and a list of problems to solve for evaluation, which accounts for 30% of the course grade. Students are advised to follow the provided format strictly and submit their assignments by the due date to avoid penalties.

Uploaded by

rk.rs9038
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MMT-002

ASSIGNMENT BOOKLET

(Valid from 1st January, 2025 to 31st December, 2025)

[Link].(Mathematics with Applications in Computer Science)


LINEAR ALGEBRA

School of Sciences
Indira Gandhi National Open Universi
Maidan Garhi, New Delhi
(2025)
Dear Student,
Please read the section on assignments and evaluation in the Programme Guide for Elective Courses that
we sent you after your enrolment. A weightage of 30 percent, as you are aware, has been assigned for con-
tinuous evaluation of this course, which would consist of one tutor-marked assignment. The assignment
is in this booklet.

Instructions for Formatting Your Assignments

Before attempting the assignment please read the following instructions carefully.

1) On top of the first page of your answer sheet, please write the details exactly in the
following format:

ROLL NO. : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
NAME : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
ADDRESS : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
............................
............................
COURSE CODE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ............................
COURSE TITLE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
STUDY CENTRE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . DATE . . . . . . . . . . . . . . . . . . . . . . . . . . . .
PLEASE FOLLOW THE ABOVE FORMAT STRICTLY TO FACILITATE EVALUATION AND
TO AVOID DELAY.

2) Use only foolscap size writing paper (but not of very thin variety) for writing your answers.

3) Leave a 4 cm margin on the left, top and bottom of your answer sheet.

4) Your answers should be precise.

5) While solving problems, clearly indicate which part of which question is being solved.

6) This assignment is to be submitted to the Programme Centre as per the schedule made by the Pro-
gramme Centre. Answer sheets received after the due date shall not be accepted.
We strongly suggest that you retain a copy of your answer sheets.

7) This assignment is valid only up to December, 2025. If you fail in this assignment or fail to submit
it by December, 2025, then you need to get the assignment for the year 2026 and submit it as per the
instructions given in the Programme Guide.

8) You cannot fill the Exam Form for this course till you have submitted this assignment. So, solve
it and submit it to your study centre at the earliest.

We wish you good luck.

2
Assignment
Course Code: MMT-002
Assignment Code:MMT-002/TMA/2025
Maximum Marks: 100

1) Which of the following statements are true and which are false? Give reasons for your answer.

i) If 𝑉 is a finite dimensional vector space and 𝑇 ∶ 𝑉 → 𝑉 is a diagonalisable linear operator,


then there is a basis, unique up to order of the elements, with respect to which the matrix of 𝑇
is diagonal.
ii) Up to similarity, there is a unique 3 × 3 matrix with minimal polynomial (𝑥 − 1)2 (𝑥 − 2).
iii) If 𝜆 is the eigenvalue of a matrix 𝐴 with characteristic polynomial 𝑓 (𝑥), (𝑥 − 𝜆)𝑘 ∣ 𝑓 (𝑥) and
(𝑥 − 𝜆)𝑘+1 ∤ 𝑓 (𝑥), then the geometric multiplicity of 𝜆 is at most 𝑘.
iv) If 𝜌(𝐴) = 1, then 𝐴𝑘 → ∞ as 𝑘 → ∞.
v) If 𝑁 is nilpotent, 𝑒𝑁 is also nilpotent.
vi) The sum of two normal matrices of the order 𝑛 is normal.
vii) If 𝑃 and 𝑄 are positive definite operators, 𝑃 + 𝑄 is a positive definite operator.
viii) Generalised inverse of a 𝑛 × 𝑛 matrix need not be unique.
ix) All the entries of a positive definite matrix are non-negative.
x) The SVD of any 2 × 3 matrix is unique. (20)

⎡𝑥⎤ ⎡𝑥 + 2𝑦 − 𝑖𝑧⎤
2) a) Let 𝑇 ∶ C2 → C2 ∶ 𝑇 ⎢𝑦⎥ = ⎢ 2𝑦 + 𝑖𝑧 ⎥. Find [𝑇]𝐵 , [𝑇]𝐵′ and 𝑃 where (10)
⎢ ⎥ ⎢ ⎥
⎣𝑧⎦ ⎣𝑖𝑥 + 𝑧 − 2𝑧⎦
0 𝑖 0 1 0 1
⎪⎡⎢ ⎤⎥ ⎡⎢ ⎤⎥ ⎡⎢ ⎤⎥⎫
⎧ ⎪⎡⎢ ⎤⎥ ⎡⎢ ⎤⎥ ⎡⎢ ⎤⎥⎫
⎪ ′ ⎧ ⎪
𝐵 = ⎨ 𝑖 , 1 , 0 ⎬ , 𝐵 = ⎨ −𝑖 , 0 , 𝑖 ⎬ , [𝑇]𝐵 ′ = 𝑃 −1 [𝑇]𝐵 𝑃 .
⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎩⎣0⎦ ⎣−1⎦ ⎣2⎦⎪
⎪ ⎭ ⎩⎣ 1 ⎦ ⎣1⎦ ⎣0⎦⎪
⎪ ⎭

b) If 𝐶 and 𝐷 are 𝑛 × 𝑛 matrices such that 𝐶𝐷 = −𝐷𝐶 and 𝐷−1 exists, then show that 𝐶 is similar
to −𝐷. Hence show that the eigenvalues of 𝐶 must come in plus-minus pairs. (2)
c) Can 𝐴 be similar to 𝐴 + 𝐼? Give reasons for your answer. (3)

3) Find the Jordan canonical form 𝐽 for

⎡−1 0 −2 −4⎤
⎢2 1 2 4⎥
𝐵=⎢ .
−4 2 −1 −4⎥
⎢ ⎥
⎣ 2 −1 1 3⎦

Also, find a matrix 𝑃 such that 𝐽 = 𝑃 −1 𝐵𝑃. (15)

4) a) Let 𝑀 and 𝑇 be a metro city and a nearby district town, respectively. Our government is trying
to develop infrastructure in T so that people shift to T. Each year 15% of T’s population moves
to M and 10% of M’s population moves to T. What is the long term effect of on the population
of M and T? Are they likely to stabilise? (5)
b) Solve the following system of differential equations: (10)

𝑑𝑦(𝑡) ⎡1⎤ ⎡2 −5 −11⎤


= 𝐴𝑦(𝑡) with 𝑦(0) = ⎢1⎥ , where 𝐴 = ⎢0 −2 −9 ⎥
𝑑𝑡 ⎢ ⎥ ⎢ ⎥
⎣1⎦ ⎣0 1 4 ⎦

3
5) a) Let

⎡2 2 1⎤
𝐴 = ⎢−1 −1 2 ⎥ .
⎢ ⎥
⎣0 0 −2⎦

Find a unitary matrix 𝑈 such that 𝑈 ∗ 𝐴𝑈 is upper triangular. (5)


b) Use least squares method to find a quadratic polynomial that fits the following data: (5)

(−2, 15.7), (−1, 6.7), (0, 2.7), (1, 3.7), (2, 9.7).

6) a) Check which of the following matrices is positive definite and which is positive semi-definite:

⎡1 1 0⎤ ⎡2 0 1⎤
𝐴 = 1 2 1 , 𝐵 = 0 2 −1⎥
⎢ ⎥ ⎢
⎢ ⎥ ⎢ ⎥
⎣0 1 1⎦ ⎣1 −1 3 ⎦
Also, find the square root of the positive definite matrix. (10)
b) Find the QR decomposition of the matrix (5)

⎡2 −2 1⎤
⎢2 2 1⎥
⎢0 1 1⎥
⎢ ⎥
⎣1 0 1⎦

7) Find the SVD of the following matrices: (10)


−1 1 1 ⎡−1 1⎤
i) ii) ⎢ 1 1⎥
[ 1 1 0] ⎢ ⎥
⎣ 1 2⎦

Common questions

Powered by AI

The movement of populations between areas M and T has a dynamic effect that can lead to equilibrium or instability over time. According to the document, each year 15% of T's population moves to M, while 10% of M's population moves to T. This type of system suggests likelihood of reaching a stable state where the population ratios become constant, assuming no other external factors impact populations. Such equations often have equilibria where transfer percentages balance, causing population stability in the long term .

QR decomposition transforms a matrix A into the product of an orthogonal matrix Q and an upper triangular matrix R, facilitating easier calculation in solving linear systems or QR factorization processes. This decomposition is advantageous for numerical stability and efficiency. In the document, the QR decomposition involves arranging matrices into orthogonal and triangular forms, breaking down numerical operations required to find eigenvalues or solve equations, thereby simplifying complex matrix manipulations .

Normal matrices, which satisfy the condition AA* = A*A, retain several pure algebraic qualities such as diagonalizability through unitary matrices. The sum of two normal matrices being normal implies the closure of normal matrices under addition, retaining symmetry and self-adjoint properties. This means that such matrices preserve orthogonality properties of eigenvectors, thus are still characterized by similar diagonal structures post-summation, making them significant in functional transformations and spectral theorems .

The existence of non-trivial solutions in a system of linear equations suggests the matrix involved has a non-zero nullity. In linear algebra, nullity is the dimension of the kernel (null space) of a matrix. If there are non-trivial solutions, this means the kernel of the transformation contains more than just the zero vector, thus the matrix lacks full rank, and its rank plus nullity equals the number of variables (columns), indicating a dimension for the null space greater than zero .

To determine if the Jordan canonical form is a valid simplification for a given matrix, one must check if the matrix is similar to its Jordan canonical form. In the document, the matrix B is given, and it notes that finding the matrix P such that J = P⁻¹BP involves ensuring J can be a valid Jordan form for B. This involves confirming that B has eigenvalues corresponding to the blocks in J and that the algebraic and geometric multiplicities align with the structure of J .

The least squares method minimizes the sum of squared differences between observational data and a proposed model. In the case of fitting a quadratic polynomial to data points, one constructs normal equations by substituting data into the polynomial x² terms. By arranging these into matrices, the solution gives the coefficients that minimize the discrepancy, achieving the best fit polynomial. The document details this through a step-by-step application to specific data points .

The generalized inverse of a square matrix may not be unique due to the lack of a universal operator to revert to the original matrix under multiplication. In cases where the matrix does not have full rank or is not invertible, multiple matrices could satisfy the conditions that define a generalized inverse, such as the Moore-Penrose inverse, thus compromising uniqueness. Consequently, conditions like reduced rank or determinant may permit different matrices as valid generalized inverses under specific matrix operations .

A matrix is positive definite if it is symmetric and all its eigenvalues are positive, ensuring that any non-zero vector x results in xᵀAx > 0. It is positive semi-definite if it is symmetric and all its eigenvalues are non-negative, so xᵀAx ≥ 0. In the document, the process involves evaluating given matrices, calculating eigenvalues, and examining their signs to determine definiteness. Definite matrices, for instance, can be further analyzed through their square roots that preserve such properties .

A linear operator on a finite-dimensional vector space is diagonalizable if there exists a basis consisting of its eigenvectors. If T: V → V is a diagonalizable linear operator, there is a basis where the matrix representation of T is diagonal, unique up to the order of basis elements. This is because diagonalization is contingent on the existence of a complete set of linearly independent eigenvectors, forming a basis where the operator is represented by a diagonal matrix, which uniquely determines the operator's behavior in that basis .

Eigenvalue pairings in matrices, as shown for C being similar to -D (with eigenvalues in plus-minus pairs), are significant in stability analysis of dynamical systems. Such pairings signify critical symmetries in systems oscillations, commonly found in physics, engineering, and control theory. They affect stability, as they allow balancing dynamics ensuring energy conservation or resonance patterns. Thus, plus-minus eigenvalue pairs contribute to predicting long-term behaviors or establishing equilibrium states within intricate dynamical frameworks .

You might also like