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.
Mixed effects and longitudinal models
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Expectation
- 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
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- 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
- Fixed-design regression, estimability, and Gauss–Markov
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- 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
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- 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
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- 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
- Partitions of Unity and Paracompactness
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- 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
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- 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 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 Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
Objective
Develop the finite-dimensional linear mixed model and its longitudinal interpretation with explicit subject, visit, and observation-pattern roles. The general covariance identity uses only finite second moments and independence. Separate results add known-covariance GLS, a Gaussian conditional-law branch, moment-only BLUP, error-contrast REML, and a precise covariance-map criterion for Gaussian variance-component identifiability.
Scope
The Gaussian branch explicitly carries the Axiom of Choice required by the current multivariate-normal supplier. Local results prove the Gaussian law of an error contrast and supply the nondegenerate Gaussian density formula. The conditional formula allows singular latent covariance but requires positive-definite marginal observation covariance. The known-covariance GLS and BLUP results are moment-only; plug-in variance-component estimates do not inherit their exact covariance guarantees. An observation pattern is modeled separately from the complete-data response law: the mixed-model covariance equations imply no missingness or ignorability assumption. Error contrasts use columns of a matrix so is defined and annihilates the fixed design; a basis change multiplies the likelihood by a parameter-independent factor.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks
Statement
Assume AC. Let be a jointly multivariate-normal vector with mean and covariance where and are allowed to be singular positive-semidefinite matrices. Then the random vectors and are independent.
Facts & Assumptions
Given: AC and a finite-dimensional jointly Gaussian vector with the block covariance in the Statement.
A multivariate-normal law with positive-semidefinite covariance exists, may be realized as its mean plus the covariance square root times independent standard-normal coordinates, and allows singular covariance. Multivariate normal law, including singular covariance.
The nonnegative square root of a finite-dimensional nonnegative operator exists and is unique. A non-negative operator has a unique non-negative square root.
Disjoint groups of an independent sigma-algebra family remain independent. Disjoint groups of an independent sigma-algebra family remain independent.
Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence.
The multivariate-normal characteristic function uniquely determines its law, including for singular covariance. Characteristic function of a multivariate normal law.
AC holds for the multivariate-normal construction. The Axiom of Choice.
Proof
Given: The hypotheses in the Statement.
Let and be the nonnegative square roots from [F2]. The block matrix is nonnegative and satisfies , so uniqueness in [F2] makes the nonnegative square root of the joint covariance. This argument also applies when either block is singular.
By [A1] and [F1], the joint law is the law of for a vector with independent standard-normal coordinates. Partition those coordinates into vectors of the matching dimensions. Their sigma-algebras are independent by [F3], and the separate affine maps and remain independent by [F4]. Hence the coordinate blocks of the constructed vector are independent.
Any jointly multivariate-normal vector with the stated mean and covariance has this constructed law by the uniqueness clause of [F5]. Independence is a property of the joint law, so and are independent.
Remarks
No inverse of or is used. Positive definiteness of the full covariance is not required for this independence result.
A positive-definite multivariate normal law has its Gaussian density
Statement
Assume AC. Let , , and let be a real symmetric positive-definite matrix. If , then its law has Lebesgue density
Facts & Assumptions
Given: AC, a finite dimension , a mean vector , and a positive-definite covariance matrix .
The standard normal law has density , and the multivariate-normal construction permits singular covariance. Standard normal and normal laws, Multivariate normal law, including singular covariance.
Finite independent random elements have product joint law. Independent random elements have product joint law.
In finite Euclidean dimension, product Lebesgue measure agrees with Euclidean Lebesgue measure on Borel sets; nonnegative product integrals obey Tonelli. On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.
Under countable choice, a diffeomorphism satisfies the change-of-variables formula for every nonnegative Lebesgue-measurable integrand; continuous maps have Borel preimages of Borel sets. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, A continuous map has Borel preimages of Borel sets.
Positive-definite has a Cholesky factorization with lower triangular and positive diagonal. A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique.
Characteristic functions of finite independent sums and affine images follow the stated product and affine rules. Characteristic functions under affine maps and independent sums.
Scalar normal characteristic functions determine their laws. Characteristic function of a normal law, Uniqueness of a law from its characteristic function.
A multivariate-normal law is specified by its scalar projection laws and is uniquely determined by its multivariate characteristic function. Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law.
The determinant is multiplicative, invariant under transpose, and equals the product of diagonal entries for triangular matrices. For same-sized finite square matrices over a commutative ring, , For every square matrix over a commutative ring, , The determinant of a triangular matrix is the product of its diagonal entries.
AC holds; the cited bridge supplies countable and dependent choice (CC and DC), as defined by The Axiom of Countable Choice () and The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, for the Gaussian construction and linear change-of-variables theorem. The Axiom of Choice, AC supplies countable selections and prescribed serial paths.
Proof
Given: The hypotheses in the Statement.
By [A1], take independent standard-normal coordinates . Their joint law is the product of the coordinate laws by [F2]. Thus, using [F1] and [F3], the vector has Lebesgue density
Let be the factorization from [F5]. For any , the scalar is a finite linear combination of the independent standard normals. By [F6] its characteristic function is so [F7] gives . Therefore has all the projection laws defining , and [F8] identifies its law with that of .
Let . It is a diffeomorphism with Jacobian determinant . For any Borel set , define the nonnegative Borel function . By [F4] and the countable choice supplied by [A1], Thus the density in step 2.1 is . The determinant is positive because is triangular with positive diagonal.
Since by [F9], and , substituting the expression for from step 1.1 into step 3.1 gives exactly .
Remarks
Positive definiteness is essential for this Lebesgue-density formula. Singular Gaussian laws remain defined, but are supported on lower-dimensional affine subspaces and are not covered by this theorem.
Error-contrast matrix for a full-rank fixed design
Definition
Let have full column rank, with , and let denote the orthogonal complement of its column space in Euclidean (The orthogonal complement ). An error-contrast matrix for is a matrix whose columns form a basis of . Thus has full column rank and , so is an -dimensional vector of linear contrasts that annihilate . Such a matrix exists by A full-rank error-contrast matrix exists when n exceeds p ↗.
This column-basis convention makes the product dimensionally defined. The Gaussian restricted-likelihood definition below fixes one such independently of the covariance parameter.
Remarks
The condition is needed for a nonzero error-contrast space. When , the orthogonal complement has dimension zero and this page makes no variance-likelihood claim from contrasts.
Generalized least-squares estimator for known covariance
Definition
Let have full column rank in a fixed-design first-moment regression model, so under each law (Fixed-design linear regression model). Suppose the same known symmetric positive-definite matrix is the covariance of under every . Put This is a statistic and estimator of the identity target under Statistics and estimators and Estimands on a statistical model: for fixed and , the displayed expression is a linear, hence Borel-measurable, function of the response. The positive definiteness of and existence of its inverse are established by The GLS information matrix is positive definite ↗.
This definition uses the true covariance as known. Replacing by an estimate defines a plug-in procedure; the theorem below does not assign that procedure the same exact covariance or BLUE guarantee.
Remarks
The marginal-covariance lemma later identifies for the mixed model. The GLS definition itself applies to any fixed-design first-moment model with the stated common covariance.
Finite-dimensional linear mixed model with explicit longitudinal roles
Definition
Let and be finite integers. A finite-dimensional linear mixed model on one probability space consists of fixed matrices and , a fixed parameter , and square-integrable random vectors and such that where and are independent random elements. Here and are the resulting symmetric positive-semidefinite covariance matrices. The fixed-design convention for and the first-moment regression model is that of Fixed-design linear regression model. The explicit scientific record of units, quantities, observation mechanism, and adequacy assumptions is required by Scientific statistical model contracts.
For longitudinal data, let index subjects and let index the visits scheduled for subject . A row of , , and corresponds to one observed subject–visit pair ; the time is measured from a stated origin. Blocks of may represent subject-specific latent effects, while records the residual covariance across observed rows. If a visit pattern is fixed or conditioned on, the corresponding rows are selected from the scheduled vectors and matrices. If the pattern is random, its observation mechanism is specified separately; the displayed model does not assert that this mechanism is independent of the full outcomes or ignorable for likelihood inference.
The definition imposes no Gaussianity, no identical visit schedule, and no claim that a scientific application satisfies the proposed mean or covariance structure.
Remarks
The vector is a latent random effect in the stated probability model; this definition gives it no Bayesian interpretation. Singular and singular are allowed here. In later results, positive definiteness of the marginal covariance is an additional hypothesis when an inverse is used.
Gaussian branch of the linear mixed model
Definition
The Gaussian branch of Finite-dimensional linear mixed model with explicit longitudinal roles adds the following assumption: under the Axiom of Choice, the concatenated vector has the multivariate-normal law of Multivariate normal law, including singular covariance. Thus the full latent-effect and residual vector is jointly Gaussian. This is an additional branch; the moment-only definition and the covariance identity do not assume Gaussianity.
Remarks
This definition carries AC because the current multivariate-normal supplier does. Singular or is permitted by that supplier; any later inverse or density requires a separate positive-definiteness hypothesis.
Longitudinal observation patterns and missingness mechanisms
Definition
Let and let be the complete scheduled response vector for subjects and visits . Let the declared observed covariates take values in a measurable space . The finite set of observation patterns is ; means visit is observed. A missingness mechanism is a function such that, for every , , and, for each fixed , is measurable for . Thus is a probability mass function on , and its dependence on the full data state is the finite-output kernel specified by the observation-mechanism field in Scientific statistical model contracts, which requires a probability measure at each state and measurable state dependence. For a pattern , write for the subvector of at coordinates with .
The mechanism is missing completely at random (MCAR) if, for each pattern , does not depend on . It is missing at random (MAR) if, for each , it depends on the full response vector only through and . It is missing not at random (MNAR) relative to this partition if the MAR condition fails for at least one pattern on the declared support. Monotone dropout means that, within each subject, observed visits form an initial segment of the scheduled visits, possibly empty or complete.
These are properties of the declared observation kernel. A mixed-model mean or covariance equation does not specify the kernel or imply MCAR, MAR, or MNAR.
Remarks
For an LMM written on observed rows, determines which coordinates and design rows are retained. If depends on the full scheduled outcomes, the distribution of the selected rows conditional on that pattern need not equal the corresponding unselected marginal subvector law.
A full-rank error-contrast matrix exists when n exceeds p
Statement
For every full-column-rank with , there exists an error-contrast matrix as defined in Error-contrast matrix for a full-rank fixed design.
Facts & Assumptions
Given: has full column rank and .
For every subspace of finite-dimensional , . In finite dimension, and .
Full column rank means the columns of are linearly independent; a basis is an independent spanning set, and finite dimension is the size of a finite basis. Fixed-design linear regression model, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis.
An error-contrast matrix has full-column-rank columns forming . Error-contrast matrix for a full-rank fixed design.
The columns of are linearly independent.
Proof
Given: A full-column-rank with .
Set . By [A1] and [F2], the columns of form a basis of , so . Applying [F1] gives ; by [F2], this means has a basis with elements.
Since has dimension , [F2] gives a basis of . Put these vectors into the columns of . The columns are independent and span , so has full column rank.
Every column is orthogonal to each column of , hence . Thus and satisfies the error-contrast definition [F3]. This proves existence.
The GLS information matrix is positive definite
Statement
If has full column rank and is symmetric positive definite, then is symmetric positive definite. In particular it is invertible.
Facts & Assumptions
Given: The full-column-rank design and known positive-definite covariance in Generalized least-squares estimator for known covariance.
Every real symmetric positive-definite matrix has a Cholesky factorization with invertible. A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique.
has full column rank, and is symmetric positive definite.
Proof
Given: has full column rank and is positive definite.
By [A1] and [F1], write with invertible. Hence and is symmetric.
For any nonzero , full column rank gives , so . Therefore . The matrix is symmetric by step 1.1, proving positive definiteness and invertibility.
Marginal covariance of the linear mixed model
Statement
For the moment model of Finite-dimensional linear mixed model with explicit longitudinal roles, the marginal covariance is This identity uses only the stated means, covariances, and independence; it does not require Gaussianity.
Facts & Assumptions
Given: The finite-dimensional linear mixed model and its finite second moments.
, , , , and and are independent. Finite-dimensional linear mixed model with explicit longitudinal roles.
Covariance is bilinear in finite linear combinations of square-integrable real random variables. Covariance is symmetric and bilinear in finite linear combinations.
Measurable coordinate functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence.
Expectations of products of independent integrable real random variables factor. Expectations factor over finite products of independent random variables.
Expectation is linear on finite sums of integrable real random variables. The Lebesgue integral is linear on .
Proof
Given: A fixed , finite matrices , and random vectors satisfying [F1].
Since , linearity [F5] gives and .
By [F2], each covariance entry of is the sum of the entries from and and the two cross-covariance entries. The first two matrices are and by [F1] and finite matrix multiplication.
For each coordinate pair , [F3] gives independence and [F4] gives . Both means vanish by [F1], so every cross-covariance entry is zero. The remaining covariance matrix is therefore .
The REML error-contrast covariance is positive definite
Statement
Let have full column rank with , let be an error-contrast matrix for , and let be symmetric positive definite. Then is symmetric positive definite. No Gaussian assumption is needed for this matrix claim.
Facts & Assumptions
Given: is symmetric positive definite and has full column rank.
An error-contrast matrix has full column rank and columns spanning . Error-contrast matrix for a full-rank fixed design.
The matrix is symmetric positive definite.
Proof
Given: The full-rank design, its error-contrast matrix, and a symmetric positive-definite .
The matrix is symmetric because is symmetric.
Let be nonzero. By [F1], has full column rank, so . Therefore by positive definiteness of . Thus is positive definite.
Steps 1.1 and 1.2 prove symmetry and strict positivity of the quadratic form for every nonzero , which is exactly positive definiteness of .
A Gaussian error contrast has the induced multivariate-normal law
Statement
Assume AC and the Gaussian branch of the finite-dimensional mixed model. Let have full column rank with , let be an error-contrast matrix, and let . Then The contrast law does not depend on . The matrix may be singular; positive definiteness is a separate hypothesis when a density is needed.
Facts & Assumptions
Given: The centered Gaussian mixed model, AC, a full-rank fixed design, and an error-contrast matrix .
with centered , covariance matrices , and independent of . Finite-dimensional linear mixed model with explicit longitudinal roles.
Under AC, the concatenated vector has a multivariate-normal law. Gaussian branch of the linear mixed model.
The response covariance is . Marginal covariance of the linear mixed model.
An error-contrast matrix has shape and satisfies . Error-contrast matrix for a full-rank fixed design.
Every scalar linear projection of a multivariate-normal vector has the specified univariate normal law, including variance zero. Multivariate normal law, including singular covariance.
Expectation is linear on finite sums of integrable random variables. The Lebesgue integral is linear on .
Covariance is a centered second moment and is bilinear in finite linear combinations. Moments, variance, and covariance on a probability space, Covariance is symmetric and bilinear in finite linear combinations.
A fixed finite-dimensional linear map is continuous and Borel measurable, so its composition with a Borel random vector is a Borel random vector. Every Euclidean linear map has a unique matrix and satisfies for some , A continuous map has Borel preimages of Borel sets.
A univariate normal law has characteristic function . Characteristic function of a normal law.
The characteristic function of is . Characteristic function of a multivariate normal law.
The characteristic function of a multivariate-normal law uniquely determines its Borel probability law, including singular covariance. Characteristic function of a multivariate normal law.
AC holds. The Axiom of Choice.
Proof
Given: The hypotheses in the Statement.
By [F1], is centered. Linearity [F6] gives , and [F3] gives .
Fix . Since by [F4], , a scalar linear projection of the jointly Gaussian vector in [F2]; it is normal by [F5]. Its mean is zero by [F1] and [F6], and its variance is by step 1.1 and covariance bilinearity [F7].
By [F8], is a Borel random vector. For each , [F9] and step 2.1 give . This is the characteristic function of by [F10]; uniqueness [F11] gives the stated law. Its mean and covariance do not depend on , so neither does its law.
Conditional Gaussian law of random effects
Statement
Assume AC and the Gaussian branch of the finite-dimensional mixed model. Let be positive definite. With conditional expectation taken componentwise given , and conditional covariance defined entrywise by conditional expectations of centered products, one has The latent covariance may be singular.
Facts & Assumptions
Given: The Gaussian mixed model, AC, and .
, with centered independent and covariance matrices ; these are finite-second-moment covariances. Finite-dimensional linear mixed model with explicit longitudinal roles, Moments, variance, and covariance on a probability space.
The marginal covariance is . Marginal covariance of the linear mixed model.
Under AC, is jointly multivariate normal with covariance . Gaussian branch of the linear mixed model, Multivariate normal law, including singular covariance.
Jointly Gaussian coordinate blocks with zero cross-covariance are independent, including when either covariance is singular. Jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks.
Independence of random elements means independence of their generated sigma-algebras. Independent random elements.
A conditional-expectation version is characterized by its integrals on every event in the conditioning sigma-algebra. Conditional expectation given a sigma algebra.
Measurable functions of independent random elements remain independent, and integrable products of independent variables factor. Measurable coordinatewise functions preserve independence, Expectations factor over finite products of independent random variables.
Products of square-integrable variables are integrable by Cauchy–Schwarz. Cauchy-Schwarz inequality for .
Covariance is bilinear in finite linear combinations. Covariance is symmetric and bilinear in finite linear combinations.
Expectation is linear on finite sums of integrable random variables. The Lebesgue integral is linear on .
Finite-dimensional linear maps are continuous, and continuous maps between Euclidean spaces have Borel preimages of Borel sets. Every Euclidean linear map has a unique matrix and satisfies for some , A continuous map has Borel preimages of Borel sets.
AC holds, is symmetric positive definite, and all variables have the finite second moments stated in [F1]. The Axiom of Choice.
Proof
Given: The Gaussian branch with and AC.
Put . Linearity [F10] and [F1] give , so centering by this deterministic vector leaves covariance unchanged; [F2] gives . Coordinatewise independence of and gives by [F5] and [F7], so bilinearity [F9] gives . Since is invertible by [A1], set and . Bilinearity yields , and expectation linearity [F10] gives .
The vectors and are Borel random vectors by [F11]. For any coefficient vectors , the scalar is a linear combination of the coordinates of , so it is normal by the projection definition in [F3]. Thus is jointly multivariate normal. Its covariance is block diagonal by step 1.1, so [F4] implies that and are independent.
By step 2.1 and [F5], and generate independent sigma-algebras. For every event , [F7] applied to and gives . Since is square-integrable and -measurable, [F10] gives for every such event; [F6] identifies as a version of . Finally, , so the stated conditional-mean formula follows.
For each coordinate pair , is integrable by [F8]. As a measurable function of , it is independent of by [F7] and step 2.1. For every , factorization gives , so [F6] yields . Together with the conditional mean from step 3.1, step 1.1, and , the defined entrywise conditional covariance of is .
Expanding by [F9] and [F1]–[F2] yields Together with steps 3.1–4.1 this proves both formulas. No inverse of is used, so singular is allowed.
Gaussian variance-component identifiability is covariance-map injectivity
Statement
Assume AC. Let be a nonempty parameter set and let be a declared covariance-component parameterization of the Gaussian mixed model, with positive semidefinite for every . Consider the parametric family and the estimand . Then is identifiable if and only if the covariance map is injective on .
Facts & Assumptions
Given: The parameterized Gaussian model and target in the Statement.
An estimand is identifiable exactly when equal sampling laws force equal target values. Identifiability of an estimand.
Under AC, a multivariate-normal law is determined by its mean and covariance, including in singular cases. Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law.
Variance and covariance are moments of the sampling law, so equal laws with finite second moments have equal covariance matrices. Moments, variance, and covariance on a probability space.
AC holds, and every covariance parameter value in yields the stated Gaussian law. The Axiom of Choice.
Proof
Given: The Gaussian family and target .
Suppose is injective. If , equality of laws and [F3] give . Injectivity then gives , so the target values agree. By [F1], is identifiable.
Conversely, if the covariance map is not injective, choose with . For any fixed , the two Gaussian laws and are equal by [F2], while the target values are different. Thus is not identifiable by [F1].
Steps 1.1 and 1.2 prove both implications.
Restricted maximum likelihood from error contrasts
Definition
Assume AC and a Gaussian family of the form in Gaussian branch of the linear mixed model, indexed by a nonempty parameter set . For each , let and be the latent and residual covariance matrices in Let the fixed design have full column rank with . Fix an error-contrast matrix as in Error-contrast matrix for a full-rank fixed design, independently of . By A Gaussian error contrast has the induced multivariate-normal law, the contrast vector has law and its law does not depend on the fixed-effect parameter . The local result The REML error-contrast covariance is positive definite shows that this covariance is positive definite, and A positive-definite multivariate normal law has its Gaussian density gives its Gaussian density. The restricted likelihood for this fixed contrast basis is This item defines the likelihood for a fixed, parameter-independent choice of contrast coordinates; it makes no claim about likelihood comparisons across different fixed-effect designs.
Remarks
The local column-basis convention is with columns spanning , so is defined. The restriction supplies a nonzero contrast space; when , this definition makes no variance-likelihood claim.
Known-covariance GLS is BLUE
Statement
Let the linear mixed model have fixed design of full column rank and known marginal covariance . Then is unbiased for , has covariance , and is BLUE: for every linear unbiased estimator and every , Only the fixed-design mean and covariance are used; Gaussianity is not assumed.
Facts & Assumptions
Given: The fixed-design mixed model, full-column-rank , known , and the estimator defined in Generalized least-squares estimator for known covariance.
The fixed-design mean is . Fixed-design linear regression model.
The marginal covariance in the moment model is . Marginal covariance of the linear mixed model.
A positive-definite has a Cholesky factorization with invertible. A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique.
In a full-rank fixed-design model with covariance for , OLS is unbiased and BLUE for every estimable contrast, without Gaussianity. Gauss–Markov theorem for estimable contrasts.
Covariance is bilinear in finite linear combinations. Covariance is symmetric and bilinear in finite linear combinations.
Expectation is linear on finite sums of integrable random variables. The Lebesgue integral is linear on .
Finite-dimensional linear maps are continuous and preserve Borel measurability of random vectors. Every Euclidean linear map has a unique matrix and satisfies for some , A continuous map has Borel preimages of Borel sets.
has full column rank, and is the same known symmetric positive-definite covariance under each .
Proof
Given: The hypotheses in the Statement.
Choose from [F3] and set and . The transformed response is Borel by [F7]. Linearity [F6] and [F1] give , and covariance bilinearity [F5] with [F2] gives . Since is invertible, has full column rank.
OLS on the transformed model is because . The transformed model meets every hypothesis of [F4], so this estimator is unbiased and each of its linear contrasts has minimum variance among linear unbiased contrasts.
Put and . Then , so linearity [F6] and [F1] give . By [F5] and [F2], Here is symmetric because is symmetric positive definite.
Let be any linear unbiased estimator. For each , is a linear unbiased estimator of in the transformed model of step 1.1. By [F4] and step 2.1 its variance is at least that of . This holds for every , so the covariance difference is positive semidefinite and GLS is BLUE.
Changing an error-contrast basis changes the REML likelihood by a constant
Statement
Let have full column rank with , and let be two error-contrast matrices for . For every covariance parameter in Restricted maximum likelihood from error contrasts, there is an invertible matrix , independent of , such that and for every response vector . Thus changing the fixed contrast basis multiplies the likelihood by a positive factor independent of the covariance parameter and leaves its maximizers unchanged.
Facts & Assumptions
Given: The full-rank fixed design, two error-contrast bases for the same design, and the Gaussian REML likelihoods defined from them.
An error-contrast matrix has columns forming a basis of . Error-contrast matrix for a full-rank fixed design.
For a fixed error-contrast matrix , the restricted likelihood is the Gaussian density with argument and covariance . Restricted maximum likelihood from error contrasts.
Determinants are multiplicative and invariant under transpose. For same-sized finite square matrices over a commutative ring, , For every square matrix over a commutative ring, .
For a linear map on a finite-dimensional space, dimension of kernel plus rank equals the dimension of the domain. Rank-nullity: .
A real square matrix is invertible exactly when its determinant is nonzero. A finite square real matrix is invertible if and only if its determinant is nonzero.
Proof
Given: and are fixed bases of the same -dimensional contrast space.
Each column of lies in the span of the columns of , so there is a matrix with . If , then ; the full column rank of gives . Thus is injective. By [F4], has full rank and is surjective, so it is invertible; [F5] gives .
Put and . Then and . Multiplication verifies , so the two Gaussian quadratic forms are equal. By [F3], .
Substitution into the two densities in [F2] leaves the exponential terms equal and changes the determinant prefactor by . The matrix depends only on the two fixed bases, not on , so this factor is positive and parameter-independent. Therefore the likelihood maximizers are the same.
Remarks
The numerical likelihood value depends on the chosen contrast coordinates, while the maximizing covariance parameters do not. The result does not compare different fixed-effect designs.
Known-covariance BLUP and its prediction-error covariance
Statement
In the moment-only linear mixed model, suppose has full column rank and the known marginal covariance is positive definite. Define Here best linear unbiased predictor (BLUP) means that is unbiased for for every fixed and its prediction-error covariance is minimal in positive-semidefinite order among all affine linear predictors with that same unbiasedness property. Then is a BLUP and No Gaussianity or Axiom of Choice is assumed. The covariance formula treats and as known; it does not cover the extra uncertainty from estimating variance components.
Facts & Assumptions
Given: The moment-only mixed model, full-column-rank , known , and the GLS estimator.
, with centered independent , covariance matrices , and finite second moments. Finite-dimensional linear mixed model with explicit longitudinal roles.
The marginal covariance is . Marginal covariance of the linear mixed model.
The best affine predictor has an intercept fixed by means and coefficients satisfying covariance normal equations; singular predictor covariance is allowed. Normal equations for best affine prediction.
The GLS estimator is , is unbiased, and has covariance . Generalized least-squares estimator for known covariance, Known-covariance GLS is BLUE.
Covariance is bilinear in finite linear combinations. Covariance is symmetric and bilinear in finite linear combinations.
Variance and covariance are defined by centered second moments. Moments, variance, and covariance on a probability space.
Measurable coordinate functions preserve independence, and integrable products of independent coordinates factor. Measurable coordinatewise functions preserve independence, Expectations factor over finite products of independent random variables.
Expectation is linear on finite sums of integrable random variables. The Lebesgue integral is linear on .
Finite-dimensional linear maps are continuous and preserve Borel measurability of random vectors. Every Euclidean linear map has a unique matrix and satisfies for some , A continuous map has Borel preimages of Borel sets.
has full column rank, the random vectors are square-integrable, is independent of , and the known covariance is positive definite.
Proof
Given: The hypotheses in the Statement.
Put . By [F1], each pair of coordinates is independent; since both are centered, factorization in [F7] gives . Bilinearity [F5] then gives , while [F2] gives . The affine predictor is a Borel random vector by [F9]. For fixed , apply [F3] coordinatewise to predict affinely from : the covariance normal equations have the unique solution because is invertible by [A1]. The intercept is by [F8] and [F1]. Thus is the best affine predictor when is treated as known.
Write and . Then and , because . By [F9], is Borel; by [F8] and [F1], for every . Every affine linear predictor unbiased for for every must have and .
Let and . By step 1.1, bilinearity gives and Also , so its covariance is by [F4], and its covariance with is zero because step 1.1 gives . Since the error covariance is which is the displayed matrix after substituting and .
Let be any other affine linear predictor unbiased for for every . By step 2.1 its intercept is zero and . Put , so and the competing prediction error is . Since , one has Therefore . Expanding the competing error covariance now gives This is exactly the stated BLUP criterion.
Remarks
If variance components are estimated and substituted into this expression, the result is an empirical BLUP (eBLUP). This theorem supplies no exact prediction-error covariance for that plug-in estimator.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Fan Li, STA610 Lecture 4: Maximum Likelihood Estimation and Inference for the Hierarchical Normal Model, PDF p. 3
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §2.4.3 and Appendix D
- Fan Li, STA610 Lecture 4: Maximum Likelihood Estimation and Inference for the Hierarchical Normal Model, PDF p. 2
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §2.4.2
- Fan Li, STA610 Lecture 4: Maximum Likelihood Estimation and Inference for the Hierarchical Normal Model, PDF pp. 4–5
- Fan Li, STA610 Lecture 2: Two Solutions—GLS and Cluster-Robust Standard Errors, PDF pp. 1–2
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §2.5.1
- Fan Li, STA610 Lecture 6: Linear Mixed-Effects Models, PDF pp. 4–5
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §§2.3.1–2.3.3
- Fan Li, STA610 Lecture 7: The Longitudinal Linear Mixed Model, PDF pp. 2–5
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §§2.3.3–2.4.2
- Fan Li, STA610 Lecture 7: The Longitudinal Linear Mixed Model, PDF pp. 16–18
- Fan Li, STA610 Lecture 1: The Problem of Correlated Data, PDF pp. 4–6
- Fan Li, STA610 Lecture 2: Two Solutions—GLS and Cluster-Robust Standard Errors, PDF p. 2
- Fan Li, STA610 Lecture 6: Linear Mixed-Effects Models, PDF pp. 8–9
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §2.4.1
- Fan Li, STA610 Lecture 6: Linear Mixed-Effects Models, PDF pp. 11–12
- Fan Li, STA610 Lecture 6: Linear Mixed-Effects Models, PDF pp. 10–11
- Fan Li, STA610 Lecture 5: Estimation of Group Effects, PDF pp. 8–10
- Duchateau, Janssen, and Rowlands, Linear Mixed Models, Chapter 2 §2.4.3