Let n be a positive integer and f:[0,1]→R be a continuous function such that ∫01xkf(x)dx=1for every k∈{0,1,…,n−1}. Prove that ∫01f(x)2dx≥n2.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
To prove that ∫01f(x)2dx≥n2, we will use the properties of orthonormal polynomials and the given conditions.
1. Legendre Polynomials and Orthonormal Basis: Let {Pk}k=0∞ denote the sequence of Legendre polynomials. These polynomials form an orthonormal basis for L2([0,1]) when appropriately scaled. Specifically, let Qk=2k+1Pk, then {Qk}k=0∞ form an orthonormal basis for L2([0,1]).
2. Inner Product and Orthonormality: For any function f∈L2([0,1]), we can express f in terms of the orthonormal basis {Qk}: f(x)=j=0∑∞⟨f,Qj⟩Qj(x), where ⟨f,Qj⟩ denotes the inner product: ⟨f,Qj⟩=∫01f(x)Qj(x)dx.
3. Given Conditions: The problem states that for every k∈{0,1,…,n−1}, ∫01xkf(x)dx=1. Since Pk(1)=1 for Legendre polynomials, we have: ∫01Pk(x)f(x)dx=1.
4. Norm Calculation: Using the orthonormality of {Qk}, we can write: ∫01f(x)2dx=j=0∑∞∣⟨f,Qj⟩∣2. Since ⟨f,Qj⟩=2j+1∫01Pj(x)f(x)dx, for j≤n−1, we have: ⟨f,Qj⟩=2j+1. Therefore, ∫01f(x)2dx≥j=0∑n−1∣⟨f,Qj⟩∣2=j=0∑n−1(2j+1).
5. Summation: The sum of the first n odd numbers is given by: j=0∑n−1(2j+1)=n2.
Thus, we have: ∫01f(x)2dx≥n2.
■
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.