Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 V be a finite-dimensional real inner product space. Let A:V→V be self-adjoint and positive definite, meaning ⟨v,Av⟩>0 for every v≠0. Let C:V→R be continuously differentiable, convex, and have a locally Lipschitz gradient, where DC(z)[v]=⟨∇C(z),v⟩ and locally Lipschitz means Lipschitz on every compact subset of V. Assume C attains its global minimum at z∗∈V. For every initial state z0∈V, the solution of

z˙(t)=−A∇C(z(t)),z(0)=z0,

exists uniquely for all t≥0 and converges to a global minimizer of C as t→∞. In particular, for a finite data set of size N≥1, a symmetric positive-definite Gram matrix K gives this conclusion for the kernel-flow equation with A=K/N.

Facts & Assumptions

Given: The finite-dimensional real inner product space V, the self-adjoint positive-definite map A, the continuously differentiable convex cost C with locally Lipschitz gradient, a minimizer z∗, and initial value z0.

[F1]

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).

[F2]

A positive-semidefinite kernel has symmetric positive-semidefinite finite Gram matrices (Positive semidefinite kernels and reproducing kernel Hilbert spaces).

[F3]

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).

[F5]

The derivative of a finite-dimensional composition is the composition of total derivatives (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · use the inverse-kernel metric to bound the orbit, then use convexity and integrability of the cost gap to identify its limit points
1.1F1F3givenalgebra

By [F1], A has an orthonormal eigenbasis; self-adjointness and positive definiteness make each eigenvalue positive. Thus A−1 exists, is self-adjoint and positive definite, and ∥v∥A−12:=⟨v,A−1v⟩ is a norm squared. Since ∇C is locally Lipschitz, the vector field −A∇C is locally Lipschitz and [F3] gives a unique local solution.

2.1F1F4step 1.1givenalgebra

For 0<s≤1, convexity gives C(z+s(z∗−z))≤(1−s)C(z)+sC(z∗). Subtract C(z), divide by s, and let s↓0; differentiability and the definition of ∇C give ⟨∇C(z),z∗−z⟩≤C(z∗)−C(z). Along any solution, expanding the squared inverse-metric norm to first order then gives ddt∥z−z∗∥A−12=−2⟨z−z∗,∇C(z)⟩≤−2(C(z)−C(z∗))≤0. Hence the solution remains in the closed A−1-metric ball centered at z∗ through z0. In orthonormal coordinates its radius bounds the Euclidean norm because the smallest eigenvalue of A−1 is positive, and continuity of that norm makes the ball closed. If dim⁡V≥1, [F4] makes it compact; if dim⁡V=0, it is a subset of the singleton V={0} and is compact.

3.1F3F4step 2.1algebra

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 z(t) Cauchy as t 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 t≥0.

4.1F5step 2.1step 3.1algebra

Integrating the inequality in step 2.1 over [0,T] gives ∫0T(C(z(t))−C(z∗)) dt≤12∥z0−z∗∥A−12. By [F5] and the flow equation, ddtC(z(t))=−⟨∇C(z(t)),A∇C(z(t))⟩≤0. The gap is therefore nonnegative, nonincreasing and integrable; it tends to zero.

5.1F4step 2.1step 4.1

The trajectory lies in a compact set, so it has a convergent subsequence z(tj)→zˉ with tj→∞. Continuity of C and step 4.1 give C(zˉ)=C(z∗), so zˉ is a global minimizer. Apply step 2.1 with zˉ in place of z∗: the distance ∥z(t)−zˉ∥A−1 is nonincreasing and has a subsequence tending to zero, hence tends to zero. Thus the full trajectory converges to zˉ.

6.1F2step 1.1algebra∎

For a finite data set, [F2] makes K symmetric positive semidefinite; if it is positive definite, then A=K/N is self-adjoint positive definite because N≥1. The preceding argument applies.

Depends on

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