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.
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.
Depends on
- Finite populations and sampling designs
- Inclusion-covariance difference
- Moments, variance, and covariance on a probability space
- Covariance is symmetric and bilinear in finite linear combinations
- Variance of a finite sum as the sum of all variances and covariances
- The expectation of an indicator is the probability of the event
- Linearity, monotonicity, and the modulus bound for expectation
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Shalabh, Sampling Theory, Chapter 7: Varying Probability Sampling, PDF pp. 25–27 (standard reference, not scraped)
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, printed pp. 141–143 (standard reference, not scraped)