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.
Generalized linear models and Fisher scoring — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Generalized linear models and Fisher scoring
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- 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
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- 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
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Moore--Penrose Pseudoinverse and Regularised Least Squares
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
2 · Summary
These finite examples calculate Bernoulli-logit and Poisson-log updates, show complete logistic separation without a finite maximizer, compare a mean-matched overdispersed count law with Poisson variance, and inspect identity-link and rank-deficient-information boundaries. Each calculation checks only its stated model and does not supply a generic convergence, inferential, or goodness-of-fit guarantee.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A one-observation Bernoulli-logit Fisher-scoring step
Example
Take , , , and current value . Use a Bernoulli response with canonical logit link, , and .
Facts & Assumptions
Given: The scalar design , response , current , and the Bernoulli-logit family and link in the Example.
Generalized linear model with explicit conditioning: the canonical link is , equivalently .
Canonical-link score and Hessian: under a common scale the score is .
General-link score and Fisher information: the expected score outer-product information has weights .
One minimum-norm IRLS step: the working response and weights are and .
IRLS equals the Fisher-scoring step when information is invertible: when information is invertible, .
The Bernoulli-logit component mass on relative to counting measure is . It sums to one; its support is fixed, its second moment is finite, and its first two derivatives are bounded on the finite support. (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and , The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)
Verification
For the Bernoulli cumulant, and , so , , and . By [F1] the natural and linear predictors are both zero; [F2] gives , and [F3] gives .
By [F4], . The weighted least-squares objective is , whose unique minimizer is . By [F5], the Fisher-scoring update is , the same value.
A one-observation Poisson-log Fisher-scoring step
Example
Take , , , and current value . Use a Poisson response with canonical log link, , , and .
Facts & Assumptions
Given: The scalar design , response , current , and the Poisson-log family and link in the Example.
Generalized linear model with explicit conditioning: the canonical link is , equivalently .
Mean and variance from the cumulant function: the response mean is and its variance is .
General-link score and Fisher information: the expected score outer-product information has weights .
One minimum-norm IRLS step: the working response and weights are and .
IRLS equals the Fisher-scoring step when information is invertible: when information is invertible, .
The Poisson response has support , counting base measure, and . The exponential series and addition formula normalize the masses. Its first two derivatives are and . On any compact interval these are bounded by the summable sequence ; the ratio test gives summability. Reindexing gives for . Thus the fixed-support, finite-moment and derivative-envelope hypotheses hold, and the component score has finite second moment. (The real exponential function and the number by a power series, The exponential addition formula , The factorial and the falling factorial , defined by recursion in , The exponential function is smooth and )
Verification
Here , so . By [F1] the natural parameter is . The score is , and [F3] gives .
By [F4], . The weighted least-squares objective is , minimized uniquely at . By [F5], the Fisher-scoring update is , agreeing with IRLS.
Complete separation prevents a finite logistic MLE
Example
Let , , , , and responses . Use independent Bernoulli responses with canonical logit link and parameter domain . The two observations are completely separated by the sign of . Here a finite maximum-likelihood estimate means a finite attaining the supremum of the log likelihood.
Facts & Assumptions
Given: The design column , responses , the Bernoulli cumulant , and .
Generalized linear model with explicit conditioning: the canonical link is the choice , equivalently .
Canonical-link score and Hessian: the canonical score is when .
Strict concavity and uniqueness of a finite stationary maximizer: positive and full column rank imply strict concavity, but the conclusion does not assert existence of a finite maximizer.
The Bernoulli-logit component mass on relative to counting measure is . It sums to one; the support is fixed, the response is bounded, and its first two derivatives are locally bounded because and with . (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and , The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)
Verification
The column has rank one, and for every finite . Thus [F3] applies and the log likelihood is strictly concave on .
By [F1], . The score formula [F2] gives at every finite .
The log likelihood is strictly negative for every finite , while as . Hence its supremum is and is not attained at any finite parameter: this separated logistic model has no finite MLE despite strict concavity.
A mean-matched count law can be overdispersed relative to Poisson
Example
Let a count response have mass at and mass at . This law has the same mean as a Poisson response with mean , but a much larger variance.
Facts & Assumptions
Given: The two-point count law in the Example and a comparison Poisson GLM with , , and .
Generalized linear model with explicit conditioning: a GLM pairs a response family with a link and a natural parameter map satisfying .
Mean and variance from the cumulant function: for the stated family, mean is and variance is .
For the comparison Poisson response, the support is , the base measure is counting measure, and . The exponential series and addition formula normalize these masses. Its first two parameter derivatives are and . On any compact interval they are dominated by the summable sequence ; the ratio test gives summability. Reindexing the same exponential series gives for , so the family satisfies the fixed-support, moment, and derivative-envelope hypotheses. (The real exponential function and the number by a power series, The exponential addition formula , The factorial and the falling factorial , defined by recursion in , The exponential function is smooth and )
Verification
For the two-point law, and , so .
For the comparison Poisson model, gives , so [F2] gives mean and variance both equal to . Since the constructed law has the same mean and variance , it is overdispersed relative to this Poisson variance specification and is not a Poisson response law.
The Bernoulli identity-link boundary leaves the regular family
Example
For one Bernoulli response take , identity link , and . The admissible interior parameter is . The boundary value is a valid degenerate Bernoulli law in the closure, but it is not represented by a finite natural parameter.
Facts & Assumptions
Given: The Bernoulli cumulant , , identity link , and the closure boundary .
Generalized linear model with explicit conditioning: and , where satisfies .
One minimum-norm IRLS step: the scoring step requires finite positive weights and a finite nonzero link derivative at the current iterate.
In this Bernoulli GLM, and ; relative to counting measure the mass is . It is normalized by summing over . Writing the natural-parameter derivatives as and , the first two derivatives have constant integrable bounds on the two-point support, and . Thus the fixed-support, finite-moment, derivative-envelope, and score-moment hypotheses used above hold. (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and , The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)
Verification
For Bernoulli, , so the finite natural parameter corresponding to is . Under the identity link, ; as , , so is outside the finite-natural-parameter interior.
On the interior, and . Hence [F2] gives as . The boundary therefore violates the finite-weight admissibility in [F3], even though the limiting Bernoulli law itself is a probability measure.
Rank deficiency gives singular information and nonunique weighted least squares
Example
Use the Bernoulli-logit model with , design rows and , and responses . The weights are positive, but the design columns are dependent.
Facts & Assumptions
Given: The two-row design and responses in the Example, the Bernoulli-logit family, current , and .
One minimum-norm IRLS step: IRLS minimizes the weighted least-squares objective and applies the Moore-Penrose minimum-norm convention if minimizers are not unique.
Each Bernoulli-logit response has the counting-measure mass on . It is normalized, has fixed support and finite moments, and its first two derivatives are locally bounded on this finite support. (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and , The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)
Verification
At , both predictors are , both means are , and both logit derivatives are . Thus by [F1]. Direct multiplication gives , which has rank one; the score is .
The working responses are and . For , put ; the weighted objective is . Differentiation gives , so every with is a minimizer. These minimizers form a line, while shows the Moore-Penrose convention selects . The information inverse is undefined because is singular.