uniolympiads Ελληνικά

IMC 1995, Day 2, Problem 1

Let AA be 3×33 \times 3 real matrix such that the vectors AuAu and uu are orthogonal for each column vector u∈R3u \in \mathbb{R}^3. Prove that:

a) A⊤=−AA^\top = -A, where A⊤A^\top denotes the transpose of the matrix AA;

b) there exists a vector v∈R3v \in \mathbb{R}^3 such that Au=v×uAu = v \times u for every u∈R3u \in \mathbb{R}^3, where v×uv \times u denotes the vector product in R3\mathbb{R}^3.

Original from the official PDFLet A be 3 × 3 real matrix such that the vectors Au and u are orthogonal for each column vector u ∈ R 3 . Prove that: a) A > = −A, where A > denotes the transpose of the matrix A; b) there exists a vector v ∈ R 3 such that Au = v × u for every u ∈ R 3 , where v × u denotes the vector product in R 3 .

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. a) Set A=(aij)A=(a_{ij}), u=(u1,u2,u3)⊤u=(u_1,u_2,u_3)^\top. If we use the orthogonality condition

(Au,u)=0(1)(Au,u)=0\tag{1}
with ui=δiku_i=\delta_{ik} we get akk=0a_{kk}=0. If we use (1) with ui=δik+δimu_i=\delta_{ik}+\delta_{im} we get
akk+akm+amk+amm=0a_{kk}+a_{km}+a_{mk}+a_{mm}=0
and hence akm=−amka_{km}=-a_{mk}.

b) Set v1=−a23v_1=-a_{23}, v2=a13v_2=a_{13}, v3=−a12v_3=-a_{12}. Then

Au=(v2u3−v3u2,v3u1−v1u3,v1u2−v2u1)⊤=v×u.Au=(v_2u_3-v_3u_2,v_3u_1-v_1u_3,v_1u_2-v_2u_1)^\top=v\times u.

Transcribed from the official solutions, page 6. 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?