Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Full-orbit and tie-randomized permutation p-values

Definition

In a setup as in Measurable finite-group permutation setups, the inclusive full-orbit upper-tail p-value at x∈X is porb(x):=#{g∈G:T(g⋅x)≥T(x)}∣G∣. If U is independent of the data and uniform on [0,1], meaning P(U≤u)=u for every u∈[0,1], the tie-randomized full-orbit p-value is ptie(x,U):=#{g∈G:T(g⋅x)>T(x)}+U #{g∈G:T(g⋅x)=T(x)}∣G∣. Independence is in the sense of Independent random elements. Each count is over group elements with multiplicity, so nonfree actions are handled without replacing ∣G∣ by the number of distinct orbit points.

On the finite-space special case with invariant null laws, these formulas are the inclusive and tie-randomized ranks of Orbit upper-tail rank p-values. The null-law validity argument is supplied separately from this definition.

Depends on

Used by

Dependency tree · two levels

11 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