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 — Examples
1 · Prerequisites
- Assignment randomization and sharp-null tests
- Binary Operations, Monoids, Groups and Subgroups
- Blocking, pairs, and Latin squares
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples distinguish complete-block support from incomplete blocks, show why a Latin-square randomization restricts the assignments allowed by an RCBD, calculate a paired contrast with heterogeneous unit effects, and exhibit two interaction/error decompositions of the same two-by-two residual array. The paired counterexample shows why the observed contrast's design variance also depends on baseline outcomes.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A missing treatment falls outside the complete-block assignment space
Example
There are three treatments and one block, but only two units receive treatments and . This is not a complete block: the assignment omits , so it is not an element of the RCBD assignment space.
Verification
Given: A block with treatments whose observed assignments are and only.
[F1] In an RCBD assignment, each block receives every treatment exactly once; equivalently its unit-to-treatment map is a permutation (Randomized complete-block design).
The image of this block's assignment is , which omits , so the map is not onto and is not a permutation.
Every assignment in the RCBD sample space is a permutation, while this assignment is not; therefore this block is incomplete and outside that sample space.
A Latin-square assignment is a strict subset of RCBD assignments
Example
With treatments , the cyclic array is a Latin square. The array with all three rows equal to is an allowed RCBD assignment of three blocks, but is not a Latin square. Under the uniform RCBD law that particular assignment has probability ; under the uniform Latin-square law it has probability zero.
Verification
Given: Three treatments, three blocks, and the two displayed assignments in the Example.
[F1] An RCBD assignment consists of an independently randomized treatment permutation in each block (Randomized complete-block design).
[F2] A Latin-square assignment uses every treatment once in every row and every column, and the specified law is uniform on all such squares (Randomized Latin-square design).
In the cyclic array, each row and each column contains once, so it belongs to the Latin-square sample space.
In the repeated-row array, each row contains once, so it is an RCBD assignment; each column repeats a single treatment, so it is not a Latin square.
There are permutations per RCBD block and the blocks are independently uniform, so the particular repeated-row assignment has probability . It has probability zero under a law supported only on Latin squares.
A paired contrast with unequal unit-level effects
Example
Suppose , , and . The unit effects are and . Under the two equally likely assignments, the treated-minus-control contrasts are and . Their mean is the pair average effect and their design variance is . The centered paired-contrast values are and with equal weights, so their variance is .
Verification
Given: A two-unit, two-treatment pair with no interference, , , and .
[F1] In the RCBD, the two treatment permutations are equally likely (Randomized complete-block design).
[F2] On a finite probability space, expectation is the weighted sum of the values (Expectation of a real random variable on a finite probability space).
[F3] Variance is the expectation of the squared centered value (Moments, variance, and covariance on a probability space).
If unit receives treatment, the contrast is ; if unit receives treatment, it is . They are equally likely by [F1].
By [F2] the contrast mean is , the pair average effect. By [F3] its variance is . Thus the example has unequal unit effects and directly computes the observed contrast moments.
Observed paired-contrast variance is not determined by effect heterogeneity
Statement refuted
Define , and let be the observed treated-minus-control contrast. The claimed formula is that in every two-unit paired randomization,
Facts & Assumptions
Given: Two units with no-interference binary potential outcomes , , , and , and a uniform assignment of exactly one unit to treatment .
The observed paired contrast has the design expectation and variance proved in the local corrected theorem (Design expectation and variance of a paired contrast).
The effect of the unit selected for treatment has variance (Moments of the effect for the randomly selected treated unit).
Counterexample
The fixed effects are and . If unit is treated, the observed contrast is ; if unit is treated, it is . The two assignments each have weight .
The observed contrast has mean and variance , also given by [F1]. But the proposed expression is . Hence it is not the variance of the observed paired contrast.
The variance is instead the variance of the randomly selected unit effect from [F2]. This distinguishes that latent schedule quantity from the observed contrast, and completes the counterexample.
Sources
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §§13.1–13.2
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.3.2
- Susan Holmes and Wolfgang Huber, Modern Statistics for Modern Biology, Chapter 13 §13.4.4
- Gary W. Oehlert, A First Course in Design and Analysis of Experiments, Chapter 13 §13.2.2