Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

A positive activation mean creates a high-variance common initialization mode

Example

Assume AC, DC and countable choice. Use depth H=1, the softplus activation σ(t)=log⁡(1+et), width m≥1, and orthonormal inputs xi=ei in Rd for 1≤i≤n≤d. Let μ=E[σ(Z)] for standard normal Z, let cσ=(E[σ(Z)2])−1, put ρ=cσμ2∈(0,1), and define the hidden-feature matrix by Φir=cσ/m σ(Wr⋅(1)xi). If u=(f(xi,θ(0)))i=1n is the randomly initialized output vector and e=n−1/2(1,…,1)T, then

E[eTΦΦTe]=1+(n−1)ρ,

where Φ is the hidden-feature matrix at initialization. Consequently, for every finite C>0, there is positive probability that ∣eTu∣>Cn. A confidence-uniform bound ∥u∥2≤Cn for all confidence levels is therefore unavailable in this example; this observation does not refute the finite-width convergence theorem, whose bounds depend on δ.

Facts & Assumptions

Given: The depth-one fully connected architecture, orthonormal inputs, softplus activation, independent Gaussian initialization, and the associated hidden-feature matrix.

[F1]

At depth one, each hidden feature coordinate is cσ/m σ(W(1)xi) and each output weight is an independent standard normal. Fully connected and residual networks with the Du Gram kernel

[F2]

The normalizer cσ is finite and positive for softplus, the standard normal law has an everywhere-positive density, and its second moment is 1. The Gaussian activation normalizer is finite and positive Standard normal and normal laws Gaussian even moments for Brownian increments

[F3]

A standard Gaussian vector transformed by a fixed linear functional is normal with variance given by the corresponding quadratic form. Multivariate normal law, including singular covariance

[F4]

Cauchy–Schwarz bounds the first absolute moment by the square root of the second moment. Cauchy-Schwarz for random variables

[F5]

A finite-dimensional inner-product space is the direct sum of a subspace and its orthogonal complement. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥

[F6]

Every finite-dimensional inner-product space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis

[F7]

Right multiplication of an iid standard Gaussian matrix by a fixed orthogonal matrix preserves its iid Gaussian law. Orthogonal and unitary invariance of Gaussian matrix blocks

[A1]

Assume AC as required by the normal-law suppliers. The Axiom of Choice

[A2]

Assume countable choice as required by the iid Gaussian-matrix supplier. The Axiom of Countable Choice (ACω)

Verification

Given: The setting in the Example, Z∼N(0,1), s=σ(Z), and Φir=cσ/m σ(Wr⋅(1)xi).

1.1A1F2F4givenchoosealgebra

Softplus is positive and nonconstant. It is analytic, has derivative in (0,1), and its second derivative is at most 1/4, so it satisfies the activation regularity assumptions. By [F2] and [F4], μ is finite; because σ(Z)≥log⁡2 when Z≥0 and the standard normal density is positive on (0,1), μ>0. Since softplus is nonconstant, choose z0 with σ(z0)≠μ; continuity and the positive Gaussian density give E[(s−μ)2]>0. Expanding this finite square and using Es=μ yields E[s2]>μ2. Therefore 0<ρ<1.

2.1A2F1F2F5F6F7givenstep 1.1constructalgebra

Let U=span⁡{x1,…,xn}. By [F5], Rd=U⊕U⊥, and [F6] supplies an orthonormal basis of U⊥. Joining it to x1,…,xn gives the columns of an orthogonal matrix Q. By [F7], W(1)Q has the same iid Gaussian law as W(1), so all coordinates Wr⋅(1)xi are independent standard normals. Thus E[(ΦΦT)ii]=cσE[s2]=1, while for i≠j, E[(ΦΦT)ij]=cσμ2=ρ. Therefore E[ΦΦT]=(1−ρ)In+ρ11T, and its quadratic form in the unit vector e is 1+(n−1)ρ.

3.1A1A2F1F3step 2.1givenalgebra∎

Conditional on the hidden weights, eTu=eTΦa is a centered normal random variable with variance S=eTΦΦTe≥0, by [F1] and [F3]. The nonnegative random variable S has expectation 1+(n−1)ρ>ρn/2, so the event S>ρn/2 has positive probability; otherwise its expectation would be at most ρn/2. On this event, for any fixed C>0, the conditional probability of ∣eTu∣>Cn is at least P{∣Z∣>C2/ρ}>0. Averaging over the hidden weights proves positive unconditional probability. Since e is a unit vector, write u=(eTu)e+(u−(eTu)e); the summands are orthogonal, so ∥u∥22=∣eTu∣2+∥u−(eTu)e∥22≥∣eTu∣2. This proves the asserted absence of one confidence-uniform constant by a local projection calculation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

61 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