Cauchy's functional equation is . It looks like it should have one family of solutions, , and it does, as long as you add one more condition. That condition is the thing people forget, and it is the thing contest problems are built around.
What is true
Suppose satisfies for all real .
Without any other assumption you can prove that for every rational . That is all. On the reals there are other solutions, wild ones that are not of the form . They can only be constructed using the axiom of choice, and their graphs are dense in the plane. A contest will never ask you to build one, but it will make you prove that none exist under a stated condition, so you cannot skip the extra hypothesis.
Any one of these extra conditions is enough to force on all of :
- is continuous at a single point.
- is monotone, as in the archive's version of this problem.
- is bounded on some interval, however small.
- whenever . That is a monotone condition in disguise.
The rational part
Everything starts with the two obvious substitutions. Put to get . Put to get , so is odd. These are the usual moves from symmetry: swap the roles or cancel a pair.
Then, by induction on , for every positive integer and every real . Take : , so . Now , and by the previous step that is . With oddness this covers every rational. If , then for rational .
The step to the reals
Say is increasing. Then . For a real and a whole number , let , so that . Monotonicity gives
The width of the interval is . Let grow, and is trapped at .
To see this with numbers, take and . Use : , so . The true value is . Use and the interval has width .
Example: a non-negativity condition
Find all additive with for every .
If then , so is increasing. By the squeeze, with . Every such function works: and for .
Example: additive and multiplicative
Find all with and .
Put in the second condition: . Every non-negative real is a square, so for all . That is the previous example, so . Now the second condition at says . So or , and both functions satisfy both conditions.
Notice how the second condition did the work. Without the multiplicative condition you could not rule out a wild solution.
Example: Cauchy in disguise
Find all continuous with .
The extra term is what produces: . So set . Then
The function is additive and continuous, so , and .
Learn that move first. When the right side of a functional equation has Cauchy's shape plus an extra term, guess a polynomial that creates the extra term and subtract it.
Where it goes wrong
- Writing with no justification beyond "it is Cauchy." For real inputs, you need a stated condition, and you should say which one you are using.
- Proving the rational case and stopping. The step from to is half the solution.
- Assuming continuity because the answer is continuous. The problem has to give it, or you have to derive it. If the domain is or , you do not need it at all.
- Missing a condition that quietly gives monotonicity, such as or on a half-line.
- Forgetting to verify. After you find , plug it back into every condition in the problem. The constant is often forced to take only some values.
What to do with this
Before you start a functional equation, ask which form it takes after the easy substitutions. If you reach , list every condition in the problem and ask which of them gives regularity. If none does, the problem is probably over the rationals. The guide on starting a functional equation covers the substitutions that get you to this point. The symmetry technique page has the swap-and-cancel moves, and the problem archive has more functional equations to practise on.
Related guides
- EGMO 2019 Problem 1: solution, and the 1 that is really a sumA full solution to EGMO 2019 Problem 1: replace each lone 1 with ab+bc+ca, factor the differences, and finish with a sum of squares.
- How to start a functional equation problemA functional equation gives you no obvious first move. The substitutions to try first, how to guess the answer early, and the check people skip at the end.
- What to do when you have no idea how to startThe blank page is a procedure failure, not a knowledge failure. Five opening moves ordered by cost, and the rule that says when to abandon one for the next.
- How to read a hard problem without giving upMost hard problems are abandoned before they are ever attempted. Five things to do to a statement with a pen, and the rule that decides when to stop.
- When you can write WLOG, and when it breaks the proofWLOG is licensed by a symmetry, never by convenience. The one test that says which assumption you may make, and the cyclic trap that fails it.
Techniques in this guide
- SymmetryIf the problem doesn't care, neither should your answer.
Competitions this guide helps with
- AMC 825 multiple-choice questions · 40 minutes
Train it on Lemma
Every technique here is taught explicitly, in order. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your level