Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Dirichlet's test for improper integrals

Statement

Let f be locally Riemann integrable on [a,∞) and suppose its truncation primitive F(x)=∫axf is bounded. Each of the following conditions implies convergence of ∫a∞f(x)g(x) dx:

  1. g is nonnegative, nonincreasing, and g(x)→0.
  2. f is continuous, g is differentiable with g′ Riemann integrable on every compact subinterval, g(x)→0, and ∫a∞∣g′(x)∣ dx converges. Local integrability of g′ is a hypothesis and not a consequence of the last one: convergence of ∫a∞∣g′∣ presupposes only that ∣g′∣ is integrable on each compact subinterval, and a bounded derivative need not be Riemann integrable.

The reflected statements hold at −∞ and at finite singular endpoints, with monotonicity directed toward the singular end.

Facts & Assumptions

Given: A bounded truncation primitive F and one of the two multiplier hypotheses.

[L1]

Bonnet's second mean value theorem represents ∫uvfg using endpoint values of a monotone g and partial integrals of f (Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫abfg=f(a)∫aξg+f(b)∫ξbg).

[L2]

The improper Cauchy criterion reduces convergence to small remote tail integrals (Cauchy criterion for improper integrals).

[L3]

Proper integration by parts gives ∫uvfg=[Fg]uv−∫uvFg′ when F′=f (If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v).

[L4]

A bounded factor times an absolutely integrable function is absolutely integrable by comparison (Comparison tests for improper integrals, Absolute convergence implies improper convergence).

[L5]

If f is integrable on [a,b] and continuous at c, then its integral function F satisfies F′(c)=f(c); in particular an f continuous on the whole of [a,b] has F as a primitive there (The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive).

Proof

technique · cases
1.1

Choose M with ∣F∣≤M. In clause 1, apply [L1] on [u,v]. Every partial integral ∫uxf=F(x)−F(u) has absolute value at most 2M, so [L1, L2, assume-case first] ∣∫uvfg∣≤2M(g(u)+g(v))≤4Mg(u). This tends to zero as u→∞, and [L2] proves convergence.

1.2

In clause 2 f is continuous, hence integrable on every [u,v]⊆[a,∞), so [L5] gives F′=f there — the hypothesis [L3] requires and which boundedness of F does not supply. With g differentiable and g′ integrable on [u,v], [L3] gives the integration-by-parts identity. The boundary term F(R)g(R) tends to zero because F is bounded and g(R)→0. Also ∣Fg′∣≤M∣g′∣, so [L4] makes ∫Fg′ converge. Passing R→∞ proves convergence of ∫fg.

L3L4L5assume-case second
2.1

The two clauses are exhausted by steps 1.1–1.2. Reversing orientation proves the −∞ case. At a finite endpoint, use a primitive based at a fixed nonsingular point and take the corresponding one-sided limits; the same estimates are unchanged.

step 1.1step 1.2cases-exhaustive∎

Depends on

Used by

Dependency tree · two levels

75 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources