Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04
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.

Layer-cake formulas for random variables

Statement

Let (Ω,F,P) be a probability space.

  1. If X:Ω[0,+] is measurable, then E[X]=0P(X>t)dt, where the right-hand side may be +.
  2. If X is an integrable real random variable, then E[X]=0P(X>t)dt0P(X<t)dt.

Facts & Assumptions

Given: A probability space and a random variable X in the relevant clause.

[L1]

Expectation is integration against P, and X=X+X with X=X++X for real X (Expectation of a nonnegative or integrable random variable, The positive and negative parts of a function).

[L2]

The layer-cake formula with p=1 gives fdμ=0μ({f>t})dt for measurable f (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).

[L3]

The Lebesgue integral is linear on L1 (The Lebesgue integral is linear on L1(μ)).

Proof

technique · direct
1.1

Apply [L2] with f=X and p=1. Because X0, one has X=X and {X>t}={X>t}, so [L1] gives E[X]=0P(X>t)dt.

L1L2
2.1

If X is integrable and real, then X+,XL1 and [L1] gives X=X+X. By step 1.1 applied to X+ and X, E[X+]=0P(X>t)dt,E[X]=0P(X<t)dt. Subtracting these identities and using [L3] proves the second formula.

L1L3step 1.1

Depends on

Used by

Dependency tree · two levels

17 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