uniolympiads Ελληνικά

IMC 1994, Day 1, Problem 4

Let α∈R∖{0}\alpha \in \mathbb{R} \setminus \{0\} and suppose that FF and GG are linear maps (operators) from Rn\mathbb{R}^n into Rn\mathbb{R}^n satisfying F∘G−G∘F=αFF \circ G - G \circ F = \alpha F.

a) Show that for all k∈Nk \in \mathbb{N} one has Fk∘G−G∘Fk=αkFkF^k \circ G - G \circ F^k = \alpha k F^k.

b) Show that there exists k≥1k \ge 1 such that Fk=0F^k = 0.

Original from the official PDF(18 points) Let α ∈ R \ {0} and suppose that F and G are linear maps (operators) from R n into R n satisfying F ◦ G − G ◦ F = αF . a) Show that for all k ∈ N one has F k ◦ G − G ◦ F k = αkF k . b) Show that there exists k ≥ 1 such that F k = 0. 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. For a) using the assumptions we have

Fk∘G−G∘Fk=∑i=1k(Fk−i+1∘G∘Fi−1−Fk−i∘G∘Fi)==∑i=1kFk−i∘(F∘G−G∘F)∘Fi−1==∑i=1kFk−i∘αF∘Fi−1=αkFk.\begin{aligned}F^k\circ G-G\circ F^k&=\sum_{i=1}^k\left(F^{k-i+1}\circ G\circ F^{i-1}-F^{k-i}\circ G\circ F^i\right)=\\ &=\sum_{i=1}^kF^{k-i}\circ(F\circ G-G\circ F)\circ F^{i-1}=\\ &=\sum_{i=1}^kF^{k-i}\circ\alpha F\circ F^{i-1}=\alpha kF^k.\end{aligned}

b) Consider the linear operator L(F)=F∘G−G∘FL(F)=F\circ G-G\circ F acting over all n×nn\times n matrices FF. It may have at most n2n^2 different eigenvalues. Assuming that Fk≠0F^k\ne 0 for every kk we get that LL has infinitely many different eigenvalues αk\alpha k in view of a) – a contradiction.

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