代数第一章第一节

(1.1.1) A m rows,n columns matrix $\left|\begin{array}{ccc}{a}_{11}& \cdots & a_{1n}\\ ⋮& \ddots & ⋮\\ a_{m1}& \cdots & a_{mn}\end{array}\right|$.

(1.1.2) $1\ast m$ matrix multiply $m\ast 1$ matrix is $1\ast 1$ matrix $A=\left|\begin{array}{cccc}{a}_1& a_2& \dots & a_m\end{array}\right|$, $B=\left|\begin{array}{c}{b}_1\\ b_2\\ ⋮\\ b_m\end{array}\right|$, $AB=a_1{b}_1+a_2{b}_2+\cdots +a_m{b}_m$.

(1.1.3) $A=\left|\begin{array}{ccc}{a}_{11}& \dots & a_{1m}\\ ⋮& \ddots & ⋮\\ a_{l1}& \dots & a_{lm}\end{array}\right|$, $B=\left|\begin{array}{ccc}{b}_{11}& \dots & b_{1n}\\ ⋮& \ddots & ⋮\\ b_{m1}& \dots & b_{mn}\end{array}\right|$, $p_{ij}=a_{i1}{b}_{1j}+a_{i2}{b}_{2j}+\cdots +a_{im}{b}_{mj}$.

(1.1.4) $\left|\begin{array}{ccc}2& 1& 0\\ 1& 3& 5\end{array}\right|\left|\begin{array}{c}1\\ -1\\ 4\end{array}\right|=\left|\begin{array}{c}1\\ 18\end{array}\right|$.

(1.1.5) Linear equations $\{\begin{array}{l}{a}_{11}{x}_1+\cdots +a_{1n}{x}_n=b_1\\ a_{21}{x}_1+\cdots +a_{2n}{x}_n=b_2\\ ⋮\\ a_{m1}{x}_1+\cdots +a_{mn}{x}_n=b_m\end{array}$, $AX=B$.

(1.1.6) Sigma notation $p_{ij}={\sum }_{v=1}^m{a}_{iv}{b}_{vj}={\sum }_v{a}_{iv}{b}_{vj}$.

(1.1.7) Distributive laws $\{\begin{array}{l}A(B+B^{\prime })=AB+A{B}^{\prime }\\ (A+A^{\prime })B=AB+A^{\prime }B\end{array}$.

(1.1.8) Associative law $(AB)C=A(BC)$.

(1.1.9) Scalar multiplication $c(AB)=(cA)B=A(cB)$.

(1.1.10) Commutative law $AB\ne BA,usually$.

(1.1.11) $A$ is an $m\ast n$ matrix $A{I}_n=Aand{I}_{m}A=A$.

(1.1.12) $AB=I_{n}andBA=I_n$, $B$ is called an inverse of $A$ and is denoted by $A^{-1}$.

(1.1.13) $A^{-1}A=I=A{A}^{-1}$.

(1.1.14) ${\left|\begin{array}{cc}1& \\ & 2\end{array}\right|}^{-1}=\left|\begin{array}{cc}1& \\ & \frac{1}{2}\end{array}\right|and{\left|\begin{array}{cc}1& 1\\ & 1\end{array}\right|}^{-1}=\left|\begin{array}{cc}1& -1\\ & 1\end{array}\right|$.

(1.1.15) Let $A$ be a square matrix that has a right inverse, a matrix $R$ such that $AR=I$ and also a left inverse, a matrix $L$ such that $LA=I$. Then $R=L$. So $A$ is invertible and $R$ is its inverse.

Proof. $R=IR=(LA)R=L(AR)=LI=L$.

(1.1.16) Let $A$ and $B$ be invertible $n\ast n$ matrices. The product $AB$ and the inverse $ A^{-1} $ are invertible, $(AB{)}^{-1}=B^{-1}{A}^{-1}$ and $(A^{-1}{)}^{-1}=A$. If $A_1,\dots ,A_m$ are invertible $n\ast n$ matrices, the product $A_1\dots A_m$ is invertible, and its inverse is $A_m^{-1}\dots A_1^{-1}$.

Proof. Assume that $A$ and $B$ are invertible. To show that the product $B^{-1}{A}^{-1}=Q$ is the inverse of $AB=P$, we simplify the products $PQ$ and $QP$, obtaining $I$ in both cases. The verification of the other assertions is similar.

(1.1.17) ${\left|\begin{array}{cc}a& b\\ c& d\end{array}\right|}^{-1}=\frac{1}{ad-bc}\left|\begin{array}{cc}d& -b\\ -c& a\end{array}\right|$.

(1.1.18) A square matrix that has either a row of zeros or a column of zeros is not invertible.

Proof. If a row of an $n\ast n$ matrix $A$ is zero and if $B$ is any other $n\ast n$ matrix, then the corresponding row of the product $AB$ is zero too. So $AB$ is not the identity. Therefore $A$ has no right inverse. A similar argument shows that if a column of $A$ is zero, then $A$ has no left inverse.

(1.1.19) $M=\left|\begin{array}{cc}A& B\end{array}\right|and{M}^{\prime }=\left|\begin{array}{c}{A}^{\prime }\\ B^{\prime }\end{array}\right|$, $M{M}^{\prime }=A{A}^{\prime }+B{B}^{\prime }$, $A$ has r columns and $A^{\prime }$ has r rows.

(1.1.20) $M=\left|\begin{array}{cc}A& B\\ C& D\end{array}\right|$, $M^{\prime }=\left|\begin{array}{cc}{A}^{\prime }& B^{\prime }\\ C^{\prime }& D^{\prime }\end{array}\right|$, $M{M}^{\prime }=\left|\begin{array}{cc}A{A}^{\prime }+B{C}^{\prime }& A{B}^{\prime }+B{D}^{\prime }\\ C{A}^{\prime }+D{C}^{\prime }& C{B}^{\prime }+D{D}^{\prime }\end{array}\right|$.

(1.1.21) Matrix unit $e_{ij}=\left|\begin{array}{ccc}& ⋮& \\ \dots & 1& \dots \\ & ⋮& \end{array}\right|$.

(1.1.22) $A=a_{11}{e}_{11}+a_{12}{e}_{12}+\cdots ={\sum }_{i,j}{a}_{ij}{e}_{ij}$.

(1.1.23) $e_{ij}{e}_{jl}=e_{il}$ and $e_{ij}{e}_{kl}=0$ if $j\ne k$.

(1.1.24) $X=x_1{e}_1+\cdots +x_n{e}_n={\sum }_i{x}_i{e}_i$.

(1.1.25) $e_{ij}{e}_j=e_i$ and $e_{ij}{e}_k=0$ if $j\ne k$.