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.
Exact permutation tests and random-permutation Monte Carlo — Examples
1 · Prerequisites
- Assignment randomization and sharp-null tests
- Binary Operations, Monoids, Groups and Subgroups
- Conditional and Finite-Group Exact Inference
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Exact permutation tests and random-permutation Monte Carlo
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Tests, Neyman–Pearson and Valid P-values
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
The examples compute a two-sample Bernoulli permutation orbit with tied scores, exhibit a uniform-subset Monte Carlo design without replacement, and compare equal-mean but unequal-distribution sampling with the exchangeable case. They also compare a weighted sharp-null assignment test with group-invariance inference and enumerate a two-point model where the uncorrected Monte Carlo fraction is zero with positive probability. A published finite-group example records why the invariant-null premise is essential: Without null invariance a group-rank p-value can be anti-conservative.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A tied two-sample Bernoulli permutation test
Example
Let , and for assign the four vectors masses These are two independent Bernoulli observations, one in each sample. Let act by swapping coordinates and take the signed two-sample score . Under the equal-distribution null, the law is invariant under this swap. For the discordant sample the full-orbit p-value is ; for it is , and either tied sample has inclusive p-value .
For a uniform-subset Monte Carlo example without replacement, let act on itself by addition with its full power-set sigma-algebra, let be uniform on , and take . Set , choose uniformly from the ten two-element subsets of independently of , and use . This is the identity-adjoined design of Identity-corrected random-permutation Monte Carlo p-value, with
The equal-distribution null above is stronger than equality of means. For a weak mean-difference null, use the data space with full power-set sigma-algebra, where , and let act by swapping coordinates. On assign mass , where puts mass on each of and puts masses on , respectively. Use the score . Both coordinate means are zero, so the weak mean-difference null holds. The pooled law is not invariant under the swap.
Facts & Assumptions
Given: The Bernoulli product law, its coordinate-swap action and score, and the full-orbit rank definitions; the uniform-subset design on ; and the weak-null product law on with the coordinate-swap action. Verify invariance and compute the ranks and design p-value.
Measurable finite-group permutation setups: a finite group acts measurably on the experiment data space, and the theorem's null premise is invariance under every group element.
Full-orbit and tie-randomized permutation p-values: the inclusive rank counts all group transformations with ; the randomized rank interpolates over the tied block using an independent uniform variable.
Exact finite-group permutation p-values and tests: under an invariant null, inclusive ranks are superuniform and tie-randomized ranks are exactly uniform.
Finite probability spaces, outcome weights, events, and event probabilities: nonnegative weights on a finite set that sum to one define a finite probability law, and event probabilities are sums of the weights.
Identity-corrected random-permutation Monte Carlo p-value: without replacement, adjoin the identity to a uniformly selected -subset of the nonidentity group elements, selected independently of the data , and divide the inclusive count by .
Verification
Given: The Bernoulli product law and swap score, the design, and the weak mean-difference model and swap action stated in the Example.
All four masses are nonnegative and sum to , so [F4] makes them a finite probability law. The swap fixes and and exchanges with , which have equal mass. Thus for every , and the group action is invariant for every .
The subset is uniform and independent of by the Example, so it satisfies the without-replacement design premise in [F5]. In the example, addition by any fixed group element permutes the six equally likely outcomes, so the null law is invariant. If , only the identity in has score at least , and the without-replacement p-value is . If , then and every element of has score at least zero, so the p-value is . Its distribution is therefore with probability and with probability ; its CDF is superuniform.
At and , both transformed scores are , giving and . At the two scores are , giving and . At they are , giving and .
Put . Then with probability and equals otherwise. Its CDF is for , for , and at , so it is superuniform. For , the tie-randomized CDF is : the branch contributes , the branch contributes zero except at a probability-zero endpoint, and the tied branches contribute . For , it is . Thus is uniform, in agreement with [F3].
In the weak mean-difference example, . But the coordinate swap sends to , and the product law assigns these points probabilities and , respectively. Hence this weak null does not make the pooled law invariant under the swap, so the invariant-null premise of [F3] cannot be inferred from equality of means.
Unequal assignment weights under the Fisher sharp null
Example
Two fixed units have two allowed assignments, and , with known assignment probabilities and . Suppose the potential-outcome schedule satisfies the Fisher sharp null and the predeclared score is , . The design-based inclusive randomization p-value is when is observed and when is observed.
Facts & Assumptions
Given: The finite assignment law, fixed sharp-null potential outcomes, and the predeclared score above. Compute the weighted upper-tail p-value and identify which validity premise is being used.
Finite randomized treatment-assignment models: the units and potential-outcome schedule are fixed, the known finite assignment law supplies the randomness, and the observed response vector is determined by the realized assignment.
Fisher sharp null and predeclared test orderings: under the Fisher sharp null, one response vector is imputable under every allowed assignment; the ordering score is fixed before observing assignment and outcomes.
Fisher sharp-null randomization p-values are valid: the inclusive p-value sums the actual assignment probabilities over assignments whose imputed score is at least the observed score, and is valid under every Fisher-sharp schedule.
Exact finite-group permutation p-values and tests: the full-orbit group-rank validity conclusion assumes each null law is invariant under every group transformation.
Finite-population average treatment effect and weak null: the weak zero-average-effect null constrains only the average unit effect and is weaker than the Fisher sharp null.
Verification
Given: Assignments with weights , a Fisher-sharp schedule, and the score ordering .
The assignment weights are nonnegative and sum to one. Under the sharp null the same fixed response vector is available at both assignments, so the two score values in the Example are imputable before observing . The published weighted randomization theorem [F3] therefore applies to this schedule and this predeclared ordering.
If , the only assignment with score at least is , so . If , both assignments have score at least , so .
The p-value is with probability and with probability . Its CDF is for , for , and at , hence it is superuniform. The assignment law is not invariant under the swap , since the two assignment masses differ, so the group-invariance theorem [F4] is not the justification here. This example uses the Fisher sharp null and makes no claim under the weaker average-effect null [F5].
The uncorrected Monte Carlo permutation fraction can be zero and invalid
Statement refuted
For every invariant finite-group null and every , the uncorrected fraction with IID uniform independent of , is a valid p-value.
Facts & Assumptions
Given: A finite invariant group model, one IID uniform simulated transformation, and the uncorrected fraction above. Show that it can have positive probability of being zero; compare the identity-corrected value.
Measurable finite-group permutation setups: the test premise is invariance of the null law under every group element.
Identity-corrected random-permutation Monte Carlo p-value: the corrected with-replacement procedure adds the distinguished identity count and divides by .
Validity of identity-corrected random-permutation Monte Carlo p-values: under the invariant null and with-replacement design, the identity-corrected value is superuniform.
Valid p-values: validity requires at every , including .
Finite probability spaces, outcome weights, events, and event probabilities: event probabilities on a finite sample space are sums of the outcome weights.
The uniform probability space on a nonempty finite set: a uniform law on the two-element group gives probability to each transformation.
Independent random elements: the simulated transformation is independent of the observed data.
Counterexample
Take , let with swapping the two points, let , and set . This law is invariant. Take and draw uniformly from , independently of .
Given: The finite model, the group action and score, and the independent uniform draw above.
If , both transformations have score at least , so . If , the identity gives an indicator of and the swap gives an indicator of . Therefore exactly on . By [F5], [F6], and independence [F7], this event has probability .
Consequently , contradicting the necessary superuniform bound [F4]. Thus the uncorrected fraction can equal zero and is anti-conservative at cutoff .
In the same witness the corrected value is , so it equals with probability and with probability . Its CDF is below , for , and at , consistent with the general identity-corrected result [F3].
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
- Jesse Hemerik and Jelle Goeman, Exact Testing with Random Permutations, §3.2
- Eugene Katsevich, STAT 9610 Lecture Notes, §3.2.4.2, equations (3.19)–(3.20)