🧮 Brain Teaser

Orthogonality to All Monomials Forces Zero

Problem

Let f:[0,1]Rf: [0,1] \to \mathbb{R} be continuous. Suppose that 01f(x)xndx=0for every integer n0.\int_0^1 f(x)\, x^n\, dx = 0 \quad \text{for every integer } n \geq 0.

Prove that f(x)=0f(x) = 0 for all x[0,1]x \in [0,1].


Field

Real Analysis

Why It's Beautiful

The hypothesis looks weak — you only know that ff is "orthogonal" to each monomial 1,x,x2,x3,1, x, x^2, x^3, \ldots But the conclusion is as strong as it gets: ff must be identically zero.

The proof is a beautiful two-step argument: first extend the orthogonality from monomials to all polynomials (by linearity), then from polynomials to ff itself (by the Weierstrass Approximation Theorem). The key move is choosing the approximating polynomial to be ff itself — giving 01f20\int_0^1 f^2 \approx 0, and since f20f^2 \geq 0, this forces f=0f = 0.

It's an elegant example of how a density argument (dense subsets of function spaces) turns a hypothesis about a small class of functions into a global conclusion.

Key Idea / Trick

  1. By linearity, 01f(x)p(x)dx=0\int_0^1 f(x) p(x)\, dx = 0 for every polynomial pp.
  2. By Weierstrass, there exist polynomials pkfp_k \to f uniformly on [0,1][0,1].
  3. Then 01f(x)2dx=limk01f(x)pk(x)dx=0\int_0^1 f(x)^2\, dx = \lim_{k\to\infty} \int_0^1 f(x) p_k(x)\, dx = 0.
  4. Since f20f^2 \geq 0 and continuous with zero integral, f0f \equiv 0.

Difficulty

3 / 5

Tags

Real Analysis, Weierstrass approximation theorem, Orthogonality, Continuous functions, Density argument, L2L^2

Weierstrass approximationOrthogonalityDensity argumentL2

Orthogonality to All Monomials Forces Zero — Answer

Step 1: Extend to all polynomials

By hypothesis, 01f(x)xndx=0\int_0^1 f(x) x^n dx = 0 for each n0n \geq 0.

For any polynomial p(x)=k=0Nakxkp(x) = \sum_{k=0}^N a_k x^k, linearity of the integral gives: 01f(x)p(x)dx=k=0Nak01f(x)xkdx=k=0Nak0=0\int_0^1 f(x)\, p(x)\, dx = \sum_{k=0}^N a_k \int_0^1 f(x)\, x^k\, dx = \sum_{k=0}^N a_k \cdot 0 = 0

So ff is orthogonal to every polynomial.


Step 2: Approximate ff by polynomials (Weierstrass)

By the Weierstrass Approximation Theorem, since ff is continuous on the compact interval [0,1][0,1], there exists a sequence of polynomials pkp_k such that: pkf=supx[0,1]pk(x)f(x)0\|p_k - f\|_\infty = \sup_{x \in [0,1]} |p_k(x) - f(x)| \to 0


Step 3: Force 01f2=0\int_0^1 f^2 = 0

01f(x)2dx=01f(x)(f(x)pk(x))dx+01f(x)pk(x)dx=0\int_0^1 f(x)^2\, dx = \int_0^1 f(x)\bigl(f(x) - p_k(x)\bigr)\, dx + \underbrace{\int_0^1 f(x)\, p_k(x)\, dx}_{=\, 0}

The remaining term is bounded by: 01f(x)(f(x)pk(x))dxffpk10\left|\int_0^1 f(x)(f(x) - p_k(x))\, dx\right| \leq \|f\|_\infty \cdot \|f - p_k\|_\infty \cdot 1 \to 0

Since 01f2\int_0^1 f^2 is a fixed non-negative number bounded above by something going to 0: 01f(x)2dx=0\int_0^1 f(x)^2\, dx = 0


Step 4: Conclude f0f \equiv 0

Since ff is continuous and f(x)20f(x)^2 \geq 0 everywhere, and 01f2=0\int_0^1 f^2 = 0, we must have f(x)2=0f(x)^2 = 0 for all x[0,1]x \in [0,1].

(If f(x0)2>0f(x_0)^2 > 0 for some x0x_0, by continuity f2>ϵf^2 > \epsilon on some interval, making the integral positive — contradiction.)

Therefore f(x)=0f(x) = 0 for all x[0,1]x \in [0,1]. \blacksquare


The Key Move

The trick is choosing the polynomial to approximate ff itself, and then splitting: f2=f(fpk)+fpk=small+0\int f^2 = \int f(f - p_k) + \int f \cdot p_k = \text{small} + 0

Using ff as its own "test function" is what extracts the information from the orthogonality condition.


Generalizations

  • The same result holds with {xn}\{x^n\} replaced by any set of functions whose linear span is dense in C[0,1]C[0,1] (e.g., {sin(nx)}\{\sin(nx)\}, {cos(nx)}\{\cos(nx)\} by Fourier theory).
  • In L2[0,1]L^2[0,1]: if fL2f \in L^2 is orthogonal to all polynomials, then f=0f = 0 a.e.
  • This is the principle behind moments determining distributions: if two distributions have the same moments xndμ=xndν\int x^n d\mu = \int x^n d\nu for all nn, and the moment problem has a unique solution, then μ=ν\mu = \nu.
Type: analysisEdit on GitHub ↗