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.

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

Confidence Sets and Inversion — Examples

1 · Prerequisites

2 · Summary

These examples calculate exact normal and uniform-maximum pivot intervals, invert a binomial lower-tail test to obtain a conservative upper confidence limit, and show directly how atoms can make a nominal discrete pivot interval overcover. The unknown-variance normal interval uses the actual MSF-35 exact t-pivot and quantile suppliers; its proof records the common full-measure sample space, nuisance variance, and calibrated inversion.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A discrete pivot can give conservative coverage

Example

Let Θ=Z, let the measurable observation space be (Z,2Z), and for each θ∈Z assign probability 1/3 to each of θ−1,θ,θ+1. Let X have this law, put Q(X;θ)=X−θ, choose nominal level 1−α=4/5, and use the central pivot set B=[−1,1]. The inverted set is C(X)={η∈Z:∣X−η∣≤1}={X−1,X,X+1} Its coverage is 1, so it is conservative for the nominal 4/5 level. The atom masses prevent the equal-tail quantiles from calibrating the central acceptance set to probability 4/5.

Facts & Assumptions

Given: The finite model and the procedure specified in the Example.

[F1]

Probability measures and probability spaces: a probability measure has total mass one.

[F2]

Pivotal quantities: a pivot has a parameter-free sampling law.

[F3]

Confidence sets and coverage: coverage is the probability that the true parameter belongs to the procedure's output.

[F4]

Coverage from pivot inversion and exact calibration: pivot inversion has at-least coverage when the acceptance set has probability at least the target level.

[F5]

Sigma-algebras: a sigma-algebra is an algebra of subsets closed under countable unions.

[F6]

Statistical experiments: an experiment fixes a measurable observation space and a probability law for each parameter.

Verification

1.1givenF1F2F5F6algebra

The full power set 2Z is an algebra of subsets closed under countable unions, so it is a sigma-algebra by [F5]. Explicitly set Pθ(A)=13(1A(θ−1)+1A(θ)+1A(θ+1)) for every A⊆Z. These values are nonnegative and have total mass 1. For a pairwise disjoint sequence Am, ∑mPθ(Am)=13∑z∈{−1,0,1}∑m1Am(θ+z)=13∑z∈{−1,0,1}1∪mAm(θ+z)=Pθ(∪mAm). Thus it is countably additive, hence a probability measure, and specifies the experiment family in [F6]. Under Pθ, Q(X;θ) assigns mass 1/3 to each of −1,0,1, independently of θ; hence Q is a pivot with Pθ(Q∈B)=1.

2.1givenF3F4step 1.1algebra∎

Define FQ(t):=Pθ(Q≤t) and the generalized quantile qr:=inf⁡{t∈R:FQ(t)≥r}. By the definition of C, the event {θ∈C(X)} is {∣X−θ∣≤1}, which occurs for all three possible observations. Thus its probability and coverage equal 1; this exceeds 4/5, while [F4] also applies since Pθ(Q∈B)=1≥4/5. The pivot cdf is 0 below −1, 1/3 on [−1,0), 2/3 on [0,1), and 1 from 1 onward. Thus the generalized 1/10 and 9/10 quantiles are −1 and 1, and their closed interval contains all atoms.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Known-variance normal mean interval

Example

Assume AC as in the library's construction of the normal laws. Observe one real-valued Y∼N(μ,σ2), where μ∈R, the known standard deviation σ>0, and 0<α<1. Define Φ(t)=∫−∞te−u2/2/2π du, and let z1−α/2 be its (1−α/2)-quantile. Then [Y−z1−α/2σ,  Y+z1−α/2σ] has exact confidence level 1−α.

Facts & Assumptions

Given: AC; an experiment indexed by μ∈R with Y∼N(μ,σ2), fixed known σ>0, and 0<α<1.

[A1]

The Axiom of Choice: assume the axiom of choice, as required by the normal-law definition used here.

[F1]

Standard normal and normal laws: N(μ,σ2) is the law of an affine image of a standard normal variable, whose density is positive on R.

[F2]

Pivotal quantities: a parameter-indexed family of measurable maps is a pivot when its pushforward law is the same at every parameter.

[F3]

Confidence sets and coverage: the confidence set is measured by the probability that it contains the true parameter.

[F4]

Coverage from pivot inversion and exact calibration: an acceptance set of pivot probability 1−α yields exact coverage 1−α.

[F6]

Continuity from below for measures: for increasing measurable sets, the measure of their union is the supremum of their measures.

Verification

1.1givenA1F1F5F6algebra

Let G have the standard normal law. Its density is ϕ(u)=e−u2/2/2π, positive everywhere and bounded above by 1/2π, with total mass one by [F1]. Thus Φ(t)=P(G≤t) satisfies 0<Φ(b)−Φ(a)=∫abϕ(u) du≤(b−a)/2π for every a<b, proving strict increase and continuity. The events {G≤m} and {G>−m} increase to the whole space as integer m→∞; [F6] gives Φ(m)→1 and P(G>−m)→1, hence Φ(−m)→0. Choose finite endpoints bracketing 1−α/2; [F5] gives a quantile between them, and strict increase gives uniqueness.

2.1givenF1step 1.1algebra

The standard normal density is symmetric and has no atoms. Therefore Φ(−z1−α/2)=α/2, and the probability of [−z1−α/2,z1−α/2] is 1−α.

3.1givenF2F3F4step 2.1algebra∎

For every candidate mean η, qη(y)=(y−η)/σ is measurable and has standard normal law under Pη, so it is a pivot. The event η∈[y−zσ,y+zσ] is exactly −z≤qη(y)≤z; applying [F4] and [F3] gives exact coverage 1−α for every η.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Exact unknown-variance normal t interval

Example

Assume AC and let n≥2. For each fixed variance λ=σ2>0, let P~μ,λ=N(μ,λ)⊗n be the full product law on Rn, with mean parameter μ∈R and independent coordinates. Use the common sample space Dn:={x∈Rn:s(x)>0}, where xˉ=n−1∑ixi and s(x):=(n−1)−1∑i(xi−xˉ)2 is the nonnegative square root, with the trace Borel sigma-algebra; write Pμ,λ for the restriction of P~μ,λ to this sample space. Let ν=n−1, and write tν,u for the unique u-quantile of the tν law. For 0<α<1, the interval I(X)=[Xˉ−tν,1−α/2Sn,  Xˉ+tν,1−α/2Sn] has exact coverage Pμ,λ{μ∈I(X)}=1−α, for every μ∈R and every fixed λ>0. The same formula works for all unknown variances.

Facts & Assumptions

Given: AC, n≥2, 0<α<1, and for each λ>0 the iid normal experiment indexed by μ∈R.

[A1]

The Axiom of Choice: AC is the axiom assumed by the normal-law construction and the two Gaussian suppliers used here.

[F1]

Normal sample mean and residual are independent, giving the exact t pivot: for an iid N(μ,σ2) sample with n≥2, S>0 almost surely and (Xˉ−μ)/(S/n) has the tn−1 law.

[F2]

Student t and Fisher F CDFs are continuous and strictly increasing on their supports: for ν≥1, the tν CDF is continuous, strictly increasing, symmetric about zero, and has limits zero and one, so each u∈(0,1) has a unique quantile.

[F3]

Confidence sets and coverage: a confidence-set procedure has measurable membership sections, and its coverage at a parameter is the probability of the corresponding section.

[F4]

Pivotal quantities: a family of measurable maps, one for each parameter, is a pivot when every map has the same pushforward probability law.

[F5]

Coverage from pivot inversion and exact calibration: inversion of a pivot acceptance set of probability 1−α gives exact coverage 1−α at every parameter.

[F6]

The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets; on Dn we use the trace of the Borel sigma-algebra of Rn.

[F7]

Statistical experiments: an experiment consists of a measurable sample space, a parameter set, and one probability law on that space for each parameter.

Verification

1.1givenA1F1F6F7

For all x,y∈Rn, ∣xˉ−yˉ∣≤max⁡i∣xi−yi∣≤∥x−y∥2. The residual map r(x)=x−xˉ1 is linear and orthogonal to 1, so Pythagoras gives ∥r(x−y)∥2≤∥x−y∥2; the reverse triangle inequality then gives ∣s(x)−s(y)∣≤∥x−y∥2/n−1. Hence s is continuous, Dn={x:s(x)>0} is open, and its trace Borel sets form a sigma-algebra by [F6]. By [F1], every full law P~μ,λ gives Dn probability one, so its restriction Pμ,λ remains a probability measure; [F7] therefore gives the stated experiment for each fixed λ>0.

1.2givenF2algebra

Put c=tν,1−α/2, which exists uniquely by [F2]. Symmetry and continuity give Ftν(0)=1/2; strict increase and 1−α/2>1/2 imply c>0. Since Ftν(c)=1−α/2, symmetry gives Ftν(−c)=α/2; continuity means neither endpoint is an atom, so P(−c≤Tν≤c)=1−α.

1.3givenA1F1F4F6

For each candidate mean η∈R, define qη(x)=(xˉ−η)/(s(x)/n) on Dn. Its denominator is positive there, so it is continuous and hence measurable on the subspace Dn by the open-set definition of its trace Borel sigma-algebra [F6]. For every Borel B⊆R, the restricted probability satisfies Pη,λ{qη∈B}=P~η,λ{x∈Dn:qη(x)∈B}, and [F1] gives this value as the common tν probability because the full law assigns probability one to Dn. Thus (qη)η∈R is a pivot by [F4].

2.1givenF3F4F5step 1.2algebra∎

Inverting B=[−c,c] gives {η:qη(x)∈B}=[xˉ−cs(x)/n,xˉ+cs(x)/n]=I(x) by solving the two inequalities, and each membership section is measurable because qη is measurable. Step 1.2 gives the pivot mass ν(B)=1−α; the pivot-inversion theorem [F5] and confidence-set definition [F3] therefore give exact coverage 1−α for every mean and every fixed variance.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Uniform maximum pivot interval

Example

Let n≥1, θ>0, and take the experiment with sample space X=Rn and its Borel sigma-algebra, where under each θ the coordinate random variables X1,…,Xn are independent, each with Pθ(Xi≤t)=0 for t<0, Pθ(Xi≤t)=t/θ for 0≤t≤θ, and Pθ(Xi≤t)=1 for t>θ. Write M=max⁡iXi and let 0<α<1. The pivot M/θ has distribution function un on [0,1]. Setting v=α1/n gives the exact confidence set C(X)=[M,M/v]∩(0,∞) with coverage 1−α.

Facts & Assumptions

Given: The Rn experiment specified in the Example, n≥1, and 0<α<1.

[F1]

Independent random elements: independence means independence of the sigma-algebras generated by the coordinate random elements.

[F2]

Independent random elements have product joint law: the joint law of finitely many independent random elements is the product of their marginal laws.

[F3]

Pivotal quantities: a pivot has parameter-free pushforward law.

[F4]

Confidence sets and coverage: coverage is the probability that the true parameter is in the set.

[F5]

Coverage from pivot inversion and exact calibration: pivot inversion of a measurable acceptance set with mass 1−α has exact coverage 1−α.

[F6]

Statistical experiments: an experiment assigns a probability law to each parameter on one measurable observation space.

[F7]

The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets of the underlying topological space.

Verification

1.1givenF1F2F6F7algebra

The sample sigma-algebra is the Borel sigma-algebra of Rn by [F7]. The maximum map m(x)=max⁡ixi satisfies ∣m(x)−m(y)∣≤max⁡i∣xi−yi∣, so it is continuous. The preimages of open sets are therefore open; since the Borel sigma-algebra is generated by open sets, preimages of every Borel set are Borel and M=m(X) is measurable. Also m/θ is continuous because θ>0. The coordinate variables are independent by [F1], and [F2] gives their product joint law.

1.2givenF2F3algebra

If 0≤u≤1, then Pθ(M/θ≤u)=Pθ(X1≤uθ,…,Xn≤uθ)=∏i=1nu=un. For u<0 the probability is 0, and for u≥1 it is 1. This law does not depend on θ, so M/θ is a pivot by [F3].

2.1givenF3F5step 1.2algebra

The distribution function un established in step 1.2 is continuous. Therefore Pθ(α1/n≤M/θ≤1)=1−(α1/n)n=1−α. By [F5], pivot inversion gives exact coverage.

3.1givenF4step 2.1algebra∎

Since θ>0, the inequality α1/n≤M/θ≤1 is equivalent to M≤θ≤M/α1/n. Thus the inverted set is [M,M/α1/n]∩(0,∞), and [F4] identifies its coverage with the probability computed in step 2.1.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Binomial upper confidence limit by lower-tail test inversion

Example

Let the observation space be {0,…,n} with its full power set, n≥1, p∈[0,1], 0<α<1, and let X have mass Pp(X=j)=(nj)pj(1−p)n−j, j=0,…,n, with 00=1. Define Fp(k)=∑j=0k(nj)pj(1−p)n−j. For k<n, let Uk∈(0,1) be the unique solution of FUk(k)=α, and set Un=1. Then C(X)=[0,UX] is the confidence set obtained by inverting the lower-tail tests that reject p=p0 when Fp0(X)<α. Its coverage is at least 1−α; discreteness can make it conservative.

Facts & Assumptions

Given: The finite binomial model, n≥1, p∈[0,1], and 0<α<1.

[F1]

The binomial theorem over an arbitrary commutative ring: the binomial expansion holds for real p and 1−p.

[F2]

Confidence sets and coverage: coverage is the probability that the true parameter belongs to the confidence set.

[F3]

Coverage from test inversion: inverting measurable point-null acceptance events of probability at least 1−α gives coverage at least 1−α.

[F4]
[F5]

Sigma-algebras: a sigma-algebra is an algebra of subsets closed under countable unions.

[F6]

Probability measures and probability spaces: a probability measure is a measure of total mass one on a measurable space.

[F7]

Statistical experiments: an experiment fixes a measurable observation space and a probability law for each parameter.

[F8]

Test size and power: a test has level α when its size, the supremum of its rejection probabilities over the null, is at most α.

Verification

1.1givenF1F5F6F7algebra

The full power set of {0,…,n} is an algebra closed under countable unions, hence a sigma-algebra by [F5]. The binomial theorem [F1] gives ∑j=0n(nj)pj(1−p)n−j=(p+1−p)n=1; all terms are nonnegative for p∈[0,1], so [F6] makes the displayed masses a probability measure, including p=0,1. These laws form an experiment as in [F7].

1.2givenF4F9F10algebra

For k<n, count pairs consisting of a j-element subset of an n-element set and a distinguished element inside it. Counting in the two orders gives j(nj)=n(n−1j−1) for 1≤j≤k. Counting instead a distinguished element outside the subset gives (n−j)(nj)=n(n−1j) for 0≤j≤k, by [F4]. The first identity is not used at j=0: in differentiating pj, that boundary term is zero, so the first derivative sum starts at j=1, while the second identity includes j=0. Since Fp(k) is a polynomial, it is continuous on [0,1], and for 0<p<1 termwise differentiation and the two identities give ddpFp(k)=∑j=1kj(nj)pj−1(1−p)n−j−∑j=0k(n−j)(nj)pj(1−p)n−j−1=−n(n−1k)pk(1−p)n−k−1<0. When k=0, the first sum is empty and the j=0 term of the second sum gives the same formula. By [F9], Fp(k) is strictly decreasing on [0,1]. Also F0(k)=1 and F1(k)=0 because k<n. Applying [F10] to this continuous polynomial on [0,1] gives a point Uk∈(0,1) with FUk(k)=α; strict decrease makes it unique.

2.1givenF8step 1.1algebra

For each fixed candidate p0, Fp0(k) is nondecreasing in integer k. Let k0 be the least k∈{0,…,n} with Fp0(k)≥α, which exists because Fp0(n)=1. The deterministic test function is φp0(x)=1{Fp0(x)<α}; it is measurable on this finite space. Its rejection event is {X<k0}, whose probability is 0 if k0=0, and otherwise is Fp0(k0−1)<α. The null is {p0}, and the alternative [0,1]∖{p0} is nonempty; by [F8] the test size equals this rejection probability and is at most α.

3.1givenF2F3step 1.2step 2.1algebra∎

For an observed x<n, strict decrease of Fp(x) in p makes {p0:Fp0(x)≥α}=[0,Ux]; for x=n, the set is [0,1]=[0,Un]. Thus C(X) is precisely the inversion of those acceptance events. The level calculation in step 2.1 and [F3] imply its coverage is at least 1−α, in the sense of [F2].

Remarks

The finite binomial size calculation uses the current Test size and power interface, and Coverage from test inversion supplies the stated coverage implication.

Sources