All statement implies from formula detA=∑(−1)∣i1,i2,…,in∣ai1!ai2,2…ain,n .
1) if we substitute aikk by taikk , (row is multiplied by t ) then we can bring t out of sum, and we are done.
2) as any transposition changes sign of permutation, then ∣i1,i2,…,in∣ will be changed from odd to even and vice versa in every summand, so sign of det A will be opposite.
3) if one of rows is equal to another one, then their permutation change sign of det A, and in general det A will be the same. It can be iff det A=0 . So, if we have
∑(−1)∣i1,i2,…,in∣ai1!ai2,2…(aikk+tail!)…ainn=∑(−1)∣i1,i2,…,in∣ai1!ai2,2…(aikk)…ainn+t∑(−1)∣i1,i2,…,in∣ai1!ai2,2…(aill)…ainn then in first summand all i's are distinct, and in second 1 is being used twice, so second summand is zero.
Comments