Quant Memo
Advanced

Functional Equations

Puzzles that describe a function only through a rule it obeys — like f(x+y) = f(x) + f(y) — solved by plugging in clever special values rather than by algebra alone.

Prerequisites: The Substitution That Collapses the Algebra

You're told a function ff satisfies f(x+y)=f(x)+f(y)f(x+y) = f(x) + f(y) for all real x,yx,y, and that f(3)=12f(3) = 12. Find f(1)f(1) and f(10)f(10). There's no formula for ff written down anywhere — just a rule it must obey for every pair of inputs. That "for all" is the whole game: since the rule holds for every possible xx and yy, you're free to plug in whatever specific values expose the most information, and a few well-chosen substitutions pin the function down completely.

The idea: plug in the values that break the equation open

A functional equation is really an infinite family of ordinary equations, one for each choice of xx and yy. Most of those choices are useless, but a few specific ones — zero, equal inputs, one input replacing another — tend to make terms cancel or repeat in a way that reveals structure. The standard menu:

  • Set x=y=0x=y=0 to find f(0)f(0).
  • Set y=xy=x to relate f(2x)f(2x) to f(x)f(x).
  • Set y=xy=-x to relate f(0)f(0) to f(x)f(x) and f(x)f(-x).
  • Look for a pattern and guess the general form, then verify it satisfies the original equation for all inputs, not just the ones you tested.

In plain English: you're using the universality of the rule against itself, extracting a normal, solvable equation from a statement that otherwise has no single unknown to isolate.

Worked example 1: additive functions

With f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y) and f(3)=12f(3)=12, set x=y=1.5x=y=1.5: f(3)=f(1.5)+f(1.5)=2f(1.5)f(3) = f(1.5)+f(1.5) = 2f(1.5), so f(1.5)=6f(1.5) = 6. More directly, set x=1,y=1,and 1x=1,y=1,\text{and }1 again — i.e., f(3)=f(1)+f(1)+f(1)=3f(1)f(3) = f(1)+f(1)+f(1) = 3f(1) by applying the rule twice, so 3f(1)=12f(1)=43f(1) = 12 \Rightarrow f(1) = 4. Once f(1)=4f(1)=4 is known, f(10)=f(1)+f(1)++f(1)f(10) = f(1)+f(1)+\cdots+f(1) (ten times) =10f(1)=40= 10f(1) = 40 — repeated application of the same rule. This is the signature of additive functional equations: f(n)=nf(1)f(n) = n \cdot f(1) for integer nn, i.e. ff behaves like multiplication by a constant, f(x)=4xf(x) = 4x.

Worked example 2: finding f(0) and checking a guess

Suppose f(x)f(y)=f(x+y)f(x)f(y) = f(x+y) for all real x,yx,y, with f(1)=3f(1) = 3. Setting x=y=0x=y=0: f(0)2=f(0)f(0)^2 = f(0), so f(0)f(0) is 00 or 11; if f(0)=0f(0)=0 then setting y=0y=0 generally forces f0f\equiv 0 everywhere, a degenerate solution, so take f(0)=1f(0)=1. Guessing f(x)=3xf(x) = 3^x (since 3x3y=3x+y3^x \cdot 3^y = 3^{x+y} matches the rule exactly, and 31=33^1=3 matches the given value), check it satisfies both the equation and f(0)=30=1f(0)=3^0=1 — it does. So f(2)=9f(2) = 9, f(1)=1/3f(-1) = 1/3, read straight off the verified formula rather than solved case by case.

f(x+y) = f(x) + f(y) true for EVERY x, y x=y=0 y=x y=-x each substitution yields one solvable equation, pinning down f(0), f(1), and the general form
Because the equation holds for every input pair, choosing special pairs converts it into ordinary, solvable equations.

A functional equation is a rule that holds for all inputs — exploit that by substituting special values (zero, equal arguments, negatives) to extract concrete facts, then guess and verify a closed-form solution against the original equation, not just the cases you tested.

Finding a formula that fits every substitution you tried is not a proof it's the only solution, or even a valid one — you must plug the candidate back into the original equation for arbitrary x,yx,y to confirm it, since functional equations can admit multiple solutions (or none, without extra regularity assumptions like continuity).

Related concepts

Practice in interviews

Further reading

  • Engel, Problem-Solving Strategies, ch. 4
ShareTwitterLinkedIn