Functional equations
Special values, injectivity and surjectivity, Cauchy's equation , and why every candidate solution must be checked.
The order that works
- Special values: , , , , . Write down whatever comes out, even if it does not look useful.
- Injectivity / surjectivity. If implies , you can "cancel" from both sides. If the right-hand side covers all of as varies, is surjective.
- Guess the solution (usually , , a constant) and try to show there is no other.
- Check every solution in the original equation.
Cauchy's equation
If for all , then by induction , so for every . To pass to you need one of the following:
- is continuous at one point;
- is monotone;
- is bounded on some interval.
Then . The same idea handles the related equations: with becomes Cauchy for , and on becomes Cauchy for .
Pitfalls
- Without some regularity, Cauchy's equation has "pathological" solutions (via a Hamel basis, using the axiom of choice). If the statement does not give continuity or monotonicity, try to derive it from the equation itself. E.g. if , then on .
- "For every , or " does not mean " for every or for every ". The choice may change from point to point; you need a further argument to rule that out.
- Verification: a solution found from necessary conditions may fail the equation. Without verification the solution is incomplete, and the grader deducts for it.
Further reading
- Gelca & Andreescu, Putnam and Beyond, §3.4.1 (Functional Equations)
Contest problems using these tools
No problems with these tools yet.