Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Exact Gaussian regression inference and prediction

1 · Prerequisites

2 · Summary

Objective

Derive exact finite-sample coefficient, nested-model, mean-response, and prediction inference for a fixed full-column-rank Gaussian linear model.

Scope and assumptions

Throughout, X∈Rn×p is deterministic with 1≤p<n and full column rank, and the errors are independent N(0,σ2) with σ2>0. The exact t and partial F laws use the Gaussian sampling law and positive residual degrees of freedom. The page distinguishes the Gaussian maximum-likelihood estimate RSSF/n from the residual mean square RSSF/(n−p).

For a nested reduced design, the null is that the full-model mean lies in the reduced design space. A mean-response interval describes the mean x0Tβ; a prediction interval for one independent future response includes its additional error variance. These are conditional fixed-design calculations and do not establish that a scientific application satisfies the Gaussian model.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A full-column-rank real matrix has an economy QR factorization

Statement

Let n>p≥1 and let X∈Rn×p have full column rank. Then there are matrices Q∈Rn×p and R∈Rp×p such that

X=QR,

where QTQ=Ip and R is upper triangular with positive diagonal. The columns of Q can be completed to an orthonormal basis [Q Q0] of Rn, with Q0∈Rn×(n−p). For PX:=X(XTX)−1XT, one has PX=QQT.

Facts & Assumptions

Given: Integers n>p≥1 and a full-column-rank matrix X∈Rn×p.

[F1]

Every subspace W of a finite-dimensional inner-product space V has an orthogonal decomposition V=W⊕W⊥. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥

[F2]

Every finite-dimensional real or complex inner-product space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis

[F3]

Every invertible square real matrix A has a factorization A=UT with U orthogonal and T upper triangular with positive diagonal. Every invertible real or complex square matrix has a unique factorisation A=QR with Q orthogonal or unitary and R upper triangular with positive real diagonal

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F4F5choosealgebra

Let W=col⁡X. The columns of X are a basis of W, so dim⁡W=p. By [F1], Rn=W⊕W⊥. Since W⊥ is a subspace of the finite-dimensional space Rn, [F4] makes it finite-dimensional; [F5] then gives n=dim⁡W+dim⁡W⊥, so dim⁡W⊥=n−p. By [F2], choose an orthonormal basis of W⊥ and index its n−p vectors as zp+1,…,zn. The columns of A=[X zp+1 ⋯ zn] form a basis of Rn: their X-part spans W, their remaining part spans W⊥, and the direct sum in [F1] makes the union linearly independent. Thus A is invertible.

2.1step 1.1F3algebra

Apply [F3] to write A=UT, where U is orthogonal and T is upper triangular with positive diagonal. Let Q be the first p columns of U, let Q0 be its remaining columns, and let R be the leading p×p block of T. Because Tij=0 when i>j, every entry below row p in its first p columns is zero. The first p columns of A are therefore X=QR. The matrix R is upper triangular with positive diagonal, while U=[Q Q0] gives QTQ=Ip and the required orthonormal completion.

3.1step 2.1algebra∎

Since R is invertible, XTX=RTR and (XTX)−1=R−1R−T. Hence PX=QR(RTR)−1RTQT=QQT, because R(RTR)−1RT=Ip.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Exact t and partial F inference in full-rank Gaussian regression

Statement

Assume the Axiom of Choice. Fix a deterministic full-column-rank matrix X∈Rn×p with 1≤p<n, a parameter β∈Rp, and σ2>0. Observe Y=Xβ+ϵ, where the coordinates of ϵ are independent with law N(0,σ2). This is the fixed-design Gaussian experiment on Rn indexed by (β,σ2)∈Rp×(0,∞).

Let β^=(XTX)−1XTY and PX:=X(XTX)−1XT, the orthogonal projection matrix onto col⁡X. Define RSSF=∥(In−PX)Y∥2,ν=n−p,s2=RSSF/ν,s=s2. For c∈Rp∖{0}, set Tc={cTβ^−cTβscT(XTX)−1c,s>0,0,s=0. Then β^∼Np(β,σ2(XTX)−1), β^ is independent of RSSF, RSSF/σ2∼χν2, s>0 almost surely, and Tc∼tν.

For a fixed reduced design XR∈Rn×(p−q) with rank⁡XR=p−q, col⁡XR⊆col⁡X, and 1≤q≤p, put WR=col⁡XR and RSSR=∥Y−PWRY∥2. Under the null hypothesis Xβ∈WR, the statistic F={(RSSR−RSSF)/qRSSF/ν,RSSF>0,0,RSSF=0 has law Fq,ν. Both denominator degrees of freedom are positive; the empty reduced design space is allowed when q=p.

For a null value θ0, define Tc,θ0 by replacing cTβ in the numerator of Tc by θ0, with the same zero-denominator convention. For 0<α<1, the two-sided test of H0:cTβ=θ0 that rejects when ∣Tc,θ0∣>tν,1−α/2 has size exactly α. The partial F test that rejects when F>Fq,ν−1(1−α) also has size exactly α under its stated null. The joint Gaussian maximum-likelihood estimate is β^ together with σ^ML2=RSSF/n almost surely, distinct from s2=RSSF/(n−p). If an observed vector has RSSF=0, the likelihood has no maximizer over σ2>0; this event has probability zero in the stated model.

Facts & Assumptions

Given: The Axiom of Choice, a fixed full-column-rank X∈Rn×p with 1≤p<n, and independent errors ϵi∼N(0,σ2) with σ2>0.

[A1]

The Axiom of Choice is assumed in the Gaussian normal-law and orthogonal-coordinate results used below. The Axiom of Choice

[F1]

A full-column-rank real matrix has an economy QR factorization X=QR with QTQ=Ip, R upper triangular with positive diagonal, and an orthogonal completion [Q Q0]; its projection is PX=QQT. A full-column-rank real matrix has an economy QR factorization

[F2]

An orthogonal transformation of a vector with independent standard-normal coordinates again has independent standard-normal coordinates. Orthogonal transformations preserve the standard normal product law

[F3]

The sum of squares of k independent standard-normal variables has law χk2 for every integer k≥1. Chi-square laws, including zero degrees

[F4]

A positive-degree chi-square variable is positive almost surely. Positive-degree chi-square laws have a positive density and regular CDF

[F5]

Student tk is a ratio of an independent standard normal and χk2/k, and Fr,s is a ratio of independent scaled chi-square variables. Student t and Fisher F laws

[F6]

The tk CDF is continuous, symmetric, and strictly increasing on R; the Fr,s CDF is continuous and strictly increasing on (0,∞), so the stated quantiles exist uniquely. Student t and Fisher F CDFs are continuous and strictly increasing on their supports

[F7]

A randomized test is a measurable procedure with binary action and measurable rejection function giving the probability of rejection. Randomized tests

[F8]

The size of a test is the supremum of its rejection probabilities over the null parameter set. Test size and power

[F9]

By Standard normal and normal laws, N(0,σ2) for σ>0 is the pushforward of N(0,1) under x↦σx. Since the standard normal has density (2π)−1/2e−x2/2, the change of variable z=x/σ gives density (2πσ2)−1/2e−x2/(2σ2) for N(0,σ2).

[F10]

A statistical experiment is a measurable data space with a parameter-indexed family of sampling laws; an estimator is a measurable statistic with target the estimand. Statistical experiments Statistics and estimators

[F11]

Orthogonal projections give orthogonal decompositions. The orthogonal projection PWv is the W-component in V=W⊕W⊥

[F13]

Under the Axiom of Choice, Countable Choice follows; continuous Euclidean maps are Borel measurable under Countable Choice. The Axiom of Countable Choice (ACω) The Axiom of Choice implies countable choice Continuous functions on Euclidean spaces are Borel measurable

[F14]

The fixed-design first-moment model has fixed X, response Y∈Rn, parameter β∈Rp, and EβY=Xβ; it imposes no covariance or Gaussian assumption. Fixed-design linear regression model

[F15]

The least-squares solution set is arg min⁡b∈Rp∥y−Xb∥22. Least-squares solution set

[F16]

Least-squares minimizers are characterized by the normal equation, and their fitted vector and residual are uniquely Pcol⁡Xy and y−Pcol⁡Xy. Least-squares fitted vectors and residuals are unique

[F17]

In the fixed-design first-moment model, cTβ is linearly estimable exactly when c∈row⁡(X)=im⁡(XT). Linear estimability is equivalent to row-space membership

[F18]

Disjoint groups of an independent coordinate family generate independent sigma-algebras. Disjoint groups of an independent sigma-algebra family remain independent

[F19]

Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence

[F20]

A linear image of a multivariate normal vector is multivariate normal, with covariance obtained by the corresponding matrix transform. Multivariate normal law, including singular covariance

[F21]

Every subspace of a finite-dimensional inner-product space has an orthogonal complement giving a direct-sum decomposition of the whole space. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥

[F22]

Every finite-dimensional real inner-product space has an orthonormal basis, including the empty basis in dimension zero. Every finite-dimensional real or complex inner product space has an orthonormal basis

[F25]

Matrix rank is row rank; row and column ranks are dimensions of their respective spaces and are equal for every finite matrix. Row space, column space, nullspace, row rank, column rank and matrix rank Row rank equals column rank, and both equal the number of pivots

Proof

Given: The hypotheses in the Statement.

1.1givenF1F11F12F14F15F16algebra

The Gaussian experiment has the fixed-design first moment in [F14], and [F15] defines its least-squares solution set. Apply [F1] and write X=QR, with [Q Q0] orthogonal. Since R is invertible, XTX=RTR and (XTX)−1=R−1R−T. Therefore β^=R−1QTY and PX=QR(RTR)−1RTQT=QQT. For any b∈Rp, orthogonality of the columns of Q and Q0 gives ∥Y−Xb∥2=∥QTY−Rb∥2+∥Q0TY∥2. The unique minimizer is b=R−1QTY, consistent with [F16]; the residual is Q0Q0TY.

1.2A1givenF2F3F4F5F9F11F12F13F18F19F21F22F23F24F25choosealgebra

Set WU=col⁡X, A=WU∩WR⊥, and B=WU⊥, and let PA,PB be the orthogonal projections onto A,B. By [F21], Rn=WU⊕B. For any u∈WU, write u=PWRu+(u−PWRu). The first term belongs to WR⊆WU, while the second lies in WR⊥ by [F11] and in WU because it is a difference of vectors in WU. Thus u∈WR+A. Conversely WR,A⊆WU, and WR∩A={0} because A⊆WR⊥ and [F21] gives WR∩WR⊥={0}, so WU=WR⊕A. Combining the two decompositions gives Rn=WR⊕A⊕B, with pairwise orthogonal summands. By [F23], these subspaces are finite-dimensional. The columns of X are a basis of WU, so dim⁡WU=p. If q=p, then WR={0} and dim⁡WR=0=p−q; if q<p, [F25] gives dim⁡WR=crank⁡(XR)=rrank⁡(XR)=rank⁡(XR)=p−q. Applying [F24] gives dim⁡A=q and dim⁡B=n−p=ν. By [F22], choose orthonormal bases of WR,A,B, using the empty basis when q=p. Let O be the matrix whose columns are these bases in that order; then O is orthogonal. For every y=r+a+b in the unique decomposition, [F11] gives PWRy=r, PAy=a, PBy=b, and PWUy=r+a. Hence y−PWRy=PAy+PBy and y−PWUy=PBy. Standardize the errors to η=ϵ/σ. By [F9], each ϵi/σ is standard normal, and [F19] preserves independence under coordinatewise scaling, so η has independent standard-normal coordinates. Write OTη=(ZR,ZA,ZB). By [F2], these transformed coordinates are independent standard normals, so [F18] makes ZA and ZB independent. Under the null, μ=Xβ∈WR, so PAμ=PBμ=0. The two residual vectors above are therefore PAϵ+PBϵ and PBϵ; since PX=PWU and the chosen columns are orthonormal, RSSR−RSSF=∥PAϵ∥2=σ2∥ZA∥2 and RSSF=∥PBϵ∥2=σ2∥ZB∥2. Thus [F3] gives independent χq2 and χν2 variables; both degrees are positive, [F4] makes the denominator positive almost surely, and the ratio definition [F5] gives the stated Fq,ν law.

2.1A1F1F2F3F4F5F9F13F17F18F19F20step 1.1algebra

Put η=ϵ/σ and use U=[Q Q0] from [F1]. The density in [F9] becomes standard normal under this scaling, and [F19] preserves independence under coordinatewise scaling; hence η has independent standard-normal coordinates. By [F2], UTη=(G,H) has independent standard-normal coordinates, and [F18] groups the first p and last ν coordinates into independent vectors. Step 1.1 gives β^−β=σR−1G and (I−PX)Y=σQ0H. By [F13], these linear and squared-norm maps are Borel, so [F19] preserves the independence of their values. From [F20], β^∼Np(β,σ2R−1R−T)=Np(β,σ2(XTX)−1); [F3] gives RSSF/σ2=∥H∥2∼χν2, and s>0 almost surely by [F4]. For c≠0, positive definiteness gives vc=cT(XTX)−1c>0. The linear image Zc=(R−Tc)TG/vc is N(0,1) by [F20], since ∥R−Tc∥2=vc. It is independent of ∥H∥2 by [F18] and [F19]. Therefore, almost surely, Tc=Zc/∥H∥2/ν has law tν by [F3] and [F5]; the defined value on s=0 does not change its law. Finally, row⁡(X)=Rp, so [F17] makes every coefficient contrast estimable; explicitly, XT[X(XTX)−1c]=c.

2.2F1F9step 1.1

For fixed v=σ2>0, independence and the normal density [F9] make the joint likelihood as a function of b proportional to exp⁡(−∥Y−Xb∥2/(2v)). Step 1.1 shows its unique maximizer is β^.

3.1F6F7F8F10F13step 1.2step 2.1algebra

Define Tc,θ0 by replacing cTβ in the numerator of Tc with θ0. This statistic is measurable by [F10] and [F13], since its piecewise formula uses Borel linear and norm maps. Under H0:cTβ=θ0, step 2.1 gives the symmetric continuous tν law in [F6]; the two tails beyond ±tν,1−α/2 each have probability α/2. The contrast null and alternative are both nonempty: β=θ0c/(cTc) is in the null, and β=(θ0+1)c/(cTc) is in its alternative. The partial F statistic is Borel because RSSR and RSSF are continuous functions of Y, and its ratio on {RSSF>0} with the constant branch on {RSSF=0} is Borel by [F13], so the two threshold rejection events are Borel. Step 1.2 and the unique Fq,ν quantile in [F6] give upper-tail rejection probability α. The F-test null contains β=0; step 1.2 gives a q-dimensional subspace A⊆col⁡X with q≥1, so some a∈A∖{0} equals Xβ for a coefficient vector β. Since A∩WR={0}, this mean is outside WR, so that parameter is in the alternative. Each Borel rejection event E defines a measurable deterministic kernel by K(y,{1})=1E(y) and K(y,{0})=1−1E(y), so [F7] applies. Both tests reject with probability α at every null parameter, so each has size α by [F8].

4.1step 2.1step 2.2step 3.1algebra∎

Write r=RSSF. At b=β^, the joint log-likelihood for v>0 is −n2log⁡(2πv)−r2v. If r>0, its derivative (r−nv)/(2v2) is positive for v<r/n and negative for v>r/n, so the unique maximum is v=r/n. Step 2.1 shows r>0 almost surely. If an observed vector has r=0, the likelihood tends to infinity as v↓0 and has no maximizer on (0,∞). Therefore the joint MLE is (β^,RSSF/n) almost surely, while s2=RSSF/(n−p) differs because n>p and RSSF>0 almost surely. Together with steps 2.1 and 3.1 this proves all asserted distributional and test-calibration claims, with the likelihood exception stated for every data vector.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Exact confidence and prediction intervals in Gaussian regression

Statement

Use the fixed full-column-rank Gaussian regression model and notation of Exact t and partial F inference in full-rank Gaussian regression, with ν=n−p. Let 0<α<1, let t∗=tν,1−α/2 be the unique (1−α/2) quantile of tν, and put vc=cT(XTX)−1c for c≠0. Then Cc(Y)=[cTβ^−t∗svc, cTβ^+t∗svc] has exact coverage 1−α for cTβ.

For any x0∈Rp, put h0=x0T(XTX)−1x0. The mean-response interval Cmean(Y;x0)=[x0Tβ^−t∗sh0, x0Tβ^+t∗sh0] has exact coverage 1−α for x0Tβ when x0≠0. If x0=0, it is the singleton {0} and has coverage 1.

If Y0∗=x0Tβ+ϵ0∗ is one future response with ϵ0∗∼N(0,σ2) independent of the training data, then Cpred(Y;x0)=[x0Tβ^−t∗s1+h0, x0Tβ^+t∗s1+h0] satisfies Pβ,σ2{Y0∗∈Cpred(Y;x0)}=1−α. The added 1 is the variance contribution of the future response's own error.

Facts & Assumptions

Given: The Axiom of Choice, the Gaussian regression experiment in Exact t and partial F inference in full-rank Gaussian regression, 0<α<1, a contrast c≠0, a predictor vector x0∈Rp, and, for prediction, an independent future Gaussian error ϵ0∗∼N(0,σ2).

[A1]

The Axiom of Choice is inherited from the Gaussian model and its normal-law suppliers. The Axiom of Choice

[F1]

In this model, β^∼Np(β,σ2(XTX)−1), β^ is independent of RSSF, and the stated nonzero-contrast pivot has law tν. Exact t and partial F inference in full-rank Gaussian regression

[F2]

A pivot is a parameter-indexed family of measurable statistics with one common sampling law. Pivotal quantities

[F3]

A confidence-set procedure is measurable when each parameter-membership section is measurable, and coverage is the probability that the true parameter belongs to the set. Confidence sets and coverage

[F4]

Inverting a pivot acceptance set of probability 1−α gives a confidence set with exact coverage 1−α. Coverage from pivot inversion and exact calibration

[F5]

The tν CDF is symmetric, continuous, and strictly increasing, so [−tν,1−α/2,tν,1−α/2] has probability 1−α. Student t and Fisher F CDFs are continuous and strictly increasing on their supports

[F6]

For a multivariate normal vector, every linear projection is normal with variance given by its covariance quadratic form; independent normal coordinates give the corresponding product normal law. Multivariate normal law, including singular covariance

[F7]

Independent random elements have product joint law, and measurable functions of independent random elements remain independent. Independent random elements have product joint law Measurable coordinatewise functions preserve independence

[F8]

The future error has the centered normal law with variance σ2, independently of the training data. Standard normal and normal laws

[F9]

For ν≥1, tν is the law of an independent standard normal divided by χν2/ν. Student t and Fisher F laws Chi-square laws, including zero degrees

[F10]

A positive-degree chi-square denominator is positive almost surely. Positive-degree chi-square laws have a positive density and regular CDF

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F3F4F5algebra

Fix c≠0. Then vc>0 because XTX is positive definite. For each full parameter θ=(β,σ2), the statistic qθ(Y)=(cTβ^−cTβ)/(svc), assigned value 0 when s=0, is a pivot by [F1] and [F2], with common law tν. By [F5], B=[−t∗,t∗] has probability 1−α. Define Dc(Y)={(β′,σ′2)∈Θ:cTβ′∈Cc(Y)}. For each fixed (β′,σ′2)∈Θ, its membership event is ∣cTβ^−cTβ′∣≤t∗svc, a closed, hence Borel, set because β^ and s are continuous functions of Y. Thus [F3] applies to Dc. Pivot inversion [F4] gives exact coverage for Dc′(Y)={θ′∈Θ:∣qθ′(Y)∣≤t∗}. On s>0, Dc(Y)=Dc′(Y); the exceptional event s=0 has probability zero for every parameter by [F1]. Therefore Dc has exact coverage 1−α, which is precisely Pβ,σ2{cTβ∈Cc(Y)}=1−α.

2.1F1step 1.1algebra

If x0≠0, the same argument with c=x0 gives the displayed mean-response interval because h0=vx0. If x0=0, then x0Tβ=x0Tβ^=h0=0 for every parameter and data vector, so the interval is {0} and contains the true mean with probability 1.

3.1A1F1F5F6F7F8F9F10step 2.1algebra∎

Write Z=(β^−β)/σ and G∗=ϵ0∗/σ. By [F1] and [F8], Z and G∗ are independent centered normal vectors/scalars with covariance (XTX)−1 and variance 1. Their joint law is the product law by [F7], so [F6] gives Y0∗−x0Tβ^σ1+h0=G∗−x0TZ1+h0∼N(0,1), since the numerator has variance 1+x0T(XTX)−1x0=1+h0. Because G∗ is independent of the training data, [F7] gives L(Z,RSSF,G∗)=L(Z,RSSF)⊗L(G∗). Since Z is a measurable affine function of β^, [F1] and [F7] imply that Z is independent of RSSF; the joint law therefore factors as L(Z)⊗L(RSSF)⊗L(G∗), so (Z,G∗) is independent of RSSF. The displayed standard normal is a measurable function of (Z,G∗), so it is independent of RSSF/σ2∼χν2 by [F7]. By [F9] and [F10], the ratio (Y0∗−x0Tβ^)/(s1+h0) has law tν with positive denominator almost surely. Its central acceptance interval has probability 1−α by [F5], which is exactly the event Y0∗∈Cpred(Y;x0).

5 · Examples, counterexamples and false statements

None yet.

Sources