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.

Finite check of the IID sample-mean variance and Chebyshev bound

Example

Let Ω={(σ1,σ2):σ1,σ2∈{−1,1}} be the uniform finite probability space with four outcomes of weight 1/4, and let X1(σ1,σ2):=σ1,X2(σ1,σ2):=σ2. Then (X1,X2) is an IID family with μ=E[X1]=0 and σ2=Var⁡(X1)=1; the sample mean X‾=(X1+X2)/2 takes the values −1,0,1 with probabilities 1/4,1/2,1/4 respectively. The exact second moment and the Chebyshev bound computed directly below read E∣X‾∣2=12=σ22,P(∣X‾∣≥1)=12=σ22⋅12, so the bound is attained at a=1, while P(∣X‾∣≥12)=12≤2=σ22⋅(1/2)2 is strict. This is a finite check inside the stated model; it evaluates no measurement and estimates no physical quantity.

Facts & Assumptions

Given: The uniform finite probability space on {−1,1}2 and the coordinate maps X1,X2 of the Example.

[L3]

On a finite probability space, expectations are the finite weighted sums of Expectation of a real random variable on a finite probability space, and the finite model agrees with the probability measure P(A)=∑ω∈Aw(ω), whose expectations coincide with those integral expectations. (Finite probability spaces are exactly finite full-power-set probability spaces, Finite probability spaces, outcome weights, events, and event probabilities)

[L4]

A finite family of finite-valued random variables is mutually independent exactly when P(Xj=xj for all j∈J)=∏j∈JP(Xj=xj) for every nonempty J and every choice of values; it is identically distributed when the individual distributions agree. (Pairwise and mutual independence of finite-valued random variables, Identical distribution and IID families)

Verification

technique · direct enumeration of four outcomes
1.1givenL3L4algebra

The four outcomes have weight 1/4 each, so P(X1=−1)=P(X1=1)=1/2 and the same for X2; for every pair (a,b)∈{−1,1}2 one has P(X1=a,X2=b)=1/4=P(X1=a)P(X2=b). By [L4] the family is independent, the two distributions agree, and E[X1]=12(−1)+12(1)=0, E[X12]=12(1)+12(1)=1 by [L3].

1.2givenL3algebra

Enumerating X‾=(X1+X2)/2 on the four outcomes gives the values 1,0,0,−1, each with weight 1/4; hence P(∣X‾∣≥1)=24=12,P(∣X‾∣≥12)=24=12.

2.1step 1.1step 1.2L3algebra

By the enumeration in step 1.2 and the expectation formula [L3], E[X‾]=0 and E∣X‾∣2=14+14=12=σ2/2. For any a>0, the pointwise inequality a21{∣X‾∣≥a}≤∣X‾∣2 and summation with nonnegative weights give P(∣X‾∣≥a)≤E∣X‾∣2/a2=σ2/(2a2).

3.1step 1.2step 2.1algebra∎

At a=1 the bound of step 2.1 is 1/2, equal to the exact probability from step 1.2; at a=1/2 it is 2, strictly larger than the exact probability 1/2. These establish the displayed finite-sample identity and bounds without requiring an infinite IID extension.

Depends on

Dependency tree · 2 levels

Sources