Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Parameter-ball control of the last-layer Gram and loss Hessian

Statement

Fix finite real parameters obeying either Du architecture recurrence, with all parameters equipped with the Euclidean norm (Frobenius norm on each matrix block). At a fixed initialization assume all hidden feature norms are at most Bx, all matrices W(h)(0) with h≥2 have operator norm at most Bwm, ∥a(0)∥2≤Bam, ∥a(0)∥4≤B4m1/4, and all backward feature derivatives bi,h(0)=∇xi(h)fi have coordinate maxima at most BbM, where M≥1. For fully connected networks allow Bx,Bb≤A0H for a fixed A0≥2, while Bw,Ba,B4 are fixed independent of H. There are A≥2,C≥1 depending only on A0, these fixed bounds and the activation, with the following bounds; write T=AH. In the residual case the constants depend also on fixed cres, and every T below is replaced by a fixed C independent of H. Uniformly on any parameter ball ∥θ−θ0∥≤D with D/m≤c/T (fully connected) or D/m≤c (residual),

max⁡i,h∥xi(h)(θ)−xi(h)(θ0)∥≤TD/m,∥J(θ)∥op≤Tn,

max⁡i∥∇2fi(θ)∥op≤TM(1+D)m,∥JH(θ)JH(θ)T−JH(θ0)JH(θ0)T∥op≤TnDm.

In the residual last inequality the upper bound is CnD/(H2m) for H≥2. The residual first-layer and output-vector derivatives are bounded without a factor 1/H. Consequently, if r0=u(θ0)−y and L=12∥u−y∥2, the loss Hessian on the ball satisfies

∥∇2L∥op≤Tn+Tn (∥r0∥+TnD)M(1+D)m.

The constants in this last bound can again be fixed independent of H for residual networks. For any segment from θ to θ+h contained in the ball, its output Taylor remainder satisfies

∥u(θ+h)−u(θ)−J(θ)h∥≤TnM(1+D)2m∥h∥2,

with T replaced by fixed C in the residual case.

Facts & Assumptions

Given: The deterministic initialization bounds, the architecture, the parameter ball, and fixed activation constants ∣σ(0)∣≤B, ∣σ′∣≤L, ∣σ′′∣≤β.

[F1]

The architectures and scalings are defined locally. Fully connected and residual networks with the Du Gram kernel

[F2]

The chain rule gives the forward variations and backward feature derivatives of the finite network. Reverse accumulation sums gradients over shared parameter uses

[F3]
[F4]

Restricting a scalar C2 output to a parameter line segment gives the first-order Taylor formula with integral remainder used in step 5.1. Taylor's theorem with an integral remainder

[F5]

A C1 vector-valued map whose derivative norm is bounded by M on a segment is M-Lipschitz along that segment. If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz

[F6]

Matrix operator norms are the induced norms on finite-dimensional inner-product spaces, and the parameter norm uses the Frobenius norm on matrix blocks. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices

[F7]

For p=4, ∥a∥4=(∑r∣ar∣4)1/4. The p-norms ∥x∥p for rational p≥1, and ∥x∥∞

Proof

1.1F1F2givenalgebraF6

Write zh=Whxh−1 and s1=cσ in both architectures, sh=cσ for fully connected h≥2, and sh=cres/H for residual h≥2. A layer has feature Jacobian Ph=(sh/m)diag⁡(σ′(zh))Wh in the fully connected case, and Ph=I+(sh/m)diag⁡(σ′(zh))Wh in residual layers h≥2. Within the stated ball, ∥Wh∥≤(Bw+D/m)m. Products of consecutive Ph, h≥2, therefore have norm at most AH in the fully connected case and ∏h(1+C/H)≤eC in the residual case. All estimates below use only h≥2 for matrix operator norms; the input is fixed.

2.1F1step 1.1algebra

Let eh=∥xh(θ)−xh(θ0)∥. Lipschitz continuity gives e1≤cσLD/m. For fully connected layers, eh≤Ceh−1+CA0HD/m; for residual layers it gives eh≤(1+C/H)eh−1+CD/(Hm), using the fixed upper feature bound in the residual case and the initial exponential envelope in the fully connected case. Summing the geometric recurrences gives eh≤TD/m in the first case and eh≤CD/m in the second. The imposed smallness of D/m keeps all feature norms in the required bounds and justifies the recurrences successively. Also ∥zh(θ)−zh(θ0)∥≤TD or CD, since it is bounded by ∥Wh(θ)∥eh−1+D∥xh−1(θ0)∥ for h≥2, and by D for h=1.

3.1F1F2step 1.1step 2.1algebraF3

For a unit parameter direction v, let ξh=Dxh[v]. At the first layer ∥ξ1∥≤C∥vW1∥/m. Subsequent layers obey ξh=Phξh−1+(sh/m)diag⁡(σ′(zh))vWhxh−1. The product bounds in step 1.1, the feature bounds in step 2.1, and Cauchy–Schwarz over layer blocks give max⁡h∥ξh∥≤T/m or C/m. For the residual case use ∑h≥2sh∥vWh∥≤cres(∑h≥2∥vWh∥2)1/2/H≤C, retaining the separate first-layer term. Thus ∥Dzh[v]∥≤T or C, uniformly in h. Since Dfi[v]=vaTxH+aTξH and ∥a∥≤Cm, each output gradient has norm at most T or C, proving ∥J∥≤Tn or Cn. This explicitly retains the output and first-layer terms with no 1/H bound.

3.2F2step 1.1step 2.1algebra

Put dh=bh(θ)−bh(θ0). The backward recurrence is bh−1=PhTbh, with dH=a−a0. Decompose its difference as Ph(θ)Tdh+(Ph(θ)−Ph(θ0))Tbh(θ0). The latter is the sum of a weight-difference term bounded by TshD (respectively CshD) and a gate-difference term bounded by CshBbM∥zh(θ)−zh(θ0)∥, because ∥diag⁡(σ′(zh)−σ′(zh,0))bh,0∥≤βBbM∥zh−zh,0∥. Summing the backward recurrence with the product bounds gives ∥dh∥≤TMD or CMD. Hence ∥bh(θ)∥∞≤TM(1+D) or CM(1+D). The crude ℓ2 bound ∥bh(θ)∥2≤Tm or Cm follows separately from step 1.1 and ∥a∥2≤Cm.

3.3F1F2step 2.1algebraF3F7

For the last-hidden-layer Gram, put Xi=xi(H−1), Zi=WHXi and γ=cσ or cres2/H2. Direct differentiation gives GH,ij=γ⟨Xi,Xj⟩m−1∑rar2σ′(Zi,r)σ′(Zj,r). Subtract its initialized version in three parts: feature-inner-product change, derivative-gate change with a02, and output-weight-square change. Step 2.1 bounds the first part by TD/m or CD/m before multiplying by γ. For the second part, Cauchy–Schwarz gives m−1∑ra0,r2∣ΔZi,r∣≤m−1∥a0∥42∥ΔZi∥2≤C∥ΔZi∥2/m; multiply by βL, and use step 2.1. For the third part, m−1∑r∣ar2−a0,r2∣≤m−1∥a−a0∥2(∥a∥2+∥a0∥2)≤CD/m. Feature norms and ∣σ′∣≤L bound all remaining factors. The entry error is consequently at most TD/m or CD/(H2m). The operator norm is at most n times this entry bound.

4.1F1F2step 3.1step 3.2algebra

For two unit parameter directions v,w, twice differentiating the output gives the mixed output-weight terms vaTDxH[w]+waTDxH[v], and the sum over layers of shmbhT(diag⁡(σ′′(zh))(Dzh[v]⊙Dzh[w])+diag⁡(σ′(zh))(vWhDxh−1[w]+wWhDxh−1[v])). This identity follows by differentiating every primitive twice and propagating each resulting second-order term through its downstream Jacobians; the linear skip has zero second derivative. The coordinate-product inequality ∥p⊙q∥1≤∥p∥2∥q∥2, steps 3.1–3.2, and ∑hsh≤CH or C bound the first part by TM(1+D)/m or CM(1+D)/m. The terms involving vWhDxh−1[w] use the ℓ2 backward bound and ∥Dxh−1[w]∥≤T/m or C/m; summing with Cauchy–Schwarz over matrix blocks gives the same bound. The output-weight mixed terms are at most T/m or C/m. This proves the output-Hessian bound, with polynomial factors in H absorbed into AH only for the fully connected case.

5.1step 3.1step 4.1algebraF3F4F5∎

The identity ∇2L=JTJ+∑iri∇2fi gives ∥∇2L∥≤∥J∥2+n∥r∥max⁡i∥∇2fi∥. Integrating the Jacobian along the straight segment to initialization gives ∥r∥≤∥r0∥+TnD or ∥r0∥+CnD. Substitution of steps 3.1 and 4.1 proves the claimed loss-Hessian bound, after enlarging A,C to absorb squares of fixed exponential envelopes. For each coordinate the integral Taylor formula is fi(θ+h)−fi(θ)−Dfi(θ)h=∫01(1−t)D2fi(θ+th)[h,h] dt. Step 4.1 bounds its absolute value by TM(1+D)∥h∥2/(2m) or the corresponding residual constant. Summing coordinate squares gives the stated vector Taylor bound.

Depends on

Used by

Dependency tree · two levels

79 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