Paper 4, Section II, H

Analysis of Functions | Part II, 2019

(a) Let (H,⟨⋅,⋅⟩)(\mathcal{H},\langle\cdot, \cdot\rangle) be a real Hilbert space and let B:H×H→RB: \mathcal{H} \times \mathcal{H} \rightarrow \mathbb{R} be a bilinear map. If BB is continuous prove that there is an M>0M>0 such that ∣B(u,v)∣⩽M∥u∥∥v∥|B(u, v)| \leqslant M\|u\|\|v\| for all u,v∈Hu, v \in \mathcal{H}. [You may use any form of the Banach-Steinhaus theorem as long as you state it clearly.]

(b) Now suppose that BB defined as above is bilinear and continuous, and assume also that it is coercive: i.e. there is a C>0C>0 such that B(u,u)⩾C∥u∥2B(u, u) \geqslant C\|u\|^{2} for all u∈Hu \in \mathcal{H}. Prove that for any f∈Hf \in \mathcal{H}, there exists a unique vf∈Hv_{f} \in \mathcal{H} such that B(u,vf)=⟨u,f⟩B\left(u, v_{f}\right)=\langle u, f\rangle for all u∈Hu \in \mathcal{H}.

[Hint: show that there is a bounded invertible linear operator LL with bounded inverse so that B(u,v)=⟨u,Lv⟩B(u, v)=\langle u, L v\rangle for all u,v∈Hu, v \in \mathcal{H}. You may use any form of the Riesz representation theorem as long as you state it clearly.]

(c) Define the Sobolev space H01(Ω)H_{0}^{1}(\Omega), where Ω⊂Rd\Omega \subset \mathbb{R}^{d} is open and bounded.

(d) Suppose f∈L2(Ω)f \in L^{2}(\Omega) and A∈RdA \in \mathbb{R}^{d} with ∣A∣2<2|A|_{2}<2, where ∣⋅∣2|\cdot|_{2} is the Euclidean norm on Rd\mathbb{R}^{d}. Consider the Dirichlet problem

−Δv+v+A⋅∇v=f in Ω,v=0 in ∂Ω-\Delta v+v+A \cdot \nabla v=f \quad \text { in } \Omega, \quad v=0 \quad \text { in } \partial \Omega

Using the result of part (b), prove there is a unique weak solution v∈H01(Ω)v \in H_{0}^{1}(\Omega).

(e) Now assume that Ω\Omega is the open unit disk in R2\mathbb{R}^{2} and gg is a smooth function on S1\mathbb{S}^{1}. Sketch how you would solve the following variant:

−Δv+v+A⋅∇v=0 in Ω,v=g in ∂Ω.-\Delta v+v+A \cdot \nabla v=0 \quad \text { in } \Omega, \quad v=g \quad \text { in } \partial \Omega .

[Hint: Reduce to the result of part (d).]

Typos? Please submit corrections to this page on GitHub.