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.

Interference and exposure mappings

1 · Prerequisites

2 · Summary

Objective

Model fixed finite-population outcomes that may respond to assignments inside a group while stating partial interference across groups as a separate design assumption. Supply the finite conditional-expectation formula and finite-partition averaging identity used by the design proofs. Define exposure mappings and the outcome-consistency condition they need; under unitwise positive exposure probabilities, prove the Horvitz–Thompson exposure mean is design-unbiased. For a fully specified two-stage complete-randomization law, define direct, indirect, total, and overall strategy effects and prove the displayed estimators unbiased without a stratified-interference premise. Treat stratified interference as an extra premise for the source variance estimators, give their heterogeneity corrections, and state the minimum sample sizes needed to make those sample-variance formulas defined. These are conditional finite-design guarantees for fixed outcomes and the declared assignment law; they do not establish that a real assignment protocol was implemented as specified or that a proposed exposure map is substantively adequate.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite simple-random-sampling moment identities

Statement

Let n≥2, let x1,…,xn and y1,…,yn be fixed real numbers, and choose a subset A uniformly from the m-element subsets of {1,…,n}, where 1≤m≤n. Put xˉ=1n∑i=1nxi,xˉA=1m∑i∈Axi, and define yˉ,yˉA analogously. Define the finite-population covariance Sxy=1n−1∑i=1n(xi−xˉ)(yi−yˉ). Then E[xˉA]=xˉ,Cov⁡(xˉA,yˉA)=(1−mn)Sxym. When m≥2, define the sample covariance sxy,A=1m−1∑i∈A(xi−xˉA)(yi−yˉA). Then E[sxy,A]=Sxy. Taking yi=xi gives the corresponding variance identities.

Facts & Assumptions

Given: Fixed real lists x1,…,xn and y1,…,yn, and the uniform finite probability law on the m-element subsets of {1,…,n}.

[F1]

Finite probability spaces, outcome weights, events, and event probabilities: the sample space is finite, every subset is an event, and event probabilities are finite sums of outcome weights.

[F2]

Expectation of a real random variable on a finite probability space: for a real random variable X on a finite probability space (Ω,w), E[X]=∑ω∈ΩX(ω)w(ω).

[F3]

Variance, standard deviation, and covariance on a finite probability space: for real random variables on a finite probability space, covariance is the expectation of the product of their centered values.

[F4]

The set [A]k of k-element subsets and the binomial coefficient (nk):=∣[n]k∣: (nm) is the cardinality of the set of m-element subsets of an n-element set.

[F5]

Laws of finite sums and finite products: finite sums are additive, scaling distributes over finite sums, and finite sums can be split into consecutive ranges.

[F6]

Expectation is linear for every finite family of random variables, without any independence hypothesis: on a finite probability space, expectation distributes over every finite real linear combination without any independence assumption.

[F7]

Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule: finite sums over products split into iterated sums, and finite sums over disjoint subsets add to the sum over their union.

Proof

1.1givenF1F4algebra

There are (nm) equally likely subsets by [F4]. Count pairs (i,A) with i∈A in two ways: each m-element A contributes m pairs and each of the n indices occurs in (n−1m−1) such subsets, so m(nm)=n(n−1m−1) and P(i∈A)=m/n. For distinct ordered indices i,j, count pairs (i,j,A) with both in A: each subset contributes m(m−1) pairs and each ordered pair occurs in (n−2m−2) subsets when m≥2, so m(m−1)(nm)=n(n−1)(n−2m−2). Thus P(i,j∈A)=m(m−1)/(n(n−1)), also zero for m=1.

2.1F2F5F6step 1.1algebra

Using xˉA=m−1∑i1{i∈A}xi, expectation linearity [F6] and the inclusion probability from step 1.1 give E[xˉA]=m−1∑i(m/n)xi=xˉ. The same identity holds for y.

2.2givenF1F2F3F5F6F7step 1.1algebra

Set di=xi−xˉ and ei=yi−yˉ, so ∑idi=∑iei=0. Since the centered sample means have expectation zero, [F3], expectation linearity [F6], and the inclusion probabilities in step 1.1 give Cov⁡(xˉA,yˉA)=1m2∑i,jCov⁡(1{i∈A},1{j∈A})diej. The diagonal indicator covariance is m(n−m)/n2, and for i≠j it is −m(n−m)/(n2(n−1)), by subtracting the products of the marginal probabilities in step 1.1. Finite Fubini and splitting [F7] give ∑i≠jdiej=(∑idi)(∑jej)−∑idiei=−∑idiei. Substitution yields (n−m)/(mn(n−1))∑idiei=(1−m/n)Sxy/m.

3.1givenF2F5F6step 1.1step 2.2algebra∎

For m≥2, expansion around the population means gives ∑i∈A(xi−xˉA)(yi−yˉA)=∑i∈Adiei−m(xˉA−xˉ)(yˉA−yˉ). By expectation linearity [F6] and the inclusion probability in step 1.1, the expectation of the first term is (m/n)∑idiei=m(n−1)Sxy/n. The expectation of the second term is mCov⁡(xˉA,yˉA)=(n−m)Sxy/n by step 2.2. Their difference is (m−1)Sxy, so division by m−1 proves E[sxy,A]=Sxy.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional expectation on positive-probability events in finite spaces

Statement

Let (Ω,w) be a finite probability space and X:Ω→R. For any event B⊆Ω with P(B)>0, define E[X∣B]:=1P(B)∑ω∈BX(ω)w(ω). If A⊆Ω has 0<P(A)<1, then the function equal to E[X∣A] on A and E[X∣Ac] on Ac is a version of E[X∣σ(A)] under the integral characterization. More generally, if A1,…,Ar is a finite partition of Ω into events of positive probability, then E[X]=∑q=1rP(Aq)E[X∣Aq].

Facts & Assumptions

Given: A finite probability space (Ω,w), a real function X on Ω, an event A with 0<P(A)<1, and a finite positive-probability partition A1,…,Ar of Ω.

[F1]

Finite probability spaces, outcome weights, events, and event probabilities: Ω is finite, weights are nonnegative and sum to one, and event probabilities are sums of weights.

[F2]

Expectation of a real random variable on a finite probability space: E[X]=∑ω∈ΩX(ω)w(ω).

[F3]

Conditional expectation given a sigma algebra: a version given σ(A) is measurable with respect to that sigma-algebra and has the same integral as X on every event in it.

[F4]

Expectation agrees with the published finite weighted sum: on a finite probability space, the integral of a finite-valued function equals its finite weighted sum; applying this to 1EX gives the integral of X over any event E.

[F5]

Laws of finite sums and finite products: finite sums distribute over addition and real scaling.

[F6]

Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule: sums over finite sets may be split over disjoint unions, and their values are invariant under bijective reindexing.

Proof

1.1F1F2F5givenalgebra

For any event B with P(B)>0, the displayed definition is a finite real sum divided by a positive real. Its conditional weights wB(ω)=w(ω)/P(B) on B are nonnegative and sum to one, since ∑ω∈BwB(ω)=P(B)/P(B)=1. Thus this formula is the expectation under the probability law restricted and normalized to B.

2.1F1F2F3F4F6step 1.1given

Define T(ω)=E[X∣A] for ω∈A and T(ω)=E[X∣Ac] for ω∈Ac. The four events in σ(A) are ∅,A,Ac,Ω, so T is σ(A)-measurable. For either cell B∈{A,Ac}, its finite weighted integral satisfies ∫BT dP=P(B)E[X∣B]=∑ω∈BX(ω)w(ω)=∫BX dP by step 1.1 and [F4]. Splitting over the cells using [F6] proves the same identity for every event in σ(A). Since Ω is finite, X and T have finite weighted absolute sums and are integrable. Therefore [F3] makes T a conditional-expectation version.

2.2F2F5F6step 1.1givenalgebra

For the partition A1,…,Ar, disjoint splitting [F6] gives E[X]=∑q=1r∑ω∈AqX(ω)w(ω). By step 1.1, each inner sum is P(Aq)E[X∣Aq], proving the partition identity.

3.1step 1.1step 2.1step 2.2given∎

All conditional values and sums above are finite and every denominator is explicitly positive, so the proof uses no general conditional-expectation existence theorem or choice axiom.

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

Finite-population potential outcomes under partial interference

Definition

Let I be a finite set of treatment-assignment units partitioned into N≥1 nonempty groups I1,…,IN, with ni=∣Ii∣. Label the members of each group Ii by j=1,…,ni. Let Z⊆{0,1}I be the nonempty finite set of allowed global assignments in a finite randomized treatment-assignment model (Finite randomized treatment-assignment models, Finite probability spaces, outcome weights, events, and event probabilities). Write zi for the restriction of z∈Z to group i, and Zij for unit j's coordinate in its group.

A fixed finite-population potential-outcome schedule is a family of real-valued functions Yij:Z→R, one for every unit (i,j). The observed outcome at assignment Z is Yijobs=Yij(Z). The schedule is fixed; only the declared assignment is random. This notation permits arbitrary dependence of Yij(z) on every component of z.

The schedule satisfies partial interference when, for every unit (i,j) and all allowed z,z′∈Z, equality of their within-group assignments zi=zi′ implies Yij(z)=Yij(z′). In that case the common value is well-defined as Yij(zi): outcomes may depend arbitrarily on assignments within group i, but not on assignments outside that group. Partial interference is a substantive model/design restriction, not a consequence of randomization.

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

Exposure mappings and exposure consistency

Definition

In the finite-population model of Finite-population potential outcomes under partial interference, an exposure mapping for unit (i,j) is a function fij:Zi→Dij, where Zi is the finite set of allowed assignments to group i and Dij is a finite set of exposure labels. At assignment Z, the unit's exposure is the random label Dij=fij(Zi). Its design probability is πij(d)=P{fij(Zi)=d}=∑z∈Z: fij(zi)=dp(z), where p(z)=P(Z=z) is the declared assignment law.

The mapping is sufficient for the potential outcome of unit (i,j) on a set of labels if, whenever fij(zi)=fij(zi′)=d, the fixed outcomes satisfy Yij(zi)=Yij(zi′). For each label in the image of fij this condition defines a unique value Yij(d) equal to the common outcome over its preimage. The observed-outcome consistency identity is then Yijobs=Yij(Dij). An exposure-specific finite-population target may include unit (i,j) at label d only when πij(d)>0; otherwise its inverse-probability estimator is undefined. Sufficiency is an assumption about the schedule and map, not a consequence of knowing the assignment probabilities.

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

Two-stage randomized design and strategy-specific effects

Definition

Let N>1 groups have fixed sizes ni≥2, and let the fixed potential outcomes satisfy partial interference as in Finite-population potential outcomes under partial interference. Let ϕ and ψ be two group-specific treatment-allocation strategies. Under strategy s∈{ϕ,ψ}, group i has a fixed treated count Kis∈{1,…,ni−1}. Fix C∈{1,…,N−1}. The two-stage design first chooses uniformly a set of exactly C groups for ψ, assigning the other N−C groups to ϕ. Conditional on these strategy labels, it independently chooses in each group a uniformly random Kis-element subset for treatment, where s is that group's strategy. Here (nk) denotes the number of k-element subsets of an n-element set. Thus, for any strategy vector s with exactly C entries equal to ψ and any assignment vectors zi with ∑jzij=Kisi, P(S=s,Z=z)=(NC)−1∏i=1N(niKisi)−1; all other pairs have probability zero. In particular, P(Zij=1∣Si=s)=Kis/ni and P(Zij=0∣Si=s)=(ni−Kis)/ni, both positive.

Write Ei,s for expectation under the finite uniform assignment law within group i under strategy s. Conditional means given Zij=z are the finite conditional weighted sums, defined because that event has probability strictly between zero and one; Conditional expectation on positive-probability events in finite spaces verifies that their piecewise versions satisfy the integral characterization of Conditional expectation given a sigma algebra. Define the strategy-specific group and population mean potential outcomes by Yˉi(z;s)=1ni∑j=1niEi,s[Yij(Zi)∣Zij=z],Yˉ(z;s)=1N∑i=1NYˉi(z;s), for z∈{0,1}, and Yˉi(s)=1ni∑j=1niEi,s[Yij(Zi)],Yˉ(s)=1N∑i=1NYˉi(s). These are finite-population estimands: the outcomes are fixed, and the expectations average only over the specified within-group assignment strategy. Define DE(ψ)=Yˉ(0;ψ)−Yˉ(1;ψ),IE(ϕ,ψ)=Yˉ(0;ϕ)−Yˉ(0;ψ), TE(ϕ,ψ)=Yˉ(0;ϕ)−Yˉ(1;ψ),OE(ϕ,ψ)=Yˉ(ϕ)−Yˉ(ψ).

For an observed design realization, put mi1s=Kis and mi0s=ni−Kis, and define, whenever Si=s, Yˉ^i(z;s)=∑j=1ni1{Zij=z}Yijobsmizs,Yˉ^i(s)=1ni∑j=1niYijobs. The denominators are the fixed, positive realized arm sizes. With Cψ=C and Cϕ=N−C, define the observed population estimators Yˉ^(z;s)=1Cs∑i=1N1{Si=s}Yˉ^i(z;s),Yˉ^(s)=1Cs∑i=1N1{Si=s}Yˉ^i(s). The four strategy-contrast estimators DE^(ψ), IE^(ϕ,ψ), TE^(ϕ,ψ), and OE^(ϕ,ψ) are obtained by replacing each mean in the corresponding displayed target by its hatted estimator. No stratified-interference or additive-effects assumption is part of this design definition.

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

Horvitz–Thompson exposure-specific mean is design-unbiased

Statement

Let U={(i,j):1≤i≤N, 1≤j≤ni} be a fixed population of M=∑ini units. Let Z have a known finite assignment law p and fixed potential-outcome schedule satisfying partial interference. Fix an exposure label d for which the mapping in Exposure mappings and exposure consistency is sufficient and πij(d)>0 for every (i,j)∈U. Then μ^HT(d)=1M∑(i,j)∈U1{Dij=d}Yijobsπij(d) is an estimator of the finite-population exposure mean μ(d)=M−1∑(i,j)∈UYij(d) and satisfies Ep[μ^HT(d)]=μ(d). Therefore, for two labels d,e with the same positivity and sufficiency conditions, μ^HT(d)−μ^HT(e) is design-unbiased for μ(d)−μ(e). Dependence among units' exposures does not affect these expectation identities.

Facts & Assumptions

Given: A finite assignment space Z with weights p(z) summing to one, fixed potential outcomes Yij(zi), a fixed finite population U, and an exposure label d satisfying the conditions in the Statement.

[F1]

Finite-population potential outcomes under partial interference: Yij(zi) is fixed for each allowed group assignment, and Yijobs=Yij(Zi).

[F2]

Exposure mappings and exposure consistency: Dij=fij(Zi), πij(d)=∑zp(z)1{fij(zi)=d}, and exposure sufficiency means Yij(zi)=Yij(d) whenever fij(zi)=d.

[F3]

Finite probability spaces, outcome weights, events, and event probabilities: the allowed assignments form a finite probability space with event probabilities given by their weights.

[F4]

Expectation of a real random variable on a finite probability space: expectation is the finite weighted sum E[X]=∑ω∈ΩX(ω)w(ω).

[F5]

Statistics and estimators: an estimator is a statistic with the target space of its estimand; here the assignment and observed outcomes form the data, and the displayed formula is a real-valued function of that data.

[F6]

Laws of finite sums and finite products: finite sums are additive and scaling distributes over them.

[F7]

Expectation is linear for every finite family of random variables, without any independence hypothesis: expectation distributes over every finite real linear combination on a finite probability space.

Proof

1.1F1F2F3F4given

Fix a unit (i,j). Since πij(d)>0, the finite sum for the design expectation of its weighted contribution is defined. By [F1], [F2], [F3], and [F4], Ep ⁣[1{Dij=d}Yijobsπij(d)]=1πij(d)∑z∈Zp(z)1{fij(zi)=d}Yij(zi). For every term with nonzero indicator, [F2] makes the outcome equal to the fixed value Yij(d); terms with zero indicator vanish.

2.1step 1.1F2givenalgebra

The remaining sum in step 1.1 is Yij(d)πij(d)/πij(d)=Yij(d) by the definition of πij(d) and its strict positivity.

3.1step 2.1F3F4F5F6F7givenalgebra

The population has finitely many units. By expectation linearity [F7], distributing the estimator's finite sum and applying step 2.1 to each unit gives Ep[μ^HT(d)]=M−1∑(i,j)∈UYij(d)=μ(d). The displayed map is a statistic with the same real target space as μ(d), so it is an estimator by [F5].

4.1step 3.1F4F7givenalgebra∎

Applying step 3.1 to each of d and e and distributing the same finite expectation over their difference by [F7] proves the exposure-contrast identity. The argument used only marginal exposure probabilities, so it requires no independence between units' exposures.

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

Two-stage strategy-specific effect estimators are design-unbiased

Statement

Under the two-stage design of Two-stage randomized design and strategy-specific effects, for either strategy s∈{ϕ,ψ}, treatment value z∈{0,1}, and group i, E[Yˉ^i(z;s)∣Si=s]=Yˉi(z;s),E[Yˉ^i(s)∣Si=s]=Yˉi(s). Consequently, E[Yˉ^(z;s)]=Yˉ(z;s),E[Yˉ^(s)]=Yˉ(s). By taking the displayed contrasts, the design estimators of DE(ψ), IE(ϕ,ψ), TE(ϕ,ψ), and OE(ϕ,ψ) are unbiased. The proof does not require stratified interference or additive effects.

Facts & Assumptions

Given: The finite two-stage assignment law, fixed potential outcomes under partial interference, and the group and population targets and estimators in Two-stage randomized design and strategy-specific effects.

[F1]

Two-stage randomized design and strategy-specific effects: exactly Cs groups are assigned to each strategy s, and within group i under s exactly Kis of its ni units are chosen uniformly for treatment; the estimators divide by the fixed treatment-arm sizes and fixed group counts.

[F2]

Finite simple-random-sampling moment identities: under uniform fixed-size sampling from n units, each unit's inclusion probability is m/n, and the sample mean of fixed values has expectation equal to their finite-population mean.

[F3]
[F4]

Conditional expectation given a sigma algebra: a conditional-expectation version is measurable with respect to the conditioning sigma-algebra and has the same integrals on its events.

[F5]

Statistics and estimators: a statistic with the target space of an estimand is an estimator of that estimand.

[F6]

Estimands on a statistical model: an estimand is a specified function from the model's parameter set to its target-value set.

[F7]

Laws of finite sums and finite products: finite sums are additive and scaling distributes over finite sums.

[F8]

Conditional expectation on positive-probability events in finite spaces: positive-probability event conditioning is the finite conditional weighted sum, and averaging conditional means over a finite partition recovers unconditional expectation.

[F9]

Expectation is linear for every finite family of random variables, without any independence hypothesis: expectation distributes over finite real linear combinations on a finite probability space.

Proof

1.1F1F3F4F7F8F9given

Fix i,s,z. The number mizs of units with Zij=z is fixed and positive under [F1]. Each of the ni units has conditional probability mizs/ni of receiving z. Expanding the positive-probability event conditional mean by [F8] and distributing the finite sum over units by [F9] gives E[Yˉ^i(z;s)∣Si=s]=1mizs∑j=1niP(Zij=z∣Si=s)E[Yijobs∣Si=s,Zij=z]=1ni∑j=1niEi,s[Yij(Zi)∣Zij=z]=Yˉi(z;s). All conditioning events have positive probability by the bounds on Kis.

1.2F1F3F7F9given

By [F3], expectation linearity [F9] and the definition of Yˉi(s) give E[Yˉ^i(s)∣Si=s]=1ni∑j=1niEi,s[Yij(Zi)]=Yˉi(s). This uses no restriction on how one unit's outcome depends on other assignments within its group.

2.1step 1.1step 1.2F1F3F7F8F9algebra

Condition on the complete first-stage vector S. The denominators Cs are fixed, so expectation linearity [F9] and steps 1.1 and 1.2 yield E[Yˉ^(z;s)∣S]=1Cs∑i:Si=sYˉi(z;s),E[Yˉ^(s)∣S]=1Cs∑i:Si=sYˉi(s).

3.1step 2.1F2F3F7F8F9

The set of groups assigned strategy s is a uniform Cs-element subset of the N fixed groups. By [F2], each group has inclusion probability Cs/N, so the expectation of either average on the right of step 2.1 is the corresponding target population average. The finite-partition identity [F8] and expectation linearity [F9] prove the two population-mean identities.

4.1step 3.1F3F5F6F9algebra∎

Each effect estimator is the same finite linear contrast of estimated means as its target is of the corresponding target means. Distributing expectation over each contrast by [F9] and applying step 3.1 proves unbiasedness of all four effects. By [F5] and [F6], these statistic-valued contrasts are estimators of the displayed estimands.

Remarks

The assignment space and every sum in this proof are finite. The argument is choice-free and uses no conditional-expectation existence theorem on general probability spaces.

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

Stratified interference and source design-based variance estimators

Definition

In the setting of Two-stage randomized design and strategy-specific effects, stratified interference means that, for each group i, unit j, and treatment count k∈{1,…,ni−1}, the value Yij(zi) is the same for any two assignments zi,zi′ with ∑ℓziℓ=∑ℓziℓ′=k and zij=zij′. Thus at a fixed group treatment count an outcome may depend on the unit's own assignment, but not on which particular peers are treated. This assumption is additional to partial interference and is not needed for point-effect unbiasedness.

For strategy s and own treatment z, write Yij(z;s) for the common outcome at count Kis and own assignment z. Define Siz2(s)=1ni−1∑j=1ni{Yij(z;s)−Yˉi(z;s)}2,dij(s)=Yij(0;s)−Yij(1;s), Si01(s)=1ni−1∑j=1ni{Yij(0;s)−Yˉi(0;s)}{Yij(1;s)−Yˉi(1;s)}, and SiD2(s)=1ni−1∑j=1ni{dij(s)−Di(s)}2, where Di(s)=Yˉi(0;s)−Yˉi(1;s). In an observed group assigned s, define the estimated group direct effect by D^i(s):=Yˉ^i(0;s)−Yˉ^i(1;s). Let siz2(s) be the ordinary sample variance of the mizs observed outcomes in arm z, with denominator mizs−1, and let sD,s2 be the sample variance of the observed group direct-effect estimates D^i(s) across the Cs groups assigned to s.

The source direct-effect variance estimator under strategy s is V^D(s)=(1−CsN)sD,s2Cs+1CsN∑i:Si=s{si02(s)ni−Kis+si12(s)Kis}. For the indirect, total, and overall effect contrasts define V^I(ϕ,ψ)=s0,ϕ2N−C+s0,ψ2C,V^T(ϕ,ψ)=s0,ϕ2N−C+s1,ψ2C, V^O(ϕ,ψ)=sϕ2N−C+sψ2C, where sz,s2 is the sample variance across groups assigned s of the observed group estimates Yˉ^i(z;s), and ss2 is the sample variance across such groups of Yˉ^i(s).

These are design-randomization variance estimators for the fixed finite-population point estimators. The group-arm sample variances in these formulas are defined only if C≥2 and N−C≥2. In addition, V^D(s) requires 2≤Kis≤ni−2 for every group, so both within-group arm sample variances have nonzero denominators. The point estimators themselves remain defined under the broader counts 1≤Kis<ni.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite two-stage sampling variance identities

Statement

Let N≥4 groups be completely randomized, with exactly C groups assigned ψ and N−C assigned ϕ, where 2≤C≤N−2. For each group i and strategy s∈{ϕ,ψ}, let ai(s) be a fixed real value and let Xi(s) be a real-valued random variable from that group's finite second-stage assignment law, with E[Xi(s)]=ai(s) and vi(s)=Var⁡(Xi(s)). Conditional on the first-stage vector, the group-specific second-stage random variables are independent. Let Cψ=C, Cϕ=N−C, and define μ^s=1Cs∑i:Si=sXi(s),sX,s2=1Cs−1∑i:Si=s(Xi(s)−μ^s)2. For Ss2=(N−1)−1∑i(ai(s)−aˉ(s))2 and Sψ−ϕ2=(N−1)−1∑i{ai(ψ)−ai(ϕ)−a(ψ)−a(ϕ)‾}2, one has Var⁡(μ^s)=(1−CsN)Ss2Cs+1CsN∑i=1Nvi(s),E[sX,s2]=Ss2+1N∑i=1Nvi(s), and Var⁡(μ^ψ−μ^ϕ)=Sψ2C+Sϕ2N−C−Sψ−ϕ2N+1CN∑ivi(ψ)+1(N−C)N∑ivi(ϕ). Consequently, E ⁣[sX,ψ2C+sX,ϕ2N−C]=Var⁡(μ^ψ−μ^ϕ)+Sψ−ϕ2N.

Facts & Assumptions

Given: The finite two-stage assignment law with fixed strategy-arm sizes, fixed real group values ai(s), and finite second-stage random variables Xi(s) whose conditional laws are independent across groups and have means ai(s) and variances vi(s).

[F1]

Two-stage randomized design and strategy-specific effects: the first-stage strategy-ψ groups are a uniform C-element subset of the N groups, and the second-stage assignments are independent across groups conditional on the strategy vector.

[F2]

Finite simple-random-sampling moment identities: for a uniform fixed-size subset, sample means have covariance (1−m/n)Sxy/m, and sample covariance is unbiased for the corresponding finite-population covariance.

[F3]

Expectation of a real random variable on a finite probability space and Variance, standard deviation, and covariance on a finite probability space: expectations and variances are finite weighted sums and centered second moments on the finite assignment space.

[F4]

Laws of finite sums and finite products: finite sums distribute over addition and scalar multiplication.

[F5]

Expectation is linear for every finite family of random variables, without any independence hypothesis: expectation distributes over finite sums on a finite probability space.

[F6]

Conditional expectation on positive-probability events in finite spaces: averaging conditional expectations over a finite partition recovers unconditional expectation.

[F7]

Variance adds for every finite pairwise-independent family: for a finite pairwise-independent family of square-integrable real random variables, the variance of the sum is the sum of their variances.

Proof

1.1F1F2F3F5F6givenalgebra

For a fixed strategy s, write As(S)=Cs−1∑i:Si=sai(s) and Es=Cs−1∑i:Si=sϵi(s), where ϵi(s)=Xi(s)−ai(s); then μ^s=As+Es. By [F2], E[As]=aˉ(s). Conditional on each first-stage vector, E[Es∣S]=0 by centering; [F6] therefore gives E[Es]=0 and E[(As−aˉ(s))Es]=0. Expanding the variance definition [F3] and using [F5] now gives Var⁡(μ^s)=Var⁡(As)+E[Es2]=Var⁡(As)+E[Var⁡(Es∣S)].

1.2F1F2F4F5F6F7algebra

Conditional on a first-stage vector, expand the within-arm sum of squares using [F4]: ∑i:Si=s(Xi(s)−μ^s)2=∑i:Si=s(ai(s)−As)2+∑i:Si=sϵi(s)2−CsEs2+2∑i:Si=s(ai(s)−As)ϵi(s). The last term has conditional mean zero. By expectation linearity [F5] and variance addition [F7], the conditional mean of ∑iϵi(s)2−CsEs2 is (1−1/Cs)∑i:Si=svi(s). Dividing by Cs−1, then averaging over the first-stage partition by [F5] and [F6], gives the expected fixed selected sample variance plus N−1∑ivi(s); the fixed sample-variance identity and inclusion probabilities in [F2] make these terms Ss2 and N−1∑ivi(s). Thus E[sX,s2]=Ss2+N−1∑ivi(s).

1.3F1F2F3F4algebra

Let Sψϕ=(N−1)−1∑i(ai(ψ)−aˉ(ψ))(ai(ϕ)−aˉ(ϕ)). If aˉϕ S is the sample mean of the fixed ai(ϕ) values in the ψ-selected groups, the complementary ϕ-group mean equals (Naˉ(ϕ)−Caˉϕ S)/(N−C). Applying the covariance identity in [F2] to both fixed lists on the same C-group sample gives Cov⁡(aˉψ S,aˉϕ S)=(1−C/N)Sψϕ/C; the complement identity then makes the covariance between the fixed ψ-sample mean and the fixed ϕ-complement mean equal to −Sψϕ/N.

2.1F1F2F5F6F7step 1.1algebra

Conditional on a first-stage vector, the selected errors are a finite pairwise-independent family, so [F7] gives Var⁡(Es∣S)=Cs−2∑i:Si=svi(s). The selected groups form a uniform Cs-element sample, with inclusion probabilities Cs/N by [F2]. Averaging the conditional variance over first-stage vectors using [F5] and [F6] yields E[Var⁡(Es∣S)]=Cs−2∑i(Cs/N)vi(s)=∑ivi(s)/(CsN). The fixed component Var⁡(As)=(1−Cs/N)Ss2/Cs by [F2]; step 1.1 then proves the first one-arm variance identity.

2.2F1F2F3F5F6F7step 1.3algebra

Write AΔ=Aψ−Aϕ and EΔ=Eψ−Eϕ. Conditional on the first-stage vector, all selected group errors are centered and independent across groups; [F7] gives Var⁡(EΔ∣S)=C−2∑i:Si=ψvi(ψ)+(N−C)−2∑i:Si=ϕvi(ϕ). By [F6], its covariance with the fixed AΔ is zero and its conditional variance averages over the design to ∑ivi(ψ)/(CN)+∑ivi(ϕ)/((N−C)N), using the inclusion probabilities in [F2]. Expanding the variance definition [F3] with linearity [F5] shows the total contrast variance is the fixed component plus this averaged error variance. The fixed component has variance (1−C/N)Sψ2/C+(C/N)Sϕ2/(N−C)+2Sψϕ/N by [F2] and step 1.3. Since Sψ−ϕ2=Sψ2+Sϕ2−2Sψϕ, this is Sψ2/C+Sϕ2/(N−C)−Sψ−ϕ2/N. Adding the second-stage terms proves the stated contrast-variance identity.

3.1F5step 1.2step 2.2algebra∎

By step 1.2 and expectation linearity [F5], the expected arm-wise variance sum is Sψ2/C+Sϕ2/(N−C)+∑ivi(ψ)/(CN)+∑ivi(ϕ)/((N−C)N). Comparing with step 2.2 leaves exactly Sψ−ϕ2/N.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Stratified-interference variance estimators are conservative

Statement

Assume the two-stage design of Two-stage randomized design and strategy-specific effects, stratified interference as in Stratified interference and source design-based variance estimators, and 2≤C≤N−2. For the population direct-effect variance estimator under ψ, additionally assume 2≤Kiψ≤ni−2 for every group. Then E[V^D(ψ)]=Var⁡(DE^(ψ))+1N2∑i=1NSiD2(ψ)ni. For the source arm-wise variance estimators of the indirect, total, and overall contrasts, E[V^I(ϕ,ψ)]=Var⁡(IE^(ϕ,ψ))+SI2N, E[V^T(ϕ,ψ)]=Var⁡(TE^(ϕ,ψ))+ST2N,E[V^O(ϕ,ψ)]=Var⁡(OE^(ϕ,ψ))+SO2N, where Ii=Yˉi(0;ϕ)−Yˉi(0;ψ),Ti=Yˉi(0;ϕ)−Yˉi(1;ψ),Oi=Yˉi(ϕ)−Yˉi(ψ), and, with Iˉ=N−1∑iIi, Tˉ=N−1∑iTi, and Oˉ=N−1∑iOi, SI2=1N−1∑i(Ii−Iˉ)2,ST2=1N−1∑i(Ti−Tˉ)2,SO2=1N−1∑i(Oi−Oˉ)2. All correction terms are nonnegative. The direct-effect correction is zero exactly when, within every group, the individual direct effects Yij(0;ψ)−Yij(1;ψ) are constant across j. Each contrast correction is zero exactly when its corresponding group-level effects are constant across i. Thus the variance estimators are conservative, and equality requires the stated additivity condition. The variance estimators are undefined outside their stated minimum sample sizes; the point-effect estimators remain defined for the wider design range 1≤Kis<ni.

Facts & Assumptions

Given: Fixed finite-population potential outcomes; the two-stage complete randomization; stratified interference; 2≤C≤N−2; and, for the direct variance estimator under ψ, 2≤Kiψ≤ni−2 for every group.

[F1]

Two-stage randomized design and strategy-specific effects: exactly C groups are selected uniformly for ψ, and conditional on strategy labels, the fixed-size within-group treatment subsets are uniform and independent across groups.

[F2]

Stratified interference and source design-based variance estimators: at a fixed within-group treated count, each unit's outcome is invariant to which peers are treated; it defines the sample-variance estimators used below.

[F3]

Finite simple-random-sampling moment identities: finite-population sample means have the stated covariance identity, and observed sample covariance is unbiased when the sample size is at least two.

[F4]

Finite two-stage sampling variance identities: first-stage strategy means and contrasts have the stated design variance formulas, and the usual arm-wise variance estimator adds the finite-population variance of the group-level contrast divided by N.

[F5]

Variance, standard deviation, and covariance on a finite probability space: design variance is the finite expectation of the squared centered estimator, with covariance the corresponding centered product expectation.

[F6]

Two-stage strategy-specific effect estimators are design-unbiased: the observed group means under either strategy are unbiased for their defined group-level targets.

[F7]

Laws of finite sums and finite products: finite sums distribute over addition and scaling.

[F8]

Expectation is linear for every finite family of random variables, without any independence hypothesis: expectation distributes over finite real linear combinations on a finite probability space.

[F9]

Conditional expectation on positive-probability events in finite spaces: event-conditioned means are finite weighted sums and conditional expectations average over a finite partition to the unconditional expectation.

[F10]

Measurable coordinatewise functions preserve independence: measurable coordinatewise functions of independent random elements remain independent.

Proof

1.1F1F2F3F9given

Fix a group i assigned to ψ, put k=Kiψ, and set x0j=Yij(0;ψ) and x1j=Yij(1;ψ). By [F9], conditioning on Si=ψ uses the finite conditional weighted-sum law; [F2] fixes the two potential-outcome lists, while [F1] makes the treated units a uniform k-subset and the controls its uniform (ni−k)-element complement. If xˉ0,T is the treated-subset mean of x0 and xˉ0 is its full-group mean, the control mean is xˉ0−kni−k(xˉ0,T−xˉ0). Both arm means have expectations xˉ0,xˉ1 by [F3], so E[D^i(ψ)∣Si=ψ]=Di(ψ).

1.2F1F2F4F6F8F10given

For the indirect contrast apply [F4] with ai(ϕ)=Yˉi(0;ϕ) and ai(ψ)=Yˉi(0;ψ) and observed group means Xi(s)=Yˉ^i(0;s). These are measurable functions of their groups' second-stage assignments, so [F1] and [F10] supply [F4]'s conditional-independence premise; [F6] supplies the means. The arm-wise estimator's correction is SI2/N. For the total contrast use ai(ϕ)=Yˉi(0;ϕ) and ai(ψ)=Yˉi(1;ψ) with their corresponding observed group means; [F6] and [F4] give correction ST2/N. For the overall contrast use ai(s)=Yˉi(s) and Xi(s)=Yˉ^i(s); the same results give correction SO2/N. The formulas are exactly the arm-wise variance sums in [F2], and expectation linearity [F8] gives each displayed identity.

2.1F2F3F5F7F8F9step 1.1algebra

Write Si02,Si12 for the finite-population variances of x0,x1 and Si01 for their covariance. By [F3], Cov⁡(xˉ0,T,xˉ1,T)=(1−k/ni)Si01/k, so the control-mean covariance with the treated mean is −kni−k(1−k/ni)Si01/k=−Si01/ni. Also the control-mean variance is kSi02/(ni(ni−k)) and the treated-mean variance is (ni−k)Si12/(nik). Expanding the variance of their difference by [F5], expectation linearity [F8], and [F7], and using SiD2=Si02+Si12−2Si01, gives vi=Var⁡(D^i(ψ)∣Si=ψ)=Si02/(ni−k)+Si12/k−SiD2(ψ)/ni. The sample-covariance identity [F3] makes E[si02∣Si=ψ]=Si02 and E[si12∣Si=ψ]=Si12; hence E[v^i∣Si=ψ]=vi+SiD2(ψ)/ni for v^i=si02/(ni−k)+si12/k.

3.1F1F2F4F8F9F10step 1.1step 2.1givenalgebra

Each group estimator D^i(ψ) is a measurable function of that group's second-stage assignment. By the conditional independence in [F1] and [F10], these estimators are conditionally independent across groups, so [F4] applies using the means from step 1.1 and variances from step 2.1. With SD2=(N−1)−1∑i(Di(ψ)−DE(ψ))2, [F4] gives Var⁡(DE^(ψ))=(1−C/N)SD2/C+(CN)−1∑ivi and E[sD,ψ2]=SD2+N−1∑ivi. Therefore the first component of V^D has expectation (1−C/N)SD2/C+(1−C/N)(CN)−1∑ivi. By [F8], [F9], and P(Si=ψ)=C/N, the second component has expectation N−2∑i{vi+SiD2(ψ)/ni}. Adding the components and using (1−C/N)/(CN)+1/N2=1/(CN) proves the direct-effect identity.

4.1F2F7step 3.1step 1.2algebra∎

Each correction is a positive constant times a finite sum of squared deviations. By [F7], such a correction is zero exactly when every squared deviation is zero: the direct correction requires each within-group direct effect to be constant across units, and each contrast correction requires its corresponding group-level effects to be constant across groups. Thus every correction is nonnegative and the stated equality conditions are exact.

5 · Examples, counterexamples and false statements

None yet.

Sources