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 populations and design probability
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Finite-Sample Point Estimation
- Fixed-design regression, estimability, and Gauss–Markov
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
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
Finite populations and sampling designs
Definition
Let be an integer, let , and let be a fixed function. The pair is a finite population; its total and mean are
A sampling design on is a nonempty finite set and a function with . Here is the support of the design law: zero-weight subsets are omitted. Thus is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities. For and , put The random sample is the subset ; probability and expectation here average over the design while holding every fixed.
For , define the inclusion indicator the first-order inclusion probability and the second-order inclusion probability In particular, .
The observed record includes the selected unit labels and their values. For a common record space set and for each define For a real-valued statistic on , write 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 is a probability measure on . Hence is a statistical experiment (Statistical experiments), with parametric model (Parametric statistical models). The total and mean are estimands (Estimands on a statistical model).
This is design probability: the are fixed and only is random. A superpopulation model instead assigns a probability law to the values ; that additional law is separate from . 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 is held fixed and has no selection law; that convention alone does not specify a sampling design on (Fixed-design linear regression model).
A finite-population design induces probability laws on observed records
Statement
For every fixed , the set function defined in Finite populations and sampling designs is a probability measure on .
Facts & Assumptions
Given: A finite nonempty population index set , a finite sampling support with positive weights summing to , and a fixed value function .
Finite populations and sampling designs: The observed-record space is , its event family is the full power set, and .
Sigma-algebras: A sigma-algebra is an algebra of subsets closed under countable unions.
Measures on sigma-algebras: A measure assigns zero to the empty set and is countably additive on every pairwise disjoint sequence of measurable sets.
Probability measures and probability spaces: A probability measure is a measure whose total mass is .
Proof
Since is the full power set of , it contains every subset of and is closed under complements and countable unions; hence it is a sigma-algebra by [F2].
For every , the sum defining is finite and nonnegative. It gives and .
Let be pairwise disjoint in and put . The sets are pairwise disjoint and at most of them are nonempty. Their union is , so rearranging these finite weighted sums gives . By [F3], is a measure; by [F4] and step 1.2, its total mass is , so it is a probability measure.
The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities
Statement
Let be a finite population and let be a sampling design as in Finite populations and sampling designs. Suppose for every . Give the real target space its Borel sigma-algebra. For an observed record , define Under the induced observed-data law , these are estimators of the finite-population total and mean, respectively, and
Facts & Assumptions
Given: A finite nonempty unit set , fixed values , a finite sampling design , and for every .
Finite populations and sampling designs: The design has support , weights , inclusion indicators , probabilities , total , mean , and observed record .
A finite-population design induces probability laws on observed records: The induced is a probability measure on the common observed-record space.
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.
The indicator random variable of an event: For an event , its indicator is on and outside .
Indicators turn event probabilities, intersections, and finite counts into expectations and products: On a finite probability space, and products of event indicators are indicators of intersections.
Expectation of a real random variable on a finite probability space: Expectation is the finite weighted sum over design outcomes.
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.
The Borel sigma-algebra of a topological space: The Borel sigma-algebra on is the sigma-algebra generated by its open sets.
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
For every , makes the displayed denominator nonzero, so the formula defines a real-valued map on . 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 an estimator. For each fixed , it has finite support and finite real values, hence is integrable under ; division by the positive integer gives the same properties for . Thus both satisfy the integrability clause in [F9].
For each , let . Then by [F1] and [F4], so [F5] and [F6] give .
On a sample , the observed values satisfy for ; hence . Applying [F7] to this finite sum and using step 1.2 gives . Together with the integrability in step 1.1, this is unbiasedness by [F9]. No independence identity is used.
Since is fixed, linearity of the finite weighted expectation gives by step 2.1. Together with step 1.1, [F9] makes this the required unbiasedness claim for the mean estimator as well.
A zero inclusion probability prevents total identification and universal unbiased estimation
Statement
Let have in a finite-population design as in Finite populations and sampling designs. Regard the total as the estimand 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 . The estimator target is with its Borel sigma-algebra.
Facts & Assumptions
Given: A finite nonempty , a design support with for every , a fixed with , and the induced observed-record experiment.
Finite populations and sampling designs: The design support has strictly positive weights, , the record is , the common observed-data law is , and the total is . The induced-data expectation is .
A finite-population design induces probability laws on observed records: Every is a probability measure on the common observed-record space.
Parametric statistical models: The induced model is the map on parameter set .
Estimands on a statistical model: An estimand is a function from the model's parameter set to its target set; here it is .
Identifiability of an estimand: An estimand is identifiable only if equal sampling laws imply equal target values.
Statistics and estimators: An estimator is a measurable statistic with the target space of the specified estimand.
The Borel sigma-algebra of a topological space: has its Borel sigma-algebra, generated by the open subsets.
Expectation of a real random variable on a finite probability space: Design expectation is the finite weighted sum over .
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
Since and every support weight is strictly positive by [F1], no contains .
Fix any and any . Define and for . By step 1.1, for every . Therefore the finite sums defining and agree for every measurable record set , so ; [F2] ensures these are laws in the induced experiment. But , so the total fails the defining implication for identifiability.
Let be any estimator from the common record space to . Since for every support sample, [F8] gives . 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 and , which are unequal. Thus no such universally unbiased estimator exists.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Shalabh, Sampling Theory, Chapter 1: Introduction, PDF pp. 1–2, IIT Kanpur
- Shalabh, Sampling Theory, Chapter 2: Simple Random Sampling, PDF pp. 1–2 and 14, IIT Kanpur
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §§6.1–6.2, printed pp. 138–143
- Shalabh, Sampling Theory, Chapter 2: Simple Random Sampling, IIT Kanpur
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, Montana State University
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, printed pp. 141–143
- Shalabh, Sampling Theory, Chapter 1: Introduction, IIT Kanpur
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, Montana State University