Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Expectation-value QNTK is symmetric and positive semidefinite

Proved
QAlgorithms.Papers.Independent.Intakenext100.P88.expectation_kernel_psd

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

The circuit acts on a nonzero finite-dimensional complex Hilbert space H=ChH=\mathbb C^hH=Ch and has the ordered form U(θ)=∏ℓ=1LWℓexp⁡(iθℓXℓ)U(\theta)=\prod_{\ell=1}^L W_\ell\exp(i\theta_\ell X_\ell)U(θ)=∏ℓ=1L​Wℓ​exp(iθℓ​Xℓ​), with fixed unitary WℓW_\ellWℓ​, Hermitian XℓX_\ellXℓ​, and real angles. Products are written in increasing index order and the rightmost factor acts first. Feature vectors ϕ(x)\phi(x)ϕ(x) have norm one. For Hermitian observables OiO_iOi​, put zx,i(θ)=⟨U(θ)ϕ(x),OiU(θ)ϕ(x)⟩∈Rz_{x,i}(\theta)=\langle U(\theta)\phi(x),O_iU(\theta)\phi(x)\rangle\in\mathbb Rzx,i​(θ)=⟨U(θ)ϕ(x),Oi​U(θ)ϕ(x)⟩∈R.

For arbitrary angles define Kab=∑ℓ∂θℓza ∂θℓzbK_{ab}=\sum_\ell\partial_{\theta_\ell}z_a\,\partial_{\theta_\ell}z_bKab​=∑ℓ​∂θℓ​​za​∂θℓ​​zb​, where a,ba,ba,b range over data-observable pairs. Then

Kab=Kba,[Kapaq]p,q=1n⪰0K_{ab}=K_{ba},\qquad [K_{a_p a_q}]_{p,q=1}^n\succeq0Kab​=Kba​,[Kap​aq​​]p,q=1n​⪰0

for every finite list a1,…,ana_1,\ldots,a_na1​,…,an​, including an empty list. Thus an infinite data space is handled through its finite Gram submatrices. No entrywise positivity or nonsingularity is claimed. This supplies a positive semidefinite kernel for the expectation model.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P88
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P88

open scoped BigOperators ComplexConjugate Topology NNReal ComplexOrder

open MeasureTheory ProbabilityTheory Filter

/-- PDF p.24 SM Theorem 1, Eq.(94): symmetry and PSD for every finite Gram submatrix.
No finite-dimensional operator on an infinite data space is postulated. -/
theorem expectation_kernel_psd {D I : Type*} [Fintype I] {h L : ℕ}
    (M : ExpectationNetwork D I h L) (theta : Fin L → ℝ) :
    (∀ a b, expectationKernel M theta a b = expectationKernel M theta b a) ∧
    ∀ (n : ℕ) (a : Fin n → D × I),
      Matrix.PosSemidef (fun i j => expectationKernel M theta (a i) (a j)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P88

end
Source
Representation Learning via Quantum Neural Tangent Kernels, arXiv:2111.04225v3, PDF p. 24, SM Theorem 1; Eq.(94)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For arbitrary types D,ID,ID,I, with III finite, natural numbers h,Lh,Lh,L, every model MMM described below, and every real parameter vector θ=(θl)0≤l<L\theta=(\theta_l)_{0\le l<L}θ=(θl​)0≤l<L​, a kernel is symmetric and all its finite sampled matrices are positive semidefinite. The model supplies h>0h>0h>0, unitary complex h×hh\times hh×h matrices WlW_lWl​, Hermitian complex h×hh\times hh×h matrices XlX_lXl​, unit vectors ϕx∈Ch\phi_x\in\mathbb C^hϕx​∈Ch for all x∈Dx\in Dx∈D, and Hermitian matrices OiO_iOi​ for all i∈Ii\in Ii∈I. Define

U(η)=∏l=0L−1Wlexp⁡(iηlXl),fx,i(η)=Re⁡⟨U(η)ϕx, OiU(η)ϕx⟩,U(\eta)=\prod_{l=0}^{L-1}W_l\exp(i\eta_lX_l), \qquad f_{x,i}(\eta)=\operatorname{Re}\langle U(\eta)\phi_x,\,O_iU(\eta)\phi_x\rangle,U(η)=l=0∏L−1​Wl​exp(iηl​Xl​),fx,i​(η)=Re⟨U(η)ϕx​,Oi​U(η)ϕx​⟩,

with increasing product order, identity empty product, and standard matrix action and complex Euclidean inner product. For a=(x,i)∈D×Ia=(x,i)\in D\times Ia=(x,i)∈D×I, let

da,l(θ)=dds fx,i ⁣(update⁡(θ,l,s))∣s=θl,Kθ(a,b)=∑l=0L−1da,l(θ)db,l(θ),d_{a,l}(\theta)= \left.\frac{d}{ds}\, f_{x,i}\!\left(\operatorname{update}(\theta,l,s)\right)\right|_{s=\theta_l}, \qquad K_\theta(a,b)=\sum_{l=0}^{L-1}d_{a,l}(\theta)d_{b,l}(\theta),da,l​(θ)=dsd​fx,i​(update(θ,l,s))​s=θl​​,Kθ​(a,b)=l=0∑L−1​da,l​(θ)db,l​(θ),

where the update changes only coordinate lll, and derivatives are the total real one-variable derivative operation, assigned zero when differentiability fails. The asserted conjunction is that Kθ(a,b)=Kθ(b,a)K_\theta(a,b)=K_\theta(b,a)Kθ​(a,b)=Kθ​(b,a) for every a,b∈D×Ia,b\in D\times Ia,b∈D×I, and that for every natural number nnn and every function a:{0,…,n−1}→D×Ia:\{0,\ldots,n-1\}\to D\times Ia:{0,…,n−1}→D×I, the real matrix Gpq=Kθ(a(p),a(q))G_{pq}=K_\theta(a(p),a(q))Gpq​=Kθ​(a(p),a(q)) is symmetric and satisfies

∀ c∈Rn,∑p=0n−1∑q=0n−1cp Kθ(a(p),a(q)) cq≥0.\forall\,c\in\mathbb R^n,\qquad \sum_{p=0}^{n-1}\sum_{q=0}^{n-1}c_p\,K_\theta(a(p),a(q))\,c_q\ge0.∀c∈Rn,p=0∑n−1​q=0∑n−1​cp​Kθ​(a(p),a(q))cq​≥0.

The sampled points may repeat. The case n=0n=0n=0 is included, as is L=0L=0L=0, when the kernel is zero. Either DDD or III may be empty, making the pointwise symmetry assertion vacuous and leaving no sampling functions for positive nnn; DDD need not be finite.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me