Alphabeta Math
Pipeline-generated
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.

✓ 2 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Consistency and Limiting Distributions — Examples

1 · Prerequisites

2 · Summary

Four examples separate the main hypotheses and conclusions: weak convergence to a constant can coexist with persistent expectations; multiplying a vanishing deterministic rate by a tight random factor preserves convergence in probability and gives a root-n bounded sequence; observationally equivalent Bernoulli laws can carry different targets; and the Bernoulli sample proportion has an explicit finite-sample consistency bound, including at the parameter endpoints.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A tight factor times a vanishing factor

Example

Let (Ω,A,P) be the two-point probability space Ω={−1,1} with the power-set sigma-algebra and equal point masses, and set Z(ω)=ω. On this same space for each n≥1, put Zn=Z, an=n−1/2, and Rn=anZn. Then Zn=OP(1) and an=oP(1), so the finite-dimensional product rule gives Rn=oP(1). Moreover nRn=Zn=OP(1), the precise root-n boundedness assertion.

Facts & Assumptions

Given: The probability space and sequences in the example.

[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 equipped with a sigma-algebra.

[F3]

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

[F4]

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

[F5]

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

[F6]

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

[F7]

Stochastic order and convergence notation for finite-dimensional random vectors: Un=oP(1) means Pn(∣Un∣>ε)→0 for every ε>0; Un=OP(1) means that for every η>0 some M>0 has lim sup⁡nPn(∣Un∣>M)≤η.

[F8]

Finite-dimensional stochastic-order calculus and tightness: If Un=oP(1) and Vn=OP(1), then B(Un,Vn)=oP(1) for every fixed bilinear map with a global product norm bound.

Verification

1.1F1F2F3F4F5F6given

The power set on Ω is a sigma-algebra by [F1], hence gives a measurable space by [F2]. Assigning mass 1/2 to each singleton defines a measure: any pairwise disjoint sequence contains at most two nonempty sets, and the mass of their union is the sum of their masses. Its total mass is one, so it is a probability measure by [F3]–[F4]. The identity map Z is measurable because every preimage of a Borel set is a subset of Ω; thus it is a real random variable by [F5]–[F6].

1.2F7givenchoose

For every n, ∣Zn∣=1 everywhere, so choosing M=1 makes P(∣Zn∣>M)=0 and proves Zn=OP(1) by [F7]. For each ε>0, n−1/2≤ε for all sufficiently large n, so P(∣an∣>ε)=0 eventually; hence an=oP(1) by [F7].

2.1F1F7F8givenstep 1.1step 1.2algebra∎

The multiplication map B(u,v)=uv satisfies ∣B(u,v)∣=∣u∣∣v∣ for all real u,v, so it has the required bilinear norm bound with constant one. Each Rn=anZn is measurable because the power-set sigma-algebra on Ω contains every preimage. Thus [F8] applies to an=oP(1) and Zn=OP(1) and gives Rn=oP(1). The identity nRn=Zn then gives nRn=OP(1) from step 1.2. For the finite check n=4, R4 takes the values ±1/2 and 4R4 takes the values ±1.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

The Bernoulli sample mean

Example

Let X={0,1} with its power-set sigma-algebra. For p∈[0,1], define the Bernoulli law Pp({1})=p and Pp({0})=1−p, and use the estimand ψ(p)=p. Suppose a common probability space carries an IID sequence with one-observation law Pp. Under its IID sample-size experiments, the estimator Tn(x1,…,xn)=n−1∑i=1nxi is the sample proportion. It satisfies the finite-sample bound Pp⊗n(∣Tn−p∣≥ε)≤p(1−p)nε2≤14nε2,ε>0, so it is consistent, including at p=0 and p=1.

Facts & Assumptions

Given: p∈[0,1], the two-point observation space, the displayed Bernoulli masses, and a common probability space carrying an IID sequence with law Pp.

[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 together with a sigma-algebra.

[F3]

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

[F4]

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

[F5]

Statistical experiments: An experiment is a measurable observation space and a parameter-indexed family of probability measures on it.

[F6]

Parametric statistical models: The model is the parameter map p↦Pp.

[F7]

Estimands on a statistical model: An estimand is a specified function from the parameter set to a target set.

[F8]

Estimator sequences in IID experiments: Under IID sampling, the size-n law is Pp⊗n and an estimator is a measurable map on Xn.

[F9]

Partial sums, row sums and sample means: For real random variables, X‾n=n−1∑i=1nXi is the sample mean.

[F10]

Identical distribution and IID families: IID means identical laws and mutual independence.

[F11]

Independent random elements have product joint law: A finite independent family has joint law equal to the product of its marginal laws.

[F12]

The integral of a nonnegative simple function: The integral of a nonnegative simple function is the sum of its values times the measures of the corresponding disjoint level sets.

[F13]

Moments, variance, and covariance on a probability space: For square-integrable X, Var⁡(X)=E[(X−EX)2].

[F14]

IID finite-variance weak law: For IID square-integrable real variables with variance σ2, P(∣X‾n−EX1∣≥ε)≤σ2/(nε2).

[F15]

Consistency of the IID sample mean under a finite first moment: An IID real sample with finite first absolute moment has a sample mean consistent in probability for its mean.

[F16]

Pointwise consistency in probability: Consistency at p means the probability of an estimation error greater than each fixed ε>0 tends to zero under Pp⊗n.

[F17]

The product sigma-algebra and its finite iterates: The finite product sigma-algebra is generated by measurable rectangles, so its coordinate projections are measurable.

[F18]

Arithmetic and lattice operations preserve measurability whenever they are defined: Pointwise sums and real scalar multiples of measurable real-valued functions are measurable whenever defined.

Verification

1.1F1F2F3F4F5F6F7given

The power set of {0,1} is a sigma-algebra by [F1], so it defines a measurable space by [F2]. Because 0≤p≤1, the two singleton masses are nonnegative and sum to one. For any pairwise disjoint sequence of subsets, each of 0 and 1 occurs in at most one set, so the mass formula is countably additive and gives zero to the empty set by [F3]. Thus Pp is a probability measure by [F4], and the family is a statistical experiment with model map p↦Pp and target ψ(p)=p by [F5, F6, F7].

1.2F12F13givenalgebra

For X∼Pp, X=1{1} and X2=X, so [F12] gives EpX=p and EpX2=p. By [F13], Var⁡p(X)=p−p2=p(1−p), which is finite for all p∈[0,1].

2.1F8F9F10F11F14F17F18step 1.2givenalgebra

By [F17], each coordinate projection on Xn is measurable; [F18] makes their finite sum and scalar multiple Tn measurable, as required by [F8]. The displayed map is the sample mean of [F9]. The given common sequence satisfies the IID hypothesis of [F14] by [F10], and [F11] identifies the law of its first n observations with Pp⊗n. Applying [F14] with σ2=p(1−p) from step 1.2 and transferring through this joint-law identity gives Pp⊗n(∣Tn−p∣≥ε)≤p(1−p)/(nε2). Since p(1−p)=1/4−(p−1/2)2≤1/4, this is at most 1/(4nε2).

3.1F8F11F15F16step 1.2step 2.1givenalgebra∎

For fixed ε>0, the bound in step 2.1 tends to zero, so [F16] gives consistency; this is also the special case of [F15]. By [F8] and [F11], at p=0 and p=1 the product law assigns probability one to the all-zero and all-one samples respectively, so Tn=p almost surely at each endpoint. For the finite check n=2,p=1/2, the same rectangle formula gives mass 1/4 to each ordered pair, hence T2 has masses 1/4,1/2,1/4 at 0,1/2,1; the probability of error at least 1/2 is 1/2, matching the bound in step 2.1.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The same Bernoulli law with two different targets

Example

Let X={0,1} with its power-set sigma-algebra and Θ=[0,1]2. For (u,v)∈Θ, let P(u,v) be the Bernoulli law with P(u,v)({1})=u and P(u,v)({0})=1−u, and take the target ψ(u,v)=v with its usual metric. The two parameters θ0=(1/2,0) and θ1=(1/2,1) have the same observation law and different target values. Thus the target is not identifiable and no estimator sequence is consistent in probability at both parameters.

Facts & Assumptions

Given: The finite observation space, model family, target and two parameters in the example.

[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 equipped with a sigma-algebra.

[F3]

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

[F4]

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

[F5]

Statistical experiments: An experiment is a measurable observation space and a parameter-indexed family of probability measures on it.

[F6]

Parametric statistical models: A parametric model is the map from parameter labels to their sampling laws; it need not be injective.

[F7]

Estimands on a statistical model: An estimand is a specified target-valued function on the parameter set.

[F8]

Observational equivalence: Two parameters are observationally equivalent exactly when their probability measures on the observation space are equal.

[F9]

Identifiability of an estimand: An estimand is identifiable when observationally equivalent parameters have equal target values.

[F11]

Estimator sequences in IID experiments: An estimator sequence is a measurable map on each finite IID product sample space.

[F12]

Pointwise consistency in probability: Pointwise consistency at a parameter means the estimation-error probability under its IID sample laws tends to zero for every positive tolerance.

[F13]

Nonidentifiability precludes simultaneous consistency: If two observationally equivalent parameters have distinct targets in a metric space, no estimator sequence can be consistent at both.

[F14]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: The finite product measure assigns a measurable rectangle the product of its factor probabilities.

Verification

1.1F1F2F3F4F5F6F7given

The power set on X is a sigma-algebra by [F1], so (X,P(X)) is a measurable space by [F2]. For every u∈[0,1], the two singleton masses u and 1−u are nonnegative and sum to one. Any disjoint sequence of subsets of X has at most two nonempty members, so the assignment is countably additive and gives zero to the empty set by [F3]; hence each P(u,v) is a probability measure by [F4]. This defines the experiment and model in [F5]–[F6], and ψ is the target in [F7].

1.2F7F8F9F10givenalgebra

At θ0=(1/2,0) and θ1=(1/2,1), both laws assign probability 1/2 to each singleton and therefore are equal as measures on the power set. The target values are 0 and 1, whose distance is 1>0. Thus [F8] makes the parameters observationally equivalent, while [F7] and [F9] show the target is not identifiable.

2.1F11F12F13F14givenstep 1.2∎

By [F11]–[F12], estimators are measurable maps on the IID sample spaces and consistency is pointwise under those sample laws. Apply [F13] to the pair from step 1.2: no estimator sequence is consistent in probability at both θ0 and θ1. For the finite check at sample size n=2, [F14] gives mass (1/2)2=1/4 to each ordered pair under both product laws, confirming that the observation distributions remain identical.

Sources