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.

✓ 3 results · all verified · 2 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.

Scores and Information Bounds — Examples

1 · Prerequisites

2 · Summary

The Bernoulli and known-variance normal location models have regular common support, and their natural estimators attain the scalar information bound. The uniform endpoint model has moving support: its formal score is not mean-zero, the estimator-score covariance is not the target derivative, and the resulting naive inequality is false. This example marks the role of the regularity identities in the theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Bernoulli score, information, and attainment of the scalar bound

Example

Assume AC. Let X take values in {0,1}, with Pp(X=1)=p, Pp(X=0)=1−p, and p∈(0,1). With counting measure as dominator, this is a one-parameter common-support model. The statistic T=X is unbiased for ψ(p)=p, and it attains the scalar Cramér–Rao bound.

Facts & Assumptions

Given: AC; p∈(0,1); the finite probability law on {0,1} with masses p and 1−p; and the statistic T(x)=x.

[A1]

The Axiom of Choice: AC supplies the arbitrary-index density representatives used by the general score definition.

[F1]

Statistics and estimators: an estimator is a measurable statistic with a specified target space.

[F2]

Expectation agrees with the published finite weighted sum: on a finite probability space, expectation is the sum of values weighted by their probabilities.

[F3]

Score and Fisher information: the score is the parameter derivative of the log density, and scalar information is its expected square.

[F4]

Mean-zero score and the information identity: fixed positive support, continuous first and second derivatives with common integrable envelopes on a neighborhood, and a finite score second moment imply mean-zero score and the information identity.

[F5]

Moments, variance, and covariance on a probability space: variance is the expected square of the centered variable, and covariance is the expected product of centered variables.

[F6]

Scalar Cramér–Rao lower bound: assume AC and an open scalar parameter interval. For a real-valued estimator T with finite second moment at p and EqT=ψ(q) on a neighborhood of p, where ψ is differentiable at p, a mean-zero score with finite positive information and Cov⁡p(T,Sp)=ψ′(p) gives the scalar variance bound and its almost-sure equality condition.

Verification

technique · direct
1.1F4given

Put ε:=12min⁡{p,1−p}>0, the open neighborhood U:=(p−ε,p+ε), and its compact closure K:=[p−ε,p+ε]⊂(0,1). For q∈K, the masses pq(1)=q and pq(0)=1−q are positive and twice continuously differentiable on the fixed support S={0,1}, with common exceptional set N=∅. With counting measure #, their first derivatives are 1 and −1, and their second derivatives are 0. Thus the common envelopes g1(0)=g1(1)=1 and g2≡0 dominate all first and second derivatives on U; they are integrable because ∫g1 d#=2 and ∫g2 d#=0.

1.2A1F1F2F3F4givenalgebra

The map T(x)=x is real-valued and measurable on the full power set of {0,1}. For every q∈(0,1), the masses sum to 1, and [F2] gives EqT=q and EqT2=q<∞; hence T=X is unbiased for ψ(q)=q throughout the parameter interval, including a neighborhood of p. At p, finite summation gives Var⁡p(T)=p(1−p). The log density is ℓp(x)=xlog⁡p+(1−x)log⁡(1−p). Differentiating gives Sp(x)=x/p−(1−x)/(1−p)=(x−p)/(p(1−p)) and ℓp′′(x)=−x/p2−(1−x)/(1−p)2. Since the two score values are finite, its second moment is finite. Finite summation yields EpSp=0 and I(p)=EpSp2=1/[p(1−p)]=−Epℓp′′, agreeing with [F4].

2.1F5F6F8step 1.1step 1.2algebra

Since Sp=(X−p)/(p(1−p)), [F5] gives Cov⁡p(X,Sp)=Var⁡p(X)/[p(1−p)]=1. On the open parameter interval (0,1), ψ(p)=p has difference quotient 1 at every x≠p, so [F8] gives ψ′(p)=1; the score-covariance identity required by [F6] holds.

3.1F6step 1.1step 1.2step 2.1algebra∎

The bound from [F6] is Var⁡p(T)≥1/I(p)=p(1−p), and step 1.2 gives equality. Moreover T−ψ(p)=X−p=p(1−p)Sp=(ψ′(p)/I(p))Sp, exactly its equality condition.

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

Normal location score, information, and attainment

Example

Assume AC. Let X∼N(μ,σ2), where μ∈R is the parameter and σ2>0 is fixed. With Lebesgue measure as dominator, the density is pμ(x)=12πσ2exp⁡ ⁣(−(x−μ)22σ2). The estimator T=X is unbiased for ψ(μ)=μ, and it attains the scalar Cramér–Rao bound.

Facts & Assumptions

Given: AC; σ2>0; the normal location model and density displayed above; and T(X)=X.

[A1]

The Axiom of Choice: AC supplies the normal probability law and the arbitrary-index density representatives used by the general score definition.

[F1]

Standard normal and normal laws: N(0,1) has density ϕ(z)=e−z2/2/2π, and N(μ,σ2) is the law of μ+σZ for Z∼N(0,1).

[F2]

The standard normal density has total mass one: the standard normal density ϕ(z)=e−z2/2/2π integrates to 1. The required second moment is established locally below by compact-interval integration. Also Gaussian even moments for Brownian increments gives EZ2=1: instantiate its increment as Xt=Z minus the constant Xs=0, with labels s=0,t=1 and m=1; no Brownian process is required.

[F3]

Change of variables for expectation, Integrating against a density agrees with integrating the product, and The Lebesgue integral is linear on L1(μ): expectations under a density are density integrals, affine normal laws are computed from X=μ+σZ, and expectation is linear on integrable variables.

[F4]

Score and Fisher information: the score is the derivative of the log density and scalar information is its expected square.

[F5]

Mean-zero score and the information identity: the stated regularity hypotheses imply mean-zero score and I=−E[ℓ′′].

[F6]

Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.

[F7]

Scalar Cramér–Rao lower bound: under the score-covariance identity, the scalar variance bound has equality exactly when the centered estimator is (ψ′/I) times the score.

[F11]

Monotone convergence for the integral: increasing sequences of nonnegative measurable functions pass to the limit under the integral.

[F12]

A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not: under Countable Choice, for a>0 and Lebesgue measurable E⊆R, λ(aE)=aλ(E). The assumed AC supplies this premise. For nonnegative measurable f, correspondence of simple minorants under the bijection z↦az and the defining supremum for the nonnegative integral give ∫f(az) dz=a−1∫f(y) dy. Likewise Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation and the same simple-minorant argument give ∫f(x−b) dx=∫f(y) dy for every real b.

Verification

technique · direct
1.1A1F1F9givenalgebra

Let Z∼N(0,1) have density ϕ, and put G(z):=zϕ(z). By [F9], ϕ′(z)=−zϕ(z) and G′(z)=ϕ(z)−z2ϕ(z). These functions are smooth.

2.1F3F10step 1.1algebra

For each integer n≥1, G′ is continuous on [−n,n], hence integrable there by [F10]. Applying the second FTC and then the Riemann–Lebesgue integral identity in [F10] gives ∫[−n,n](ϕ−z2ϕ) dλ=G(n)−G(−n)=2nϕ(n). Linearity [F3] therefore yields ∫[−n,n]z2ϕ dλ=∫[−n,n]ϕ dλ−2nϕ(n).

3.1F2F3F9F11step 2.1algebra

By the power-series representation in [F9], en2/2≥(n2/2)2/2!=n4/8, so 0≤nϕ(n)≤8/(2πn3)→0. Also ϕ1[−n,n]↑ϕ and z2ϕ1[−n,n]↑z2ϕ. Monotone convergence [F11], normalization [F2], and the compact calculation in step 2.1 give EZ2=∫z2ϕ dλ=lim⁡n∫[−n,n]z2ϕ dλ=1<∞, also the second moment supplied in [F2].

4.1F1F3F4step 3.1givenalgebra

Differentiating the displayed normal density gives ∂ηpη=(x−η)pη/σ2, ∂ηηpη=((x−η)2/σ4−1/σ2)pη, Sμ=(X−μ)/σ2, and ℓμ′′=−1/σ2. The support is all of R, and step 3.1 with X=μ+σZ gives EμSμ2=1/σ2<∞.

5.1F1F3F5F12step 3.1step 4.1givenalgebra

Fix μ0∈R and δ>0, put y=x−μ0, and take ∣η−μ0∣<δ. Then ∣x−η∣≤∣y∣+δ and (x−η)2≥y2/2−δ2, so both first and second density derivatives are bounded by C(1+y2)e−y2/(4σ2) for a finite C independent of η,x. First, write the displayed density as pμ(x)=σ−1ϕ((x−μ)/σ). For every Borel set A, the scaling and translation identities [F12] with a=σ and b=μ give ∫Apμ(x) dx=∫1A(μ+σz)ϕ(z) dz=P(μ+σZ∈A), so pμ is indeed a density of the specified law N(μ,σ2). To justify the envelope transformation, put a=2σ>0 and q(y)=(4πσ2)−1/2e−y2/(4σ2). For every Borel set A, [F12] applied to f=1Aq gives ∫Aq(y) dy=a∫1A(az)q(az) dz=∫1A(az)ϕ(z) dz, since aq(az)=ϕ(z). By [F1] and [F3], the last integral equals P(aZ∈A); thus q is indeed a density of the affine law Y=aZ∼N(0,2σ2). The envelope is a constant multiple of (1+y2)q(y). By [F3] and step 3.1, its integral in y is finite, since E(1+Y2)=1+a2EZ2=1+2σ2. Translation invariance in [F12] transfers this finite integral from y to x=y+μ0, proving integrability of the displayed envelope on the original data space. Thus the fixed-support, continuous-derivative, envelope, and score-moment hypotheses of [F5] hold, so EμSμ=0 and I(μ)=−Eμℓμ′′=1/σ2.

6.1F1F3F6step 3.1step 5.1algebra

From X−μ=σ2Sμ and step 5.1, EμX=μ. Also Eμ[(X−μ)2]=σ2EZ2=σ2, so T=X has variance σ2.

7.1F4F6F7F8step 5.1step 6.1algebra

The pointwise identity X−μ=σ2Sμ and [F6] give Cov⁡μ(X,Sμ)=σ2I(μ)=1. On R, ψ(μ)=μ has difference quotient 1 at every x≠μ, so [F8] gives ψ′(μ)=1; the score-covariance identity required by [F7] holds.

8.1F6F7step 6.1step 7.1algebra∎

The bound [F7] is Var⁡μ(X)≥1/I(μ)=σ2, and step 6.1 gives equality. Also X−μ=σ2Sμ=(ψ′(μ)/I(μ))Sμ, so the stated equality condition holds.

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

Uniform moving support invalidates the naive score bound

Statement refuted

For every differentiable one-parameter density family, the formal score Sθ=∂θlog⁡pθ(X) and its finite positive second moment I(θ)=EθSθ2 automatically give the Cramér–Rao inequality Var⁡θ(T)≥ψ′(θ)2/I(θ) for every unbiased finite-variance estimator T, even when the support depends on θ.

Facts & Assumptions

Given: AC; θ>0; the density family and estimator stated above.

[A1]

The Axiom of Choice: AC includes countable choice and supplies the selected representatives used by the score definition.

[F1]

Statistics and estimators: an estimator is a measurable statistic with a specified target.

[F2]

The measure with density f relative to μ and Integrating against a density agrees with integrating the product: the law with density pθ integrates a nonnegative g as ∫gpθ dλ.

[F5]

Score and Fisher information: on the positive-density support, the score is the parameter derivative of the log density and information is the expected squared score.

[F6]

Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.

[F7]

Scalar Cramér–Rao lower bound: the bound requires a mean-zero score and the score-covariance derivative identity; the fixed-support route is sufficient, not necessary.

Counterexample

Assume AC. Let θ>0 and X∼Unif[0,θ]. Use the equivalent Lebesgue-density version pθ(x)=θ−11(0,θ)(x) with respect to Lebesgue measure, and set T=2X, estimating ψ(θ)=θ. The positive-density set (0,θ) changes with θ.

Proof technique: direct.

1.1A1F1F2F3F4F6givenalgebra

By [F3], the endpoint singletons have measure zero and λ((0,θ))=θ, so this density version gives the law Unif[0,θ] and has total mass one. Using [F2] for the nonnegative functions 2x and (2x−θ)2, then [F4] to evaluate their integrals, gives EθT=θ−1∫0θ2x dx=θ and Var⁡θ(T)=Eθ[(2X−θ)2]=θ−1∫0θ(2x−θ)2 dx=θ−1[43x3−2θx2+θ2x]0θ=θ23. Thus T is unbiased for ψ(θ)=θ and has variance θ2/3.

2.1F5F6F7F8step 1.1givenalgebra

For 0<x<θ, ℓθ(x)=−log⁡θ, so Sθ(x)=−1/θ. Therefore I(θ)=EθSθ2=1/θ2 but EθSθ=−1/θ≠0. Since the score is constant Pθ-almost surely, Cov⁡θ(T,Sθ)=0. On Θ=(0,∞), ψ(θ)=θ has difference quotient 1 at every x≠θ, so [F8] gives ψ′(θ)=1. Both score identities needed for [F7] fail here.

3.1F7step 1.1step 2.1givenalgebra∎

The formula obtained by ignoring those failures would give ψ′(θ)2/I(θ)=θ2, contradicting the actual Var⁡θ(T)=θ2/3 from step 1.1. This does not contradict [F7]: the moving support violates its regularity route, and the score-mean and covariance-derivative hypotheses fail explicitly in step 2.1.

Sources