Linear and multilinear algebra; matrix theory Proof
Proof of the product of a matrix and its adjugate by Laplace expansion
Builds on Adjugate matrixCofactorMatrix multiplicationLaplace expansion along a rowLaplace expansion along a columnDeterminant of a matrix with two equal rowsDeterminant of a transposeIdentity matrix
Proof
We compute each entry of the two products by a Laplace expansion.
- Let be an matrix over with , and let be its cofactors.
- By the definition of the adjugate, .
- By the definition of the matrix product, for all .
- If , the sum in step 3 is by the Laplace expansion along row .
- Let . Let be the matrix that results when row of is replaced by row of .
- The cofactor of deletes row , the only row where and differ. So for all .
- Row of has entries . By the Laplace expansion of along row and step 6, .
- Rows and of are equal. By the rule for two equal rows, .
- By steps 3 to 8, is if and if . So , with the identity matrix .
- In the same way, for all .
- If , this sum is by the Laplace expansion along column .
- Let . Let be the matrix that results when column of is replaced by column of .
- The cofactor of deletes column , the only column where and differ. So for all .
- Column of has entries . By the Laplace expansion of along column , .
- Columns and of are equal, so the transpose of has two equal rows. By the rule for the determinant of a transpose and step 8's rule, .
- By steps 10 to 15, . Together with step 9, .
Idea
An entry of pairs one row of with the cofactors of another row. For the same row this is the Laplace expansion of . For different rows it is the expansion of a matrix with two equal rows, which is .
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 decomposition of a permutation into transpositions, Proof that the symmetric group is generated by transpositions, Proof of the Laplace expansion along a column by transposition, 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 the Laplace expansion along a row by the Leibniz formula, 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 sign of a cycle, 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
- Subgroup definition
- Symmetric group 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
- Intersection definition
- Union definition
- Set-builder notation concept
- Addition of natural numbers definition
- 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
- 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
- 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
- Minor definition
- 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
- Cofactor definition
- Intersection of subgroups is a subgroup statement
- Proof that disjoint cycles commute proof
- Equivalence class definition
- Well-ordering principle statement
- Adjugate matrix definition
- Subgroup generated by a subset definition
- Disjoint cycles commute statement
- Proof that equivalence classes form a partition proof
- 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
- Proof of the sign of a cycle proof
- Sign of a cycle statement
- 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 Laplace expansion along a row by the Leibniz formula proof
- Proof that the determinant of a transpose equals the determinant proof
- Determinant of a transpose statement
- Laplace expansion along a row statement
- Proof of the Laplace expansion along a column by transposition proof
- Laplace expansion along a column statement
- Proof of the product of a matrix and its adjugate by Laplace expansion proof
Where this leads
184 pages build on this one.
- Singular value decomposition
- Change of variables in multiple integrals
- Lotka–Volterra equations
- Volume of a ball in R^n
- Triangularisation
- A matrix is invertible iff its determinant is a unit
- Lagrange multiplier with one constraint
- Spectral theorem for normal matrices
- Product of a matrix and its adjugate
- Eigenvalues are the roots of the characteristic polynomial
- Jacobian of spherical coordinates
- Spectral theorem
- Existence of an eigenvalue over an algebraically closed field
- Minimal polynomial divides the characteristic polynomial
- Cramer's rule
- Linearisation at an equilibrium
- Determinant of a matrix exponential
- Implicit function theorem
- Hyperbolic equilibrium point
- Spectral theorem for Hermitian matrices
- Inverse in terms of the adjugate
- Cayley–Hamilton theorem
- Cylindrical coordinates
- Polar decomposition
- Inverse function theorem
- Wronskian test for linear independence of solutions
- Classification of equilibria of planar linear systems
- Implicit function theorem for a surjective derivative
- Principal axis theorem
- Cayley–Hamilton theorem for linear maps
- Implicit differentiation
- Polar coordinates
- Spherical coordinates
- Variation of constants formula for linear systems
- Hartman–Grobman theorem
- Pendulum equation
- Stability of linear systems via eigenvalues
- Integration in polar coordinates
- Lagrange multipliers
- Sylvester's criterion
- Volume of a ball in R^3
- Diffeomorphism
- Decomposition into generalised eigenspaces
- Local homeomorphism from the inverse function theorem
- Morse–Smale system
- Spectral theorem for unbounded self-adjoint operators
- Proof of the Lagrange multiplier rule with one constraint
- Routh–Hurwitz theorem
- Proof of the principal axis theorem from the spectral theorem
- Hautus lemma
- Holomorphic inverse function theorem
- Proof of the implicit function theorem for a surjective derivative
- Proof of the singular value decomposition from the spectral theorem
- Proof of the implicit function theorem from the inverse function theorem
- Quantum Zeno effect
- Hilbert–Schmidt expansion theorem
- Duality of controllability and observability
- Markov partition
- Augmented Lagrangian method
- Minimal realization
- Proof of Cramer's rule by the adjugate
- Anharmonic oscillator
- Proof of Sylvester's criterion by induction and completing the square
- Proof of the Wronskian test for linear independence of solutions
- Volterra's principle
- Bilinear series of a symmetric kernel
- Choquet-Bruhat–Geroch theorem on maximal developments
- Proof of the Lagrange multiplier theorem by the implicit function theorem
- Spectral decomposition theorem
- Black hole stability problem
- Mason's gain formula
- Central polynomial
- Box–Muller transform
- Kaplansky's theorem on PI rings
- Proof that a matrix is invertible iff its determinant is a unit
- Uhlmann's theorem
- Kalman rank condition
- Marshallian demand function
- Proof that a C^1 map with invertible derivative is a local homeomorphism and an open map
- Nash–Moser theorem
- Spectral theorem for compact self-adjoint operators
- Courant–Fischer characterization of characteristic values
- Utility maximization problem
- Proof of the spectral theorem for self-adjoint operators by induction on the dimension
- Principle of material frame-indifference
- Detectability
- Mixed state
- Implicit function theorem in Banach spaces
- Melnikov method
- Strong cosmic censorship conjecture
- Euler's elastica
- Lyapunov–Schmidt reduction
- Purification of a quantum state
- Gleason's theorem
- Weak cosmic censorship conjecture
- Numerical continuation
- Proof of the inverse in terms of the adjugate
- Proof of the eigenvalue criteria for stability of linear systems via the Jordan normal form
- Inverted pendulum
- Stone's theorem on one-parameter unitary groups
- Closing lemma
- Sequential quadratic programming
- Kalman decomposition
- Anosov flow
- Lidskii's trace formula for integral operators
- Hamiltonian operator
- Second quantization
- Differential-algebraic system of equations
- Proof of the decomposition into generalised eigenspaces
- Smale's problems on dynamics
- Controllability Gramian
- Posner's theorem
- Controllable canonical form
- Spectrum of the Laplace–Beltrami operator
- Backus–Gilbert method
- Principal stresses
- Furuta pendulum
- Topological quantum field theory
- Smooth dynamical system
- Brunovsky normal form
- Wick rotation
- Eckart–Young theorem
- Balanced truncation
- Ackermann's formula
- Proof of the existence of an eigenvalue over an algebraically closed field
- Strang splitting
- Proof of the variation of constants formula for linear systems
- Zermelo's navigation problem
- Lie–Trotter product formula
- Routh–Hurwitz stability criterion
- Regular value theorem
- Inverse function theorem in Banach spaces
- Proof of the inverse function theorem by the contraction mapping principle
- Kharitonov's theorem
- Proof of the polar decomposition from the singular value decomposition
- Born rule
- Borel functional calculus
- Configuration space
- Schmidt decomposition
- Hyperbolic set
- Operator monotone function
- Proof of the spectral theorem for normal matrices by deflation
- Mercer's theorem
- Proof of the spectral theorem for Hermitian matrices
- Lagrange multipliers for constraints
- Proof that the minimal polynomial divides the characteristic polynomial
- Proof of triangularisation by induction on the size
- Anharmonic oscillator
- Proof of the volume of a ball in R^3 from the n-dimensional formula
- Generalized Lotka–Volterra equation
- Quantum computing
- Wave function collapse
- Principal component analysis
- Proof of the Cayley–Hamilton theorem for linear maps
- Axiom A
- Inertia tensor and principal axes
- Bidiagonalization
- Pole placement theorem
- Duffing equation
- Kapitza's pendulum
- Liénard–Chipart criterion
- Indirect utility function
- Schur product theorem
- Singular values of a compact operator
- Spherical pendulum
- Observable
- Slice theorem
- Schmidt's singular value decomposition of a kernel
- Proof that the determinant of a matrix exponential is the exponential of the trace
- Proof that the eigenvalues are the roots of the characteristic polynomial
- Van der Pol oscillator
- Polar decomposition of the deformation gradient
- Anosov diffeomorphism
- Spectral theorem for bounded normal operators
- Adjoint state method
- Stability conjecture
- Hidden-variable theory
- Channel capacity of a quantum channel
- Stabilizability
- Gain scheduling
- Proof of the Cayley–Hamilton theorem with the adjugate
- Amitsur–Levitzki theorem
- Time-optimal control
- Normal form
Further reading
- Web https://en.wikipedia.org/wiki/Adjugate_matrix, Important consequence
About this page
| Tag | Q47MWN8W57 |
|---|---|
| URI | m2://Q47MWN8W57 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 15A09, 15A15 |
| Proves | Product of a matrix and its adjugate |
| Uses | Adjugate matrix, Cofactor, Matrix multiplication, Laplace expansion along a row, Laplace expansion along a column, Determinant of a matrix with two equal rows, Determinant of a transpose, 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.