Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Nested contrast models and projections in a balanced block design

Statement

Let t,b≥2, 1≤q≤t−1, and let C∈Rq×t have rank q and satisfy C1t=0. Give V=Rt×b the Frobenius inner product ⟨u,v⟩=∑i,juijvij. Write row⁡(C)=im⁡(CT) for the span of the rows of C, and define the full additive mean space WU={(μ+τi+βj)ij:μ∈R, ∑iτi=0, ∑jβj=0} and the reduced space WR(C) by the same formula with the extra restriction Cτ=0. For an array y, write yˉi⋅=b−1∑jyij, yˉ⋅j=t−1∑iyij, and yˉ⋅⋅=(tb)−1∑i,jyij. Let RSSU=∥y−PWUy∥2 and RSSR=∥y−PWR(C)y∥2, where PW is the orthogonal projection onto W (The orthogonal projection PWv is the W-component in V=W⊕W⊥). Then dim⁡WU=t+b−1,dim⁡WR(C)=t+b−1−q, WU⊥=E:={r∈Rt×b:∑jrij=0 for every i, ∑irij=0 for every j},dim⁡E=(t−1)(b−1), RSSU=∑i,j(yij−yˉi⋅−yˉ⋅j+yˉ⋅⋅)2, and RSSR−RSSU=b(Cyˉ)T(CCT)−1(Cyˉ), where yˉ=(yˉ1⋅,…,yˉt⋅)T.

Facts & Assumptions

Given: The balanced cell space and hypotheses on t,b,q,C in the Statement.

[F1]

An RCBD has t units and every treatment once in each of its b blocks (Randomized complete-block design).

[F2]

For a linear map on a finite-dimensional domain, domain dimension is kernel dimension plus image dimension (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F3]

In a finite-dimensional inner-product space, every subspace has an orthogonal complement, and the space is their direct sum (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥); the projection is the unique component in the subspace (The orthogonal projection PWv is the W-component in V=W⊕W⊥).

[F4]

A subspace of a finite-dimensional vector space is finite-dimensional, and a subspace with the same finite dimension as its ambient space equals it. If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V

[F6]

Matrix rank is row rank; row and column ranks are the dimensions of their respective spaces, and they are equal. 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

1.1givenF2F3F4F5F6algebra

Let H={a∈Rt:1tTa=0}. The coordinate-sum map Rt→R is onto, so [F2] gives dim⁡H=t−1. By [F6], dim⁡row⁡(C)=dim⁡im⁡C=rank⁡C=q. For every a∈Rt, the vector h=a−(1tTa/t)1t lies in H and satisfies Ch=Ca, because C1t=0. Thus im⁡(C∣H)=im⁡C has dimension q, and [F2] gives dim⁡(H∩ker⁡C)=t−1−q. The row space of C lies in H and is orthogonal to H∩ker⁡C. The orthogonal complement of H∩ker⁡C within H has dimension q: both subspaces are finite-dimensional by [F4], and [F3]–[F5] subtract dimensions from dim⁡H=t−1. Since this complement contains the q-dimensional row space, the equality case of [F4] identifies it with that row space.

2.1givenF1F2F5step 1.1algebra

In V, the constant arrays form a one-dimensional space G, the arrays (ai)ij for a∈H form a (t−1)-dimensional treatment space T, and the arrays (dj)ij for d∈Rb with ∑jdj=0 form a (b−1)-dimensional block space B. The replication maps from the two zero-sum coordinate spaces to T and B are linear bijections: their repeated rows or columns recover the original coordinates, so they transport bases and give the stated dimensions; the block zero-sum space has dimension b−1 by [F2] applied to its onto coordinate-sum map. These spaces are pairwise orthogonal: the treatment-block inner product is ∑i,jaidj=(∑iai)(∑jdj)=0, and either zero-sum condition also makes the relevant inner product with G zero. Their sum is direct: if three mutually orthogonal vectors sum to zero, taking the inner product with each one gives its squared norm zero. Thus WU=G⊕T⊕B, and the finite-dimensional direct-sum formula [F5] gives dim⁡WU=1+(t−1)+(b−1)=t+b−1. The reduced space replaces T by the replicated arrays from H∩ker⁡C, whose dimension is t−1−q by step 1.1; the same formula gives dim⁡WR(C)=1+(t−1−q)+(b−1)=t+b−1−q.

3.1F3F4F5step 2.1algebra

For any y, set rij=yij−yˉi⋅−yˉ⋅j+yˉ⋅⋅. Summing r over any row gives zero because ∑jyij=byˉi⋅ and ∑jyˉ⋅j=byˉ⋅⋅; summing over any column likewise gives zero. Conversely, if v is orthogonal to T, then its row-sum vector is orthogonal to every a∈H, so all row sums are equal; orthogonality to G makes their total zero, so every row sum is zero. The same argument with B gives zero column sums. Thus WU⊥=E. Also (y−r)ij=yˉi⋅+yˉ⋅j−yˉ⋅⋅ belongs to WU. By [F3], this is the orthogonal decomposition of y relative to WU, proving the formula for RSSU; the subspace E is finite-dimensional by [F4], and [F3] gives V=WU⊕E. Since the standard cell-coordinate basis makes dim⁡V=tb, [F5] gives dim⁡E=tb−(t+b−1)=(t−1)(b−1).

3.2F3step 1.1step 2.1algebra

Put PC=CT(CCT)−1C. The matrix CCT is invertible since C has full row rank. Direct multiplication gives PCT=PC, PC2=PC, and image PC=row⁡(C). For any x and a∈Rq, ⟨x−PCx,CTa⟩=aTCx−aTCCT(CCT)−1Cx=0, so [F3] identifies PC as the orthogonal projection onto row⁡(C). Consequently T is the orthogonal direct sum of the reduced treatment space and the treatment arrays formed from row⁡(C). Therefore WU=WR(C)⊕DC, where DC={(ai)ij:a∈row⁡(C)}.

4.1F3step 3.2algebra∎

The projection of y onto DC is the array repeating PCyˉ across all b blocks: its residual is orthogonal to every repeated a∈row⁡(C) because the inner product is b aT(yˉ−PCyˉ)=0. Its squared norm is b∥PCyˉ∥2=b(Cyˉ)T(CCT)−1(Cyˉ). In the orthogonal direct sum of step 3.2, y−PWRy is this projection plus y−PWUy, and the two parts are orthogonal; expanding the squared norm gives the claimed residual-sum reduction.

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources