The Fundamental Relationship: The definite integral is mathematically defined as the limit of Riemann sums as the mesh norm tends to zero:
∫ₐᵇ f(x) dx ≡ lim_{n → ∞} ∑ᵢ₌₁ⁿ f(ξᵢ) Δx
Gaston Darboux framed integrability via Supremum (Mᵢ = sup f(x)) and Infimum (mᵢ = inf f(x)) over each subinterval [xᵢ₋₁, xᵢ]. A bounded function is Riemann integrable if and only if:
∀ ε > 0, ∃ Partition P such that: U(P) - L(P) = ∑ᵢ₌₁ⁿ (Mᵢ - mᵢ) Δx < ε
Upper Darboux Sum U(P)
3.080000
∑ Mᵢ Δx (circumscribed step envelope)
Lower Darboux Sum L(P)
2.280000
∑ mᵢ Δx (inscribed step envelope)
Sandwich Inequality
L(P) ≤ Sₙ ≤ U(P)
Definite integral I is trapped strictly between L(P) and U(P).
Comparing theoretical asymptotic convergence rates: Endpoint Riemann sums (Left/Right) scale as O(1/n), whereas Midpoint and Trapezoidal rules cancel linear error terms to achieve second-order O(1/n²) convergence.
Current partition coordinates and slice volumes:
i
[xᵢ₋₁, xᵢ]
Tag ξᵢ
f(ξᵢ)
mᵢ (inf)
Mᵢ (sup)
Slice Area Sᵢ
Mathematical Proof & Computation Report
How slice choices change a Riemann sum
Read the explanation
The canonical source integrates x squared from zero to two. Four equal slices have width zero point five and midpoint tags zero point two five, zero point seven five, one point two five and one point seven five. Their squared heights are zero point zero six two five, zero point five six two five, one point five six two five and three point zero six two five. Adding height times width gives two point six two five. The bars are proportional to these actual sampled heights. With those same four slices, left endpoint heights use zero, zero point five, one and one point five, giving sum one point seven five. Right endpoints give three point seven five. The exact integral is eight thirds, about two point six six seven, between those sums. The bracket follows monotonicity on this specific interval; other functions need their actual extrema. The source estimates extrema numerically inside each slice. For x squared on zero to two the midpoint error is two divided by three n squared. At four slices that is one twenty fourth, about zero point zero four one six seven. At eight it is one ninety sixth, about zero point zero one zero four two. Doubling n quarters the error for this smooth function and rule. The source’s random and custom tags, trapezoids and endpoint rules follow different constructions. Full exported slices preserve the numeric evidence rather than just a displayed total.