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.
Minimax estimation over inverse source classes — Examples
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
- Conditional Distributions and Regular Conditional Probability
- 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
- Deterministic source classes and optimal recovery
- 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
- Estimators and Randomized Procedures
- 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
- Gaussian sequence inversion and exact risk
- 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
- 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
- Minimax estimation over inverse source classes
- 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
- Numerical Inverse Problems and Regularization Error
- 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
- Spectral regularization and parameter choice
- 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
None yet.
4 · Examples, counterexamples and false statements
Sobolev ellipsoid rates in polynomial and exponential spectra
Example
Assume Countable Choice, take and Sobolev-type weights in the Gaussian sequence inverse model. If the singular values satisfy , the minimax RMS error is of order as ; if instead , it is of order . The comparison constants may depend on the fixed ellipsoid and axis constants.
Example references
Facts & Assumptions
Polynomial and exponential minimax estimation rates: For polynomial singular values and polynomial ellipsoid weights, ; for exponential singular values and polynomial weights, .
Gaussian sequence inverse model and Weighted ellipsoid class for sequence inversion: The model uses the positive singular sequence and the parameter class .
The Axiom of Countable Choice (): Countable Choice is inherited from the sequence model.
Given: Countable Choice, , , and either the polynomial or exponential singular-value regime in the Example.
Verification
In the polynomial regime, and , so the first formula of [F1] has exponent .
In the exponential regime, , so the second formula of [F1] is .
By [A1], the Gaussian sequence model is interpreted with its stated Countable Choice prerequisite. The two substitutions give exactly the two stated RMS orders; and the asymptotic comparison constants affect only the multiplicative bounds.
Analytic ellipsoid rates in polynomial and exponential spectra
Example
Assume Countable Choice, take and analytic-type weights in the Gaussian sequence inverse model. If the singular values satisfy , the minimax RMS error is of order as ; if instead , it is of order . The comparison constants may depend on the fixed ellipsoid and axis constants.
Example references
Facts & Assumptions
Polynomial and exponential minimax estimation rates: For polynomial singular values and exponential ellipsoid weights, ; for exponential singular values and exponential weights, .
Gaussian sequence inverse model and Weighted ellipsoid class for sequence inversion: The model uses the positive singular sequence and the parameter class .
The Axiom of Countable Choice (): Countable Choice is inherited from the sequence model.
Given: Countable Choice, , , and either the polynomial or exponential singular-value regime in the Example.
Verification
In the polynomial regime, , so the first formula of [F1] is .
In the exponential regime, the second formula of [F1] has exponent , giving .
By [A1], the Gaussian sequence model is interpreted with its stated Countable Choice prerequisite. The two substitutions give exactly the two stated RMS orders; and the asymptotic comparison constants affect only the multiplicative bounds.
First-order power-source rates in polynomial and exponential spectra
Example
Assume Countable Choice. Let and be real Hilbert spaces, let be a compact operator of infinite rank, and write , , for its positive singular values. Set and . Over the minimum-norm power source ball in the Gaussian sequence inverse model associated with this singular system, if then the minimax RMS error is of order ; if then it is of order as . The constants may depend on and the fixed singular-value comparison constants.
Example references
Facts & Assumptions
Power source balls are weighted statistical ellipsoids: has ellipsoid weights and radius .
Polynomial and exponential minimax estimation rates: For polynomial singular values with polynomial axes, the rate is ; for exponential singular values with exponential axes, the rate is .
Power source ball and Gaussian sequence inverse model: The source class is in the real Gaussian sequence inverse model.
The Axiom of Countable Choice (): Countable Choice is inherited through the compact singular system.
Given: Countable Choice, real Hilbert spaces , a compact infinite-rank operator with positive singular values and , , , and either or .
Verification
If , [F1] gives , so the first formula of [F2] applies with and gives .
If , [F1] gives , so the second formula of [F2] applies with and gives .
By [A1], the compact singular-system coordinate model is interpreted with its stated Countable Choice prerequisite. Both substitutions use the exact coefficient ellipsoid from [F1] and preserve the stated radius , so they yield the two source-ball rates in the Example.