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.
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.
Depends on
- Finite populations and sampling designs
- Inclusion-covariance difference
- Horvitz–Thompson variance and pair-inclusion estimate
- The expectation of an indicator is the probability of the event
- Linearity, monotonicity, and the modulus bound for expectation
- Moments, variance, and covariance on a probability space
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. 28–30 (standard reference, not scraped)
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §6.2, printed pp. 143–146 (standard reference, not scraped)