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.

Simultaneous initialization estimates for the Du architectures

Statement

Use either of the two architectures, its own terminal population kernel K, and independent Gaussian initialization. Assume AC, DC and countable choice and the activation and bounded-label hypotheses of the convergence theorems. Fix 0<δ<1. Write λ=λmin⁡(K)>0, q=1+log⁡(16/δ) and M=1+log⁡(16mnH/δ). There are constants A≥2 and C≥1, depending only on the fixed activation bounds, its normalizer, the label bound, and, in the residual case, cres, with the following property. For the fully connected case put T=AH; if

m≥Cmax⁡{Tn4/λ4,Tn/δ,Tn2log⁡(16Hn/δ)/λ2},

then with probability at least 1−δ, simultaneously:

max⁡i,h∥xi(h)(0)∥≤T,max⁡h≥2∥W(h)(0)∥op≤Cm,∥a(0)∥2≤Cm,∥a(0)∥4≤Cm1/4,

max⁡i,h∥bi,h(0)∥∞≤TM,λmin⁡(JH(0)JH(0)T)≥3λ/4,∥u(0)−y∥2≤Tnq.

Here JH is the Jacobian block of the last hidden-layer matrix, and bi,h is the derivative of the scalar output with respect to the hidden feature vector xi(h), so bi,H=a. In the residual case H≥2, the same conclusions hold with T replaced everywhere in the conclusions by C, provided

m≥Cmax⁡{n4H6/λ4,n2/(λ2H2),n/δ,n2log⁡(16Hn/δ)/λ2}.

For residual depth one use the fully connected case. Constants may be enlarged, and A may be increased, simultaneously in these conclusions.

Facts & Assumptions

Given: The architecture, its population recursion, the data, Gaussian initialization, width and confidence parameters in the Statement.

[F1]

The architecture-specific population recurrences, including residual means, and their positive semidefiniteness are supplied locally. Fully connected and residual networks with the Du Gram kernel The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite

[F2]

Lipschitz functions of a standard Gaussian vector obey the stated one-sided concentration inequality; applying it to both signs gives a two-sided bound. Lipschitz concentration for standard Gaussian measure

[F3]

Gaussian vectors have the stated covariance and even moments (2p−1)!!. Multivariate normal law, including singular covariance Gaussian even moments for Brownian increments

[F4]

Conditional on hidden features, the Gaussian output norm is at most the square root of their total squared norm plus their operator norm times 2log⁡(1/ε), with failure probability at most ε. Gaussian output initialization concentrates conditionally on the hidden features

[F5]

If X,Y have finite second moments, then E∣XY∣≤(EX2)1/2(EY2)1/2; expanding a square and applying this bound gives the L2 triangle estimate used for residual feature variances. Cauchy-Schwarz for random variables

[F7]

A nondegenerate bivariate normal vector has its Gaussian Lebesgue density. A positive-definite multivariate normal law has its Gaussian density

[F8]

Differentiation may pass through an integral when parameter derivatives have a common integrable majorant. Differentiation under the integral sign

[F10]

Dominated convergence passes limits through integrals under a common integrable majorant. Dominated convergence

[F11]

For nonnegative Y and a>0, P(Y≥a)≤EY/a. Markov's inequality for random variables

[F12]

For square-integrable Y and a>0, P(∣Y−EY∣≥a)≤Var⁡(Y)/a2. Chebyshev's inequality for random variables

[F13]

A real function continuous on a compact interval and differentiable in its interior has some derivative equal to its average rate of change; this turns the bounded ρ-derivatives in step 2.1 into Lipschitz bounds. The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)

[F14]

Analyticity gives σ′′, and the β-Lipschitz property of σ′ gives ∣σ′′∣≤β wherever needed in step 2.1. [given]

[F16]

A 1/4-net of the Euclidean unit sphere in Rm exists with at most 9m points. Finite epsilon nets of the Euclidean sphere

[F17]

Matrix operator norms are induced by the Euclidean vector norm. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

[F18]

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

[F19]

The Frobenius norm is the Euclidean norm of the matrix entry list, ∥Φ∥F2=∑i,rΦir2; for any unit v, Euclidean Cauchy–Schwarz gives ∥Φv∥22=∑i(∑rΦirvr)2≤∑i,rΦir2, hence ∥Φ∥op≤∥Φ∥F. The Frobenius norm ∥A∥F=(∑i,j∣aij∣2)1/2 on real or complex matrices Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation

[F15]

In the residual coupling, the feature vector and fresh Gaussian vector are independent, so Cov⁡(V+ασ(G))=Cov⁡(V)+α2Cov⁡(σ(G))⪰Cov⁡(V). This is the construction in The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite and yields the monotone variance lower bound in step 4.1.

[F20]

For finitely many independent real random variables, expectations of products of nonnegative Borel functions factor, including when the expectations are extended nonnegative values. Expectations factor over finite products of independent random variables

[F21]

The probability of a finite union of events is at most the sum of their probabilities. The finite union bound

Proof

1.1F2F3F5F11F20givenalgebra

We give the scalar estimates used below explicitly. If U,V are centered Gaussian variables with variances at most a fixed Q, then ∣σ(z)∣≤B+L∣z∣ and [F3] imply ∥σ(U)∥2p≤Cp; [F5] then gives ∥σ(U)σ(V)∥p≤Cp for integers p≥2. The same last bound holds for a2σ′(U)σ′(V) when a is an independent standard normal, because ∣σ′∣≤L. After centering, each such variable X satisfies E∣X∣p≤p!Cp, enlarging C using pp≤epp!. Expanding its exponential series, for ∣t∣≤1/(2C) one has EetX≤1+∑p≥2(C∣t∣)p≤e2C2t2. For m independent copies, [F20] factors the exponential moment of their sum. Applying [F11] to exp⁡(t∑rXr) with t=s/(4C2), and then to exp⁡(−t∑rXr), to obtain P(∣m−1∑rXr∣>s)≤2e−cms2 for 0<s≤c. All constants are uniform over the covariances with these variance bounds.

2.1F3F5F7F8F9F10step 1.1algebraF13

The Gaussian expectation maps needed in the population recurrences are Lipschitz functions of the three entries of their bivariate covariance on any region v≤Qii,Qjj≤Q, where v>0 is fixed. This applies to E[g(U)g(V)] for g=σ and g=σ′, and to the residual marginal map s↦Eσ(sZ). At fixed ρ, changing s,t changes these expectations by at most C(∣Δs∣+∣Δt∣): use the Lipschitz constants L,β, s,t≥v, and [F5] to bound the resulting products. For fixed s,t and ∣ρ∣<1, the covariance matrix is positive definite, so [F7] supplies the density ϕs,t,ρ. On any compact interval ∣ρ∣≤r<1, its eigenvalues lie between v(1−r) and Q(1+r). Direct differentiation of the Gaussian density gives ∂ρϕs,t,ρ=st ∂u∂vϕs,t,ρ. Uniform eigenvalue bounds imply that ∣g(u)g(v)∂ρϕs,t,ρ(u,v)∣ is bounded by an integrable polynomial times e−c(u2+v2), uniformly on this interval; g has at most linear growth and g′ is bounded. Thus [F8] justifies differentiating the expectation under the integral. On finite rectangles apply [F9] successively in u and v; the boundary terms tend to zero as the rectangles expand because of Gaussian decay and the growth bound. The same integrable majorant and [F10] pass the rectangle limits, giving ∂ρE[g(U)g(V)]=stE[g′(U)g′(V)]. Its absolute value is at most QL2 for g=σ and Qβ2 for g=σ′, since ∣σ′∣≤L and ∣σ′′∣≤β. At ρ=±1, the representation U=sZ, V=t(ρZ+1−ρ2Z′) is dominated after multiplication by either pair of activations by C(1+∣Z∣+∣Z′∣)2, which is integrable; [F10] gives continuity at both endpoints. Finally ρ=Qij/st is Lipschitz in the covariance entries when s,t≥v.

3.1F1F3F21step 1.1step 2.1algebra

Write S^ij(h)=⟨xi(h)(0),xj(h)(0)⟩ and, for residual layers, b^i(h)=m−1/2∑rxi,r(h)(0). Conditional on previous layers, the preactivation pairs in distinct rows are independent centered Gaussians with covariance given by S^(h−1). In the fully connected case, step 1.1 bounds each difference of S^ij(h) from its conditional mean by Ct0, except with probability δ/(32Hn2), where t0=log⁡(64Hn2/δ)/m. Its conditional mean is exactly the fully connected population expectation evaluated at S^(h−1). Since the population diagonal is one, step 2.1 gives, while the error is at most a fixed small constant, eh≤Ceh−1+Ct0, where eh=max⁡ij∣S^ij(h)−Kij(h)∣ and e0=0. If B>1 is a fixed base for this recurrence, then eh≤BHt0 after enlarging its prefactor. Choose the statement constant A≥B2 and enlarge the width constant; its term Tn2log⁡(16Hn/δ)/λ2, with T=AH, then makes this error smaller than both the fixed stopping threshold and cλ/n. Conditional bounds and the finite union bound [F21] over h,i,j therefore justify the estimates through layers h<H; the last hidden-feature norm is bounded by one further conditional application of the activation moment estimate, without identifying its covariance with the terminal derivative kernel. A first layer crossing the stopping threshold would contradict this recurrence. In particular all feature norms are bounded by a constant, hence by T.

4.1F1F2F3F21step 1.1step 2.1step 3.1algebraF15

In the residual case the population feature variances lie in a fixed compact interval [v,Q] independent of H. Indeed the vector construction in [F1] gives S(h)−b(h)(b(h))T⪰S(1)−b(1)(b(1))T, whose diagonal is v=cσVar⁡(σ(Z))>0. Positivity of v follows from nonconstancy, continuity and the positive Gaussian density. Also Sii(h)≤Sii(h−1)+α(B+LSii(h−1)) with α=cres/H, so iteration gives a fixed upper bound. The empirical conditional mean satisfies exactly the same residual second-moment/mean recursion with S,b replaced by S^,b^. The nonlinear quadratic part has conditional fluctuation at most Cα2t0 by step 1.1. Each cross part is αm−1/2∑rxi,r(h−1)σ(Uj,r); its centered value has absolute size at most Cαt0 by [F2], since its Lipschitz constant in the independent row Gaussians is at most Cα∥xi(h−1)∥/m. The empirical mean has fluctuation at most Cαt0 by [F2]. Step 2.1 now yields eh≤(1+C/H)eh−1+Ct0/H, taking the maximum of the covariance and mean errors. The first layer has e1≤Ct0 by step 1.1 and [F2]. Hence eh≤Ct0 uniformly in H. The width assumption and the same stopping argument, now in [v/2,2Q], justify the conditional estimates and give the feature bound through h<H; the finite union bound [F21] combines their layerwise failure probabilities. One further conditional step gives ∥xi(H)∥≤C, using the same upper-norm recurrence, so max⁡i,h∥xi(h)∥≤C.

5.1F1F3F6F21step 1.1step 2.1step 3.1step 4.1algebra

For either architecture, conditional on layers before the last, the last-hidden-layer Jacobian Gram entries are sH2S^ij(H−1)m−1∑rar2σ′(zi,r)σ′(zj,r), where sH2=cσ for the fully connected case and sH2=cres2/H2 for residual H≥2. This follows by differentiating the last layer. The summands are independent across r. Steps 1.1–2.1, the feature bounds and errors just proved give entry error at most B2Ht0 in the fully connected case, for a fixed base B2 depending only on the fixed activation bounds, and at most Ct0/H2 in the residual case. Choose the statement constant A also with A≥B22; the displayed logarithmic width term and a sufficiently large fixed multiplier then make both errors at most λ/(4n). A finite union bound [F21] covers the terminal-kernel entry events. If an n×n matrix E has entries bounded by ε, then for any z, ∥Ez∥2≤n ε∑j∣zj∣≤nε∥z∥2 by [F6], hence ∥E∥op≤nε. Thus ∥JHJHT−K∥op≤λ/4. Both matrices are symmetric, and for every z, zTJHJHTz≥zTKz−∣zTEz∣≥(λ−∥E∥op)∥z∥22≥3λ∥z∥22/4, where E=JHJHT−K. The Rayleigh-quotient characterization of the smallest eigenvalue now gives λmin⁡(JHJHT)≥3λ/4.

5.2F2F3F6F12F16F21step 3.1step 4.1constructalgebraF17F18

By [F16], choose a 1/4-net N of the unit sphere with at most 9m points. The Euclidean norm duality ∥z∥2=sup⁡∥x∥2=1∣xTz∣ follows from [F6], so ∥W∥op=sup⁡∥x∥=∥y∥=1∣xTWy∣. For unit x,y, choose v,w∈N within 1/4 of them. Then [F6] gives ∣xTWy−vTWw∣≤∥x−v∥2∥Wy∥2+∥v∥2∥W(y−w)∥2≤12∥W∥op. Taking suprema yields ∥W∥op≤2max⁡v,w∈N∣vTWw∣. Each vTWw is standard normal, whose tail is at most 2e−t2/2 by [F2]. The finite union bound [F21] gives ∥W(h)∥≤Cm for all h≥2 with failure at most δ/16 when m≥Clog⁡(16H/δ), which follows from either displayed width because λ≤cσL2 in the fully connected case and λ≤C/H2 in the residual case. The latter bound follows by bounding the diagonal of its terminal kernel with step 4.1. Gaussian second and eighth moments and [F12] give ∥a∥2≤Cm and ∥a∥4≤Cm1/4 with failure at most δ/16 when m≥C/δ, also implied by the widths. These arguments never bound ∥W(1)∥ on the whole input space, so no input-dimension condition is used.

6.1F2F3F4F21step 3.1step 4.1step 5.1step 5.2F19

Conditional on hidden weights, bi,h(0)=Pi,hTa, where Pi,h is the product of downstream feature Jacobians. Their operator norms have fixed envelopes BH in the fully connected case and B in the residual case, using ∏l>h(1+C/H)≤eC for residual layers. Increase the conclusion constants so these envelopes are at most T/2 and C/2, respectively. Each coordinate is centered Gaussian of variance at most (T/2)2 or (C/2)2. Since M2=1+log⁡(16mnH/δ), its two-sided tail is at most 2e−2M2≤δ/(8mnH); the finite union bound [F21] over at most mnH coordinates gives the asserted coordinate maxima with failure at most δ/8. Finally [F4] and ∥Φ∥op≤∥Φ∥F≤nmax⁡i∥xi(H)∥ give ∥u(0)∥≤CTnq or Cnq with failure at most δ/16.

7.1F2F21step 3.1step 4.1step 5.1step 5.2step 6.1algebra∎

By the finite union bound [F21], allocate at most δ/(32Hn2) to each fully connected feature-covariance or terminal-feature-norm event in step 3.1; there are at most 2Hn2 such events. Allocate at most δ/(128Hn2) to each residual covariance, cross-term, mean, or terminal-feature-norm event in step 4.1; there are at most 4Hn2 such events. Allocate at most δ/(64n2) to each terminal-kernel entry event. The weight-matrix and readout norm events in step 5.2 each use δ/16; backward coordinates use δ/8 and the output norm uses δ/16 in step 6.1. Even summing both architecture allocations, these budgets total at most 27δ/64<δ. The thresholds are constant multiples of t0 or M; increasing the fixed constants in the width and conclusions makes each displayed concentration bound meet its allocation without changing their forms. Adding the deterministic bounded-label contribution proves the simultaneous event.

Depends on

Used by

Dependency tree · two levels

139 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