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.

✓ 1 result · all verified · 0 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.

Estimators and Randomized Procedures

1 · Prerequisites

2 · Summary

Statistics and estimators are measurable maps from observed data to named target spaces. A randomized procedure assigns a probability distribution on actions to each data value, with measurability required for every action event. A binary action space gives a randomized test, whose test function is the conditional rejection probability. The action-law lemma proves that integrating a procedure against each sampling law yields a probability distribution on actions and that nonnegative action functionals are measurable before that integration.

The definitions impose no measurable structure on the parameter set. A kernel itself specifies a randomized procedure; no representation by an auxiliary random seed is assumed for arbitrary measurable action spaces. Deterministic procedures arise when each action distribution is concentrated at one value.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Randomized procedures as probability kernels

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment (Statistical experiments) and let (D,G) be a measurable action space: a set of available actions equipped with a sigma-algebra of action events, hence a measurable space (Measurable spaces and measurable sets). A randomized procedure (or randomized decision rule) is a probability kernel K from (X,A) to (D,G), in the pointwise sense of Measure kernel and probability kernel. Thus K(x,⋅) is a probability measure on (D,G) for every x∈X, and x↦K(x,B) is A-measurable for every B∈G. After observing x, the procedure assigns probability K(x,B) to taking an action in B. The kernel is specified without reference to the unknown parameter. This definition imposes no measurable structure on Θ. The kernel is the specification of the procedure; no representation by a separate random seed is asserted for arbitrary measurable action spaces.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A randomized procedure has a measurable action law

Statement

Let K be a randomized procedure for the experiment E=((X,A),Θ,(Pθ)θ∈Θ) with action space (D,G). Give [0,+∞] its Borel sigma-algebra. For every nonnegative G/B([0,+∞])- measurable function g:D→[0,+∞], the function hg(x)=∫Dg(a) K(x,da) is A-measurable. In particular, x↦K(x,B) is measurable for every action event B∈G. For each θ∈Θ, the set function Qθ(B)=∫XK(x,B) Pθ(dx),B∈G, is a probability measure on (D,G), and for every such g, ∫Dg dQθ=∫X(∫Dg(a) K(x,da))Pθ(dx). with nonnegative extended values allowed.

Facts & Assumptions

Given: The experiment and randomized procedure in the statement, and a nonnegative measurable function g on the action space.

[F1]

For each θ, Pθ is a probability measure on (X,A) (Statistical experiments).

[F2]

For every x, K(x,⋅) is a probability measure, and for every B∈G, x↦K(x,B) is measurable (Measure kernel and probability kernel).

[F3]

The expectation of a nonnegative measurable function under Pθ is its extended nonnegative integral (Expectation of a nonnegative or integrable random variable).

[F4]

A nonnegative simple measurable function has finite range and a finite sum representation using disjoint measurable sets (Nonnegative simple measurable functions).

[F5]

The simple integral of ∑jcj1Bj is ∑jcjμ(Bj) (The integral of a nonnegative simple function).

[F6]

The nonnegative integral agrees with the simple integral on nonnegative simple functions (The nonnegative integral agrees with the simple integral on simple functions).

[F7]

The nonnegative integral is additive on finite sums of nonnegative measurable functions (Additivity of the nonnegative Lebesgue integral).

[F8]

The nonnegative integral is monotone and homogeneous under positive scalar multiplication; the zero function has integral zero. No product 0⋅(+∞) is formed (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F9]

Nonnegative measurable functions admit increasing simple approximations (Every nonnegative measurable function is the increasing limit of simple measurable functions).

[F10]

Increasing pointwise limits pass through nonnegative integrals (Monotone convergence for the integral).

[F11]

The nonnegative extended sum is the supremum of its finite partial sums (Series in the nonnegative extended real line).

[F12]

A measure is countably additive and assigns zero to the empty set; a probability measure also assigns mass one to the whole space (Measures on sigma-algebras, Probability measures and probability spaces).

[F13]

Finite sums of nonnegative measurable functions are measurable. Nonnegative scalar multiples of real-valued measurable functions are measurable, and increasing pointwise limits of nonnegative measurable functions are measurable, including extended-valued limits (Closure properties of measurable functions used by the integral).

Proof

technique · direct
1.1F1F2F3F5F6F8F12

Fix θ∈Θ. For each B∈G, the function x↦K(x,B) is measurable and lies in [0,1] by [F2]. Thus its integral is finite and at most ∫1 dPθ=1 by [F1], [F3], [F8], and [F12]. Since K(x,∅)=0 and K(x,D)=1, the simple-integral formula and agreement [F5, F6] give Qθ(∅)=0 and Qθ(D)=Pθ(X)=1.

1.2F2F4F5F6F9F10F13

By [F9], choose nonnegative simple functions gn↑g. Fix n and write gn=∑j=1mcj1Bj with finite m, cj≥0, and pairwise disjoint Bj∈G, as in [F4]. The simple-integral formula and agreement [F5, F6] give hgn(x)=∑j=1mcjK(x,Bj). Each summand is measurable by [F2], and finite sums and nonnegative scalar multiples are measurable by [F13]. For every x, monotone convergence under the probability measure K(x,⋅) gives hgn(x)↑hg(x). Thus hg is measurable by the increasing-limit clause of [F13].

2.1F1F2F7F10F11F12F13step 1.1

If (Bj)j∈N are pairwise disjoint members of G, then for every x, K(x,⋃jBj)=lim⁡N→∞SN(x), where SN(x)=∑j=0NK(x,Bj), by countable additivity of K(x,⋅). Each SN is measurable by [F2] and finite-sum closure [F13], and SN increases. Monotone convergence [F10] and finite additivity of the nonnegative integral [F7] give Qθ(⋃jBj)=lim⁡N∑j=0NQθ(Bj)=∑jQθ(Bj), where the last expression is the nonnegative extended sum [F11]. Together with step 1.1 and [F12], this proves that Qθ is a probability measure.

3.1givenF2F3F4F5F6F7F8step 1.1step 2.1

For an indicator g=1B, [F5] and [F6] give hg(x)=K(x,B) and ∫g dQθ=Qθ(B), so the defining equation for Qθ proves the iterated-integral identity. Finite addition [F7] and nonnegative homogeneity [F8] extend this equality from indicators to every nonnegative simple g.

4.1F1F3F10step 2.1step 1.2step 3.1∎

The increasing simple sequence from step 1.2 satisfies gn↑g and hgn↑hg. By step 1.2 all hgn and hg are measurable; by step 2.1, Qθ is a probability measure. Applying monotone convergence [F10] under Qθ and under Pθ to the simple identities of step 3.1 proves the asserted equality, including when its value is +∞.

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

Statistics and estimators

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be an experiment (Statistical experiments). A statistic with target measurable space (Y,B) is a measurable map T:(X,A)→(Y,B), where measurability means that T−1(B)∈A for every B∈B (A measurable function between measurable spaces). If ψ:Θ→Y is an estimand (Estimands on a statistical model) and its target set Y is equipped with B, a statistic ψ^ with this same target space is an estimator of ψ. The value ψ^(x) is the estimate at observed data x. Giving Y a measurable structure is an additional choice; this definition does not assert that ψ is measurable as a function of the parameter.

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

Randomized tests

Definition

A randomized test is a randomized procedure with binary action space whose action set is {0,1}, equipped with its full sigma-algebra 2{0,1} (the power set, which is a sigma-algebra by Sigma-algebras), where 1 means reject and 0 means do not reject (Randomized procedures as probability kernels). Its test function is φ(x)=K(x,{1}),x∈X. Since K(x,⋅) is a probability measure and {0},{1} partition the action set, K(x,{0})+K(x,{1})=1. Thus φ(x)∈[0,1] and 1−φ(x)=K(x,{0}) is the probability of not rejecting. Give [0,1] the trace of the Borel sigma-algebra on [0,+∞], namely {C∩[0,1]:C∈B([0,+∞])}. By A randomized procedure has a measurable action law, x↦K(x,{1}) is measurable; since it has range in [0,1], its preimage of C∩[0,1] equals its preimage of C and is measurable for every such C. Hence φ is a measurable map in the preimage sense of A measurable function between measurable spaces. Its value is the rejection probability after observing x. The convention 1=reject is fixed here. No null or alternative hypothesis is part of this definition.

5 · Examples, counterexamples and false statements

None yet.

Sources