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 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).
Depends on
- Scientific statistical model contracts
- Fixed-design linear regression model
- Finite probability spaces, outcome weights, events, and event probabilities
- Expectation of a real random variable on a finite probability space
- Measurable spaces and measurable sets
- Probability measures and probability spaces
- Statistical experiments
- Parametric statistical models
- Estimands on a statistical model
Used by
- Cluster sampling units, cluster totals, and one-stage SRSWOR Definition
- Inclusion-covariance difference Definition
- Simple random sampling without replacement Definition
- Stratified sampling designs and the stratified total estimator Definition
- Two-stage sampling laws and the expansion estimator Definition
- A certainty unit and a census under Horvitz–Thompson estimation Example
- An unobserved unit prevents universal unbiased estimation Example
- Positive pair covariances and a negative SYG estimate Example
- SRSWOR inclusion probabilities, pairwise nonpositive indicator covariance, and the sample mean Example
- Zero pair support can prevent universal unbiased variance estimation Example
- A finite-population design induces probability laws on observed records Lemma
- Conditional CLT for a random subset of an IID finite population Lemma
- A zero inclusion probability prevents total identification and universal unbiased estimation Theorem
- Horvitz–Thompson variance and pair-inclusion estimate Theorem
- Sen–Yates–Grundy variance identity Theorem
- SRSWOR inclusion covariance and sample-mean variance Theorem
- The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities Theorem
- Unbiasedness and variance of the stratified total estimator Theorem
Dependency tree · two levels
29 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 1: Introduction, PDF pp. 1–2, IIT Kanpur (standard reference, not scraped)
- Shalabh, Sampling Theory, Chapter 2: Simple Random Sampling, PDF pp. 1–2 and 14, IIT Kanpur (standard reference, not scraped)
- John J. Borkowski, Horvitz–Thompson Estimators, STAT 446 Lecture 6, §§6.1–6.2, printed pp. 138–143 (standard reference, not scraped)