Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Studentized two-sample U-statistic permutation test

Definition

Inputs: Two samples of sizes m,n≥r, a measurable order-(r,r) kernel symmetric within each group, two supplied nonnegative measurable variance-estimation routines, and a significance level α∈(0,1). Use the U-statistic in Two-sample order-r U-statistic and first projections and the standard-error pivot S in Studentized two-sample U-statistic and permutation distribution, including its value zero when the estimated standard error is zero. Choose the upper alternative statistic T=S, lower alternative statistic T=−S, or two-sided statistic T=∣S∣. Optionally supply an independent uniform random variable U∈[0,1] for ties.

  1. Pool the observations into z=(X1,…,Xm,Y1,…,Yn) and compute T(z).
  2. Enumerate all N! coordinate permutations π of N=m+n. For each permutation, treat its first m observations as the first group and its last n as the second. Recompute the U-statistic and both variance estimates from those groups, apply the same zero-denominator rule, and compute T(zπ).
  3. Return the inclusive p-value pinc=N!−1#{π:T(zπ)≥T(z)} and reject when pinc≤α. If tie randomization was requested, instead return pU=N!−1{#{π:T(zπ)>T(z)}+U#{π:T(zπ)=T(z)}} and reject when pU≤α.

This is complete finite enumeration, with permutations counted with their multiplicities even when observations repeat. It does not define a Monte Carlo approximation using a subset of permutations. No generic weak-null validity is asserted by the procedure alone; that requires the applicable studentization and estimator-consistency theorem.

Depends on

Used by

Dependency tree · two levels

12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources