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.
The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite
Statement
Assume AC, DC and countable choice. Under the hypotheses and notation defining the Du population Gram recursion, every fully connected matrix , every residual feature second-moment matrix , and both terminal matrices are finite, symmetric, and positive semidefinite. The fully connected matrices satisfy for . For the residual sequence, is positive semidefinite for ; its diagonal is not asserted to equal one.
Statement references
Facts & Assumptions
Given: The finite unit-norm data, activation, normalization, Gaussian covariance convention, and matrices from the definition.
The architecture and matrices are defined by the stated recurrences, with and finite. Fully connected and residual networks with the Du Gram kernel
The normalizer satisfies for standard normal . The Gaussian activation normalizer is finite and positive
A property holding at zero and preserved by successor holds for every natural-number index. The principle of mathematical induction
A finite-dimensional positive semidefinite covariance matrix defines a possibly singular centered multivariate normal law, with the listed covariance and finite second moments. Multivariate normal law, including singular covariance
A real self-adjoint matrix has an orthonormal eigenbasis. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
Countably many independent copies of a normal vector can be constructed, and expectations of products of integrable independent variables factor. Countably many independent copies of a prescribed law exist Expectations factor over finite products of independent random variables
Assume AC as required by the multivariate normal-law supplier. The Axiom of Choice
Assume DC and countable choice as required by the independent-copy supplier. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain The Axiom of Countable Choice ()
For two Borel probability laws on finite-dimensional real spaces, their product measure exists, has total mass one and satisfies the rectangle formula. Thus its two coordinate projections have the prescribed laws and are independent. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
If have finite second moments, then . This ensures integrability of the Gaussian activation products in steps 2.1 and 4.1 and the terminal-coordinate products in steps 3.1 and 5.1. Cauchy-Schwarz for random variables
Proof
The input matrix is symmetric, and for , . Its diagonal entries are , giving the base case.
Assume the induction hypothesis that is finite, symmetric positive semidefinite, and has diagonal , for some . By [F2]–[F3], take ; each pair has covariance . The growth bound and finite Gaussian second moments put each in ; [F8] then makes every product integrable. Thus is finite and symmetric, and for every , . Because , its diagonal is by [F5]. This establishes the induction step.
For the fixed , let mean that is finite, symmetric positive semidefinite, and has diagonal , for . Define to mean for every . Step 1.1 gives . If and , step 2.1 applied with gives and hence ; if , adds no new index. By [F6], holds, so is finite, symmetric positive semidefinite, and has diagonal ; when , this is exactly the base matrix . By [F4], take independent both distributed as . The vector with coordinates has finite second moments; is bounded because it is the derivative of a Lipschitz differentiable function. Factoring expectations of independent variables gives . Therefore is finite and symmetric, and for every . This proves the fully connected terminal claim and discharges that induction.
For the residual base layer let and , with activation applied coordinatewise. Then and by [F1]. The growth bound used in step 2.1 proves finite second moments. For every , , while is its covariance and has quadratic form . Thus both matrices are symmetric positive semidefinite.
Suppose a finite-second-moment vector has mean and second-moment matrix . Let be the Borel law of this generally non-Gaussian vector and let , which exists by [F2]. Both are probability measures and hence sigma-finite. By [F7], on the coordinate projections and have laws and and are independent: for Borel sets , the probability of is . Put . Finite second moments follow from the growth bound and . Independence gives and . For every , , and is the covariance of , so its quadratic form is also an expectation of a square. Thus both matrices are finite, symmetric positive semidefinite at this stage, which supplies the covariance hypothesis for the next stage. Iterating through the finitely many layers is justified by [F6].
For , take independent and set . The boundedness gives finite second moments, and independence gives . Consequently this terminal matrix is symmetric positive semidefinite. At it equals the already proved fully connected matrix by definition. This proves all residual assertions.
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
- Countably many independent copies of a prescribed law exist
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Expectations factor over finite products of independent random variables
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy-Schwarz for random variables
- The principle of mathematical induction
- 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
- Duplicate inputs force the population Gram matrix to be singular Example
- Simultaneous initialization estimates for the Du architectures Lemma
- Wide fully connected networks converge geometrically to zero empirical training loss Theorem
- Wide residual networks converge geometrically to zero empirical loss with polynomial depth dependence Theorem
Cited to discharge well-definedness by Fully connected and residual networks with the Du Gram kernel.
Dependency tree · two levels
62 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.