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

Bernoulli sample frequencies

Example

Assume countable choice and dependent choice. For IID Bernoulli(p) variables (Xk)k1, where 0p1, let Sn=k=1nXk. Then Sn/np in probability and P(Sn/npε)p(1p)nε2(ε>0). The endpoint laws p=0,1 are included.

Facts & Assumptions

[F1]

IID finite-variance weak law: Let (Xk)k1 be IID square-integrable real random variables, with μ=EX1 and σ2=Var(X1). For Sn=k=1nXk, ESn/nμ2=σ2/n, and Sn/nμ in L2 and in probability. Also P(Sn/nμε)σ2/(nε2) for ε>0.

[F2]

Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials: For p[0,1], a Bernoulli(p) random variable takes the value 1 with probability p and 0 with probability 1p. For nN, a binomial(n,p) random variable is a sum X=i<nXi of n mutually independent Bernoulli(p) variables. When n=0, this is the constant zero random variable.

[F3]

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.

[F4]

Countably many independent copies of a prescribed law exist: Assume countable choice and dependent choice. Every probability measure ν on (S,Σ) is the common law of a countable independent family of S-valued random elements.

Verification

Given: The construction and assumptions above.

1.1

The Bernoulli law puts masses p and 1p at 1 and 0. Under countable choice and dependent choice, the countable-copy result constructs a common-space IID sequence with this law. Its mean is p and variance p(1p), including both endpoints.

F2F4F3given
2.1

The finite-variance IID weak law and its probability bound apply with μ=p and σ2=p(1p), giving the displayed estimate and convergence. If p=0 or p=1, all the variables equal p on the intersection of their countably many probability-one events, so every sample mean equals p there and the error probability is zero, even at n=1.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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