Maths Olympiad Prep

Library / /132 of 264

Algebra Difficulty 5.7 AIME, harder Prove it Romania

Call a row of a matrix in Mn(C)M_n(\mathbb{C}) permutable if, for any permutation of its entries, the value of the determinant does not change. Prove that any matrix that has two permutable rows is singular.

Solution

Consider AMn(C)A \in M_n(\mathbb{C}) such that row ll is permutable. Denote by Γli\Gamma_{li} the algebraic complement of alia_{li}, i=1,,ni = 1, \dots, n. Suppose i,j,k,p{1,2,,n}i, j, k, p \in \{1, 2, \dots, n\} are such that alialja_{li} \neq a_{lj} and ΓlkΓlp\Gamma_{lk} \neq \Gamma_{lp}. Consider matrices BB and CC obtained from AA by permuting elements in row ll, such that BB contains alia_{li} in place (l,k)(l, k) and element alja_{lj} in place (l,p)(l, p) and, matrix CC contains alja_{lj} in place (l,k)(l, k) and alia_{li} in place (l,p)(l, p); the two matrices having in the other positions the initial elements.

Developing determinants along row ll, we get det(B)det(C)=(alialj)(ΓlkΓlp)0\det(B) - \det(C) = (a_{li} - a_{lj})(\Gamma_{lk} - \Gamma_{lp}) \neq 0, in contradiction with the hypothesis.

We deduce that row ll of AA is permutable if and only if all its elements are equal or, if all algebraic complements of elements in line ll are equal.

Consider now a matrix AA that admits two permutable rows. Then:

* if both rows are constant det(A)=0\det(A) = 0;
* if both rows have constant algebraic complements then AA^* has two constant rows; that is det(A)=0\det(A^*) = 0, which implies det(A)=0\det(A) = 0;
* if one row has all elements equal to aa, and another row has all algebraic complements equal to bb, then from AA=det(A)InAA^* = \det(A)I_n we deduce ab=0ab = 0, so a=0a = 0 or b=0b = 0.

Thus, in every case, det(A)=0\det(A) = 0.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.