Tutorials › Calculus I › Choosing Partitions For Tighter Estimates

Integral Properties and Estimates · Tutorial 1004 of 1495

Choosing Partitions For Tighter Estimates

Compare equal and uneven partitions and learn to place more subintervals where a function varies more, while checking the resulting Darboux-sum gap.

Intermediate 10 min read

What You'll Learn

  • Define the Darboux gap of a partition as the upper sum minus the lower sum.
  • Compare equal-width and uneven partitions using exact calculations.
  • Identify intervals where large oscillation contributes most to the gap.
  • Use a Lipschitz bound to understand when equal widths give a strong estimate.
  • Recognize why an uneven partition can either improve or worsen an estimate.

Why Partition Placement Matters

A partition divides an interval into subintervals. On each subinterval, the upper Darboux sum uses the function’s supremum, while the lower Darboux sum uses its infimum. Their difference measures the spread between these two estimates.

Making every subinterval equally wide is a simple way to refine an estimate. But equal widths need not be the best choice when the function varies much more in some regions than in others. A wide interval where the function is nearly constant may contribute little to the gap, while a short interval containing a steep change can contribute more.

The practical principle is to examine each interval’s contribution: its width multiplied by the function’s oscillation there. If the oscillation is large in one region, placing more partition points there can reduce the total gap. This is a guide, not a guarantee: the actual sums must be calculated or bounded.

The Darboux Gap

Let \(f\) be bounded on \([a,b]\), and let \(P\) be a partition \(a=x_0<x_1<\cdots<x_n=b\). On the \(i\)th subinterval \([x_{i-1},x_i]\), define its width as \(\Delta x_i=x_i-x_{i-1}\), its supremum as \(M_i\), and its infimum as \(m_i\). The upper and lower Darboux sums are

$$ U(f,P)=\sum_{i=1}^{n}M_i\Delta x_i, \qquad L(f,P)=\sum_{i=1}^{n}m_i\Delta x_i. $$

Subtracting the sums gives the gap:

$$ U(f,P)-L(f,P) = \sum_{i=1}^{n}(M_i-m_i)\Delta x_i. $$
Definition: The oscillation of \(f\) on a subinterval is the difference between its supremum and infimum there. The Darboux gap is the sum, over all subintervals, of width times oscillation.

Every term in the gap is nonnegative. Therefore, to reduce the gap, a partition should break up intervals whose width and oscillation together make a large contribution. If \(f\) is Riemann integrable, its integral lies between the lower and upper sums; a small gap therefore gives a tight pair of bounds.

Worked Example: More Points Where the Function Changes

Worked Example: More Points Where the Function Changes

Define \(f\) on \([0,1]\) by \(f(x)=0\) for \(0\le x\le 3/4\), and \(f(x)=4(x-3/4)\) for \(3/4\le x\le1\). Compare two partitions with four subintervals each.

Equal-width partition. Take \(P_1=\{0,1/4,1/2,3/4,1\}\). The first three intervals have \(M_i-m_i=0\). On \([3/4,1]\), the function increases from \(0\) to \(1\), so the oscillation is \(1\) and the width is \(1/4\). Thus

$$ U(f,P_1)-L(f,P_1) =0+0+0+1\left(\frac14\right) =\frac14. $$

Uneven partition. Now take \(P_2=\{0,3/4,13/16,7/8,1\}\). The first interval again has zero oscillation. Each of the remaining intervals lies in the increasing linear part. Their widths are \(1/16,1/16,1/8\). Since the slope there is \(4\), the oscillations on those intervals are \(1/4,1/4,1/2\), respectively. The gap is

$$ U(f,P_2)-L(f,P_2) = 0+\frac14\left(\frac1{16}\right) +\frac14\left(\frac1{16}\right) +\frac12\left(\frac18\right) = \frac1{64}+\frac1{64}+\frac1{16} = \frac3{32}. $$

Because \(3/32<1/4\), the uneven partition gives a smaller gap with the same number of subintervals. It places three intervals in the part where \(f\) changes and leaves the constant part as one interval. As a check, for each partition the calculation has included every interval; the constant interval contributes zero, and each increasing interval contributes its width times its endpoint change.

Why Equal Widths Can Be Effective

Equal widths are not automatically inferior. If variation is distributed fairly evenly, they can give a good estimate and are easy to manage. A useful general bound applies when \(f\) is Lipschitz on \([a,b]\): this means there is a constant \(K\ge0\) such that \(|f(x)-f(y)|\le K|x-y|\) for all \(x,y\in[a,b]\).

Theorem: If \(f\) is Lipschitz with constant \(K\) on \([a,b]\), then every partition \(P\) satisfies \(U(f,P)-L(f,P)\le K\sum_{i=1}^{n}(\Delta x_i)^2\). Among partitions with \(n\) subintervals, the sum of squared widths is smallest for equal widths.

To justify the gap bound, take any two points \(x,y\) in the same subinterval \([x_{i-1},x_i]\). By the Lipschitz condition, \(|f(x)-f(y)|\le K\Delta x_i\). Taking the greatest possible difference on that interval gives \(M_i-m_i\le K\Delta x_i\). Multiplying by the width and summing proves the first inequality:

$$ U(f,P)-L(f,P) =\sum_{i=1}^{n}(M_i-m_i)\Delta x_i \le K\sum_{i=1}^{n}(\Delta x_i)^2. $$

For the second claim, the widths are positive and sum to \(b-a\). The identity \(\sum_{i=1}^{n}(\Delta x_i-(b-a)/n)^2\ge0\), expanded and simplified, gives

$$ \sum_{i=1}^{n}(\Delta x_i)^2\ge\frac{(b-a)^2}{n}. $$

Equality holds exactly when every width is \((b-a)/n\). This proves that equal widths minimize this particular general bound. It does not prove that equal widths minimize the actual Darboux gap for every function. If the function’s variation is concentrated in one region, an uneven partition can do better, as the preceding example showed.

Worked Example: A Monotone Function with Two Subintervals

Worked Example: A Monotone Function with Two Subintervals

Let \(f(x)=x^2\) on \([0,1]\). Compare the equal-width partition \(\{0,1/2,1\}\) with the uneven partition \(\{0,3/5,1\}\). Since \(x^2\) is increasing on this interval, each subinterval’s infimum and supremum are its endpoint values.

For the equal-width partition, the first interval has width \(1/2\) and oscillation \((1/2)^2-0^2=1/4\). The second has width \(1/2\) and oscillation \(1^2-(1/2)^2=3/4\). Therefore

$$ U(f,P)-L(f,P) = \frac12\cdot\frac14+\frac12\cdot\frac34 = \frac18+\frac38 = \frac12. $$

For the uneven partition, the first interval has width \(3/5\) and oscillation \((3/5)^2-0^2=9/25\). The second has width \(2/5\) and oscillation \(1^2-(3/5)^2=16/25\). Hence

$$ U(f,P)-L(f,P) = \frac35\cdot\frac9{25}+\frac25\cdot\frac{16}{25} = \frac{27}{125}+\frac{32}{125} = \frac{59}{125}. $$

Since \(59/125=0.472<0.5=1/2\), this uneven partition gives a smaller gap. The interval on the right has the larger oscillation, so making it narrower reduces its contribution. The result is a comparison of these two particular partitions, not a claim that this choice is best among all possible partitions.

How Variation Guides the Choice

For each subinterval, the contribution is \((M_i-m_i)\Delta x_i\). When choosing points, inspect both factors. A large oscillation suggests subdividing that region; a large width can also make the contribution large, even if the oscillation per unit of width is moderate. If a region is constant, subdividing it does not reduce the gap there.

When a useful bound on local variation is available, it can guide the placement more precisely. For example, if the function changes at most \(K_i\) times the distance between any two points of a particular subinterval, then that subinterval contributes at most \(K_i(\Delta x_i)^2\). Larger local values of \(K_i\) make smaller widths desirable for controlling this bound. This is a planning tool: the constants may be unavailable, and the bound need not equal the actual gap.

A practical process is:

1
Locate substantial variation.
Use the graph or known behavior of \(f\) to identify regions where its values change appreciably.
2
Estimate interval contributions.
For each proposed interval, consider its width and its oscillation, or a valid upper bound for that oscillation.
3
Place points and recalculate.
Use narrower intervals where the contributions are large, then compute or bound the new total gap.

Worked Example: Uneven Widths Can Make the Gap Worse

Worked Example: Uneven Widths Can Make the Gap Worse

Take \(f(x)=x\) on \([0,1]\). Compare three equal intervals with an uneven partition having widths \(1/2,1/4,1/4\). On any interval of width \(d\), the function’s oscillation is also \(d\), so the contribution to the gap is \(d^2\).

For the equal-width partition, all widths are \(1/3\), and the gap is

$$ 3\left(\frac13\right)^2=\frac13. $$

For the uneven partition, the three contributions are \((1/2)^2=1/4\), \((1/4)^2=1/16\), and \((1/4)^2=1/16\). Thus

$$ \frac14+\frac1{16}+\frac1{16} = \frac38 > \frac13. $$

Here the uneven choice leaves one interval much wider, and its contribution outweighs the benefit of the two shorter intervals. This calculation checks both partitions directly and shows why nonuniform spacing is not automatically an improvement.

A Common Mistake

A common error is to assume that having a smaller interval somewhere guarantees a smaller total gap. For \(f(x)=x\) on \([0,1]\), one might incorrectly compare the widths \(1/2,1/4,1/4\) with the equal widths \(1/3,1/3,1/3\) and conclude that the uneven partition must be better because it contains two shorter intervals. That conclusion ignores the remaining width and the sum of all contributions.

The corrected calculation is

$$ \frac14+\frac1{16}+\frac1{16} =\frac38 > \frac13 = 3\left(\frac13\right)^2. $$

The comparison must include every subinterval. The quantity to reduce is the sum of width times oscillation, not the width of one selected interval or the number of short intervals.

Choosing a Partition in Practice

If little is known about where the function varies, equal widths are a reliable and transparent starting point. If a graph or formula indicates concentrated variation, an uneven partition may produce a smaller gap with the same number of intervals. In either case, the claim is verified by calculating or bounding the contributions on all subintervals.

The key question is not simply, “Are the widths equal?” It is, “Where does this partition’s Darboux gap come from?” Once the large contributions are identified, partition points can be moved toward the regions responsible for them. The resulting estimate is only as good as the comparison supporting it.

Check Your Understanding

Use the gap formula to explain how partition placement affects upper and lower Darboux estimates.

  1. For a bounded function on a subinterval, what two quantities determine that interval’s contribution to the Darboux gap?
  2. Why does a Lipschitz condition give an upper bound involving the squares of the partition widths?
  3. What does the equal-width result minimize: every function’s actual gap, or the general bound involving squared widths?
  4. In the piecewise-linear example, why did adding intervals in the constant region fail to help?
  5. Give a reason an uneven partition could have a larger gap than an equal-width partition.

Test yourself: Calculus I final exam practice

Ready to check what you know? Work a full-length practice final, then open the complete worked solutions.

Want all 1,114 practice problems?

This tutorial covers one topic. Calc Pass covers the full Calculus AB & BC curriculum (the core of Calculus I and II): full review, every practice question, and step-by-step solutions to each one.

QR code to download the Calc Pass app

Get the Calc Pass App

Scan to download and practice on the go, with instant scoring.

Calc Pass Volume 1: 1,114 Practice Questions book cover

Vol. 1: 1,114 Questions

The complete practice question bank, organized by AB & BC topic.

View on Amazon
Calc Pass Volume 2: Solutions Manual book cover

Vol. 2: Solutions Manual

Fully worked solutions to every question in Volume 1.

View on Amazon