Alphabeta Math
Pipeline-generated
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

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A finite-width quadratic feature network has a changing NTK

Example

Consider the scalar one-hidden-unit model fa,w(1)=aw2 with parameters (a,w)∈R2 and cost C(a,w)=12fa,w(1)2. At (a,w)=(1,1), gradient flow for this cost has a˙=−1 and w˙=−2. Its two parameter features are ∂af=w2 and ∂wf=2aw, and its neural tangent kernel at the single input is K(a,w)=w4+4a2w2. Along the local gradient-flow solution from (1,1), both features change immediately and ddtK(a(t),w(t))∣t=0=−32, so this finite-width model does not have a fixed NTK.

Facts & Assumptions

Given: The model fa,w(1)=aw2, the cost C=12f2, and initial parameters (a,w)=(1,1).

[F1]

The scalar neural tangent kernel is the sum of squares of the parameter derivatives (The neural tangent kernel of a differentiable parameterized function).

[F2]

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

technique · direct differentiation
1.1F1givenalgebra

Differentiating f=aw2 gives ∂af=w2 and ∂wf=2aw. By [F1], K(a,w)=(w2)2+(2aw)2=w4+4a2w2. At (1,1), f=1, ∂aC=fw2=1, and ∂wC=2faw=2, so the negative-gradient vector field has the stated initial velocity.

2.1F2step 1.1algebra∎

The vector field (a˙,w˙)=(−aw4,−2a2w3) is polynomial, hence locally Lipschitz; [F2] gives a differentiable local solution through (1,1). Along it, ddtK=4w3w˙+8aw2a˙+8a2ww˙, which equals −8−8−16=−32 at t=0. Also ddt(w2)∣0=2ww˙=−4 and ddt(2aw)∣0=2(a˙w+aw˙)=−6, so both parameter features vary. A differentiable scalar function with nonzero derivative at zero is not constant on any right neighborhood of zero.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A wide tanh network stays lazy on a fixed time horizon

Example

Assume AC. Fix N,n0≥1, a data set x1,…,xN∈Rn0, a depth L≥2, a bias scale β>0, and the scalar-output source-normalized network with independent standard-normal initialization under its product law. Let σ(u)=tanh⁡u=(e2u−1)/(e2u+1). For each finite hidden-width tuple, take the unique gradient-flow path as a measurable function of the initialized parameters on [0,1], satisfying

θ˙p(t)=−1N∑i=1N∂θpfθ(t)(xi),0≤t≤1,

so the empirical training direction is di(t)=1 for every datum and time. The finite-width path exists on every finite interval, and its integrated empirical direction norm on [0,1] equals 1. Consequently, as the hidden widths tend to infinity sequentially, the finite-data neural tangent kernel remains uniformly close in probability on [0,1] to the deterministic recursive limiting kernel K∞ for this network and data set.

Facts & Assumptions

Given: σ(u)=tanh⁡u, a fixed finite data set and finite depth, the positive bias scale, the source-normalized scalar-output network, and the constant training direction.

[F3]

A locally Lipschitz finite-dimensional vector field has a unique local solution (Picard-Lindelöf local existence and uniqueness for first-order systems).

[F4]

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

technique · verify the activation and direction hypotheses, then apply the sequential-width theorem
1.1F1F2givenalgebra

Put a=e2u>0. Then ∣a−1∣<a+1, so ∣σ(u)∣<1. The derivative rules in [F1] give σ′(u)=4e2u/(e2u+1)2=1−σ(u)2 and σ′′(u)=−2σ(u)σ′(u). Thus ∣σ′∣≤1 and ∣σ′′∣≤2. By [F2], ∣σ(u)−σ(v)∣≤∣u−v∣, so σ is globally Lipschitz. Since σ′(u)>0, it is nonconstant; a polynomial of degree m≥1 with leading coefficient am≠0 satisfies p(u)/um→am as u→+∞, so its absolute value is unbounded. The bounded nonconstant σ is therefore nonpolynomial.

2.1F3F4givenstep 1.1algebra

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 1, so they remain bounded on every compact time interval. Suppose the parameters in layers k+1,…,L−1 are bounded on such an interval. Backpropagating through those layers multiplies the direction by their finite weight matrices and factors σ′ of modulus at most 1, so each coordinate of the backpropagated direction at layer k+1 is bounded. The gradient formulas in [F4], together with ∣σ∣≤1, then bound every derivative in layer k; 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 [0,1]. On any compact tube around a finite solution segment the vector field is Lipschitz; subtracting the integral equations for two solutions gives u(t)≤u(0)+M∫0tu(s) ds on the tube for a Lipschitz constant M; iterating this inequality gives u(t)≤eMtu(0), proving local continuous dependence on the initial parameters. A finite cover of [0,1] patches these local flow maps. Thus the global path is measurable as a function of initialization and time. For this direction, ∥d(t)∥N=1 at every time, so its integral is 1.

3.1F4step 1.1step 2.1∎

Step 1.1 supplies the globally Lipschitz C2 activation and bounded second derivative, and step 2.1 supplies a finite-width solution and the required direction bound. Applying [F4] with T=1 gives sup⁡t∈[0,1]∥Kt−K∞∥op→0 in probability under the stated sequential hidden-width limit.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

An NTK eigenmode decays exponentially under least squares

Example

Assume AC. Fix N,n0≥1, a depth L≥2, a bias scale β>0, and a globally Lipschitz nonpolynomial activation σ:R→R. Use the source-normalized network with scalar output and independent standard-normal initialization, and let x1,…,xN be pairwise distinct points of Sn0−1={x∈Rn0:∥x∥2=1}. Let K∞ be the limiting neural tangent Gram matrix on these inputs given by the sequential infinite-width theorem. Choose a unit eigenvector v∈RN of K∞ with eigenvalue λ>0. For labels y∈RN and a≠0, initialize the limiting empirical least-squares kernel flow by f0=y+av and solve

f˙(t)=−1NK∞(f(t)−y).

Then f(t)=y+ae−tλ/Nv. The error stays entirely in this one kernel mode, and its Euclidean norm decays by the factor e−tλ/N.

Facts & Assumptions

Given: AC; the source-normalized scalar-output model; N,n0≥1, L≥2, β>0, a globally Lipschitz nonpolynomial activation; pairwise distinct unit-sphere inputs; a unit eigenvector v of their sequential limiting Gram matrix with eigenvalue λ>0; target vector y; and initial prediction f0=y+av with a≠0.

[F1]

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

[F2]

Least-squares kernel flow multiplies an eigenmode residual by e−tλ/N (Least-squares NTK flow decays mode by mode and fits distinct sphere data).

Verification

technique · substitute the single-mode initial residual into the exact eigenmode formula
1.1F1F2givenalgebra

The initial residual is f0−y=av. Since v is a unit eigenvector with eigenvalue λ>0, [F2] gives f(t)−y=ae−tλ/Nv.

2.1F2step 1.1algebra∎

Taking norms and using ∥v∥2=1 yields ∥f(t)−y∥2=∣a∣e−tλ/N, which tends to zero because λ/N>0. This is the single positive mode asserted in the Example.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Duplicate inputs make the unquotiented NTK Gram matrix singular

Example

Let X be a set, let k:X×X→R be a symmetric positive-semidefinite kernel, fix x∈X, and use two observations at that same input. Their Gram matrix is K=κ(1111), where κ=k(x,x)≥0. For labels y=(1,−1)T and initial prediction f0=(0,0)T, consider the two-point empirical least-squares kernel flow

f˙(t)=−12K(f(t)−y),f(0)=f0.

The vector v−=(1,−1)T/2 is a zero-eigenvalue mode of K, and the residual component in this mode remains unchanged, so the flow cannot reach y. The unquotiented Gram matrix has rank at most one. In particular, assume AC, fix n0≥1, L≥2, β>0, and a globally Lipschitz nonpolynomial activation σ:R→R, and use the width-normalized fully connected network with fan-in scaling 1/nℓ, bias scale β, scalar output, and independent standard-normal initialization. For any x∈Sn0−1, its sequential hidden-width limit kernel K∞ has K∞(x,x)>0 by the sphere-positivity proposition, but the Gram matrix for two observations at x is still singular. This does not conflict with that proposition, which asserts strict positivity only for finite lists of pairwise distinct sphere points.

Facts & Assumptions

Given: A set X, a symmetric positive-semidefinite scalar kernel k:X×X→R, and two identical input observations at x∈X, so κ=k(x,x)≥0; labels (1,−1)T; initial prediction (0,0)T; and, for the sphere comparison, AC, n0≥1, L≥2, β>0, a globally Lipschitz nonpolynomial activation, the stated width-normalized scalar-output network, and x∈Sn0−1.

[F1]

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 k(x,x).

Verification

technique · compute the two-by-two Gram eigenvectors and inspect the inconsistent target component
1.1F1givenalgebra

Repeating the input makes every matrix entry equal to κ, so K=κ(1111). Multiplication gives Kv−=0 for v−=(1,−1)T/2. Thus K has rank at most one and the target y=(1,−1)T=2v− lies entirely in its nullspace.

2.1givenstep 1.1algebra∎

Set r−(t)=v−T(f(t)−y). The flow equation, symmetry of K, and Kv−=0 give r˙−(t)=−12v−TK(f(t)−y)=−12(Kv−)T(f(t)−y)=0. Since r−(0)=−2, this residual component stays nonzero for every t≥0, so f(t)≠y at every finite time and the flow cannot converge to y. 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.

Sources