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.
Duplicate inputs force the population Gram matrix to be singular
Example
Assume AC, DC and countable choice, as in the population Gram lemma. Suppose two distinct training indices have the same input . Then rows and of the population Gram matrix coincide, so has a nonzero null vector and its smallest eigenvalue is zero. Thus the strict-positivity hypothesis in the convergence theorems is substantive.
Example references
Facts & Assumptions
Given: The population Gram recursion, repeated input indices , and the finite Gram-matrix lemma.
The initial Gram matrix is the input inner-product matrix. The fully connected entries depend on the corresponding bivariate covariance matrices; residual entries additionally depend on the corresponding means. Fully connected and residual networks with the Du Gram kernel
Every defined fully connected matrix , every residual feature second-moment matrix (including ), and both terminal matrices are finite, symmetric and positive semidefinite. The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite
A real symmetric matrix has an orthonormal eigenbasis. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
A property holding at zero and preserved by successor holds for every natural-number index. The principle of mathematical induction
AC, DC and countable choice are assumed for the population Gram supplier. The Axiom of Choice The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain The Axiom of Countable Choice ()
Verification
Given: for distinct indices .
Proof technique: induction on the layer index.
The rows of coincide because for every . This is the base case.
Assume rows of coincide. By [F2], the matrix is symmetric, so the corresponding columns coincide as well. For each , the covariance matrices and are equal. Thus the Gaussian activation expectations agree for , and for both the derivative expectations and prefactors , agree. Hence rows of the fully connected coincide.
For the fixed , let assert that rows of coincide for . Step 1.1 gives the base, and step 1.2 proves from for every . By [F4], the fully connected terminal rows coincide. For , the residual terminal matrix equals this fully connected terminal matrix by definition, so its rows also coincide.
Now assume . For , let assert both that rows of coincide and that . The base has equal rows by step 1.1. At layer , this equality and symmetry from [F2] make the pair covariance matrices for indices and identical for every , and give . Hence the Gaussian marginal means agree, so the defining formulas give for every and ; this proves . For , assume . Symmetry from [F2] and equal rows of give equal columns, so the covariance matrices for and coincide and . In the mean recursion this gives . In the second-moment recursion, the old-row terms agree, the terms agree with their -row counterparts, and the Gaussian activation expectations agree; thus for every . This proves . Finite induction gives . The terminal residual formula then has equal prefactors and equal derivative expectations because the corresponding pair covariance matrices coincide. Therefore the terminal residual rows coincide.
For either terminal matrix, let . Symmetry and equal rows imply . By [F2]–[F3], this matrix is positive semidefinite and has a nonzero null vector, so zero is an eigenvalue and the smallest eigenvalue is zero. This proves the residual branch and completes the example.
Depends on
- 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$)
- Fully connected and residual networks with the Du Gram kernel
- The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- The principle of mathematical induction
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
30 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., Definition 5.1 and Appendix F.1 (standard reference, not scraped)