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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Assignment randomization and sharp-null tests
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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
Randomized complete-block design
Definition
Fix integers and . There are blocks, each containing the same fixed experimental units, indexed within block by . The treatments form a fixed set with . 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 be the set of permutations from the unit labels to . The randomized complete-block design (RCBD) uses assignment space and the uniform probability law on this finite nonempty set. Thus each has probability ; 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 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 .
Nested contrast models and projections in a balanced block design
Statement
Let , , and let have rank and satisfy . Give the Frobenius inner product . Write for the span of the rows of , and define the full additive mean space and the reduced space by the same formula with the extra restriction . For an array , write , , and . Let and , where is the orthogonal projection onto (The orthogonal projection is the -component in ). Then and where .
Facts & Assumptions
Given: The balanced cell space and hypotheses on in the Statement.
An RCBD has units and every treatment once in each of its blocks (Randomized complete-block design).
For a linear map on a finite-dimensional domain, domain dimension is kernel dimension plus image dimension (Rank-nullity: ).
In a finite-dimensional inner-product space, every subspace has an orthogonal complement, and the space is their direct sum (For a subspace of a finite-dimensional inner product space, ); the projection is the unique component in the subspace (The orthogonal projection is the -component in ).
A subspace of a finite-dimensional vector space is finite-dimensional, and a subspace with the same finite dimension as its ambient space equals it. If and is a linear subspace of , then is finite-dimensional, , and if and only if
Dimensions add across a finite direct sum of finite-dimensional subspaces. If with every finite-dimensional, then is finite-dimensional and ; in particular
Matrix rank is row rank; row and column ranks are the dimensions of their respective spaces, and they are equal. Row space, column space, nullspace, row rank, column rank and matrix rank Row rank equals column rank, and both equal the number of pivots
Proof
Let . The coordinate-sum map is onto, so [F2] gives . By [F6], . For every , the vector lies in and satisfies , because . Thus has dimension , and [F2] gives . The row space of lies in and is orthogonal to . The orthogonal complement of within has dimension : both subspaces are finite-dimensional by [F4], and [F3]–[F5] subtract dimensions from . Since this complement contains the -dimensional row space, the equality case of [F4] identifies it with that row space.
In , the constant arrays form a one-dimensional space , the arrays for form a -dimensional treatment space , and the arrays for with form a -dimensional block space . The replication maps from the two zero-sum coordinate spaces to and are linear bijections: their repeated rows or columns recover the original coordinates, so they transport bases and give the stated dimensions; the block zero-sum space has dimension by [F2] applied to its onto coordinate-sum map. These spaces are pairwise orthogonal: the treatment-block inner product is , and either zero-sum condition also makes the relevant inner product with zero. Their sum is direct: if three mutually orthogonal vectors sum to zero, taking the inner product with each one gives its squared norm zero. Thus , and the finite-dimensional direct-sum formula [F5] gives . The reduced space replaces by the replicated arrays from , whose dimension is by step 1.1; the same formula gives .
For any , set . Summing over any row gives zero because and ; summing over any column likewise gives zero. Conversely, if is orthogonal to , then its row-sum vector is orthogonal to every , so all row sums are equal; orthogonality to makes their total zero, so every row sum is zero. The same argument with gives zero column sums. Thus . Also belongs to . By [F3], this is the orthogonal decomposition of relative to , proving the formula for ; the subspace is finite-dimensional by [F4], and [F3] gives . Since the standard cell-coordinate basis makes , [F5] gives .
Put . The matrix is invertible since has full row rank. Direct multiplication gives , , and image . For any and , , so [F3] identifies as the orthogonal projection onto . Consequently is the orthogonal direct sum of the reduced treatment space and the treatment arrays formed from . Therefore , where .
The projection of onto is the array repeating across all blocks: its residual is orthogonal to every repeated because the inner product is . Its squared norm is . In the orthogonal direct sum of step 3.2, is this projection plus , and the two parts are orthogonal; expanding the squared norm gives the claimed residual-sum reduction.
Randomized Latin-square design
Definition
Fix and put , with addition interpreted modulo . A Latin-square allocation of order is a function 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 be the finite set of these allocations and assign the uniform law on . This law is well-defined: is a Latin square, since adding a fixed residue modulo permutes the residues; hence is nonempty. This specifies one exact restricted randomization law. It randomizes over treatment-by-row-by-column assignments and, for , is distinct from the product of independent within-block permutations in an RCBD (Randomized complete-block design).
Design expectation and variance of a paired contrast
Statement
Consider one pair in the RCBD, with the two treatments labelled and . Let be unit 's fixed potential outcome under its own treatment , and assume no interference: the outcome depends on the pair assignment only through that unit's own treatment. Define , , and the two possible observed contrasts If exactly one unit is assigned treatment uniformly at random, the observed treated-minus-control contrast obeys Here and 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 .
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).
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).
In a two-treatment, one-block RCBD, the two assignments are equally likely (Randomized complete-block design).
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).
Variance is and covariance is for square-integrable variables (Moments, variance, and covariance on a probability space).
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).
The finite-assignment experiment uses the data space with its full power-set sigma-algebra (Finite randomized treatment-assignment models).
Covariance is bilinear and symmetric, including constant summands (Covariance is symmetric and bilinear in finite linear combinations).
Proof
Embed the pair's design law in the finite binary assignment model on by giving weight to and and weight zero to and . Zero-probability assignments are allowed by [F1]. The positive-weight assignments give the displayed , with average and difference .
Define 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.
By [F4], , so the contrast estimates the pair's finite-population average effect without bias.
Let indicate that unit is assigned treatment , so . Since the assignment space is finite, the variables are square-integrable. By [F5] and [F8], covariance with a constant is zero and .
The two equally weighted assignments give by [F4], hence by [F5]. Therefore , which is the formula in the Statement.
Moments of the effect for the randomly selected treated unit
Statement
In the two-unit, two-treatment paired randomization, let and . Define to be the fixed treatment effect of whichever unit is assigned treatment . Then The random variable 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 .
The finite assignment model holds the potential-outcome schedule fixed and supplies only the declared assignment randomness (Finite randomized treatment-assignment models).
The pair target is the average of the two unit-level effects (Finite-population average treatment effect and weak null).
The two assignments in a two-treatment, one-block RCBD are equally likely (Randomized complete-block design).
Finite-space expectation is the weighted sum of the two values (Expectation of a real random variable on a finite probability space).
Variance is the expectation of the squared centered value (Moments, variance, and covariance on a probability space).
The observed response vector is ; potential responses under unassigned vectors are fixed but latent (Finite randomized treatment-assignment models).
A statistic is a measurable function of the observed data (Statistics and estimators).
Proof
Let when unit receives treatment and when unit receives it. These outcomes have weights by [F3]. Under assignment , fix and but change ; the observed assignment and response data stay the same while changes. By [F7], no statistic of the observed data can equal over the model.
By [F4], , agreeing with the pair's finite-population average effect [F2].
By [F5], .
One cell observation confounds unrestricted interaction with residual error
Statement
Let and observe one real response for each treatment and block . In the additive mean model, the residual subspace consists of the double-centered arrays which has dimension (Nested contrast models and projections in a balanced block design). If a treatment-by-block interaction is included in the mean, then the additive-fit residual is , where is the projection of the cell error onto . For every this same residual equals . 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.
The additive RCBD projection leaves exactly the double-centered residual subspace of dimension (Nested contrast models and projections in a balanced block design).
An RCBD has one cell for each treatment in each block (Randomized complete-block design).
Proof
Write the cell array as , where is additive and . By [F1], the residual from projection onto is , and the latter error projection lies in .
For any , the identity gives two decompositions of the same observed residual into vectors in . Thus the cell data alone do not distinguish the unrestricted interaction component from the projected error component.
The additive space has dimension and has dimension , so their orthogonal direct sum has dimension , 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.
Exact Gaussian F law for RCBD treatment contrasts
Statement
Assume the Axiom of Choice. Let and fix the RCBD cell layout. Let where, conditional on the realized assignment, the errors are independent variables with . The assignment law alone does not imply these Gaussian, independence, equal-variance, or additivity assumptions. Let have rank , , and . Define and their residual sums of squares as in Nested contrast models and projections in a balanced block design, and put . For the null , the statistic where , has the central Fisher law (Student t and Fisher F laws). In particular, the usual all-treatment-equal test has . This is model-based exact inference conditional on the design, not a consequence of assignment randomization alone.
The data space is 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 cell errors, , a full-row-rank contrast matrix with , AC, and the null .
AC is required by the Gaussian nested-model theorem used below, through its standard-normal construction and orthogonal-invariance argument (The Axiom of Choice).
For nested mean spaces of dimensions and , with and independent errors, the nested Gaussian linear-model theorem gives divided by the law when the mean lies in (QR decomposition gives exact t and F pivots in the fixed Gaussian linear model).
For this balanced RCBD, the full and restricted spaces have dimensions and , the residual degrees of freedom are , and (Nested contrast models and projections in a balanced block design).
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).
A statistic is a measurable map from the experiment's data space to its target measurable space (Statistics and estimators).
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
By [F2], , , , and . Since , , and . Under , the mean array belongs to . Thus the nested-space, positive-degree, and null-mean hypotheses of [F1] hold.
Applying [F1] gives the piecewise nested-model statistic the law , with its value set to zero when . 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].
By [F2], the numerator reduction is , 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].
Since , [F3] defines the named central law and step 3.1 is the piecewise nested-model ratio from [F1]. It therefore has law , as claimed.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §§13.1–13.2
- Susan Holmes and Wolfgang Huber, Modern Statistics for Modern Biology, Chapter 13 §§13.2 and 13.4.4
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.2.2
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.3
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.2
- Susan Holmes and Wolfgang Huber, Modern Statistics for Modern Biology, Chapter 13 §13.4.4