Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

Convergence in probability is metrized by d0

Statement

Durrett's exercise gives the equivalent bounded-transform metric with integrand t/(1+t); the proof below establishes the min⁡(1,t) variant.

The formula d0([X],[Y])=E[min⁡(1,∣X−Y∣)] is a metric on real random variables modulo almost-sure equality. Moreover, d0([Xn],[X])→0⟺Xn→X in probability.

Facts & Assumptions

Given: Real random variables X,Y,Z, and a sequence (Xn), on one probability space.

[L1]

The proposed formula for d0 on almost-sure classes is E[min⁡(1,∣X−Y∣)] (A metric for convergence in probability). Expectation of integrable random variables is unchanged by almost-sure replacement (Expectation depends only on the almost-everywhere class).

[L2]

A nonnegative measurable function has integral zero exactly when it is zero almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[L3]

Convergence in probability means that every fixed positive tail probability tends to zero (Convergence in probability).

Proof

technique · direct
1.1L1algebra

The displayed integrand is measurable, nonnegative and bounded by 1, so its expectation is finite. Almost-sure replacement of either representative leaves the integrand unchanged almost surely and hence leaves its expectation unchanged by [L1]. Symmetry is immediate. The real triangle inequality and min⁡(1,a+b)≤min⁡(1,a)+min⁡(1,b) for a,b≥0 give min⁡(1,∣X−Z∣)≤min⁡(1,∣X−Y∣)+min⁡(1,∣Y−Z∣) pointwise. Taking expectations gives the triangle inequality.

1.2algebra

For 0<ε≤1, on {∣Xn−X∣>ε} the integrand is at least ε, while on its complement it is at most ε and everywhere it is at most 1. Splitting the expectation over those events yields εP(∣Xn−X∣>ε)≤d0([Xn],[X])≤ε+P(∣Xn−X∣>ε).

2.1L2step 1.1

If d0([X],[Y])=0, [L2] makes min⁡(1,∣X−Y∣)=0 almost surely, hence X=Y almost surely. Conversely, almost-sure equality makes the expectation zero. Thus d0 is a metric on almost-sure classes.

3.1step 1.2L3∎

If d0([Xn],[X])→0, the first inequality gives convergence in probability for each 0<ε≤1; for a larger threshold, bound its tail event by the tail event at threshold 1. Conversely, convergence in probability and the second inequality give lim sup⁡nd0([Xn],[X])≤ε for every 0<ε≤1, hence d0([Xn],[X])→0.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by A metric for convergence in probability.

Dependency tree · two levels

15 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