• 矩阵的运算规则


    1 矩阵的加法

    定义1 设有两个 m × n m \times n m×n 矩阵 A = ( a i j ) \boldsymbol{A} = (a_{ij}) A=(aij) B = ( b i j ) \boldsymbol{B} = (b_{ij}) B=(bij),那么 矩阵 A \boldsymbol{A} A B \boldsymbol{B} B 的和 记作 A + B \boldsymbol{A} + \boldsymbol{B} A+B,规定为
    A + B = ( a 11 + b 11 a 12 + b 12 ⋯ a 1 n + b 1 n a 21 + b 21 a 22 + b 22 ⋯ a 2 n + b 2 n ⋮ ⋮ ⋮ a m 1 + b m 1 a m 2 + b m 2 ⋯ a m n + b m n ) \boldsymbol{A} + \boldsymbol{B} =

    (a11+b11a12+b12a1n+b1na21+b21a22+b22a2n+b2nam1+bm1am2+bm2amn+bmn)" role="presentation" style="position: relative;">(a11+b11a12+b12a1n+b1na21+b21a22+b22a2n+b2nam1+bm1am2+bm2amn+bmn)
    A+B= a11+b11a21+b21am1+bm1a12+b12a22+b22am2+bm2a1n+b1na2n+b2namn+bmn
    只有当两个矩阵是同型矩阵时,这两个矩阵才能进行加法运算。

    矩阵的加法运算满足下列运算规律(设 A \boldsymbol{A} A B \boldsymbol{B} B C \boldsymbol{C} C 都是 m × n m \times n m×n 矩阵):

    • A + B = B + A \boldsymbol{A} + \boldsymbol{B} = \boldsymbol{B} + \boldsymbol{A} A+B=B+A
    • ( A + B ) + C = A + ( B + C ) (\boldsymbol{A} + \boldsymbol{B}) + \boldsymbol{C} = \boldsymbol{A} + (\boldsymbol{B} + \boldsymbol{C}) (A+B)+C=A+(B+C)

    设矩阵 A = ( a i j ) \boldsymbol{A} = (a_{ij}) A=(aij),记 − A = ( − a i j ) -\boldsymbol{A} = (-a_{ij}) A=(aij) − A -\boldsymbol{A} A 称为矩阵 A \boldsymbol{A} A 的负矩阵,显然有
    A + ( − A ) = 0 \boldsymbol{A} + (-\boldsymbol{A}) = 0 A+(A)=0
    于是有矩阵减法的定义如下:

    定义2 规定矩阵的减法为
    A − B = A + ( − B ) \boldsymbol{A} - \boldsymbol{B} = \boldsymbol{A} + (-\boldsymbol{B}) AB=A+(B)

    2 数与矩阵相乘

    定义3 数 λ \lambda λ 与矩阵 A \boldsymbol{A} A 的乘积记作 λ A \lambda \boldsymbol{A} λA A λ \boldsymbol{A} \lambda Aλ,规定为
    λ A = A λ = ( λ a 11 λ a 12 ⋯ λ a 1 n λ a 21 λ a 22 ⋯ λ a 2 n ⋮ ⋮ ⋮ λ a m 1 λ a m 2 ⋯ λ a m n ) \lambda \boldsymbol{A} = \boldsymbol{A} \lambda =

    (λa11λa12λa1nλa21λa22λa2nλam1λam2λamn)" role="presentation" style="position: relative;">(λa11λa12λa1nλa21λa22λa2nλam1λam2λamn)
    λA=Aλ= λa11λa21λam1λa12λa22λam2λa1nλa2nλamn
    数乘矩阵满足下列运算规律(设 A \boldsymbol{A} A B \boldsymbol{B} B m × n m \times n m×n 矩阵, λ \lambda λ μ \mu μ 为数):

    • ( λ μ ) A = λ ( μ A ) (\lambda \mu)\boldsymbol{A} = \lambda(\mu \boldsymbol{A}) (λμ)A=λ(μA)
    • ( λ + μ ) A = λ A + μ A (\lambda + \mu) \boldsymbol{A} = \lambda \boldsymbol{A} + \mu \boldsymbol{A} (λ+μ)A=λA+μA
    • λ ( A + B ) = λ A + λ B \lambda(\boldsymbol{A} + \boldsymbol{B}) = \lambda \boldsymbol{A} + \lambda \boldsymbol{B} λ(A+B)=λA+λB

    矩阵加法与数乘矩阵统称为矩阵的线性运算。

    3 矩阵与矩阵相乘

    定义4 设 A = ( a i j ) \boldsymbol{A} = (a_{ij}) A=(aij) 是一个 m × s m \times s m×s 矩阵, B = ( b i j ) \boldsymbol{B} = (b_{ij}) B=(bij) 是一个 s × n s \times n s×n 矩阵,那么规定 矩阵 A \boldsymbol{A} A 与矩阵 B \boldsymbol{B} B 的乘积 是一个 m × n m \times n m×n 矩阵 C = ( c i j ) \boldsymbol{C} = (c_{ij}) C=(cij),其中
    c i j = a i 1 b 1 j + a i 2 b 2 j + ⋯ + a i s b s j = ∑ k = 1 s a i k b k j ( i = 1 , 2 , ⋯   , m ; j = 1 , 2 , ⋯   , n ) c_{ij} = a_{i1} b_{1j} +a_{i2} b_{2j} + \cdots + a_{is} b_{sj} = \sum_{k=1}^s a_{ik} b_{kj} \hspace{1em} (i=1,2,\cdots,m;j=1,2,\cdots,n) cij=ai1b1j+ai2b2j++aisbsj=k=1saikbkj(i=1,2,,m;j=1,2,,n)
    并将此乘积记作
    C = A B \boldsymbol{C} = \boldsymbol{A} \boldsymbol{B} C=AB
    以上定义表明,矩阵 A B = C \boldsymbol{A} \boldsymbol{B} = \boldsymbol{C} AB=C ( i , j ) (i,j) (i,j) c i j c_{ij} cij 就是 A \boldsymbol{A} A 的第 i i i 行与 B \boldsymbol{B} B 的第 j j j 列的乘积。

    需要注意的是:

    • 只有当第一个矩阵(左矩阵)的列数等于第二个矩阵(右矩阵)的行数时,两个矩阵才能相乘;
    • 矩阵的乘法不满足交换律,即在一般情形下, A B ≠ B A \boldsymbol{A} \boldsymbol{B} \ne \boldsymbol{B} \boldsymbol{A} AB=BA
    • 若有两个矩阵 A \boldsymbol{A} A B \boldsymbol{B} B 满足 A B = O \boldsymbol{A} \boldsymbol{B} = \boldsymbol{O} AB=O,不能得出 A = O \boldsymbol{A} = \boldsymbol{O} A=O B = O \boldsymbol{B} = \boldsymbol{O} B=O 的结论。

    矩阵的乘法虽不满足交换律,但仍然满足下列结合律和分配律(假设运算都是可行的):

    • ( A B ) C = A ( B C ) (\boldsymbol{A} \boldsymbol{B}) \boldsymbol{C} = \boldsymbol{A} (\boldsymbol{B} \boldsymbol{C}) (AB)C=A(BC)
    • λ ( A B ) = ( λ A ) B = A ( λ B ) \lambda (\boldsymbol{A} \boldsymbol{B}) = (\lambda \boldsymbol{A}) \boldsymbol{B} = \boldsymbol{A} (\lambda \boldsymbol{B}) λ(AB)=(λA)B=A(λB)(其中 λ \lambda λ 为数);
    • A ( B + C ) = A B + A C \boldsymbol{A} (\boldsymbol{B} + \boldsymbol{C}) = \boldsymbol{A} \boldsymbol{B} + \boldsymbol{A} \boldsymbol{C} A(B+C)=AB+AC ( B + C ) A = B A + C A (\boldsymbol{B} + \boldsymbol{C}) \boldsymbol{A} = \boldsymbol{B} \boldsymbol{A} + \boldsymbol{C} \boldsymbol{A} (B+C)A=BA+CA
    3.1 单位矩阵的乘法

    对于单位矩阵 E E E,容易验证
    E m A m × n = A m × n , A m × n E n = A m × n \boldsymbol{E}_m \boldsymbol{A}_{m \times n} = \boldsymbol{A}_{m \times n}, \hspace{1em} \boldsymbol{A}_{m \times n} \boldsymbol{E}_n = \boldsymbol{A}_{m \times n} EmAm×n=Am×n,Am×nEn=Am×n
    或简写成
    E A = A E = A \boldsymbol{E} \boldsymbol{A} = \boldsymbol{A} \boldsymbol{E} = \boldsymbol{A} EA=AE=A
    可见单位矩阵 E E E矩阵乘法中的作用类似于数 1 1 1

    3.2 纯量阵

    矩阵
    λ E = ( λ λ ⋱ λ ) \lambda \boldsymbol{E} =

    (λλλ)" role="presentation" style="position: relative;">(λλλ)
    λE= λλλ
    称为 纯量阵。由 ( λ E ) A = λ A (\lambda \boldsymbol{E}) \boldsymbol{A} = \lambda \boldsymbol{A} (λE)A=λA A ( λ E ) = λ A \boldsymbol{A} (\lambda \boldsymbol{E}) = \lambda \boldsymbol{A} A(λE)=λA,可知纯量阵 λ E \lambda \boldsymbol{E} λE 于矩阵 A \boldsymbol{A} A 的乘积等于数 λ \lambda λ A \boldsymbol{A} A 的乘积。

    A \boldsymbol{A} A n n n 阶方阵时,有
    ( λ E n ) A n = λ A n = A n ( λ E n ) (\lambda \boldsymbol{E}_n) \boldsymbol{A}_n = \lambda \boldsymbol{A}_n = \boldsymbol{A}_n (\lambda \boldsymbol{E}_n) (λEn)An=λAn=An(λEn)
    表明纯量阵与任何同阶方阵都是可交换的。

    3.3 矩阵的幂

    根据矩阵的乘法,定义矩阵的幂。设 A \boldsymbol{A} A n n n 阶方阵,定义
    A 1 = A , A 2 = A 1 A 1 , ⋯   , A k + 1 = A k A 1 \boldsymbol{A}^1 = \boldsymbol{A}, \hspace{1em} \boldsymbol{A}^2 = \boldsymbol{A}^1 \boldsymbol{A}^1, \hspace{1em} \cdots, \hspace{1em} \boldsymbol{A}^{k+1} = \boldsymbol{A}^k \boldsymbol{A}^1 A1=A,A2=A1A1,,Ak+1=AkA1
    其中 k k k 为正整数,这就是说, A k \boldsymbol{A}^k Ak 就是 k k k A \boldsymbol{A} A 连乘。显然只有方阵的幂才有意义。

    由于矩阵乘法适合结合律,所以矩阵的幂满足以下运算规律:

    • A k A l = A k + l \boldsymbol{A}^k \boldsymbol{A}^l = \boldsymbol{A}^{k+l} AkAl=Ak+l
    • ( A k ) l = A k l (\boldsymbol{A}^k)^l = \boldsymbol{A}^{kl} (Ak)l=Akl

    其中 k k k l l l 为正整数。

    需要注意的是:对于两个 n n n 阶矩阵 A \boldsymbol{A} A B \boldsymbol{B} B,一般来说 ( A B ) k ≠ A k B k (\boldsymbol{A} \boldsymbol{B})^k \ne \boldsymbol{A}^k \boldsymbol{B}^k (AB)k=AkBk,只有当 A \boldsymbol{A} A B \boldsymbol{B} B 可交换时,才有 ( A B ) k = A k B k (\boldsymbol{A} \boldsymbol{B})^k = \boldsymbol{A}^k \boldsymbol{B}^k (AB)k=AkBk

    4 矩阵的转置

    定义5 把矩阵 A \boldsymbol{A} A 的行换成同序数的列得到一个新矩阵,叫做 A \boldsymbol{A} A转置矩阵,记作 A T \boldsymbol{A}^T AT

    矩阵的转置也是一种运算,满足下述运算规律(假设运算都是可行的):

    • ( A T ) T = A (\boldsymbol{A}^T)^T = \boldsymbol{A} (AT)T=A
    • ( A + B ) T = A T + B T (\boldsymbol{A} + \boldsymbol{B})^T = \boldsymbol{A}^T + \boldsymbol{B}^T (A+B)T=AT+BT;
    • ( λ A ) T = λ A T (\lambda \boldsymbol{A})^T = \lambda \boldsymbol{A}^T (λA)T=λAT
    • ( A B ) T = B T A T (\boldsymbol{A} \boldsymbol{B})^T = \boldsymbol{B}^T \boldsymbol{A}^T (AB)T=BTAT

    性质  ( A B ) T = B T A T (\boldsymbol{A} \boldsymbol{B})^T = \boldsymbol{B}^T \boldsymbol{A}^T (AB)T=BTAT

    证明 设 A = ( a i j ) m × s \boldsymbol{A} = (a_{ij})_{m \times s} A=(aij)m×s B = ( b i j ) s × n \boldsymbol{B} = (b_{ij})_{s \times n} B=(bij)s×n,记 A B = C = ( c i j ) m × n \boldsymbol{A} \boldsymbol{B} = \boldsymbol{C} = (c_{ij})_{m \times n} AB=C=(cij)m×n B T A T = D = ( d i j ) n × m \boldsymbol{B}^T \boldsymbol{A}^T = \boldsymbol{D} = (d_{ij})_{n \times m} BTAT=D=(dij)n×m,于是有
    c j i = ∑ k = 1 s = a j k b k i c_{ji} = \sum_{k=1}^s = a_{jk} b_{ki} cji=k=1s=ajkbki
    B T \boldsymbol{B}^T BT 的第 i i i 行为 ( b 1 i , ⋯   , b s i ) (b_{1i},\cdots,b_{si}) (b1i,,bsi) A T \boldsymbol{A}^T AT 的第 j j j 列为 ( a j 1 , ⋯   , a j s ) (a_{j1},\cdots,a_{js}) (aj1,,ajs),因此
    d i j = ∑ k = 1 s b k i a j k = ∑ k = 1 s a j k b k i d_{ij} = \sum_{k=1}^s b_{ki} a_{jk} = \sum_{k=1}^s a_{jk} b_{ki} dij=k=1sbkiajk=k=1sajkbki
    所以
    d i j = c j i ( i = 1 , 2 , ⋯   , n ; j = 1 , 2 , ⋯   , m ) d_{ij} = c_{ji} \hspace{1em} (i=1,2,\cdots,n;j=1,2,\cdots,m) dij=cji(i=1,2,,n;j=1,2,,m)
    D = C T \boldsymbol{D} = \boldsymbol{C}^T D=CT,亦即 B T A T = ( A B ) T \boldsymbol{B}^T \boldsymbol{A}^T = (\boldsymbol{A} \boldsymbol{B})^T BTAT=(AB)T

    4.1 对称矩阵

    A \boldsymbol{A} A n n n 阶方阵,如果满足 A T = A \boldsymbol{A}^T = \boldsymbol{A} AT=A,即
    a j i = a i j ( i , j = 1 , 2 , ⋯   , n ) a_{ji} = a_{ij} \hspace{1em} (i,j=1,2,\cdots,n) aji=aij(i,j=1,2,,n)
    那么 A \boldsymbol{A} A 称为 对称矩阵,简称 对称阵。对称矩阵的特点是:它的元素以对角线为对称轴对应相等。

    5 方阵的行列式

    定义6 由 n n n 阶方阵 A \boldsymbol{A} A 的元素所构成的行列式(各元素的位置不变),称为 方阵 A \boldsymbol{A} A 的行列式,记作 det ⁡ A \det \boldsymbol{A} detA ∣ A ∣ |\boldsymbol{A}| A

    应该注意,方阵与行列式是两个不同的概念, n n n 阶方阵是 n 2 n^2 n2 个数按一定方式排成的数表,而 n n n 阶行列式则是这些数按一定的运算法则所确定的一个数。

    A \boldsymbol{A} A 确定 ∣ A ∣ |\boldsymbol{A}| A 的这个运算满足下列运算规律(设 A \boldsymbol{A} A B \boldsymbol{B} B n n n 阶方阵, λ \lambda λ 为数):

    • ∣ A T ∣ = ∣ A ∣ |\boldsymbol{A}^T| = |\boldsymbol{A}| AT=A
    • ∣ λ A ∣ = λ n ∣ A ∣ |\lambda \boldsymbol{A}| = \lambda^n |\boldsymbol{A}| λA=λnA
    • ∣ A B ∣ = ∣ A ∣ ∣ B ∣ |\boldsymbol{A} \boldsymbol{B}| = |\boldsymbol{A}| |\boldsymbol{B}| AB=A∣∣B

    需要注意的是:对于 n n n 阶矩阵 A \boldsymbol{A} A B \boldsymbol{B} B,一般来说 A B ≠ B A \boldsymbol{A} \boldsymbol{B} \ne \boldsymbol{B} \boldsymbol{A} AB=BA,但总有
    ∣ A B ∣ = ∣ B A ∣ |\boldsymbol{A} \boldsymbol{B}| = |\boldsymbol{B} \boldsymbol{A}| AB=BA
    性质: ∣ A B ∣ = ∣ A ∣ ∣ B ∣ |\boldsymbol{A} \boldsymbol{B}| = |\boldsymbol{A}| |\boldsymbol{B}| AB=A∣∣B

    证明 设 A = ( a i j ) n × n \boldsymbol{A} = (a_{ij})_{n \times n} A=(aij)n×n B = ( b i j ) n × n \boldsymbol{B} = (b_{ij})_{n \times n} B=(bij)n×n。记 2 n 2n 2n 阶行列式
    D = ∣ a 11 ⋯ a 1 n 0 ⋯ 0 ⋮ ⋮ ⋮ ⋮ a n 1 ⋯ a n n 0 ⋯ 0 − 1 ⋯ 0 b 11 ⋯ b 1 n ⋮ ⋮ ⋮ ⋮ 0 ⋯ − 1 b n 1 ⋯ b n n ∣ = ∣ A O − E B ∣ D =

    |a11a1n00an1ann0010b11b1n01bn1bnn|" role="presentation" style="position: relative;">|a11a1n00an1ann0010b11b1n01bn1bnn|
    =
    |AOEB|" role="presentation">|AOEB|
    D= a11an110a1nann0100b11bn100b1nbnn = AEOB
    由 “阶梯状行列式的性质” 可知, D = ∣ A ∣ ∣ B ∣ D = |\boldsymbol{A}| |\boldsymbol{B}| D=A∣∣B。现将 D D D 中以 b 11 b_{11} b11 乘第 1 1 1 列, b 21 b_{21} b21 乘第 2 2 2 列,……, b n 1 b_{n1} bn1 乘第 n n n 列都加到第 n + 1 n+1 n+1 列上;再以 b 12 b_{12} b12 乘第 1 1 1 列,……, b n 2 b_{n2} bn2 乘第 n n n 列都加到第 n + 2 n+2 n+2 列上;……;最后以 b 1 n b_{1n} b1n 乘第 1 1 1 列,……, b n n b_{nn} bnn 乘第 n n n 列都加到第 2 n 2n 2n 列上,即
    D = c n + 1 + b 11 c 1 + ⋯ b n 1 c n ∣ a 11 ⋯ a 1 n a 11 b 11 + a 12 b 21 + ⋯ + a 1 n b n 1 ⋯ 0 ⋮ ⋮ ⋮ ⋮ a n 1 ⋯ a n n a n 1 b 11 + a n 2 b 21 + ⋯ + a n n b n 1 ⋯ 0 − 1 ⋯ 0 0 ⋯ b 1 n ⋮ ⋮ ⋮ ⋮ 0 ⋯ − 1 0 ⋯ b n n ∣ ⋯ = c 2 n + b 1 n c 1 + ⋯ b n n c n ∣ a 11 ⋯ a 1 n a 11 b 11 + a 12 b 21 + ⋯ + a 1 n b n 1 ⋯ a 11 b 1 n + a 12 b 2 n + ⋯ + a 1 n b n n ⋮ ⋮ ⋮ ⋮ a n 1 ⋯ a n n a n 1 b 11 + a n 2 b 21 + ⋯ + a n n b n 1 ⋯ a n 1 b 1 n + a n 2 b 2 n + ⋯ + a n n b n n − 1 ⋯ 0 0 ⋯ 0 ⋮ ⋮ ⋮ ⋮ 0 ⋯ − 1 0 ⋯ 0 ∣ = ∣ A X − E O ∣
    D\xlongequalcn+1+b11c1+bn1cn|a11a1na11b11+a12b21++a1nbn10an1annan1b11+an2b21++annbn10100b1n010bnn|\xlongequalc2n+b1nc1+bnncn|a11a1na11b11+a12b21++a1nbn1a11b1n+a12b2n++a1nbnnan1annan1b11+an2b21++annbn1an1b1n+an2b2n++annbnn10000100|=|AXEO|" role="presentation" style="position: relative;">D\xlongequalcn+1+b11c1+bn1cn|a11a1na11b11+a12b21++a1nbn10an1annan1b11+an2b21++annbn10100b1n010bnn|\xlongequalc2n+b1nc1+bnncn|a11a1na11b11+a12b21++a1nbn1a11b1n+a12b2n++a1nbnnan1annan1b11+an2b21++annbn1an1b1n+an2b2n++annbnn10000100|=|AXEO|
    Dcn+1+b11c1+bn1cn a11an110a1nann01a11b11+a12b21++a1nbn1an1b11+an2b21++annbn10000b1nbnn c2n+b1nc1+bnncn a11an110a1nann01a11b11+a12b21++a1nbn1an1b11+an2b21++annbn100a11b1n+a12b2n++a1nbnnan1b1n+an2b2n++annbnn00 = AEXO

    其中 n n n 阶矩阵 X = ( x i j ) \boldsymbol{X} = (x_{ij}) X=(xij),因 x i j = ∑ k = 1 n a i k b k j x_{ij} = \sum_{k=1}^n a_{ik} b_{kj} xij=k=1naikbkj,知 X = A B \boldsymbol{X} = \boldsymbol{A} \boldsymbol{B} X=AB。再对上式最后一个行列式作 n n n 次行对换: r 1 ↔ r n + 1 r_1 \leftrightarrow r_{n+1} r1rn+1 r 2 ↔ r n + 2 r_2 \leftrightarrow r_{n+2} r2rn+2,……, r n ↔ r 2 n r_n \leftrightarrow r_{2n} rnr2n,得
    D = ( − 1 ) n ∣ − E O A X ∣ = ( − 1 ) n ∣ E ∣ ∣ X ∣ = ( − 1 ) n ( − 1 ) n ∣ X ∣ = ∣ X ∣ = ∣ A B ∣ D = (-1)^n

    |EOAX|" role="presentation" style="position: relative;">|EOAX|
    = (-1)^n |\boldsymbol{E}| |\boldsymbol{X}| = (-1)^n (-1)^n |\boldsymbol{X}| = |\boldsymbol{X}| = |\boldsymbol{A} \boldsymbol{B}| D=(1)n EAOX =(1)nE∣∣X=(1)n(1)nX=X=AB
    得证。

    5.1 伴随矩阵

    行列式 ∣ A ∣ |\boldsymbol{A}| A 的各个元素的代数余子式 A i j A_{ij} Aij 所构成的如下的矩阵
    A ∗ = ( A 11 A 21 ⋯ A n 1 A 12 A 22 ⋯ A n 2 ⋮ ⋮ ⋮ A 1 n A 2 n ⋯ A n n ) \boldsymbol{A}^* =

    (A11A21An1A12A22An2A1nA2nAnn)" role="presentation" style="position: relative;">(A11A21An1A12A22An2A1nA2nAnn)
    A= A11A12A1nA21A22A2nAn1An2Ann
    称为矩阵 A \boldsymbol{A} A伴随矩阵,简称 伴随阵

    性质1  A A ∗ = A ∗ A = ∣ A ∣ E \boldsymbol{A} \boldsymbol{A}^* = \boldsymbol{A}^* \boldsymbol{A} = |\boldsymbol{A}| \boldsymbol{E} AA=AA=AE

    证明 设 A = ( a i j ) \boldsymbol{A} = (a_{ij}) A=(aij),记 A A = ( b i j ) \boldsymbol{A} \boldsymbol{A}^ = (b_{ij}) AA=(bij),则
    b i j = a i 1 A j 1 + a i 2 A j 2 + ⋯ + a i n A j n = { ∣ A ∣ , i = j 0 , i ≠ j b_{ij} = a_{i1} A_{j1} + a_{i2} A_{j2} + \cdots + a_{in} A_{jn} =

    {|A|,i=j0,ij" role="presentation" style="position: relative;">{|A|,i=j0,ij
    bij=ai1Aj1+ai2Aj2++ainAjn={A,0,i=ji=j

    A A ∗ = ( ∣ A ∣ ∣ A ∣ ⋱ ∣ A ∣ ) = ∣ A ∣ E \boldsymbol{A} \boldsymbol{A}^* =
    (|A||A||A|)" role="presentation" style="position: relative;">(|A||A||A|)
    = |\boldsymbol{A}| \boldsymbol{E}
    AA= AAA =AE

    类似有
    A ∗ A = ∣ A ∣ E \boldsymbol{A}^* \boldsymbol{A} = |\boldsymbol{A}| \boldsymbol{E} AA=AE

  • 相关阅读:
    js处理字符串转数组,数组转字符串
    高级架构师纯手写MySQL笔记,已经熬夜学习了
    Kubernetes实战(一)-二进制部署Kubernetes集群
    华为云14天鸿蒙设备开发-Day7WIFI功能开发
    rabbitMQ学习-消息应答
    Python面试题:在 Python 中,如何实现一个 LRU(最近最少使用)缓存?
    小白立创机械狗从零到成品总结
    十七、SpringAMQP
    centos7中如何安装gdal最好?
    (02)Cartographer源码无死角解析-(16) SensorBridge→回调函数之数据流向分析
  • 原文地址:https://blog.csdn.net/Changxing_J/article/details/126925022