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.
Assignment randomization and sharp-null tests
1 · Prerequisites
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Order, Zorn's Lemma, and the Axiom of Choice
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Tests, Neyman–Pearson and Valid P-values
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
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
Finite weighted upper-tail p-values and randomized ties
Statement
Let be a finite probability space, let , and let have law . Define Then for every . If an auxiliary random variable is independent of and uniform on , define Then for every .
Facts & Assumptions
Given: A finite probability space , a real score on it, and, for the randomized assertion, an independent with for .
Finite probability spaces, outcome weights, events, and event probabilities: and ; event probabilities are sums of the weights over the event.
The auxiliary randomizer is independent of and has the continuous uniform distribution on , characterized by .
Proof
The positive-weight support is nonempty by [F1]. List its finitely many distinct score values in decreasing order as , let , and put and . These cumulative masses satisfy .
If , then . For , the indices with form an initial segment; if its last index is , then , while an empty segment has probability zero. At the probability is one. Thus is superuniform.
On the score level , the strict-tail mass is and the tied mass is , so . By [A1], conditional on this score level its probability of being at most is zero for , for , and one for .
Multiplying these conditional probabilities by gives the lengths of . These consecutive intervals partition , so their lengths sum to . Therefore for every .
Finite randomized treatment-assignment models
Definition
Let , and let index the fixed experimental units at the actual treatment-assignment level. Let 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 identifies that unit, and no visit or repeated-measurement index is modeled here.
A known assignment law is a function satisfying , so is a finite probability space (Finite probability spaces, outcome weights, events, and event probabilities); assignments of probability zero may remain in . A potential-outcome schedule is a function , with . The schedule and the units are fixed; the assignment is the only randomness supplied by the design, and the observed response vector is . 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 with its full power-set sigma-algebra, which is a sigma-algebra by Sigma-algebras and makes a measurable space (Measurable spaces and measurable sets), and parameter set . For each let be the law (Law or distribution of a random element) of the deterministic observation map from . 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 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 since . 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 units, not an estimand for a wider population.
Inference in this page holds and fixed and averages over the declared law ; it does not condition on the realized assignment. The status of the quantities is explicit: and all are fixed, is random, 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 with , the law assigns mass to , and therefore determines . 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 , and restrictions on those values, are substantively untestable from this law, since changing them leaves unchanged. One realized assignment does not reveal responses at other assignments. These classifications do not make the design or scientific model empirically true.
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 there is a value such that for every allowed assignment . The full vector is then imputable under every assignment.
A predeclared ordering score is a real-valued statistic (Statistics and estimators) fixed before the assignment and outcomes are inspected. Its upper-tail ordering includes ties: assignment is at least as extreme as when . For a signed score and fixed null center , the corresponding two-sided ordering is explicitly . The center is part of the predeclared ordering; the sharp null alone does not force for an arbitrary signed score. A lower-tail ordering is represented by using 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.
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 and unit 's response under assignment vector is for fixed real potential responses and . For the fixed units, define the finite-population average treatment effect by The weak zero-average-effect null is the hypothesis ; 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 for every unit. No probability distribution on the fixed potential responses is part of either definition.
Fisher sharp-null randomization p-values are valid
Statement
In a finite randomized treatment-assignment model, fix any real-valued predeclared ordering score . For observed data define Let be the uniform probability measure on the Borel subsets of . For each , equip with the product sigma-algebra and define Let be the coordinate on this extension. Define For every schedule satisfying the Fisher sharp null and every , whereas the added randomization gives Thus 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 with its center 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 .
Finite randomized treatment-assignment models: the units and potential-outcome schedule are fixed, has the finite assignment law , and the observed response vector is .
Fisher sharp null and predeclared test orderings: under the Fisher sharp null there is one vector with for every unit and assignment; the ordering score is fixed before assignment and outcome inspection.
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.
Valid p-values: a p-value statistic is valid for a null when its probability of being at most is at most for every null law and every .
Statistics and estimators: a statistic is a measurable map from the experiment's data space to its stated target measurable space.
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.
The measure is uniform, so for .
Proof
The schedule with 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 by [F2]. For every realized assignment , the observed vector equals , and every assignment score is therefore imputable.
For each product-measurable , its section 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 , each section is the disjoint union of the sections , and countable additivity of passes through the finite weighted sum. Its total mass is . Moreover, for and Borel , Hence the data coordinate has law , is uniform and independent of the data, and therefore is independent of .
The formula is a finite sum of selected nonnegative assignment weights, so it lies in . 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 is measurable; hence the finite formula for is measurable. Its value lies between zero and the total assignment mass one.
On this fixed schedule set . Substituting from step 1.1 into the two displayed formulas identifies and with the two finite weighted rank transforms of [F3] on . By steps 1.2 and 2.1, is independent of and uniform, so the tie-randomized transform also satisfies [F3]. Hence and for every .
Since the bound holds for every schedule in the sharp null, [F4] makes a valid p-value for that null. The randomized value is uniform under each extended law , 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
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 2, §2.4
- Siva Balakrishnan, CMU 36-705 Lecture 28, §28.5 Fisher's Exact p-values
- Susan Holmes and Wolfgang Huber, Modern Statistics for Modern Biology, Chapter 13, §§13.2 and 13.4.4
- Siva Balakrishnan, CMU 36-705 Intermediate Statistics, Lecture 28, §§28.2–28.3