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.

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

Confidence Sets and Inversion

1 · Prerequisites

2 · Summary

This page defines confidence-set procedures through measurable membership events and repeated-sampling coverage. It then treats two general constructions: inverting point-null acceptance regions and inverting a parameter-free pivot over a calibrated measurable set. The coverage arguments are event identities, so they do not require a topology or sigma-algebra on the parameter set.

Exact interval coverage requires exact probability calibration of the actual acceptance interval. For discrete pivots, quantile endpoints can place atoms inside the acceptance set and give conservative coverage. A randomized test must include its auxiliary randomization in the observation before its acceptance event can be inverted. The exact normal t interval applies the Gaussian pivot and t-quantile suppliers from the preceding Gaussian-decomposition page. Its carrier records their hypotheses and restricts the experiment to the common full-measure set where the sample standard deviation is positive.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Confidence sets and coverage

Definition

Let E=((X,A),(Pθ)θ∈Θ) be a statistical experiment as in Statistical experiments, and assume Θ≠∅. A confidence-set procedure is a map C:X→P(Θ), where P(Θ):={A:A⊆Θ}, such that, for every η∈Θ, its membership section Cη:={x∈X:η∈C(x)} belongs to A. Its coverage at θ is cC(θ):=Pθ(Cθ), and its confidence level is inf⁡θ∈ΘcC(θ), the greatest lower bound of those coverage values. For 0≤α≤1, it has coverage at least 1−α if Pθ(Cθ)≥1−α for every θ∈Θ.

Only membership sections need to be measurable; no sigma-algebra on the parameter set is assumed. The parameter is fixed in the repeated-sampling coverage probability.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Pivotal quantities

Definition

Let E=((X,A),(Pθ)θ∈Θ) be a statistical experiment with Θ≠∅, and let (S,S) be a measurable space. A family of measurable maps qθ:X→S, one for each θ∈Θ, is a pivot if the pushforward law νθ(B):=Pθ(qθ−1(B)),B∈S is the same probability measure ν for every θ∈Θ. Each section is a random element on (X,A,Pθ), so its pushforward is a probability measure by The law of a random element is a probability measure. No measurability in θ is asserted or needed.

For S=R, a pivot is a parameter-indexed family of measurable real-valued quantities with a common sampling law. The maps qθ may depend on the unknown parameter. A pivot need not be invertible in the parameter, and its inversion need not be an interval.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Coverage from pivot inversion and exact calibration

Statement

Let E=((X,A),(Pθ)θ∈Θ) be an experiment with nonempty Θ. Let qθ:X→S be a pivot with common law ν, and let B∈S. Define C(x):={θ∈Θ:qθ(x)∈B} If ν(B)≥1−α, then C is a confidence set with coverage at least 1−α. If ν(B)=1−α, its coverage is exactly 1−α for every parameter value. For an interval B=[a,b] in R, exactness requires calibration of the actual probability ν([a,b]); quantile labels alone do not remove endpoint atoms.

Facts & Assumptions

Given: A nonempty parameter set Θ, a statistical experiment, 0≤α≤1, a pivot qθ with common law ν, and a measurable acceptance set B with ν(B)≥1−α.

[F1]

Pivotal quantities: each section qθ is measurable and has pushforward law ν, independent of θ.

[F2]

Confidence sets and coverage: a set-valued procedure is measurable when every parameter-membership section is measurable, and coverage is the probability of that section under the corresponding Pθ.

Proof

1.1givenF1F2

For each η∈Θ, the membership section of C is {x:η∈C(x)}=qη−1(B). It is in A because qη is measurable and B∈S. Thus C is a confidence-set procedure by [F2].

2.1givenF1F2step 1.1algebra∎

For every θ∈Θ, Pθ{θ∈C(X)}=Pθ(qθ−1(B))=ν(B)≥1−α. Equality holds for every θ when ν(B)=1−α; measurability was established in step 1.1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources