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.

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

Exact permutation tests and random-permutation Monte Carlo — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A tied two-sample Bernoulli permutation test

Example

Let Ω={0,1}2, and for q∈[0,1] assign the four vectors masses Pq(0,0)=(1−q)2,Pq(0,1)=q(1−q),Pq(1,0)=q(1−q),Pq(1,1)=q2. These are two independent Bernoulli(q) observations, one in each sample. Let G=S2 act by swapping coordinates and take the signed two-sample score T(x)=x1−x2. Under the equal-distribution null, the law is invariant under this swap. For the discordant sample x=(1,0) the full-orbit p-value is 1/2; for x=(0,1) it is 1, and either tied sample has inclusive p-value 1.

For a uniform-subset Monte Carlo example without replacement, let G=Z/6Z act on itself by addition with its full power-set sigma-algebra, let X be uniform on G, and take T(x)=1{x=0}. Set B=2, choose S uniformly from the ten two-element subsets of G∖{0} independently of X, and use W={0}∪S. This is the identity-adjoined design of Identity-corrected random-permutation Monte Carlo p-value, with p2,wor(x)=#{g∈W:T(g+x)≥T(x)}3.

The equal-distribution null above is stronger than equality of means. For a weak mean-difference null, use the data space D2 with full power-set sigma-algebra, where D={−2,−1,0,1,2}, and let S2 act by swapping coordinates. On D2 assign (x,y) mass P{x}Q{y}, where P puts mass 1/2 on each of −1,1 and Q puts masses 1/4,1/2,1/4 on −2,0,2, respectively. Use the score T(x,y)=x−y. Both coordinate means are zero, so the weak mean-difference null E[X]=E[Y] 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 Z/6Z; and the weak-null product law on D2 with the coordinate-swap action. Verify invariance and compute the ranks and design p-value.

[F1]

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.

[F2]

Full-orbit and tie-randomized permutation p-values: the inclusive rank counts all group transformations with T(g⋅x)≥T(x); the randomized rank interpolates over the tied block using an independent uniform variable.

[F3]

Exact finite-group permutation p-values and tests: under an invariant null, inclusive ranks are superuniform and tie-randomized ranks are exactly uniform.

[F4]

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.

[F5]

Identity-corrected random-permutation Monte Carlo p-value: without replacement, adjoin the identity to a uniformly selected B-subset of the nonidentity group elements, selected independently of the data X, and divide the inclusive count by B+1.

Verification

Given: The Bernoulli product law and S2 swap score, the Z/6Z design, and the weak mean-difference model and swap action stated in the Example.

1.1F1F4givenalgebra

All four masses are nonnegative and sum to (q+(1−q))2=1, so [F4] makes them a finite probability law. The swap fixes (0,0) and (1,1) and exchanges (0,1) with (1,0), which have equal mass. Thus Pq(s−1A)=Pq(A) for every A⊆Ω, and the group action is invariant for every q∈[0,1].

1.2F1F4F5givenalgebra

The subset S is uniform and independent of X by the Example, so it satisfies the without-replacement design premise in [F5]. In the Z/6Z example, addition by any fixed group element permutes the six equally likely outcomes, so the null law is invariant. If X=0, only the identity in W has score at least T(X)=1, and the without-replacement p-value is 1/3. If X≠0, then T(X)=0 and every element of W has score at least zero, so the p-value is 1. Its distribution is therefore 1/3 with probability 1/6 and 1 with probability 5/6; its CDF is superuniform.

2.1F2step 1.1algebra

At (0,0) and (1,1), both transformed scores are 0, giving porb=1 and ptie=U. At (1,0) the two scores are 1,−1, giving porb=1/2 and ptie=U/2. At (0,1) they are −1,1, giving porb=1 and ptie=(1+U)/2.

3.1F2F3step 2.1algebra

Put a=q(1−q). Then porb=1/2 with probability a and equals 1 otherwise. Its CDF is 0 for u<1/2, a≤1/4≤u for 1/2≤u<1, and 1 at u=1, so it is superuniform. For 0≤u≤1/2, the tie-randomized CDF is 2au+(1−2a)u=u: the (1,0) branch contributes 2au, the (0,1) branch contributes zero except at a probability-zero endpoint, and the tied branches contribute (1−2a)u. For 1/2≤u≤1, it is a+a(2u−1)+(1−2a)u=u. Thus ptie is uniform, in agreement with [F3].

4.1F1F4givenalgebra∎

In the weak mean-difference example, E[X]=E[Y]=0. But the coordinate swap sends (1,0) to (0,1), and the product law assigns these points probabilities P(X=1)Q(Y=0)=1/4 and P(X=0)Q(Y=1)=0, 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Unequal assignment weights under the Fisher sharp null

Example

Two fixed units have two allowed assignments, a=(1,0) and b=(0,1), with known assignment probabilities P(Z=a)=0.9 and P(Z=b)=0.1. Suppose the potential-outcome schedule satisfies the Fisher sharp null and the predeclared score is T(a,y)=1, T(b,y)=0. The design-based inclusive randomization p-value is 0.9 when a is observed and 1 when b 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.

[F1]

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.

[F2]

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.

[F3]

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.

[F4]

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.

[F5]

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 a,b with weights 0.9,0.1, a Fisher-sharp schedule, and the score ordering T(a,y)=1>T(b,y)=0.

1.1F1F2F3given

The assignment weights are nonnegative and sum to one. Under the sharp null the same fixed response vector y is available at both assignments, so the two score values in the Example are imputable before observing Z. The published weighted randomization theorem [F3] therefore applies to this schedule and this predeclared ordering.

1.2F1F2F3givenalgebra

If Z=a, the only assignment with score at least 1 is a, so prand(a,y)=0.9. If Z=b, both assignments have score at least 0, so prand(b,y)=0.9+0.1=1.

2.1F1F3F4F5step 1.2algebra∎

The p-value is 0.9 with probability 0.9 and 1 with probability 0.1. Its CDF is 0 for u<0.9, 0.9≤u for 0.9≤u<1, and 1 at u=1, hence it is superuniform. The assignment law is not invariant under the swap a↔b, 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].

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The uncorrected Monte Carlo permutation fraction can be zero and invalid

Statement refuted

For every invariant finite-group null and every B≥1, the uncorrected fraction p~B:=1B∑b=1B1{T(gb⋅X)≥T(X)}, with IID uniform gb∈G independent of X, 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.

[F1]

Measurable finite-group permutation setups: the test premise is invariance of the null law under every group element.

[F2]

Identity-corrected random-permutation Monte Carlo p-value: the corrected with-replacement procedure adds the distinguished identity count and divides by B+1.

[F3]

Validity of identity-corrected random-permutation Monte Carlo p-values: under the invariant null and with-replacement design, the identity-corrected value is superuniform.

[F4]

Valid p-values: validity requires P(p(X)≤u)≤u at every u∈[0,1], including u=0.

[F5]

Finite probability spaces, outcome weights, events, and event probabilities: event probabilities on a finite sample space are sums of the outcome weights.

[F6]

The uniform probability space on a nonempty finite set: a uniform law on the two-element group gives probability 1/2 to each transformation.

[F7]

Independent random elements: the simulated transformation is independent of the observed data.

Counterexample

Take Ω={0,1}, let G={e,s} with s swapping the two points, let P(X=0)=P(X=1)=1/2, and set T(x)=x. This law is invariant. Take B=1 and draw g1 uniformly from G, independently of X.

Given: The finite model, the group action and score, and the independent uniform draw g1 above.

1.1F1F5F6F7givenalgebra

If X=0, both transformations have score at least T(X)=0, so p~1=1. If X=1, the identity gives an indicator of 1 and the swap gives an indicator of 0. Therefore p~1=0 exactly on {X=1,g1=s}. By [F5], [F6], and independence [F7], this event has probability (1/2)(1/2)=1/4.

2.1F4step 1.1algebra

Consequently P(p~1≤0)=1/4>0, contradicting the necessary superuniform bound [F4]. Thus the uncorrected fraction can equal zero and is anti-conservative at cutoff 0.

3.1F2F3step 1.1algebra∎

In the same witness the corrected value is p+=(1+1{T(g1⋅X)≥T(X)})/2, so it equals 1/2 with probability 1/4 and 1 with probability 3/4. Its CDF is 0 below 1/2, 1/4≤u for 1/2≤u<1, and 1 at u=1, consistent with the general identity-corrected result [F3].

Sources