Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Finite populations and sampling designs

Definition

Let N≥1 be an integer, let U={1,…,N}, and let y:U→R be a fixed function. The pair (U,y) is a finite population; its total and mean are T(y):=∑i∈Uyi,yˉU:=T(y)/N.

A sampling design on U is a nonempty finite set Sd⊆P(U) and a function pd:Sd→(0,1] with ∑s∈Sdpd(s)=1. Here Sd is the support of the design law: zero-weight subsets are omitted. Thus (Sd,pd) is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities. For A⊆Sd and g:Sd→R, put Pd(A):=∑s∈Apd(s),Ed[g]:=∑s∈Sdpd(s)g(s). The random sample is the subset S∈Sd; probability and expectation here average over the design while holding every yi fixed.

For i,j∈U, define the inclusion indicator Ii(s):={1,i∈s,0,i∉s, the first-order inclusion probability πi:=Pd({s∈Sd:i∈s}), and the second-order inclusion probability πij:=Pd({s∈Sd:i,j∈s}). In particular, πii=πi.

The observed record includes the selected unit labels and their values. For a common record space set Xd:={(s,z):s∈Sd, z:s→R},Ad:=P(Xd), and for each y∈RU define Oy(s):=(s,y∣s),Pyd(B):=∑s∈SdOy(s)∈Bpd(s)(B∈Ad). For a real-valued statistic h on Xd, write Eyd[h]:=∑s∈Sdpd(s)h(Oy(s))=Ed[h∘Oy]; 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 Pyd is a probability measure on (Xd,Ad). Hence Ed:=((Xd,Ad),RU,(Pyd)y∈RU) is a statistical experiment (Statistical experiments), with parametric model Pd(y)=Pyd (Parametric statistical models). The total y↦T(y) and mean y↦yˉU are estimands (Estimands on a statistical model).

This is design probability: the yi are fixed and only S is random. A superpopulation model instead assigns a probability law to the values yi; that additional law is separate from pd. 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 X is held fixed and has no selection law; that convention alone does not specify a sampling design on U (Fixed-design linear regression model).

Depends on

Used by

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