Proof that det(AB)=det(A)det(B) for n×n matrices A,B
We use the Leibniz formula for the determinant of an n×n matrix M=(mij):
det(M)=σ∈Sn∑sgn(σ)i=1∏nmi,σ(i),
where Sn is the set of all permutations of {1,…,n} and sgn(σ)∈{+1,−1} is the sign of σ.
Let C=AB, so cij=∑k=1naikbkj. Then,
det(C)=τ∈Sn∑sgn(τ)i=1∏nci,τ(i)=τ∈Sn∑sgn(τ)i=1∏n(ki=1∑naikibkiτ(i)).
Expanding the product of sums gives
det(C)=τ∈Sn∑k1=1∑n⋯kn=1∑nsgn(τ)i=1∏naiki⋅i=1∏nbkiτ(i).
Rearranging the sums,
det(C)=k1,…,kn=1∑n(i=1∏naiki)[τ∈Sn∑sgn(τ)i=1∏nbkiτ(i)].
For fixed (k1,…,kn), define the matrix R=(rij) by rij=bkij (i.e., row i of R is row ki of B). The inner sum is then exactly det(R):
τ∈Sn∑sgn(τ)i=1∏nriτ(i)=det(R).
Thus,
det(C)=k1,…,kn=1∑n(i=1∏naiki)det(R),
where R depends on (k1,…,kn).
Key observation: det(R)=0 unless (k1,…,kn) is a permutation of {1,…,n}. Indeed:
- If any kp=kq for p=q, then rows p and q of R are identical, so det(R)=0 (determinants vanish on matrices with repeated rows).
- Thus, nonzero terms occur only when i↦ki is a bijection, i.e., there exists ρ∈Sn with ki=ρ(i) for all i.
For such a ρ, R is B with rows permuted by ρ (row i of R is row ρ(i) of B). Permuting the rows of a matrix by ρ multiplies the determinant by sgn(ρ):
det(R)=sgn(ρ)det(B).
Moreover,
i=1∏naiki=i=1∏naiρ(i).
Summing only over these permutations ρ∈Sn,
det(C)=ρ∈Sn∑(i=1∏naiρ(i))⋅sgn(ρ)det(B)=det(B)ρ∈Sn∑sgn(ρ)i=1∏naiρ(i)=det(B)⋅det(A).
Thus, det(AB)=det(A)det(B).
Notes
- This holds over any commutative ring (e.g., R, C).
- By induction on the number of factors, it extends to det(A1⋯Ak)=det(A1)⋯det(Ak).
- Base case n=1: Trivial, as det([ab])=ab=det([a])det([b]).
This proof relies only on the Leibniz formula and basic properties of permutations/row operations.