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.
Minimum-norm interpolation and double descent — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Concentration
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- 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
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Time Martingales
- 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
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite basis projector energies and variational electronic structure
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- 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
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Influence and Breakdown
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Interpolative cur and nystrom decompositions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Marchenko–Pastur law and sample-covariance edge bounds
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimum-norm interpolation and double descent
- Modes of Convergence for Random Variables
- 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
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sample-covariance resolvent deterministic equivalents
- 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
- Strong Laws of Large Numbers
- 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 Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Moore--Penrose Pseudoinverse and Regularised Least Squares
- 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
- Weak Laws and Series of Independent Random Variables
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Reported double-descent experiments for neural networks and tree ensembles
Example
Belkin, Hsu, Ma, and Mandal report empirical double-descent curves for random Fourier features on a -example, ten-class MNIST subset, with interpolation at features; for a fully connected two-layer neural network on examples of dimension and ten classes, with the observed interpolation threshold near parameters; and for random forests on a -example MNIST subset, with model complexity indexed jointly by maximum tree leaves and number of trees. These are finite experimental observations; they do not assert a universal risk curve or a theorem about arbitrary neural networks, trees, or ensembles.
Example references
Facts & Assumptions
Given: The reported empirical plots and experiment descriptions in the source cited in Example references.
Figure 2 describes the random-Fourier-feature MNIST experiment and its interpolation threshold; Figure 4 describes the two-layer neural-network experiment; Figure 5 describes the random-forest experiment. The paper labels these as empirical evidence, not a universal theorem.
Verification
The Figure 2 description gives , ten classes, and the threshold ; these are the random-feature quantities stated in the Example.
The Figure 4 description gives , input dimension , ten outputs, and threshold observed at parameters. The Figure 5 description gives and indexes forest complexity by maximum leaves and tree count.
The source reports experiments for those specified datasets and model families, so the Example is an empirical report with those qualifications; it does not claim a theorem for models beyond the experiments.
Bias, variance, and signal-to-noise regimes of the isotropic risk curve
Example
For fixed signal norm , noise standard deviation , and aspect ratio , , the limiting risk has bias and variance components When , the underparameterized branch increases from limit as to as . On the overparameterized side its variance decreases to , and its bias increases to . When , the total overparameterized risk is strictly decreasing if , and if it has a unique minimum at . If , the underparameterized risk is ; the overparameterized risk is and is strictly increasing when . The one-sided risk curves diverge at only when ; no risk limit at is asserted. For the global infimum over is , approached as and not attained; if , it is also approached as . For , the minimum is attained throughout .
Example references
Facts & Assumptions
Given: , , and with .
The limiting bias and variance components are the two displayed branches (Separate isotropic ridgeless risk into limiting bias and variance).
Verification
Summing the two components in [F1] gives the total risk for and for . Differentiating the first expression gives , so it is strictly increasing for and is identically zero for .
For , If and , then , so . If , the derivative vanishes exactly when , namely at ; it is negative before this point and positive after it, giving the unique minimum. If , the derivative is , which is positive for and zero for .
The limits at , , and follow directly from the formulas in [F1]. In particular, the singular terms at vanish when and diverge when . For every finite-domain risk value is positive while the underparameterized branch tends to zero as , proving that its global infimum is and is not attained. When , the underparameterized branch equals identically.