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.

Blocking, pairs, and Latin squares

1 · Prerequisites

2 · Summary

This page separates three sources of structure. A randomized complete-block design randomizes a treatment permutation independently inside each complete block. With fixed no-interference potential outcomes, a randomized pair's treated-minus-control contrast is unbiased for the pair average effect, and its variance depends on the difference between the two possible observed contrasts, including baseline outcomes. A separate lemma distinguishes this observed contrast from the latent effect of the randomly selected treated unit. A separate additive Gaussian error model gives the exact RCBD treatment-contrast F law under its stated common-variance and independence assumptions. A Latin square balances treatments across both rows and columns with a restricted assignment law. Randomization alone supplies no Gaussian error law. With one observation per block-treatment cell, an unrestricted treatment-by-block interaction uses the same residual subspace as projected error.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Randomized complete-block design

Definition

Fix integers t≥2 and b≥1. There are b blocks, each containing the same t fixed experimental units, indexed within block j by i∈{1,…,t}. The t treatments form a fixed set T with ∣T∣=t. A complete block is a block in which each treatment is assigned to exactly one unit. The blocks and their units are fixed before randomization.

Let St be the set of permutations from the unit labels to T. The randomized complete-block design (RCBD) uses assignment space Z=(St)b and the uniform probability law on this finite nonempty set. Thus each z=(π1,…,πb) has probability (t!)−b; the within-block treatment permutations are independent and individually uniform. This is a finite randomized-treatment assignment model (Finite randomized treatment-assignment models) whose units are the tb cells and whose assignment is the only randomness supplied by the design. The design specifies no response model, Gaussian errors, additivity, or absence of interference. A pair is the special case t=2,b=1.

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

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Randomized Latin-square design

Definition

Fix t≥1 and put Rt={0,1,…,t−1}, with addition interpreted modulo t. A Latin-square allocation of order t is a function L:Rt×Rt→Rt such that for each fixed row the map from columns to treatments is a bijection, and for each fixed column the map from rows to treatments is a bijection. Thus each treatment occurs exactly once in every row and every column. Let Lt be the finite set of these allocations and assign the uniform law on Lt. This law is well-defined: L0(r,c)=r+c(modt) is a Latin square, since adding a fixed residue modulo t permutes the residues; hence Lt is nonempty. This specifies one exact restricted randomization law. It randomizes over treatment-by-row-by-column assignments and, for t≥2, is distinct from the product of independent within-block permutations in an RCBD (Randomized complete-block design).

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Design expectation and variance of a paired contrast

Statement

Consider one pair in the t=2,b=1 RCBD, with the two treatments labelled 0 and 1. Let Yℓ(z)∈R be unit ℓ's fixed potential outcome under its own treatment z∈{0,1}, and assume no interference: the outcome depends on the pair assignment only through that unit's own treatment. Define δℓ=Yℓ(1)−Yℓ(0), τ=(δ1+δ2)/2, and the two possible observed contrasts D1=Y1(1)−Y2(0),D2=Y2(1)−Y1(0). If exactly one unit is assigned treatment 1 uniformly at random, the observed treated-minus-control contrast D obeys Ed[D]=τ,Var⁡d(D)=(D1−D2)24=((δ1−δ2)+2(Y1(0)−Y2(0)))24. Here Ed and Var⁡d average over treatment assignment only, holding all potential outcomes fixed. The variance depends on baseline outcomes as well as effect heterogeneity.

Facts & Assumptions

Given: Two fixed units, binary potential outcomes with no interference, and uniform randomization of exactly one unit to treatment 1.

[F1]

In the finite assignment model, units and potential outcomes are fixed while assignment is random; the model itself imposes no no-interference assumption (Finite randomized treatment-assignment models).

[F2]

The finite-population average treatment effect for two units is the average of their fixed unit-level effects (Finite-population average treatment effect and weak null).

[F3]

In a two-treatment, one-block RCBD, the two assignments are equally likely (Randomized complete-block design).

[F4]

On a finite probability space, expectation is the sum of values times their weights (Expectation of a real random variable on a finite probability space).

[F5]

Variance is E[(X−E[X])2] and covariance is E[(X−E[X])(Y−E[Y])] for square-integrable variables (Moments, variance, and covariance on a probability space).

[F6]

A statistic is a measurable map of the observed data, and a statistic with the estimand's target space is an estimator (Statistics and estimators).

[F7]

The finite-assignment experiment uses the data space Z×RI with its full power-set sigma-algebra (Finite randomized treatment-assignment models).

[F8]

Covariance is bilinear and symmetric, including constant summands (Covariance is symmetric and bilinear in finite linear combinations).

Proof

1.1F1F3algebra

Embed the pair's design law in the finite binary assignment model on {0,1}2 by giving weight 1/2 to (1,0) and (0,1) and weight zero to (0,0) and (1,1). Zero-probability assignments are allowed by [F1]. The positive-weight assignments give the displayed D1,D2, with average (δ1+δ2)/2 and difference (δ1−δ2)+2(Y1(0)−Y2(0)).

2.1F6F7step 1.1

Define D by the treated-minus-control formula on the two positive-weight assignments and, for example, by zero on the two zero-weight assignments. This is a function on the full-power-set data space [F7], hence a measurable statistic and estimator of τ by [F6]; its arbitrary zero-weight values do not affect design moments.

2.2F2F3F4step 1.1algebra

By [F4], Ed[D]=(D1+D2)/2=(δ1+δ2)/2=τ, so the contrast estimates the pair's finite-population average effect without bias.

2.3F3F5F8step 1.1algebra

Let X indicate that unit 1 is assigned treatment 1, so D=D2+(D1−D2)X. Since the assignment space is finite, the variables are square-integrable. By [F5] and [F8], covariance with a constant is zero and Var⁡d(D)=(D1−D2)2Var⁡d(X).

3.1F3F4F5step 2.3algebra∎

The two equally weighted assignments give Ed[X]=1/2 by [F4], hence Var⁡d(X)=1/4 by [F5]. Therefore Var⁡d(D)=(D1−D2)2/4, which is the formula in the Statement.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Moments of the effect for the randomly selected treated unit

Statement

In the two-unit, two-treatment paired randomization, let δℓ=Yℓ(1)−Yℓ(0) and τ=(δ1+δ2)/2. Define S to be the fixed treatment effect δℓ of whichever unit ℓ is assigned treatment 1. Then Ed[S]=τ,Var⁡d(S)=(δ1−δ2)24. The random variable S uses both potential outcomes of the selected unit; it is not the observed treated-minus-control contrast and is not a statistic of the observed assignment and response data.

Facts & Assumptions

Given: Two fixed binary-treatment potential-outcome schedules, no interference, and uniform randomization of exactly one unit to treatment 1.

[F1]

The finite assignment model holds the potential-outcome schedule fixed and supplies only the declared assignment randomness (Finite randomized treatment-assignment models).

[F2]

The pair target is the average of the two unit-level effects (Finite-population average treatment effect and weak null).

[F3]

The two assignments in a two-treatment, one-block RCBD are equally likely (Randomized complete-block design).

[F4]

Finite-space expectation is the weighted sum of the two values (Expectation of a real random variable on a finite probability space).

[F5]

Variance is the expectation of the squared centered value (Moments, variance, and covariance on a probability space).

[F6]

The observed response vector is Yθ(Z); potential responses under unassigned vectors are fixed but latent (Finite randomized treatment-assignment models).

[F7]

A statistic is a measurable function of the observed data (Statistics and estimators).

Proof

1.1F1F3F6F7givenconstruct

Let S=δ1 when unit 1 receives treatment 1 and S=δ2 when unit 2 receives it. These outcomes have weights 1/2 by [F3]. Under assignment (1,0), fix Y1(1) and Y2(0) but change Y1(0); the observed assignment and response data stay the same while S=Y1(1)−Y1(0) changes. By [F7], no statistic of the observed data can equal S over the model.

2.1F2F3F4step 1.1algebra

By [F4], Ed[S]=(δ1+δ2)/2=τ, agreeing with the pair's finite-population average effect [F2].

3.1F3F5step 1.1step 2.1algebra∎

By [F5], Var⁡d(S)=12(δ1−τ)2+12(δ2−τ)2=(δ1−δ2)2/4.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

One cell observation confounds unrestricted interaction with residual error

Statement

Let t,b≥2 and observe one real response Yij for each treatment i and block j. In the additive mean model, the residual subspace consists of the double-centered arrays E={γ∈Rt×b:∑jγij=0 for every i, ∑iγij=0 for every j}, which has dimension (t−1)(b−1) (Nested contrast models and projections in a balanced block design). If a treatment-by-block interaction γ∈E is included in the mean, then the additive-fit residual is γ+PEϵ, where PEϵ is the projection of the cell error onto E. For every h∈E this same residual equals (γ+h)+(PEϵ−h). Hence one observation per cell does not separately decompose the realized residual into unrestricted interaction and projected error, and fitting the unrestricted interaction leaves zero pure-error residual degrees of freedom. This is an algebraic design limitation; it does not assert nonidentifiability under every additional stochastic model.

Facts & Assumptions

Given: The one-observation-per-treatment-by-block-cell layout, additive fit, and a possible unrestricted double-centered interaction.

[F1]

The additive RCBD projection leaves exactly the double-centered residual subspace of dimension (t−1)(b−1) (Nested contrast models and projections in a balanced block design).

[F2]

An RCBD has one cell for each treatment in each block (Randomized complete-block design).

Proof

1.1F1F2algebra

Write the cell array as Y=m+γ+ϵ, where m∈WU is additive and γ∈E. By [F1], the residual from projection onto WU is (I−PWU)Y=γ+(I−PWU)ϵ, and the latter error projection lies in E=WU⊥.

2.1step 1.1algebra

For any h∈E, the identity γ+(I−PWU)ϵ=(γ+h)+((I−PWU)ϵ−h) gives two decompositions of the same observed residual into vectors in E. Thus the cell data alone do not distinguish the unrestricted interaction component from the projected error component.

3.1F1step 2.1algebra∎

The additive space has dimension t+b−1 and E has dimension (t−1)(b−1), so their orthogonal direct sum has dimension tb, the full cell-space dimension. Therefore the model with a free interaction uses all cell-space directions and leaves zero residual degrees of freedom for a separate pure-error estimate.

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

Exact Gaussian F law for RCBD treatment contrasts

Statement

Assume the Axiom of Choice. Let t,b≥2 and fix the RCBD cell layout. Let Yij=μ+τi+βj+ϵij,∑iτi=0,∑jβj=0, where, conditional on the realized assignment, the errors are independent N(0,σ2) variables with σ2>0. The assignment law alone does not imply these Gaussian, independence, equal-variance, or additivity assumptions. Let C∈Rq×t have rank q, 1≤q≤t−1, and C1t=0. Define WU,WR(C) and their residual sums of squares as in Nested contrast models and projections in a balanced block design, and put ν=(t−1)(b−1)>0. For the null Cτ=0, the statistic F~C(Y)={b(CYˉ)T(CCT)−1(CYˉ)/qRSSU/ν,RSSU>0,0,RSSU=0, where Yˉ=(Yˉ1⋅,…,Yˉt⋅)T, has the central Fisher law Fq,ν (Student t and Fisher F laws). In particular, the usual all-treatment-equal test has q=t−1. This is model-based exact inference conditional on the design, not a consequence of assignment randomization alone.

The data space is Rtb with its Borel sigma-algebra; the model above is the fixed-design Gaussian experiment for the realized RCBD layout.

Facts & Assumptions

Given: The additive RCBD model, conditional independent N(0,σ2) cell errors, t,b≥2, a full-row-rank contrast matrix C with C1t=0, AC, and the null Cτ=0.

[A1]

AC is required by the Gaussian nested-model theorem used below, through its standard-normal construction and orthogonal-invariance argument (The Axiom of Choice).

[F1]

For nested mean spaces WR⊂WU of dimensions p−q and p, with p<n and independent N(0,σ2) errors, the nested Gaussian linear-model theorem gives (RSSR−RSSU)/q divided by RSSU/(n−p) the Fq,n−p law when the mean lies in WR (QR decomposition gives exact t and F pivots in the fixed Gaussian linear model).

[F2]

For this balanced RCBD, the full and restricted spaces have dimensions t+b−1 and t+b−1−q, the residual degrees of freedom are (t−1)(b−1), and RSSR−RSSU=b(CYˉ)T(CCT)−1(CYˉ) (Nested contrast models and projections in a balanced block design).

[F3]

The F law is the ratio of independent positive-degree chi-square variables divided by their degrees of freedom, with the statistic defined as zero on a zero-denominator set (Student t and Fisher F laws).

[F4]

A statistic is a measurable map from the experiment's data space to its target measurable space (Statistics and estimators).

[F5]

The finite assignment model holds the treatment schedule fixed and supplies only its specified assignment law; it does not supply an error distribution (Finite randomized treatment-assignment models).

Proof

1.1givenF1F2algebra

By [F2], WR(C)⊂WU, p=dim⁡WU=t+b−1, q=dim⁡WU−dim⁡WR(C), and n=tb. Since t,b≥2, n−p=tb−t−b+1=(t−1)(b−1)=ν>0, and q≤t−1≤p. Under Cτ=0, the mean array (μ+τi+βj)ij belongs to WR(C). Thus the nested-space, positive-degree, and null-mean hypotheses of [F1] hold.

2.1A1F1F5step 1.1

Applying [F1] gives the piecewise nested-model statistic {(RSSR−RSSU)/q}/{RSSU/ν} the law Fq,ν, with its value set to zero when RSSU=0. The finite assignment law [F5] supplies no normal-error assumption; Gaussianity here is separately imposed in the Given. AC is used exactly through [A1] and [F1].

3.1F2F4step 2.1algebra

By [F2], the numerator reduction is b(CYˉ)T(CCT)−1(CYˉ), so the statistic in the Statement is the same piecewise ratio. Its numerator and residual sum of squares are continuous functions of the data, and the ratio with the stated zero-denominator branch is Borel measurable; hence it is a statistic by [F4].

4.1F1F3step 3.1∎

Since q,ν>0, [F3] defines the named central law and step 3.1 is the piecewise nested-model ratio from [F1]. It therefore has law Fq,ν, as claimed.

5 · Examples, counterexamples and false statements

None yet.

Sources