Area Between Multiple Intersections — Finding the Area Between Curves That Intersect at More Than Two Points

The problem of computing the area enclosed between two curves has roots stretching back to antiquity, when Greek mathematicians first attempted to measure regions bounded by parabolas and other conic sections. Archimedes famously used his method of exhaustion to determine the area of a parabolic segment, foreshadowing the integral calculus that would emerge two millennia later. As mathematics matured through the Renaissance and into the seventeenth century, the need to handle increasingly complex curve configurations — where two functions cross each other repeatedly — became essential for problems in optics, astronomy, and engineering.

The formal development of integration by Isaac Newton and Gottfried Wilhelm Leibniz in the late 1600s provided the machinery to handle arbitrary regions between curves. However, it was the systematic treatment of piecewise integration over subintervals — splitting a complicated area calculation at each point where the curves cross — that enabled mathematicians and scientists to handle real-world scenarios where two quantities alternate in dominance. This idea is central to probability theory (computing probabilities between density curves), economics (surplus calculations), and physics (work done by competing forces).

The central question this lesson addresses is: when two curves intersect at more than two points, how do we correctly account for the regions where each curve is on top, and how do we assemble the total enclosed area? The naive approach of integrating a single expression over the entire domain fails because the sign of f(x) − g(x) changes at each intersection, leading to erroneous cancellation. The resolution lies in a disciplined approach: find all intersection points, test which function dominates on each subinterval, and sum the absolute differences.

Before diving into computation, it is essential to internalize several foundational ideas that govern the process of finding area between curves with multiple intersections. These principles generalize the simpler two-intersection case you have likely already mastered, but they require more careful bookkeeping and a methodical workflow.

The following diagram illustrates two curves — a cubic polynomial and a linear function — that intersect at three points. The three intersection points create two enclosed lobes. Notice how the dominant curve switches at each crossing: in the left lobe the linear function sits above the cubic, while in the right lobe the cubic rises above the line. Each lobe must be integrated separately with the correct integrand order.

The diagram makes a crucial point visible: if you were to integrate f(x) − g(x) from x₁ to x₃ without splitting, the positive contribution of Lobe B would partially cancel the negative contribution where g(x) > f(x) in Lobe A, yielding a number smaller than the actual geometric area. The correct approach requires computing each lobe's area with the absolute value of the difference, then summing. In the notation of the diagram, the total area is A = ∫ from x₁ to x₂ of |f(x) − g(x)| dx + ∫ from x₂ to x₃ of |f(x) − g(x)| dx.

We now formalize the procedure. Suppose f and g are continuous on [a, b] and intersect at points x₁ < x₂ < ⋯ < xₙ, where we set x₀ = a and xₙ₊₁ = b if the problem specifies explicit endpoints, or we simply use the intersection points as the full set of boundaries for the enclosed lobes.

In practice, you eliminate the absolute value by determining which function is larger on each subinterval. If f(x) ≥ g(x) on [xₖ, xₖ₊₁], the integrand becomes f(x) − g(x); if g(x) ≥ f(x), it becomes g(x) − f(x). This yields the practical computation formula below.

Below is the systematic procedure you should follow for every problem involving area between curves with multiple intersections. Internalizing this workflow prevents sign errors and ensures completeness.

1. Step 1 — Set up the equation f(x) = g(x) and solve for all intersection points. Factor, use the quadratic formula, or apply algebraic/trigonometric identities as needed.
2. Step 2 — Order the intersection points from smallest to largest: x₁ < x₂ < ⋯ < xₙ. These define n − 1 enclosed lobes (assuming the curves actually enclose area between consecutive crossings).
3. Step 3 — Test each subinterval by choosing a convenient sample point cₖ ∈ (xₖ, xₖ₊₁). Evaluate f(cₖ) and g(cₖ) to determine which function is on top.
4. Step 4 — Write the integral for each subinterval as ∫ from xₖ to xₖ₊₁ [upper − lower] dx, ensuring the integrand is non-negative.
5. Step 5 — Evaluate each integral using the Fundamental Theorem of Calculus, and sum all the results to obtain the total area.

Problems with multiple intersections can be classified by the number and type of crossings. The simplest generalization beyond two intersections involves three intersection points yielding two lobes, commonly arising when a polynomial of degree three crosses a line. More complex scenarios include trigonometric functions crossing polynomials periodically, or two oscillatory functions generating many enclosed lobes. The key insight is that the procedure is identical regardless of the number of intersections — the difficulty lies in solving the intersection equation and in the algebra of evaluating additional integrals.

Find the total area enclosed between f(x) = x³ − 4x and g(x) = 0 (the x-axis).

Understanding where students typically go wrong — and how the multiple-intersection case compares to simpler scenarios — solidifies your command of the technique.

The technique of splitting at intersection points extends naturally into several advanced areas of mathematics and applied science. Understanding how this foundational idea scales prepares you for more sophisticated problems in later courses.

Looking ahead, the discipline of splitting domains at boundary curves where an integrand changes character is a recurring motif in analysis. In multivariable calculus, you will encounter regions where the limits of integration change form at curves of intersection between surfaces. In real analysis, the decomposition of a function into its positive and negative parts — f = f⁺ − f⁻ — mirrors exactly the splitting strategy you learned here, and is fundamental to the definition of the Lebesgue integral.