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 — Examples
1 · Prerequisites
- Assignment randomization and sharp-null tests
- 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
The examples calculate a two-sided test under unequal assignment probabilities with tied scores, showing the conservative weighted p-value and the exact uniform value obtained by randomizing within the atom. A separate two-unit schedule has zero Finite-population average treatment effect and weak null while each unit's outcome changes, demonstrating why the Fisher sharp null is a stronger hypothesis.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Zero average effect need not be a Fisher sharp null
Statement refuted
In a binary no-interference treatment model, a zero finite-population average treatment effect implies the Fisher sharp null.
Facts & Assumptions
Given: Two units with binary treatment vector in , assignment probability at each vector, and fixed responses and .
Finite randomized treatment-assignment models: is the fixed response of unit under assignment ; assignment probability is separate from this schedule.
Finite-population average treatment effect and weak null: the weak null is zero average of the unit-level effects in the no-interference binary-treatment submodel.
Fisher sharp null and predeclared test orderings: the Fisher sharp null requires each unit's response to be invariant over every allowed assignment.
Counterexample
Under the stated no-interference schedule, unit 1's treatment effect is , while unit 2's is . Their finite-population average from [F2] is . The four assignment weights are nonnegative and sum to one, so they define a valid finite assignment law.
But and . Thus both units' responses vary across allowed assignments, contrary to [F3]. The average-effect null [F2] does not imply the Fisher sharp null.
A weighted two-sided randomization test with tied scores
Example
Let three units have fixed outcomes under every assignment, and randomize exactly one unit to treatment. The assignments select unit 1, 2, or 3 with probabilities , , and , respectively. Use the treatment-minus-control mean as signed score and its absolute value as the predeclared two-sided ordering about zero. The upper-tail p-value is for either outer assignment and for the middle assignment. It is superuniform despite the unequal assignment weights and the tied outer scores; an independent uniform tie randomizer gives an exactly uniform p-value.
Facts & Assumptions
Given: The three-unit complete randomization described above, its fixed potential-outcome schedule, and an independent uniform on .
Finite randomized treatment-assignment models: the outcomes are fixed under the design and the only assignment randomness has the specified finite law.
Fisher sharp null and predeclared test orderings: a two-sided ordering about null center zero uses and includes ties in the upper tail.
Fisher sharp-null randomization p-values are valid: the weighted upper-tail value is superuniform under every Fisher sharp-null schedule, and independent uniform randomization within tied mass is exactly uniform.
The auxiliary is independent of the treatment assignment and satisfies for .
Verification
Given: The outcomes, assignment weights, treatment-minus-control mean, and auxiliary randomizer stated above.
The assignment weights are nonnegative and sum to one, and each unit's outcome is the same under all three assignments, so this is a finite assignment law satisfying the Fisher sharp null.
If unit 1, 2, or 3 is treated, the signed differences are respectively , , and . The two-sided scores are therefore .
Each outer assignment has inclusive upper-tail mass ; the middle score is the minimum, so its inclusive upper-tail mass is . The nonrandomized p-value therefore equals with probability and with probability . Its distribution function is below , on , and at , which is at most its argument throughout .
At either outer assignment the strict-tail mass is zero and the tied mass is , so . At the middle assignment the strict-tail mass is and the tied mass is , so .
For , the outer assignments contribute . For , they contribute and the middle assignment contributes ; hence on the entire unit interval. Together with step 3.1, this verifies the theorem's superuniform and uniform conclusions for this assignment law.