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.
Scores and Information Bounds — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-Sample Point Estimation
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scores and Information Bounds
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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
Bernoulli score, information, and attainment of the scalar bound
Example
Assume AC. Let take values in , with , , and . With counting measure as dominator, this is a one-parameter common-support model. The statistic is unbiased for , and it attains the scalar Cramér–Rao bound.
Facts & Assumptions
Given: AC; ; the finite probability law on with masses and ; and the statistic .
The Axiom of Choice: AC supplies the arbitrary-index density representatives used by the general score definition.
Statistics and estimators: an estimator is a measurable statistic with a specified target space.
Expectation agrees with the published finite weighted sum: on a finite probability space, expectation is the sum of values weighted by their probabilities.
Score and Fisher information: the score is the parameter derivative of the log density, and scalar information is its expected square.
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.
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.
Scalar Cramér–Rao lower bound: assume AC and an open scalar parameter interval. For a real-valued estimator with finite second moment at and on a neighborhood of , where is differentiable at , a mean-zero score with finite positive information and gives the scalar variance bound and its almost-sure equality condition.
The derivative of at a point that is a limit point of , and differentiability on a set: the derivative is the limit of the difference quotient at .
Verification
Put , the open neighborhood , and its compact closure . For , the masses and are positive and twice continuously differentiable on the fixed support , with common exceptional set . With counting measure , their first derivatives are and , and their second derivatives are . Thus the common envelopes and dominate all first and second derivatives on ; they are integrable because and .
The map is real-valued and measurable on the full power set of . For every , the masses sum to , and [F2] gives and ; hence is unbiased for throughout the parameter interval, including a neighborhood of . At , finite summation gives . The log density is . Differentiating gives and . Since the two score values are finite, its second moment is finite. Finite summation yields and , agreeing with [F4].
Since , [F5] gives . On the open parameter interval , has difference quotient at every , so [F8] gives ; the score-covariance identity required by [F6] holds.
The bound from [F6] is , and step 1.2 gives equality. Moreover , exactly its equality condition.
Normal location score, information, and attainment
Example
Assume AC. Let , where is the parameter and is fixed. With Lebesgue measure as dominator, the density is The estimator is unbiased for , and it attains the scalar Cramér–Rao bound.
Facts & Assumptions
Given: AC; ; the normal location model and density displayed above; and .
The Axiom of Choice: AC supplies the normal probability law and the arbitrary-index density representatives used by the general score definition.
Standard normal and normal laws: has density , and is the law of for .
The standard normal density has total mass one: the standard normal density integrates to . The required second moment is established locally below by compact-interval integration. Also Gaussian even moments for Brownian increments gives : instantiate its increment as minus the constant , with labels and ; no Brownian process is required.
Change of variables for expectation, Integrating against a density agrees with integrating the product, and The Lebesgue integral is linear on : expectations under a density are density integrals, affine normal laws are computed from , and expectation is linear on integrable variables.
Score and Fisher information: the score is the derivative of the log density and scalar information is its expected square.
Mean-zero score and the information identity: the stated regularity hypotheses imply mean-zero score and .
Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.
Scalar Cramér–Rao lower bound: under the score-covariance identity, the scalar variance bound has equality exactly when the centered estimator is times the score.
The derivative of at a point that is a limit point of , and differentiability on a set: the derivative is the limit of the difference quotient at .
The exponential function is smooth and , The power-series, product-limit, IVP, functional-equation, and Picard definitions agree, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , and Sums, scalar multiples, products and quotients: , , , and when : the exponential is smooth and equals its power series; the chain and product rules give the derivatives of and .
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, The second fundamental theorem: if is differentiable on with and is integrable, then , and A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: continuous functions on a compact interval are integrable, the second FTC evaluates an integral of a derivative, and the Riemann and Lebesgue integrals agree there.
Monotone convergence for the integral: increasing sequences of nonnegative measurable functions pass to the limit under the integral.
A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not: under Countable Choice, for and Lebesgue measurable , . The assumed AC supplies this premise. For nonnegative measurable , correspondence of simple minorants under the bijection and the defining supremum for the nonnegative integral give . Likewise Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation and the same simple-minorant argument give for every real .
Verification
Let have density , and put . By [F9], and . These functions are smooth.
For each integer , is continuous on , hence integrable there by [F10]. Applying the second FTC and then the Riemann–Lebesgue integral identity in [F10] gives . Linearity [F3] therefore yields .
By the power-series representation in [F9], , so . Also and . Monotone convergence [F11], normalization [F2], and the compact calculation in step 2.1 give , also the second moment supplied in [F2].
Differentiating the displayed normal density gives , , , and . The support is all of , and step 3.1 with gives .
Fix and , put , and take . Then and , so both first and second density derivatives are bounded by for a finite independent of . First, write the displayed density as . For every Borel set , the scaling and translation identities [F12] with and give , so is indeed a density of the specified law . To justify the envelope transformation, put and . For every Borel set , [F12] applied to gives , since . By [F1] and [F3], the last integral equals ; thus is indeed a density of the affine law . The envelope is a constant multiple of . By [F3] and step 3.1, its integral in is finite, since . Translation invariance in [F12] transfers this finite integral from to , 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 and .
From and step 5.1, . Also , so has variance .
The pointwise identity and [F6] give . On , has difference quotient at every , so [F8] gives ; the score-covariance identity required by [F7] holds.
The bound [F7] is , and step 6.1 gives equality. Also , so the stated equality condition holds.
Uniform moving support invalidates the naive score bound
Statement refuted
For every differentiable one-parameter density family, the formal score and its finite positive second moment automatically give the Cramér–Rao inequality for every unbiased finite-variance estimator , even when the support depends on .
Facts & Assumptions
Given: AC; ; the density family and estimator stated above.
The Axiom of Choice: AC includes countable choice and supplies the selected representatives used by the score definition.
Statistics and estimators: an estimator is a measurable statistic with a specified target.
The measure with density relative to and Integrating against a density agrees with integrating the product: the law with density integrates a nonnegative as .
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral, The second fundamental theorem: if is differentiable on with and is integrable, then , and For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term: continuous functions on are Riemann integrable, their Riemann and Lebesgue integrals agree under countable choice, and antiderivatives evaluate the required polynomial integrals.
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.
Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.
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.
The derivative of at a point that is a limit point of , and differentiability on a set: the derivative is the limit of the difference quotient at .
Counterexample
Assume AC. Let and . Use the equivalent Lebesgue-density version with respect to Lebesgue measure, and set , estimating . The positive-density set changes with .
Proof technique: direct.
By [F3], the endpoint singletons have measure zero and , so this density version gives the law and has total mass one. Using [F2] for the nonnegative functions and , then [F4] to evaluate their integrals, gives and . Thus is unbiased for and has variance .
For , , so . Therefore but . Since the score is constant -almost surely, . On , has difference quotient at every , so [F8] gives . Both score identities needed for [F7] fail here.
The formula obtained by ignoring those failures would give , contradicting the actual 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
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, §3.1 and Bernoulli information calculation, PDF pp. 21–23
- Anna Mikusheva, MIT 14.381 Lecture 6: Efficient Estimators, Rao-Cramer Bound, PDF pp. 4–6
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, §3.1, PDF pp. 21–24
- Anna Mikusheva, MIT 14.381 Lecture 6: Efficient Estimators, Rao-Cramer Bound, PDF pp. 2–5
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, §3.1, support regularity discussion, PDF pp. 21–24
- Anna Mikusheva, MIT 14.381 Lecture 6: Efficient Estimators, Rao-Cramer Bound, PDF pp. 2, 5–6