Материал из Викиконспекты
|
|
Строка 1: |
Строка 1: |
| + | {{Лемма |
| + | |about = * |
| + | |statement= |
| + | <tex> \mathcal{A}^{\wedge_p} {e_{i_1}} \land {e_{i_2}} \land ... \land {e_{i_p}} \stackrel{\mathrm{def}}{=} \mathcal{A}{e_{i_1}} \land \mathcal{A}{e_{i_2}} \land... \land \mathcal{A}{e_{i_p}} </tex> |
| + | }} |
| + | |
| + | {{Лемма |
| + | |about = ** |
| + | |statement= |
| + | Если <tex> {x_1} \land {x_2} \land... \land {x_p} \in {\wedge_p} </tex>, то <tex> \mathcal{A}^{\wedge_p} {x_1} \land {x_2} \land ... \land {x_p} = \mathcal{A}{x_1} \land \mathcal{A}{x_2} \land... \land \mathcal{A}{x_p} </tex> |
| + | }} |
| + | |
| + | {{Лемма |
| + | |about = *** |
| + | |statement= |
| + | <tex> \mathcal{A}^{\wedge_n} z = \det \mathcal{A} \cdot z </tex> |
| + | }} |
| + | |
| ==Теорема умножения определителей == | | ==Теорема умножения определителей == |
| {{Теорема | | {{Теорема |
Версия 02:55, 15 июня 2013
Лемма (*): |
[math] \mathcal{A}^{\wedge_p} {e_{i_1}} \land {e_{i_2}} \land ... \land {e_{i_p}} \stackrel{\mathrm{def}}{=} \mathcal{A}{e_{i_1}} \land \mathcal{A}{e_{i_2}} \land... \land \mathcal{A}{e_{i_p}} [/math] |
Лемма (**): |
Если [math] {x_1} \land {x_2} \land... \land {x_p} \in {\wedge_p} [/math], то [math] \mathcal{A}^{\wedge_p} {x_1} \land {x_2} \land ... \land {x_p} = \mathcal{A}{x_1} \land \mathcal{A}{x_2} \land... \land \mathcal{A}{x_p} [/math] |
Лемма (***): |
[math] \mathcal{A}^{\wedge_n} z = \det \mathcal{A} \cdot z [/math] |
Теорема умножения определителей
Теорема: |
Пусть [math]\mathcal{A}[/math], [math]\mathcal{B} \colon X \to X[/math] (автоморфизм). Тогда [math]\det (\mathcal{A} \cdot \mathcal{B}) = \det \mathcal{A} \cdot \det \mathcal{B}[/math] |
Доказательство: |
[math]\triangleright[/math] |
[math]\det (\mathcal{A} \cdot \mathcal{B}) {e_1} \land {e_2} \land... \land{e_n} = [/math] [math]
(\mathcal{A} \cdot \mathcal{B})^{\wedge_n}{e_1} \land {e_2} \land... \land{e_n} = ^{(*)}[/math] [math]
(\mathcal{A} \cdot \mathcal{B}) {e_1} \land (\mathcal{A} \cdot \mathcal{B}) {e_2} \land ... \land (\mathcal{A} \cdot \mathcal{B}) {e_n} = ^{(def\mathcal{A} \cdot \mathcal{B})}[/math] [math]
\mathcal{A} (\mathcal{B} {e_1}) \land \mathcal{A} (\mathcal{B} {e_2}) \land ... \land \mathcal{A} (\mathcal{B} {e_n}) = ^{(**)}[/math] [math]
\mathcal{A}^{\wedge_n}(\mathcal{B} {e_1} \land \mathcal{B} {e_2} \land ... \land \mathcal{B} {e_n})= ^{(***)}[/math] [math]
\det \mathcal{A} \cdot (\mathcal{B} {e_1} \land \mathcal{B} {e_2} \land ... \land \mathcal{B} {e_n}) = ^{(***)}[/math] [math]
\det \mathcal{A} \cdot \mathcal{B}^{\wedge_n}({e_1} \land {e_2} \land ... \land {e_n}) = [/math] [math]
\det \mathcal{A} \cdot \det \mathcal{B} \cdot {e_1} \land {e_2} \land ... \land {e_n} [/math]
т.е. [math] \det (\mathcal{A} \cdot \mathcal{B}) {e_1} \land {e_2} \land... \land{e_n} = [/math] [math]
\det \mathcal{A} \cdot \det \mathcal{B} \cdot {e_1} \land {e_2} \land ... \land {e_n}
[/math] |
[math]\triangleleft[/math] |