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.
Neural tangent kernels and lazy training — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Automatic differentiation and backpropagation
- Automatic differentiation and computational graphs
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- 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
- Cosets, Index and Lagrange's Theorem
- Cost-Constrained, Gaussian, and Feedback Channels
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- 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
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- 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
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Neural tangent kernels and lazy training
- 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
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plancherel Measure and Asymptotic Young Diagrams
- 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
- 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
- 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 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 Maximal Function and Lebesgue Differentiation
- 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
A finite-width quadratic feature network has a changing NTK
Example
Consider the scalar one-hidden-unit model with parameters and cost . At , gradient flow for this cost has and . Its two parameter features are and , and its neural tangent kernel at the single input is . Along the local gradient-flow solution from , both features change immediately and , so this finite-width model does not have a fixed NTK.
Example references
Facts & Assumptions
Given: The model , the cost , and initial parameters .
The scalar neural tangent kernel is the sum of squares of the parameter derivatives (The neural tangent kernel of a differentiable parameterized function).
A polynomial vector field has a unique local solution through each initial point (Picard-Lindelöf local existence and uniqueness for first-order systems).
Verification
Differentiating gives and . By [F1], At , , , and , so the negative-gradient vector field has the stated initial velocity.
The vector field is polynomial, hence locally Lipschitz; [F2] gives a differentiable local solution through . Along it, which equals at . Also and , so both parameter features vary. A differentiable scalar function with nonzero derivative at zero is not constant on any right neighborhood of zero.
A wide tanh network stays lazy on a fixed time horizon
Example
Assume AC. Fix , a data set , a depth , a bias scale , and the scalar-output source-normalized network with independent standard-normal initialization under its product law. Let . For each finite hidden-width tuple, take the unique gradient-flow path as a measurable function of the initialized parameters on , satisfying
so the empirical training direction is for every datum and time. The finite-width path exists on every finite interval, and its integrated empirical direction norm on equals . Consequently, as the hidden widths tend to infinity sequentially, the finite-data neural tangent kernel remains uniformly close in probability on to the deterministic recursive limiting kernel for this network and data set.
Example references
Facts & Assumptions
Given: , a fixed finite data set and finite depth, the positive bias scale, the source-normalized scalar-output network, and the constant training direction.
The exponential is positive, satisfies the addition formula, and has derivative equal to itself; sums, products, quotients with nonzero denominator, and compositions obey the derivative rules (The real exponential function and the number by a power series, The exponential is positive and satisfies , The exponential addition formula , The exponential function is smooth and , Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ).
The mean value theorem bounds increments of a differentiable function by a uniform derivative bound (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
A locally Lipschitz finite-dimensional vector field has a unique local solution (Picard-Lindelöf local existence and uniqueness for first-order systems).
The parameter-gradient formulas follow from reverse accumulation over shared parameters (Reverse accumulation sums gradients over shared parameter uses); the finite-data NTK stays uniformly close in probability to its deterministic limit on any fixed interval under the hypotheses in the stability lemma and sequential-width theorem (Finite-data fixed-time NTK stability under integrably bounded training directions, Sequential infinite-width NTK limit and finite-time lazy training dynamics, The neural tangent kernel of a differentiable parameterized function, Jacot–Gabriel–Hongler width-normalized fully connected networks).
Verification
Put . Then , so . The derivative rules in [F1] give and . Thus and . By [F2], , so is globally Lipschitz. Since , it is nonconstant; a polynomial of degree with leading coefficient satisfies as , so its absolute value is unbounded. The bounded nonconstant is therefore nonpolynomial.
For each finite network, the parameter vector field for the constant direction is smooth and locally Lipschitz, so a local solution exists by [F3]. The output-layer weights and bias have bounded speed because all hidden activations are bounded by , so they remain bounded on every compact time interval. Suppose the parameters in layers are bounded on such an interval. Backpropagating through those layers multiplies the direction by their finite weight matrices and factors of modulus at most , so each coordinate of the backpropagated direction at layer is bounded. The gradient formulas in [F4], together with , then bound every derivative in layer ; integration bounds its weights and biases. Descending induction bounds all parameters on every compact interval. If the maximal local solution had a finite endpoint, the smooth vector field would be bounded on a compact ball containing the trajectory, so the trajectory would be Lipschitz in time and have a limit as the endpoint is approached. Applying [F3] at that limit extends the solution, a contradiction. Hence the path exists on . On any compact tube around a finite solution segment the vector field is Lipschitz; subtracting the integral equations for two solutions gives on the tube for a Lipschitz constant ; iterating this inequality gives , proving local continuous dependence on the initial parameters. A finite cover of patches these local flow maps. Thus the global path is measurable as a function of initialization and time. For this direction, at every time, so its integral is .
Step 1.1 supplies the globally Lipschitz activation and bounded second derivative, and step 2.1 supplies a finite-width solution and the required direction bound. Applying [F4] with gives in probability under the stated sequential hidden-width limit.
An NTK eigenmode decays exponentially under least squares
Example
Assume AC. Fix , a depth , a bias scale , and a globally Lipschitz nonpolynomial activation . Use the source-normalized network with scalar output and independent standard-normal initialization, and let be pairwise distinct points of . Let be the limiting neural tangent Gram matrix on these inputs given by the sequential infinite-width theorem. Choose a unit eigenvector of with eigenvalue . For labels and , initialize the limiting empirical least-squares kernel flow by and solve
Then . The error stays entirely in this one kernel mode, and its Euclidean norm decays by the factor .
Example references
Jacot, Gabriel, and Hongler, §5, least-squares kernel eigenmodes
Distinct sphere inputs give strictly positive Gram eigenvalues
The deterministic limiting Gram matrix from the sequential width limit
Least-squares NTK flow decays mode by mode and fits distinct sphere data: Each residual eigenmode evolves by
Facts & Assumptions
Given: AC; the source-normalized scalar-output model; , , , a globally Lipschitz nonpolynomial activation; pairwise distinct unit-sphere inputs; a unit eigenvector of their sequential limiting Gram matrix with eigenvalue ; target vector ; and initial prediction with .
Distinct sphere inputs under the proposition's assumptions have a positive-definite limiting NTK Gram matrix (The limiting neural tangent kernel is strictly positive definite on every unit sphere).
Least-squares kernel flow multiplies an eigenmode residual by (Least-squares NTK flow decays mode by mode and fits distinct sphere data).
Verification
The initial residual is . Since is a unit eigenvector with eigenvalue , [F2] gives .
Taking norms and using yields , which tends to zero because . This is the single positive mode asserted in the Example.
Duplicate inputs make the unquotiented NTK Gram matrix singular
Example
Let be a set, let be a symmetric positive-semidefinite kernel, fix , and use two observations at that same input. Their Gram matrix is , where . For labels and initial prediction , consider the two-point empirical least-squares kernel flow
The vector is a zero-eigenvalue mode of , and the residual component in this mode remains unchanged, so the flow cannot reach . The unquotiented Gram matrix has rank at most one. In particular, assume AC, fix , , , and a globally Lipschitz nonpolynomial activation , and use the width-normalized fully connected network with fan-in scaling , bias scale , scalar output, and independent standard-normal initialization. For any , its sequential hidden-width limit kernel has by the sphere-positivity proposition, but the Gram matrix for two observations at is still singular. This does not conflict with that proposition, which asserts strict positivity only for finite lists of pairwise distinct sphere points.
Example references
Facts & Assumptions
Given: A set , a symmetric positive-semidefinite scalar kernel , and two identical input observations at , so ; labels ; initial prediction ; and, for the sphere comparison, AC, , , , a globally Lipschitz nonpolynomial activation, the stated width-normalized scalar-output network, and .
A kernel Gram matrix on an input list has entries given by evaluating the kernel at each ordered input pair; in particular, repeating the input makes all four entries equal to .
Verification
Repeating the input makes every matrix entry equal to , so . Multiplication gives for . Thus has rank at most one and the target lies entirely in its nullspace.
Set . The flow equation, symmetry of , and give . Since , this residual component stays nonzero for every , so at every finite time and the flow cannot converge to . This is consistent with the sphere proposition because its strictness conclusion requires pairwise distinct inputs.
Source notes
[F2] For the source-normalized limiting NTK flow, least-squares residual components in zero-eigenvalue modes remain constant (Least-squares NTK flow decays mode by mode and fits distinct sphere data); the more general two-point claim here is checked directly above.