Maths Olympiad Prep

Library / /39 of 39

Algebra Difficulty 7.7 National olympiad, round 2 Prove it Romania

Let n3n \ge 3 be an integer number. We say that a matrix AMn(C)A \in \mathcal{M}_n(\mathbb{C}) has the property (P)(\mathcal{P}) if det(A+Xij)=det(A+Xji)\det(A + X_{ij}) = \det(A + X_{ji}), for any i,j{1,2,,n}i, j \in \{1, 2, \dots, n\}, where XijMn(C)X_{ij} \in \mathcal{M}_n(\mathbb{C}) is the matrix with 11 at the position (i,j)(i, j) and 00 elsewhere.

a) Assume a matrix AMn(C)A \in \mathcal{M}_n(\mathbb{C}) with the property (P)(\mathcal{P}), such that det(A)0\det(A) \neq 0. Prove that A=ATA = A^T.

b) Give an example of a matrix AMn(C)A \in \mathcal{M}_n(\mathbb{C}) with the property (P)(\mathcal{P}), but AATA \neq A^T.

Solution

a) For given i,j{1,2,,n}i, j \in \{1, 2, \dots, n\}, by computing the expansion along the row ii, we obtain det(A+Xij)=det(A)+δij\det(A + X_{ij}) = \det(A) + \delta_{ij}, where δij\delta_{ij} is the (i,j)(i, j)-cofactor of the matrix AA. Since AA has the property (P)(\mathcal{P}), it results that δij=δji\delta_{ij} = \delta_{ji}, for any i,j{1,2,,n}i, j \in \{1, 2, \dots, n\}. Hence the adjugate matrix AA^* is symmetric. Let us denote d=det(A)0d = \det(A) \neq 0. We have AA=dIn=(dIn)T=(AA)T=AT(A)T=ATAAA^* = dI_n = (dI_n)^T = (A^*A)^T = A^T(A^*)^T = A^T A^*. Since d0d \neq 0 and ddet(A)=det(AA)=det(dIn)=dnd\det(A^*) = \det(AA^*) = \det(dI_n) = d^n, we deduce that AA^* is invertible. Therefore, from the relation AA=ATAAA^* = A^T A^*, we obtain A=ATA = A^T.

b) Consider the matrix A=(aij)1i,jnMn(C)A = (a_{ij})_{1 \le i,j \le n} \in \mathcal{M}_n(\mathbb{C}) with a11=a12=1a_{11} = a_{12} = 1 and aij=0a_{ij} = 0 elsewhere. Since n3n \ge 3, the matrix A+XijA + X_{ij} has at least one null row, so det(A+Xij)=0\det(A + X_{ij}) = 0, for any i,j{1,2,,n}i, j \in \{1, 2, \dots, n\}. Thus, AA has the property (P)(\mathcal{P}), but AATA \neq A^T.

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 and solution reproduced as published; topic and difficulty added by this site.