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 , , and let have rank and satisfy . Give the Frobenius inner product . Write for the span of the rows of , and define the full additive mean space and the reduced space by the same formula with the extra restriction . For an array , write , , and . Let and , where is the orthogonal projection onto (The orthogonal projection is the -component in ). Then and where .
Facts & Assumptions
Given: The balanced cell space and hypotheses on in the Statement.
An RCBD has units and every treatment once in each of its blocks (Randomized complete-block design).
For a linear map on a finite-dimensional domain, domain dimension is kernel dimension plus image dimension (Rank-nullity: ).
In a finite-dimensional inner-product space, every subspace has an orthogonal complement, and the space is their direct sum (For a subspace of a finite-dimensional inner product space, ); the projection is the unique component in the subspace (The orthogonal projection is the -component in ).
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 and is a linear subspace of , then is finite-dimensional, , and if and only if
Dimensions add across a finite direct sum of finite-dimensional subspaces. If with every finite-dimensional, then is finite-dimensional and ; in particular
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
Let . The coordinate-sum map is onto, so [F2] gives . By [F6], . For every , the vector lies in and satisfies , because . Thus has dimension , and [F2] gives . The row space of lies in and is orthogonal to . The orthogonal complement of within has dimension : both subspaces are finite-dimensional by [F4], and [F3]–[F5] subtract dimensions from . Since this complement contains the -dimensional row space, the equality case of [F4] identifies it with that row space.
In , the constant arrays form a one-dimensional space , the arrays for form a -dimensional treatment space , and the arrays for with form a -dimensional block space . The replication maps from the two zero-sum coordinate spaces to and 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 by [F2] applied to its onto coordinate-sum map. These spaces are pairwise orthogonal: the treatment-block inner product is , and either zero-sum condition also makes the relevant inner product with 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 , and the finite-dimensional direct-sum formula [F5] gives . The reduced space replaces by the replicated arrays from , whose dimension is by step 1.1; the same formula gives .
For any , set . Summing over any row gives zero because and ; summing over any column likewise gives zero. Conversely, if is orthogonal to , then its row-sum vector is orthogonal to every , so all row sums are equal; orthogonality to makes their total zero, so every row sum is zero. The same argument with gives zero column sums. Thus . Also belongs to . By [F3], this is the orthogonal decomposition of relative to , proving the formula for ; the subspace is finite-dimensional by [F4], and [F3] gives . Since the standard cell-coordinate basis makes , [F5] gives .
Put . The matrix is invertible since has full row rank. Direct multiplication gives , , and image . For any and , , so [F3] identifies as the orthogonal projection onto . Consequently is the orthogonal direct sum of the reduced treatment space and the treatment arrays formed from . Therefore , where .
The projection of onto is the array repeating across all blocks: its residual is orthogonal to every repeated because the inner product is . Its squared norm is . In the orthogonal direct sum of step 3.2, is this projection plus , and the two parts are orthogonal; expanding the squared norm gives the claimed residual-sum reduction.
Depends on
- Randomized complete-block design
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- If $V = \bigoplus_{i<n} U_i$ with every $U_i$ finite-dimensional, then $V$ is finite-dimensional and $\dim_F V = \sum_{i<n} \dim_F U_i$; in particular $\dim_F(U \oplus W) = \dim_F U + \dim_F W$
- Row space, column space, nullspace, row rank, column rank and matrix rank
- Row rank equals column rank, and both equal the number of pivots
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
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.2.2 (standard reference, not scraped)