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.
Fixed-design regression, estimability, and Gauss–Markov
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- 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
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Objective
This page develops least squares for a fixed matrix and response vector . “Fixed design” means the results condition on ; it does not specify how a scientific study selected that design or prove that the regression mean is adequate for an application.
Scope
For an arbitrary design rank, the least-squares coefficient set is nonempty and is a translate of , while the fitted vector and residual are unique. A contrast is linearly estimable exactly when , equivalently when it has a linear unbiased representative under the first-moment model .
Under full column rank, OLS has formula . If additionally with , OLS is unbiased with covariance and is BLUE for every estimable contrast. These conclusions use only first and second moments; they do not require Gaussian errors.
The page records the model-side fields of Scientific statistical model contracts at an abstract level; it is not a complete scientific model contract for an application because no target population or scientific units are specified. One analysis record is ; row index is a response slot; and are fixed; and is observed under . No scientific, sampling, or assignment unit, time origin, or target population is specified; no enrollment process is modeled, so its status is not applicable here; no latent observation mechanism or randomized design is modeled. The law is on Borel for the standard Euclidean metric topology, without an additional support assumption. Expectations and covariances are under with fixed. The mean equation is a model premise that is empirically assessable in an application; no data or validation is supplied here, and no scientific adequacy is claimed.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Fixed-design linear regression model
Definition
Let be integers and let be a fixed matrix. A fixed-design first-moment linear regression model is a parametric statistical experiment on with parameter set , laws , and observed vector , such that every coordinate of is integrable under and Here is the Borel sigma-algebra, and expectation is taken under the particular law . The residual vector therefore has coordinatewise mean zero. The phrase fixed design means that is held constant in this experiment; it carries no probability law or assignment mechanism for .
This definition states only the first-moment model. It imposes no covariance, independence, or Gaussian assumption. Such assumptions must be stated where used.
Remarks
Residual mean. For each fixed and coordinate , put . Both and the constant are integrable under the probability law , and the constant has expectation . By Linearity, monotonicity, and the modulus bound for expectation, Thus the residual-mean conclusion in the Definition uses expectation linearity coordinatewise under each law; it adds no covariance or distributional assumption.
This is an abstract mathematical regression model, not a complete scientific model contract for an application. The Definition of Scientific statistical model contracts requires a field record for a specified analysis, including its target population; this pair has no specified application or target population. The following notes record the model-side fields that can be stated at this abstract level.
-
Borel convention. is generated by the metric topology of the standard Euclidean metric : is a metric by as the set of functions , and , , are metrics on it, and its metric-open sets form a topology by The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, and Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison. Thus this is the Borel sigma-algebra specified by The Borel sigma-algebra of a topological space.
-
Record, units, and indices. One observed data object is the vector on the Borel space . The analysis unit is this vector; coordinate is an abstract response slot, not a specified biological, physical, sampling, or assignment unit. No enrollment process is modeled, so enrollment status is not applicable; this says nothing about enrollment in a later application. There is no time index, and distinct coordinates need not be independent or distinct scientific units.
-
Fixed, random, and observed quantities. is fixed; is a fixed parameter indexing ; is random under that law and observed as ; is its random residual. No latent quantity or randomized assignment is specified.
-
Target, mechanism, law, and conditioning. indexes the formal parameter. For a contrast , is a formal model estimand; no target population is specified. The law is directly on , with no separate mechanism from a fuller scientific state and no additional support, density, or common-support assumption. All moments are under with fixed; there is no averaging over a random design.
-
Adequacy. In a specified application, the mean relation is empirically assessable: data or validation can challenge it but cannot prove it. This pair supplies no application data and does not assert adequacy. Additional moment, covariance, independence, or Gaussian conditions are theorem-specific mathematical hypotheses, not part of this first-moment model.
The scientific application, including its target population and substantive adequacy evidence, remains unspecified.
Linear statistics on Euclidean data are Borel-measurable
Statement
Let and . The linear map is measurable from the Euclidean Borel space to the Borel space .
Facts & Assumptions
Given: An integer , a vector , and the standard Euclidean metrics and their Borel sigma-algebras on and .
Every linear map , with , is bounded: for some , for every . Linearity means preservation of linear combinations by A linear map in Euclidean coordinates, and the bound is Every Euclidean linear map has a unique matrix and satisfies for some .
On for , the norm from the Euclidean inner product agrees with . The inner product is bilinear, and consists of functions on with pointwise vector operations. The Euclidean inner product on , as the set of functions , and , , are metrics on it.
For every , is a metric on by as the set of functions , and , , are metrics on it. For any metric space, its metric-open sets form a topology: the empty set and the whole space are open by The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, and arbitrary unions and finite intersections are open by Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed. The balls used below are as defined by Open ball, closed ball and sphere in a metric space. Thus the metric topology gives a topological space by Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, and its Borel sigma-algebra is generated by those open sets by The Borel sigma-algebra of a topological space.
A map of topological spaces is continuous when, for each point and each open target neighborhood of its image, it maps some open source neighborhood of the point into that target neighborhood. Continuity of a map of topological spaces at a point and globally.
A continuous map between topological spaces has Borel preimages of Borel sets. A continuous map has Borel preimages of Borel sets.
A map between measurable spaces is measurable when the preimage of every measurable target set is measurable in the source. A measurable function between measurable spaces.
Proof
Define by . By [F2], is a bijection with inverse , and preserves linear combinations. The one-coordinate metric formula gives . Thus the usual scalar distance inherits the metric axioms from on . By [F3], both this scalar metric and the source metric give the required topologies and Borel sigma-algebras.
Put . Since , bilinearity in [F2] and step 1.1 show that preserves linear combinations. By [F1], choose with for every . Hence for all .
Let and let be open in the scalar target topology with . By [F3], choose with . Put , where is from step 2.1. If , then step 2.1 gives . Thus . The source ball is open by [F3], so [F4] shows that is continuous between the topological spaces established in step 1.1.
By [F5], every Borel subset of the target has a Borel preimage in the source; [F6] therefore makes measurable.
Least-squares solution set
Definition
For integers , a matrix , and a response vector , define the least-squares solution set This is a set-valued definition; it does not select one coefficient vector. The next theorem proves that the set is nonempty and identifies the fitted vector and residual as unique, including when is rank-deficient.
Linearly estimable contrasts in fixed-design regression
Definition
In a fixed-design first-moment regression model with parameter , a linear contrast is the estimand The contrast is linearly estimable if there is a fixed vector such that the statistic is unbiased for at every parameter value: The vector may depend on the fixed design and on , but not on the observed response or on the unknown parameter. The map is a measurable statistic by Linear statistics on Euclidean data are Borel-measurable and Statistics and estimators.
Least-squares fitted vectors and residuals are unique
Statement
Let , , , and . For the least-squares solution set of Least-squares solution set, the following hold:
- is nonempty, and is in it exactly when .
- If , then .
- Every least-squares solution has the same fitted vector and residual .
- The direction space of the affine solution set has dimension .
The theorem makes no statistical moment or distributional assumption.
Facts & Assumptions
Given: Integers , a real matrix , and . Put , , and .
The least-squares solution set is ; it is set-valued until uniqueness is proved. Least-squares solution set.
For a finite-dimensional linear map and target , minimizers of exist, are characterized by , and form . 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 .
The Euclidean inner product on is the dot product . The Euclidean inner product on .
In standard real coordinate bases, the adjoint matrix of a linear map is its transpose. In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix.
The orthogonal projection is the -component of and . The orthogonal projection is the -component in .
is the unique point of nearest to . The orthogonal projection is the unique nearest point in the subspace.
For a linear map with finite-dimensional domain, . Rank-nullity: .
Squaring is strictly increasing on nonnegative reals: if and only if for . Squaring is monotone on the nonnegatives.
The standard coordinate vectors form a basis of , so . The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension .
The matrix rank of equals the rank of , which is . The rank of a matrix equals the rank of the linear map .
Proof
Regard as the linear map , , with the Euclidean inner products of [F3]. Every residual norm is nonnegative, and [F8] says squaring is strictly increasing on the nonnegative reals. Therefore the minimizers of are exactly the minimizers of . Applying [F2] and identifying by [F4] gives a minimizer, the normal equation , and the full solution set .
The image of is . Every minimizer maps to a point of nearest to , and every point of has a preimage under . By [F5] and [F6] that nearest point is exactly and is unique. Thus every minimizing has fitted vector , and its residual is the unique vector .
By step 1.1 the solution set is the translate , whose direction space is . By rank-nullity [F7] and from [F9], . Fact [F10] identifies , giving the claimed direction-space dimension.
Linear estimability is equivalent to row-space membership
Statement
In a fixed-design first-moment regression model with , a contrast is linearly estimable if and only if equivalently if and only if there exists with . Whenever this holds, is unbiased for for every . Here is defined as the image of the transpose map.
Facts & Assumptions
Given: A fixed-design first-moment regression model with parameter , a contrast vector , and a fixed vector when one is supplied.
The response has finite coordinate means and for every . Fixed-design linear regression model.
The contrast is linearly estimable exactly when a fixed measurable statistic is unbiased for it at every . Linearly estimable contrasts in fixed-design regression.
Expectation is linear on finite linear combinations of integrable random variables. Linearity, monotonicity, and the modulus bound for expectation.
The standard coordinate vectors form a basis of . The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension .
Proof
For any fixed , each coordinate of is integrable by [F1], so the finite linear combination is integrable. Linearity [F3] gives
If , step 1.1 gives for every . By [F2] the contrast is linearly estimable. The equation says exactly that .
Conversely, suppose is linearly estimable. By [F2] there is a fixed for which the expectation in step 1.1 equals for every . Thus for every ; taking for each standard coordinate vector in [F4] shows coordinatewise that . Hence belongs to the row space.
Steps 2.1 and 2.2 prove both implications, and step 1.1 proves the stated unbiasedness for every representative with .
Full-rank OLS is unbiased with its classical covariance
Statement
Let have full column rank (its columns are linearly independent) in a fixed-design first-moment regression model. Suppose for some the error vector has finite second moments, , and for every , where the vector covariance matrix has entries . Then the unique least-squares estimator is it is unbiased for , and its covariance matrix is No Gaussian assumption is made.
Facts & Assumptions
Given: Integers , a fixed-design first-moment regression model, full-column-rank , and the finite second-moment assumptions in the Statement.
The fixed design has response mean . Fixed-design linear regression model.
Least-squares minimizers satisfy ; when the minimizer is unique. Least-squares fitted vectors and residuals are unique.
For the endomorphism of , rank-nullity gives . Rank-nullity: .
Expectation is linear on finite sums of integrable random variables. Linearity, monotonicity, and the modulus bound for expectation.
Covariance is bilinear in finite linear combinations of square-integrable random variables. Covariance is symmetric and bilinear in finite linear combinations.
Variance and covariance are expectations of centered products. Moments, variance, and covariance on a probability space.
The standard coordinate vectors form a basis of , so . The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension .
The Euclidean inner product is positive definite and ; in particular implies . The Euclidean inner product on .
The error coordinates are square-integrable, have mean zero, and satisfy for .
Proof
Full column rank means for every nonzero . By [F8], for such , so forces . Thus has trivial kernel. The domain has dimension by [F7]; rank-nullity [F3] gives , so is surjective and invertible. The normal equation in [F2] now gives the unique minimizer .
Write . By the fixed-design model [F1], , so . Step 1.1 gives . By [F4] and [A1],
By [F5] and [F6], the entry of the covariance matrix of is Thus by step 2.1. Since is symmetric, No step uses the shape of the error distribution beyond its stated moments.
Gauss–Markov theorem for estimable contrasts
Statement
Let have full column rank in a fixed-design first-moment regression model. Suppose for a fixed , where the vector covariance matrix has entries . For every contrast , the OLS estimate is unbiased and has variance no larger than any other linear unbiased estimator of that contrast. Thus OLS is best linear unbiased (BLUE) for every estimable contrast. Here “best” means minimum variance within the class of linear unbiased estimators; Gaussianity is not assumed.
Facts & Assumptions
Given: The fixed-design model and moment hypotheses in the Statement, a contrast , and any competing linear estimator .
Full-rank OLS is and is unbiased. Full-rank OLS is unbiased with its classical covariance.
A contrast is linearly estimable exactly when for some fixed ; every such is unbiased. Linear estimability is equivalent to row-space membership.
Covariance is bilinear in finite linear combinations. Covariance is symmetric and bilinear in finite linear combinations.
Variance is the covariance of a variable with itself. Moments, variance, and covariance on a probability space.
The error has finite second moments, mean zero, and covariance with .
Proof
Define . Then and . By [F2], is estimable and is unbiased.
Let be any linear unbiased estimator of the same contrast. By [F2], . Set . Then , while ; hence .
From , [A1], [F3], and [F4], Since , equality holds exactly when . Therefore the OLS contrast estimator has minimum variance among all linear unbiased estimates.
5 · Examples, counterexamples and false statements
None yet.