Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/iii/paper-326/2/4/a/solution

Write , , and , with as required by coercivity and by the printed inverse power. The Tikhonov regularization with a coercive penalty operator normal equation gives
This also holds for inconsistent data in , because and therefore . Taking the inner product with gives
For any with , put and use Cauchy-Schwarz inequality to bound the right-hand side by . Since , completing the square in yields
The positive root of this quadratic inequality is at most . Infimizing over proves the approximate source bound for coercive Tikhonov regularization, in fact slightly more strongly:
Injectivity gives . Given any positive tolerance, approximate by for some finite-norm ; for all sufficiently large it is admissible in the infimum. Thus
No attainment of that infimum is needed.

New to topics? Read the docs here!