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.
HT variance and SRSWOR
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- 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 populations and design probability
- Finite Probability Spaces and Random Variables
- 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
- 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
This page develops design-based variance for fixed finite populations. It derives the Horvitz–Thompson total variance and the pair-inclusion estimate, then proves the fixed-size Sen–Yates–Grundy identity and the SRSWOR finite-population correction. Zero pair support limits the stated inverse pair formula, while the sign condition on pair covariances is used only as a sufficient guarantee for nonnegative sample estimates. These design moments do not supply exact normal or t inference.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Inclusion-covariance difference
Definition
Let be a finite population with a sampling design as in Finite populations and sampling designs. For each ordered pair , the inclusion-covariance difference is where is the probability that unit is included and is the probability that both and are included. The supplier convention gives .
Simple random sampling without replacement
Definition
Let be a finite population of size . For an integer with , simple random sampling without replacement (SRSWOR) of size is the sampling design whose support is and whose probability for every is Thus exactly distinct units are sampled and all -element subsets are equally likely.
Horvitz–Thompson variance and pair-inclusion estimate
Statement
Let be a finite population with a sampling design as in Finite populations and sampling designs. Write for the indicator that unit is included, and assume for every . The Horvitz–Thompson total is Its design variance is where is defined in Inclusion-covariance difference. If, in addition, for every ordered pair , the all-pairs inverse-inclusion expression is defined and satisfies When a pair has zero inclusion probability, the corresponding all-pairs coefficient is undefined; omitting unsupported pairs is a different expression and does not by itself prove unbiasedness or non-estimability by some other method.
Facts & Assumptions
Given: A finite population , a finite sampling design, for every unit, and additionally for every ordered pair when proving the pair-inclusion identity.
Finite populations and sampling designs: The population values are fixed; the finite design has support and weights ; is the inclusion indicator; and ; also .
Moments, variance, and covariance on a probability space: Variance is the expectation of the squared centered variable, and covariance is the expectation of the product of centered variables.
The expectation of an indicator is the probability of the event: The expectation of an event indicator equals the probability of its event.
Variance of a finite sum as the sum of all variances and covariances: The variance of a finite sum of square-integrable variables on one probability space is the double sum of their pairwise covariances.
Covariance is symmetric and bilinear in finite linear combinations: Covariance is bilinear for finite linear combinations of square-integrable variables on one probability space.
Linearity, monotonicity, and the modulus bound for expectation: For integrable random variables and scalars on one probability space, .
Proof
For each , set . The design support is finite by [F1], each is bounded, and is finite by the positivity assumption; hence every is square-integrable and .
Apply [F5] to this finite family on the common design probability space to obtain .
By [F6], . For , and , so [F4] and [F1] give and ; expanding [F3] gives by [F2], and substitution in step 2.1 proves the variance formula.
Under the additional pair-positivity assumption every coefficient in is defined and every term is integrable on the finite support. Linearity over the finite index set follows by induction: the empty sum has expectation zero, and adjoining one term uses the two-variable rule [F7]. For each pair, is the indicator of joint inclusion by [F1], so [F4] gives ; hence by step 3.1.
If , the coefficient in the all-pairs expression is undefined; removing that unsupported term changes the expression, and step 4.1 no longer proves unbiasedness, without ruling out another design-specific estimator.
Sen–Yates–Grundy variance identity
Statement
Let be a finite population with a fixed-size sampling design as in Finite populations and sampling designs, so every supported sample has the same size . Assume for every and put . Then and the Horvitz–Thompson variance satisfies the Sen–Yates–Grundy identity If additionally for every ordered pair, then the sample expression is unbiased for . If for every distinct pair, this condition guarantees that is nonnegative for every supported sample. It is a sufficient sign condition for the sample expression; the true variance in the identity is nonnegative for every valid design.
Facts & Assumptions
Given: A fixed finite population and design with sample size on every supported outcome, for every unit, and additionally for every pair when proving the sample-estimate claim.
Finite populations and sampling designs: indicates inclusion of unit , , , and .
The expectation of an indicator is the probability of the event: An event indicator has expectation equal to the probability of its event.
Linearity, monotonicity, and the modulus bound for expectation: For integrable random variables and scalars on one probability space, .
Moments, variance, and covariance on a probability space: Variance is the expectation of a square and therefore is nonnegative.
Proof
For each i,j, indicates joint inclusion and indicates inclusion by [F1], so [F4] gives their expectations as and . Since on every sample, finite linearity by induction using [F5] gives and ; subtracting by [F2] gives .
By [F1] and [F2], and the column sums also vanish; expansion gives , which is by [F3] and is nonnegative by [F6].
If every , each coefficient in is defined and every term is integrable on the finite support. Finite-sum linearity follows by induction from [F5]; by [F1], each indicates joint inclusion, so [F4] gives and by step 2.1.
On a supported sample, diagonal terms vanish and symmetry gives ; if every distinct-pair , every summand is nonnegative, proving the sufficient condition.
SRSWOR inclusion covariance and sample-mean variance
Statement
Let be a finite population of size , and draw an SRSWOR sample of size , where . Write if and otherwise. Define For distinct , and Both formulas include and the census case .
Facts & Assumptions
Given: A finite population with fixed real values, , and a uniform design on the -element subsets of for an integer .
Finite populations and sampling designs: The population values are fixed; the design defines , , , design expectation, the total , and the population mean .
Simple random sampling without replacement: Every -element subset is in the design support and has probability .
Horvitz–Thompson variance and pair-inclusion estimate: When , the design variance of is .
Moments, variance, and covariance on a probability space: Covariance is the expectation of the product of centered variables; variance is covariance with itself.
Proof
There are supported samples; a fixed unit occurs in of them, so . If , no sample contains distinct ; if , samples contain them, hence in either case for .
By [F1], and , while ; expanding [F5] gives . Substitution from step 1.1 gives for .
Since , ; by [F4], . From , , and step 2.1 gives for ; thus .
When , the sample is the population and the factor is zero. When , step 3.1 gives ; the usual sample variance denominator is unavailable, but the design variance is defined.
Remarks
The PDF p. 14 covariance display in Shalabh's Chapter 2 has a positive-sign typo. The inclusion probabilities on that page and the defining identity give the negative value proved above. The sample space has only points, so the design distribution is finitely supported; the displayed variance alone is not an exact normal or calibration.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Shalabh, Sampling Theory, Chapter 7: Varying Probability Sampling, PDF pp. 25–27
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, printed pp. 141–143
- Shalabh, Sampling Theory, Chapter 2: Simple Random Sampling, PDF pp. 1–4
- Shalabh, Sampling Theory, Chapter 7: Varying Probability Sampling, PDF pp. 28–30
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, printed pp. 143–146
- Shalabh, Sampling Theory, Chapter 2: Simple Random Sampling, PDF pp. 1–15