I have written this proof stating that if two rows or columns of a matrix are the same, then the determinant of the matrix is equal to 0. Is it correct?
Let us say we have an n x n matrix A, shown below:
For some $i,n \in \mathbb{N}$.
If we say that $r_{i} = [a_{i1}, a_{i2}, a_{i3} … a_{in}]$, a row vector, then we can rewrite the matrix A as:
If we then also create the swapped $S_{ij}$ matrix, i.e. swap rows $i$ and $j$ around, we have the matrix:
We know that if we swap two rows of a determinant, in this case rows $i$ and $j$, then the determinant will simply be the negative of the original determinant.We can say that the det(A) = -det(S). But, if these two rows are identical, then det(S) = det(A), so this means that det(A) = -det(A), so A must be equal to $0$.
Best Answer
That seems to be correct. Another way to think about this is to consider what happens when there are two identical columns/rows. Then, the number of linearly independent columns/rows is less than $n$ for a given $n \times n$ matrix. Hence, the matrix does not have maximal rank so the determinant has to be 0.
Of course, I'm working off of the idea that you've defined the determinant as the unique map $det: M(n \times n, \mathbb{F}) \to \mathbb{F}$ such that:
$det$ is linear in each row.
If $rank(A) < n$, then $det(A) = 0$.
$det(E_n) = 1$.
If you're not working off of these assumptions, that's fine. What you have written is fine too.