Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

70 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