Study guide

2.1 Riemann Sums and the Fundamental Theorem of Calculus

GRE Subject Test: Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Single-Variable Differential Calculus

1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves

2 Chapter 2: Single-Variable Integral Calculus

2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria

3 Chapter 3: Sequences, Infinite Series & Power Series

3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds

4 Chapter 4: Multivariable Differential Calculus

4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers

5 Chapter 5: Multivariable Integration & Vector Calculus

5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem

6 Chapter 6: Ordinary Differential Equations

6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters

7 Chapter 7: Elementary Algebra & Number Theory

7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient

8 Chapter 8: Linear Algebra: Vector Spaces & Transformations

8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis

9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory

9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem

10 Chapter 10: Abstract Algebra: Groups, Rings & Fields

10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields

11 Chapter 11: Introductory Real Analysis

11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

12 Chapter 12: Complex Analysis

12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem

13 Chapter 13: Topology, Geometry & Numerical Analysis

13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature

14 Chapter 14: Probability, Statistics & Discrete Mathematics

14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions

2.1 Riemann Sums and the Fundamental Theorem of Calculus

Key Takeaways Explain This Topic AI

A bounded function f on [a, b] is Riemann integrable if and only if for every ε > 0, there exists a partition P such that U(f, P) - L(f, P) < ε; by Lebesgue's criterion, this is equivalent to the set of discontinuities having measure zero.

The Fundamental Theorem of Calculus Part 1 establishes that F(x) = ∫_a^x f(t) dt is continuous on [a, b] and differentiable with F'(x) = f(x) at every continuity point of f.

Leibniz's Integral Rule for variable limits dictates d/dx ∫_{u(x)}^{v(x)} f(t) dt = f(v(x)) v'(x) - f(u(x)) u'(x), requiring the multivariable chain rule when f explicitly depends on x.

The Mean Value Theorem for Definite Integrals guarantees that for a continuous function on [a, b], there exists c in (a, b) such that f(c) = 1/(b - a) ∫_a^b f(x) dx.

GRE problems frequently evaluate limits of Riemann sums by converting them to definite integrals via lim_{n -> ∞} 1/n ∑_{k=1}^n g(k/n) = ∫_0^1 g(x) dx.

Last updated: September 2026

2.1 Riemann Sums and the Fundamental Theorem of Calculus

Riemann integration forms the theoretical bedrock of accumulation and area in single-variable calculus. On the GRE Mathematics Subject Test, questions in this domain evaluate both theoretical real analysis principles (Darboux sums, partition refinements, and Lebesgue's integrability theorem) and advanced computational techniques (Leibniz differentiation of parameter-dependent integrals and summation limit conversions). Navigating this section successfully requires understanding how continuity, integrability, and differentiability interlock.

Partitions, Darboux Sums, and Integrability

Let [ a , b ] ⊂ R [a, b] \subset \mathbb{R} [ a , b ] ⊂ R be a closed, bounded interval. A partition P P P of [ a , b ] [a, b] [ a , b ] is a finite ordered set of points: P = { a = x 0 < x 1 < x 2 < ⋯ < x n − 1 < x n = b } P = \{a = x_0 < x_1 < x_2 < \dots < x_{n-1} < x_n = b\} P = { a = x 0 ​ < x 1 ​ < x 2 ​ < ⋯ < x n − 1 ​ < x n ​ = b }

The width of the i i i -th subinterval [ x i − 1 , x i ] [x_{i-1}, x_i] [ x i − 1 ​ , x i ​ ] is denoted Δ x i = x i − x i − 1 \Delta x_i = x_i - x_{i-1} Δ x i ​ = x i ​ − x i − 1 ​ , and the mesh (or norm) of the partition is ∥ P ∥ = max ⁡ 1 ≤ i ≤ n Δ x i \|P\| = \max_{1 \le i \le n} \Delta x_i ∥ P ∥ = max 1 ≤ i ≤ n ​ Δ x i ​ .

Let f : [ a , b ] → R f: [a, b] \to \mathbb{R} f : [ a , b ] → R be a bounded function. On each subinterval [ x i − 1 , x i ] [x_{i-1}, x_i] [ x i − 1 ​ , x i ​ ] , define the local infimum and supremum: m i = inf ⁡ x ∈ [ x i − 1 , x i ] f ( x ) , M i = sup ⁡ x ∈ [ x i − 1 , x i ] f ( x ) m_i = \inf_{x \in [x_{i-1}, x_i]} f(x), \quad M_i = \sup_{x \in [x_{i-1}, x_i]} f(x) m i ​ = x ∈ [ x i − 1 ​ , x i ​ ] in f ​ f ( x ) , M i ​ = x ∈ [ x i − 1 ​ , x i ​ ] sup ​ f ( x )

The Lower Darboux Sum L ( f , P ) L(f, P) L ( f , P ) and Upper Darboux Sum U ( f , P ) U(f, P) U ( f , P ) are defined by: L ( f , P ) = ∑ i = 1 n m i Δ x i , U ( f , P ) = ∑ i = 1 n M i Δ x i L(f, P) = \sum_{i=1}^n m_i \Delta x_i, \quad U(f, P) = \sum_{i=1}^n M_i \Delta x_i L ( f , P ) = i = 1 ∑ n ​ m i ​ Δ x i ​ , U ( f , P ) = i = 1 ∑ n ​ M i ​ Δ x i ​

For any partition P P P , m ( b − a ) ≤ L ( f , P ) ≤ U ( f , P ) ≤ M ( b − a ) m(b - a) \le L(f, P) \le U(f, P) \le M(b - a) m ( b − a ) ≤ L ( f , P ) ≤ U ( f , P ) ≤ M ( b − a ) , where m = inf ⁡ [ a , b ] f m = \inf_{[a, b]} f m = in f [ a , b ] ​ f and M = sup ⁡ [ a , b ] f M = \sup_{[a, b]} f M = sup [ a , b ] ​ f . A partition P ′ P' P ′ is a refinement of P P P if P ⊆ P ′ P \subseteq P' P ⊆ P ′ . Adding refinement points can only increase lower sums and decrease upper sums: L ( f , P ) ≤ L ( f , P ′ ) ≤ U ( f , P ′ ) ≤ U ( f , P ) L(f, P) \le L(f, P') \le U(f, P') \le U(f, P) L ( f , P ) ≤ L ( f , P ′ ) ≤ U ( f , P ′ ) ≤ U ( f , P )

Consequently, for any two arbitrary partitions P 1 P_1 P 1 ​ and P 2 P_2 P 2 ​ , L ( f , P 1 ) ≤ U ( f , P 2 ) L(f, P_1) \le U(f, P_2) L ( f , P 1 ​ ) ≤ U ( f , P 2 ​ ) .

The lower Darboux integral and upper Darboux integral are defined respectively by: ∫ a b ‾ f ( x ) d x = sup ⁡ P L ( f , P ) , ∫ a b ‾ f ( x ) d x = inf ⁡ P U ( f , P ) \underline{\int_a^b} f(x)\,dx = \sup_P L(f, P), \quad \overline{\int_a^b} f(x)\,dx = \inf_P U(f, P) ∫ a b ​ ​ f ( x ) d x = P sup ​ L ( f , P ) , ∫ a b ​ ​ f ( x ) d x = P in f ​ U ( f , P )

A bounded function f f f is defined to be Riemann integrable on [ a , b ] [a, b] [ a , b ] (denoted f ∈ R [ a , b ] f \in \mathcal{R}[a, b] f ∈ R [ a , b ] ) if and only if: ∫ a b ‾ f ( x ) d x = ∫ a b ‾ f ( x ) d x \underline{\int_a^b} f(x)\,dx = \overline{\int_a^b} f(x)\,dx ∫ a b ​ ​ f ( x ) d x = ∫ a b ​ ​ f ( x ) d x

When this equality holds, the common value is the definite Riemann integral, denoted ∫ a b f ( x ) d x \int_a^b f(x)\,dx ∫ a b ​ f ( x ) d x .

The Darboux Integrability Criterion

A bounded function f f f is Riemann integrable on [ a , b ] [a, b] [ a , b ] if and only if for every ε > 0 \varepsilon > 0 ε > 0 , there exists a partition P P P of [ a , b ] [a, b] [ a , b ] such that: U ( f , P ) − L ( f , P ) = ∑ i = 1 n ( M i − m i ) Δ x i < ε U(f, P) - L(f, P) = \sum_{i=1}^n (M_i - m_i) \Delta x_i < \varepsilon U ( f , P ) − L ( f , P ) = i = 1 ∑ n ​ ( M i ​ − m i ​ ) Δ x i ​ < ε

Lebesgue's Criterion for Riemann Integrability

A bounded real-valued function f f f on [ a , b ] [a, b] [ a , b ] is Riemann integrable if and only if its set of discontinuities D f = { x ∈ [ a , b ] : f is discontinuous at x } D_f = \{x \in [a, b] : f \text{ is discontinuous at } x\} D f ​ = { x ∈ [ a , b ] : f is discontinuous at x } has Lebesgue measure zero .

Every continuous function on [ a , b ] [a, b] [ a , b ] is Riemann integrable.

Every monotonic function on [ a , b ] [a, b] [ a , b ] has at most countably many jump discontinuities (which has measure zero) and is therefore Riemann integrable.

Functions with countably many discontinuities (such as Thomae's popcorn function) are Riemann integrable.

The Dirichlet indicator function 1 Q \mathbf{1}_{\mathbb{Q}} 1 Q ​ is discontinuous at every point in [ a , b ] [a, b] [ a , b ] . Because R ∖ Q \mathbb{R} \setminus \mathbb{Q} R ∖ Q and Q \mathbb{Q} Q are both dense, U ( f , P ) = b − a U(f, P) = b - a U ( f , P ) = b − a and L ( f , P ) = 0 L(f, P) = 0 L ( f , P ) = 0 for every partition P P P , making it not Riemann integrable.

Fundamental Properties of the Definite Integral

For any functions f , g ∈ R [ a , b ] f, g \in \mathcal{R}[a, b] f , g ∈ R [ a , b ] and constants α , β ∈ R \alpha, \beta \in \mathbb{R} α , β ∈ R :

Linearity : ∫ a b ( α f ( x ) + β g ( x ) ) d x = α ∫ a b f ( x ) d x + β ∫ a b g ( x ) d x \int_a^b (\alpha f(x) + \beta g(x))\,dx = \alpha \int_a^b f(x)\,dx + \beta \int_a^b g(x)\,dx ∫ a b ​ ( α f ( x ) + β g ( x )) d x = α ∫ a b ​ f ( x ) d x + β ∫ a b ​ g ( x ) d x .

Interval Additivity : For any c ∈ [ a , b ] c \in [a, b] c ∈ [ a , b ] , ∫ a b f ( x ) d x = ∫ a c f ( x ) d x + ∫ c b f ( x ) d x \int_a^b f(x)\,dx = \int_a^c f(x)\,dx + \int_c^b f(x)\,dx ∫ a b ​ f ( x ) d x = ∫ a c ​ f ( x ) d x + ∫ c b ​ f ( x ) d x .

Monotonicity : If f ( x ) ≤ g ( x ) f(x) \le g(x) f ( x ) ≤ g ( x ) for all x ∈ [ a , b ] x \in [a, b] x ∈ [ a , b ] , then ∫ a b f ( x ) d x ≤ ∫ a b g ( x ) d x \int_a^b f(x)\,dx \le \int_a^b g(x)\,dx ∫ a b ​ f ( x ) d x ≤ ∫ a b ​ g ( x ) d x .

Triangle Inequality : ∣ ∫ a b f ( x ) d x ∣ ≤ ∫ a b ∣ f ( x ) ∣ d x \left| \int_a^b f(x)\,dx \right| \le \int_a^b |f(x)|\,dx ​ ∫ a b ​ f ( x ) d x ​ ≤ ∫ a b ​ ∣ f ( x ) ∣ d x .

  • The Fundamental Theorem of Calculus
  • FTC Part 1: Differentiation of Accumulation Functions

Let f ∈ R [ a , b ] f \in \mathcal{R}[a, b] f ∈ R [ a , b ] and define the accumulation function F : [ a , b ] → R F: [a, b] \to \mathbb{R} F : [ a , b ] → R by: F ( x ) = ∫ a x f ( t ) d t F(x) = \int_a^x f(t)\,dt F ( x ) = ∫ a x ​ f ( t ) d t

F F F is uniformly continuous on [ a , b ] [a, b] [ a , b ] . If ∣ f ( t ) ∣ ≤ M |f(t)| \le M ∣ f ( t ) ∣ ≤ M , then ∣ F ( x ) − F ( y ) ∣ ≤ M ∣ x − y ∣ |F(x) - F(y)| \le M|x - y| ∣ F ( x ) − F ( y ) ∣ ≤ M ∣ x − y ∣ , proving F F F is Lipschitz continuous.

If f f f is continuous at a point x 0 ∈ ( a , b ) x_0 \in (a, b) x 0 ​ ∈ ( a , b ) , then F F F is differentiable at x 0 x_0 x 0 ​ , and F ′ ( x 0 ) = f ( x 0 ) F'(x_0) = f(x_0) F ′ ( x 0 ​ ) = f ( x 0 ​ ) .

Leibniz Integral Rule (Variable Limits and Parameters)

When the integration limits are differentiable functions u ( x ) u(x) u ( x ) and v ( x ) v(x) v ( x ) , applying the chain rule to F ( x ) = ∫ u ( x ) v ( x ) f ( t ) d t F(x) = \int_{u(x)}^{v(x)} f(t)\,dt F ( x ) = ∫ u ( x ) v ( x ) ​ f ( t ) d t yields: d d x ∫ u ( x ) v ( x ) f ( t ) d t = f ( v ( x ) ) ⋅ v ′ ( x ) − f ( u ( x ) ) ⋅ u ′ ( x ) \frac{d}{dx} \int_{u(x)}^{v(x)} f(t)\,dt = f(v(x)) \cdot v'(x) - f(u(x)) \cdot u'(x) d x d ​ ∫ u ( x ) v ( x ) ​ f ( t ) d t = f ( v ( x )) ⋅ v ′ ( x ) − f ( u ( x )) ⋅ u ′ ( x )

If the integrand also depends explicitly on x x x , Leibniz's general formula incorporates differentiation under the integral sign: d d x ∫ u ( x ) v ( x ) f ( x , t ) d t = f ( x , v ( x ) ) v ′ ( x ) − f ( x , u ( x ) ) u ′ ( x ) + ∫ u ( x ) v ( x ) ∂ f ∂ x ( x , t ) d t \frac{d}{dx} \int_{u(x)}^{v(x)} f(x, t)\,dt = f(x, v(x)) v'(x) - f(x, u(x)) u'(x) + \int_{u(x)}^{v(x)} \frac{\partial f}{\partial x}(x, t)\,dt d x d ​ ∫ u ( x ) v ( x ) ​ f ( x , t ) d t = f ( x , v ( x )) v ′ ( x ) − f ( x , u ( x )) u ′ ( x ) + ∫ u ( x ) v ( x ) ​ ∂ x ∂ f ​ ( x , t ) d t

FTC Part 2: The Evaluation Theorem

If f : [ a , b ] → R f: [a, b] \to \mathbb{R} f : [ a , b ] → R is continuous on [ a , b ] [a, b] [ a , b ] and F F F is any antiderivative of f f f on [ a , b ] [a, b] [ a , b ] (meaning F ′ ( x ) = f ( x ) F'(x) = f(x) F ′ ( x ) = f ( x ) for all x ∈ ( a , b ) x \in (a, b) x ∈ ( a , b ) ), then: ∫ a b f ( x ) d x = F ( b ) − F ( a ) = [ F ( x ) ] a b \int_a^b f(x)\,dx = F(b) - F(a) = [F(x)]_a^b ∫ a b ​ f ( x ) d x = F ( b ) − F ( a ) = [ F ( x ) ] a b ​

The Mean Value Theorem for Definite Integrals

If f : [ a , b ] → R f: [a, b] \to \mathbb{R} f : [ a , b ] → R is continuous, there exists at least one point c ∈ ( a , b ) c \in (a, b) c ∈ ( a , b ) such that: f ( c ) = 1 b − a ∫ a b f ( x ) d x f(c) = \frac{1}{b - a} \int_a^b f(x)\,dx f ( c ) = b − a 1 ​ ∫ a b ​ f ( x ) d x

The value f avg = 1 b − a ∫ a b f ( x ) d x f_{\text{avg}} = \frac{1}{b - a} \int_a^b f(x)\,dx f avg ​ = b − a 1 ​ ∫ a b ​ f ( x ) d x defines the average value of f f f on [ a , b ] [a, b] [ a , b ] .

GRE Exam Pattern: Limits of Riemann Sums

A classic GRE Subject Test question presents a discrete limit of sums and requires converting it into an equivalent Riemann integral over [ 0 , 1 ] [0, 1] [ 0 , 1 ] : lim ⁡ n → ∞ 1 n ∑ k = 1 n g ( k n ) = ∫ 0 1 g ( x ) d x \lim_{n \to \infty} \frac{1}{n} \sum_{k=1}^n g\left(\frac{k}{n}\right) = \int_0^1 g(x)\,dx n → ∞ lim ​ n 1 ​ k = 1 ∑ n ​ g ( n k ​ ) = ∫ 0 1 ​ g ( x ) d x

To recognize this structure:

Factor out 1 n \frac{1}{n} n 1 ​ from the general term to represent the differential d x dx d x .

Group the remaining expression in terms of k n \frac{k}{n} n k ​ , which corresponds to the continuous variable x x x .

Set the limits of integration to 0 0 0 and 1 1 1 (for k = 1 , … , n k = 1, \dots, n k = 1 , … , n ) and evaluate the resulting definite integral.

Integrability Classes Comparison

Function Class Hypothesis on [ a , b ] [a, b] [ a , b ] Riemann Integrable? Analytical Justification

Continuous f ∈ C [ a , b ] f \in C[a, b] f ∈ C [ a , b ] Always Uniformly continuous by Heine-Cantor; U − L < ε U - L < \varepsilon U − L < ε

Monotone Monotonically increasing or decreasing Always Discontinuities are at most countable; measure zero

Piecewise Continuous Finitely many jump discontinuities Always Discontinuities form a finite set (measure zero)

Thomae Function f ( p / q ) = 1 / q f(p/q) = 1/q f ( p / q ) = 1/ q , f ( x ) = 0 f(x) = 0 f ( x ) = 0 on irrationals Always Continuous on irrationals; discontinuous on rationals (measure zero)

Dirichlet Function f = 1 f = 1 f = 1 on Q \mathbb{Q} Q , f = 0 f = 0 f = 0 on R ∖ Q \mathbb{R} \setminus \mathbb{Q} R ∖ Q Never U ( f , P ) = b − a U(f, P) = b - a U ( f , P ) = b − a while L ( f , P ) = 0 L(f, P) = 0 L ( f , P ) = 0 for all P P P

Worked Problem: Leibniz Rule with Variable Limits

Problem: Find G ′ ( 1 ) G'(1) G ′ ( 1 ) where G ( x ) = ∫ x x 2 1 + t 3 d t G(x) = \int_{x}^{x^2} \sqrt{1 + t^3}\,dt G ( x ) = ∫ x x 2 ​ 1 + t 3 ​ d t . Solution: Here f ( t ) = 1 + t 3 f(t) = \sqrt{1 + t^3} f ( t ) = 1 + t 3 ​ , lower limit u ( x ) = x u(x) = x u ( x ) = x , and upper limit v ( x ) = x 2 v(x) = x^2 v ( x ) = x 2 . By Leibniz's rule: G ′ ( x ) = f ( v ( x ) ) v ′ ( x ) − f ( u ( x ) ) u ′ ( x ) = 1 + ( x 2 ) 3 ⋅ ( 2 x ) − 1 + x 3 ⋅ ( 1 ) G'(x) = f(v(x)) v'(x) - f(u(x)) u'(x) = \sqrt{1 + (x^2)^3} \cdot (2x) - \sqrt{1 + x^3} \cdot (1) G ′ ( x ) = f ( v ( x )) v ′ ( x ) − f ( u ( x )) u ′ ( x ) = 1 + ( x 2 ) 3 ​ ⋅ ( 2 x ) − 1 + x 3 ​ ⋅ ( 1 ) G ′ ( x ) = 2 x 1 + x 6 − 1 + x 3 G'(x) = 2x \sqrt{1 + x^6} - \sqrt{1 + x^3} G ′ ( x ) = 2 x 1 + x 6 ​ − 1 + x 3 ​

Evaluating at x = 1 x = 1 x = 1 : G ′ ( 1 ) = 2 ( 1 ) 1 + 1 6 − 1 + 1 3 = 2 2 − 2 = 2 G'(1) = 2(1) \sqrt{1 + 1^6} - \sqrt{1 + 1^3} = 2\sqrt{2} - \sqrt{2} = \sqrt{2} G ′ ( 1 ) = 2 ( 1 ) 1 + 1 6 ​ − 1 + 1 3 ​ = 2 2 ​ − 2 ​ = 2 ​

Common GRE Traps & Pitfalls

Omission of the inner derivative: When applying Leibniz's rule to ∫ 0 x 2 e − t 2 d t \int_0^{x^2} e^{-t^2}\,dt ∫ 0 x 2 ​ e − t 2 d t , writing e − x 4 e^{-x^4} e − x 4 instead of 2 x e − x 4 2x e^{-x^4} 2 x e − x 4 overlooks the chain rule factor v ′ ( x ) v'(x) v ′ ( x ) .

Blindly applying FTC Part 2 across singularities: Evaluating ∫ − 1 1 1 x 2 d x = [ − 1 x ] − 1 1 = − 1 − ( 1 ) = − 2 \int_{-1}^1 \frac{1}{x^2}\,dx = \left[-\frac{1}{x}\right]_{-1}^1 = -1 - (1) = -2 ∫ − 1 1 ​ x 2 1 ​ d x = [ − x 1 ​ ] − 1 1 ​ = − 1 − ( 1 ) = − 2 produces a negative value for a strictly positive function because the integrand has an infinite discontinuity at x = 0 x = 0 x = 0 , violating the continuity hypothesis of FTC.

Overlooking integrand variable dependence: When differentiating ∫ 0 x x cos ⁡ ( t ) d t \int_0^x x \cos(t)\,dt ∫ 0 x ​ x cos ( t ) d t , one must either pull x x x outside the integral first or apply the partial derivative term in Leibniz's general rule.

Loading diagram... Darboux Integrability and the Fundamental Theorem of Calculus Architecture