In mathematics, the trapezium rule (the British term) or trapezoidal rule (the American term) is a way to approximately calculate the definite integral

.

The trapezium rule works by approximating the region under the graph of the function by a trapezium and calculating its area. It follows that

.

To calculate this integral more accurately, one first splits the interval of integration into smaller subintervals, and then applies the trapezium rule on each of them. One obtains the composite trapezium rule

.

This can alternatively be written as

where

, for .

(one can also use a non-uniform grid). The trapezium rule is one of a family of formulas for numerical integration called Newton–Cotes formulas. Simpson’s rule is another, often more accurate, member of the same family. Simpson’s rule and other like methods can be expected to improve on the trapezium rule for functions which are twice continuously differentiable; however for rougher functions the trapezium rule is likely to prove preferable. Moreover, the trapezium rule tends to become extremely accurate when periodic functions are integrated over their periods, a fact best understood in connection with the Euler–Maclaurin summation formula. For non-periodic functions, however, methods with unequally spaced points such as Gaussian quadrature and Clenshaw–Curtis quadrature are generally far more accurate; Clenshaw-Curtis quadrature can be viewed as a change of variables to express arbitrary integrals in terms of periodic integrals, at which point the trapezium rule can be applied accurately.

An advantage of the trapezium rule is that the sign of the error of the approximation is easily known. An integral approximated with this rule on a concave-up function will be an overestimate because the trapezoids include all of the area under the curve and extend over it. Using this method on a concave-down function yields an underestimate because area is unaccounted for under the curve, but none is counted above. If the interval of the integral being approximated includes an inflection point, then the error is harder to identify.

Our aim is to prove that if $latex f\in C^2([a,b])$ then the above approximation is second-order accurate. To this end, we need to recall some properties of Lagrange interpolation.

Roughly speaking, if we denote by the Lagrange interpolation polynomial of at the nodes and . Then is of order . Explicitly, we have

.

Next for each fixed, we consider the following function

over . Clearly, and is of class . Then by Rolle theorem, there exists a such that . Since

then for each fixed, we have

which implies that

.

By mean value theorem, there exists some such that

which is nothing but

.

Okey, we have shown that

i.e.,

.

Now regarding to composite trapezoidal rule with a uniform partition of the interval , we have

.

which helps us to formulate

where for . Thus,

.

Clearly,

for some which yields

which completes our proof.