We can approximate a definite integral, $\int_a^b f(x)dx$, using a variety of Riemann sums. If $T_n$ and $M_n$ are the nth sums using the trapezoid and midpoint (middle) sum methods and if the second derivative of $f$ is bounded on $[a, b]$ then does the following theorem imply that $M_n$ "tends to be more accurate" then $T_n$?
If $f''$ is continuous on $[a, b]$ and $|f''(x)| \leq K$, $\forall$ $x \in [a, b]$. Then,
$\left| \int_a^b f(x)dx - T_n \right| \leq K\frac{(b-a)^3}{12n^2}$
and
$\left| \int_a^b f(x)dx - M_n \right| \leq K\frac{(b-a)^3}{24n^2}$
For this question let, $E_{T_n} = \left| \int_a^b f(x)dx - T_n \right| $ and $E_{M_n} = \left| \int_a^b f(x)dx - M_n \right| $
The theorem is presented (without proof) in a calculus 2 book. It only really seems to imply that, we can with 100% certainly bound $E_{M_n}$ smaller than we can bound $E_{T_n}$. But, that says nothing about the actual values of $E_{T_n}$ or $E_{M_n}$.
So, isn't it possible to customize a function so that $E_{T_n} < E_{M_n}$ for a particular n? Could we even make a function so that $E_{T_n} < E_{M_n}$ $\forall n$?