recurrence relations
Functional Equations
You should know: recurrence relations
Overview
A functional equation is an equation whose unknown is a function rather than a number, requiring the function to satisfy a stated relationship for all inputs in its domain — such as Cauchy's equation f(x+y) = f(x) + f(y). Unlike an algebraic equation with finitely many solutions, a functional equation can have infinitely many pathological solutions unless extra regularity (continuity, monotonicity, boundedness) is imposed; Cauchy's equation, for instance, forces f(x) = cx under continuity but admits wild, non-measurable solutions without it. Functional equations are a staple of olympiad mathematics and also model real recurrence-like relationships, such as the master theorem's f(n) = aT(n/b) + f(n) recursive structure, and functional identities like f(xy) = f(x) + f(y) that characterize the logarithm. Standard solution techniques include substituting special values (like x=0 or x=y), proving injectivity/surjectivity, and using induction to extend a formula from integers to rationals.
Intuition
A functional equation is a constraint puzzle: instead of solving for a number that fits an equation, you're solving for an entire rule — a function — that must behave consistently across every possible input simultaneously. The trick is almost always to plug in strategically chosen values (0, 1, x=y, or y=-x) to peel off structure one layer at a time, the way you might deduce a person's daily routine by asking a few well-chosen questions rather than following them around all day. Regularity conditions like continuity matter because without them, a function can satisfy the equation on rationals (forced by pure algebra) while behaving arbitrarily and wildly on the irrationals, since the reals as a vector space over ℚ have uncountably many 'independent directions' that an equation stated only via +,× can't constrain.
Formal Definition
Common functional equations and their solution classes include:
Worked Examples
Set x=y=0 to find f(0).
By induction, f(nx) = nf(x) for all positive integers n, and this extends to rationals: f(qx) = qf(x) for q ∈ ℚ.
Setting c = f(1), f(q) = cq for all rationals q; continuity forces this to extend to all reals.
Answer: f(x) = cx for some constant c (under the continuity assumption).
Practice Problems
Find all f: ℝ → ℝ satisfying f(x+y) = f(x)f(y) for all x,y, with f continuous and f not identically 0.
Prove that any function f: ℤ → ℤ satisfying f(x+y) = f(x)+f(y) must have f(n) = nf(1) for all integers n.
Find all functions f: ℚ → ℚ such that f(x+y) = f(x) + f(y) + xy for all rationals x, y.
Quiz
Summary
- A functional equation constrains an unknown function rather than an unknown number, often admitting infinitely many solutions absent regularity conditions.
- Cauchy's equation f(x+y)=f(x)+f(y) forces f(x)=cx under continuity, but has wild discontinuous solutions without it.
- Standard techniques: substitute special values (0, 1, x=y), prove injectivity, and use induction to extend formulas from integers to rationals.
Mathematics