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

1 · Prerequisites

2 · Summary

Scope

This page treats a finite population's unit values as fixed and places the probability law on sampled subsets. It defines population totals and means, design expectation, first- and second-order inclusion probabilities, and the observed-record experiment. A superpopulation model that randomizes the unit values is a separate probability mechanism.

The Horvitz–Thompson total and mean are design-unbiased when every unit has positive first-order inclusion probability. If a unit has zero probability of selection, changing only its value leaves the observed-data law unchanged while changing the total; consequently the total is not identifiable and no observed-sample estimator is unbiased for every finite population.

The page makes no variance-estimation, normal-inference, or model-adequacy claim. Fixed-design regression holds its design matrix fixed and does not by itself specify a probability law for selecting finite-population units.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite populations and sampling designs

Definition

Let N≥1 be an integer, let U={1,…,N}, and let y:U→R be a fixed function. The pair (U,y) is a finite population; its total and mean are T(y):=∑i∈Uyi,yˉU:=T(y)/N.

A sampling design on U is a nonempty finite set Sd⊆P(U) and a function pd:Sd→(0,1] with ∑s∈Sdpd(s)=1. Here Sd is the support of the design law: zero-weight subsets are omitted. Thus (Sd,pd) is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities. For A⊆Sd and g:Sd→R, put Pd(A):=∑s∈Apd(s),Ed[g]:=∑s∈Sdpd(s)g(s). The random sample is the subset S∈Sd; probability and expectation here average over the design while holding every yi fixed.

For i,j∈U, define the inclusion indicator Ii(s):={1,i∈s,0,i∉s, the first-order inclusion probability πi:=Pd({s∈Sd:i∈s}), and the second-order inclusion probability πij:=Pd({s∈Sd:i,j∈s}). In particular, πii=πi.

The observed record includes the selected unit labels and their values. For a common record space set Xd:={(s,z):s∈Sd, z:s→R},Ad:=P(Xd), and for each y∈RU define Oy(s):=(s,y∣s),Pyd(B):=∑s∈SdOy(s)∈Bpd(s)(B∈Ad). For a real-valued statistic h on Xd, write Eyd[h]:=∑s∈Sdpd(s)h(Oy(s))=Ed[h∘Oy]; this is expectation under the induced observed-data law. The local well-definedness result A finite-population design induces probability laws on observed records ↗ shows that each Pyd is a probability measure on (Xd,Ad). Hence Ed:=((Xd,Ad),RU,(Pyd)y∈RU) is a statistical experiment (Statistical experiments), with parametric model Pd(y)=Pyd (Parametric statistical models). The total y↦T(y) and mean y↦yˉU are estimands (Estimands on a statistical model).

This is design probability: the yi are fixed and only S is random. A superpopulation model instead assigns a probability law to the values yi; that additional law is separate from pd. The finite-population target and the sampling unit must be recorded in the scientific model contract (Scientific statistical model contracts). In fixed-design regression, the matrix X is held fixed and has no selection law; that convention alone does not specify a sampling design on U (Fixed-design linear regression model).

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A finite-population design induces probability laws on observed records

Statement

For every fixed y∈RU, the set function Pyd defined in Finite populations and sampling designs is a probability measure on (Xd,Ad).

Facts & Assumptions

Given: A finite nonempty population index set U, a finite sampling support Sd with positive weights pd(s) summing to 1, and a fixed value function y:U→R.

[F1]

Finite populations and sampling designs: The observed-record space is Xd={(s,z):s∈Sd, z:s→R}, its event family is the full power set, and Pyd(B)=∑s:Oy(s)∈Bpd(s).

[F2]

Sigma-algebras: A sigma-algebra is an algebra of subsets closed under countable unions.

[F3]

Measures on sigma-algebras: A measure assigns zero to the empty set and is countably additive on every pairwise disjoint sequence of measurable sets.

[F4]

Probability measures and probability spaces: A probability measure is a measure whose total mass is 1.

Proof

1.1F1F2algebra

Since Ad is the full power set of Xd, it contains every subset of Xd and is closed under complements and countable unions; hence it is a sigma-algebra by [F2].

1.2F1F4algebra

For every B∈Ad, the sum defining Pyd(B) is finite and nonnegative. It gives Pyd(∅)=0 and Pyd(Xd)=∑s∈Sdpd(s)=1.

2.1F1F3F4step 1.2algebra∎

Let (Bk)k≥0 be pairwise disjoint in Ad and put Ck={s∈Sd:Oy(s)∈Bk}. The sets Ck are pairwise disjoint and at most ∣Sd∣ of them are nonempty. Their union is {s:Oy(s)∈⋃kBk}, so rearranging these finite weighted sums gives Pyd(⋃kBk)=∑kPyd(Bk). By [F3], Pyd is a measure; by [F4] and step 1.2, its total mass is 1, so it is a probability measure.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities

Statement

Let (U,y) be a finite population and let pd be a sampling design as in Finite populations and sampling designs. Suppose πi>0 for every i∈U. Give the real target space its Borel sigma-algebra. For an observed record (s,z)∈Xd, define T^HT(s,z):=∑i∈sziπi,yˉ^HT(s,z):=T^HT(s,z)N. Under the induced observed-data law Pyd, these are estimators of the finite-population total and mean, respectively, and Eyd[T^HT]=T(y),Eyd[yˉ^HT]=yˉU.

Facts & Assumptions

Given: A finite nonempty unit set U, fixed values yi∈R, a finite sampling design pd, and πi>0 for every i∈U.

[F1]

Finite populations and sampling designs: The design has support Sd, weights pd, inclusion indicators Ii(s), probabilities πi, total T(y), mean yˉU, and observed record Oy(s).

[F2]

A finite-population design induces probability laws on observed records: The induced Pyd is a probability measure on the common observed-record space.

[F3]

Statistics and estimators: A statistic is a measurable map from the experiment's observation space; it is an estimator when its target is the specified estimand.

[F4]

The indicator random variable of an event: For an event A, its indicator is 1 on A and 0 outside A.

[F5]

Indicators turn event probabilities, intersections, and finite counts into expectations and products: On a finite probability space, E[1A]=P(A) and products of event indicators are indicators of intersections.

[F6]

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

[F7]

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

[F8]

The Borel sigma-algebra of a topological space: The Borel sigma-algebra on R is the sigma-algebra generated by its open sets.

[F9]

Unbiased estimators and UMVU estimators: An estimator is unbiased when it is integrable under every model law and its expectation equals the estimand at every parameter.

Proof

1.1givenF1F2F3F8F9algebra

For every i, πi>0 makes the displayed denominator nonzero, so the formula defines a real-valued map on Xd. Its domain has the full power-set sigma-algebra, so the preimage of every Borel set is measurable by [F8]; its target is the total estimand from [F1]. Thus [F2] and [F3] make T^HT an estimator. For each fixed y, it has finite support and finite real values, hence is integrable under Pyd; division by the positive integer N gives the same properties for yˉ^HT. Thus both satisfy the integrability clause in [F9].

1.2F1F4F5F6

For each i∈U, let Ai={s∈Sd:i∈s}. Then Ii=1Ai by [F1] and [F4], so [F5] and [F6] give Ed[Ii]=Pd(Ai)=πi.

2.1F1F6F7F9step 1.1step 1.2algebra

On a sample s, the observed values satisfy zi=yi for i∈s; hence T^HT(Oy(s))=∑i∈UIi(s)yi/πi. Applying [F7] to this finite sum and using step 1.2 gives Eyd[T^HT]=∑i∈UyiπiEd[Ii]=∑i∈Uyi=T(y). Together with the integrability in step 1.1, this is unbiasedness by [F9]. No independence identity is used.

3.1givenF6F7F9step 1.1step 2.1algebra∎

Since N≥1 is fixed, linearity of the finite weighted expectation gives Eyd[yˉ^HT]=Eyd[T^HT]/N=T(y)/N=yˉU by step 2.1. Together with step 1.1, [F9] makes this the required unbiasedness claim for the mean estimator as well.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A zero inclusion probability prevents total identification and universal unbiased estimation

Statement

Let i∈U have πi=0 in a finite-population design as in Finite populations and sampling designs. Regard the total as the estimand y↦T(y) in the induced experiment. Then this estimand is not identifiable. Moreover, no estimator that is a function only of the observed record can be design-unbiased for every y∈RU. The estimator target is R with its Borel sigma-algebra.

Facts & Assumptions

Given: A finite nonempty U, a design support Sd with pd(s)>0 for every s∈Sd, a fixed i∈U with πi=0, and the induced observed-record experiment.

[F1]

Finite populations and sampling designs: The design support has strictly positive weights, πi=∑s:i∈spd(s), the record is Oy(s)=(s,y∣s), the common observed-data law is Pyd, and the total is T(y)=∑j∈Uyj. The induced-data expectation is Eyd[h]=∑spd(s)h(Oy(s)).

[F2]

A finite-population design induces probability laws on observed records: Every Pyd is a probability measure on the common observed-record space.

[F3]

Parametric statistical models: The induced model is the map Pd:y↦Pyd on parameter set RU.

[F4]

Estimands on a statistical model: An estimand is a function from the model's parameter set to its target set; here it is ψT(y)=T(y).

[F5]

Identifiability of an estimand: An estimand is identifiable only if equal sampling laws imply equal target values.

[F6]

Statistics and estimators: An estimator is a measurable statistic with the target space of the specified estimand.

[F7]

The Borel sigma-algebra of a topological space: R has its Borel sigma-algebra, generated by the open subsets.

[F8]

Expectation of a real random variable on a finite probability space: Design expectation is the finite weighted sum over Sd.

[F9]

Unbiased estimators and UMVU estimators: An estimator is unbiased if it is integrable under every model law and its expectation equals the estimand at every parameter.

Proof

1.1givenF1algebra

Since πi=∑s:i∈spd(s)=0 and every support weight is strictly positive by [F1], no s∈Sd contains i.

2.1F1F2F3F4F5step 1.1algebra

Fix any y∈RU and any c∈R∖{0}. Define yi′=yi+c and yj′=yj for j≠i. By step 1.1, Oy(s)=Oy′(s) for every s∈Sd. Therefore the finite sums defining Pyd(B) and Py′d(B) agree for every measurable record set B, so Pyd=Py′d; [F2] ensures these are laws in the induced experiment. But T(y′)=T(y)+c≠T(y), so the total fails the defining implication for identifiability.

3.1F1F6F7F8F9step 2.1algebra∎

Let δ be any estimator from the common record space to (R,B(R)). Since Oy(s)=Oy′(s) for every support sample, [F8] gives Eyd[δ]=∑s∈Sdpd(s)δ(Oy(s))=∑s∈Sdpd(s)δ(Oy′(s))=Ey′d[δ]. Both expectations are finite because the design support is finite and δ is real-valued. By [F9], an estimator unbiased for every finite population would make these equal expectations equal both T(y) and T(y′), which are unequal. Thus no such universally unbiased estimator exists.

5 · Examples, counterexamples and false statements

None yet.

Sources