Maths Olympiad Prep

Library / /254 of 520

Combinatorics Difficulty 6.9 National olympiad Find the answer

a) Show that for each function f:Q×QRf:\mathbb{Q} \times \mathbb{Q} \rightarrow \mathbb{R}, there exists a function g:QRg:\mathbb{Q}\rightarrow \mathbb{R} with f(x,y)g(x)+g(y)f(x,y) \leq g(x)+g(y) for all x,yQx,y\in \mathbb{Q}.
b) Find a function f:R×RRf:\mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R}, for which there is no function g:QRg:\mathbb{Q}\rightarrow \mathbb{R} such that f(x,y)g(x)+g(y)f(x,y) \leq g(x)+g(y) for all x,yRx,y\in \mathbb{R}.

Solution

### Part (a)

1. **Define the function g g :**
We need to show that for any function f:Q×QR f: \mathbb{Q} \times \mathbb{Q} \rightarrow \mathbb{R} , there exists a function g:QR g: \mathbb{Q} \rightarrow \mathbb{R} such that f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y) for all x,yQ x, y \in \mathbb{Q} .

2. **Construct g g :**
Define g(x) g(x) as follows:
g(x)=supyQ(f(x,y)g(y)) g(x) = \sup_{y \in \mathbb{Q}} \left( f(x, y) - g(y) \right)
This definition ensures that g(x) g(x) is the least upper bound of the set of values f(x,y)g(y) f(x, y) - g(y) for all yQ y \in \mathbb{Q} .

3. Verify the inequality:
For any x,yQ x, y \in \mathbb{Q} , we have:
f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y)
By the definition of g(x) g(x) , for any yQ y \in \mathbb{Q} :
f(x,y)g(y)g(x) f(x, y) - g(y) \leq g(x)
Adding g(y) g(y) to both sides, we get:
f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y)
Thus, the function g g satisfies the required inequality.

### Part (b)

1. Identify the problem:
We need to find a function f:R×RR f: \mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R} such that there is no function g:QR g: \mathbb{Q} \rightarrow \mathbb{R} satisfying f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y) for all x,yR x, y \in \mathbb{R} .

2. Construct the counterexample:
Consider the function f(x,y)=x+y f(x, y) = x + y . Suppose there exists a function g:QR g: \mathbb{Q} \rightarrow \mathbb{R} such that:
f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y)
for all x,yR x, y \in \mathbb{R} .

3. Analyze the growth rate:
Fix x0R x_0 \in \mathbb{R} . Then for all yR y \in \mathbb{R} , we have:
f(x0,y)=x0+yg(x0)+g(y) f(x_0, y) = x_0 + y \leq g(x_0) + g(y)
As y+ y \to +\infty , the right-hand side g(x0)+g(y) g(x_0) + g(y) must grow at least as fast as x0+y x_0 + y . This implies that g(y) g(y) must grow at least linearly.

4. Contradiction:
Suppose g(y) g(y) grows linearly, i.e., g(y)=ay+b g(y) = ay + b for some constants a a and b b . Then:
x0+yg(x0)+ay+b x_0 + y \leq g(x_0) + ay + b
This implies:
x0+yg(x0)+ay+b x_0 + y \leq g(x_0) + ay + b
For large y y , this inequality cannot hold unless a1 a \geq 1 . However, if a=1 a = 1 , then g(y) g(y) grows exactly as fast as y y , which contradicts the requirement that g g must be defined on Q \mathbb{Q} and not necessarily on R \mathbb{R} .

5. Conclusion:
Therefore, there is no function g:QR g: \mathbb{Q} \rightarrow \mathbb{R} such that f(x,y)g(x)+g(y) f(x, y) \leq g(x) + g(y) for all x,yR x, y \in \mathbb{R} .

\blacksquare

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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