Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-10-14 (gpt-6.1-sol)
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.

Valid p-values yield level tests for nonempty disjoint alternatives

Statement

Let p be a valid p-value for a nonempty null hypothesis Θ0 in a statistical experiment. For every α∈[0,1], the deterministic test with rejection function φα(x)=1{p(x)≤α} satisfies Pθ(p(X)≤α)=Eθ[φα(X)]≤α(θ∈Θ0). Consequently, whenever a nonempty alternative hypothesis Θ1⊆Θ∖Θ0 is specified, this test has size at most α and hence level α in the sense of Test size and power.

Facts & Assumptions

Given: An experiment, a valid p-value statistic p:X→[0,1] for Θ0≠∅, and α∈[0,1]. The pointwise bound does not require an alternative hypothesis.

[F1]

Valid p-values: validity means Pθ({x:p(x)≤u})≤u for every θ∈Θ0 and u∈[0,1].

[F2]

A measurable function between measurable spaces: a statistic is measurable when inverse images of Borel sets are measurable.

[F3]

Every measurable rejection function defines a randomized test: every measurable φ:X→[0,1] defines a binary randomized test with rejection function φ.

[F4]

The expectation of an indicator is the probability of the event: the expectation of an event indicator under Pθ equals the probability of that event.

[F5]

Test size and power: when a nonempty alternative disjoint from Θ0 is specified, size is sup⁡θ∈Θ0Eθ[φ(X)] and level α means size at most α.

Proof

technique · direct
1.1givenF2F3construct

Let Aα={x:p(x)≤α}. This event is measurable because p is a statistic and [0,α] is Borel in [0,1]. Thus φα=1Aα is a measurable map into [0,1], and [F3] supplies a randomized test with this rejection function. Since φα takes only the values 0 and 1, that kernel assigns probability one to the corresponding action, so the test is deterministic.

2.1F1F4F5step 1.1algebra∎

For every θ∈Θ0, [F4] and validity [F1] give Eθ[φα(X)]=Pθ(Aα)≤α, proving the pointwise bound. If a nonempty Θ1⊆Θ∖Θ0 is specified, taking the supremum over the nonempty set Θ0 gives size at most α by [F5], and therefore level α.

Depends on

Used by

Dependency tree · two levels

30 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