uniolympiads Ελληνικά

IMC 1998, Day 2, Problem 1

Let VV be a real vector space, and let f,f1,f2,…,fkf, f_1, f_2, \dots, f_k be linear maps from VV to R\mathbb{R}. Suppose that f(x)=0f(x) = 0 whenever f1(x)=f2(x)=⋯=fk(x)=0f_1(x) = f_2(x) = \dots = f_k(x) = 0. Prove that ff is a linear combination of f1,f2,…,fkf_1, f_2, \dots, f_k.

Original from the official PDF(20 points) Let V be a real vector space, and let f, f 1 , f 2 , . . . , f k be linear maps from V to IR. Suppose that f (x) = 0 whenever f 1 (x) = f 2 (x) = . . . = f k (x) = 0. Prove that f is a linear combination of f 1 , f 2 , ..., f k .

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. We use induction on kk. By passing to a subset, we may assume that f1,…,fkf_1, \ldots, f_k are linearly independent.

Since fkf_k is independent of f1,…,fk−1f_1, \ldots, f_{k-1}, by induction there exists a vector ak∈Va_k \in V such that f1(ak)=…=fk−1(ak)=0f_1(a_k) = \ldots = f_{k-1}(a_k) = 0 and fk(ak)≠0f_k(a_k) \ne 0. After normalising, we may assume that fk(ak)=1f_k(a_k) = 1. The vectors a1,…,ak−1a_1, \ldots, a_{k-1} are defined similarly to get

fi(aj)={1if i=j0if i≠j.f_i(a_j) = \begin{cases} 1 & \text{if } i = j \\ 0 & \text{if } i \ne j. \end{cases}

For an arbitrary x∈Vx \in V and 1≤i≤k1 \le i \le k, fi(x−f1(x)a1−f2(x)a2−⋯−fk(x)ak)=fi(x)−∑j=1kfj(x)fi(aj)=fi(x)−fi(x)fi(ai)=0f_i(x - f_1(x)a_1 - f_2(x)a_2 - \cdots - f_k(x)a_k) = f_i(x) - \sum_{j=1}^k f_j(x)f_i(a_j) = f_i(x) - f_i(x)f_i(a_i) = 0, thus f(x−f1(x)a1−⋯−fk(x)ak)=0f(x - f_1(x)a_1 - \cdots - f_k(x)a_k) = 0. By the linearity of ff this implies f(x)=f1(x)f(a1)+⋯+fk(x)f(ak)f(x) = f_1(x)f(a_1) + \cdots + f_k(x)f(a_k), which gives f(x)f(x) as a linear combination of f1(x),…,fk(x)f_1(x), \ldots, f_k(x).

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