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
- Let and let be the block matrix .
- Then for , and for . Also when and .
- By the Leibniz formula, .
- Let be the set of with for all . If , then for some , so and the term of is .
- Let . Then maps the finite set injectively into itself, so onto itself. Hence also maps onto itself.
- So each gives and by for and for .
- Conversely, each pair comes from exactly one , defined by these two formulas. So is a bijection from onto .
- Let act as on and fix the other points. Let fix and send to . Then .
- A product of transpositions in that equals is also a product of transpositions in that equals . By the definition of the sign, .
- Shifting each transposition by in the same way gives . If or , the corresponding permutation is the identity, with sign .
- Since , the sign is a homomorphism on . So .
- By step 2, the product in the term of is .
- By steps 4, 7, 11 and 12, .
- The double sum factors as a product of a sum over and a sum over . By the Leibniz formula, these sums are and .
- So .
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 and .
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.
- 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
- Proposition concept
- Transposition concept
- Vector space definition
- Identity element definition
- Set definition
- Group homomorphism definition
- Subgroup definition
- Symmetric group definition
- Block matrix definition
- Square matrix 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
- Intersection definition
- Union definition
- Set-builder notation concept
- Addition of natural numbers definition
- Biconditional definition
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Multilinear map definition
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Disjoint sets definition
- Axiom of extensionality statement
- Subset definition
- Union of a family of sets definition
- 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
- Determinant definition
- Commutativity of addition statement
- 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
- Subgroup criterion statement
- Determinant of a matrix with two equal rows statement
- Laws of exponents in a group 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
- Intersection of subgroups is a subgroup statement
- Proof that disjoint cycles commute proof
- Equivalence class definition
- Well-ordering principle statement
- Subgroup generated by a subset definition
- Proof that equivalence classes form a partition proof
- Disjoint cycles commute statement
- 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
Where this leads
39 pages build on this one.
- Triangularisation
- Lagrange multiplier with one constraint
- Determinant of a matrix exponential
- Matrix determinant lemma
- Implicit function theorem
- Sylvester's determinant theorem
- Determinant of a block triangular matrix
- Determinant via the Schur complement
- Implicit function theorem for a surjective derivative
- Implicit differentiation
- Lagrange multipliers
- Sylvester's criterion
- Decomposition into generalised eigenspaces
- Proof of the Lagrange multiplier rule with one constraint
- Proof of the implicit function theorem for a surjective derivative
- Proof of the implicit function theorem from the inverse function theorem
- Augmented Lagrangian method
- Proof of the Schur complement formula by block factorization
- Proof of Sylvester's criterion by induction and completing the square
- Proof of the Lagrange multiplier theorem by the implicit function theorem
- Sylvester's determinant identity
- Marshallian demand function
- Utility maximization problem
- Implicit function theorem in Banach spaces
- Lyapunov–Schmidt reduction
- Numerical continuation
- Sequential quadratic programming
- Differential-algebraic system of equations
- Proof of the decomposition into generalised eigenspaces
- Backus–Gilbert method
- Regular value theorem
- Proof of the matrix determinant lemma from Sylvester's determinant theorem
- Configuration space
- Lagrange multipliers for constraints
- Proof of triangularisation by induction on the size
- Proof of Sylvester's determinant theorem by two block factorizations
- Indirect utility function
- Proof that the determinant of a matrix exponential is the exponential of the trace
- Adjoint state method
Further reading
- Web https://en.wikipedia.org/wiki/Block_matrix, Determinant
About this page
| Tag | 92GVP9180G |
|---|---|
| URI | m2://92GVP9180G |
| Kind | proof |
| Writing | W0 stub |
| MSC | 15A15 |
| Proves | Determinant of a block triangular matrix |
| Uses | Block matrix, Leibniz formula for determinants, Sign of a permutation, Sign is a homomorphism |
| 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.