Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Stratified sampling designs and the stratified total estimator

Definition

Let (U,y) be a finite population as in Finite populations and sampling designs, and let U1,…,UH be a finite partition of U into nonempty strata. Write Nh=∣Uh∣ and N=∑h=1HNh. Choose integers 1≤nh≤Nh. In stratum h, draw Rh by SRSWOR of size nh as in Simple random sampling without replacement, independently across strata. Thus the joint probability of a tuple (r1,…,rH) is ∏h=1H(Nhnh)−1, and its sample in U is R=⋃h=1Hrh. This is the stratified SRSWOR design. The union map is one-to-one because the strata are disjoint; the support has ∏h(Nhnh) elements, so the displayed mass function sums to one.

The fixed mean in stratum h is yˉh=1Nh∑i∈Uhyi. For a noncertainty stratum (nh<Nh), necessarily Nh>1, and its finite- population variance is Sh2=1Nh−1∑i∈Uh(yi−yˉh)2. For every noncertainty stratum write Sh=Sh2 for its nonnegative population standard deviation. For a realized sample, set yˉh,R=1nh∑i∈Rhyi,T^st=∑h=1HNhyˉh,R. The quantity T^st is the stratified total estimator. When nh=Nh, the stratum is a certainty stratum and its contribution is the fixed total Nhyˉh; no Sh2 is needed for that term. The population values yi remain fixed: only the sample selections are random.

Depends on

Used by

Dependency tree · two levels

11 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