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.
- Let be the block matrix of the statement, with . Let .
- Let and , where are identity matrices and are zero blocks.
- Block products: by the definition of the matrix product, entry of a product is .
- Split this sum into the indices and . This shows that block matrices with the same splitting multiply block by block, like matrices.
- By step 4, the top blocks of are and .
- The bottom left block of is , by associativity and the definition of the inverse.
- The bottom right block of is . So .
- By the rule for block triangular matrices, .
- The transpose of is , which is upper block triangular.
- By the rule for the determinant of a transpose, the rule for block triangular matrices and by the determinant of the identity, .
- By the product rule and steps 7, 8 and 10, .
Idea
Subtracting times the top block row from the bottom block row clears the block . 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 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.
- Binary operation definition
- Cycle notation concept
- Definition by recursion concept
- Divisibility definition
- Element definition
- Group concept
- Identity matrix object
- Mathematical induction concept
- Matrix definition
- Multilinear map concept
- Natural numbers object
- Peano axioms concept
- Permutation concept
- Permutation definition
- Proposition concept
- Transposition concept
- Vector space definition
- Identity element definition
- Set definition
- Group homomorphism definition
- Ring definition
- Subgroup definition
- Symmetric group definition
- Block matrix definition
- Matrix multiplication definition
- Square matrix definition
- Transpose definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Linear map definition
- Inverse element definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Transposition definition
- Proof that an intersection of subgroups is a subgroup proof
- Proof of the associativity of matrix multiplication proof
- Intersection definition
- Union definition
- Invertible matrix definition
- Addition of natural numbers definition
- Set-builder notation concept
- The successor function is injective statement
- Zero is not a successor statement
- Biconditional definition
- Existential quantifier definition
- Universal quantifier definition
- Multilinear map definition
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Disjoint sets definition
- Associativity of matrix multiplication statement
- Union of a family of sets definition
- Subset definition
- Axiom of extensionality statement
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- Uniqueness quantifier definition
- Alternating multilinear map definition
- Uniqueness of inverses statement
- Binary relation definition
- Partition of a set definition
- Commutativity of addition statement
- Determinant definition
- Proof of strong induction from ordinary induction proof
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Proof of the laws of exponents in a group proof
- Proof of the subgroup criterion proof
- Proof that a matrix with two equal rows has determinant zero proof
- Function definition
- Proof that the determinant of the identity matrix is one proof
- Proof that the determinant is multilinear in the rows proof
- Strong induction statement
- Equivalence relation definition
- Laws of exponents in a group statement
- Subgroup criterion statement
- Determinant of a matrix with two equal rows statement
- Determinant of the identity matrix statement
- Determinant is multilinear in the rows statement
- Injective function definition
- Proof of the well-ordering principle from strong induction proof
- Proof that disjoint cycles commute proof
- Intersection of subgroups is a subgroup statement
- Equivalence class definition
- Well-ordering principle statement
- Disjoint cycles commute statement
- Proof that equivalence classes form a partition proof
- Subgroup generated by a subset definition
- Proof of the division algorithm proof
- Equivalence classes form a partition statement
- Division algorithm statement
- Proof of the decomposition of a permutation into disjoint cycles proof
- Decomposition of a permutation into disjoint cycles statement
- Proof of the decomposition of a permutation into transpositions proof
- Decomposition of a permutation into transpositions statement
- Sign of a permutation definition
- Proof that the symmetric group is generated by transpositions proof
- The symmetric group is generated by transpositions statement
- Proof that the sign is a homomorphism proof
- Sign is a homomorphism statement
- Proof that permuting rows multiplies the determinant by the sign proof
- Permuting rows multiplies the determinant by the sign statement
- Proof of the Leibniz formula from the defining properties of the determinant proof
- Leibniz formula for determinants statement
- Proof of the determinant of a block triangular matrix by the Leibniz formula proof
- Proof that the determinant is multiplicative by expanding the rows proof
- Proof that the determinant of a transpose equals the determinant proof
- Determinant of a block triangular matrix statement
- Determinant is multiplicative statement
- Determinant of a transpose statement
- Proof of the Schur complement formula by block factorization proof
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | 3T0706APQT |
|---|---|
| URI | m2://3T0706APQT |
| Kind | proof |
| Writing | W0 stub |
| MSC | 15A15 |
| Proves | Determinant via the Schur complement |
| Uses | Block 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 |
| Changed | 4 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.