Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof of the determinant of a block triangular matrix by the Leibniz formula

Builds on Block matrixLeibniz formula for determinantsSign of a permutationSign is a homomorphism

Proof

  1. Let N=m+nN = m + n and let M=(Mij)M = (M_{ij}) be the N×NN \times N block matrix (AB0D)\begin{pmatrix} A & B \\ 0 & D \end{pmatrix}.
  2. Then Mij=aijM_{ij} = a_{ij} for i,j≤mi, j \le m, and Mm+k,m+l=dklM_{m+k, m+l} = d_{kl} for k,l≤nk, l \le n. Also Mij=0M_{ij} = 0 when i>mi > m and j≤mj \le m.
  3. By the Leibniz formula, det⁡M=∑σ∈SNsgn⁡(σ)∏i=1NMi,σ(i)\det M = \sum_{\sigma \in S_N} \sgn(\sigma) \prod_{i=1}^{N} M_{i, \sigma(i)}.
  4. Let TT be the set of σ∈SN\sigma \in S_N with σ(i)>m\sigma(i) > m for all i>mi > m. If σ∉T\sigma \notin T, then σ(i)≤m\sigma(i) \le m for some i>mi > m, so Mi,σ(i)=0M_{i, \sigma(i)} = 0 and the term of σ\sigma is 00.
  5. Let σ∈T\sigma \in T. Then σ\sigma maps the finite set {m+1,…,N}\set{m+1, \dots, N} injectively into itself, so onto itself. Hence σ\sigma also maps {1,…,m}\set{1, \dots, m} onto itself.
  6. So each σ∈T\sigma \in T gives α∈Sm\alpha \in S_m and β∈Sn\beta \in S_n by α(i)=σ(i)\alpha(i) = \sigma(i) for i≤mi \le m and β(k)=σ(m+k)−m\beta(k) = \sigma(m + k) - m for k≤nk \le n.
  7. Conversely, each pair (α,β)∈Sm×Sn(\alpha, \beta) \in S_m \times S_n comes from exactly one σ∈T\sigma \in T, defined by these two formulas. So σ↦(α,β)\sigma \mapsto (\alpha, \beta) is a bijection from TT onto Sm×SnS_m \times S_n.
  8. Let α′\alpha' act as α\alpha on {1,…,m}\set{1, \dots, m} and fix the other points. Let β′\beta' fix {1,…,m}\set{1, \dots, m} and send m+km + k to m+β(k)m + \beta(k). Then σ=α′β′\sigma = \alpha' \beta'.
  9. A product of transpositions in SmS_m that equals α\alpha is also a product of transpositions in SNS_N that equals α′\alpha'. By the definition of the sign, sgn⁡(α′)=sgn⁡(α)\sgn(\alpha') = \sgn(\alpha).
  10. Shifting each transposition by mm in the same way gives sgn⁡(β′)=sgn⁡(β)\sgn(\beta') = \sgn(\beta). If m=1m = 1 or n=1n = 1, the corresponding permutation is the identity, with sign 11.
  11. Since N≥2N \ge 2, the sign is a homomorphism on SNS_N. So sgn⁡(σ)=sgn⁡(α′)sgn⁡(β′)=sgn⁡(α)sgn⁡(β)\sgn(\sigma) = \sgn(\alpha') \sgn(\beta') = \sgn(\alpha) \sgn(\beta).
  12. By step 2, the product in the term of σ∈T\sigma \in T is ∏i=1mai,α(i)⋅∏k=1ndk,β(k)\prod_{i=1}^{m} a_{i, \alpha(i)} \cdot \prod_{k=1}^{n} d_{k, \beta(k)}.
  13. By steps 4, 7, 11 and 12, det⁡M=∑α∈Sm∑β∈Snsgn⁡(α)∏i=1mai,α(i)⋅sgn⁡(β)∏k=1ndk,β(k)\det M = \sum_{\alpha \in S_m} \sum_{\beta \in S_n} \sgn(\alpha) \prod_{i=1}^{m} a_{i, \alpha(i)} \cdot \sgn(\beta) \prod_{k=1}^{n} d_{k, \beta(k)}.
  14. The double sum factors as a product of a sum over α\alpha and a sum over β\beta. By the Leibniz formula, these sums are det⁡A\det A and det⁡D\det D.
  15. So det⁡M=det⁡A⋅det⁡D\det M = \det A \cdot \det D.

Idea

The zero block kills every Leibniz term whose permutation sends a lower row to a left column. The remaining permutations keep the two blocks of indices separate, so they split into a permutation of each block. The sum then factors into the Leibniz formulas for AA and DD.

Reading path

To understand this page from the ground up, read these 103 pages in order. The foundations come first. The path takes the proofs Proof of the decomposition of a permutation into transpositions, Proof that the symmetric group is generated by transpositions, Proof of the commutativity of addition by induction, Proof that equivalence classes form a partition, Proof that permuting rows multiplies the determinant by the sign, Proof that disjoint cycles commute, Proof that a matrix with two equal rows has determinant zero, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof that an intersection of subgroups is a subgroup, Proof that the sign is a homomorphism, Proof that the determinant of the identity matrix is one, Proof of the decomposition of a permutation into disjoint cycles, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the Leibniz formula from the defining properties of the determinant, Proof of the uniqueness of inverses, Proof that the determinant is multilinear in the rows, Proof of the subgroup criterion.

  1. Binary operation definition
  2. Cycle notation concept
  3. Definition by recursion concept
  4. Divisibility definition
  5. Element definition
  6. Group concept
  7. Identity matrix object
  8. Mathematical induction concept
  9. Matrix definition
  10. Multilinear map concept
  11. Natural numbers object
  12. Peano axioms concept
  13. Permutation concept
  14. Proposition concept
  15. Transposition concept
  16. Vector space definition
  17. Identity element definition
  18. Set definition
  19. Group homomorphism definition
  20. Subgroup definition
  21. Symmetric group definition
  22. Block matrix definition
  23. Square matrix definition
  24. Successor function definition
  25. Conjunction definition
  26. Disjunction definition
  27. Implication definition
  28. Predicate definition
  29. Linear map definition
  30. Inverse element definition
  31. Empty set object
  32. Family of sets definition
  33. Ordered pair definition
  34. Transposition definition
  35. Proof that an intersection of subgroups is a subgroup proof
  36. Intersection definition
  37. Union definition
  38. Set-builder notation concept
  39. Addition of natural numbers definition
  40. Biconditional definition
  41. The successor function is injective statement
  42. Zero is not a successor statement
  43. Existential quantifier definition
  44. Universal quantifier definition
  45. Multilinear map definition
  46. Proof of the uniqueness of inverses proof
  47. Cartesian product definition
  48. Disjoint sets definition
  49. Axiom of extensionality statement
  50. Subset definition
  51. Union of a family of sets definition
  52. Proof of the commutativity of addition by induction proof
  53. Order on the natural numbers definition
  54. Uniqueness quantifier definition
  55. Alternating multilinear map definition
  56. Uniqueness of inverses statement
  57. Binary relation definition
  58. Partition of a set definition
  59. Determinant definition
  60. Commutativity of addition statement
  61. Proof of strong induction from ordinary induction proof
  62. Reflexive relation definition
  63. Symmetric relation definition
  64. Transitive relation definition
  65. Proof of the laws of exponents in a group proof
  66. Proof of the subgroup criterion proof
  67. Proof that a matrix with two equal rows has determinant zero proof
  68. Function definition
  69. Proof that the determinant of the identity matrix is one proof
  70. Proof that the determinant is multilinear in the rows proof
  71. Strong induction statement
  72. Equivalence relation definition
  73. Subgroup criterion statement
  74. Determinant of a matrix with two equal rows statement
  75. Laws of exponents in a group statement
  76. Determinant of the identity matrix statement
  77. Determinant is multilinear in the rows statement
  78. Injective function definition
  79. Proof of the well-ordering principle from strong induction proof
  80. Intersection of subgroups is a subgroup statement
  81. Proof that disjoint cycles commute proof
  82. Equivalence class definition
  83. Well-ordering principle statement
  84. Subgroup generated by a subset definition
  85. Proof that equivalence classes form a partition proof
  86. Disjoint cycles commute statement
  87. Proof of the division algorithm proof
  88. Equivalence classes form a partition statement
  89. Division algorithm statement
  90. Proof of the decomposition of a permutation into disjoint cycles proof
  91. Decomposition of a permutation into disjoint cycles statement
  92. Proof of the decomposition of a permutation into transpositions proof
  93. Decomposition of a permutation into transpositions statement
  94. Sign of a permutation definition
  95. Proof that the symmetric group is generated by transpositions proof
  96. The symmetric group is generated by transpositions statement
  97. Proof that the sign is a homomorphism proof
  98. Sign is a homomorphism statement
  99. Proof that permuting rows multiplies the determinant by the sign proof
  100. Permuting rows multiplies the determinant by the sign statement
  101. Proof of the Leibniz formula from the defining properties of the determinant proof
  102. Leibniz formula for determinants statement
  103. Proof of the determinant of a block triangular matrix by the Leibniz formula proof

Where this leads

39 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Block_matrix, Determinant
About this page
Tag92GVP9180G
URIm2://92GVP9180G
Kindproof
WritingW0 stub
MSC15A15
ProvesDeterminant of a block triangular matrix
UsesBlock matrix, Leibniz formula for determinants, Sign of a permutation, Sign is a homomorphism
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.