We can make an approximation increasingly precise by dividing a system into smaller and smaller parts. But there is a question that the accuracy of each individual part does not answer:
What happens when all of these small errors are added together?
Consider the same circle divided into concentric rings. If we cut and straighten one ring with inner radius and thickness , its exact area is
Expanding the square gives
Our rectangular approximation accounts for
So the part we omit is not merely vaguely “small.” We can calculate it exactly:
This tells us something important about how the approximation behaves. The rectangular contribution is proportional to , while the error is proportional to .
For a fixed ,
Therefore,
As the ring becomes thinner, its error becomes negligible relative to the area we are approximating.
The rate matters. If we make the ring times thinner, then
and its error becomes
So a -fold decrease in thickness produces a -fold decrease in the error of one ring.
But this is still only a local result.
If we divide an entire circle of radius into equal rings, then
The error of each ring is therefore
There are such errors to accumulate. Since the error is the same for every ring,
Thus,
This distinction between local and accumulated error is important. Making each individual approximation more accurate is not by itself enough to tell us what happens to the complete model. We also need to know how quickly the local error decreases and how many such errors accumulate.
Here the two effects compete in a precise way. Making the rings times thinner makes each local error times smaller, but creates times as many rings. The accumulated error therefore becomes times smaller.
The accuracy of the whole cannot be inferred from the size of one local error alone. It depends on the relationship between how local errors shrink and how they accumulate across the system.