1
$\begingroup$

Prove that if $A$ has linearly dependent rows or columns then $\det(A)=0$.

$$\DeclareMathOperator{\sgn}{sgn} \det(A)=\sum_{\sigma\in s_n}\Bigl(\sgn(\sigma)\prod_{i=1}^{n}a_{i,\sigma(i)}\Bigr)=\sum_{\sigma\in s_n\text{ even}}\Bigl(\sgn(\sigma)\prod_{i=1}^{n}a_{i,\sigma(i)}\Bigr)-\sum_{\sigma\in s_n\text{ odd}}\Bigl(\sgn(\sigma)\prod_{i=1}^{n}a_{i,\sigma(i)}\Bigr)$$

How to continue from here using Leibniz formula?

$\endgroup$
5
  • 2
    $\begingroup$ It is easier to use properties of the determinants, for example the linearity. $\endgroup$ – Peter May 22 '18 at 16:16
  • $\begingroup$ @Peter I know, edited that question $\endgroup$ – newhere May 22 '18 at 16:18
  • 1
    $\begingroup$ @newhere: you can remove the $sgn(\sigma)$ in your last equation as you distinghuised between even and odd permutations (just a remark) $\endgroup$ – Student May 22 '18 at 16:19
  • $\begingroup$ Note that you haven't even assumed linear dependence in your calculations so far. Seems like that's where you should start. $\endgroup$ – saulspatz May 22 '18 at 16:22
  • $\begingroup$ @saulspatz of course but I did not manage to see how to continue from there $\endgroup$ – newhere May 22 '18 at 16:31
2
$\begingroup$

By linearity, your statement is equivalent to prove that determinant is zero whenever two columns/rows are the same. I'll work with columns (transpose for rows). So by definition : $$ \det(A) = \sum_{\sigma\in S_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i}$$ Suppose that there are some $i\neq j$ such that the $i$-th and the $j$-th columns are the same.
Denote $\tau$ the transposition of the pair $(i,j)$ and let $\sigma$ be a permutation of numbers $1,\ldots, n$.
Then $\sigma\mapsto \sigma\circ \tau$ is a bijection between $A_n$ and $S_n\setminus A_n$, where $A_n$ denotes the alterning group of even permutations, but $S_n$ is the disjoint union of $A_n$ and $S_n\setminus A_n$ so $$ \det(A) = \sum_{\sigma\in A_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i} + \sum_{\sigma\in S_n\setminus A_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i}$$ Now, using the bijection between $A_n$ and $S_n\setminus A_n$ we get $$ \det(A) = \sum_{\sigma\in A_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i} + \sum_{\sigma\in A_n} \mathrm{sgn}(\sigma\circ \tau)\prod_{i=1}^n A_{\sigma(\tau(i))i}$$ However $\mathrm{sgn}(\sigma\circ \tau) = \mathrm{sgn}(\sigma)\cdot \mathrm{sgn}(\tau) = -\mathrm{sgn}(\sigma) $ and for a given permutation $\sigma$ $$\prod_{i=1}^n A_{\sigma(\tau(i))i} =\prod_{i=1}^n A_{\sigma(i)i}$$ Finally you obtain the following... $$ \det(A) = \sum_{\sigma\in A_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i} -\sum_{\sigma\in A_n} \mathrm{sgn}(\sigma)\prod_{i=1}^n A_{\sigma(i)i} = 0$$

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.