Two similar functional inequalities
(This is Glen.)
I was sorting through my stuff and found a piece of paper from when I tried last year's NTST problems, which I presumably saved because I thought I might eventually want to write a post about it. So here I am, writing a post so I can safely dump this piece of paper into my recycling bin.
One functional inequality
Here's the relevant problem:
(ISL 2023 A4) Let be the set of positive real numbers. Determine all functions such that for every .
This was NTST 2024 Day 1 Q2, by the way.
To avoid spoilers, I'm going to put a very crudely censored version of my working, and then reveal each bit one by one, in the order that I think I wrote everything in. Here we go:
Anyway, let's begin.
Rectangle #1
Here, I tried some simple substitutions. These were generally motivated by the aim to make things cancel:- Substituting lets the and terms cancel, which gives the nice-looking . That looked useful, so I boxed it.
- Substituting produces a on the LHS, which we now know is . Unfortunately, this just gives us , which we already know.
- Substituting makes the two things in the brackets equal, so they cancel (it's nice not having to worry about cancelling zeroes), but again this gives something we already know.
- Replacing with makes the stuff in the LHS bracket look like the stuff in the RHS bracket, so we can chain inequalities. However, this gives something that doesn't look very nice.
Rectangle #3
It seemed that just plain substitutions weren't going to get me something useful, so I decided to try something else. Notice that the LHS of the functional inequality is almost symmetric, so we can swap with and getting something similar. Adding this to the original inequality gives the thing on the top, and after cancellation, we get...something which is implied by .
Rectangle #4
Not entirely sure why I wrote this but I probably wanted to try something that I realised wouldn't work. Or maybe I was sending condolences to myself.
Rectangle #5
At this point, I realised that I didn't actually know what the solution set was, so I decided to guess what could be. is a very common solution for problems, and it worked for this. I then tried , where , and that worked as well. That seemed like a reasonable family of solutions, so I figured that could likely be the answer.Knowing this was incredibly useful and I really should have done it earlier: if you have a guess of what the solution set could look like, that can give you some intuition about what to try. For example, because isn't defined at , we may rule out continuity tricks that involve extending the domain of to .
On the other hand, if we wanted to show that for some , that would be equivalent to showing that is constant, which does look like something that can be done from our expressions...
Rectangles #6 and #7
Conveniently, the problem statement has both an and a . We want them to be equal, so let's move them to the same side. Now, if , then this tells us something new: that . Progress!
Rectangle #8
Oops, this deduction is wrong. What is true is something slightly weaker: for each , if isn't the maximum value (so there's some such that ), then .
I tried to derive a contradiction from something along these lines, but couldn't think of anything that worked.
Rectangle #9
I realised that there was a way to get (which is for some if isn't constant) on the smaller side of the inequality. This is a substitution that I did back in Rectangle #1 and forgot about, and gives that .
But hold on: we can replace with , and then we have . What does this mean?
Rectangle #10
If we tried to plot on a number line (mine goes from bottom to top instead of from left to right), what would they look like? Well, would be some distance below . Then, would be some distance below , and this distance is at least the distance between and . Proceeding similarly, each term is at least below the previous one, and hence we eventually go below , contradiction! (The is how people write the contradiction symbol in the UK. It's easier to write than , so I use that now.)
Summary
I've written quite a bit, but if you think about it, there wasn't very much to the solution. These were the main steps involved:
- Try some simple substitutions, in particlar, and .
- Suppose that isn't in our guessed solution set and obtain some (strict) inequality.
- Visualise what this means, and observe a contradiction.
All in all, this reminded me very strongly of a certain other recent functional inequality...
Another functional inequality
(IMO 2022/2) Let denote the set of positive real numbers. Find all functions such that for each , there is exactly one satisfying
There are some superficial similarities to the other problem: both are functional inequalities with . But as it turns out, the solution for this also goes along similar lines. (More accurately, I remember having a solution that proceeded along similar lines. I had to solve this again in order to write this post and it might have been a self-fulfilling prophecy that I found something that fits to the framework above.) If you haven't done this problem before, you might want to try it out before reading my solution below.
Step 0: Guess the solution set
Earlier, I made the mistake of running into the problem blindly without any idea what the solution set could be. That's not very advisable. Let's try to do things right this time. Anyway, the usual guess of fails, but works by AM-GM (and in this case, the unique is just ). Variations of this end up not working, and so we might hypothesise that this is the only solution.
Step 1: Simple substitutions observations
Well, we can't exactly substitute stuff, because we don't have an (in)equality to work with. However, we can make some observations. For example, notice that the symmetry of means that if is the unique value for , then must play the corresponding role for . In other words, every is either paired with itself (so ), or must be paired (monogamously) with some other .
Step 2: Obtain a strict inequality
In our (proposed) solution set, every is paired with itself. What if some didn't satisfy this? Then , and its partner must also satisfy . Great, that means that , which rearranges to That seems useful. WLOG , then , but now , contradiction.
(Edit: I just had a look at AoPS and this step can be done faster: just note that by AM-GM.)
In other words, for each .
Step 2, again
Let's be more ambitious: suppose that there's some solution that isn't , then we must have , a strict inequality. Can we try to abuse this?
Step 3: Visualise
Intuitively, because is now "too small", there is probably some other such that . Let's try to force this to happen. Note that for each . Let's graph the two things on the right as varies:
By AM-GM, the top graph has a minimum point of . Since the other graph sits beneath it, it has to go below the value .
But hold on: this means that this graph is below for a whole range of , so there's some that's near for which , contradiction.
(What we are really using is the fact that is continuous in : to make this rigorous, we'd have to apply the definition of continuity to . Alternatively, we could avoid quoting continuity with the "bare hands" approach of putting in and showing algebraically that the expression is for small . Again, see Pengchong's post.)
Conclusion
Maybe the link between the two problems is more tenuous than it is in my head, but they just feel similar. But I do believe that my experience of solving IMO 2022/2 did, however subconsciously, guide me towards a solution of the NTST problem. This is, I guess, what happens to your brain after you've done enough Olympiad problems: problems start reminding you of other problems. Once in a while, this might lead you astray (see: IMO 2024/5 and overtraining), but most of the time (see: various posts in this blog, e.g. this, this, this or this) it turns out to be very helpful.
Comments
Post a Comment