Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Projected Frobenius coefficients

Proved
QAlgorithms.Papers.Independent.Intakenext100.P41.projectedCoefficientProduct

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

prove2quantum

For the basic ODE f′=Pf/z+Qf/(1−z)f'=Pf/z+Qf/(1-z)f′=Pf/z+Qf/(1−z) with Q=vφQ=v\varphiQ=vφ under all §18 hypotheses, fix a normalized eigenvector ξi,0\xi_{i,0}ξi,0​ of PPP with eigenvalue λi\lambda_iλi​. Construct its coefficients by

(λi+n−P)ξi,n=Q∑r=0n−1ξi,r(n≥1),αi,n=φ(∑r=0nξi,r).(\lambda_i+n-P)\xi_{i,n}=Q\sum_{r=0}^{n-1}\xi_{i,r}\quad(n\ge1),\qquad \alpha_{i,n}=\varphi\left(\sum_{r=0}^n\xi_{i,r}\right).(λi​+n−P)ξi,n​=Qr=0∑n−1​ξi,r​(n≥1),αi,n​=φ(r=0∑n​ξi,r​).

For every n≥0n\ge0n≥0, with χP(t)=1+φ((tI−P)−1v)\chi_P(t)=1+\varphi((tI-P)^{-1}v)χP​(t)=1+φ((tI−P)−1v),

αi,n=φ(ξi,0)∏m=1nχP(λi+m).\alpha_{i,n}=\varphi(\xi_{i,0})\prod_{m=1}^n\chi_P(\lambda_i+m).αi,n​=φ(ξi,0​)m=1∏n​χP​(λi​+m).

The empty product is one, and nonresonance ensures that every inverse at positive mmm exists. This retains displayed equation (5); the erroneous intervening prose recurrence is not used as a definition.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
Formal statement
noncomputable section

open scoped BigOperators

open MeasureTheory Set

namespace QAlgorithms.Papers.Independent.Intakenext100.P41

/-- §22 equation (5), PDF p.28. The printed intervening recurrence has an
index/factor typo. The directly preceding resolvent identity gives
α_n=χ_P(λ+n)α_{n−1}, yielding the printed product below, including n=0. -/
theorem projectedCoefficientProduct {d : ℕ} (A : BasicODEData d) (i : Fin d) (n : ℕ) :
    projectedCoefficient A i n = A.phi (A.xi i) *
      ∏ m ∈ Finset.range n,
        resolventScalar A.P A.v A.phi (A.lambda i + ((m + 1 : ℕ) : ℂ)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P41

end
Source
Operator Algebras and Conformal Field Theory III. Fusion of positive energy representations of LSU(N) using bounded operators, arXiv:math/9806031v1, PDF p. 28, §22: Let Q(ξ0 + · · · + ξn ) = αn v,
Read-back

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

Let ddd be a natural number and let AAA consist of a positive dimension d>0d>0d>0, a matrix P∈Md(C)P\in M_d(\mathbb C)P∈Md​(C), a vector v∈Cdv\in\mathbb C^dv∈Cd, a complex-linear functional ϕ\phiϕ with ϕ(v)≠0\phi(v)\ne0ϕ(v)=0, families (λi)(\lambda_i)(λi​) and (μi)(\mu_i)(μi​), and bases (ξi)(\xi_i)(ξi​) and (ζi)(\zeta_i)(ζi​) of Cd\mathbb C^dCd. Put Qij=viϕ(ej)Q_{ij}=v_i\phi(e_j)Qij​=vi​ϕ(ej​), where eje_jej​ is the standard coordinate vector. Assume that Pξi=λiξiP\xi_i=\lambda_i\xi_iPξi​=λi​ξi​, (P−Q)ζi=μiζi(P-Q)\zeta_i=\mu_i\zeta_i(P−Q)ζi​=μi​ζi​, and ϕ(ξi)=ϕ(ζi)=1\phi(\xi_i)=\phi(\zeta_i)=1ϕ(ξi​)=ϕ(ζi​)=1 for every iii; that all coordinates of vvv in both bases are nonzero; and that, for distinct i,ji,ji,j and every integer kkk, λi−λj≠k\lambda_i-\lambda_j\ne kλi​−λj​=k and μi−μj≠k\mu_i-\mu_j\ne kμi​−μj​=k. For every index i∈{0,…,d−1}i\in\{0,\ldots,d-1\}i∈{0,…,d−1}, define

si,0=ξi,si,r+1=si,r+((λi+r+1)Id−P)−1Qsi,r(r≥0).s_{i,0}=\xi_i,\qquad s_{i,r+1}=s_{i,r}+\bigl((\lambda_i+r+1)I_d-P\bigr)^{-1}Qs_{i,r} \quad(r\ge0).si,0​=ξi​,si,r+1​=si,r​+((λi​+r+1)Id​−P)−1Qsi,r​(r≥0).

Then for every natural number nnn,

ϕ(si,n)=ϕ(ξi)∏m=0n−1[1+ϕ ⁣(((λi+m+1)Id−P)−1v)].\phi(s_{i,n}) = \phi(\xi_i)\prod_{m=0}^{n-1} \left[1+\phi\!\left(\bigl((\lambda_i+m+1)I_d-P\bigr)^{-1}v\right)\right].ϕ(si,n​)=ϕ(ξi​)m=0∏n−1​[1+ϕ(((λi​+m+1)Id​−P)−1v)].

Here natural numbers in complex expressions are embedded into C\mathbb CC, and matrix inversion is total, assigning the zero matrix to singular matrices. For n=0n=0n=0 the product is empty and equals 111, so the equality reads ϕ(ξi)=ϕ(ξi)\phi(\xi_i)=\phi(\xi_i)ϕ(ξi​)=ϕ(ξi​), with this value equal to 111 by normalization.

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