跳到主要内容

九州大学 システム情報科学府 情報理工学専攻・電気電子工学専攻 2024年9月実施 線形代数

Author​

祭音Myyura (co-authored with ChatGPT 5.5 Thinking)

Description​

(1) Find the determinants of the following matrices AA and BB, respectively.

A=[202409112],B=[12344681024683579].A=\begin{bmatrix}2 & 0 & 2 \\4 & 0 & 9 \\1 & 1 & 2\end{bmatrix},\qquad B=\begin{bmatrix}1 & 2 & 3 & 4 \\4 & 6 & 8 & 10 \\2 & 4 & 6 & 8 \\3 & 5 & 7 & 9\end{bmatrix}.

(2) For any upper triangular matrix A=(aij)A=(a_{ij}) of order nn, show

det⁡(A)=∏i=1naii,\det(A)=\prod_{i=1}^{n} a_{ii},

where det⁡(A)\det(A) denotes the determinant of AA.

题目描述​

  1. 分别求矩阵

    A=[202409112],B=[12344681024683579]A=\begin{bmatrix}2&0&2\\4&0&9\\1&1&2\end{bmatrix}, \qquad B=\begin{bmatrix} 1&2&3&4\\ 4&6&8&10\\ 2&4&6&8\\ 3&5&7&9 \end{bmatrix}

    的行列式。

  2. 对任意 nn 阶上三角矩阵 A=(aij)A=(a_{ij}),证明

    det⁡A=∏i=1naii.\det A=\prod_{i=1}^na_{ii}.

Kai​

(1)​

First compute det⁡(A)\det(A).

A=[202409112].A=\begin{bmatrix}2 & 0 & 2 \\4 & 0 & 9 \\1 & 1 & 2\end{bmatrix}.

Expanding along the first row, we get

det⁡(A)=2∣0912∣+2∣4011∣.\det(A)=2\begin{vmatrix}0 & 9 \\1 & 2\end{vmatrix}+2\begin{vmatrix}4 & 0 \\1 & 1\end{vmatrix}.

Thus,

det⁡(A)=2(0⋅2−9⋅1)+2(4⋅1−0⋅1).\det(A)=2(0\cdot 2-9\cdot 1)+2(4\cdot 1-0\cdot 1).

Therefore,

det⁡(A)=−18+8=−10.\det(A)=-18+8=-10.

Hence,

det⁡(A)=−10.\boxed{\det(A)=-10}.

Next compute det⁡(B)\det(B).

B=[12344681024683579].B=\begin{bmatrix}1 & 2 & 3 & 4 \\4 & 6 & 8 & 10 \\2 & 4 & 6 & 8 \\3 & 5 & 7 & 9\end{bmatrix}.

Notice that the third row is twice the first row:

[2468]=2[1234].\begin{bmatrix}2 & 4 & 6 & 8\end{bmatrix}=2\begin{bmatrix}1 & 2 & 3 & 4\end{bmatrix}.

Therefore, the rows of BB are linearly dependent, so

det⁡(B)=0.\det(B)=0.

Hence,

det⁡(B)=0.\boxed{\det(B)=0}.

(2)​

Let A=(aij)A=(a_{ij}) be an upper triangular matrix of order nn. By the Leibniz formula for determinants,

det⁡(A)=∑σ∈Snsgn⁡(σ)∏i=1nai,σ(i).\det(A)=\sum_{\sigma\in S_n}\operatorname{sgn}(\sigma)\prod_{i=1}^{n} a_{i,\sigma(i)}.

Since AA is upper triangular, we have

aij=0if i>j.a_{ij}=0\qquad\text{if } i>j.

Therefore, for the product

∏i=1nai,σ(i)\prod_{i=1}^{n} a_{i,\sigma(i)}

to be nonzero, it is necessary that

i≤σ(i)for all i=1,2,…,n.i\leq \sigma(i)\qquad\text{for all } i=1,2,\dots,n.

However, since σ\sigma is a permutation of {1,2,…,n}\{1,2,\dots,n\}, we have

∑i=1nσ(i)=∑i=1ni.\sum_{i=1}^{n} \sigma(i)=\sum_{i=1}^{n} i.

Thus, if σ(i)≥i\sigma(i)\geq i for all ii, then we must have

σ(i)=ifor all i.\sigma(i)=i\qquad\text{for all } i.

Hence, the only term in the Leibniz formula that can be nonzero comes from the identity permutation. Therefore,

det⁡(A)=∏i=1naii.\det(A)=\prod_{i=1}^{n} a_{ii}.

Hence,

det⁡(A)=∏i=1naii.\boxed{\det(A)=\prod_{i=1}^{n} a_{ii}}.