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
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
- 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
- Foundations of the Real Numbers for Analysis
- 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
- 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
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- 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 Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Moore--Penrose Pseudoinverse and Regularised Least Squares
- The Radon Nikodym Theorem and Lebesgue Decomposition
- 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
This page specifies finite independent response vectors under an explicit product sampling law, then derives the generalized linear model's mean, variance, and likelihood derivatives. The algorithm defines one minimum-norm IRLS update; a separate theorem identifies it with Fisher scoring under additional regularity and invertible-information hypotheses. A scientific application must separately provide its model contract for observation units, predictor and response roles, target, conditioning, and model-adequacy assumptions. The canonical-link concavity result gives at most one finite stationary point, and any such point is the unique global maximizer, when the parameter domain is open and convex, the design has full column rank, the common scale is positive, the cumulant curvature is positive throughout the predictor image, and the fixed response vector has positive component densities throughout the parameter domain; it does not guarantee existence. The algorithm makes one finite update, with no convergence or termination claim. Deviance is defined only for nested models on common support with finite suprema, and nesting proves nonnegativity. No generic chi-square calibration, deviance-residual law, or goodness-of-fit conclusion is asserted.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Explicit exponential-family response contracts
Definition
Fix a finite integer and a dispersion value . For each , let carry its Borel sigma algebra and let be a sigma-finite positive measure on it. Let be an open interval, let be twice continuously differentiable, let , and let be measurable. An explicit one-parameter exponential-family response contract supplies, for each , a density or mass function relative to ,
The contract requires , for every , and a fixed support such that on and off , up to a -null set independent of . When the mean and variance identities are used, it also requires a finite second moment and locally uniform integrable envelopes for the first and second derivatives of on .
For a vector , the product sampling law is the finite product , where has density relative to . The coordinate responses are independent in the sense of Independent random elements. Their product base measure is on . The next lemma verifies that the joint density is .
The design or conditioning convention, observation units, and response/index roles are part of the surrounding scientific model contract. A sampling-law specification is not evidence that the scientific model is empirically adequate.
Every scientific application also records a Scientific statistical model contracts: it names the observation space and record, scientific and analysis units, index meanings, response and predictor maps, target, observation mechanism, support, law, conditioning, and adequacy assumptions. The contract does not itself imply independence or common support; those are explicit hypotheses of this response-family definition. Here is only a component index until the application assigns it a scientific unit or time meaning.
The product response law has the product density
Statement
In the setup of Explicit exponential-family response contracts, let and . Then the joint sampling law has density
relative to . At any for which every factor is positive, the log likelihood is .
Facts & Assumptions
Given: The finite collection of sigma-finite component spaces, normalized densities, fixed supports, and product sampling law in Explicit exponential-family response contracts.
Explicit exponential-family response contracts: each is a nonnegative measurable probability density relative to , and the joint sampling law is the finite product of the component laws.
The product sigma-algebra and its finite iterates: the finite product sigma algebra is generated recursively by measurable rectangles.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: for sigma-finite factors, the product measure is a measure and satisfies .
Arithmetic and lattice operations preserve measurability whenever they are defined: finite pointwise products of measurable real-valued functions are measurable.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for nonnegative product-measurable functions on sigma-finite product spaces, the integral equals either iterated integral.
The measure with density relative to : if is nonnegative measurable, is the measure .
Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: measures agreeing on a generating pi-system and on an increasing finite-measure exhaustion from that pi-system are equal.
Proof
For each coordinate projection , the preimage of a measurable set is a measurable rectangle, so is product-measurable by [F2]. Their finite product is product-measurable by [F4].
Construct and by repeated finite products using [F3]. Repeated Tonelli [F5], applied to the nonnegative factors, gives for every measurable rectangle. Taking the rectangle to be the whole product and using normalization from [F1] gives .
By [F6], is a probability measure, and step 2.1 shows that and agree on the rectangle pi-system. That system contains the whole product, which is a one-set increasing finite-measure exhaustion for both probability measures, so [F2] and [F7] give . Whenever every factor is positive, taking the logarithm of the product gives the stated sum.
Mean and variance from the cumulant function
Statement
Fix and in Explicit exponential-family response contracts, and write . Under its fixed-support, twice differentiable density, local integrable derivative-envelope, and finite-second-moment hypotheses,
Facts & Assumptions
Given: The normalized density on the open interval , its fixed support, locally uniform integrable envelopes for its first two parameter derivatives, and .
Explicit exponential-family response contracts: is normalized for every on a fixed support, with and the stated derivative envelopes.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a function is continuous on a closed interval and differentiable in its interior, an endpoint difference equals its derivative at an interior point times the interval length.
Dominated convergence: almost-everywhere convergence under one integrable majorant permits passing the limit through the integral.
The Lebesgue integral is linear on : the integral is linear on integrable functions.
Expectation of a nonnegative or integrable random variable: the expectation of an integrable real random variable is its finite signed integral.
Integrating against a density agrees with integrating the product: if , then for nonnegative measurable , ; the signed identity follows by positive and negative parts once absolute integrability is verified.
Integrable real and complex functions, and their integrals: a real measurable function is integrable exactly when the integral of its absolute value is finite.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous for nonnegative scalars.
Moments, variance, and covariance on a probability space: for a square-integrable real random variable, variance is the expectation of its centered square.
Proof
Differentiating the displayed density pointwise on its fixed support gives and . Off the fixed support the density vanishes outside a fixed -null exception for every , so these derivative identities hold -almost everywhere on the whole response space.
For any sequence of nonzero with , the difference quotients converge pointwise almost everywhere to . The mean value theorem [F2] bounds their absolute values by the local first-derivative envelope, so [F3] passes the limit through the integral. Each quotient has integral by normalization and [F4]; hence . Since , monotonicity and homogeneity [F8], normalization, linearity [F4], and the density identity [F6] give . Thus is integrable by [F7], so its positive and negative parts are integrable. Applying [F6] to those two parts and subtracting by [F4] and [F5] identifies . Substituting step 1.1 into , and using normalization [F1] and linearity [F4], gives .
Apply the same sequential difference-quotient argument to , now using the local second-derivative envelope, to get . Substituting step 1.1 gives . By [F6] this is ; by step 2.1, , so [F9] identifies the centered second moment with the variance.
Generalized linear model with explicit conditioning
Definition
Fix , , a finite design matrix with rows , a dispersion value , and an open parameter domain . A generalized linear model (GLM) on this design consists of the response family in Explicit exponential-family response contracts, a differentiable one-to-one link on a specified mean domain , and a specified map satisfying . For , put
and require and for every . The canonical link is the choice , equivalently . When and the component scales are common, write ; this common-scale restriction is part of every formula that uses .
The joint sampling density is the product density from The product response law has the product density. For an observed with for every , define its log likelihood by
For a differentiable log likelihood, the score is . When its entries have finite second moments, the expected score outer-product information is . This page treats as fixed or conditions on its realized value; it supplies no random-design asymptotic conclusion.
Canonical-link score and Hessian
Statement
Let follow Generalized linear model with explicit conditioning with a common scale , canonical link , and twice differentiable . For an observed with for every ,
Facts & Assumptions
Given: A finite fixed design , an admissible , the common-scale canonical-link GLM, and an observed response vector whose component densities are positive at the corresponding canonical parameters.
Generalized linear model with explicit conditioning: , the canonical link is , and the common-scale log likelihood is the finite sum of component log densities.
The product response law has the product density: the joint density is the product of component densities, so wherever all factors are positive its log likelihood is their sum.
Generalized linear model with explicit conditioning: for the canonical link, and .
The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with : for differentiable scalar functions, under the stated limit-point hypotheses.
Matrix differentials obey the sum rule, product rule, and adjoint rule: in the real Frechet sense, and .
Proof
By [F1] and [F2], , where is independent of . For each coordinate , the chain rule [F4] gives . By [F3], , so these entries assemble as .
Differentiating the coordinate expression in step 1.1 with respect to gives by [F4]. The sum and matrix-product rules [F5] identify these entries with .
General-link score and Fisher information
Statement
Consider Generalized linear model with explicit conditioning at an admissible finite with common scale . Assume each is differentiable, each is differentiable with , , the component scores have finite second moments, and the common-support, differentiability, and local integrable derivative-envelope conditions from Explicit exponential-family response contracts hold. Put
For every observed with for each , the score and expected score outer-product information are
In particular, if has full column rank, then is positive definite.
Facts & Assumptions
Given: The finite independent-response GLM, common scale, differentiable link and component natural-parameter maps, an observed response vector with positive component densities, fixed common support, local derivative envelopes, and finite second moments in the Statement.
Generalized linear model with explicit conditioning: , , the score is the gradient of the product log likelihood, and when finite.
Explicit exponential-family response contracts: the component responses are independent, have the displayed common-support response densities, and use the stated product sampling law.
Mean and variance from the cumulant function: and under the common-scale restriction.
The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with : differentiating a composition multiplies the outer and inner derivatives under its stated hypotheses.
Expectations factor over finite products of independent random variables: for independent real random variables, expectations of products of integrable measurable coordinate functions factor.
Proof
Differentiate with respect to . The chain rule [F4] gives , so . Differentiating the component log density therefore gives the scalar score . Since , the full score is .
By [F3], and . These second moments are finite by the hypotheses, and makes each integrable. For , independence and [F5] give . Expanding now leaves only . If and has full column rank, then and because each , proving positive definiteness.
Likelihood deviance for nested models on common support
Definition
Fix an observed response vector for which the component densities are positive throughout both models' parameter sets, and two stated GLMs with the same response family, base support, and log-likelihood function . They are nested here only when a stated embedding identifies the fitted parameter set with a subset of the saturated reference parameter set. Require both sets to be nonempty and both suprema to be finite real numbers. The likelihood deviance is
The definition makes no claim about deviance residuals, goodness-of-fit diagnostics, or a reference distribution. The two full-text GLM notes cited above support likelihood setup but do not supply a deviance-diagnostics treatment; the nonnegativity result below is proved only from the stated set inclusion.
Strict concavity and uniqueness of a finite stationary maximizer
Statement
Suppose the canonical-link GLM has an open convex parameter domain , full-column-rank design , common scale , and at every predictor vector in . For a fixed response vector whose component densities are positive throughout , is strictly concave on . It has at most one stationary point; if a stationary point exists, it is the unique global maximizer. This conclusion does not assert that a finite maximizer exists.
Facts & Assumptions
Given: The canonical-link GLM hypotheses in the Statement and a fixed response vector whose log likelihood is defined throughout .
Canonical-link score and Hessian: the Hessian is .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a function is continuous on a closed interval and differentiable in its interior, its endpoint difference is its derivative at an interior point times the interval length.
Proof
Fix distinct , put , and define for . Convexity keeps this segment in . By [F1], , because by full column rank and every displayed is positive. The mean value theorem [F2] applied to makes strictly decreasing. For any , another application of [F2] gives for some and for some ; strict decrease gives the first secant slope larger than the second, which rearranges to . Thus every nonconstant segment is strictly concave.
Two distinct stationary points would give on their connecting segment, contradicting strict decrease. If is stationary and , then and strict decrease gives for ; [F2] applied to yields for some . Thus any stationary point is the unique global maximizer when it exists.
One minimum-norm IRLS step
Definition
Inputs are an observed response vector with for every , a finite design matrix , an admissible finite current parameter , and a GLM with common scale . Require each to be finite and nonzero and each to be finite and positive.
- Compute and .
- Compute the working response and positive weight
- Form using Square roots exist: a unique with ; the positives are , and put , . By The Moore--Penrose pseudoinverse as the solution of the four Penrose equations and Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse, form . Return , the unique minimum-Euclidean-norm member of the nonempty weighted least-squares minimizer set by For every right-hand side , is the unique least-squares solution of minimum Euclidean norm.
The Moore--Penrose convention makes the procedure single-valued even when is rank deficient; the underlying least-squares minimizer need not then be unique. Existence and the minimum-norm property follow from Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse and For every right-hand side , is the unique least-squares solution of minimum Euclidean norm. The output need not lie in , and this definition makes no claim that repeated updates terminate or converge to a maximizer.
The minimum-norm IRLS step is well-defined for every design rank
Statement
For every input satisfying the Definition of One minimum-norm IRLS step, every intermediate quantity in its three instructions is uniquely determined and finite. Its output is the unique minimum-Euclidean-norm member of the nonempty set This holds for every rank of , including . The weighted normal matrix is positive semidefinite and has kernel ; its singularity does not obstruct this output. No assertion that the output lies in the model parameter domain, or that repeated updates converge, is made.
Facts & Assumptions
The algorithm specifies a finite real response vector and design, an admissible finite current parameter, a positive common scale, finite nonzero , finite positive , and the formulas for and the return value. One minimum-norm IRLS step
In the GLM, is in the inverse link's domain; that inverse gives the unique real , and the specified maps determine the component natural parameters. Generalized linear model with explicit conditioning
Every nonnegative real number has a unique nonnegative square root. Square roots exist: a unique with ; the positives are
Every finite real matrix has a unique Moore–Penrose pseudoinverse satisfying the four Penrose equations. The Moore--Penrose pseudoinverse as the solution of the four Penrose equations, Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse
For a finite real matrix and every finite real target vector , the vector is a least-squares minimizer and is the unique such minimizer of minimum Euclidean norm. For every right-hand side , is the unique least-squares solution of minimum Euclidean norm
Proof
Given: Any input satisfying the algorithm's Definition.
Each predictor is a finite sum of products of real design and parameter entries, and each mean is a unique finite real value by [F2]. The observed response coordinates are finite real numbers by [F1]. Thus is finite and uniquely determined because its denominator is nonzero. Likewise is finite and strictly positive: its numerator is positive and its denominator is a finite positive real number. These operations refer to real arithmetic, with no floating-point overflow assertion.
By [F3] each has one finite positive square root. Consequently the diagonal matrix , the weighted design , and the target are unique finite real matrices or vectors with the specified dimensions. By [F4] the matrix exists uniquely for every rank of , so the returned exists uniquely in . No inverse of was required at this stage.
For every , the diagonal construction gives . Since a nonnegative real number and its square have the same minimizing arguments, [F5] makes a member of the displayed weighted least-squares minimizer set and the unique member of minimum Euclidean norm. In particular that set is nonempty even when is rank deficient. The minimum-norm property is the conclusion of the supplied theorem, not an extra condition imposed on the algorithm's inputs.
The weighted normal matrix is symmetric, and for every one has , so is positive semidefinite. If , then . Conversely, if , the displayed sum is zero, and its finitely many nonnegative terms with strictly positive force every ; hence . This proves . Steps 2.1–3.1 apply equally when this kernel is nontrivial.
If , then . The zero matrix satisfies the Penrose equations, so uniqueness in [F4] gives and the algorithm returns . The weighted objective is then constant in , so every vector is a minimizer and is its unique minimum-norm member, consistent with step 3.1. A single response, zero observed responses, and other ranks use the same proof whenever the original admissibility conditions hold. Thus all stated well-definedness claims hold without an invertibility condition or a condition that the returned vector remain in the model domain.
Source notes
This is the explicit well-definedness discharge for the local algorithm. The proof uses the complete locally proved square-root, pseudoinverse-existence, and minimum-norm least-squares suppliers named above. The weighted objective is checked directly, and no Fisher-scoring equivalence or convergence theorem is assumed to prove existence of the procedure's output.
Nested-model deviance is nonnegative
Statement
For the deviance in Likelihood deviance for nested models on common support, .
Facts & Assumptions
Given: Nonempty nested parameter sets , a common log likelihood , and finite real suprema.
Proof
Every value with is also among the values over by [F1]. Therefore .
The suprema are finite real numbers by the definition's hypotheses, so their ordered difference is nonnegative; multiplying by gives .
IRLS equals the Fisher-scoring step when information is invertible
Statement
Under the admissibility hypotheses of One minimum-norm IRLS step, assume also that each map is differentiable, each map is differentiable with finite nonzero derivative , and . Each response has finite second moment, its density has the fixed common support and locally uniform integrable envelopes for its first and second derivatives required by Explicit exponential-family response contracts, and each component score has finite second moment. If is invertible, let and be the score and expected score outer-product information from General-link score and Fisher information. Then the weighted least-squares output satisfies
Facts & Assumptions
Given: The algorithm's finite admissible current , common scale, finite nonzero link derivative, and finite positive variance values; the differentiable natural-parameter map; finite component response second moments; fixed common support and locally integrable first- and second-derivative envelopes; finite component score second moments; and invertible .
One minimum-norm IRLS step: , , and minimizes .
For a linear map between finite-dimensional inner-product spaces, minimises if and only if , equivalently ; minimisers exist and any two differ by an element of : a minimizer of satisfies ; minimizers exist and differ by .
Proof
For every , [F2] gives . Since , multiplying by and using [F1] yields .
Apply [F3] to the weighted least-squares map and target . Its normal equation is , so by step 1.1. The assumed invertibility of now gives .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 16–21
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, PDF pp. 1–4
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 16–21, 30–32
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, PDF pp. 1–5
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 16–22
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 23–33, 40–52
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 23–33, 40–42
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, PDF pp. 4–5
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 43–48
- MIT 18.650 Statistics for Applications, Lecture 10: GLM likelihood background only; no deviance-diagnostic claim is taken from this source
- CMU Advanced Methods for Data Analysis, GLM likelihood background only; no deviance-diagnostic claim is taken from this source
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 32–33, 40–42
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 43–52
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, PDF p. 5
- Stanford CS205L, Unit 11: Zero Singular Values, Moore–Penrose least-squares selection
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, Fisher scoring and weighted least squares
- MIT 18.650 Statistics for Applications, Lecture 10: GLM likelihood background; the inequality is proved locally
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 47–52