Definition and Theorems of Chapter 1

最新推荐文章于 2020-05-27 13:18:41 发布

christangdt

最新推荐文章于 2020-05-27 13:18:41 发布

阅读量281

点赞数

分类专栏：线性代数（Hoffman&Kunze）

本文链接：https://blog.csdn.net/christangdt/article/details/104422559

版权

本文详细阐述了线性代数中的一些核心概念和定理，包括等价线性方程组、行等价矩阵的性质、行简化阶梯形矩阵和伴随矩阵的概念，以及矩阵乘法、逆矩阵的性质。这些理论对于理解和解决线性方程组问题至关重要。

摘要由CSDN通过智能技术生成

Theorem 1. Equivalent systems of linear equations have the same solutions.

Theorem 2. To each elementary row operations $\bold{e}$ there corresponds an elementary row operation $\bold{e}_1$ , of the same type as $\bold{e}$ , such that $\bold{e}_1(\bold{e}(A))=\bold{e}(\bold{e}_1(A))=A$ for each $A$ . In other words, the inverse operation (function) of an elementary row operation exists and is an elementary row operation of the same type.

Definition. If $A$ and $B$ are $m\times n$ matrices over the field $F$ , we say that $B$ is row-equivalent to $A$ if $B$ can be obtained from $A$ by a finite sequence of elementary row operations.

Theorem 3. If $A$ and $B$ are row-equivalent $m\times n$ matrices, the homogeneous systems of linear equations $A X = 0$ and $B X = 0$ have exactly the same solutions.

Definition. An $m\times n$ matrix $R$ is called row-reduced if:
( a ) the first non-zero entry in each non-zero row of $R$ is equal to 1;
( b ) each column of $R$ which contains the leading non-zero entry of some row has all its other entries 0.

Theorem 4. Every $m\times n$ matrix over the field $F$ is row-equivalent to a row-reduced matrix.

Definition. An $m\times n$ matrix $R$ is called a row-reduced echelon matrix if:
( a ) $R$ is row-reduced;
( b ) every row of $R$ which has all its entries 0 occurs below every row which has a non-zero entry;
( c ) if rows $1,\dots,r$ are the non-zero rows of $R$ , and if the leading non-zero entry of row $i$ occurs in column