Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof of the Schur complement formula by block factorization

Builds on Block matrixMatrix multiplicationAssociativity of matrix multiplicationInvertible matrixDeterminant is multiplicativeDeterminant of a block triangular matrixDeterminant of a transposeTransposeDeterminant of the identity matrixIdentity matrix

Proof

We factor the block matrix into a lower and an upper block triangular matrix.

  1. Let M=(ABCD)M = \begin{pmatrix} A & B \\ C & D \end{pmatrix} be the block matrix of the statement, with p,q≥1p, q \ge 1. Let S=D−CA−1BS = D - C A^{-1} B.
  2. Let L=(Ip0CA−1Iq)L = \begin{pmatrix} I_p & 0 \\ C A^{-1} & I_q \end{pmatrix} and U=(AB0S)U = \begin{pmatrix} A & B \\ 0 & S \end{pmatrix}, where Ip,IqI_p, I_q are identity matrices and 00 are zero blocks.
  3. Block products: by the definition of the matrix product, entry (r,s)(r, s) of a product is ∑kXrkYks\sum_k X_{rk} Y_{ks}.
  4. Split this sum into the indices k≤pk \le p and k>pk > p. This shows that block matrices with the same splitting multiply block by block, like 2×22 \times 2 matrices.
  5. By step 4, the top blocks of LULU are IpA+0⋅0=AI_p A + 0 \cdot 0 = A and IpB+0⋅S=BI_p B + 0 \cdot S = B.
  6. The bottom left block of LULU is CA−1A+Iq⋅0=C(A−1A)=CC A^{-1} A + I_q \cdot 0 = C (A^{-1} A) = C, by associativity and the definition of the inverse.
  7. The bottom right block of LULU is CA−1B+S=CA−1B+D−CA−1B=DC A^{-1} B + S = C A^{-1} B + D - C A^{-1} B = D. So LU=MLU = M.
  8. By the rule for block triangular matrices, det⁡U=det⁡A⋅det⁡S\det U = \det A \cdot \det S.
  9. The transpose of LL is (Ip(CA−1)T0Iq)\begin{pmatrix} I_p & (C A^{-1})^T \\ 0 & I_q \end{pmatrix}, which is upper block triangular.
  10. By the rule for the determinant of a transpose, the rule for block triangular matrices and det⁡Ip=det⁡Iq=1\det I_p = \det I_q = 1 by the determinant of the identity, det⁡L=det⁡LT=1\det L = \det L^T = 1.
  11. By the product rule and steps 7, 8 and 10, det⁡M=det⁡L⋅det⁡U=det⁡A⋅det⁡(D−CA−1B)\det M = \det L \cdot \det U = \det A \cdot \det(D - C A^{-1} B).

Idea

Subtracting CA−1C A^{-1} times the top block row from the bottom block row clears the block CC. This row operation is multiplication by a block triangular matrix with identity diagonal blocks, so it does not change the determinant. What remains is block triangular, with diagonal blocks AA and the Schur complement.

Reading path

To understand this page from the ground up, read these 116 pages in order. The foundations come first. The path takes the proofs Proof of the associativity of matrix multiplication, 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 the determinant is multiplicative by expanding the rows, Proof that permuting rows multiplies the determinant by the sign, Proof that disjoint cycles commute, Proof of the determinant of a block triangular matrix by the Leibniz formula, Proof that a matrix with two equal rows has determinant zero, Proof of strong induction from ordinary induction, Proof that the determinant of a transpose equals the determinant, 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. Permutation definition
  15. Proposition concept
  16. Transposition concept
  17. Vector space definition
  18. Identity element definition
  19. Set definition
  20. Group homomorphism definition
  21. Ring definition
  22. Subgroup definition
  23. Symmetric group definition
  24. Block matrix definition
  25. Matrix multiplication definition
  26. Square matrix definition
  27. Transpose definition
  28. Successor function definition
  29. Conjunction definition
  30. Disjunction definition
  31. Implication definition
  32. Predicate definition
  33. Linear map definition
  34. Inverse element definition
  35. Empty set object
  36. Family of sets definition
  37. Ordered pair definition
  38. Transposition definition
  39. Proof that an intersection of subgroups is a subgroup proof
  40. Proof of the associativity of matrix multiplication proof
  41. Intersection definition
  42. Union definition
  43. Invertible matrix definition
  44. Addition of natural numbers definition
  45. Set-builder notation concept
  46. The successor function is injective statement
  47. Zero is not a successor statement
  48. Biconditional definition
  49. Existential quantifier definition
  50. Universal quantifier definition
  51. Multilinear map definition
  52. Proof of the uniqueness of inverses proof
  53. Cartesian product definition
  54. Disjoint sets definition
  55. Associativity of matrix multiplication statement
  56. Union of a family of sets definition
  57. Subset definition
  58. Axiom of extensionality statement
  59. Proof of the commutativity of addition by induction proof
  60. Order on the natural numbers definition
  61. Uniqueness quantifier definition
  62. Alternating multilinear map definition
  63. Uniqueness of inverses statement
  64. Binary relation definition
  65. Partition of a set definition
  66. Commutativity of addition statement
  67. Determinant definition
  68. Proof of strong induction from ordinary induction proof
  69. Reflexive relation definition
  70. Symmetric relation definition
  71. Transitive relation definition
  72. Proof of the laws of exponents in a group proof
  73. Proof of the subgroup criterion proof
  74. Proof that a matrix with two equal rows has determinant zero proof
  75. Function definition
  76. Proof that the determinant of the identity matrix is one proof
  77. Proof that the determinant is multilinear in the rows proof
  78. Strong induction statement
  79. Equivalence relation definition
  80. Laws of exponents in a group statement
  81. Subgroup criterion statement
  82. Determinant of a matrix with two equal rows statement
  83. Determinant of the identity matrix statement
  84. Determinant is multilinear in the rows statement
  85. Injective function definition
  86. Proof of the well-ordering principle from strong induction proof
  87. Proof that disjoint cycles commute proof
  88. Intersection of subgroups is a subgroup statement
  89. Equivalence class definition
  90. Well-ordering principle statement
  91. Disjoint cycles commute statement
  92. Proof that equivalence classes form a partition proof
  93. Subgroup generated by a subset definition
  94. Proof of the division algorithm proof
  95. Equivalence classes form a partition statement
  96. Division algorithm statement
  97. Proof of the decomposition of a permutation into disjoint cycles proof
  98. Decomposition of a permutation into disjoint cycles statement
  99. Proof of the decomposition of a permutation into transpositions proof
  100. Decomposition of a permutation into transpositions statement
  101. Sign of a permutation definition
  102. Proof that the symmetric group is generated by transpositions proof
  103. The symmetric group is generated by transpositions statement
  104. Proof that the sign is a homomorphism proof
  105. Sign is a homomorphism statement
  106. Proof that permuting rows multiplies the determinant by the sign proof
  107. Permuting rows multiplies the determinant by the sign statement
  108. Proof of the Leibniz formula from the defining properties of the determinant proof
  109. Leibniz formula for determinants statement
  110. Proof of the determinant of a block triangular matrix by the Leibniz formula proof
  111. Proof that the determinant is multiplicative by expanding the rows proof
  112. Proof that the determinant of a transpose equals the determinant proof
  113. Determinant of a block triangular matrix statement
  114. Determinant is multiplicative statement
  115. Determinant of a transpose statement
  116. Proof of the Schur complement formula by block factorization proof

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Schur_complement, Properties
About this page
Tag3T0706APQT
URIm2://3T0706APQT
Kindproof
WritingW0 stub
MSC15A15
ProvesDeterminant via the Schur complement
UsesBlock matrix, Matrix multiplication, Associativity of matrix multiplication, Invertible matrix, Determinant is multiplicative, Determinant of a block triangular matrix, Determinant of a transpose, Transpose, Determinant of the identity matrix, Identity matrix
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.