Proof that $\det(A)=\det(A^T)$ using permutations.

Question

I'm reading a proof for the identity $\det(A) = \det(A^T)$ and I'm trying to udnerstand why the following rows are equivalent:

$$\eqalign{ & \det ({A}) = \sum\limits_{\pi \in {S_n}} {{\mathop{\rm sgn}} (\pi ) \cdot {a_{\pi (1),1}}} ...{a_{\pi (n),n}} \cr & \det ({A^T}) = \sum\limits_{\pi \in {S_n}} {{\mathop{\rm sgn}} ({\pi ^{ - 1}}) \cdot {a_{1,{\pi ^{ - 1}}(1)}}} ...{a_{n,{\pi ^{ - 1}}(n)}} \cr} $$

Intuitively, I can understand that each term appears in both of the summations.
How to understand it algebraically?

Answer 1

$f : \sigma \in S_n \rightarrow f(\sigma) =\sigma^{-1} \in S_n$ is a bijection (you can trivially check it is its own inverse), and this is a general fact that for a finite sum $\sum_{i \in A}u_i = \sum_{j \in B}u_{f(j)}$ if $f$ is a bijection from $B$ to $A$ (actually it also works for some infinite sums, such as sums with only positive terms).

As you said, it just states that in both sums each term appears exactly once and since addition is commutative, order doesn't matter.

Answer 2

$\pi \in S_n \Rightarrow \pi^{-1} \in S_n$ and vice versa, so your (finite!) sums are equal.