Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

HT variance and SRSWOR

1 · Prerequisites

2 · Summary

This page develops design-based variance for fixed finite populations. It derives the Horvitz–Thompson total variance and the pair-inclusion estimate, then proves the fixed-size Sen–Yates–Grundy identity and the SRSWOR finite-population correction. Zero pair support limits the stated inverse pair formula, while the sign condition on pair covariances is used only as a sufficient guarantee for nonnegative sample estimates. These design moments do not supply exact normal or t inference.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Inclusion-covariance difference

Definition

Let (U,y) be a finite population with a sampling design as in Finite populations and sampling designs. For each ordered pair (i,j)∈U×U, the inclusion-covariance difference is Δij:=πij−πiπj, where πi is the probability that unit i is included and πij is the probability that both i and j are included. The supplier convention πii=πi gives Δii=πi(1−πi).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Simple random sampling without replacement

Definition

Let U be a finite population of size N. For an integer n with 1≤n≤N, simple random sampling without replacement (SRSWOR) of size n is the sampling design whose support is S={s⊆U:∣s∣=n} and whose probability for every s∈S is pd(s)=(Nn)−1. Thus exactly n distinct units are sampled and all n-element subsets are equally likely.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Horvitz–Thompson variance and pair-inclusion estimate

Statement

Let (U,y) be a finite population with a sampling design as in Finite populations and sampling designs. Write Ii for the indicator that unit i is included, and assume πi>0 for every i∈U. The Horvitz–Thompson total is T^HT:=∑i∈UIiyiπi. Its design variance is Var⁡d(T^HT)=∑i,j∈UΔijyiyjπiπj, where Δij is defined in Inclusion-covariance difference. If, in addition, πij>0 for every ordered pair (i,j), the all-pairs inverse-inclusion expression V^HT:=∑i,j∈UIiIjΔijπijyiπiyjπj is defined and satisfies Ed[V^HT]=Var⁡d(T^HT). When a pair has zero inclusion probability, the corresponding all-pairs coefficient Δij/πij 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 (U,y), a finite sampling design, πi>0 for every unit, and additionally πij>0 for every ordered pair when proving the pair-inclusion identity.

[F1]

Finite populations and sampling designs: The population values are fixed; the finite design has support Sd and weights pd; Ii is the inclusion indicator; πi=Pd(Ii=1) and πij=Pd(Ii=Ij=1); also πii=πi.

[F2]

Inclusion-covariance difference: Δij=πij−πiπj.

[F3]

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.

[F4]

The expectation of an indicator is the probability of the event: The expectation of an event indicator equals the probability of its event.

[F5]

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.

[F6]

Covariance is symmetric and bilinear in finite linear combinations: Covariance is bilinear for finite linear combinations of square-integrable variables on one probability space.

[F7]

Linearity, monotonicity, and the modulus bound for expectation: For integrable random variables X,Y and scalars a,b on one probability space, E[aX+bY]=aE[X]+bE[Y].

Proof

1.1givenF1choose

For each i∈U, set Xi=Iiyi/πi. The design support is finite by [F1], each Ii is bounded, and yi/πi is finite by the positivity assumption; hence every Xi is square-integrable and T^HT=∑i∈UXi.

2.1F1F5step 1.1

Apply [F5] to this finite family on the common design probability space to obtain Var⁡d(T^HT)=∑i,j∈UCov⁡d(Xi,Xj).

3.1F1F2F3F4F6step 2.1algebra

By [F6], Cov⁡d(Xi,Xj)=yiyjπiπjCov⁡d(Ii,Ij). For Ai={s:i∈s}, Ii=1Ai and IiIj=1Ai∩Aj, so [F4] and [F1] give Ed[Ii]=πi and Ed[IiIj]=πij; expanding [F3] gives Cov⁡d(Ii,Ij)=πij−πiπj=Δij by [F2], and substitution in step 2.1 proves the variance formula.

4.1givenF1F4F7step 3.1algebra

Under the additional pair-positivity assumption every coefficient in V^HT is defined and every term is integrable on the finite support. Linearity over the finite index set U×U follows by induction: the empty sum has expectation zero, and adjoining one term uses the two-variable rule [F7]. For each pair, IiIj is the indicator of joint inclusion by [F1], so [F4] gives Ed[IiIj]=πij; hence Ed[V^HT]=∑i,j∈UΔijπijyiyjπiπjEd[IiIj]=∑i,j∈UΔijyiyjπiπj=Var⁡d(T^HT) by step 3.1.

5.1givenstep 4.1algebra∎

If πij=0, the coefficient Δij/πij 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Sen–Yates–Grundy variance identity

Statement

Let (U,y) 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 n. Assume πi>0 for every i∈U and put xi:=yi/πi. Then ∑j∈UΔij=0(i∈U), and the Horvitz–Thompson variance satisfies the Sen–Yates–Grundy identity Var⁡d(T^HT)=−12∑i,j∈UΔij(xi−xj)2. If additionally πij>0 for every ordered pair, then the sample expression V^SYG:=−12∑i,j∈UIiIjΔijπij(xi−xj)2 is unbiased for Var⁡d(T^HT). If Δij≤0 for every distinct pair, this condition guarantees that V^SYG 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 n on every supported outcome, πi>0 for every unit, and additionally πij>0 for every pair when proving the sample-estimate claim.

[F1]

Finite populations and sampling designs: Ii indicates inclusion of unit i, πi=Pd(Ii=1), πij=Pd(Ii=Ij=1), and πij=πji.

[F2]

Inclusion-covariance difference: Δij=πij−πiπj.

[F3]

Horvitz–Thompson variance and pair-inclusion estimate: For πi>0, Var⁡d(T^HT)=∑i,j∈UΔijxixj.

[F4]

The expectation of an indicator is the probability of the event: An event indicator has expectation equal to the probability of its event.

[F5]

Linearity, monotonicity, and the modulus bound for expectation: For integrable random variables X,Y and scalars a,b on one probability space, E[aX+bY]=aE[X]+bE[Y].

[F6]

Moments, variance, and covariance on a probability space: Variance is the expectation of a square and therefore is nonnegative.

Proof

1.1F1F2F4F5algebra

For each i,j, IiIj indicates joint inclusion and Ii indicates inclusion by [F1], so [F4] gives their expectations as πij and πi. Since ∑jIj=n on every sample, finite linearity by induction using [F5] gives ∑jπij=Ed[Ii∑jIj]=nπi and ∑jπiπj=πiEd[∑jIj]=nπi; subtracting by [F2] gives ∑jΔij=0.

2.1F1F2F3F6step 1.1algebra

By [F1] and [F2], Δij=Δji and the column sums also vanish; expansion gives −12∑i,jΔij(xi−xj)2=−12(∑ixi2∑jΔij+∑jxj2∑iΔij−2∑i,jΔijxixj)=∑i,jΔijxixj, which is Var⁡d(T^HT) by [F3] and is nonnegative by [F6].

3.1givenF1F3F4F5step 2.1algebra

If every πij>0, each coefficient in V^SYG is defined and every term is integrable on the finite support. Finite-sum linearity follows by induction from [F5]; by [F1], each IiIj indicates joint inclusion, so [F4] gives Ed[IiIj]=πij and Ed[V^SYG]=−12∑i,jΔijπijEd[IiIj](xi−xj)2=−12∑i,jΔij(xi−xj)2=Var⁡d(T^HT) by step 2.1.

4.1givenF1step 3.1algebra∎

On a supported sample, diagonal terms vanish and symmetry gives V^SYG(s)=−∑i<j, i,j∈sΔijπij(xi−xj)2; if every distinct-pair Δij≤0, every summand is nonnegative, proving the sufficient condition.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

SRSWOR inclusion covariance and sample-mean variance

Statement

Let (U,y) be a finite population of size N>1, and draw an SRSWOR sample S of size n, where 1≤n≤N. Write Ii=1 if i∈S and Ii=0 otherwise. Define yˉU:=1N∑i∈Uyi,yˉS:=1n∑i∈Syi,SU2:=1N−1∑i∈U(yi−yˉU)2. For distinct i,j∈U, Cov⁡d(Ii,Ij)=−n(N−n)N2(N−1), and Var⁡d(yˉS)=(1−nN)SU2n. Both formulas include n=1 and the census case n=N.

Facts & Assumptions

Given: A finite population with fixed real values, N>1, and a uniform design on the n-element subsets of U for an integer 1≤n≤N.

[F1]

Finite populations and sampling designs: The population values are fixed; the design defines Ii, πi, πij, design expectation, the total T(y)=∑iyi, and the population mean yˉU=T(y)/N.

[F2]

Simple random sampling without replacement: Every n-element subset is in the design support and has probability (Nn)−1.

[F3]

Inclusion-covariance difference: Δij=πij−πiπj.

[F4]

Horvitz–Thompson variance and pair-inclusion estimate: When πi>0, the design variance of ∑iIiyi/πi is ∑i,jΔijyiyj/(πiπj).

[F5]

Moments, variance, and covariance on a probability space: Covariance is the expectation of the product of centered variables; variance is covariance with itself.

Proof

1.1givenF2choosealgebra

There are (Nn) supported samples; a fixed unit occurs in (N−1n−1) of them, so πi=n/N. If n=1, no sample contains distinct i,j; if 2≤n≤N, (N−2n−2) samples contain them, hence in either case πij=n(n−1)/(N(N−1)) for i≠j.

2.1F1F3F5step 1.1algebra

By [F1], Ed[Ii]=πi and Ed[IiIj]=∑s:i,j∈spd(s)=πij, while πii=πi; expanding [F5] gives Cov⁡d(Ii,Ij)=Ed[IiIj]−Ed[Ii]Ed[Ij]=πij−πiπj=Δij. Substitution from step 1.1 gives Cov⁡d(Ii,Ij)=n(n−1)N(N−1)−n2N2=−n(N−n)N2(N−1) for i≠j.

3.1F1F4step 1.1step 2.1algebra

Since πi=n/N, N−1∑iIiyi/πi=yˉS; by [F4], Var⁡d(yˉS)=1N2(∑iΔiiyi2πi2+∑i≠jΔijyiyjπi2). From πii=πi, Δii/πi2=(N−n)/n, and step 2.1 gives Δij/πi2=−(N−n)/(n(N−1)) for i≠j; thus Var⁡d(yˉS)=N−nN2n(∑iyi2−1N−1∑i≠jyiyj)=N−nN2nN∑iyi2−(∑iyi)2N−1=N−nNnSU2.

4.1F1F2step 3.1algebra∎

When n=N, the sample is the population and the factor 1−n/N is zero. When n=1, step 3.1 gives (1−1/N)SU2; the usual sample variance denominator n−1 is unavailable, but the design variance is defined.

Remarks

The PDF p. 14 covariance display in Shalabh's Chapter 2 has a positive-sign typo. The inclusion probabilities on that page and the defining identity Cov⁡(Ii,Ij)=πij−πiπj give the negative value proved above. The sample space has only (Nn) points, so the design distribution is finitely supported; the displayed variance alone is not an exact normal or t calibration.

5 · Examples, counterexamples and false statements

None yet.

Sources