Consider on real functions with , where . The pointwise estimate in the Endpoint Poincaré inequality gives with . If , then . Thus the form is a coercive bilinear form even though the potential can change sign. For on , , yielding the explicit constant .
Take the affine trial space and the test space . Multiplication by and integration by parts incorporate the right Neumann boundary condition as a load:
For the continuous piecewise-quadratic trial space, impose the left value exactly and use the same equation for every piecewise-quadratic test function vanishing at . With a basis of that test space and , the finite element equations are
The Endpoint Poincaré inequality, reflected about the interval midpoint, makes the derivative norm a norm on . Galerkin orthogonality then gives the exact best-approximation identity: for every admissible ,
Therefore minimizes the derivative error over all admissible piecewise-quadratic functions.
To prove the requested error bound, assume . Then and . We need an elementary Poincare-Wirtinger inequality on each element of length : if has mean zero, its continuous representative has a zero somewhere, and the fundamental theorem of calculus and Cauchy-Schwarz inequality give .
Choose an affine function whose slope is the average of on and whose average equals the average of . Then and both have mean zero. Applying the just-proved bound twice yields
Define a quadratic interpolant on by integrating from the true left-endpoint value. The equal-average condition ensures that it reaches the true right-endpoint value, so these pieces join to an admissible continuous piecewise-quadratic function . Sum the squared estimates and use the best-approximation property:
Only the maximum element length is used; equal spacing is unnecessary.
For the Aubin–Nitsche duality argument, let and solve , , . Explicitly , so . Integration by parts and Galerkin orthogonality give
where is its nodal piecewise-linear interpolant, which belongs to the quadratic test space. On each element is the average of , so the same mean-zero inequality gives . Canceling when nonzero proves the additional order:
A real bilinear form is a coercive bilinear form on when for all and some fixed . It is a bounded bilinear form, equivalently continuous, when for one finite . A continuous linear functional satisfies .
The Galerkin method seeks with for all . Subtraction from the continuous equations gives Galerkin orthogonality: for every . Under the stated continuity and coercivity assumptions, Céa's lemma says
Indeed, with and any , Galerkin orthogonality eliminates :
If the claim is immediate; otherwise cancel and take the infimum. No symmetry of was used. These statements define an approximation when it exists; a finite-dimensional gives existence and uniqueness by the Lax-Milgram theorem, as does a closed vector subspace.
For the interval example write and . The one-dimensional Sobolev representative of satisfies
by the Cauchy-Schwarz inequality. The representation follows by taking the absolutely continuous function primitive of the weak derivative; its difference from has zero weak derivative, hence is constant, and fixes that constant. Integrating the estimate gives the Endpoint Poincaré inequality
Thus the nonnegative potential gives
For continuity, , the Cauchy-Schwarz inequality for the two integrals, and then its two-dimensional version give
Similarly , proving continuity of the linear functional.
For the last displayed integral take and retain the endpoint condition , the domain-consistent interpretation of the changed formula. The changed form is still coercive. A negative potential on part of the interval does not by itself destroy coercivity. The sharper pointwise estimate above gives
Discarding only the positive part of the potential yields
The proved Endpoint Poincaré inequality with gives , and therefore
This is a concrete application of negative-potential domination by endpoint control. The constant is sufficient, without claiming to be optimal.