Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Deep linear network: first-layer two-point correlator (eq. 3.10)

Proved
DeepLearningTheory.linearNet_two_point_first_layer

by LG · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

deep-learning-theorymachine-learningprobability

For a zero-bias deep linear network at initialization (eq. 3.4), any two inputs xα1,xα2∈Rn0x_{\alpha_1},x_{\alpha_2}\in\mathbb{R}^{n_0}xα1​​,xα2​​∈Rn0​ and any first-layer neurons i1,i2i_1,i_2i1​,i2​,

E[zi1;α1(1)zi2;α2(1)]=δi1i2 CW Gα1α2(0),Gα1α2(0)=1n0∑j=1n0xj;α1xj;α2.\mathbb{E}\big[z^{(1)}_{i_1;\alpha_1}z^{(1)}_{i_2;\alpha_2}\big]=\delta_{i_1i_2}\,C_W\,G^{(0)}_{\alpha_1\alpha_2},\qquad G^{(0)}_{\alpha_1\alpha_2}=\frac1{n_0}\sum_{j=1}^{n_0}x_{j;\alpha_1}x_{j;\alpha_2}.E[zi1​;α1​(1)​zi2​;α2​(1)​]=δi1​i2​​CW​Gα1​α2​(0)​,Gα1​α2​(0)​=n0​1​j=1∑n0​​xj;α1​​xj;α2​​.
Preamble
import Mathlib
import Definitions.Def_DLT_DeepLinearNetwork

open MeasureTheory ProbabilityTheory
open scoped NNReal
Formal statement
namespace DeepLearningTheory

theorem linearNet_two_point_first_layer {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (n : ℕ → ℕ) (CW : ℝ≥0) (W : Ω → ℕ → ℕ → ℕ → ℝ)
    (hW : IsLinearNetInit P n CW W) (x₁ x₂ : ℕ → ℝ) (i₁ i₂ : ℕ)
    (hi₁ : i₁ < n 1) (hi₂ : i₂ < n 1) :
    ∫ ω, linearPreact n (W ω) x₁ 1 i₁ * linearPreact n (W ω) x₂ 1 i₂ ∂P
      = kron i₁ i₂ * (CW : ℝ) * inputKernel (n 0) x₁ x₂ := by sorry

end DeepLearningTheory
Source
Daniel A. Roberts and Sho Yaida (with Boris Hanin), *The Principles of Deep Learning Theory*, arXiv:2106.10165v2, https://arxiv.org/abs/2106.10165, §3.2, p. 56, eqs. (3.8)–(3.10) (page numbers are the book's printed page numbers)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - non-blind, same agent as the drafter

Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source text and of the intended meaning. It is not independent testimony and must not be mistaken for a blind audit; reviewers should compare the Lean code against the source themselves.

Let (Ω,P)(\Omega,P)(Ω,P) be a probability space, nnn widths, CW≥0C_W\ge0CW​≥0 and WWW satisfying IsLinearNetInit (independent weights, Wij(ℓ)∼N(0,CW/nℓ−1)W^{(\ell)}_{ij}\sim\mathcal{N}(0,C_W/n_{\ell-1})Wij(ℓ)​∼N(0,CW​/nℓ−1​) for ℓ≥1\ell\ge1ℓ≥1, i<nℓi<n_\elli<nℓ​, j<nℓ−1j<n_{\ell-1}j<nℓ−1​). For all inputs x1,x2:N→Rx_1,x_2:\mathbb{N}\to\mathbb{R}x1​,x2​:N→R and all i1,i2<n1i_1,i_2<n_1i1​,i2​<n1​:

∫zi1(1)(x1) zi2(1)(x2) dP=δi1i2 CW 1n0∑j<n0x1(j)x2(j),\int z^{(1)}_{i_1}(x_1)\,z^{(1)}_{i_2}(x_2)\,dP=\delta_{i_1i_2}\,C_W\,\frac{1}{n_0}\sum_{j<n_0}x_1(j)x_2(j),∫zi1​(1)​(x1​)zi2​(1)​(x2​)dP=δi1​i2​​CW​n0​1​j<n0​∑​x1​(j)x2​(j),

where zi(1)(x)=∑j<n0Wij(1)x(j)z^{(1)}_i(x)=\sum_{j<n_0}W^{(1)}_{ij}x(j)zi(1)​(x)=∑j<n0​​Wij(1)​x(j). If n0=0n_0=0n0​=0 both sides are 000.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me