Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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