Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Randomizing across CDF jumps gives a uniform variable

Statement

Let Y be a real random variable with cumulative distribution function F(y)=P(Y≤y), and let U be independent of Y with the uniform Borel probability law on [0,1]. Write F(y−):=P(Y<y) and ΔF(y):=F(y)−F(y−)=P(Y=y). Then V:=F(Y−)+UΔF(Y) has the uniform distribution on [0,1], for arbitrary continuous, discrete, mixed, or singular laws of Y.

Facts & Assumptions

Given: A real random variable Y with law μ, its distribution function F, and an independent U whose law is uniform on [0,1].

[F1]

The distribution function is F(x)=μ((−∞,x]). Cumulative distribution function of a real random variable

[F2]

Inclusion of measurable sets implies monotonicity of their measures. Measures are monotone

[F3]

Measures are continuous along increasing sequences of measurable sets. Continuity from below for measures

[F4]

A measure finite on the first set of a decreasing sequence is continuous along that sequence. Continuity from above when one set has finite measure

[F5]

For nested measurable sets with finite smaller-set measure, the measure of their difference is the difference of their measures. Measure of a set difference when the smaller set has finite measure

[F6]

Every nonempty subset of R that is bounded above has a supremum. Complete ordered field (least-upper-bound property)

[F7]

Product sigma-algebras are generated by measurable rectangles. The product sigma-algebra and its finite iterates

[F9]

Sums and scalar multiples of measurable real functions are measurable, as are pointwise increasing limits. Closure properties of measurable functions used by the integral

[F10]

A real or extended-real function is measurable if all of its strict superlevel sets are measurable. Extended-real-valued measurable functions

[F11]

The Borel sigma-algebra is generated by open sets. The Borel sigma-algebra of a topological space

[A1]

U is independent of Y and has P(U≤u)=u for 0≤u≤1; this is the uniform randomization stipulated in the Statement. Independent random elements

Proof

All sequences below are indexed by integers n≥1.

1.1F1F2F3F4F5F6F10F11

By [F1] and [F2], F is nondecreasing. For each real c, {x:F(x)>c} is an upper set, hence is empty, all of R, or a ray with or without its finite endpoint; each such ray is Borel by [F11]. Thus every strict superlevel set is Borel, and [F10] makes F Borel-measurable. For each x, the sets (−∞,x+1/n] decrease to (−∞,x] and have finite measure, so [F4] gives right continuity. The sets (−∞,−n] decrease to ∅ and (−∞,n] increase to R, so [F3] and [F4] give the limits 0 and 1 at the two infinities. Also (−∞,x−1/n] increases to (−∞,x), so [F3] gives F(x−)=μ((−∞,x)); [F5] then gives F(x)−F(x−)=μ({x}).

2.1A1F7F8F9F12step 1.1

For every x, step 1.1 gives F(x−)=lim⁡nF(x−1/n). Each translate x↦F(x−1/n) is measurable because translation is continuous and [F8] preserves measurability under composition; [F9] makes their increasing limit F(x−) measurable. Thus ΔF=F−F(⋅−) is measurable by [F9]. Since Y is measurable, F(Y−) and ΔF(Y) are measurable. Fix a bijection e:Q→N supplied by [F12]. Each rational open rectangle is encoded by four natural numbers, and iterating the injection (a,b)↦2a(2b+1) shows there are only countably many such rectangles. Density of Q makes them a base of R2. Every Euclidean open set is therefore a countable union of rectangles in B(R)⊗B(R). Conversely the coordinate projections are continuous, and [F8] makes the inverse image of each Borel set under either projection Borel; finite intersections then show every Borel rectangle is Euclidean Borel. Thus the product Borel sigma-algebra equals B(R2). The pair (U,ΔF(Y)) is measurable into the product sigma-algebra because preimages of generating rectangles are intersections of coordinate preimages, hence it is measurable into B(R2). The map (u,d)↦ud is continuous, as ∣ud−u0d0∣≤∣u∣⋅∣d−d0∣+∣d0∣⋅∣u−u0∣ and ∣u∣ is bounded near u0; hence [F8] makes it Borel-measurable. Composing and then summing with F(Y−) proves V is measurable.

2.2A1F1F3F4F6step 1.1givenalgebra

Fix 0<u<1 and set Au:={x:F(x)≥u}. The upper-tail limit in step 1.1 makes Au nonempty, and the lower-tail limit makes it bounded below. Applying [F6] to −Au gives q:=−sup⁡(−Au)=inf⁡Au. For every n, the infimum property gives F(q+1/n)≥u, so right continuity from step 1.1 yields F(q)≥u. Since q−1/n<q and q is a lower bound for Au, F(q−1/n)<u; the sets (−∞,q−1/n] increase to (−∞,q), so [F3] and step 1.1 give F(q−)=lim⁡nF(q−1/n)≤u. Put a:=F(q−) and b:=F(q). If Y<q, then F(Y)≤a≤u, so V≤u; this event has probability a. If b>a, then P(Y=q)=b−a and, conditional on Y=q, V=a+U(b−a) is uniform on [a,b], contributing (u−a) to P(V≤u). If b=a, the inequalities force a=b=u and P(Y=q)=0, so this contribution is zero.

3.1A1F2F3F5step 1.1step 2.1step 2.2givenconstruct

For Y>q, monotonicity gives F(Y−)≥F(q)=b≥u. If F(Y−)>u, then V>u. If F(Y−)=u and ΔF(Y)>0, the event V≤u requires U=0, which has probability zero by [A1]. In the remaining case F(Y−)=F(Y)=u, put L:={y>q:F(y−)=F(y)=u}. By steps 1.1 and 2.1, both F and F(⋅−) are Borel-measurable, so L={y>q}∩{F(y−)=u}∩{F(y)=u} is Borel and therefore μ-measurable. If L is empty it contributes no mass. Otherwise let r=sup⁡L, allowing r=+∞ when L is unbounded. For every z with q<z<r, some y∈L has z<y, so monotonicity gives u=F(q)≤F(z)≤F(y−)=u and hence F(z)=u. If r<∞, define cn=q+(r−q)n/(n+1); if r=+∞, define cn=q+n. In either case cn↑r (with the limit interpreted as +∞ in the second case), and [F5] gives μ((q,cn])=F(cn)−F(q)=0. By [F3], μ((q,r))=0. If finite r belongs to L, its mass is ΔF(r)=0, so μ(L)=0. Thus Y>q contributes no probability, and step 2.2 yields P(V≤u)=a+(u−a)=u.

4.1F3F4step 3.1∎

For un=1/n with n≥2, the events {V≤un} decrease to {V≤0}; [F4] and the formula from step 3.1 give P(V≤0)=0. For vn=1−1/n with n≥2, the events {V≤vn} increase to {V<1}; [F3] and step 3.1 give P(V<1)=1. Finally 0≤V≤1 by its definition, so P(V≤1)=1. Thus P(V≤u)=u for all u∈[0,1], which is the uniform law.

Depends on

Used by

Dependency tree · two levels

57 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