If B = {(0, 1), (2, 0)} for ℝ² and x ∈ ℝ² has coordinate vector [x]_B = (1, 3), then which of the following is the value of x?
- Ax = (6, 1)
- Bx = (2, 0)
- Cx = (0, 1)
- Dx = (1, 3)
x = 1(0, 1) + 3(2, 0) = (6, 1).
Syllabus: lectures 23–45. Past-paper MCQs are shown first.Syllabus: lecture 23–45. Past paper ki MCQs pehle dikhai gayi hain.
52 MCQs · 6 short · 9 long questions · 52 MCQs from past papers52 MCQs · 6 short · 9 long sawal · 52 MCQs past papers se
If B = {(0, 1), (2, 0)} for ℝ² and x ∈ ℝ² has coordinate vector [x]_B = (1, 3), then which of the following is the value of x?
x = 1(0, 1) + 3(2, 0) = (6, 1).
If a set S = {1, x, x²} is a basis for P₂ and [p]_S = (2, 4, 7), then which of the following is the most appropriate option?
p = 2·1 + 4·x + 7·x².
Consider a basis B = {b₁, b₂} for ℝ², where b₁ = (1, 0) and b₂ = (1, 2), and suppose x in ℝ² has coordinate vector [x]_B = (−2, 3). Then x is
x = −2(1, 0) + 3(1, 2) = (1, 6).
The number of pivot columns of a matrix equals the dimension of its column space.
The pivot columns of A form a basis of Col A.
A plane in ℝ³ is a two-dimensional subspace of ℝ³.
Only planes through the origin are subspaces.
The dimension of the vector space P₄ is 4.
P₄ has basis {1, t, t², t³, t⁴}, so its dimension is 5.
If dim V = n and S is a linearly independent set in V, then S is a basis for V.
S must also have exactly n elements (or span V).
If a set {v₁, …, vₙ} spans a finite-dimensional vector space V and T is a set of more than n vectors in V, then T is linearly dependent.
dim V ≤ n, so more than n vectors must be dependent.
The number of variables in the equation Ax = 0 equals the dimension of Nul A.
dim Nul A equals the number of free variables.
A vector space is infinite-dimensional if it is spanned by an infinite set.
It is infinite-dimensional only if no finite set spans it.
If dim V = n and S spans V, then S is a basis for V.
S must also have exactly n elements (or be independent).
The only three-dimensional subspace of ℝ³ is ℝ³ itself.
Three independent vectors in ℝ³ span all of ℝ³.
In the set S = {(x − 2t, x + t, 3t) : x, t ∈ ℝ}, its dimension is
S = Span{(1, 1, 0), (−2, 1, 3)} and these two vectors are independent.
The dimension of the zero vector space {0} is
{0} has the empty set as basis, so its dimension is 0.
If the rank of a 3 × 5 matrix is 3, then the dimension of its null space is
Rank theorem: dim Nul A = 5 − 3 = 2.
As the rank of a matrix is the number of its pivot columns, the rank of [1 2; 2 4] is
Row 2 is twice row 1, leaving one pivot.
The rank of a zero matrix of any order is
A zero matrix has no pivots.
Consider the bases for ℝ² given by B = {b₁, b₂} and C = {c₁, c₂}, where b₁ = (1, 0), b₂ = (−1, 1), c₁ = (−5, 3), c₂ = (−2, 1); also assume that P_{B←C} = [−2 −1; 3 1]. Which of the following is the change-of-coordinates matrix from B to C?
P_{C←B} = (P_{B←C})⁻¹; det = 1, so the inverse is [1 1; −3 −2].
Let B = {b₁, b₂} and C = {c₁, c₂} be bases for a vector space V such that b₁ = 4c₁ + c₂ and b₂ = −6c₁ + c₂. Suppose x = 3b₁ + b₂, i.e. [x]_B = (3, 1). Then [x]_C will be
x = 3(4c₁ + c₂) + (−6c₁ + c₂) = 6c₁ + 4c₂.
If the general term of a typical signal is (0.6)ᵏ, then determine which of the following is the signal for k = −2?
A negative exponent means the reciprocal: (0.6)⁻² = 1/(0.6)².
If {y_k} = {…, 1, 0.7, 0, −0.7, −1, −0.7, 0, 0.7, 1, 0.7, 0, …} (arrow marks y₀ = 1) and 0.35y_{k+2} + 0.6y_{k+1} + 0.42y_k = z_k, then which of the following is the value of z₀?
z₀ = 0.35·y₂ + 0.6·y₁ + 0.42·y₀ = 0.35·0 + 0.6·0.7 + 0.42·1 = 0.84.
If λ is an eigenvalue of the invertible matrix A, then an eigenvalue of A⁻¹ will be
Ax = λx gives A⁻¹x = (1/λ)x.
Vector u is not an eigenvector of a matrix A if
An eigenvector (nonzero) must satisfy Au = λu for some λ.
Roots of the characteristic equation (λ + 1)² = 0 are of multiplicity
λ = −1 is a repeated root, multiplicity 2.
If there exists a matrix whose characteristic equation is λ³ = 1, then the roots of the equation are
λ³ − 1 = (λ − 1)(λ² + λ + 1), giving 1 and (−1 ± √−3)/2.
If A = [a₁₁ a₁₂; a₂₁ a₂₂] is diagonalizable then A has 2 distinct eigenvalues.
The identity matrix is diagonalizable but has the single eigenvalue 1.
A is diagonalizable if A = PDP⁻¹ where
Diagonalizable means similar to a diagonal matrix D through an invertible P.
An n × n matrix A is ___ if and only if A has n linearly independent [eigen]vectors.
Diagonalization theorem: A = PDP⁻¹ exactly when A has n linearly independent eigenvectors.
An n × n matrix with n distinct eigenvalues is diagonalizable.
Eigenvectors for distinct eigenvalues are independent, giving n independent eigenvectors.
Let A be an n × n matrix whose entries are real. If λ is an eigenvalue of A with x a corresponding eigenvector in ℂⁿ, then
Taking conjugates of Ax = λx with A real gives Ax̄ = conj(λx) = λ̄x̄.
Suppose that A = [1.25 −0.75; −0.75 1.25] has eigenvalues 2 and 0.5. Then the origin is a
One eigenvalue has magnitude above 1 and the other below 1, so the origin is a saddle point.
Which one is the numerical method used for approximation of the dominant eigenvalue of a matrix?
The power method iterates Axₖ to estimate the dominant eigenvalue.
Let ℝ³ have the Euclidean inner product. Then u = (2, 1, 3), v = (1, 7, k) are orthogonal for
u·v = 2 + 7 + 3k = 0 gives k = −3.
Two vectors u and v are orthogonal to each other if ___.
Orthogonality is defined by a zero dot product.
The set of all vectors in ℝⁿ orthogonal to one fixed vector is a subspace of ℝⁿ.
It is the orthogonal complement of Span{u}, which is a subspace.
If W is a subspace of ℝⁿ, then W and W⊥ have no vectors in common.
The zero vector lies in both.
If a square matrix has orthonormal columns, then it also has orthonormal rows.
UᵀU = I for square U implies UUᵀ = I.
By the Best Approximation Theorem, the distance from y to W is ‖y − ŷ‖, where ŷ =
The closest point in W to y is its orthogonal projection proj_W y.
If w is the orthogonal projection of a vector v in ℝⁿ onto a subspace W of ℝⁿ, then w is orthogonal to v.
In general v − w (not w) is orthogonal to W; w itself is not orthogonal to v unless w = 0.
Let W be a subspace of ℝⁿ and v a vector in ℝⁿ. Among all vectors in W, the vector closest to v is the orthogonal projection of v onto W⊥.
The closest vector in W is the projection onto W, not onto W⊥.
Which statement about the General Least Square Method is true?
A least-squares solution minimizes ‖b − Ax‖ and need not be unique or exact.
The matrix equation AᵀAx̂ = Aᵀb represents a system of linear equations commonly referred to as the
AᵀAx̂ = Aᵀb are the normal equations whose solutions are the least-squares solutions x̂.
Let u = (3, −2), v = (4, 5). For the weighted Euclidean inner product ⟨u, v⟩ = 4u₁v₁ + 5u₂v₂, ⟨v, u⟩ =
⟨v, u⟩ = 4(4)(3) + 5(5)(−2) = 48 − 50 = −2.
‖u + v + w‖ ≤ ‖u‖ + ‖v‖ + ‖w‖ for all vectors u, v and w in an inner product space.
Applying the triangle inequality twice gives the bound.
A square matrix A is invertible if and only if λ = 0 is not an eigenvalue of A.
0 is an eigenvalue exactly when Ax = 0 has a nontrivial solution, i.e. when A is singular.
Which statement about the matrix [1 0 0 0; 7 2 0 0; 9 1 2 0; 5 4 2 −1] is false?
The matrix is triangular with diagonal 1, 2, 2, −1, so eigenvalue 2 has algebraic multiplicity 2.
Let v = (1, −2, 2, 0). The unit vector in the same direction as v is
‖v‖ = √(1 + 4 + 4) = 3, so v/‖v‖ = (1/3, −2/3, 2/3, 0).
Let v = (0, 2, 2, 1). The unit vector in the same direction as v is
‖v‖ = √(0 + 4 + 4 + 1) = 3, so v/‖v‖ = (0, 2/3, 2/3, 1/3).
If matrix A has zero as an eigenvalue, which statement(s) about A must be true? I. A is not invertible. II. A will also have an eigenvalue 2. III. A is diagonalizable.
Ax = 0x has a nonzero solution, so A is singular; nothing forces an eigenvalue 2 or diagonalizability.
An n × n matrix A is ___ if and only if 0 is not an eigenvalue of A.
0 is an eigenvalue exactly when Ax = 0 has a nontrivial solution, i.e. when A is singular.
The angle between the vectors x = (1, 0, 0, 0) and y = (1, 1, 1, 1) is
cos θ = x·y/(‖x‖‖y‖) = 1/(1·2) = 1/2, so θ = π/3.
The distance between the vector (1, 2) and its reflection about the x₂-axis is
Reflection gives (−1, 2); the distance is ‖(2, 0)‖ = 2.
No MCQs match this filter.Is filter mein koi MCQ nahi.
Determine whether the set of vectors is orthogonal or not: (5, −4, 0, 3), (−4, 1, −3, 8), (3, 3, 5, 1).
u₁·u₂ = −20 − 4 + 0 + 24 = 0, but u₁·u₃ = 15 − 12 + 0 + 3 = 6 ≠ 0 (and u₂·u₃ = −12 + 3 − 15 + 8 = −16 ≠ 0). So the set is NOT orthogonal.
Is the following set of vectors orthogonal with respect to the Euclidean inner product on ℝ³? (1/√6, 1/√6, −2/√6), (1/√2, −1/√2, 0)
Dot product = 1/√12 − 1/√12 + 0 = 0, so the set is orthogonal. Each vector also has length 1 (1/6 + 1/6 + 4/6 = 1 and 1/2 + 1/2 = 1), so it is orthonormal.
Let B = {b₁, b₂, b₃} and D = {d₁, d₂} be bases for vector spaces V and W, respectively. Let T: V → W be a linear transformation with T(b₁) = 3d₁ − 5d₂, T(b₂) = −d₁ + 6d₂ and T(b₃) = 4d₂. Find a matrix M for T relative to B and D.
The columns of M are [T(b₁)]_D, [T(b₂)]_D, [T(b₃)]_D: M = [3 −1 0; −5 6 4].
Determine whether the vectors y = (−3, 7, 4, 0), z = (1, −8, 15, −7) are orthogonal.
y·z = (−3)(1) + 7(−8) + 4(15) + 0(−7) = −3 − 56 + 60 + 0 = 1 ≠ 0, so y and z are NOT orthogonal.
Let W = Span{x₁, x₂}, where x₁ = (3, 0, −1), x₂ = (8, 5, −6). Construct an orthogonal basis {v₁, v₂} for W.
Gram-Schmidt: v₁ = x₁ = (3, 0, −1). x₂·v₁ = 24 + 0 + 6 = 30, v₁·v₁ = 10, so v₂ = x₂ − (30/10)v₁ = (8, 5, −6) − (9, 0, −3) = (−1, 5, −3). Check: v₁·v₂ = −3 + 0 + 3 = 0. Orthogonal basis: {(3, 0, −1), (−1, 5, −3)}.
If A = [1 2; 2 1], then find an invertible matrix P such that P⁻¹AP = D (diagonal matrix).
det(A − λI) = (1 − λ)² − 4 = 0 gives λ = 3, −1. For λ = 3: (A − 3I)x = 0 gives x₁ = x₂, eigenvector (1, 1). For λ = −1: (A + I)x = 0 gives x₁ = −x₂, eigenvector (1, −1). P = [1 1; 1 −1], D = [3 0; 0 −1], and P⁻¹AP = D.
Compute the least-squares error associated with the least-squares solution x̂ = (4/3, −1/3) of the equation Ax = b, where A = [1 −2; −1 2; 0 3; 2 5], b = (3, 1, −4, 2).
Check: AᵀA = [6 6; 6 42], Aᵀb = (6, −6); solving gives x̂ = (4/3, −1/3). Ax̂ = (4/3 + 2/3, −4/3 − 2/3, −1, 8/3 − 5/3) = (2, −2, −1, 1). b − Ax̂ = (1, 3, −3, 1). Least-squares error = ‖b − Ax̂‖ = √(1 + 9 + 9 + 1) = √20 = 2√5 ≈ 4.47.
Find the dominant eigenpair (i.e. the eigenvalue and eigenvector) by using the power method for the matrix A = [5 4; 1 2], x₀ = (1, 0). (Perform only 1 iteration.)
Ax₀ = (5, 1). Its entry of largest absolute value is μ₀ = 5, so x₁ = (1/5)(5, 1) = (1, 0.2). After one iteration: dominant eigenvalue estimate 5, eigenvector estimate (1, 0.2). (Exact values: λ = 6 with eigenvector (1, 0.25), since λ² − 7λ + 6 = 0.)
Find A², given that A = PDP⁻¹, where A = [2 6; −4 12], P = [3 1; 2 1], D = [6 0; 0 8], P⁻¹ = [1 −1; −2 3].
A² = PD²P⁻¹ with D² = [36 0; 0 64]. PD² = [108 64; 72 64]. A² = [108 64; 72 64][1 −1; −2 3] = [108 − 128, −108 + 192; 72 − 128, −72 + 192] = [−20 84; −56 120]. Check: [2 6; −4 12]² = [−20 84; −56 120].
Find a least-squares solution of the inconsistent system Ax = b, where A = [4 0; 0 2; 1 1] and b = (2, 0, 11).
Solve the normal equations AᵀAx = Aᵀb. AᵀA = [4 0 1; 0 2 1][4 0; 0 2; 1 1] = [17 1; 1 5]. Aᵀb = (4·2 + 0 + 1·11, 0 + 0 + 1·11) = (19, 11). det(AᵀA) = 85 − 1 = 84, so (AᵀA)⁻¹ = (1/84)[5 −1; −1 17]. x̂ = (1/84)(5·19 − 11, −19 + 17·11) = (1/84)(84, 168) = (1, 2). Least-squares solution x̂ = (1, 2). (Check: Ax̂ = (4, 4, 3), residual b − Ax̂ = (−2, −4, 8), which is orthogonal to both columns of A.)
Find the orthogonal projection of y = (7, 6) onto u = (4, 2).
ŷ = (y·u / u·u) u. y·u = 7·4 + 6·2 = 40; u·u = 16 + 4 = 20. ŷ = (40/20)u = 2(4, 2) = (8, 4). (Component orthogonal to u: z = y − ŷ = (−1, 2), and z·u = −4 + 4 = 0, confirming the result.)
Find the vector x such that [x]_B = (5, 3), where B = {(3, −5), (−4, 6)}.
x = 5b₁ + 3b₂ = 5(3, −5) + 3(−4, 6) = (15 − 12, −25 + 18) = (3, −7).
Determine whether the signals 1ᵏ, 2ᵏ and (−2)ᵏ are solutions of the difference equation yₖ₊₃ − yₖ₊₂ − 4yₖ₊₁ + 4yₖ = 0.
Substitute yₖ = rᵏ: rᵏ(r³ − r² − 4r + 4) = 0. Factor: r³ − r² − 4r + 4 = r²(r − 1) − 4(r − 1) = (r − 1)(r − 2)(r + 2). So r = 1, 2, −2 are roots and all three signals are solutions. Direct check: 1ᵏ: 1 − 1 − 4 + 4 = 0. 2ᵏ: 2ᵏ(8 − 4 − 8 + 4) = 0. (−2)ᵏ: (−2)ᵏ(−8 − 4 + 8 + 4) = 0. (They are also linearly independent: Casorati matrix at k = 0 is [1 1 1; 1 2 −2; 1 4 4] with determinant 1(8 + 8) − 1(4 + 2) + 1(4 − 2) = 12 ≠ 0, so they form a basis of the 3-dimensional solution space.)
Verify that 1ᵏ, (−2)ᵏ and 3ᵏ are linearly independent signals.
Form the Casorati matrix C(k) = [1ᵏ (−2)ᵏ 3ᵏ; 1ᵏ⁺¹ (−2)ᵏ⁺¹ 3ᵏ⁺¹; 1ᵏ⁺² (−2)ᵏ⁺² 3ᵏ⁺²]. At k = 0: C(0) = [1 1 1; 1 −2 3; 1 4 9]. det C(0) = 1(−18 − 12) − 1(9 − 3) + 1(4 + 2) = −30 − 6 + 6 = −30 ≠ 0. Since the Casorati matrix is invertible for at least one k, the signals are linearly independent.
Let T: P₂ → P₃ be the transformation that maps a polynomial p(t) into the polynomial (t + 5)p(t). Find the matrix for T relative to the bases {1, t, t²} and {1, t, t², t³}.
Apply T to each basis vector of P₂ and write coordinates in {1, t, t², t³}: T(1) = t + 5 → (5, 1, 0, 0); T(t) = t² + 5t → (0, 5, 1, 0); T(t²) = t³ + 5t² → (0, 0, 5, 1). These are the columns: M = [5 0 0; 1 5 0; 0 1 5; 0 0 1] (4 × 3).