Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 nonidentical Bernoulli weak law

Example

Assume countable choice and dependent choice. Let independent Xk be Bernoulli(pk) with pk=1/4 for odd k and pk=3/4 for even k. Then for Sn=k=1nXk, ESnESnn2=316n,Sn/n1/2in probability. Thus a common distribution is not required.

Facts & Assumptions

[F1]

Chebyshev weak law for uncorrelated arrays: For each n1, let Xn,1,,Xn,rn be square-integrable real random variables on one probability space, pairwise uncorrelated within the row, where rn0 is finite. Set Sn=k=1rnXn,k and let bn>0 be deterministic. If vn:=bn2k=1rnVar(Xn,k)0, then (SnESn)/bn0 in L2 and in probability. More precisely, its second moment is vn, and its probability of absolute value at least ε>0 is at most vn/ε2. No independence between rows is required.

[F2]

Coordinate random elements of a countable product are independent: Under the measure of thm-countable-product-of-probability-spaces, the coordinate maps Xn(x)=xn have laws μn and are independent.

[F3]

Assuming countable and dependent choice, countable products of arbitrary probability spaces: Assume countable choice and dependent choice. For probability spaces (En,En,μn)nN there is a unique probability measure μ on CN such that, for every finite F, its F-coordinate marginal is nFμn.

[F4]

A Bernoulli(p) variable has mean p and variance p(1p); a binomial(n,p) variable has mean np and variance np(1p): If X is Bernoulli(p), then E[X]=p and Var(X)=p(1p). If S is binomial(n,p), then E[S]=np,Var(S)=np(1p). These formulas include p=0, p=1, and n=0.

[F5]

Expectations factor over finite products of independent random variables: Let n1, let X0,,Xn1 be independent real random variables on a common probability space, and let gi:RR be Borel measurable for each i<n. 1. If every gi is nonnegative, then E[i<ngi(Xi)]=i<nE[gi(Xi)] in [0,+]. 2. If every gi(Xi) is integrable, then i<ngi(Xi) is integrable and the same factorization holds in R.

Verification

Given: The construction and assumptions above.

1.1

Under countable choice and dependent choice, take the countable product of the two-point Bernoulli probability spaces with the prescribed pk (shift the product index by one). Its coordinates are independent with the required laws. Each has mean pk and variance 3/16. Independence gives zero mixed centered moments, hence zero off-diagonal covariances.

F3F2F4givenF5
2.1

The row weak law with the first n entries and normalizer n gives centered second moment n(3/16)/n2=3/(16n) and convergence in probability to zero. Meanwhile ESn/n=1/2 for even n and 1/21/(4n) for odd n, including n=1. For any ε>0 the deterministic error is eventually below ε/2, so the probability of Sn/n1/2>ε is at most the probability that the centered average exceeds ε/2 in absolute value, which tends to zero.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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