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.

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.

Depends on

Used by

Dependency tree · two levels

40 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