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.

✓ 2 results · all verified · 1 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Assignment randomization and sharp-null tests

1 · Prerequisites

2 · Summary

This page treats the finite assignment law as the source of probability while experimental units and their potential-outcome schedule remain fixed. The Fisher sharp null makes each unit's response imputable under every allowed assignment. A finite weighted-rank argument proves validity for the actual assignment probabilities, including unequal weights; an independent uniform randomizer fills tied score masses to produce an exactly uniform p-value. Two-sided orderings are fixed in advance by comparing an absolute score to a declared null center. The result is design-based and does not assert a Gaussian response law or validity under the weak null Finite-population average treatment effect and weak null.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Finite weighted upper-tail p-values and randomized ties

Statement

Let (Ω,w) be a finite probability space, let T:Ω→R, and let Z have law w. Define q(z):=∑ω∈Ωw(ω)1{T(ω)≥T(z)}. Then Pr⁡(q(Z)≤u)≤u for every u∈[0,1]. If an auxiliary random variable U is independent of Z and uniform on [0,1], define q+(Z,U):=∑ω∈Ωw(ω)1{T(ω)>T(Z)}+U∑ω∈Ωw(ω)1{T(ω)=T(Z)}. Then Pr⁡(q+(Z,U)≤u)=u for every u∈[0,1].

Facts & Assumptions

Given: A finite probability space (Ω,w), a real score T on it, and, for the randomized assertion, an independent U with Pr⁡(U≤u)=u for u∈[0,1].

[F1]

Finite probability spaces, outcome weights, events, and event probabilities: w(ω)≥0 and ∑ω∈Ωw(ω)=1; event probabilities are sums of the weights over the event.

[A1]

The auxiliary randomizer is independent of Z and has the continuous uniform distribution on [0,1], characterized by Pr⁡(U≤u)=u.

Proof

technique · direct finite enumeration of score levels
1.1givenF1construct

The positive-weight support is nonempty by [F1]. List its finitely many distinct score values in decreasing order as t1>⋯>tm, let dj=∑T(ω)=tjw(ω)>0, and put a0=0 and aj=∑k=1jdk. These cumulative masses satisfy 0=a0<a1<⋯<am=1.

2.1givenF1step 1.1algebra

If T(Z)=tj, then q(Z)=aj. For u<1, the indices with aj≤u form an initial segment; if its last index is j0, then Pr⁡(q(Z)≤u)=∑j≤j0dj=aj0≤u, while an empty segment has probability zero. At u=1 the probability is one. Thus q(Z) is superuniform.

2.2givenA1step 1.1algebra

On the score level tj, the strict-tail mass is aj−1 and the tied mass is dj, so q+(Z,U)=aj−1+Udj. By [A1], conditional on this score level its probability of being at most u is zero for u≤aj−1, (u−aj−1)/dj for aj−1<u<aj, and one for u≥aj.

3.1step 2.2step 1.1algebra∎

Multiplying these conditional probabilities by dj gives the lengths of [aj−1,aj]∩[0,u]. These consecutive intervals partition [0,1], so their lengths sum to u. Therefore Pr⁡(q+(Z,U)≤u)=u for every u∈[0,1].

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite randomized treatment-assignment models

Definition

Let N≥1, and let I={1,…,N} index the fixed experimental units at the actual treatment-assignment level. Let Z be a nonempty finite set of allowed assignments. If treatment is assigned to clusters, each cluster is one indexed unit; no separate probability-sampling unit is present. The index i identifies that unit, and no visit or repeated-measurement index is modeled here.

A known assignment law is a function p:Z→[0,1] satisfying ∑z∈Zp(z)=1, so (Z,p) is a finite probability space (Finite probability spaces, outcome weights, events, and event probabilities); assignments of probability zero may remain in Z. A potential-outcome schedule is a function θ:I×Z→R, with Yi(z):=θ(i,z). The schedule and the units are fixed; the assignment Z is the only randomness supplied by the design, and the observed response vector is Yθ(Z)=(Yi(Z))i∈I. The schedule is defined for every allowed assignment, including zero-probability assignments, and may depend on the full assignment vector, so no no-interference assumption is implicit. The scientific statistical model contract Scientific statistical model contracts requires the observation space, units, quantity status, observation mechanism, support, conditioning convention, and adequacy assumptions to be recorded; this model specifies those fields as follows.

To express this as a statistical experiment, take the data space X=Z×RI with its full power-set sigma-algebra, which is a sigma-algebra by Sigma-algebras and makes X a measurable space (Measurable spaces and measurable sets), and parameter set Θ=RI×Z. For each θ∈Θ let Pθ be the law (Law or distribution of a random element) of the deterministic observation map Oθ(z)=(z,Yθ(z)) from (Z,p). The map is measurable because its domain has the full power set, in the preimage sense of A measurable function between measurable spaces, and its law is a probability measure by The law of a random element is a probability measure. Thus ((X,2X),Θ,(Pθ)θ∈Θ) is an experiment in the sense of Statistical experiments. The assignment law asserts no response-error model, Gaussian law, superpopulation randomization, or sampling representativeness beyond the stated finite assignment mechanism. Its finite full-measure support set is Sθ:={(z,Yθ(z)):z∈Z, p(z)>0}, since Pθ(Sθ)=∑z:p(z)>0p(z)=1. The record contains the assigned vector and every unit's response; missing or censored outcomes and repeated visits require a separately declared observation mechanism. The inferential target is the assignment-invariance hypothesis for these N units, not an estimand for a wider population.

Inference in this page holds I and θ fixed and averages over the declared law p; it does not condition on the realized assignment. The status of the quantities is explicit: θ and all Yi(z) are fixed, Z is random, (Z,Yθ(Z)) is observed, and potential responses under unassigned vectors are fixed but latent. The assignment set, weights, and implemented randomization protocol are design-controlled and should be checked against protocol records. Assignment logs and response records are empirically assessable, but those checks do not prove that the declared law generated the data. Potential outcomes under unassigned vectors are fixed and latent in the realized record. This does not imply nonidentifiability from the observed-data law: for each z with p(z)>0, the law assigns mass p(z) to (z,Yθ(z)), and therefore determines Yθ(z). Assignment invariance on this positive-probability set is empirically assessable, and the theorem tests the stronger invariance hypothesis on all allowed assignments. Values at assignments with p(z)=0, and restrictions on those values, are substantively untestable from this law, since changing them leaves Pθ unchanged. One realized assignment does not reveal responses at other assignments. These classifications do not make the design or scientific model empirically true.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Fisher sharp null and predeclared test orderings

Definition

In the finite randomized treatment-assignment model Finite randomized treatment-assignment models, a schedule satisfies the Fisher sharp null when for each unit i there is a value yi such that Yi(z)=yi for every allowed assignment z. The full vector y=(yi)i∈I is then imputable under every assignment.

A predeclared ordering score is a real-valued statistic T:Z×RI→R (Statistics and estimators) fixed before the assignment and outcomes are inspected. Its upper-tail ordering includes ties: assignment z′ is at least as extreme as z when T(z′,y)≥T(z,y). For a signed score S and fixed null center s0, the corresponding two-sided ordering is explicitly T(z,y)=∣S(z,y)−s0∣. The center is part of the predeclared ordering; the sharp null alone does not force s0=0 for an arbitrary signed score. A lower-tail ordering is represented by using −S as the score. A statistic in this setting is a measurable map in the sense of Statistics and estimators; the full power-set data sigma-algebra makes every such real-valued map measurable.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite-population average treatment effect and weak null

Definition

Consider the no-interference binary-treatment submodel of Finite randomized treatment-assignment models in which the allowed assignment set is {0,1}I and unit i's response under assignment vector z is Yi(z)=Yi(zi) for fixed real potential responses Yi(0) and Yi(1). For the fixed units, define the finite-population average treatment effect by τF:=1N∑i∈I(Yi(1)−Yi(0)). The weak zero-average-effect null is the hypothesis τF=0; it constrains the average of the unit-level effects, not each effect separately. The Fisher sharp null in this submodel, defined in Fisher sharp null and predeclared test orderings, requires Yi(1)=Yi(0) for every unit. No probability distribution on the fixed potential responses is part of either definition.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Fisher sharp-null randomization p-values are valid

Statement

In a finite randomized treatment-assignment model, fix any real-valued predeclared ordering score T(z,y). For observed data (z,y) define prand(z,y):=∑z′∈Zp(z′)1{T(z′,y)≥T(z,y)}. Let λ be the uniform probability measure on the Borel subsets of [0,1]. For each θ, equip X×[0,1] with the product sigma-algebra 2X⊗B([0,1]) and define P~θ(E):=∑z∈Zp(z) λ({u∈[0,1]:((z,Yθ(z)),u)∈E}). Let U be the [0,1] coordinate on this extension. Define p+(z,y,U):=∑z′∈Zp(z′)1{T(z′,y)>T(z,y)}+U∑z′∈Zp(z′)1{T(z′,y)=T(z,y)}. For every schedule satisfying the Fisher sharp null and every u∈[0,1], Pθ ⁣(prand(Z,Yθ(Z))≤u)≤u, whereas the added randomization gives P~θ ⁣(p+(Z,Yθ(Z),U)≤u)=u. Thus prand is a valid finite-sample p-value for the sharp null, and randomized ties give an exactly uniform p-value when the additional independent uniform randomizer is used. For a two-sided test, take T(z,y)=∣S(z,y)−s0∣ with its center s0 fixed in advance. The result uses the actual, possibly unequal assignment probabilities; random assignment supplies no Gaussian error law, and this theorem makes no validity claim under the weak zero-average-effect null from Finite-population average treatment effect and weak null unless it is also Fisher-sharp.

Facts & Assumptions

Given: A finite assignment set with its known probability law, a fixed potential-outcome schedule satisfying the Fisher sharp null, a predeclared real-valued score on assignment and response data, and the uniform probability measure λ on [0,1].

[F1]

Finite randomized treatment-assignment models: the units and potential-outcome schedule are fixed, Z has the finite assignment law p, and the observed response vector is Yθ(Z).

[F2]

Fisher sharp null and predeclared test orderings: under the Fisher sharp null there is one vector y with Yi(z)=yi for every unit and assignment; the ordering score is fixed before assignment and outcome inspection.

[F3]

Finite weighted upper-tail p-values and randomized ties: for any finite weighted assignment law and real score, the inclusive weighted upper-tail rank is superuniform, and an independent uniform variable fills each score atom to give an exactly uniform value.

[F4]

Valid p-values: a p-value statistic is valid for a null when its probability of being at most u is at most u for every null law and every u∈[0,1].

[F5]

Statistics and estimators: a statistic is a measurable map from the experiment's data space to its stated target measurable space.

[F6]

Finite-population average treatment effect and weak null: in the no-interference binary-treatment submodel, the weak null requires only the finite-population average of unit effects to be zero; the sharp null requires every unit effect to be zero.

[A1]

The measure λ is uniform, so λ([0,u])=u for u∈[0,1].

Proof

technique · reduce each sharp-null schedule to the finite weighted rank lemma
1.1givenF1F2F4constructchoose

The schedule with Yi(z)=0 for every unit and assignment belongs to the Fisher sharp null, so its null class is nonempty as required by [F4]. Fix any sharp-null schedule θ and choose its common response vector y by [F2]. For every realized assignment Z, the observed vector Yθ(Z) equals y, and every assignment score T(z,y) is therefore imputable.

1.2F1A1givenconstructalgebra

For each product-measurable E, its section Ex:={u:(x,u)∈E} is Borel, since the sets with Borel sections form a sigma-algebra containing all measurable rectangles. Thus the displayed finite sum defines a measure: for disjoint En, each section (⋃nEn)Oθ(z) is the disjoint union of the sections (En)Oθ(z), and countable additivity of λ passes through the finite weighted sum. Its total mass is ∑zp(z)λ([0,1])=1. Moreover, for A⊆X and Borel B⊆[0,1], P~θ(A×B)=∑z:Oθ(z)∈Ap(z)λ(B)=Pθ(A)λ(B). Hence the data coordinate has law Pθ, U is uniform and independent of the data, and therefore U is independent of Z.

2.1F1F5step 1.1step 1.2algebra

The formula prand(z,y) is a finite sum of selected nonnegative assignment weights, so it lies in [0,1]. It is a statistic because the data space has its full power-set sigma-algebra, so every preimage is measurable by [F5]. On the extension, each score-comparison condition defines a measurable subset of the data space, while U is measurable; hence the finite formula for p+ is measurable. Its value lies between zero and the total assignment mass one.

3.1F3step 1.1step 1.2step 2.1

On this fixed schedule set Ty(z)=T(z,y). Substituting Yθ(Z)=y from step 1.1 into the two displayed formulas identifies prand(Z,Yθ(Z)) and p+(Z,Yθ(Z),U) with the two finite weighted rank transforms of [F3] on (Z,p). By steps 1.2 and 2.1, U is independent of Z and uniform, so the tie-randomized transform also satisfies [F3]. Hence Pθ(prand(Z,Yθ(Z))≤u)≤u and P~θ(p+(Z,Yθ(Z),U)≤u)=u for every u∈[0,1].

4.1F2F4F6step 3.1algebra∎

Since the bound holds for every schedule in the sharp null, [F4] makes prand a valid p-value for that null. The randomized value is uniform under each extended law P~θ, and therefore is also superuniform there; its threshold rule has null rejection probability at most its threshold. No step uses an error distribution. By [F2] and [F6], the argument covers a weak average-effect schedule only when it also satisfies the sharp null.

5 · Examples, counterexamples and false statements

None yet.

Sources