uniolympiads Ελληνικά

IMC 1995, Day 1, Problem 1

Let XX be a nonsingular matrix with columns X1,X2,…,XnX_1, X_2, \dots, X_n. Let YY be a matrix with columns X2,X3,…,Xn,0X_2, X_3, \dots, X_n, 0. Show that the matrices A=YX−1A = YX^{-1} and B=X−1YB = X^{-1}Y have rank n−1n - 1 and have only 00's for eigenvalues.

Original from the official PDFLet X be a nonsingular matrix with columns X 1 , X 2 , . . . , X n . Let Y be a matrix with columns X 2 , X 3 , . . . , X n , 0. Show that the matrices A = Y X −1 and B = X −1 Y have rank n − 1 and have only 0’s for eigenvalues.

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. Let J=(aij)J=(a_{ij}) be the n×nn\times n matrix where aij=1a_{ij}=1 if i=j+1i=j+1 and aij=0a_{ij}=0 otherwise. The rank of JJ is n−1n-1 and its only eigenvalues are 0′0's. Moreover Y=XJY=XJ and A=YX−1=XJX−1A=YX^{-1}=XJX^{-1}, B=X−1Y=JB=X^{-1}Y=J. It follows that both AA and BB have rank n−1n-1 with only 0′0's for eigenvalues.

Transcribed from the official solutions, page 2. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?