Linear algebra Calculus

- Section 1.2: Exercise 15,16 (consistent/inconsistent) - Chapter 1: Domain + range (1 variable): No limit
- Section 2.2: Exercise 20 (invertible matrix) - Section 2.5: Continuity (1 variable): No limit
- Section 3.1: Exercise 39,40 (T/F) - Section 7.4: Exercise 39-46 (Definite integral of
rational functions including roots)
- Section 3.3: Exercise 19-22 (volume)
- Section 14.5: Exercises relating to economic models
- Section 4.2: Null space (no limit) and 25,26 (T/F) (differential and increment)
- Section 4.3: Exercise 21,22 (T/F)
- Section 4.4: Exercise 13,14 (coordinate vector)
- Câu hỏi lấy 10: face centered orthorhombic
(tọa độ hóa hình học không gian 3 chiều)
*Một số dạng có thể đổi số liệu đề bài.

LINEAR ALGEBRA VÀ MỘT SỐ LƯU Ý

- Row operations: Khi biến đổi ma trận sử dụng các phép biến đổi dòng cần khi rõ phía trên mũi tên:

- Determinant: Ma trận 2x2 được phép tính nhầm, ma trận 3x3 thì phải viết rõ ra sử dụng sarrus rule để
tiết kiệm thời gian.
- T/F: Justify sử dụng một theorem mang tính GENERAL NHẤT CÓ THỂ và CỐ GẮNG VIẾT DÀI.
Nên có một ví dụ trực quan chứng minh:
Q:A basic variable in a linear system is a variable that corresponds to a pivot column in the coefficient
matrix:
A: True. The basic variable is the variable corresponding to the pivot column containing a pivot
position, while the free variable is the variable corresponding to the column that doesn’t have a pivot
position. This can be illustrated using the matrix example below.
 Section 1.2 (15-16)
15. (augmented matrix)
a. Because this is an augmented matrix in echelon
form with the last row different from
the form: … 0 b, the system is consistent.
The number of pivot positions is equal to the
number of variable, thus, the system has a unique
solution.
b. Because this is an augmented matrix in
echelon form with the last row in the form:
… 0 b, the system is inconsistent.
16. (augmented matrix)

a. Because this is an augmented matrix in

echelon form with the last row different
from the form: … 0 b, the system is
consistent.
The number of pivot positions is equal to
the number of variables, thus, the system
has a unique solution.
b. Because this is an augmented matrix in
echelon form with the last row different
from the form: … 0 b, the system is
consistent.
The number of pivot positions is smaller
than the number of variables, thus, the system has infinite solution.

Section 2.2 (20)

20.

a. (A-AX)-1 =X-1 .B ↔ X.(A-AX)-1 = X.X-1 .B = I.B = B

Because B is the product of two invertible matrices (X and (A-AX)-1 ), B is invertible.
b. ((A-AX)-1)-1 =(X-1 .B)-1
↔ (A-AX)=B-1 (X-1)-1=B-1 .X
↔ A=(B-1+A).X
Because A.X-1=(B-1+A), (B-1+A) is the product of two inverible matrices and therefore invertible and
its invert is (B-1+A)-1
→ (B-1+A)-1A=I.X=X
 Section 3.1 (39,40 T/F)
39.

a. True. By the formula of cofactor expansion, detA is determined by det of smaller

matrices, which obtained by deleting a row and a column continuously until the last
entries.
b. False. Cofactor of a matrix A is (-1)i+j. detAij, with Aij obtainted by deleting from A ith
row and jth column
40.

a. True. Determinant of a matrix can be calculated by both cofactor expansioning along a

row or down a column. Consequently, two ways both get the same result.
b. False. The theorem of triangular matrix state that determinant of a triangular matrix is
the product of its main diagonal.

Section 3.3 (19-22)

19. (0;0), (5;2), (6;4), (11;6)

20. (0;0), (-1;3), (4;-5), (3;-2)
21. (-1;0), (0;5), (1;-4), (2,1)
22. (0;-2), (6;-1), (-3;1), (3;2)
 Section 4.2 (Null space instruction and 25,26 T/F)

*How to solve an exercise related to null space:

- Step 1: Row reduce the [A|0] matrix to reduced echelon form
- Step 2: Write the solution in the parametric form (dạng tham số)
- Step 3: Conclusion: Every linear combination of vectors {v1, v2,…vn} is an element of
Nul A and vice versa OR {v1, v2,…vn} is the spanning set for Nul A
*Caution: If the exercises require to find the basis for Nul A, change the conlusion to:
“The set of vectors{v1, v2,…vn} form the basis for Nul A”

Example: Find an explicit description and the basis for Nul A:

[A|0]=

- Conclusion:
+ Every linear combination of vectors {v1, v2,v3} is an element of Nul A and vice versa
+ The set of vectors{v1, v2,v3} form the basis for Nul A
25.
a. The null space of A is the solution set of the equation Ax=0.
True. The definition of Nul A is the solution set of the homogeneous system: Ax=0
b. The null space of an m x n matrix is in Rm
False. Nul A of an m x n matrix is in Rn
c. If the equation Ax=b is consistent, then Col A is Rm
False. In order for this statement to be true, Ax=b need to be consistent for every b in Rm
d. Col A is the set of all vectors that can be written as Ax for some x.
True. Col A is the set of all linear combinations of the columns of A. Thus, vectors in Col A can
be written as Ax for some x.

26.
a. A null space is a vector space.
True. Due to the theorem of null space, nul space is a vector space spanned by vectors in R n
b. The column space of an m x n matrix is in Rm
True. Due to the theorem of column space, Col space is a subspace of Rm
c. Col A is the set of all solutions of Ax=b.
False. Col A is the set of all linear combinations of A’s column vectors.
 Section 4.3 (21,22 T/F)

a. False. A single vector, other than zero, by itself cannot be linearly dependent.
b. False. The set of vectors can contain 1 or some redundant vectors.
c. True. If the matrix is invertible, then its columns are linearly independent and therefore,
form a basis for Rn
d. False. A basis is a spanning set that contained the least vectors as possible.

a. False. The subspace spanned by the set must also coincide with H
b. True. Base on the spanning set theorem.
c. True. A basis is a set that contains the largest linearly independent set.
d. False. A spanning set for Nul A is the set of all linear combinations of linearly
independent vectors that can be explicitly describe using parametric form
e. False. When row reducing the matrix A, we obtained a matrix with different column
vectors, thus, producing a different column space.
Section 4.4 (13,14)