### Part (a)
1. **Define the function g:**
We need to show that for any function f:Q×Q→R, there exists a function g:Q→R such that f(x,y)≤g(x)+g(y) for all x,y∈Q.
2. **Construct g:**
Define g(x) as follows:
g(x)=y∈Qsup(f(x,y)−g(y))
This definition ensures that g(x) is the least upper bound of the set of values f(x,y)−g(y) for all y∈Q.
3. Verify the inequality:
For any x,y∈Q, we have:
f(x,y)≤g(x)+g(y)
By the definition of g(x), for any y∈Q:
f(x,y)−g(y)≤g(x)
Adding g(y) to both sides, we get:
f(x,y)≤g(x)+g(y)
Thus, the function g satisfies the required inequality.
### Part (b)
1. Identify the problem:
We need to find a function f:R×R→R such that there is no function g:Q→R satisfying f(x,y)≤g(x)+g(y) for all x,y∈R.
2. Construct the counterexample:
Consider the function f(x,y)=x+y. Suppose there exists a function g:Q→R such that:
f(x,y)≤g(x)+g(y)
for all x,y∈R.
3. Analyze the growth rate:
Fix x0∈R. Then for all y∈R, we have:
f(x0,y)=x0+y≤g(x0)+g(y)
As y→+∞, the right-hand side g(x0)+g(y) must grow at least as fast as x0+y. This implies that g(y) must grow at least linearly.
4. Contradiction:
Suppose g(y) grows linearly, i.e., g(y)=ay+b for some constants a and b. Then:
x0+y≤g(x0)+ay+b
This implies:
x0+y≤g(x0)+ay+b
For large y, this inequality cannot hold unless a≥1. However, if a=1, then g(y) grows exactly as fast as y, which contradicts the requirement that g must be defined on Q and not necessarily on R.
5. Conclusion:
Therefore, there is no function g:Q→R such that f(x,y)≤g(x)+g(y) for all x,y∈R.
■