Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

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 K(h), every residual feature second-moment matrix S(h), and both terminal matrices are finite, symmetric, and positive semidefinite. The fully connected matrices satisfy Kii(h)=1 for 0≤h<H. For the residual sequence, S(h)−b(h)(b(h))T is positive semidefinite for 1≤h<H; its diagonal is not asserted to equal one.

Facts & Assumptions

Given: The finite unit-norm data, activation, normalization, Gaussian covariance convention, and matrices from the definition.

[F1]

The architecture and matrices are defined by the stated recurrences, with cσ>0 and finite. Fully connected and residual networks with the Du Gram kernel

[F5]

The normalizer satisfies cσE[σ(Z)2]=1 for standard normal Z. The Gaussian activation normalizer is finite and positive

[F6]

A property holding at zero and preserved by successor holds for every natural-number index. The principle of mathematical induction

[F2]

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

[F4]

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

[A1]

Assume AC as required by the multivariate normal-law supplier. The Axiom of Choice

[F7]

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

[F8]

If X,Y have finite second moments, then E∣XY∣≤(EX2)1/2(EY2)1/2. 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

technique · induction on the layer index, using Gaussian feature vectors to express each quadratic form as an expectation of a square
1.1baseF1givenalgebra

The input matrix K(0) is symmetric, and for v∈Rn, vTK(0)v=∥∑ivixi∥22≥0. Its diagonal entries are ∥xi∥22=1, giving the base case.

2.1ihA1F1F2F3F5F8step 1.1algebra

Assume the induction hypothesis that K(h−1) is finite, symmetric positive semidefinite, and has diagonal 1, for some 1≤h<H. By [F2]–[F3], take G∼Nn(0,K(h−1)); each pair (Gi,Gj) has covariance Aij(h). The growth bound ∣σ(z)∣≤∣σ(0)∣+L∣z∣ and finite Gaussian second moments put each σ(Gi) in L2; [F8] then makes every product σ(Gi)σ(Gj) integrable. Thus K(h) is finite and symmetric, and for every v, vTK(h)v=cσE[(∑iviσ(Gi))2]≥0. Because Gi∼N(0,1), its diagonal is cσE[σ(Z)2]=1 by [F5]. This establishes the induction step.

3.1A1A2F2F3F4F6step 1.1step 2.1algebradischarge-induction

For the fixed H, let P(h) mean that K(h) is finite, symmetric positive semidefinite, and has diagonal 1, for 0≤h<H. Define Q(k) to mean P(j) for every j≤min⁡(k,H−1). Step 1.1 gives Q(0). If Q(k) and k+1<H, step 2.1 applied with h=k+1 gives P(k+1) and hence Q(k+1); if k+1≥H, Q(k+1) adds no new index. By [F6], Q(H−1) holds, so K(H−1) is finite, symmetric positive semidefinite, and has diagonal 1; when H=1, this is exactly the base matrix K(0). By [F4], take independent G,G′ both distributed as Nn(0,K(H−1)). The vector with coordinates Yi=cσ Gi′σ′(Gi) has finite second moments; σ′ is bounded because it is the derivative of a Lipschitz differentiable function. Factoring expectations of independent variables gives E[YiYj]=cσKij(H−1)E[σ′(Gi)σ′(Gj)]=Kij(H). Therefore K(H) is finite and symmetric, and vTK(H)v=E[(∑iviYi)2]≥0 for every v. This proves the fully connected terminal claim and discharges that induction.

3.2A1F1F2step 2.1constructalgebra

For the residual base layer let G0∼Nn(0,S(0)) and V(1)=cσ σ(G0), with activation applied coordinatewise. Then EV(1)=b(1) and E[V(1)(V(1))T]=S(1) by [F1]. The growth bound used in step 2.1 proves finite second moments. For every v, vTS(1)v=E[(vTV(1))2]≥0, while S(1)−b(1)(b(1))T is its covariance and has quadratic form E[(vT(V(1)−EV(1)))2]≥0. Thus both matrices are symmetric positive semidefinite.

4.1A1A2F1F2F4F6F7F8step 3.2constructalgebra

Suppose a finite-second-moment vector V(h−1) has mean b(h−1) and second-moment matrix S(h−1). Let μ be the Borel law of this generally non-Gaussian vector and let ν=Nn(0,S(h−1)), which exists by [F2]. Both are probability measures and hence sigma-finite. By [F7], on (Rn×Rn,μ×ν) the coordinate projections V and G have laws μ and ν and are independent: for Borel sets A,B, the probability of {V∈A,G∈B} is μ(A)ν(B). Put V(h)=V+ασ(G). Finite second moments follow from the growth bound and (u+v)2≤2u2+2v2. Independence gives EV(h)=b(h−1)+αμ(h−1) and E[Vi(h)Vj(h)]=Sij(h−1)+α(bi(h−1)μj(h−1)+bj(h−1)μi(h−1))+α2E[σ(Gi)σ(Gj)]=Sij(h). For every v, vTS(h)v=E[(vTV(h))2]≥0, and S(h)−b(h)(b(h))T is the covariance of V(h), 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].

5.1A1A2F1F2F4step 3.1step 4.1constructalgebradischarge-induction∎

For H≥2, take independent G,G′∼Nn(0,S(H−1)) and set Yi=(cres/H)Gi′σ′(Gi). The boundedness ∣σ′∣≤L gives finite second moments, and independence gives E[YiYj]=Kres,ij(H). Consequently this terminal matrix is symmetric positive semidefinite. At H=1 it equals the already proved fully connected matrix by definition. This proves all residual assertions.

Depends on

Used by

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.

Sources