06.09.2021 Views

Measure, Integration & Real Analysis, 2021a

Measure, Integration & Real Analysis, 2021a

Measure, Integration & Real Analysis, 2021a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

226 Chapter 8 Hilbert Spaces<br />

In the next result, we use for the first time the hypothesis that V is a Hilbert space.<br />

8.28 distance to a closed convex set is attained in a Hilbert space<br />

• The distance from an element of a Hilbert space to a nonempty closed convex<br />

set is attained by a unique element of the nonempty closed convex set.<br />

• More specifically, suppose V is a Hilbert space, f ∈ V, and U is a nonempty<br />

closed convex subset of V. Then there exists a unique g ∈ U such that<br />

‖ f − g‖ = distance( f , U).<br />

Proof First we prove the existence of an element of U that attains the distance to f .<br />

To do this, suppose g 1 , g 2 ,...is a sequence of elements of U such that<br />

8.29 lim ‖ f − g k ‖ = distance( f , U).<br />

k→∞<br />

Then for j, k ∈ Z + we have<br />

8.30<br />

‖g j − g k ‖ 2 = ‖( f − g k ) − ( f − g j )‖ 2<br />

= 2‖ f − g k ‖ 2 + 2‖ f − g j ‖ 2 −‖2 f − (g k + g j )‖ 2<br />

= 2‖ f − g k ‖ 2 + 2‖ f − g j ‖ 2 − 4∥ f − g k + g j ∥<br />

2<br />

≤ 2‖ f − g k ‖ 2 + 2‖ f − g j ‖ 2 − 4 ( distance( f , U) ) 2 ,<br />

where the second equality comes from the parallelogram equality (8.20) and the<br />

last line holds because the convexity of U implies that (g k + g j )/2 ∈ U. Now the<br />

inequality above and 8.29 imply that g 1 , g 2 ,...is a Cauchy sequence. Thus there<br />

exists g ∈ V such that<br />

8.31 lim<br />

k→∞<br />

‖g k − g‖ = 0.<br />

Because U is a closed subset of V and each g k ∈ U, we know that g ∈ U. Now8.29<br />

and 8.31 imply that<br />

‖ f − g‖ = distance( f , U),<br />

which completes the existence proof of the existence part of this result.<br />

To prove the uniqueness part of this result, suppose g and ˜g are elements of U<br />

such that<br />

8.32 ‖ f − g‖ = ‖ f − ˜g‖ = distance( f , U).<br />

Then<br />

8.33<br />

‖g − ˜g‖ 2 ≤ 2‖ f − g‖ 2 + 2‖ f − ˜g‖ 2 − 4 ( distance( f , U) ) 2<br />

= 0,<br />

where the first line above follows from 8.30 (with g j replaced by g and g k replaced<br />

by ˜g) and the last line above follows from 8.32. Now 8.33 implies that g = ˜g,<br />

completing the proof of uniqueness.<br />

∥ 2<br />

<strong>Measure</strong>, <strong>Integration</strong> & <strong>Real</strong> <strong>Analysis</strong>, by Sheldon Axler

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!