Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

A degenerate weak limit with persistent expectation

Example

For each n≥1, let Xn be defined on a probability space (Ωn,An,Pn) with Pn(Xn=n)=1/n and Pn(Xn=0)=1−1/n. Then Pn(∣Xn∣>ε)→0 for every ε>0, so Xn=oP(1) under the varying-space convention, and its asymptotic distribution is the point mass at 0, but EXn=1 for every n. Although each Xn is integrable, weak convergence alone does not imply convergence of expectations.

Facts & Assumptions

Given: The finite probability space and random variable specified for each n.

[F1]

Sigma-algebras: The power set of a set is a sigma-algebra.

[F2]

Measurable spaces and measurable sets: A measurable space is a set with a sigma-algebra.

[F3]

Measures on sigma-algebras: A measure is zero on the empty set and countably additive on pairwise disjoint measurable sets.

[F4]

Probability measures and probability spaces: A probability measure is a measure of total mass one.

[F5]

A measurable function between measurable spaces: A map is measurable if every measurable target set has a measurable preimage.

[F6]

Random elements and real random variables: A measurable map into R with its Borel sigma-algebra is a real random variable.

[F7]

Stochastic order and convergence notation for finite-dimensional random vectors: For random variables on probability spaces that may vary with n, Xn=oP(1) means Pn(∣Xn∣>ε)→0 for every ε>0; a common probability space is not required.

[F8]

Weak convergence of borel probability measures: Weak convergence is convergence of integrals for every bounded continuous real-valued test function.

[F9]

Convergence in distribution of random elements: Random elements converge in distribution when their laws converge weakly.

[F10]

Asymptotic distribution: An asymptotic distribution is the weak limit of the laws of a sequence of random elements.

[F11]

Expectation of a nonnegative or integrable random variable: The expectation of a nonnegative measurable random variable is its nonnegative Lebesgue integral.

[F12]

The integral of a nonnegative simple function: A nonnegative simple function integrates as the sum of its values times the measures of its disjoint level sets.

[F13]

Law or distribution of a random element: The law of a random element is its pushforward probability measure, PX(A)=P(X−1(A)).

[F14]

Change of variables for expectation: For a nonnegative measurable g(X), its expectation is the integral of g against the law of X.

[F15]

The Lebesgue integral is linear on L1(μ): The Lebesgue integral is linear on integrable functions.

Verification

1.1F1F2F3F4F5F6given

Set Ωn={0,1}, An=P(Ωn), Pn({1})=1/n, and Pn({0})=1−1/n. These masses are nonnegative and sum to one. Since the space has two points, every disjoint sequence of subsets has at most two nonempty members; the mass formula is countably additive and gives zero to the empty set by [F3]. Thus [F1], [F2], and [F4] make this a probability space for each n. The map Xn(0)=0, Xn(1)=n is measurable by [F5], hence a real random variable by [F6].

2.1F7givenalgebrastep 1.1

For any fixed ε>0, once n>ε the event {∣Xn∣>ε} is exactly {1}, so Pn(∣Xn∣>ε)=1/n→0. Therefore Xn=oP(1) by [F7].

2.2F3F4F8F9F10F11F12F13F14F15givenstep 1.1algebra

Fix bounded continuous f:R→R, set M=∥f∥∞, and put g=f+M≥0. By [F13], the law PXn assigns mass 1−1/n to 0 and 1/n to n. Its pushforward formula makes it countably additive because preimages of disjoint Borel sets are disjoint, and PXn(∅)=Pn(∅)=0; its total mass is Pn(Ωn)=1, so it is a probability measure by [F3]–[F4]. The point mass δ0 is also a Borel probability measure: it assigns zero to ∅, and in a disjoint family of Borel sets at most one set contains 0, while δ0(R)=1. Since ∣f∣≤M and 0≤g≤2M, every nonnegative simple minorant of ∣f∣ or g has simple integral at most the corresponding constant times μ(R), by finite additivity and [F12]. Taking the suprema in the nonnegative integral defining expectation [F11] gives ∫∣f∣ dμ≤M and ∫g dμ≤2M for either probability law μ∈{PXn,δ0}, so both functions are integrable. Thus [F15] gives ∫f dμ=∫(g−M) dμ=∫g dμ−M. The nonnegative simple function g(Xn) has expectation ∫g dPXn=(1−1/n)g(0)+(1/n)g(n) by [F11]–[F12] and [F14]; the same formula gives ∫g dδ0=g(0). Thus ∣∫f dPXn−∫f dδ0∣=∣Eg(Xn)−g(0)∣=∣g(n)−g(0)∣/n≤2M/n→0. By [F8], the laws converge weakly to δ0; by [F9]–[F10], the asymptotic distribution is δ0.

3.1F11F12step 2.1givenalgebra∎

The nonnegative simple-integral formula [F11]–[F12] gives EXn=(1/n)n+(1−1/n)0=1 for every n, while the limit variable 0 has expectation 0. For the finite check n=2, P2(X2=2)=1/2 and EX2=1, confirming the stated mass and expectation formulas.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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.