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

ReLU forward preactivation-variance recurrence

Statement

Let L≥2 and let d0,…,dL be positive integers. For each 1≤ℓ≤L, let Wℓ∈Rdℓ×dℓ−1 have mutually independent, identically distributed entries with a symmetric law, mean zero, and finite variance σℓ2, and suppose Wℓ is independent of the input activation vector Xℓ−1. Set the fan-in nℓ=dℓ−1, set every bias to zero, and define Zℓ=WℓXℓ−1 and Xℓ=ρ(Zℓ) coordinatewise, where ρ(t)=max⁡(t,0). Assume for every layer that the coordinates of Xℓ−1 have a common finite second moment; they need not be independent or identically distributed. Also assume that each preactivation coordinate Zℓ,j has a symmetric law; an atom at zero is allowed in this forward second-moment recurrence. Then, for every 2≤ℓ≤L and 1≤j≤dℓ, Var⁡(Zℓ,j)=12nℓσℓ2Var⁡(Zℓ−1,1). At the raw-input boundary, the exact base relation is Var⁡(Z1,j)=n1σ12E[X0,12]; if X0,1 is centered, its second moment here is its variance. In particular, writing Vℓ=Var⁡(Zℓ,1), the exact finite-depth formula is VL=V1∏ℓ=2Lnℓσℓ22. Thus σℓ2=2/nℓ for ℓ≥2 gives VL=V1, with zero atoms allowed at every depth. This is a statement about ensemble second moments, not about variance along every sampled network or training success.

Facts & Assumptions

Given: A finite fully connected layered perceptron with zero biases, symmetric centered independent weights, layer inputs independent of their weights, symmetric preactivations, and the stated layerwise moment assumptions.

[F1]

A fully connected layered perceptron has a real weight on every edge between consecutive layers, so each preactivation is the corresponding finite weighted sum. (Finite feedforward computation graphs and layered MLPs)

[F2]

For independent centered weights Wi independent of a square-integrable input vector X, Var⁡(∑iWiXi)=∑iVar⁡(Wi)E[Xi2]. (Variance of a centered random weighted sum)

[F3]

If Z is symmetric about zero, E[ρ(Z)2]=12E[Z2], including when Z has an atom at zero. (Second moments of symmetric rectifiers)

Proof

1.1givenF1F2

In the fully connected layer from Xℓ−1 to Zℓ, each coordinate is Zℓ,j=∑i=1nℓWℓ,jiXℓ−1,i. Apply [F2] to this row of weights and the input vector. Since its entries have common variance σℓ2 and the input coordinates have common second moment, this gives E[Zℓ,j]=0 and Var⁡(Zℓ,j)=nℓσℓ2E[Xℓ−1,12]. For ℓ=1 this is the stated raw-input base relation.

2.1givenF3step 1.1

For ℓ≥2, Xℓ−1,1=ρ(Zℓ−1,1). By [F3], E[Xℓ−1,12]=12E[Zℓ−1,12]. Symmetry makes E[Zℓ−1,1]=0, so this is 12Var⁡(Zℓ−1,1). Substitution into step 1.1 proves the claimed recurrence.

3.1step 2.1algebra∎

Apply step 2.1 successively for ℓ=2,…,L. The product of the finitely many coefficients is the displayed expression for VL; setting each coefficient to 1 proves preservation. No division by a variance occurs, so the identity also holds when V1=0.

Remarks

The equal-second-moment assumption allows the dependence between coordinates that naturally arises after averaging over a random previous layer. For a concrete finite-depth model satisfying all these hypotheses, take every width to be one, X0=1, and mutually independent weights Wℓ=±vℓ with equal probabilities, where vℓ>0. At each layer the fresh weight is independent of the preceding activation and its random sign makes the preactivation symmetric. The event W1<0 already forces all subsequent preactivations to vanish, yet V1=v1 and VL=v1∏ℓ=2L(vℓ/2) hold exactly. Thus atomlessness is unnecessary for finite-depth forward propagation.

Depends on

Used by

Dependency tree · two levels

13 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