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.
Gaussian sequence inversion and exact risk
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
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compact linear inverse maps and the Picard criterion
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- 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
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- 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 Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- 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
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- 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
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Statistical inverse experiments and white noise
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- 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 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
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
- Weak nonparametric Bernstein–von Mises limits
2 · Logical flowchart
3 · Definitions, theorems and proofs
Gaussian sequence inverse model
Definition
Assume the Axiom of Countable Choice. Let and be real Hilbert spaces and let be a compact linear operator of infinite rank, viewed as an inverse model with exact datum . Here compact means that the image of every bounded subset has compact closure. Write and . Fix a positive singular system for , where , , , , is a complete orthonormal basis of , and is a complete orthonormal basis of . A complete orthonormal basis is an orthonormal family whose closed linear span is the whole indicated subspace. These are the compact SVD conventions; in particular, this model concerns minimum-norm representatives in and does not estimate a kernel component.
For a truth , let . The complete-basis coefficient map identifies bijectively and isometrically with , so every is a model parameter. For , take the functional white-noise experiment on the separable Hilbert space with observations , where is centered, has covariance , and has independent standard-normal values on every finite orthonormal tuple. The countable complete basis makes separable. Define and . The sequence sample space is with the product Borel sigma-algebra, meaning the sigma-algebra generated by its coordinate projections. The coordinate law is the pushforward of the functional experiment under ; this map is measurable because each coordinate is a cylinder evaluation followed by scalar multiplication. The compact SVD expansion gives , and the positive-noise white-noise coordinate theorem gives the independent standard-normal coordinates . Hence the normalized coordinates satisfy
For the zero-noise boundary , define the sequence experiment separately by the point mass at , so . This boundary is not an instance of the positive-noise functional experiment.
Definition references
Compact linear inverse model between Hilbert spaces
Compact-operator singular system and expansion
Complete orthonormal systems and Hilbert bases
A complete orthonormal basis identifies a Hilbert space isometrically with
Functional isonormal white-noise experiment
Independent Gaussian coordinates in a white-noise experiment
Coordinate diagram
The deterministic square commutes: and are the coefficient isometries, and is well defined because . The compact SVD expansion gives . The noisy coordinates add before division by ; the diagram is not a claim that white noise is an -valued sample and is not used as a proof.
Weighted ellipsoid class for sequence inversion
Definition
Let and let be a nondecreasing sequence of positive real numbers, so . The statistical ellipsoid of radius and weights in the Gaussian sequence inverse model is No assumption that is included. In particular, this definition does not assert that the ellipsoid is compact in .
Definition references
Singular-value cutoff estimator
Definition
Input a normalized sequence observation from the Gaussian sequence inverse model and a cutoff , where . Output the finite-support estimate defined by For the output is the zero sequence.
Exact worst-case risk of the truncated estimator
Statement
Assume Countable Choice and let . In the Gaussian sequence inverse model with positive singular numbers , let and let be positive and nondecreasing. For each , define the squared sequence risk of the cutoff estimator at by Then its exact worst-case squared sequence risk is where the sum is for . The supremum is attained by the one-coordinate truth , with when .
Statement references
Facts & Assumptions
Gaussian sequence inverse model: For , with and ; at , deterministically.
Weighted ellipsoid class for sequence inversion: means and , with .
Singular-value cutoff estimator: for and for .
The Axiom of Countable Choice (): Countable Choice is assumed only for the upstream compact SVD coordinate identification; it is not used in the finite-coordinate risk calculation.
Given: Countable Choice, , positive singular numbers , a cutoff , and the ellipsoid with positive nondecreasing weights.
Proof
Under [A1], the model coordinates in [F1] are fixed by the countable-choice SVD branch. If , [F1] and [F3] give for and for , hence . If , the retained error is zero and the omitted error is , so the squared error is . In both cases the error is in because the estimator has finite support and .
For , taking expectation in the finite random sum of [step 1.1] and using from [F1] gives . For , the deterministic error in [step 1.1] gives the same formula with the first term zero. The deterministic tail is finite because .
For every , monotonicity gives for , so . Thus [step 2.1] is bounded above by the asserted right-hand side.
The sequence with and all other coordinates zero belongs to and satisfies , including . Its tail squared norm is exactly , so it attains the upper bound from [step 3.1]. The finite-coordinate variance term in [step 2.1] is independent of , hence the same sequence attains the full worst-case risk.
Taking the supremum in [step 2.1], using the universal upper bound [step 3.1] and the attaining sequence [step 4.1], yields the exact equality and the stated zero-cutoff convention.
Remarks
This is expected squared loss in the Gaussian sequence experiment, over a weighted ellipsoid of coefficient sequences. It is not a deterministic worst-case error bound for arbitrary norm-bounded data perturbations.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, §1, equations (1)–(4), PDF pp. 1–2
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, Chapter 3, equations (3.63)–(3.67), printed p. 78; §3.8 begins on p. 77
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, Definition 1, equation (4), PDF p. 1
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, Chapter 3, ellipsoid definition (3.4), printed p. 58; §3.1 begins on p. 57
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, equation (11), PDF p. 3
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, §3.2, equation (3.12), printed p. 61
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, Lemma 1 and its complete proof, PDF pp. 2–3
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, §3.2, equations (3.11)–(3.12), printed pp. 60–61