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.

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.

Depends on

Used by

Dependency tree · two levels

14 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