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.
Initialization and signal propagation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Feedforward networks and single-hidden-layer universality
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
Variance of a centered random weighted sum
Statement
Let . Let be mutually independent real random variables with finite second moments, means , and variances . Let be a real random vector whose coordinates have finite second moments, and suppose the random elements and are independent. The coordinates of need not be mutually independent. For , the variable is square-integrable, , and
Facts & Assumptions
Given: Mutually independent centered square-integrable real random variables and a square-integrable random vector independent of the vector .
Independence of random elements means independence of their generated sigma-algebras. (Independent random elements)
The joint law of a finite family of independent random elements is the product of their marginal laws. (Independent random elements have product joint law)
Measurable coordinatewise maps preserve independence. (Measurable coordinatewise functions preserve independence)
Expectations of products of independent integrable random variables factor, and the product is integrable. (Expectations factor over finite products of independent random variables)
Sums, products, and lattice operations of measurable real-valued functions used here are measurable. (Arithmetic and lattice operations preserve measurability whenever they are defined)
If , then . (Cauchy-Schwarz for random variables)
Expectation is integration against the probability measure. (Expectation of a nonnegative or integrable random variable)
For a square-integrable real random variable , . (Moments, variance, and covariance on a probability space)
Expectation is linear in scalar multiples and binary sums of integrable random variables; repeated use gives the finite-sum rule. (Linearity, monotonicity, and the modulus bound for expectation)
Proof
Each and is integrable by [F6] applied with the constant random variable . Independence of the two random elements gives independence of and by [F1], so [F4] yields . Linearity [F9] over the finite index set gives .
Fix . The coordinate-product maps and are measurable by [F5]. Since the joint law of is the product law by [F2], these maps, one applied to each independent factor, give independent random variables and by [F3]. Both are integrable by [F6]. Also by [F4] and mutual independence of the weights. Hence [F4] gives .
For each , and are independent nonnegative random variables by [F2] and [F3]. Applying the nonnegative case of [F4] gives .
Expanding the finite square gives diagonal terms from step 1.3 and cross terms from step 1.2, so is integrable. Linearity [F9] gives . By step 1.1, ; [F7] and [F8] therefore identify this second moment with and prove the claim.
Second moments of symmetric rectifiers
Statement
Let be a real random variable whose law is symmetric about zero, meaning that and have the same distribution. Write . Define the ReLU function and, for , define for and for . Then . If , the following ReLU moment identities hold: The corresponding PReLU identities are In particular, For any specified value at the kink, put . Then, without a moment hypothesis on , The zero-at-kink ReLU backpropagation gate is , with second moment . It agrees almost surely with the ordinary ReLU derivative if . A specified value at zero is a backpropagation convention, and is not an ordinary derivative there unless and .
Facts & Assumptions
Given: A symmetric real random variable ; finite second moment for the activation-moment conclusions; and the specified finite gate values .
Expectations of measurable functions of a random element are integrals against its law. (Change of variables for expectation)
Expectation is the Lebesgue integral on the probability space. (Expectation of a nonnegative or integrable random variable)
Variance is for square-integrable . (Moments, variance, and covariance on a probability space)
A square-integrable random variable has integrable products by Cauchy–Schwarz; in particular . (Cauchy-Schwarz for random variables)
Expectation is linear in scalar multiples and binary sums of integrable random variables; repeated use gives the finite-sum rule. (Linearity, monotonicity, and the modulus bound for expectation)
Proof
Symmetry gives , and these probabilities sum to , so each is . The gate takes the values on the positive, negative, and zero events, respectively, so its squared expectation is . For the remaining moment claims assume . Applying [F1] and [F2] to and shows that the positive-side and negative-side second moments are equal. Their sum is , since the contribution at zero is zero, so each is .
By [F1], symmetry gives , while scalar linearity [F5] gives , hence . The expectation is finite by [F4]. The positive and negative parts of have equal expectations by symmetry and sum to , so linearity [F5] gives each expectation as . Therefore and , using [F5] for the sum and scalar factor.
The identities and now give the two asserted second moments from step 1.1.
Expanding the variance definition [F3] using expectation linearity [F5] gives . Substitution of steps 2.1 and 1.2 proves the stated centered-variance identity and completes all formulas.
An IID ReLU layer forces a zero atom in the next preactivation
Statement
Let and let be independent and identically distributed real random variables whose law is symmetric about zero and has no atom at zero. Put . For any real random variables on the same probability space, define the next zero-bias preactivation . Then In particular, this next preactivation cannot be atomless at zero, regardless of the distribution or dependence of the weights. The same conclusion holds under the weaker assumption that the are mutually independent and each is symmetric with no atom at zero; independence of the is not required in that formulation.
Facts & Assumptions
Given: The finite independent family , its common symmetric atomless law, and the definitions in the Statement.
For a symmetric atomless real random variable, each sign has probability . (Second moments of symmetric rectifiers)
A finite family of independent random elements has product joint law. (Independent random elements have product joint law)
Independence of random elements means independence of their generated sigma-algebras. (Independent random elements)
Proof
By [F1], for each . On the event , every is zero.
Since and , the event agrees with up to a null set. Under the weaker hypothesis, independence of the and [F2] give . Under the original hypothesis, each is a sub-sigma-algebra of because ReLU is measurable, so [F3] implies independence of the and the same calculation applies.
On , for every value of the real weights. Hence , which proves the claim.
Rectifier variance-preserving initialization
Definition
Inputs. A finite layered perceptron with positive integer widths , a real negative-side slope , a mode , and a finite mutually independent family of real random variables with a common symmetric law, mean zero, and variance one. The layer matrix has shape , with row index and column index .
Output. Random weight matrices and zero bias vectors .
Instructions. For each , set the fan-in and fan-out . Set For every matrix entry set , and set . The case is ReLU; the piecewise-linear activation for general is for and for .
Remarks
The repeated forward recurrence concerns a layer whose inputs are outputs of a rectifier. A raw-input first affine layer has no preceding rectifier factor. If the input coordinates are square-integrable, centered, have common variance , and the first-layer weights are independent of the input vector, then the finite weighted sum has mean zero. In its second moment, the diagonal terms each contribute and the off-diagonal terms vanish because the weights are independent and centered. Thus , so preserves . He et al. also use the rectifier scale at that first layer for simplicity; this changes one boundary factor, not the repeated hidden-layer factor. Fan-in mode and fan-out mode target different directions and need not preserve both when layer widths differ. The paper's depth and ImageNet accuracy comparisons are reported experiments, not consequences of this definition and not guarantees of training success or generalization.
The mode names specify the source's forward and conditional backward moment targets. They do not assert that finite-network gradients are independent of their weights or gates. A positive-probability zero preactivation requires a specified kink convention for backpropagation; it does not have an ordinary ReLU derivative. Consequently the backward scale alone supplies no nonzero actual-gradient preservation guarantee.
ReLU forward preactivation-variance recurrence
Statement
Let and let be positive integers. For each , let have mutually independent, identically distributed entries with a symmetric law, mean zero, and finite variance , and suppose is independent of the input activation vector . Set the fan-in , set every bias to zero, and define and coordinatewise, where . Assume for every layer that the coordinates of have a common finite second moment; they need not be independent or identically distributed. Also assume that each preactivation coordinate has a symmetric law; an atom at zero is allowed in this forward second-moment recurrence. Then, for every and , At the raw-input boundary, the exact base relation is if is centered, its second moment here is its variance. In particular, writing , the exact finite-depth formula is Thus for gives , 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.
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)
For independent centered weights independent of a square-integrable input vector , . (Variance of a centered random weighted sum)
If is symmetric about zero, , including when has an atom at zero. (Second moments of symmetric rectifiers)
Proof
In the fully connected layer from to , each coordinate is . Apply [F2] to this row of weights and the input vector. Since its entries have common variance and the input coordinates have common second moment, this gives and . For this is the stated raw-input base relation.
For , . By [F3], . Symmetry makes , so this is . Substitution into step 1.1 proves the claimed recurrence.
Apply step 2.1 successively for . The product of the finitely many coefficients is the displayed expression for ; setting each coefficient to proves preservation. No division by a variance occurs, so the identity also holds when .
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, , and mutually independent weights with equal probabilities, where . At each layer the fresh weight is independent of the preceding activation and its random sign makes the preactivation symmetric. The event already forces all subsequent preactivations to vanish, yet and hold exactly. Thus atomlessness is unnecessary for finite-depth forward propagation.
ReLU backward gradient-variance recurrence
Statement
Consider a finite rectified stack in a fully connected layered perceptron, with widths , zero biases, , and , where . For an objective differentiable as a function of the last activation, set and define backward signals by the zero-at-kink convention , , and . At realizations where all relevant preactivations are nonzero, these are ordinary chain-rule gradients. At zeros they are specified backpropagation signals; no ordinary derivative of ReLU at zero is asserted.
Without any independence assumptions, fix a layer and suppose every is square-integrable. Then This is an exact atom-aware identity for the realized network signals. For any specified bounded measurable random gate vector in place of , define . If every redefined is square-integrable, the same mean and covariance formulas hold.
For the conditional recurrence, additionally assume at the layers in question that the entries of are independent with a common symmetric centered law of finite variance , that is symmetric with common zero probability , and that the coordinates of have common finite second moment . Assume the gate vector is independent of and is independent of . Write the fan-out as . Then If these hypotheses hold for every , then In particular, the source's atomless conditional case gives and the corresponding product of half factors. If the downstream coordinate is centered, is its variance. The conditional fan-out choice makes each atomless product factor one.
These conditional identities do not establish that a nonzero actual-network gradient satisfies their hypotheses. Indeed, if , is a ReLU output and , the assumption already forces almost surely. If also and gate independence holds, it forces . Thus the nonzero atomless backward preservation model with these full independence assumptions is infeasible for such an actual ReLU layer; the conditional implication and product remain valid, and the general covariance identity above supplies the unconditional finite-network formula.
Facts & Assumptions
Given: The finite stack, an objective differentiable as a function of with , and the backward-signal convention; square-integrable summands for the general identity; and, only for the conditional formulas, the stated symmetry, moments, and independence assumptions.
A fully connected layered perceptron evaluates each layer as a finite weighted sum followed by its specified activation. (Finite feedforward computation graphs and layered MLPs)
At totally differentiable points, derivatives of a composition multiply in layer order. (The chain rule for total derivatives: )
A symmetric preactivation with zero probability has positive sign probability . (Second moments of symmetric rectifiers)
Independent centered weights, independent of the input vector, give weighted-sum mean zero and variance equal to the sum of weight variances times input second moments. (Variance of a centered random weighted sum)
Products of independent integrable variables have factored expectations. (Expectations factor over finite products of independent random variables)
Variance and covariance are centered second moments. (Moments, variance, and covariance on a probability space)
Products of square-integrable variables are integrable by Cauchy–Schwarz. (Cauchy-Schwarz for random variables)
A finite independent family has product joint law. (Independent random elements have product joint law)
Expectation is linear on integrable random variables, and respects their almost-sure order. (Linearity, monotonicity, and the modulus bound for expectation)
Proof
At a realization with nonzero preactivations, the derivative of ReLU is the diagonal matrix with entries , and the affine derivative is . The chain rule [F2] therefore gives the two backward identities in the Statement. The specified convention defines the same identities at zeros without using [F2] there.
For fixed , . A finite sum of square-integrable variables is square-integrable: . By [F7] each pairwise product is integrable. Expanding the mean and centered square, then applying [F6] and expectation linearity [F9], gives exactly the asserted mean and covariance sums, without factoring any dependent variables.
Under the conditional assumptions, [F3] and gate independence give by [F5]. For fixed , the column of weights is centered, independent, and independent of . Applying [F4] yields mean zero and variance . This also equals the upstream second moment, proving the one-step formula.
Repeat step 1.3 for the finitely many layers . All generated upstream coordinates are centered and have the common second moment in step 1.3, so substitution gives the stated product, including a possibly uncentered terminal signal. Setting gives the original half-factor formulas and setting makes those factors one.
To prove the feasibility obstruction, let . Symmetry and positive variance imply : if , symmetry gives , forcing variance zero. By [F8], the event that all matrix entries are strictly negative has probability . Since is coordinatewise nonnegative, all coordinates of are nonpositive on , so and there, including when the input vector is zero. Independence of and now gives , hence almost surely. If , step 1.3's gate calculation gives , hence . This proves the obstruction without declaring the valid conditional identities false.
Remarks
He et al. §2.2, Eqs. (14)–(16), multiply the atomless half factors under the stated weight/incoming-gradient and gate/downstream-gradient independence assumptions. Those are a conditional moment calculation, not a proof of their realization by a nonzero finite ReLU gradient. Zero atoms also invalidate the ordinary derivative at those realizations; choosing the zero-at-kink convention addresses the algorithmic signal but does not establish the independence assumptions.
PReLU fan-in and fan-out variance scales
Statement
Let and consider a finite rectified stack with zero biases, widths , , and , where for and for . Put and . Suppose each has independent entries with a common symmetric centered law of finite variance and is independent of . Suppose each layer input has coordinates with a common finite second moment, and all preactivation coordinates are symmetric about zero. Input coordinates may be dependent, and zero atoms are allowed. Then, writing , Thus preserves the forward preactivation variance across the hidden layers.
For backward signals, take an objective differentiable as a function of the last activation and set . Specify a finite kink value and put , , and . They are ordinary chain-rule gradients when all relevant preactivations are nonzero; when and the activation is linear and this also holds at zeros. Otherwise a specified kink value is a backpropagation convention. If the coordinates of have common zero probability , the coordinates of have common finite second moment , is independent of , and is independent of , then The upstream coordinates have mean zero. If these conditional hypotheses hold for every , then In the source's atomless case , this retains the original backward factor and the fan-out choice . For a noncentered terminal signal is its second moment; for centered signals it is their variance. The source's forward and atomless backward weight variances agree exactly when . With atoms the conditional backward-preserving choice is when ; if the upstream signal has zero variance for every finite weight variance. These are conditional backward statements, and no independence assumption or nonzero actual-gradient realization is inferred from initialization.
Facts & Assumptions
Given: The finite stack and its forward moment assumptions, an objective differentiable as a function of with , the specified backward-signal convention, and the additional layerwise conditional hypotheses only for backward preservation.
The source initializer uses forward variance or backward variance . (Rectifier variance-preserving initialization)
Symmetry gives PReLU second moment , and the squared gate moment is . (Second moments of symmetric rectifiers)
Independent centered weights independent of an input vector give weighted-sum mean zero and variance . (Variance of a centered random weighted sum)
Totally differentiable compositions obey the total-derivative chain rule. (The chain rule for total derivatives: )
The ReLU forward recurrence allows zero atoms and has factor and the corresponding finite-depth product. (ReLU forward preactivation-variance recurrence)
Exact backward signals obey a covariance-sum identity; the ReLU half-factor product is conditional, and its full atomless independence assumptions force zero downstream second moment at a nondegenerate actual ReLU hidden layer. (ReLU backward gradient-variance recurrence)
Expectations of products of independent integrable variables factor. (Expectations factor over finite products of independent random variables)
Proof
Apply [F3] to a row of . The preactivation is centered and has variance , which proves the raw-input relation. For , [F2] and centered symmetry give , proving the forward recurrence without an atomlessness or coordinate-independence assumption. Successive substitution gives the finite product; the forward choice [F1] makes every hidden-layer factor one.
At nonzero preactivations the derivative of PReLU is on the positive half-line and on the negative half-line, so [F4] gives the stated backward recursion for ordinary gradients there. At zeros the recursion is instead the specified convention, except in the linear case , where it is the ordinary derivative everywhere. By [F2] and independence of the gate and , [F7] gives .
Apply [F3] to each column of and , using the assumed matrix/signal independence. The upstream signal is centered and has variance . Iteration over the finite set of layers proves the backward product, just as for [F6]. If then and the source's backward choice [F1] gives unit coefficient. For positive , solving the unit-coefficient equation gives ; for zero the coefficient vanishes for every finite weight variance.
The positive source scales and agree exactly when . At , the forward and backward formulas specialize to [F5] and [F6], including the atom correction and feasibility caveat; at , for every zero probability, as required for the linear derivative. These substitutions also show why an arbitrary kink convention must not be silently identified with an ordinary derivative.
Remarks
The atomless half-factor product is retained as the precise conditional calculation in He et al. §2.2; the forward product is valid for actual finite stacks satisfying the forward assumptions, with dependent coordinates and zero atoms allowed. The backward independence hypotheses require separate verification for an actual network. In particular, the ReLU specialization has the explicit nonzero-feasibility obstruction proved in the backward theorem, even at one hidden layer. No mean-field limit or empirical training claim supplies that gap.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun, Delving Deep into Rectifiers, §2.2
- Simon J. D. Prince, Understanding Deep Learning, §7.5.1
- Johns Hopkins University, Handout #8: Neural Network Training and Tokenization, §3
- Simon J. D. Prince, Understanding Deep Learning, §7.5.1–7.5.2
- Simon J. D. Prince, Understanding Deep Learning, §7.5.1–7.5.3
- Simon J. D. Prince, Understanding Deep Learning, §7.5.2