Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Coverage from test inversion

Statement

Let E=((Y,G),(Qθ)θ∈Θ) be an experiment with nonempty Θ, and let 0≤α≤1. For each η∈Θ, let Aη∈G be the acceptance event of a test of the point null θ=η, on the full observation space, including any auxiliary randomization. Suppose Qη(Aη)≥1−α for every η∈Θ. Then C(y):={η∈Θ:y∈Aη} is a confidence set with coverage at least 1−α.

The probability bound is the point-null level condition written in terms of acceptance events. For a randomized test, a rejection-probability function on the original data space is not itself an acceptance event; the auxiliary randomization must be part of the observation before applying this statement.

Facts & Assumptions

Given: An experiment on (Y,G), a nonempty parameter set Θ, 0≤α≤1, and measurable events Aη∈G such that Qη(Aη)≥1−α for every η.

[F1]

Confidence sets and coverage: a confidence-set procedure has measurable membership sections and coverage is the probability of the true parameter's section.

[A1]

For each η, Aη is measurable and Qη(Aη)≥1−α.

Proof

1.1givenA1F1

For each η∈Θ, the membership section of C is {y:η∈C(y)}=Aη, which belongs to G by [A1]. Therefore C is a confidence-set procedure by [F1].

2.1givenA1F1algebra∎

For any θ∈Θ, Qθ{θ∈C(Y)}=Qθ(Aθ)≥1−α. Taking the infimum over the nonempty Θ proves the asserted coverage level.

Remarks

For a deterministic test of a simple null {η} with a nonempty alternative, the acceptance event Aη is the complement of its rejection event, so its test function is φη=1Aηc. By Test size and power, its size is Eηφη=Qη(Aηc); level α therefore gives Qη(Aη)=1−Eηφη≥1−α. For a randomized test, its rejection-probability function is not itself an event. Applying this theorem then requires the realized auxiliary randomizer to be part of the observation and the stated eventwise probability bound to hold on that full observation space.

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