Olympiad Maths Prep

Track / Stage 8 / 62 of 180 #1762 of 2000

Problem 1762

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.2 Prove it

Let AA be a 3×33\times 3 real matrix such that the vectors AuAu and uu are orthogonal for
every column vector uR3u\in \mathbb{R}^{3}. Prove that:
a) AT=AA^{T}=-A.
b) there exists a vector vR3v \in \mathbb{R}^{3} such that Au=v×uAu=v\times u for every uR3u\in \mathbb{R}^{3},
where v×uv \times u denotes the vector product in R3\mathbb{R}^{3}.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

### Part (a)
1. Given: A A is a 3×3 3 \times 3 real matrix such that the vectors Au Au and u u are orthogonal for every column vector uR3 u \in \mathbb{R}^3 .
2. Orthogonality Condition: For any uR3 u \in \mathbb{R}^3 , we have:
Au,u=0 \langle Au, u \rangle = 0
where , \langle \cdot, \cdot \rangle denotes the dot product.
3. Matrix Representation: Let A=(aij) A = (a_{ij}) and u=(u1,u2,u3)T u = (u_1, u_2, u_3)^T .
4. Dot Product Expansion: The condition Au,u=0 \langle Au, u \rangle = 0 can be written as:
(Au)Tu=0 (Au)^T u = 0
Expanding this, we get:
uTATu=0 u^T A^T u = 0
5. Component Form: For any u=(u1,u2,u3)T u = (u_1, u_2, u_3)^T , this becomes:
i=13j=13aijuiuj=0 \sum_{i=1}^3 \sum_{j=1}^3 a_{ij} u_i u_j = 0
6. Choosing Basis Vectors: Let u u be the standard basis vectors ei e_i where ei e_i has 1 in the i i -th position and 0 elsewhere.
- For u=e1 u = e_1 , we get a11=0 a_{11} = 0 .
- For u=e2 u = e_2 , we get a22=0 a_{22} = 0 .
- For u=e3 u = e_3 , we get a33=0 a_{33} = 0 .
7. Off-Diagonal Elements: Consider u=ei+ej u = e_i + e_j for ij i \neq j :
- For u=e1+e2 u = e_1 + e_2 , we get:
a11+a12+a21+a22=0    a12+a21=0    a21=a12 a_{11} + a_{12} + a_{21} + a_{22} = 0 \implies a_{12} + a_{21} = 0 \implies a_{21} = -a_{12}
- Similarly, for other combinations, we get:
a13+a31=0    a31=a13 a_{13} + a_{31} = 0 \implies a_{31} = -a_{13}
a23+a32=0    a32=a23 a_{23} + a_{32} = 0 \implies a_{32} = -a_{23}
8. Conclusion: The matrix A A is skew-symmetric, i.e., AT=A A^T = -A .

\blacksquare

### Part (b)
1. Given: We need to show that there exists a vector vR3 v \in \mathbb{R}^3 such that Au=v×u Au = v \times u for every uR3 u \in \mathbb{R}^3 .
2. Skew-Symmetric Matrix Representation: From part (a), we know A A is skew-symmetric. Thus, A A can be written as:
A=(0a12a13a120a23a13a230) A = \begin{pmatrix} 0 & -a_{12} & -a_{13} \\ a_{12} & 0 & -a_{23} \\ a_{13} & a_{23} & 0 \end{pmatrix}
3. **Vector v v **: Define v v as:
v=(a23a13a12) v = \begin{pmatrix} -a_{23} \\ a_{13} \\ -a_{12} \end{pmatrix}
4. Cross Product: The cross product v×u v \times u for u=(u1,u2,u3)T u = (u_1, u_2, u_3)^T is:
v×u=(a23a13a12)×(u1u2u3)=(a13u3(a12)u2a23u1(a13)u3a12u2a23u1) v \times u = \begin{pmatrix} -a_{23} \\ a_{13} \\ -a_{12} \end{pmatrix} \times \begin{pmatrix} u_1 \\ u_2 \\ u_3 \end{pmatrix} = \begin{pmatrix} a_{13} u_3 - (-a_{12}) u_2 \\ -a_{23} u_1 - (-a_{13}) u_3 \\ -a_{12} u_2 - a_{23} u_1 \end{pmatrix}
Simplifying, we get:
v×u=(a13u3+a12u2a23u1+a13u3a12u1a23u2) v \times u = \begin{pmatrix} a_{13} u_3 + a_{12} u_2 \\ -a_{23} u_1 + a_{13} u_3 \\ -a_{12} u_1 - a_{23} u_2 \end{pmatrix}
5. Matrix-Vector Multiplication: Now, compute Au Au :
Au=(0a12a13a120a23a13a230)(u1u2u3)=(a12u2a13u3a12u1a23u3a13u1+a23u2) Au = \begin{pmatrix} 0 & -a_{12} & -a_{13} \\ a_{12} & 0 & -a_{23} \\ a_{13} & a_{23} & 0 \end{pmatrix} \begin{pmatrix} u_1 \\ u_2 \\ u_3 \end{pmatrix} = \begin{pmatrix} -a_{12} u_2 - a_{13} u_3 \\ a_{12} u_1 - a_{23} u_3 \\ a_{13} u_1 + a_{23} u_2 \end{pmatrix}
6. Comparison: Comparing the components of Au Au and v×u v \times u , we see that:
Au=v×u Au = v \times u
Thus, the vector v v defined as v=(a23,a13,a12)T v = (-a_{23}, a_{13}, -a_{12})^T satisfies the required condition.

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.