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

Depends on

Used by

Dependency tree · two levels

9 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