Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

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 i≠j have the same input xi=xj. Then rows i and j of the population Gram matrix K(H) coincide, so K(H) has a nonzero null vector and its smallest eigenvalue is zero. Thus the strict-positivity hypothesis in the convergence theorems is substantive.

Facts & Assumptions

Given: The population Gram recursion, repeated input indices i≠j, and the finite Gram-matrix lemma.

[F1]

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

[F2]

Every defined fully connected matrix K(h), every residual feature second-moment matrix S(h) (including S(0)=K(0)), and both terminal matrices are finite, symmetric and positive semidefinite. The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite

[F4]

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

Verification

Given: xi=xj for distinct indices i,j.

Proof technique: induction on the layer index.

1.1baseA1F1givenalgebra

The rows i,j of K(0) coincide because Kiℓ(0)=⟨xi,xℓ⟩=⟨xj,xℓ⟩=Kjℓ(0) for every ℓ. This is the base case.

1.2ihF1F2givenalgebra

Assume rows i,j of K(h−1) coincide. By [F2], the matrix is symmetric, so the corresponding columns coincide as well. For each ℓ, the covariance matrices Aiℓ(h) and Ajℓ(h) are equal. Thus the Gaussian activation expectations agree for h<H, and for h=H both the derivative expectations and prefactors Kiℓ(H−1), Kjℓ(H−1) agree. Hence rows i,j of the fully connected K(h) coincide.

2.1A1F1F2F4step 1.1step 1.2algebradischarge-induction

For the fixed H, let P(h) assert that rows i,j of K(h) coincide for 0≤h≤H. Step 1.1 gives the base, and step 1.2 proves P(h) from P(h−1) for every 1≤h≤H. By [F4], the fully connected terminal rows coincide. For H=1, the residual terminal matrix equals this fully connected terminal matrix by definition, so its rows also coincide.

2.2A1F1F2F4step 1.1constructalgebradischarge-induction

Now assume H≥2. For 1≤h<H, let Q(h) assert both that rows i,j of S(h) coincide and that bi(h)=bj(h). The base S(0)=K(0) has equal rows by step 1.1. At layer 1, this equality and symmetry from [F2] make the pair covariance matrices for indices (i,ℓ) and (j,ℓ) identical for every ℓ, and give Sii(0)=Sjj(0). Hence the Gaussian marginal means agree, so the defining formulas give Siℓ(1)=Sjℓ(1) for every ℓ and bi(1)=bj(1); this proves Q(1). For 2≤h<H, assume Q(h−1). Symmetry from [F2] and equal rows of S(h−1) give equal columns, so the covariance matrices for (i,ℓ) and (j,ℓ) coincide and μi(h−1)=μj(h−1). In the mean recursion this gives bi(h)=bj(h). In the second-moment recursion, the old-row terms agree, the terms bi(h−1)μℓ(h−1)+bℓ(h−1)μi(h−1) agree with their j-row counterparts, and the Gaussian activation expectations agree; thus Siℓ(h)=Sjℓ(h) for every ℓ. This proves Q(h). Finite induction gives Q(H−1). The terminal residual formula then has equal prefactors Siℓ(H−1)=Sjℓ(H−1) and equal derivative expectations because the corresponding pair covariance matrices coincide. Therefore the terminal residual rows coincide.

3.1A1F2F3step 2.1step 2.2algebradischarge-induction∎

For either terminal matrix, let v=ei−ej≠0. Symmetry and equal rows imply K(H)v=0. 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

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