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 , the softplus activation , width , and orthonormal inputs in for . Let for standard normal , let , put , and define the hidden-feature matrix by . If is the randomly initialized output vector and , then
where is the hidden-feature matrix at initialization. Consequently, for every finite , there is positive probability that . A confidence-uniform bound for all confidence levels is therefore unavailable in this example; this observation does not refute the finite-width convergence theorem, whose bounds depend on .
Example references
Facts & Assumptions
Given: The depth-one fully connected architecture, orthonormal inputs, softplus activation, independent Gaussian initialization, and the associated hidden-feature matrix.
At depth one, each hidden feature coordinate is and each output weight is an independent standard normal. Fully connected and residual networks with the Du Gram kernel
The normalizer is finite and positive for softplus, the standard normal law has an everywhere-positive density, and its second moment is . The Gaussian activation normalizer is finite and positive Standard normal and normal laws Gaussian even moments for Brownian increments
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
Cauchy–Schwarz bounds the first absolute moment by the square root of the second moment. Cauchy-Schwarz for random variables
A finite-dimensional inner-product space is the direct sum of a subspace and its orthogonal complement. For a subspace of a finite-dimensional inner product space,
Every finite-dimensional inner-product space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis
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
Assume AC as required by the normal-law suppliers. The Axiom of Choice
Assume countable choice as required by the iid Gaussian-matrix supplier. The Axiom of Countable Choice ()
Verification
Given: The setting in the Example, , , and .
Softplus is positive and nonconstant. It is analytic, has derivative in , and its second derivative is at most , so it satisfies the activation regularity assumptions. By [F2] and [F4], is finite; because when and the standard normal density is positive on , . Since softplus is nonconstant, choose with ; continuity and the positive Gaussian density give . Expanding this finite square and using yields . Therefore .
Let . By [F5], , and [F6] supplies an orthonormal basis of . Joining it to gives the columns of an orthogonal matrix . By [F7], has the same iid Gaussian law as , so all coordinates are independent standard normals. Thus , while for , . Therefore , and its quadratic form in the unit vector is .
Conditional on the hidden weights, is a centered normal random variable with variance , by [F1] and [F3]. The nonnegative random variable has expectation , so the event has positive probability; otherwise its expectation would be at most . On this event, for any fixed , the conditional probability of is at least . Averaging over the hidden weights proves positive unconditional probability. Since is a unit vector, write ; the summands are orthogonal, so . This proves the asserted absence of one confidence-uniform constant by a local projection calculation.
Depends on
- Fully connected and residual networks with the Du Gram kernel
- The Gaussian activation normalizer is finite and positive
- Multivariate normal law, including singular covariance
- Standard normal and normal laws
- Gaussian even moments for Brownian increments
- Cauchy-Schwarz for random variables
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Orthogonal and unitary invariance of Gaussian matrix blocks
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Du et al., initialization scheme and Appendix B, Lemmas B.4–B.5 (standard reference, not scraped)
- University of Toronto, Theory of Deep Learning, Lecture 6, slides 31–43 (standard reference, not scraped)