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.
A finite positive-definite kernel flow converges for an attained convex cost
Statement
Let be a finite-dimensional real inner product space. Let be self-adjoint and positive definite, meaning for every . Let be continuously differentiable, convex, and have a locally Lipschitz gradient, where and locally Lipschitz means Lipschitz on every compact subset of . Assume attains its global minimum at . For every initial state , the solution of
exists uniquely for all and converges to a global minimizer of as . In particular, for a finite data set of size , a symmetric positive-definite Gram matrix gives this conclusion for the kernel-flow equation with .
Statement references
Facts & Assumptions
Given: The finite-dimensional real inner product space , the self-adjoint positive-definite map , the continuously differentiable convex cost with locally Lipschitz gradient, a minimizer , and initial value .
A self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
A positive-semidefinite kernel has symmetric positive-semidefinite finite Gram matrices (Positive semidefinite kernels and reproducing kernel Hilbert spaces).
A continuous vector field locally Lipschitz in the state has a unique local solution through each initial state (Picard-Lindelöf local existence and uniqueness for first-order systems).
A closed bounded subset of Euclidean is compact for every (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
The derivative of a finite-dimensional composition is the composition of total derivatives (The chain rule for total derivatives: ).
Proof
By [F1], has an orthonormal eigenbasis; self-adjointness and positive definiteness make each eigenvalue positive. Thus exists, is self-adjoint and positive definite, and is a norm squared. Since is locally Lipschitz, the vector field is locally Lipschitz and [F3] gives a unique local solution.
For , convexity gives . Subtract , divide by , and let ; differentiability and the definition of give . Along any solution, expanding the squared inverse-metric norm to first order then gives Hence the solution remains in the closed -metric ball centered at through . In orthonormal coordinates its radius bounds the Euclidean norm because the smallest eigenvalue of is positive, and continuity of that norm makes the ball closed. If , [F4] makes it compact; if , it is a subset of the singleton and is compact.
The vector field is bounded and Lipschitz on a compact neighborhood of this ball. Picard–Lindelöf therefore supplies a uniform positive local existence time at every point of the ball. If the maximal forward solution had a finite endpoint, boundedness of the vector field would make Cauchy as approached that endpoint; its limit lies in the ball, and the uniform local solution there extends the original solution, a contradiction. Thus the solution exists uniquely for all .
Integrating the inequality in step 2.1 over gives . By [F5] and the flow equation, . The gap is therefore nonnegative, nonincreasing and integrable; it tends to zero.
The trajectory lies in a compact set, so it has a convergent subsequence with . Continuity of and step 4.1 give , so is a global minimizer. Apply step 2.1 with in place of : the distance is nonincreasing and has a subsequence tending to zero, hence tends to zero. Thus the full trajectory converges to .
For a finite data set, [F2] makes symmetric positive semidefinite; if it is positive definite, then is self-adjoint positive definite because . The preceding argument applies.
Depends on
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Real and complex inner product spaces, with the inner product linear in the first argument
- Positive semidefinite kernels and reproducing kernel Hilbert spaces
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Picard-Lindelöf local existence and uniqueness for first-order systems
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Arthur Jacot, Franck Gabriel, and Clément Hongler, Neural Tangent Kernel: Convergence and Generalization in Neural Networks (standard reference, not scraped)