Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof that the determinant of a transpose equals the determinant

Builds on Leibniz formula for determinantsTransposeSign is a homomorphismPermutation

Proof

  1. Let A=(aij)A = (a_{ij}). By the definition of the transpose, (AT)ij=aji(A^T)_{ij} = a_{ji}.
  2. By the Leibniz formula applied to ATA^T, det⁡AT=∑σ∈Snsgn⁡(σ)∏i=1naσ(i),i\det A^T = \sum_{\sigma \in S_n} \sgn(\sigma) \prod_{i=1}^{n} a_{\sigma(i), i}.
  3. Fix σ\sigma. As ii runs over 1,…,n1, \dots, n, the index k=σ(i)k = \sigma(i) also runs over 1,…,n1, \dots, n, and i=σ−1(k)i = \sigma^{-1}(k).
  4. Since KK is commutative, we may reorder the product. So ∏i=1naσ(i),i=∏k=1nak,σ−1(k)\prod_{i=1}^{n} a_{\sigma(i), i} = \prod_{k=1}^{n} a_{k, \sigma^{-1}(k)}.
  5. If n≥2n \ge 2, the sign is a homomorphism. So sgn⁡(σ)sgn⁡(σ−1)=sgn⁡(σσ−1)=1\sgn(\sigma)\sgn(\sigma^{-1}) = \sgn(\sigma \sigma^{-1}) = 1.
  6. Both signs lie in {1,−1}\set{1, -1}, so step 5 gives sgn⁡(σ−1)=sgn⁡(σ)\sgn(\sigma^{-1}) = \sgn(\sigma). If n=1n = 1, then σ\sigma is the identity and this is clear.
  7. By steps 2, 4 and 6, det⁡AT=∑σ∈Snsgn⁡(σ−1)∏k=1nak,σ−1(k)\det A^T = \sum_{\sigma \in S_n} \sgn(\sigma^{-1}) \prod_{k=1}^{n} a_{k, \sigma^{-1}(k)}.
  8. The map σ↦σ−1\sigma \mapsto \sigma^{-1} is a bijection of the symmetric group SnS_n onto itself. So we may write ρ=σ−1\rho = \sigma^{-1} and sum over ρ∈Sn\rho \in S_n.
  9. This gives det⁡AT=∑ρ∈Snsgn⁡(ρ)∏k=1nak,ρ(k)=det⁡A\det A^T = \sum_{\rho \in S_n} \sgn(\rho) \prod_{k=1}^{n} a_{k, \rho(k)} = \det A, by the Leibniz formula for AA.

Idea

The term of a permutation σ\sigma for ATA^T uses the same entries as the term of σ−1\sigma^{-1} for AA. A permutation and its inverse have the same sign, so the two Leibniz sums have the same terms in a different order.

Reading path

To understand this page from the ground up, read these 104 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.

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

Where this leads

198 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Determinant_of_Transpose
About this page
TagCC5G952B5J
URIm2://CC5G952B5J
Kindproof
WritingW0 stub
MSC15A15
ProvesDeterminant of a transpose
UsesLeibniz formula for determinants, Transpose, Sign is a homomorphism, Permutation
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)
  • a source with a locator (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.