**Chapter 4
**** Matrices ****, ****Determinants ****, ****Linear Equations**

** **

This chapter includes two parts: matrices , determinants, and systems of linear algebraic equations .

In the previous part, the basic concepts of matrices and determinants were described, with emphasis on the properties and basic operations of various types of matrices. In addition, the methods for finding eigenvalues and eigenvectors of matrices were also introduced, as well as related content, such as similarity transformation, etc. ;In the part of linear equations, it focuses on the solution of *n* equations with *n* unknowns , and also briefly discusses the structure of the solution . Finally, it also briefly explains the integer coefficient linear equations and linear inequalities .

**
§1 ****Matrix and determinant**

1. Matrix and its rank

[ Matrix and Square Matrix ] Number field (Chapter 3, § 1 ) The *m* × *n* numbers *a ** _{ij}* (

*A* =_{}

The horizontal row is called the row, the vertical row is called the column, *a _{ij}* is called the element of the

*An n* - by - *n* matrix is also calledsquare matrix of order* n , and **a *_{11} ,* a *_{12} , ...,* a ** _{nn}* are called the elements ofthe main diagonal ofmatrix

*A matrix whose number* of rows *m* and number of columns are both finite is called a finite matrix . Otherwise, it is called an infinite matrix .

[ Linear correlation of vectors is linearly independent ] For a set of vectors *x *_{1}_{} , *x *_{2} ,..., *x _{m in }*

*k *_{1 }*x *_{1} + *k *_{2 }*x *_{2} + … + *k _{m} x _{m}* =0

If established, the set of vectors is said to be linearly dependent on *F* , otherwise the set of vectors is said to be linearly independent on *F.*

Discussion of Linear Dependency of Vector Groups:

A sufficient and necessary condition for the linear correlation of 1 ° vector groups *x *_{1} _{} , *x *_{2} , ..., *x _{m}* is that at least one vector

_{}

2 ° The set of vectors containing zero vectors must be linearly dependent .

In the 3 ° vector group *x *_{1} _{} , *x *_{2} ,..., *x _{m}* , if two vectors are equal:

4 ° If the vector groups *x *_{1} _{} , *x *_{2} ,..., *x _{r}* are linearly correlated, the vector group formed by adding several vectors is still linearly correlated; if the vector groups

5 ° If *x *_{1} _{} , *x *_{2} , . *_ _{_}* _

[ Row Vector and Column Vector · Matrix Rank ] An *n* -dimensional vector composed of elements in any row of the matrix is called a row vector* , and is written as*

*a ^{i}* =(

*The m* -dimensional vector formed by the elements of any column of the matrix is called a column vector, denoted as

_{}
( *j* =1 ,2 ,..., *n* )

In the formula, t represents transposition, that is, the row (column) is converted into a column (row) .

If r of the n column vectors of matrix *A* are *linearly* independent *(* r *≤* n *)* , and all column vector groups whose number is greater than *r* are linearly correlated, then the number *r* is called the column rank of matrix *A.* Similarly, matrix *A* can be defined row rank .

The column rank and row rank of a matrix *A* must be equal, it is also called the rank of the matrix, denoted as rank *A* = *r* .

The rank of a matrix is also equal to the maximum order of subforms (see this section, two) in that matrix that are not equal to zero .

Second, the determinant

1. The determinant and its Laplace expansion theorem

[ *Nth *order determinant ] Let

_{}

*is a number determined by n *^{2} numbers *a ** _{ij}* (

_{}

In the formula, *k *_{1} , *k *_{2} ,..., *k _{n}* is a sequence obtained by exchanging the element order of the sequence 1, 2,...,

( -1 ) ^{3} .^{}

If the *n* -order square matrix *A* = ( *a _{ij}* ) , then the corresponding determinant

*D* =| *A* |=det *A* = det( *a _{ij}* )

If the corresponding determinant of matrix *A is **D* = 0 , *A* is called a singular matrix, otherwise it is called a non-singular matrix .

[ label set ] any *k* elements *i *_{1} , *i *_{2} ,..., *i ** _{k}* in the sequence 1,2 ,...,

1 ≤ *i *_{1} < *i *_{2} <...< *i _{k}* ≤

*i *_{1} , *i *_{2} ,..., *i _{k}* form a subcolumn of {1,2,...,

σ ={ *i *_{1} , *i *_{2} ,..., *i _{k}* }

is a subsequence of {1,2,..., *n* } that satisfies (1) . If *τ* ={ *j *_{1} , *j *_{2} ,..., *j ** _{k}* } ∈

[ Subform , main subform , cosubform , algebraic cosubform ]

Take any *k* rows and *k* columns ( 1 ≤ *k* ≤ *n* - 1 ) from the *n* -order determinant *D* , and the *k* -order determinant formed by the elements at the intersection of the k-row and k-column is *called* the *k* - *order* child of the determinant *D* formula, write

_{},
σ , *τ* ∈ *C* ( *n* , *k* )

If the selected *k* rows and *k* columns are the *i *_{1} , *i *_{2} ,..., *i _{k}* rows and

*The n* - *k* order determinant obtained by removing *k* rows (σ) and *k* columns ( *τ* ) from the determinant *D* is called the cofactor of the subformula, denoted as ._{}_{}

If σ ={ *i *_{1} , *i *_{2} ,..., *i _{k}* } ,

_{}_{}

is the algebraic cofactor of the subform ._{}

In particular, when *k* = 1 , σ ={ *i* } , *τ* ={ *j* }, the subform is an element *a ** _{ij}* , the cofactor of

_{}_{}

and have ( 2 ) _{} _{}

or ( 3 ) _{} _{}

[ Laplace expansion theorem ] If any *k* rows* ( 1 ≤ **k* ≤ *n* -1 ) are taken in the *n* -order determinant *D* , then all the *k* -order sub-formulas and their respective algebras contained in these selected rows The sum of the products of cofactors is equal to the determinant *D* , that is, for any σ∈ *C* ( *n* , *k* ) , 1 ≤ *k* ≤ *n* -1 ,

_{} _{}
( 4 )

where ∑ represents the summation of all elements in the label set *C* ( *n* , *k* ) .

Laplace's theorem is done for rows, and similar results are obtained for columns

_{}_{}
( 5 )

Furthermore

_{}_{} _{} ( 6 )

_{}_{} _{} ( 7 )

Obviously ( 2 ), ( 3 ) are special cases of ( 6 ), ( 7 ), respectively .

[ Laplace's identity ] Let *A* =( *a _{ij}* )

det( *A *^{τ }*B* )=_{}

2. The nature of the determinant

1 ° ï *A *_{1 }*A *_{2 }L *A _{m}* ï = ï

ï *A ^{m}* ï = ï

In the formula, *A *_{1} , *A *_{2} , L , and *A _{m}* are all square matrices of order

2 ° After the row and column are interchanged , the value of the determinant remains unchanged, that is,

| |=| *A* |_{}

where represents the transposed matrix of *A* (see § 2 of this chapter ) ._{}

3 ° Interchange any two rows (or columns) of the determinant, change the sign of the determinant . For example

_{}=_{}

4 ° Multiplying a row (or column) of the determinant by the number α is equivalent to multiplying the determinant by the number *α* . For example

_{}= a_{}

5 ° Multiply one row (or column) element of the determinant by the number *α* and add it to the corresponding element in another row (or column), the value of the determinant does not change . For example

_{}=_{}

6 ° If a row (or column) of the determinant is all zero, then the determinant is equal to zero .

A determinant is zero if two rows (or columns) of the determinant have identical or proportional elements .

A determinant is zero if a row (or column) of elements in the determinant is a linear combination of corresponding elements in some other row (or column) .

7 ° If all elements of a row (or column) in the determinant can be expressed as the sum of two terms, the determinant can be expressed by the sum of two determinants of the same order . For example

_{}= +_{}_{}

3. Several special determinants

[ diagonal determinant ]

_{}=_{}

[ triangle determinant ]

_{}=_{}

[ Second-order determinant ]

_{} _{}

[ third-order determinant ]

_{}

= + + _{}_{}_{}— — —_{}_{}_{}

memory method

The value of the determinant is equal to the sum of the products of the elements on the solid lines minus the sum of the products of the elements on the dotted lines .

[ fourth-order determinant ]

_{}= _{}- + -_{}_{}_{}

= _{}- +_{}_{}

+ _{}- +_{}_{}

Note that the fourth-order and higher-order determinants cannot use the memory method of the third-order determinant, and should be expanded according to the Laplace expansion theorem by the method of step-by-step reduction .

[ Vandermonde determinant ]

_{}=_{}

where Õ is the product of all pairs ( *i* , *j* ) ( 1 ￡ *j *< *i *￡ *n* ) .

[ Reciprocal symmetric determinant ]

_{}=_{}

Contribute a better translation