Chapter 8 · Sample Surveys and Design of Experiments

8.3 Completely Randomised, Randomised Block and Latin Square Designs

How to compare treatments fairly: randomisation, replication and local control; the completely randomised design and what randomisation alone guarantees; randomised blocks and Latin squares with their models, ANOVA tables and relative efficiencies; and the missing-plot technique for one lost observation.

In 1919 R. A. Fisher arrived at the Rothamsted agricultural station and found seventy years of carefully recorded field trials from which almost nothing could be concluded. A new variety had been planted on the better side of a field, a fertiliser had been tried in a wet year, and no one could say how large a difference had to be before it meant anything. Fisher's diagnosis was that the analysis of an experiment is determined by its design: how the treatments were allotted to the plots decides which comparisons are unbiased, how precise they are, and what the error mean square in an ANOVA table actually estimates. His remedy fits in three words — randomisation, replication, local control — and it is now used in every clinical trial, every industrial experiment and every A/B test on a website.

This section builds the three classical designs on those principles. The completely randomised design (CRD) uses randomisation and replication only; we prove that randomisation by itself makes treatment comparisons unbiased and the error mean square honest, with no normality or independence assumed. The randomised block design (RBD) adds local control in one direction and the Latin square design (LSD) in two; for each we give the model, the ANOVA table and a formula for the relative efficiency, derived from the same randomisation argument. Finally the missing-plot technique rescues an experiment in which one observation has been lost. The linear-model machinery is that of §6.1 ($y=X\beta+\varepsilon$, least squares, estimability, Cochran's theorem) and the analyses are the one- and two-way ANOVAs of §6.2. CSIR NET Part B asks for error degrees of freedom, missing-value estimates and efficiencies; Part C asks which statements about blocking, randomisation and Latin squares are true. Upper points are written $F_{\nu_1,\nu_2,\alpha}$ as in §4.3.

Principles of Experimental Design

📘 Definition 8.10 — Experimental units, treatments and experimental error

An experiment compares $v$ treatments (varieties, doses, machine settings, teaching methods…) by applying them to experimental units — the smallest pieces of material to which a treatment is applied independently (a plot of land, a patient, a batch). A response $y$ is measured on each unit. The design is the rule that decides which unit receives which treatment. Responses of units that received the same treatment still differ: this variation, caused by the inherent differences between units and by measurement noise, is the experimental error, and its variance per unit is the error variance.

We work under unit–treatment additivity: unit $w$ has a fixed unit value $u_w$, and if it receives treatment $i$ its response is $y=u_w+\tau_i+e_w$, where $\tau_i$ is the effect of treatment $i$ and $e_w$ is a technical (measurement) error with mean $0$ and variance $\sigma_e^2$, independent of everything else. Treatments shift responses by the same amount on every unit.

📘 Definition 8.11 — The three principles
RandomisationThe allocation of treatments to units is made by a random mechanism, all allocations allowed by the design being equally likely. It protects against systematic bias (the experimenter's choice, a hidden gradient) and is what justifies the error mean square as an estimate of the error variance.
ReplicationEach treatment is applied to several units. Replication provides an estimate of the error variance — with one unit per treatment there is nothing to compare differences with — and reduces the variance of a treatment mean to $\sigma^2/r$.
Local controlUnits are grouped into homogeneous blocks (adjacent plots, litter-mates, one day's production) and treatments are compared within blocks. Differences between blocks are removed from the error, which makes comparisons more precise.

Each principle guards against a different failure. Without randomisation, a new variety planted on the more fertile end of a field "wins" for reasons that have nothing to do with the variety, and no statistical analysis can detect it. Without replication, a single plot per treatment confounds the treatment with the particular plot. Without local control, large differences between units swamp small treatment differences, as Example 3 of §6.2 showed when the fields were ignored. Note what randomisation does not do: it does not reduce variability; it turns an unknown systematic bias into a random error of known average behaviour. Theorem 8.21 makes this precise.

The Completely Randomised Design

📘 Definition 8.12 — Completely randomised design (CRD)

In a completely randomised design, $N$ units are available and treatment $i$ is to be applied to $r_i$ of them ($\sum_ir_i=N$). The allocation is chosen at random from all $$\frac{N!}{r_1!\,r_2!\cdots r_v!}$$ possible allocations, for instance by placing the labels in random order (a random permutation of $1,\dots,N$) and giving the first $r_1$ units treatment 1, the next $r_2$ treatment 2, and so on. The model used for the analysis is the one-way classification $$y_{ij}=\mu+\tau_i+\varepsilon_{ij},\qquad i=1,\dots,v,\ j=1,\dots,r_i,$$ with $\varepsilon_{ij}$ iid $N(0,\sigma^2)$, and the analysis is the one-way ANOVA of §6.2: treatments on $v-1$ and error on $N-v$ degrees of freedom, $F=\text{MSTr}/\text{MSE}$.

The normal model is convenient, but where does it come from? The units are not a random sample from anything — they are the particular plots of one field. The next theorem shows that the randomisation itself produces an "error" with exactly the first- and second-moment properties that the ANOVA uses. It is the reason the analysis of a properly randomised experiment can be trusted even when the units are far from iid.

📐 Theorem 8.21 — Randomisation analysis of the CRD

Let $N=vr$ units with unit values $u_1,\dots,u_N$ be allotted by a CRD with $r$ units per treatment, under unit–treatment additivity (Definition 8.10). Write $\bar u$ for the mean of the unit values, $$S_u^2=\frac1{N-1}\sum_{w=1}^N(u_w-\bar u)^2,$$ and let $\bar y_i$ be the mean response of the units given treatment $i$, $\bar\tau=\frac1v\sum\tau_i$. Then, with expectations taken over the random allocation and the technical errors:

  1. $E[\bar y_i-\bar y_{i'}]=\tau_i-\tau_{i'}$: every treatment difference is estimated unbiasedly;
  2. $\operatorname{Var}(\bar y_i-\bar y_{i'})=\dfrac{2(S_u^2+\sigma_e^2)}{r}$;
  3. $E[\text{MSE}]=S_u^2+\sigma_e^2$ and $E[\text{MSTr}]=S_u^2+\sigma_e^2+\dfrac{r\sum_i(\tau_i-\bar\tau)^2}{v-1}$.

So the CRD behaves exactly like the normal one-way model with error variance $\sigma^2=S_u^2+\sigma_e^2$, as far as means and variances are concerned.

Proof. Let $\bar u_i$ and $\bar e_i$ be the averages of the unit values and of the technical errors over the units given treatment $i$, so that $\bar y_i=\bar u_i+\tau_i+\bar e_i$. By symmetry of the randomisation, the set of units receiving treatment $i$ is equally likely to be any $r$-subset of the $N$ units: it is a simple random sample without replacement. By the theorem on the sample mean under SRSWOR (§8.1), $$E[\bar u_i]=\bar u,\qquad\operatorname{Var}(\bar u_i)=\Bigl(1-\frac rN\Bigr)\frac{S_u^2}{r}=\frac{v-1}{v}\cdot\frac{S_u^2}{r}.$$ For the covariance note that $\sum_i\bar u_i=v\bar u$ is a constant, so $$0=\operatorname{Var}\Bigl(\sum_i\bar u_i\Bigr)=v\operatorname{Var}(\bar u_1)+v(v-1)\operatorname{Cov}(\bar u_1,\bar u_2),$$ and therefore $\operatorname{Cov}(\bar u_i,\bar u_{i'})=-\operatorname{Var}(\bar u_1)/(v-1)=-S_u^2/N$ for $i\ne i'$. The $\bar e_i$ are independent of the allocation and of each other, with mean $0$ and variance $\sigma_e^2/r$.

(1) $E[\bar y_i-\bar y_{i'}]=(\bar u-\bar u)+\tau_i-\tau_{i'}+0$. (2) Using the variance and covariance just found, $$\operatorname{Var}(\bar u_i-\bar u_{i'})=2\operatorname{Var}(\bar u_1)-2\operatorname{Cov}(\bar u_1,\bar u_2)$$ $$=\frac{2(v-1)S_u^2}{vr}+\frac{2S_u^2}{vr}=\frac{2S_u^2}{r},$$ and the errors add $2\sigma_e^2/r$.

(3) Since $\bar y_i-\bar y=(\tau_i-\bar\tau)+(\bar u_i-\bar u)+(\bar e_i-\bar e)$ and the last two terms have mean zero, $$E[\text{SSTr}]=r\sum_i(\tau_i-\bar\tau)^2+r\sum_i\operatorname{Var}(\bar u_i)+rE\sum_i(\bar e_i-\bar e)^2=r\sum_i(\tau_i-\bar\tau)^2+(v-1)(S_u^2+\sigma_e^2).$$ For the total sum of squares, $y_w-\bar y=(u_w-\bar u)+(\tau_{t(w)}-\bar\tau)+(e_w-\bar e)$, where $t(w)$ is the treatment of unit $w$. The first term contributes the constant $(N-1)S_u^2$, the second $r\sum(\tau_i-\bar\tau)^2$, the third $(N-1)\sigma_e^2$ in expectation, and the cross term $$2\sum_w(u_w-\bar u)(\tau_{t(w)}-\bar\tau)=2r\sum_i(\tau_i-\bar\tau)(\bar u_i-\bar u)$$ has mean zero (cross terms with the errors also have mean zero). Subtracting $E[\text{SSTr}]$ from $E[\text{SST}]$ gives $E[\text{SSE}]=(N-v)(S_u^2+\sigma_e^2)$. Divide by the degrees of freedom. ∎

Randomisation also gives an exact test that needs no model at all: under $H_0:\tau_1=\cdots=\tau_v$ every allocation would have produced the same responses, so the observed $F$ can be compared with its distribution over all allocations (Fisher's randomisation test, a permutation test as in §5.3). The usual $F_{v-1,N-v}$ distribution is a close approximation to that permutation distribution in all but very small experiments.

📐 Theorem 8.22 — Allocating the replicates

Consider a CRD with error variance $\sigma^2$ and $N$ units in all.

  1. (Equal replication.) The average variance of the $\binom v2$ elementary contrasts $\bar y_i-\bar y_{i'}$ is $\frac{2\sigma^2}{v}\sum_i\frac1{r_i}$; subject to $\sum r_i=N$ it is smallest when all $r_i=N/v$.
  2. (Square-root rule.) If a control (treatment $0$, $r_0$ units) is to be compared with $m$ test treatments ($r$ units each), $r_0+mr=N$, then $\operatorname{Var}(\bar y_0-\bar y_i)=\sigma^2\left(\frac1{r_0}+\frac1r\right)\ge\frac{\sigma^2(1+\sqrt m)^2}{N}$, with equality iff $r_0=r\sqrt m$.
  3. (Replication for power.) To detect a difference $\delta$ between two treatments with a two-sided level-$\alpha$ test and power $1-\beta$, about $$r\ge\frac{2\sigma^2(z_{\alpha/2}+z_\beta)^2}{\delta^2}$$ replicates per treatment are needed (normal approximation, $\sigma$ known; $z_\alpha=\Phi^{-1}(1-\alpha)$).

Proof. (1) Each $1/r_i$ occurs in $v-1$ of the $\binom v2$ pairs, so the average of $\sigma^2(1/r_i+1/r_{i'})$ is $\frac{(v-1)\sigma^2\sum1/r_i}{v(v-1)/2}=\frac{2\sigma^2}{v}\sum\frac1{r_i}$. By the Cauchy–Schwarz inequality $\left(\sum1/r_i\right)\left(\sum r_i\right)\ge v^2$, so $\sum1/r_i\ge v^2/N$, with equality iff all $r_i$ are equal. (2) By Cauchy–Schwarz applied to the vectors $(1/\sqrt{r_0},1/\sqrt r)$ and $(\sqrt{r_0},\sqrt{mr})$, $$\left(\frac1{r_0}+\frac1r\right)(r_0+mr)\ge(1+\sqrt m)^2,$$ with equality iff the vectors are proportional, i.e. $\frac{1/\sqrt{r_0}}{\sqrt{r_0}}=\frac{1/\sqrt r}{\sqrt{mr}}$, i.e. $r_0=r\sqrt m$. (3) The test rejects when $|\bar y_1-\bar y_2|\gt z_{\alpha/2}\sqrt{2\sigma^2/r}$. If the true difference is $\delta\gt0$, the power is at least $P\bigl(Z\gt z_{\alpha/2}-\delta/\sqrt{2\sigma^2/r}\bigr)$, which is $\ge1-\beta$ iff $\delta/\sqrt{2\sigma^2/r}\ge z_{\alpha/2}+z_\beta$. ∎

✏️ Example 1 — Four catalysts in a completely randomised design
Eighteen runs of a chemical process were allotted at random to four catalysts, with unequal replication because catalysts B and D were in short supply. Yields (%): A: $62,58,65,60,63$; B: $70,66,69,71$; C: $64,61,67,63,65$; D: $58,55,60,57$. Construct the ANOVA table, test at $5\%$ whether the catalysts differ, and give a $95\%$ confidence interval for $\tau_B-\tau_D$.
Totals $T_A=308$, $T_B=276$, $T_C=320$, $T_D=230$; means $61.6,\ 69.0,\ 64.0,\ 57.5$; $G=1134$, $N=18$, $\text{CF}=G^2/N=71442$; $\sum y^2=71798$.
Sums of squares $\text{SST}=71798-71442=356.0$. $\text{SSTr}=\frac{308^2}5+\frac{276^2}4+\frac{320^2}5+\frac{230^2}4-71442=279.8$. $\text{SSE}=356.0-279.8=76.2$.
Table Treatments: $3$ df, $\text{MSTr}=93.27$. Error: $14$ df, $\text{MSE}=5.443$. $F=17.14\gt F_{3,14,0.05}=3.344$ ($p\approx6\times10^{-5}$): the catalysts differ.
Interval $\bar y_B-\bar y_D=11.5$ with standard error $\sqrt{5.443(\tfrac14+\tfrac14)}=1.650$ and $t_{14,0.025}=2.145$: $11.5\pm3.54$, i.e. $(7.96,\ 15.04)$. (If several such intervals are wanted, use a multiple-comparison method of §6.2.)
✏️ Example 2 — How many units, and where?
(a) A plant breeder will compare $m=4$ new varieties with a standard variety on $N=60$ plots in a CRD. Compare equal replication with the square-root rule for the comparisons of each new variety with the standard. (b) From earlier trials the error standard deviation is about $\sigma=4$ (kg per plot). How many replicates of each of two varieties are needed to detect a difference of $\delta=5$ kg with a two-sided $5\%$ test and power $90\%$?
(a) Equal $r_0=r=12$: $\operatorname{Var}(\bar y_0-\bar y_i)=\sigma^2\left(\frac1{12}+\frac1{12}\right)=0.1667\sigma^2$.
(a) Square root $r_0=r\sqrt4=2r$ and $2r+4r=60$ give $r=10$, $r_0=20$: variance $\sigma^2\left(\frac1{20}+\frac1{10}\right)=0.15\sigma^2$, the bound $(1+\sqrt4)^2\sigma^2/60$ of Theorem 8.22(2). The relative efficiency is $0.1667/0.15=1.11$: the same precision as equal replication with $11\%$ more plots. (Comparisons among the new varieties become slightly worse: $2\sigma^2/10$ instead of $2\sigma^2/12$.)
(b) $z_{0.025}=1.960$, $z_{0.10}=1.282$: $r\ge\frac{2\cdot16\,(3.242)^2}{25}=13.45$, so $r=14$ plots per variety.
Check With $\sigma$ estimated, the test is a $t$-test. For two varieties alone ($2(r-1)$ error df) the exact power from the noncentral $t$ distribution is $0.889$ at $r=14$ and $0.911$ at $r=15$, so the normal approximation is slightly optimistic; in a larger experiment with more error df the difference shrinks.

The Randomised Block Design

📘 Definition 8.13 — Randomised block design (RBD)

The units are grouped into $b$ blocks of $v$ units each, chosen so that units within a block are as alike as possible. Every treatment is applied to exactly one unit in every block, the allocation within each block being a random permutation, chosen independently for different blocks. The model is the additive two-way classification $$y_{ij}=\mu+\tau_i+\beta_j+\varepsilon_{ij},\qquad i=1,\dots,v,\ j=1,\dots,b,$$ with $\sum\tau_i=\sum\beta_j=0$ and $\varepsilon_{ij}$ iid $N(0,\sigma^2)$, where $\beta_j$ is the effect of block $j$. (Here $\beta$ denotes block effects, not the whole parameter vector of §6.1.) With treatment totals $T_i$, block totals $B_j$, grand total $G$ and $\text{CF}=G^2/(bv)$:

SourcedfSS$E[\text{MS}]$
Blocks$b-1$$\text{SSB}=\sum_jB_j^2/v-\text{CF}$$\sigma^2+\frac{v\sum\beta_j^2}{b-1}$
Treatments$v-1$$\text{SSTr}=\sum_iT_i^2/b-\text{CF}$$\sigma^2+\frac{b\sum\tau_i^2}{v-1}$
Error$(v-1)(b-1)$$\text{SSE}=\text{SST}-\text{SSB}-\text{SSTr}$$\sigma^2$
Total$bv-1$$\text{SST}=\sum y_{ij}^2-\text{CF}$

The table is the two-way ANOVA with one observation per cell of §6.2, with treatments as one factor and blocks as the other; we do not repeat its proof. What is new is the experimental point of view: blocks are a nuisance factor, introduced only to remove variation, and the questions are what the analysis assumes about them and how much they have gained.

📐 Theorem 8.23 — Analysis of the randomised block design
  1. (Estimation.) Every treatment contrast $\sum c_i\tau_i$ ($\sum c_i=0$) is estimable, with BLUE $\sum c_i\bar y_{i\cdot}$ and variance $\sigma^2\sum c_i^2/b$; in particular $\operatorname{Var}(\bar y_{i\cdot}-\bar y_{i'\cdot})=2\sigma^2/b$. These estimates do not involve the block effects at all.
  2. (Test.) $H_0:\tau_1=\cdots=\tau_v$ is rejected at level $\alpha$ when $\text{MSTr}/\text{MSE}\gt F_{v-1,(v-1)(b-1),\alpha}$.
  3. (Random blocks.) If the blocks are a sample from a population of blocks, $\beta_j$ iid $N(0,\sigma_b^2)$ independent of the errors, then $E[\text{MSB}]=\sigma^2+v\sigma_b^2$, the other lines are unchanged, and the treatment test is the same. Two observations in the same block have correlation $\sigma_b^2/(\sigma_b^2+\sigma^2)$.
  4. (Random block × treatment interaction.) If moreover $y_{ij}$ contains a term $c_{ij}$, iid $N(0,\sigma_{\tau\beta}^2)$ and independent of the rest (the unrestricted mixed model of §6.2), then $$E[\text{MSE}]=\sigma^2+\sigma_{\tau\beta}^2,\quad E[\text{MSTr}]=\sigma^2+\sigma_{\tau\beta}^2+\tfrac{b\sum\tau_i^2}{v-1},\quad E[\text{MSB}]=\sigma^2+\sigma_{\tau\beta}^2+v\sigma_b^2,$$ so $\text{MSTr}/\text{MSE}$ and $\text{MSB}/\text{MSE}$ are still exact $F$-tests; but $\sigma^2$ and $\sigma_{\tau\beta}^2$ cannot be separated without replication within cells.

Proof. (1) Every treatment occurs once in every block, so $\bar y_{i\cdot}=\mu+\tau_i+\bar\beta+\bar\varepsilon_{i\cdot}=\mu+\tau_i+\bar\varepsilon_{i\cdot}$ because $\bar\beta=0$; even without the side condition, $\bar\beta$ is common to all treatments and cancels from every contrast. Hence $E[\sum c_i\bar y_{i\cdot}]=\sum c_i\tau_i$, and since the $\bar\varepsilon_{i\cdot}$ are independent with variance $\sigma^2/b$, $\operatorname{Var}=\sigma^2\sum c_i^2/b$. The fitted values of the additive model are $\bar y_{i\cdot}+\bar y_{\cdot j}-\bar y_{\cdot\cdot}$ (§6.2), so $\sum c_i\bar y_{i\cdot}$ is the least squares estimate, which is the BLUE by the Gauss–Markov theorem (§6.1). (2) is the $F$-test of the two-way ANOVA with one observation per cell (§6.2).

(3), (4) We prove (4); (3) is the case $\sigma_{\tau\beta}^2=0$. Now $y_{ij}=\mu+\tau_i+\beta_j+c_{ij}+\varepsilon_{ij}$. The residual array $y_{ij}-\bar y_{i\cdot}-\bar y_{\cdot j}+\bar y_{\cdot\cdot}$ contains only the double-centred $c$ and $\varepsilon$ terms; for iid terms the double-centred array has expected squared length $(v-1)(b-1)$ times the variance (it is the residual of the additive model fitted to pure noise, §6.1), so $E[\text{SSE}]=(v-1)(b-1)(\sigma^2+\sigma_{\tau\beta}^2)$. Next $\bar y_{i\cdot}-\bar y_{\cdot\cdot}=\tau_i+(\bar c_{i\cdot}-\bar c_{\cdot\cdot})+(\bar\varepsilon_{i\cdot}-\bar\varepsilon_{\cdot\cdot})$ — the $\beta_j$ cancel because every treatment mean contains the same $\bar\beta$ — and $\bar c_{i\cdot}+\bar\varepsilon_{i\cdot}$ are iid with variance $(\sigma_{\tau\beta}^2+\sigma^2)/b$, so $E[\text{SSTr}]=b\sum\tau_i^2+(v-1)(\sigma^2+\sigma_{\tau\beta}^2)$. Similarly $\bar y_{\cdot j}-\bar y_{\cdot\cdot}=(\beta_j-\bar\beta)+(\bar c_{\cdot j}-\bar c_{\cdot\cdot})+(\bar\varepsilon_{\cdot j}-\bar\varepsilon_{\cdot\cdot})$ with iid summands of variance $\sigma_b^2+(\sigma_{\tau\beta}^2+\sigma^2)/v$, giving $E[\text{SSB}]=(b-1)(\sigma^2+\sigma_{\tau\beta}^2+v\sigma_b^2)$. In this balanced layout the three sums of squares come from mutually orthogonal projections of a normal vector whose covariance is constant on each of the three subspaces, so each divided by its expected mean square times its df is $\chi^2$, independently (the argument used for the expected mean squares of the balanced two-way layout in §6.2); under each null hypothesis the ratio is therefore exactly $F$. ∎

Part (4) agrees with the mixed-model rule of §6.2 — the fixed factor is tested against the interaction mean square — because with one observation per cell "error" and "interaction" are the same line of the table. If instead the blocks are fixed and interact with treatments, MSE overestimates $\sigma^2$ and the treatment test becomes conservative; the treatment means then estimate effects averaged over these particular blocks.

📐 Theorem 8.24 — Randomisation analysis of the RBD and the gain from blocking

Let $b$ blocks of $v$ units be allotted by an RBD under unit–treatment additivity, with unit values $u_{jw}$ (block $j$, unit $w$). Let $\bar u_j$ be the mean unit value of block $j$, $\bar u$ the overall mean, $$S_j^2=\frac1{v-1}\sum_w(u_{jw}-\bar u_j)^2,\qquad S_w^2=\frac1b\sum_jS_j^2,$$ and $S_u^2$ the variance (divisor $bv-1$) of all $bv$ unit values. Then over the randomisation:

  1. $E[\bar y_{i\cdot}-\bar y_{i'\cdot}]=\tau_i-\tau_{i'}$ and $\operatorname{Var}(\bar y_{i\cdot}-\bar y_{i'\cdot})=2(S_w^2+\sigma_e^2)/b$;
  2. $E[\text{MSE}]=S_w^2+\sigma_e^2$ and $E[\text{MSTr}]=S_w^2+\sigma_e^2+b\sum_i(\tau_i-\bar\tau)^2/(v-1)$;
  3. $\displaystyle\hat\sigma^2_{\text{CRD}}=\frac{(b-1)\text{MSB}+b(v-1)\text{MSE}}{bv-1}$ is an unbiased estimator of $S_u^2+\sigma_e^2$, the error variance that a CRD with $b$ replicates on the same units would have had (Theorem 8.21). The relative efficiency of the RBD with respect to the CRD, $(S_u^2+\sigma_e^2)/(S_w^2+\sigma_e^2)$, is therefore estimated by $$\widehat{\text{RE}}=\frac{(b-1)\text{MSB}+b(v-1)\text{MSE}}{(bv-1)\text{MSE}};$$
  4. $\widehat{\text{RE}}-1=\dfrac{(b-1)(\text{MSB}-\text{MSE})}{(bv-1)\text{MSE}}$, so blocking is estimated to have helped if and only if $\text{MSB}\gt\text{MSE}$.

Proof. Take $\sigma_e^2=0$ first. Write $d_{ji}=u_{j,w}-\bar u_j$ for the unit $w$ of block $j$ that receives treatment $i$. Within block $j$, $(d_{j1},\dots,d_{jv})$ is a random permutation of the $v$ deviations of that block, which have mean $0$ and population variance $\frac{v-1}{v}S_j^2$; two distinct positions of a random permutation are two draws without replacement, with covariance $-\frac{1}{v-1}\cdot\frac{v-1}{v}S_j^2=-S_j^2/v$. Blocks are randomised independently.

(1) $\bar y_{i\cdot}=\bar u+\tau_i+D_i$ with $D_i=\frac1b\sum_jd_{ji}$, $E[D_i]=0$, and $$\operatorname{Var}(D_i-D_{i'})=\frac1{b^2}\sum_j\Bigl[2\cdot\tfrac{v-1}{v}S_j^2+2\cdot\tfrac{S_j^2}{v}\Bigr]=\frac{2}{b^2}\sum_jS_j^2=\frac{2S_w^2}{b}.$$

(2) $\bar y_{i\cdot}-\bar y_{\cdot\cdot}=(\tau_i-\bar\tau)+D_i$ (note $\sum_iD_i=0$). Since $\operatorname{Var}(D_i)=\frac1{b^2}\sum_j\frac{v-1}{v}S_j^2$, $$E[\text{SSTr}]=b\sum_i(\tau_i-\bar\tau)^2+b\sum_i\operatorname{Var}(D_i)$$ $$=b\sum_i(\tau_i-\bar\tau)^2+(v-1)S_w^2.$$ The within-block sum of squares is $$\sum_{ij}(y_{ij}-\bar y_{\cdot j})^2=\sum_{ij}(\tau_i-\bar\tau+d_{ji})^2=b\sum_i(\tau_i-\bar\tau)^2+2\sum_i(\tau_i-\bar\tau)\,bD_i+b(v-1)S_w^2,$$ whose expectation is $b\sum(\tau_i-\bar\tau)^2+b(v-1)S_w^2$. Since $\text{SSE}$ is the within-block sum of squares minus SSTr, $E[\text{SSE}]=(b-1)(v-1)S_w^2$.

(3) Each block contains every treatment once, so $\bar y_{\cdot j}=\bar u_j+\bar\tau$ and $\text{SSB}=v\sum_j(\bar u_j-\bar u)^2$ is a constant. The between/within decomposition of the unit values reads $$(bv-1)S_u^2=v\sum_j(\bar u_j-\bar u)^2+b(v-1)S_w^2=\text{SSB}+b(v-1)S_w^2,$$ and with $E[\text{MSE}]=S_w^2$ this gives $E[(b-1)\text{MSB}+b(v-1)\text{MSE}]=(bv-1)S_u^2$. With technical errors, $E[\text{SSB}]$ gains $(b-1)\sigma_e^2$ and $E[\text{MSE}]$ gains $\sigma_e^2$, so the left side gains $(bv-1)\sigma_e^2$, as required; the other statements gain $\sigma_e^2$ in the same way as in Theorem 8.21. By Theorem 8.21(2), a CRD with $r=b$ would give $\operatorname{Var}=2(S_u^2+\sigma_e^2)/b$, so the ratio of variances is $(S_u^2+\sigma_e^2)/(S_w^2+\sigma_e^2)$.

(4) The numerator of $\widehat{\text{RE}}-1$ is $(b-1)\text{MSB}+b(v-1)\text{MSE}-(bv-1)\text{MSE}$, and $b(v-1)-(bv-1)=1-b$. ∎

The estimator in (3) is not the naive "pool blocks with error", $(\text{SSB}+\text{SSE})/(v(b-1))$: in a CRD on the same units the treatment line would also have absorbed unit variation, so the treatment sum of squares is replaced by its null expectation $(v-1)\text{MSE}$ and the total is divided by all $bv-1$ degrees of freedom. Blocking also costs error degrees of freedom — $(v-1)(b-1)$ instead of $v(b-1)$ — and Fisher suggested multiplying $\widehat{\text{RE}}$ by $\frac{(n_1+1)(n_2+3)}{(n_2+1)(n_1+3)}$, where $n_1,n_2$ are the error df of the RBD and the CRD, to account for the less precise estimate of $\sigma^2$. The factor is close to $1$ unless the experiment is tiny.

✏️ Example 3 — Four varieties in five blocks
Yields (kg per plot) of four varieties, one plot of each in each of five blocks laid across a field:
Block 1Block 2Block 3Block 4Block 5$T_i$
V13140283641176
V23741333748196
V33037263236161
V43843343949203
$B_j$136161121144174$G=736$
Analyse the experiment, find which varieties differ (least significant difference at $5\%$), and estimate the efficiency of the blocking.
Sums of squares $\text{CF}=736^2/20=27084.8$, $\sum y^2=27770$, $\text{SST}=685.2$. $\text{SSTr}=\frac{176^2+196^2+161^2+203^2}{5}-\text{CF}=219.6$. $\text{SSB}=\frac{136^2+161^2+121^2+144^2+174^2}{4}-\text{CF}=432.7$. $\text{SSE}=685.2-219.6-432.7=32.9$.
Table Blocks: $4$ df, $\text{MSB}=108.18$. Varieties: $3$ df, $\text{MSTr}=73.2$. Error: $12$ df, $\text{MSE}=2.742$. $F=73.2/2.742=26.7\gt F_{3,12,0.05}=3.490$ ($p\approx1.4\times10^{-5}$).
Which differ $\text{SE}(\bar y_{i\cdot}-\bar y_{i'\cdot})=\sqrt{2(2.742)/5}=1.047$, $t_{12,0.025}=2.179$, least significant difference $2.179\times1.047=2.28$. Means: V3 $32.2$, V1 $35.2$, V2 $39.2$, V4 $40.6$. All pairs differ except V2 and V4 ($1.4\lt2.28$): $\ \text{V3}\lt\text{V1}\lt\{\text{V2},\text{V4}\}$.
Efficiency $\widehat{\text{RE}}=\frac{4(108.18)+5\cdot3(2.742)}{19(2.742)}=\frac{432.7+41.1}{52.1}=9.10$. A CRD would have needed about nine times as many plots for the same precision. (With Fisher's df factor $\frac{13\cdot19}{17\cdot15}=0.969$: $8.81$.)
Ignoring blocks A one-way analysis of the same numbers has $\text{MSE}=(432.7+32.9)/16=29.1$ and $F=2.52\lt F_{3,16,0.05}=3.239$ ($p=0.095$): the varieties would not even have been declared different.
✏️ Example 4 — Prove or disprove: four claims about blocking
(a) An RBD is never less efficient than a CRD on the same units. (b) If the blocks are a random sample of blocks, the $F$-test for treatments must use a different denominator. (c) In an RBD with a random block × treatment interaction, MSE estimates $\sigma^2$. (d) In an RBD, $\operatorname{Var}(\bar y_{1\cdot}-\bar y_{2\cdot})=2\sigma^2/b$ however large the block effects are.
(a) False By Theorem 8.24(4) the estimated efficiency is below $1$ whenever $\text{MSB}\lt\text{MSE}$. With $v=4$, $b=5$, $\text{MSB}=2$, $\text{MSE}=3$: $\widehat{\text{RE}}=\frac{4\cdot2+15\cdot3}{19\cdot3}=\frac{53}{57}=0.93$. In terms of the units: if the blocks are badly chosen — e.g. laid along a fertility gradient, so that each block contains the whole range — the within-block variance $S_w^2$ exceeds $S_u^2$ and the RBD is genuinely worse (Interactive 1 shows this). Blocking also costs $b-1$ error df.
(b) False Theorem 8.23(3): only $E[\text{MSB}]$ changes; the treatment test is still $\text{MSTr}/\text{MSE}$.
(c) False Theorem 8.23(4): $E[\text{MSE}]=\sigma^2+\sigma_{\tau\beta}^2$. The treatment $F$-test is nevertheless valid, because the same extra term appears in $E[\text{MSTr}]$.
(d) True Theorem 8.23(1): the block effects cancel from every treatment contrast because each treatment meets each block exactly once. This is precisely why blocking helps: block-to-block variation, however large, never enters the comparison.

The Latin Square Design

A field often has two gradients (slope and drainage), a laboratory has two nuisance factors (operator and day), a road test has drivers and cars. A Latin square controls both at once with surprisingly few units.

📘 Definition 8.14 — Latin square and Latin square design (LSD)

A Latin square of order $v$ is a $v\times v$ array of $v$ symbols in which each symbol occurs exactly once in each row and exactly once in each column. It is standard (reduced) if its first row and first column are in natural order. In a Latin square design the $v^2$ units are classified by two nuisance factors with $v$ levels each (rows and columns), and the $v$ treatments are allotted according to a Latin square chosen at random — in practice, by taking a standard square and permuting its rows, its columns and the treatment labels at random. With $d(i,j)$ the treatment in row $i$ and column $j$, the model is $$y_{ij}=\mu+\rho_i+\gamma_j+\tau_{d(i,j)}+\varepsilon_{ij},\qquad i,j=1,\dots,v,$$ with $\sum\rho_i=\sum\gamma_j=\sum\tau_k=0$ and $\varepsilon_{ij}$ iid $N(0,\sigma^2)$ (rows, columns and treatments act additively — no interactions).

Two Latin squares of the same order are orthogonal if, when superimposed, every ordered pair of symbols occurs exactly once. There are at most $v-1$ mutually orthogonal Latin squares of order $v$, and $v-1$ exist when $v$ is a prime power; there is no pair of orthogonal Latin squares of order $2$ or $6$ (Euler's problem of the 36 officers, settled by Tarry in 1900), and there is one for every other order (Bose, Shrikhande and Parker, 1959). A superimposed pair gives a Graeco-Latin square, which controls three nuisance factors.

📐 Theorem 8.25 — Analysis of the Latin square design

With row totals $R_i$, column totals $C_j$, treatment totals $T_k$, $G=\sum y_{ij}$ and $\text{CF}=G^2/v^2$, let $$\text{SSR}=\frac{\sum R_i^2}{v}-\text{CF},\quad\text{SSC}=\frac{\sum C_j^2}{v}-\text{CF},\quad\text{SSTr}=\frac{\sum T_k^2}{v}-\text{CF},$$ and $\text{SSE}=\text{SST}-\text{SSR}-\text{SSC}-\text{SSTr}$. Then:

  1. $\text{SST}=\text{SSR}+\text{SSC}+\text{SSTr}+\text{SSE}$ is a sum of squared lengths of mutually orthogonal vectors, with degrees of freedom $$v^2-1=(v-1)+(v-1)+(v-1)+(v-1)(v-2);$$
  2. $E[\text{MSE}]=\sigma^2$, $E[\text{MSTr}]=\sigma^2+\frac{v\sum\tau_k^2}{v-1}$, and similarly for rows and columns;
  3. under normality the four sums of squares are independent, and $H_0:\tau_1=\cdots=\tau_v$ is rejected when $\text{MSTr}/\text{MSE}\gt F_{v-1,(v-1)(v-2),\alpha}$;
  4. $\bar y_{(k)}-\bar y_{(k')}$ (treatment means) is the BLUE of $\tau_k-\tau_{k'}$, with variance $2\sigma^2/v$, free of row and column effects.

Proof. Write $\bar y_{i\cdot}$, $\bar y_{\cdot j}$, $\bar y_{(k)}$ for row, column and treatment means and $\bar y$ for the grand mean, and decompose $$y_{ij}-\bar y=(\bar y_{i\cdot}-\bar y)+(\bar y_{\cdot j}-\bar y)+(\bar y_{(d(i,j))}-\bar y)+e_{ij},$$ where $e_{ij}=y_{ij}-\bar y_{i\cdot}-\bar y_{\cdot j}-\bar y_{(d(i,j))}+2\bar y$. Regard the four terms as vectors in $\mathbb R^{v^2}$ (one coordinate per cell). Orthogonality. The row and treatment arrays are orthogonal: as $j$ runs through a row $i$, $d(i,j)$ runs through every treatment exactly once, so $$\sum_{ij}(\bar y_{i\cdot}-\bar y)(\bar y_{(d(i,j))}-\bar y)=\sum_i(\bar y_{i\cdot}-\bar y)\sum_k(\bar y_{(k)}-\bar y)=0.$$ The same argument (each treatment meets each column once, each row meets each column once) gives the other two pairs. The residual array sums to zero along every row: for fixed $i$, $\sum_je_{ij}=v\bar y_{i\cdot}-v\bar y_{i\cdot}-v\bar y-v\bar y+2v\bar y=0$, because $\sum_j\bar y_{\cdot j}=v\bar y$ and $\sum_j\bar y_{(d(i,j))}=\sum_k\bar y_{(k)}=v\bar y$. It also sums to zero along every column and over the $v$ cells of every treatment, by the same computation. Hence $e$ is orthogonal to the three other arrays, which are constant on rows, on columns and on treatments respectively. Squaring and summing gives (1).

Degrees of freedom. The row arrays form a subspace of dimension $v-1$ (constant on rows, total zero), and similarly for columns and treatments; together with the constants these mutually orthogonal subspaces span a space of dimension $1+3(v-1)=3v-2$, and the residual lies in its orthogonal complement, of dimension $v^2-3v+2=(v-1)(v-2)$. Expectations. Substituting the model, every row and every column contains each treatment once, so $\bar y_{(k)}=\mu+\tau_k+\bar\varepsilon_{(k)}$: the $\rho_i$ and $\gamma_j$ average to zero. Hence $\bar y_{(k)}-\bar y=\tau_k+(\bar\varepsilon_{(k)}-\bar\varepsilon)$ and $E[\text{SSTr}]=v\sum\tau_k^2+(v-1)\sigma^2$; the residual array contains only $\varepsilon$'s (all parameters cancel), and is the residual of a linear model of rank $3v-2$, so $E[\text{SSE}]=(v-1)(v-2)\sigma^2$ (unbiased estimation of $\sigma^2$, §6.1). This gives (2) and (4) (the variance of a difference of two treatment means, each an average of $v$ independent errors, is $2\sigma^2/v$; it is the least squares estimate because the fitted values are $\bar y_{i\cdot}+\bar y_{\cdot j}+\bar y_{(k)}-2\bar y$). (3) follows from Cochran's theorem (§6.1), since the projections onto the four orthogonal subspaces have ranks adding up to $v^2-1$. ∎

The price of controlling two factors is error degrees of freedom: $(v-1)(v-2)$ is $0$ for $v=2$ (no test is possible), $2$ for $v=3$, $6$ for $v=4$ and $12$ for $v=5$. Small squares are therefore often replicated, or used only when the row and column effects are known to be large. A Graeco-Latin square of order $v$ leaves $(v-1)(v-3)$ error df. Randomisation matters here too: there are $12$ Latin squares of order $3$ (all obtainable from one by permuting rows, columns and symbols) and $576$ of order $4$, of which $4$ are standard; permuting the rows, columns and labels of the cyclic $4\times4$ square reaches only $432$ of the $576$, which is why the recipe starts from a standard square chosen at random.

📐 Theorem 8.26 — Efficiency of the Latin square design

From the ANOVA of a Latin square, the error variances that other designs on the same $v^2$ units would have had are estimated by $$\hat\sigma^2_{\text{CRD}}=\frac{\text{MSR}+\text{MSC}+(v-1)\text{MSE}}{v+1},\qquad\hat\sigma^2_{\text{RBD, rows as blocks}}=\frac{\text{MSC}+(v-1)\text{MSE}}{v},$$ and $\hat\sigma^2_{\text{RBD, columns as blocks}}=\frac{\text{MSR}+(v-1)\text{MSE}}{v}$. The relative efficiencies of the LSD are these estimates divided by MSE.

Proof (sketch). The argument of Theorem 8.24 applies with two nuisance classifications. Every row and every column contains each treatment once, so the row and column sums of squares are fixed by the units (plus technical error), while the error mean square estimates the variance of the unit values left after removing row and column means. Replace the treatment sum of squares by its null expectation $(v-1)\text{MSE}$; the table then describes the unit values alone, as in a uniformity trial. A CRD would have an error variance equal to the overall variance of the units, estimated by the whole table over all $v^2-1$ df: rows, columns, the treatment line and error contribute $$(v-1)\bigl[\text{MSR}+\text{MSC}+\text{MSE}+(v-2)\text{MSE}\bigr],$$ and dividing by $v^2-1=(v-1)(v+1)$ gives the first formula. An RBD with the rows as blocks would have an error variance equal to the within-row variance of the units. The within-row part of the table (columns, treatments, error) contributes $$(v-1)\bigl[\text{MSC}+\text{MSE}+(v-2)\text{MSE}\bigr]$$ on $v(v-1)$ df, which gives the second formula. The third is symmetric. ∎

✏️ Example 5 — Four assembly methods, four operators, four machines
Assembly times (minutes) of four methods A–D, each operator (row) using each machine (column) once, according to a randomised Latin square:
M1M2M3M4$R_i$
Op 1C 16D 17A 8B 1354
Op 2B 19C 21D 22A 1678
Op 3A 11B 17C 16D 1862
Op 4D 20A 15B 16C 1970
$C_j$66706266$G=264$
Analyse the experiment and estimate the efficiency of the Latin square relative to an RBD with operators as blocks, an RBD with machines as blocks, and a CRD.
Totals Treatments: $T_A=8+16+11+15=50$, $T_B=13+19+17+16=65$, $T_C=16+21+16+19=72$, $T_D=17+22+18+20=77$. $\text{CF}=264^2/16=4356$, $\sum y^2=4552$, $\text{SST}=196$.
Sums of squares $\text{SSR}=\frac{54^2+78^2+62^2+70^2}4-4356=80$; $\text{SSC}=\frac{66^2+70^2+62^2+66^2}4-4356=8$; $\text{SSTr}=\frac{50^2+65^2+72^2+77^2}4-4356=103.5$; $\text{SSE}=196-80-8-103.5=4.5$ on $(3)(2)=6$ df.
Table $\text{MSR}=26.67$, $\text{MSC}=2.667$, $\text{MSTr}=34.5$, $\text{MSE}=0.75$. Methods: $F=46.0\gt F_{3,6,0.05}=4.757$ ($p=0.0002$). Operators: $F=35.6$, clearly different; machines: $F=3.56\lt4.757$. Method means $12.5,\ 16.25,\ 18,\ 19.25$ with $\text{SE}$ of a difference $\sqrt{2(0.75)/4}=0.61$: method A is fastest by a wide margin.
Efficiencies Relative to an RBD with operators (rows) as blocks: $\frac{2.667+3(0.75)}{4(0.75)}=1.64$ — controlling machines as well gained $64\%$. Relative to an RBD with machines as blocks: $\frac{26.67+2.25}{3}=9.64$. Relative to a CRD: $\frac{26.67+2.667+2.25}{5(0.75)}=8.42$. The operators were the important nuisance factor.
Interactive 1 — Four Designs on One Field: What Local Control Buys

Sixteen plots on a slope: fertility rises strongly down the field (rows) and slightly across it (columns), plus a little plot-to-plot irregularity. Four treatments with true effects A $0$, B $1$, C $2$, D $3$ are compared. Every run re-randomises all four designs on the same plots, adds measurement noise and records the estimate of $\tau_D-\tau_A$ (true value $3$). Watch the four clouds of estimates: all are centred on $3$ (randomisation ⇒ unbiased), but their spreads differ enormously. Choose which design's field and ANOVA to display.

runs—
this run: D − A—
this run: F (5% point)—
SD of estimates: CRD · RBD-rows · RBD-cols · LSD—
✏️ Example 6 — Prove or disprove: Latin squares
(a) Every Latin square of order $3$ can be obtained from the cyclic square by permuting rows, columns and symbols, and there are exactly $12$ of them. (b) An LSD of order $v$ leaves $(v-1)(v-2)$ error degrees of freedom, so for $v=2$ no test of treatments is possible. (c) A $5\times5$ Latin square design can be used to compare four treatments if one treatment letter is used twice in each row. (d) If operators and methods interact in Example 5, MSE still estimates $\sigma^2$.
(a) True A Latin square of order $3$ is fixed once its first row and first column are known: the first row is any of $3!=6$ permutations; the first column must start with the same symbol and has $2$ choices for the rest; then each remaining cell is the unique symbol missing from its row and column. So there are $6\cdot2=12$ squares, of which $1$ is standard. Permuting the symbols of the cyclic square gives all $6$ first rows, and swapping its last two rows gives the second first column, so all $12$ arise.
(b) True Theorem 8.25. With $v=2$, $\text{SSE}\equiv0$: every observation is fitted exactly by the $1+3=4$ parameters that are estimable.
(c) False Then some letter appears twice in a row, so treatments are not balanced against rows: the row and treatment arrays are no longer orthogonal, the simple totals of Theorem 8.25 are wrong, and the design is not a Latin square. A Latin square needs as many treatments as rows and columns. (Designs with fewer treatments than rows exist — Youden squares, incomplete Latin squares — but they are analysed differently, §8.4.)
(d) False The model assumes no interactions. If $\gamma$ terms for operator × method are present, the residual array contains them (they are not removed by row, column or treatment means), so $E[\text{MSE}]\gt\sigma^2$ and the tests lose power; worse, the interaction can bias the column comparison because the method–operator combinations are confounded with machines. The LSD buys its economy by assuming additivity.

Missing Plots

A plot is flooded, a patient drops out, a sample is spilled. The design is then unbalanced, its neat orthogonality is gone, and the simple formulae no longer apply. The general remedy is to refit the linear model to the available data (§6.1). Yates (1933) showed that, for one missing value, the same answer is obtained by a trick that keeps the hand formulae: insert the value that makes the error sum of squares as small as possible, analyse the completed table, and make two small corrections.

📐 Theorem 8.27 — The missing-plot principle

In a linear model $y=X\beta+\varepsilon$ suppose one observation, in cell $m$ with design row $x_m^{\mathsf T}$, is missing. For a trial value $x$ let $\text{SSE}(x)$ be the residual sum of squares of the completed data (the available data together with $x$ in cell $m$). Then:

  1. $\text{SSE}(x)\ge\text{RSS}_{\text{avail}}$, the residual sum of squares of the least squares fit to the available data, with equality exactly at $\hat x=x_m^{\mathsf T}\hat\beta$, the fitted value of the missing cell from that fit;
  2. the least squares estimates from the completed data with $x=\hat x$ coincide with those from the available data, and the error degrees of freedom are one fewer than for complete data;
  3. for any submodel $H$ (a hypothesis), the residual sum of squares $\text{SSE}_0(\hat x)$ of the completed data under $H$ is at least the correct $\text{RSS}_{0,\text{avail}}$, and it exceeds it by $\text{SSE}_0(\hat x)-\text{SSE}_0(\hat x_0)$, where $\hat x_0$ is the missing-plot value under $H$. Hence the hypothesis sum of squares computed from the completed table is biased upwards by that amount.

Proof. Let $Q(\beta,x)=\sum_{w\ne m}(y_w-x_w^{\mathsf T}\beta)^2+(x-x_m^{\mathsf T}\beta)^2$ be the residual sum of squares of the completed data at the parameter $\beta$. For fixed $\beta$ the last term is minimised (made zero) by $x=x_m^{\mathsf T}\beta$, so $\min_xQ(\beta,x)=R(\beta)$, the available-data residual sum of squares at $\beta$. Therefore $$\min_{\beta,x}Q=\min_\beta R(\beta)=\text{RSS}_{\text{avail}},$$ attained at $\beta=\hat\beta$ and $x=x_m^{\mathsf T}\hat\beta$. Now $\text{SSE}(x)=\min_\beta Q(\beta,x)\ge\min_{\beta,x}Q=\text{RSS}_{\text{avail}}$, with equality when $x=\hat x$ (take $\beta=\hat\beta$). If $\text{SSE}(x)=\text{RSS}_{\text{avail}}$ for some $x$, a minimising $\beta$ gives $R(\beta)\le Q(\beta,x)=\text{RSS}_{\text{avail}}$, so $\beta$ is a least squares solution for the available data; when the fitted value of cell $m$ is the same for all such solutions (i.e. $x_m^{\mathsf T}\beta$ is estimable from the available data, which holds whenever the missing value can be estimated at all), $Q(\beta,x)=\text{RSS}_{\text{avail}}$ forces $x=x_m^{\mathsf T}\beta=\hat x$. This proves (1); and since $Q(\hat\beta,\hat x)$ is the minimum of $Q(\cdot,\hat x)$, $\hat\beta$ is a least squares solution of the completed problem, which is (2). The completed table has one fictitious observation that carries no information, so one error degree of freedom must be removed. (3) Apply (1) to the submodel: $\text{SSE}_0(x)\ge\text{RSS}_{0,\text{avail}}=\text{SSE}_0(\hat x_0)$ for every $x$, in particular for $x=\hat x$. The correct hypothesis sum of squares is $\text{RSS}_{0,\text{avail}}-\text{RSS}_{\text{avail}}=\text{SSE}_0(\hat x_0)-\text{SSE}(\hat x)$, while the completed table gives $\text{SSE}_0(\hat x)-\text{SSE}(\hat x)$. ∎

📐 Theorem 8.28 — One missing value in an RBD or an LSD
  1. (RBD, Yates.) If the observation of treatment $i$ in block $j$ is missing and $T$, $B$, $G$ are the totals of the available observations of that treatment, that block and the whole experiment, then $$\hat x=\frac{vT+bB-G}{(v-1)(b-1)}.$$ The error df become $(v-1)(b-1)-1$, the treatment sum of squares of the completed table must be reduced by $$\text{bias}=\frac{\bigl[B-(v-1)\hat x\bigr]^2}{v(v-1)},$$ and $\operatorname{Var}(\hat\tau_i-\hat\tau_{i'})=\sigma^2\left[\frac2b+\frac{v}{b(b-1)(v-1)}\right]$ for the treatment with the missing value against any other.
  2. (LSD.) If the observation in row $i$, column $j$ is missing and $R$, $C$, $T$, $G$ are the available totals of that row, column, treatment and the whole square, then $$\hat x=\frac{v(R+C+T)-2G}{(v-1)(v-2)},$$ the error df become $(v-1)(v-2)-1$, and the treatment sum of squares must be reduced by $\dfrac{\bigl[G-R-C-(v-1)T\bigr]^2}{(v-1)^2(v-2)^2}$.

Proof. (RBD) By Theorem 8.27(1), $\hat x$ equals its own fitted value in the completed table, which for the additive model is $\bar y_{i\cdot}+\bar y_{\cdot j}-\bar y_{\cdot\cdot}$ computed with $\hat x$ included: $$\hat x=\frac{T+\hat x}{b}+\frac{B+\hat x}{v}-\frac{G+\hat x}{bv}.$$ Multiplying by $bv$: $\hat x\,(bv-v-b+1)=vT+bB-G$, and $bv-v-b+1=(v-1)(b-1)$. For the bias use Theorem 8.27(3) with $H$: no treatment effects. Under $H$ the model is "blocks only", whose missing-plot value is the mean of the other $v-1$ plots of block $j$, $\hat x_0=B/(v-1)$, and whose residual sum of squares is the within-block sum of squares. As a function of the entry $x$ of block $j$, the within-block sum of squares of that block is $\sum(y-\bar y_{\cdot j})^2$, a quadratic in $x$ with leading coefficient $1-\frac1v$ (the entry $x$ enters with coefficient $1-\frac1v$ in its own deviation and $-\frac1v$ in the $v-1$ others), minimised at $\hat x_0$. So $$\text{SSE}_0(\hat x)-\text{SSE}_0(\hat x_0)=\frac{v-1}{v}\Bigl(\hat x-\frac B{v-1}\Bigr)^2=\frac{\bigl[(v-1)\hat x-B\bigr]^2}{v(v-1)}.$$ The variance formula follows by inverting the normal equations for the incomplete layout (Exercise IV.6 asks for a check of a special case). (LSD) The fitted value is $\bar y_{i\cdot}+\bar y_{\cdot j}+\bar y_{(k)}-2\bar y$, so $$\hat x=\frac{R+\hat x}{v}+\frac{C+\hat x}{v}+\frac{T+\hat x}{v}-\frac{2(G+\hat x)}{v^2};$$ multiplying by $v^2$ gives $\hat x(v^2-3v+2)=v(R+C+T)-2G$. The bias is obtained from Theorem 8.27(3) with the submodel "rows and columns only", by the same kind of computation. ∎

The bias is zero when the missing-plot value under $H$ happens to equal $\hat x$; otherwise ignoring it inflates $F$. With several missing values one solves the equations $\partial\,\text{SSE}/\partial x_l=0$ simultaneously (or iterates the one-value formula, each time treating the other estimates as data), and removes one error df for each — but with modern software one simply fits the model to the available data.

✏️ Example 7 — A flooded plot
In Example 3 the plot of variety V2 in block 3 (yield $33$) was flooded and its yield lost. Estimate the missing value, carry out the corrected analysis, and give the standard error of $\hat\tau_{V2}-\hat\tau_{V1}$.
Totals Available totals: $T=196-33=163$ (V2), $B=121-33=88$ (block 3), $G=736-33=703$. With $v=4$, $b=5$: $$\hat x=\frac{4(163)+5(88)-703}{3\cdot4}=\frac{389}{12}=32.42.$$ (The lost value was $33$; the estimate uses only the other $19$ plots.)
Completed table With $32.42$ inserted: $\text{SST}=689.96$, $\text{SSB}=440.41$, $\text{SSTr}=216.85$, $\text{SSE}=32.70$, now on $12-1=11$ df: $\text{MSE}=2.972$.
Bias correction $\text{bias}=\frac{[88-3(32.42)]^2}{4\cdot3}=\frac{(-9.25)^2}{12}=7.13$, so the corrected treatment SS is $216.85-7.13=209.72$, $\text{MSTr}=69.91$ and $F=69.91/2.972=23.5\gt F_{3,11,0.05}=3.587$. (A least squares fit to the $19$ available plots gives exactly $\text{RSS}=32.70$ and treatment SS $209.72$, as Theorem 8.27 promises.)
Standard error $\operatorname{Var}(\hat\tau_{V2}-\hat\tau_{V1})=\sigma^2\left[\frac25+\frac{4}{5\cdot4\cdot3}\right]=0.4667\sigma^2$, so $\text{SE}=\sqrt{0.4667\times2.972}=1.18$, against $1.05$ with no missing value. The estimated mean of V2 is $(163+32.42)/5=39.08$.
Interactive 2 — The Missing Plot: Minimise the Error Sum of Squares

The table is Example 3. Choose which plot is "lost". The graph shows the error sum of squares of the completed table as the trial value $x$ in the empty cell varies: a parabola whose lowest point is Yates' estimate $\hat x=(vT+bB-G)/((v-1)(b-1))$. Press Play to slide a trial value along the curve. The true (hidden) yield is marked for comparison. The curvature is always $(v-1)(b-1)/(vb)=0.6$.

T · B · G (available)—
trial x · SSE(x)—
Yates x̂ · SSE(x̂)—
true value · bias of treatment SS—
🧭 Problem-solving strategy — analysing a classical design
  1. Identify the design from how the randomisation was restricted: none (CRD), within blocks (RBD), within rows and columns (LSD). The analysis must remove exactly the classifications the randomisation respected.
  2. Degrees of freedom first. CRD: $v-1$, $N-v$. RBD: $b-1$, $v-1$, $(v-1)(b-1)$. LSD: $3\times(v-1)$ and $(v-1)(v-2)$. Subtract one error df per missing value.
  3. Totals and the correction factor $\text{CF}=G^2/N$; each classification's SS is $\sum(\text{total})^2/(\text{number of plots in it})-\text{CF}$; error by subtraction.
  4. Missing value? Estimate it by the formula (RBD: $\frac{vT+bB-G}{(v-1)(b-1)}$; LSD: $\frac{v(R+C+T)-2G}{(v-1)(v-2)}$), complete the table, reduce the error df, and subtract the bias from the treatment SS.
  5. Efficiency: replace the treatment line by $(v-1)\text{MSE}$ and pool what the other design would not have removed — RBD vs CRD: $\frac{(b-1)M_b+b(v-1)M_e}{(bv-1)M_e}$.
⚠️ Counterexamples and pitfalls
  1. Randomisation does not reduce variance. It removes bias and makes the error mean square honest (Theorem 8.21); precision comes from replication and local control.
  2. Blocking can hurt. $\widehat{\text{RE}}\lt1$ whenever $\text{MSB}\lt\text{MSE}$ (e.g. $53/57$ in Example 4), and blocks laid along a gradient make the RBD genuinely worse than a CRD (Interactive 1, blocks = columns). Blocking always costs $b-1$ error df.
  3. The efficiency formula is not "pool blocks with error". RBD vs CRD is $\frac{(b-1)M_b+b(v-1)M_e}{(bv-1)M_e}$, not $\frac{\text{SSB}+\text{SSE}}{v(b-1)M_e}$: the treatment line is replaced by $(v-1)M_e$ and all $bv-1$ df are used.
  4. A $2\times2$ Latin square has no error df, a $3\times3$ only $2$; $(v-1)(v-2)$ grows slowly.
  5. No orthogonal pair of Latin squares of order $6$ (or $2$), although there are pairs for all other orders; for prime powers $v$ there are $v-1$ mutually orthogonal squares.
  6. An LSD needs as many treatments as rows and columns and assumes no interactions; a row × treatment interaction inflates MSE and can bias other comparisons.
  7. Each treatment once per block is not enough. Without independent randomisation within blocks (e.g. always in the order A, B, C, D along the row) a within-block trend biases the comparison, and Theorem 8.24 fails.
  8. Missing plots: two corrections are mandatory. Remove one error df per missing value, and subtract the upward bias $[B-(v-1)\hat x]^2/(v(v-1))$ from the treatment SS; the estimated value is not a datum.
  9. After a missing value the simple means are not the estimates. $\bar y_{i\cdot}$ of the available plots is biased by the block effects; use the completed means (or least squares), and the larger variance $\sigma^2[\frac2b+\frac{v}{b(b-1)(v-1)}]$.
  10. Pseudo-replication. Measuring one plot four times gives four numbers but one experimental unit: subsamples estimate measurement error, not the experimental error against which treatments must be compared.
  11. Random blocks change only the blocks line. With an additive model (or the unrestricted random interaction), the treatment test is $\text{MSTr}/\text{MSE}$ whether blocks are fixed or random.

Exercises

I
Principles and the completely randomised design.
  • 1 For each principle — randomisation, replication, local control — describe a realistic experiment that violates it and say what goes wrong.
  • 2 A CRD has $5$ treatments with $6,6,5,5,4$ replicates. Write down the sources and degrees of freedom of its ANOVA table.
  • 3 How many different allocations are possible in a CRD with $v=3$ treatments and $r=2$ units each? With $v=4$, $r=5$?
  • 4 Analyse the CRD with responses: treatment 1: $8,10,9$; treatment 2: $12,14,13,13$; treatment 3: $9,11,10$.
  • 5 Prove that, for a fixed total $N$, equal replication minimises the largest variance of an elementary contrast $\bar y_i-\bar y_{i'}$ (not only the average).
  • 6 One control and $9$ test treatments are to be compared on $120$ units. Find the square-root allocation and its efficiency relative to equal replication for the control comparisons.
  • 7 With $\sigma=2.5$, how many replicates per treatment are needed to detect a difference of $3$ units with a two-sided $5\%$ test and power $80\%$ (normal approximation)?
  • 8 Four units have unit values $1,2,3,6$, and two treatments with no effect ($\tau_A=\tau_B$) are allotted by a CRD with $r=2$. List all allocations, the distribution of $\bar y_A-\bar y_B$, and verify Theorem 8.21(2).
1 Randomisation: a doctor gives a new drug to the patients she judges most likely to cope — the treatment effect is confounded with prognosis, and no analysis can separate them. Replication: one cow per diet — the diet difference is confounded with the cow, and there is no error estimate. Local control: varieties on a field with a strong slope in a CRD — unbiased but so imprecise that real differences are missed (Example 3, last step).
2 $N=26$: treatments $4$, error $26-5=21$, total $25$.
3 $\frac{6!}{(2!)^3}=90$. $\frac{20!}{(5!)^4}=11\,732\,745\,024\approx1.17\times10^{10}$.
4 $G=109$, $N=10$, $\text{CF}=1188.1$, $\sum y^2=1225$, $\text{SST}=36.9$; $\text{SSTr}=\frac{27^2}3+\frac{52^2}4+\frac{30^2}3-1188.1=30.9$; $\text{SSE}=6.0$ on $7$ df ($\text{MSE}=0.857$). $F=15.45/0.857=18.0\gt F_{2,7,0.05}=4.737$ ($p=0.0017$). Means $9,\ 13,\ 10$: treatment 2 stands out.
5 Let $r_{(1)}\le r_{(2)}$ be the two smallest replications; the largest variance is $\sigma^2\bigl(\frac1{r_{(1)}}+\frac1{r_{(2)}}\bigr)$. All other $r_i$ are $\ge r_{(2)}$, so $N\ge r_{(1)}+(v-1)r_{(2)}$, i.e. $\frac1{r_{(2)}}\ge\frac{v-1}{N-r_{(1)}}$. Hence the maximum is at least $\sigma^2g(r_{(1)})$ with $g(t)=\frac1t+\frac{v-1}{N-t}$. Now $g'(t)=-\frac1{t^2}+\frac{v-1}{(N-t)^2}\lt0$ for $t\lt N/(1+\sqrt{v-1})$, and $r_{(1)}\le N/v\le N/(1+\sqrt{v-1})$ (the smallest is at most the average; $v\ge1+\sqrt{v-1}$). So $g(r_{(1)})\ge g(N/v)=\frac vN+\frac vN=\frac{2v}N$, which equal replication attains.
6 $m=9$: $r_0=3r$, $3r+9r=120$, $r=10$, $r_0=30$; variance $\sigma^2(\frac1{30}+\frac1{10})=0.1333\sigma^2=(1+3)^2\sigma^2/120$. Equal replication ($12$ each): $\frac{2}{12}\sigma^2=0.1667\sigma^2$. Efficiency $1.25$.
7 $r\ge\frac{2(6.25)(1.960+0.842)^2}{9}=10.9$, so $11$ replicates.
8 The $\binom42=6$ allocations give A the pairs $\{1,2\},\{1,3\},\{1,6\},\{2,3\},\{2,6\},\{3,6\}$ and $\bar y_A-\bar y_B=-3,\ -2,\ 1,\ -1,\ 2,\ 3$. Mean $0$ (unbiased); variance $\frac{9+4+1+1+4+9}{6}=\frac{28}6=4.667$. Theorem 8.21: $\bar u=3$, $S_u^2=\frac{4+1+0+9}{3}=\frac{14}3$, and $2S_u^2/r=14/3=4.667$ ✓.
II
Randomised blocks.
  • 1 Give the ANOVA sources and degrees of freedom of an RBD with $6$ treatments in $4$ blocks.
  • 2 Analyse the RBD (rows treatments, columns blocks): T1: $10,12,9,13$; T2: $14,15,13,16$; T3: $11,14,10,13$. Estimate the efficiency relative to a CRD.
  • 3 Show directly from the model that $E[\bar y_{1\cdot}-\bar y_{2\cdot}]=\tau_1-\tau_2$ in an RBD, but that $E[\bar y_{\cdot1}-\bar y_{\cdot2}]$ also involves no treatment effects. Which property of the design is responsible?
  • 4 An RBD with $v=5$ treatments and $b=4$ blocks has $\text{MSB}=40$ and $\text{MSE}=8$. Estimate its efficiency relative to a CRD.
  • 5 In an RBD with random blocks, give an unbiased estimator of $\sigma_b^2$ and of the correlation between two plots of the same block. Evaluate them for Exercise II.2, treating the blocks as random.
  • 6 Explain why, with one observation per cell, the block × treatment interaction cannot be tested in an RBD, and why the treatment test is still valid when the blocks are random (unrestricted model).
  • 7 In an RBD with $v=4$ treatments and $b=6$ blocks one value is missing; the available totals are $T=120$ (its treatment), $B=60$ (its block) and $G=545$. Estimate it.
  • 8 Two values are missing in an RBD, in different treatments and different blocks: $x$ (treatment $i$, block $j$) and $z$ (treatment $i'$, block $j'$). Show that minimising the error sum of squares leads to $(v-1)(b-1)x+z=vT_i+bB_j-G$ and $x+(v-1)(b-1)z=vT_{i'}+bB_{j'}-G$, where all totals are of available values.
1 Blocks $3$, treatments $5$, error $15$, total $23$.
2 $T=44,58,48$; $B=35,41,32,42$; $G=150$, $\text{CF}=1875$, $\sum y^2=1926$, $\text{SST}=51$; $\text{SSTr}=\frac{44^2+58^2+48^2}4-1875=26$; $\text{SSB}=\frac{35^2+41^2+32^2+42^2}3-1875=23$; $\text{SSE}=2$ on $6$ df, $\text{MSE}=0.333$. Treatments: $F=13/0.333=39\gt F_{2,6,0.05}=5.14$. Blocks: $F=7.667/0.333=23$. $\widehat{\text{RE}}=\frac{3(7.667)+4\cdot2(0.333)}{11(0.333)}=\frac{25.67}{3.667}=7.0$.
3 $\bar y_{1\cdot}-\bar y_{2\cdot}=\tau_1-\tau_2+\bar\varepsilon_{1\cdot}-\bar\varepsilon_{2\cdot}$ because both averages contain every $\beta_j$ once. Likewise $\bar y_{\cdot1}-\bar y_{\cdot2}=\beta_1-\beta_2+\bar\varepsilon_{\cdot1}-\bar\varepsilon_{\cdot2}$: each block contains every treatment once. The responsible property is orthogonality (every treatment–block combination occurs equally often; §8.4 makes it general).
4 $\frac{3(40)+4\cdot4(8)}{19(8)}=\frac{248}{152}=1.63$.
5 $E[\text{MSB}]=\sigma^2+v\sigma_b^2$ and $E[\text{MSE}]=\sigma^2$ give $\hat\sigma_b^2=(\text{MSB}-\text{MSE})/v$ (unbiased, possibly negative) and $\hat\rho=\hat\sigma_b^2/(\hat\sigma_b^2+\text{MSE})$ (not unbiased — a ratio). For II.2: $\hat\sigma_b^2=(7.667-0.333)/3=2.444$, $\hat\rho=2.444/2.778=0.88$.
6 With $n=1$ per cell the interaction array $y_{ij}-\bar y_{i\cdot}-\bar y_{\cdot j}+\bar y_{\cdot\cdot}$ is the residual; nothing is left to estimate $\sigma^2$ separately, so the interaction and error lines coincide. In the unrestricted mixed model $E[\text{MSE}]=\sigma^2+\sigma_{\tau\beta}^2$ and $E[\text{MSTr}]=\sigma^2+\sigma_{\tau\beta}^2+bQ_\tau$ (Theorem 8.23(4)), so the ratio is still $F$ under $H_0$. (Tukey's one-degree-of-freedom test detects only interaction of the form $\lambda\tau_i\beta_j$, §6.2.)
7 $\hat x=\frac{4(120)+6(60)-545}{3\cdot5}=\frac{295}{15}=19.67$.
8 By Theorem 8.27 each estimate equals its own fitted value in the completed table. For $x$: $x=\frac{T_i+x}{b}+\frac{B_j+x}{v}-\frac{G+x+z}{bv}$ ($z$ is in neither treatment $i$ nor block $j$, but it is in the grand total). Multiplying by $bv$: $(v-1)(b-1)x=vT_i+bB_j-G-z$. The equation for $z$ is symmetric. Solve the $2\times2$ system (and remove two error df).
III
Latin squares.
  • 1 Write the ANOVA sources and df of a $6\times6$ Latin square design.
  • 2 Show that a Latin square design of order $v$ has fewer error df than an RBD with $v$ treatments in $v$ blocks, and find the difference.
  • 3 Write down the four standard Latin squares of order $4$.
  • 4 Write a cyclic $5\times5$ Latin square and describe a randomisation of it for an experiment with $5$ drivers (rows), $5$ cars (columns) and $5$ fuel additives.
  • 5 In a $5\times5$ LSD, $\text{MSR}=30$, $\text{MSC}=12$ and $\text{MSE}=6$. Estimate the efficiency of the LSD relative to a CRD, to an RBD with rows as blocks and to an RBD with columns as blocks.
  • 6 In Example 5 the observation of operator 2 on machine 4 (method A, $16$) is lost. Estimate it, and give the corrected treatment and error sums of squares.
  • 7 Construct a $3\times3$ Graeco-Latin square, and show that a Graeco-Latin square design of order $v$ leaves $(v-1)(v-3)$ error df.
  • 8 Prove that two Latin squares of order $v$ cannot be orthogonal if one is obtained from the other by permuting the symbols only.
1 Rows $5$, columns $5$, treatments $5$, error $5\cdot4=20$, total $35$.
2 RBD: $(v-1)^2$ error df; LSD: $(v-1)(v-2)$. The difference is $v-1$ — the column line.
3 Rows written as strings: $\{1234,2143,3412,4321\}$, $\{1234,2143,3421,4312\}$, $\{1234,2341,3412,4123\}$, $\{1234,2413,3142,4321\}$. (The first is the table of the Klein four-group; the others are isotopic to the cyclic group.)
4 Row $i$ is $A,B,C,D,E$ shifted $i-1$ places: $ABCDE$, $BCDEA$, $CDEAB$, $DEABC$, $EABCD$. Randomise: permute the five rows by a random permutation (drivers), the five columns by another (cars), and assign the additives to the letters A–E at random. (For order 5 one would ideally first pick one of the $56$ standard squares at random.)
5 CRD: $\frac{30+12+4(6)}{6\cdot6}=\frac{66}{36}=1.83$. RBD with rows as blocks (columns not removed): $\frac{12+24}{5\cdot6}=1.20$. RBD with columns as blocks: $\frac{30+24}{30}=1.80$.
6 Available totals: $R=78-16=62$, $C=66-16=50$, $T_A=50-16=34$, $G=264-16=248$. $\hat x=\frac{4(62+50+34)-2(248)}{3\cdot2}=\frac{88}{6}=14.67$ (true $16$). Error SS of the completed square $3.83$ on $5$ df. Treatment SS of the completed square $114.50$, bias $\frac{[248-62-50-3(34)]^2}{36}=\frac{34^2}{36}=32.11$, corrected treatment SS $82.39$ (a least squares fit to the $15$ available values agrees).
7 Superimpose $\{ABC,BCA,CAB\}$ and $\{\alpha\beta\gamma,\gamma\alpha\beta,\beta\gamma\alpha\}$: cells $A\alpha,B\beta,C\gamma\,/\,B\gamma,C\alpha,A\beta\,/\,C\beta,A\gamma,B\alpha$ — each Latin–Greek pair once. Four classifications of $v-1$ df each: $v^2-1-4(v-1)=(v-1)(v-3)$, which is $0$ for $v=3$.
8 If $L_2=\pi(L_1)$ for a permutation $\pi$ of the symbols, superimposing gives only the pairs $(s,\pi(s))$ — $v$ pairs instead of $v^2$ — so for $v\ge2$ most pairs never occur.
IV
Proofs, efficiency and design choices.
  • 1 In a CRD with $N=vr$, prove $\operatorname{Cov}(\bar u_i,\bar u_{i'})=-S_u^2/N$ by computing the covariance of two draws from the same random permutation directly (without the constant-sum trick).
  • 2 Show that $\widehat{\text{RE}}$ of an RBD with respect to a CRD equals $1+\frac{(b-1)(F_B-1)}{bv-1}$, where $F_B=\text{MSB}/\text{MSE}$, and compute it for Example 3.
  • 3 An experimenter has $4$ treatments and $3$ plots per treatment in a CRD, and measures each plot $4$ times. A colleague reports an error mean square with $44$ df. Explain the mistake and give the correct error df for testing treatments.
  • 4 (Modelling.) A field of $25$ plots has a fertility gradient from east to west and a drainage gradient from north to south. Five fertilisers are to be compared. Recommend a design, give its ANOVA df, and describe the randomisation.
  • 5 In an RBD with a missing value, show that $\text{SSE}(x)=\text{SSE}(\hat x)+\frac{(v-1)(b-1)}{vb}(x-\hat x)^2$.
  • 6 For an RBD with $v=2$ treatments, $b$ blocks and the value of treatment 1 in block 1 missing, show that the least squares estimate of $\tau_1-\tau_2$ is the mean of the $b-1$ complete within-block differences, and verify the variance formula of Theorem 8.28.
1 Let $U_1,U_2$ be the unit values at two fixed distinct positions of a uniformly random ordering of the $N$ units. Then $E[U_1U_2]=\frac1{N(N-1)}\sum_{w\ne w'}u_wu_{w'}=\frac{(\sum u_w)^2-\sum u_w^2}{N(N-1)}$, so $\operatorname{Cov}(U_1,U_2)=-\frac{\sum(u_w-\bar u)^2}{N(N-1)}=-\frac{S_u^2}{N}$. $\bar u_i$ and $\bar u_{i'}$ are averages of $r$ such positions each, all distinct, so $\operatorname{Cov}(\bar u_i,\bar u_{i'})=\frac{r^2}{r^2}\operatorname{Cov}(U_1,U_2)=-S_u^2/N$.
2 Divide numerator and denominator of $\widehat{\text{RE}}$ by MSE: $\frac{(b-1)F_B+b(v-1)}{bv-1}=1+\frac{(b-1)F_B-(b-1)}{bv-1}$. Example 3: $F_B=39.46$, $1+\frac{4(38.46)}{19}=9.10$ ✓.
3 The plot is the experimental unit; the $4$ measurements per plot are subsamples. $44=4\cdot3\cdot4-4$ treats the $48$ measurements as independent units. The correct error for treatments is plots within treatments: $4(3-1)=8$ df (the remaining $36$ df measure within-plot variation). Using $44$ df overstates the evidence — pseudo-replication.
4 A $5\times5$ Latin square with rows north–south and columns east–west strips, so that each fertiliser appears once in every row and every column. df: rows $4$, columns $4$, fertilisers $4$, error $12$, total $24$. Randomise by permuting rows, columns and fertiliser labels of a (randomly chosen) standard square.
5 $\text{SSE}(x)$ is a quadratic in $x$ minimised at $\hat x$ (Theorem 8.27), so it suffices to find the coefficient of $x^2$. In $\text{SST}-\text{SSTr}-\text{SSB}$ the entry $x$ contributes $x^2-\frac{x^2}{bv}$, $-\frac{x^2}{b}+\frac{x^2}{bv}$ and $-\frac{x^2}{v}+\frac{x^2}{bv}$, total $x^2\left(1-\frac1b-\frac1v+\frac1{bv}\right)=\frac{(v-1)(b-1)}{vb}x^2$. (In Example 7: $0.6$, the curvature in Interactive 2.)
6 With $v=2$ the model for block $j$ says $y_{1j}-y_{2j}=\tau_1-\tau_2+(\varepsilon_{1j}-\varepsilon_{2j})$, and block 1, containing only $y_{21}$, carries no information on $\tau_1-\tau_2$ (it only estimates its own $\beta_1$). So the least squares estimate is the mean of the $b-1$ differences, with variance $\frac{2\sigma^2}{b-1}$. Theorem 8.28: $\sigma^2\left[\frac2b+\frac{2}{b(b-1)}\right]=\frac{2\sigma^2(b-1)+2\sigma^2}{b(b-1)}=\frac{2\sigma^2}{b-1}$ ✓.
🎯 Exam corner CSIR Part BCSIR Part CGATE ST

E1. CSIR Part B GATE ST Six treatments are compared in a $6\times6$ Latin square design. The number of degrees of freedom for error is (A) $25$; (B) $20$; (C) $30$; (D) $24$.

Idea $v^2-1=35$ total df; rows, columns and treatments take $5$ each.
Options $35-15=20=(v-1)(v-2)$. (A) $25=(v-1)^2$ is the RBD error with $6$ blocks; (C) $30$ removes only one classification; (D) $24$ has no derivation.
Answer (B).

E2. CSIR Part B In a randomised block design with $5$ treatments and $4$ blocks, one observation is missing. The totals of the available observations of its treatment, of its block and of the whole experiment are $46$, $68$ and $330$. The missing-plot estimate is (A) $8.60$; (B) $14.33$; (C) $16.17$; (D) $57.33$.

Formula $\hat x=\frac{vT+bB-G}{(v-1)(b-1)}$ with $v=5$, $b=4$: $\frac{230+272-330}{4\cdot3}=\frac{172}{12}=14.33$.
Distractors (A) divides by $vb=20$; (C) swaps $v$ and $b$: $\frac{5(68)+4(46)-330}{12}=16.17$; (D) divides by $b-1$ only.
Answer (B).

E3. CSIR Part B GATE ST An RBD with $4$ treatments in $5$ blocks gives block mean square $26$ and error mean square $4$. The estimated efficiency of this design relative to a completely randomised design is closest to (A) $6.50$; (B) $2.38$; (C) $2.16$; (D) $1.37$.

Formula $\frac{(b-1)M_b+b(v-1)M_e}{(bv-1)M_e}=\frac{4(26)+15(4)}{19(4)}=\frac{164}{76}=2.158$.
Distractors (A) is $M_b/M_e$, the block $F$; (B) is the naive pooling $\frac{\text{SSB}+\text{SSE}}{v(b-1)M_e}=\frac{104+48}{16\cdot4}=2.375$; (D) has no derivation.
Answer (C).

E4. CSIR Part C Consider an experiment with $v$ treatments. Which of the following statements are true? (One or more options may be correct.) (A) In an RBD with $b$ blocks the error has $(v-1)(b-1)$ degrees of freedom. (B) The estimated efficiency of an RBD relative to a CRD exceeds $1$ if and only if the block mean square exceeds the error mean square. (C) Under the randomisation model of a CRD with unit–treatment additivity, the treatment means $\bar y_1,\dots,\bar y_v$ are uncorrelated. (D) In an RBD with random blocks and a random block × treatment interaction (unrestricted model), $\text{MSTr}/\text{MSE}$ has an exact $F$ distribution when there are no treatment effects.

(A) True $bv-1-(b-1)-(v-1)=(v-1)(b-1)$.
(B) True $\widehat{\text{RE}}-1=\frac{(b-1)(\text{MSB}-\text{MSE})}{(bv-1)\text{MSE}}$ (Theorem 8.24(4)).
(C) False The groups are disjoint samples from the same finite set of units, so $\operatorname{Cov}(\bar y_i,\bar y_{i'})=-S_u^2/N\ne0$ unless all unit values are equal (Theorem 8.21's proof). Uncorrelated means belong to the normal-theory model, not to the randomisation model.
(D) True Theorem 8.23(4): both mean squares contain $\sigma^2+\sigma_{\tau\beta}^2$, and in the balanced layout they are independent scaled $\chi^2$ variables.
Answer (A), (B) and (D).

E5. CSIR Part C Which of the following statements about Latin squares are true? (One or more options may be correct.) (A) A $2\times2$ Latin square design leaves no degrees of freedom for error. (B) There exist four mutually orthogonal Latin squares of order $5$. (C) There exists a pair of orthogonal Latin squares of order $6$. (D) There are exactly $6$ Latin squares of order $3$.

(A) True $(v-1)(v-2)=0$ for $v=2$.
(B) True $5$ is prime, so the squares $L_c(i,j)=ci+j\pmod5$, $c=1,2,3,4$, are Latin and mutually orthogonal: $L_c$ and $L_{c'}$ superimposed give the pair $(ci+j,\,c'i+j)$, and the map $(i,j)\mapsto(ci+j,c'i+j)$ is a bijection of $\mathbb Z_5^2$ because $c-c'\ne0$ is invertible mod $5$.
(C) False Euler's 36 officers problem: no Graeco-Latin square of order $6$ exists (Tarry, 1900).
(D) False There are $3!\cdot2=12$ (Example 6(a)); only one is standard.
Answer (A) and (B).

E6. CSIR Part C In a randomised block design with $v$ treatments and $b$ blocks one observation is missing and is replaced by its missing-plot estimate $\hat x$. Which of the following are true? (One or more options may be correct.) (A) The error degrees of freedom must be reduced by one. (B) The treatment sum of squares computed from the completed table is never smaller than the correct one. (C) $\hat x$ minimises the error sum of squares of the completed table. (D) The variance of the estimated difference between the treatment with the missing value and any other treatment is $2\sigma^2/b$.

(A) True The inserted value carries no information (Theorem 8.27(2)).
(B) True It exceeds the correct value by $\frac{[B-(v-1)\hat x]^2}{v(v-1)}\ge0$ (Theorem 8.28).
(C) True That is Yates' definition, and by Theorem 8.27(1) the minimiser is the fitted value of the missing cell.
(D) False It is $\sigma^2\left[\frac2b+\frac{v}{b(b-1)(v-1)}\right]\gt\frac{2\sigma^2}b$: that treatment has one replicate fewer, and the incomplete block adds uncertainty.
Answer (A), (B) and (C).
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Principles and the CRD. Open with a badly designed trial (new variety on the good end of the field) and ask what analysis could rescue it — none. Definitions 8.10–8.12; Theorem 8.21 with its proof on the board (it reuses SRSWOR from §8.1, a nice link back); Exercise I.8 done live as a sanity check. Theorem 8.22 and Example 2 (ten minutes). Example 1 for computation.
  2. Randomised blocks. Definition 8.13, Theorem 8.23 (emphasise (1): block effects cancel); Example 3 including the one-way comparison at the end. Project Interactive 1 and switch between "blocks = rows" and "blocks = columns": students are surprised that badly placed blocks are worse than no blocks. Theorem 8.24 (proof of (3) only) and Example 4.
  3. Latin squares and missing plots. Definition 8.14, the orthogonality argument of Theorem 8.25, Example 5, Theorem 8.26. Then Theorem 8.27 as a general least-squares fact, Theorem 8.28 and Example 7 with Interactive 2 (move the missing cell around; the parabola keeps its shape). Finish with E4 and E6 of the Exam corner.

Discussion questions. (1) Randomisation makes the design unbiased "on average over allocations"; but the experiment is run only once. In what sense is the actual result protected? (2) Why does an LSD of order $4$ need only $16$ plots to control two nuisance factors that an RBD could control only with many more? What is assumed in exchange? (3) Is a missing value "missing at random" if the plot was flooded because it lay at the bottom of the slope?

Misconceptions to watch for. "Randomisation reduces error"; computing the RBD efficiency by pooling blocks with error; forgetting to remove an error df for a missing value; using the uncorrected treatment SS; believing that any arrangement with each letter once per row is a Latin square; treating subsamples as replicates; thinking random blocks require a different treatment test.

Suggested homework. I(2, 4, 6, 8), II(2, 4, 7, 8), III(1, 5, 6, 7), IV(2, 3, 5); Exam corner E2, E3, E5.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. What shape and size should blocks have? Using a real uniformity trial — a field sown with a single variety and harvested plot by plot — measure how much different blocking schemes would have gained.

Why it matters. In 1910 W. B. Mercer and A. D. Hall harvested a wheat field at Rothamsted in $500$ small plots ($20$ rows by $25$ columns) with no treatments at all, to see how variable "identical" plots are. Their data showed strong, irregular spatial patterns, and they became the test bed for Fisher's ideas on blocking. The same question — how to group units so that within-group variation is small — arises when hospitals are used as blocks in multi-centre clinical trials, when production days are blocks in factory experiments, and in the design of crop variety trials worldwide today.

What to do.

  1. Obtain the Mercer–Hall grain yields (they are distributed with the R package agridat as mercer.wheat.uniformity, and in several other open data collections).
  2. Superimpose "dummy" experiments with $v=5$ treatments: (a) blocks of $5$ plots in a row, (b) blocks of $5$ plots in a column, (c) compact $1\times5$ versus $5\times1$ versus near-square groupings, (d) $5\times5$ Latin squares. Since all treatment effects are zero, the unit values are known exactly.
  3. For each scheme compute $S_u^2$ and the within-block variance $S_w^2$ (Theorem 8.24) and hence the true relative efficiency $S_u^2/S_w^2$; compare with $\widehat{\text{RE}}$ from a randomised dummy allocation.
  4. Repeat the randomisation $1000$ times for one scheme and check Theorem 8.24(1): the mean of the estimated treatment differences is $0$ and their variance is $2S_w^2/b$.

Tools: R or Python (pandas, numpy); a heat map of the field helps to see the gradients.

Hand in: a one-page table of efficiencies for the schemes you tried, a heat map of the field, and a recommendation for block shape with a reason.

Going further. Read about "nearest-neighbour" and spatial analyses of field trials (Papadakis' method, which adjusts each plot by its neighbours' residuals) and about the modern practice of fitting spatial correlation models, which treat the field as a random surface instead of fixed blocks.

Instructor note: the exact numbers depend on which version of the data set is used (grain or straw, the plot layout convention), so ask students to state theirs. The qualitative findings are robust: compact blocks beat long thin ones of the same size, blocks oriented across the dominant trend beat blocks along it, and the gain from blocking is far larger for small blocks than for blocks that cover a large part of the field. Students should notice that a badly oriented block can have $S_w^2\gt S_u^2$, exactly as in Interactive 1.

🧪 Self-check quiz

0/5 correct

Q1. Which principle of experimental design is what makes an estimate of the experimental error possible?

Q2. A $5\times5$ Latin square design has how many error degrees of freedom?

Q3. In an RBD with $v$ treatments and $b$ blocks, the missing-plot estimate (available totals $T$, $B$, $G$) is

Q4. The estimated efficiency of an RBD relative to a CRD is greater than 1 exactly when

Q5. Under unit–treatment additivity, what does randomisation of a CRD guarantee without any normality assumption?