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.

✓ 3 results · all verified · 3 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; all 3 also cleared it.

Finite populations and design probability — Examples

1 · Prerequisites

2 · Summary

These worked finite designs calculate inclusion probabilities and indicator covariance for SRSWOR, show how a certainty unit and census behave under Horvitz–Thompson weighting, and exhibit two different totals with one identical observed record when a unit is never sampled. Each probability is over its declared design law, with the population values held fixed.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

SRSWOR inclusion probabilities, pairwise nonpositive indicator covariance, and the sample mean

Example

Let N≥2, 1≤n≤N, U={1,…,N}, and let yi be fixed real values. Let Sd consist of all n-element subsets of U, with each such sample assigned probability 1/M, where M=∣Sd∣. This is simple random sampling without replacement (SRSWOR). For distinct i,j∈U, πi=nN,πij=n(n−1)N(N−1),Cov⁡d(Ii,Ij)=−n(N−n)N2(N−1). The Horvitz–Thompson mean reduces to the ordinary sample mean n−1∑i∈syi.

Facts & Assumptions

Given: N≥2, 1≤n≤N, a fixed finite population (U,y), and the uniform design on all n-element subsets of U.

[F1]

Finite populations and sampling designs: For a sampling design, πi=Pd(i∈S), πij=Pd(i,j∈S), and the values yi are held fixed under the design law.

[F2]

The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities: If every πi>0, the total and mean estimators with weights 1/πi are design-unbiased.

[F3]

Variance, standard deviation, and covariance on a finite probability space: On one finite probability space, Cov⁡(X,Y)=E[(X−EX)(Y−EY)].

[F4]

Expectation is linear for every finite family of random variables, without any independence hypothesis: Expectation is linear for finite families of random variables on one finite probability space.

[F5]

Indicators turn event probabilities, intersections, and finite counts into expectations and products: Indicator expectations equal event probabilities, and products of indicators equal indicators of event intersections.

[F6]

The indicator random variable of an event: An event indicator is 1 on the event and 0 outside it.

[F7]

Expectation of a real random variable on a finite probability space: Expectation is the finite weighted sum over sample outcomes.

Verification

1.1givenF1constructalgebra

Let a be the number of n-subsets containing a fixed unit. A permutation of U taking one unit to another gives a bijection of the sample family, so every unit occurs in exactly a samples. Counting pairs (s,i) with i∈s in two ways gives Na=nM, hence a/M=n/N and πi=n/N.

1.2givenF1constructalgebra

Let b be the number of samples containing a fixed ordered pair of distinct units. Permutations of U give the same b for every such pair. Counting triples (s,i,j) with i≠j and i,j∈s gives N(N−1)b=n(n−1)M, so b/M=n(n−1)/(N(N−1)) and πij=n(n−1)/(N(N−1)). This also gives πij=0 when n=1.

2.1F3F4F5F6F7step 1.1step 1.2algebra

Put Ai={s:i∈s}. By [F5] and [F6], Ed[Ii]=Pd(Ai)=πi and Ed[IiIj]=Pd(Ai∩Aj)=πij. Expanding the covariance in [F3] with linearity [F4] therefore gives Cov⁡d(Ii,Ij)=πij−πiπj=n(n−1)N(N−1)−n2N2=−n(N−n)N2(N−1).

3.1givenF1F2step 1.1algebra∎

Since πi=n/N>0, the estimator in [F2] has yˉ^HT(s,y∣s)=1N∑i∈syin/N=1n∑i∈syi. Its expectation is yˉU by [F2].

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

A certainty unit and a census under Horvitz–Thompson estimation

Example

Let U={1,2,3} with fixed values (a,b,c). First use the design that chooses {1,2} or {1,3} with probability 1/2 each. Unit 1 is a certainty unit: π1=1, while π2=π3=1/2. The Horvitz–Thompson total is a+2b or a+2c, according to the sample. In the census design, which always selects U, every πi=1 and the Horvitz–Thompson total and mean equal the population total and mean exactly.

Facts & Assumptions

Given: A finite population U={1,2,3} with fixed real values y1=a, y2=b, y3=c; either the two-sample design described above or the census design.

[F1]

Finite populations and sampling designs: Inclusion probabilities are design probabilities, and the total and mean hold the values fixed.

[F2]

The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities: With all first-order inclusion probabilities positive, the inverse-inclusion weighted total and its population-size-scaled mean are unbiased.

[F3]

Expectation of a real random variable on a finite probability space: Expectations are finite weighted sums over the design support.

[F4]

Unbiased estimators and UMVU estimators: An estimator is unbiased when its expectation equals its estimand at every parameter value.

Verification

1.1givenF1algebra

Under the two-sample design, unit 1 is in both support samples, unit 2 only in the first, and unit 3 only in the second. Therefore π1=1 and π2=π3=1/2. The weighted total is a+2b for sample {1,2} and a+2c for sample {1,3}, so unit 1 contributes its observed value a without expansion.

2.1F1F2F3F4step 1.1algebra

The design expectation of the displayed total is 12(a+2b)+12(a+2c)=a+b+c=T(y) by [F3]. Since each πi>0, [F2] also identifies its divided-by-3 form as the unbiased estimator of yˉU.

3.1givenF1algebra∎

In the census design, the only supported sample is U with probability 1, so every πi=1. Thus the total estimator is ∑i∈Uyi=T(y) on the sole outcome, and its mean version is T(y)/3=yˉU.

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

An unobserved unit prevents universal unbiased estimation

Example

Let U={1,2} and let the design always sample s={1}. Compare the fixed populations y=(0,0) and y′=(0,1). The second unit has π2=0; both populations produce the same observed record ({1},0), while their totals are 0 and 1. This is the two-unit instance of A zero inclusion probability prevents total identification and universal unbiased estimation.

Facts & Assumptions

Given: The fixed two-unit population set U={1,2}, the degenerate design supported only on {1}, and the two value functions shown above.

[F1]

Finite populations and sampling designs: A design law specifies the sample support, inclusion probabilities, observed record, and total while holding population values fixed.

[F2]

A zero inclusion probability prevents total identification and universal unbiased estimation: A zero first-order inclusion probability gives equal observed laws for some populations with different totals and rules out an estimator unbiased for all finite populations.

[F3]

Statistics and estimators: An estimator is a statistic, hence a function of the observed record with the specified real target.

[F4]

Unbiased estimators and UMVU estimators: An estimator is unbiased when its expectation equals its estimand at every parameter value.

Verification

1.1givenF1algebra

The only supported sample is {1}, so π2=0. Under both y and y′, the record is ({1},0), but T(y)=0 and T(y′)=1.

2.1F1F2F3F4step 1.1algebra∎

Any observed-record estimator has one value d at ({1},0), so its design expectation is d under both populations. It cannot equal both totals 0 and 1. This explicit calculation verifies the instance asserted by [F2], using the unbiasedness definition [F4].