Functional Equations Workshop

Summary

The workshop introduces functional equations as problems that ask for every function with a specified domain and codomain that satisfies a given equation. The presenters emphasize that domain and codomain matter: changing them can affect both the functions that qualify and the solution techniques that work.

Core Tools and Habits

• Start by guessing and checking candidates. Simple possibilities, such as the identity function or an affine function, can suggest useful substitutions and guide a proof. A candidate is not a complete solution until it has been checked in the original equation.
• Use injectivity and surjectivity strategically.
  • A function is injective if (f(a)=f(b)) implies (a=b). Once injectivity is established, matching expressions of the form (f(A)=f(B)) lets you “strip away” the outer (f) and conclude (A=B).
  • A function is surjective if every value in the codomain is reached. Surjectivity lets you choose an input whose output is convenient.
  • A function is bijective if it is both injective and surjective.
• Try deliberate substitutions. Common choices include setting a variable to (0), (1), or (-1); setting variables equal; or choosing values that make two expressions inside (f) match. For integer domains, trying small integer values can be especially useful. The goal is to simplify the equation or make injectivity applicable.
• Exploit symmetry. Swap (x) and (y). If one side stays unchanged while the other changes, equate the resulting expressions. This can produce a simpler relation.
• Use auxiliary functions or transformations. A complicated expression may become easier to work with if it is recognized as a new function or as a transformation of the original one.

Examples and Concepts Covered

• A bijectivity example: For an equation of the form [ f(f(x)+y)=x+f(f(y)), ] the presenter shows how comparing the equation at inputs with equal (f)-values can establish injectivity. Choosing an input to make the right-hand side an arbitrary target establishes surjectivity. Then, setting (x=0) and using injectivity gives (f(y)=y+c). Substitution back into the original equation confirms that these are the solutions.

• Substitution and injectivity in another example: The presenters demonstrate how convenient values can create equal expressions involving (f), allowing injectivity to simplify the equation. The example also illustrates the importance of checking proposed candidates against the original equation.

• Cauchy’s additive functional equation: [ f(x+y)=f(x)+f(y). ] On the natural numbers, if (f(1)=k), repeated addition and induction show that (f(n)=nk). On the rational numbers with real outputs, the same relation gives (f(q)=qf(1)). The domain and codomain affect which values of (k) are allowed.

• Symmetry and candidate solutions: In one example, swapping (x) and (y) yields a simpler relation that suggests an affine candidate (f(x)=x+c). Substitution into the original equation then rules out all candidates, showing that some functional equations have no solutions.

• Involutions: A function satisfying (f(f(x))=x) is its own inverse. Recognizing a nested expression as an involution can make substitutions more effective. The workshop works through an example involving (f(x)=\frac{x}{x-1}).
• Associativity of function composition: Since composition is associative, an equation involving repeated applications of (f) can sometimes be evaluated using different groupings to derive a simpler relation. In the example, this gives (f(x+1)=f(x)+1). An affine candidate then forces a half-integer value, contradicting the integer-valued setting, so no such function exists.

Speakers and Sources

• Opening organizer/host: Unnamed; introduces the workshop and hands over to the presenters.
• Daniel: Presenter for the first section on basic functional-equation techniques.
• Second presenter: Unnamed; presents the material on additive functions, symmetry, involutions, and composition.
• Lucy: Cited for a quotation about substitutions; no further identification is given.
• Resources mentioned: Problem Solving Tactics (PST) and OTIS are recommended for further practice. A USA TST problem is also mentioned as an example.