This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Put f ( x ) = r 0 + r 1 x + r 2 x 2 + ⋯ + r 1 9 4 5 x 1 9 4 5 and note that ∫ 0 1 f ( x ) x k d x = i = 0 ∑ 1 9 4 5 r i ∫ 0 1 x i + k d x = i = 0 ∑ 1 9 4 5 i + k + 1 r i . Expanding the sum on the right and setting it equal to 1 for k = 0 , 1 , … , 1 9 4 5 leads to the system r 0 2 1 r 0 ⋮ 1 9 4 6 1 r 0 + + + 2 1 r 1 3 1 r 2 ⋮ 1 9 4 7 1 r 1 + + + ⋯ ⋯ ⋱ ⋯ + + + 1 9 4 6 1 r 1 9 4 5 1 9 4 7 1 r 1 9 4 5 ⋮ 3 8 9 1 1 r 1 9 4 5 = = = 1 , 1 , ⋮ 1 , or more compactly, H r = 1 , where H is the 1 9 4 6 × 1 9 4 6 Hilbert matrix, r is the coefficient vector of f , and 1 is a column vector of 1 s. In general, Hilbert matrices are invertible, so f exists and its coefficients are given by r = H − 1 1 . This implies that r i is the sum of the entries in the i th row of H − 1 . Now consider ∫ 0 1 [ f ( x ) ] 2 d x = ∫ 0 1 f ( x ) ( i = 0 ∑ 1 9 4 5 r i x i ) d x = i = 0 ∑ 1 9 4 5 r i ∫ 0 1 f ( x ) x i d x = i = 0 ∑ 1 9 4 5 r i . The sum on the right is the sum of all the entries of H − 1 . There is a useful property of any Hilbert matrix: if H is a d × d Hilbert matrix, then the sum of all the entries in H − 1 is d 2 . This property implies that ∫ 0 1 [ f ( x ) ] 2 d x = 1 9 4 6 2 = 3 7 8 6 9 1 6 . To prove the minimality of this value, suppose that g is square integrable over [ 0 , 1 ] and also has the property that ∫ 0 1 g ( x ) x k d x = 1 , k = 0 , 1 , … , 1 9 4 5 . Notice that ∫ 0 1 g ( x ) f ( x ) d x = i = 0 ∑ 1 9 4 5 r i ∫ 0 1 g ( x ) x i d x = ∫ 0 1 [ f ( x ) ] 2 d x , which means that in the Lebesgue space L 2 [ 0 , 1 ] ⟨ g − f , f ⟩ = ∫ 0 1 [ g ( x ) − f ( x ) ] f ( x ) d x = ∫ 0 1 g ( x ) f ( x ) d x − ∫ 0 1 [ f ( x ) ] 2 d x = 0 . In other words, g − f is orthogonal to f . This result has a nice geometric interpretation. By the Pythagorean theorem for inner product spaces, ∥ g ∥ 2 = ∥ g − f ∥ 2 + ∥ f ∥ 2 ≥ ∥ f ∥ 2 , and thus ∫ 0 1 [ g ( x ) ] 2 d x = ∥ g ∥ 2 ≥ ∥ f ∥ 2 = ∫ 0 1 [ f ( x ) ] 2 d x . This establishes the minimality of f with respect to the L 2 [ 0 , 1 ] norm. Notice that f is minimal not just among polynomial functions but among all functions that are square integrable over [ 0 , 1 ] .