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.
Decision-Theoretic Upper Bounds — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Concentration
- Conditional Distributions and Regular Conditional Probability
- 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
- Decision-Theoretic Upper Bounds
- Determinants of Matrices over a Commutative Ring
- 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
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-Sample Point Estimation
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- 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
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Volumes of Elementary Solids and Solids of Revolution
2 · Summary
These examples separate fitted-value accuracy from coefficient recovery and training residual from fresh-response prediction error. A two-coordinate orthogonal sequence calculation shows how the constrained support search behaves in a small sparse model. Each example states its noise and design assumptions explicitly.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Collinear columns identify a fitted mean, not its coefficients
Statement refuted
For every fixed-design matrix , the map is injective; therefore the coefficient vector is determined by its fitted mean.
Facts & Assumptions
Given: An integer , the design matrix with two identical columns , the coefficient vectors and , and centered additive noise whose law is the same at both parameter values and whose covariance is with .
The least-squares fitted vector is the projection of the observation onto the design column space (Fixed-design least squares as orthogonal projection).
For centered noise with covariance , projection onto a fixed rank- subspace has expected squared error equal to squared approximation bias plus (Exact squared-error risk of an isotropic projection fit).
Expectation is linear and preserves inequalities between integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).
The risk of a procedure is the expected loss under its parameter law (Loss functions and risk).
Counterexample
Both coefficient vectors are distinct, but . Thus the asserted injectivity fails, and the observation distributions under and are identical because the additive noise law is common.
Let be any measurable coefficient estimator. For every , completing squares gives If either coefficient risk is infinite, their maximum is already at least . Otherwise both squared losses are integrable under the common observation law. Their sum is integrable by [F3], so linearity and monotonicity in [F3] show that the sum of the two risks is at least . Thus their maximum is at least for every .
The common fitted mean lies in , which has rank . By [F2], its projected least-squares fit has expected squared fitted-value risk , or per observation by [F4]. This vanishes as grows while the coefficient-risk lower bound in step 1.2 stays at least .
Constrained least squares in a two-coordinate orthogonal sequence model
Example
Let , , , and impose sparsity . Observe . Assume the centered noise vector is sub-Gaussian with proxy and has covariance . The constrained support search retains the coordinate with the larger squared observation. Its expected fitted-value error per observation is between and , and the general theorem gives the upper bound .
Facts & Assumptions
Given: , , , , , the observation , and a centered noise vector with sub-Gaussian proxy and .
The support-search estimator projects onto each support and chooses the least-residual candidate, with its stated deterministic tie rule (Constrained support-search least squares).
Its expected squared fitted-value error is at most when (Sparse constrained least-squares risk bound).
The centered vector proxy convention is the all-directions MGF bound (Sub-Gaussian variables and vectors, and sub-exponential variables).
Coordinate second moments and covariance are defined by expectations of centered products (Moments, variance, and covariance on a probability space).
Squared fitted-value error is a nonnegative loss and risk is its expected value (Loss functions and risk).
The nonnegative integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral), and expectation is linear and monotone for integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).
Verification
The three candidate supports are . Their fitted vectors are , , and , with residual squares , , and , respectively. Hence the chosen fitted vector has squared norm , including a tie.
Pointwise, . The coordinate squares are integrable by the covariance assumption [F4], so their sum is integrable by [F6]. The nonnegative maximum is dominated by this sum, hence is integrable by nonnegative-integral monotonicity in [F6]. Taking expectations with [F6] and using [F4] gives . Division by proves the stated interval for fitted-value error.
Here , , and , and the noise satisfies [F3], so [F2] gives expected error at most . This is consistent with the direct calculation; the example makes no separate minimax lower-bound claim. By [F5], this expectation is the squared fitted-value risk.
Zero training residual and positive test error
Example
Take one fixed-design observation with , true fitted mean , and training response . Let be an independent fresh response error with the same mean-zero, variance- law, where . Least squares fits the one-dimensional column space exactly: its training residual is zero, its expected error for estimating the mean is , and its expected squared error for predicting the fresh response is .
Facts & Assumptions
Given: A one-point fixed design , , integrable centered square-integrable errors with variance , and independence of the training and fresh errors.
The fitted vector is the orthogonal projection of the observed response onto the design column space (Fixed-design least squares as orthogonal projection).
For a rank-one projection and centered variance- noise, the expected squared fitted-value error is (Exact squared-error risk of an isotropic projection fit).
Variance is the expected square of the centered variable (Moments, variance, and covariance on a probability space).
Independent integrable random variables have factorized product expectations (Independent random elements, Expectations factor over finite products of independent random variables).
For a real estimator of a real target, mean squared error is the expected squared difference; more generally risk is expected loss (Bias and mean squared error, Loss functions and risk).
Verification
Since , [F1] gives . Therefore the training residual is zero for every outcome.
By [F2], the expected squared error for estimating the true mean is . This is the scalar MSE and squared-loss risk by [F5].
The test-response error is . Expanding its square and using [F3] and [F4], .
The training residual, mean-estimation error, and fresh-response test error are respectively , , and in this model, so these quantities are distinct.
Sources
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 2, §§7–8
- Sylvain Arlot, Model/estimator selection, Lecture on model selection, §§1–2
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, §2.2, Theorem 2.6 and Corollary 2.9
- Sylvain Arlot, Model/estimator selection, Lecture on model selection, §2
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 2, §7
- Sylvain Arlot, Model/estimator selection, Lecture on model selection, §1