Chapter 7: Problem 4
A space of functions \(\mathcal{K}\) is said to be convex if, whenever \(u \in \mathcal{K}\) and \(v \in \mathcal{K},(1-\lambda) u+\lambda v \in \mathcal{K}\) for all \(0 \leq \lambda \leq 1 .\) Show that the space \(\mathcal{K}\) of all piecewise continuously differentiable functions \(v(x)(-1 \leq x \leq 1)\) satisfying \(v \geq f\) and \(v(\pm 1)=0\) is convex. (These functions are called test functions.) The obstacle problem may also be formulated as: find the function \(u\) that minimises the energy $$E[v]=\int_{-1}^{1} \frac{1}{2}\left(v^{\prime}\right)^{2} d x$$ over all \(v \in \mathcal{K}\). (This is the usual energy minimisation but with the constraint incorporated.) If \(u\) is the minimiser, and \(v\) is any test function, use the fact that \(E[(1-\lambda) u+\lambda v]-E[u] \geq 0\) for all \(\lambda\) to show that $$\int_{-1}^{1} u^{\prime}(v-u)^{\prime} d x \geq 0$$ This is the variational inequality for the obstacle problem.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.