Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rank-one resolvent inversion

Proved
QAlgorithms.Papers.Independent.Intakenext100.P41.resolventInversion

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

prove2quantum

Let d≥1d\ge1d≥1, P∈End⁡(Cd)P\in\operatorname{End}(\mathbb C^d)P∈End(Cd), Q=vφQ=v\varphiQ=vφ with δ=φ(v)≠0\delta=\varphi(v)\ne0δ=φ(v)=0, and R=Q−PR=Q-PR=Q−P. Assume the §18 simple-spectrum, nonresonance and general-position hypotheses for both PPP and RRR, using eigenbases normalized by φ=1\varphi=1φ=1. Define χA(t)=1+φ((tI−A)−1v)\chi_A(t)=1+\varphi((tI-A)^{-1}v)χA​(t)=1+φ((tI−A)−1v) where the resolvent exists. For every t∈Ct\in\mathbb Ct∈C for which tI−RtI-RtI−R and −tI−P-tI-P−tI−P are invertible,

χR(t)=χP(−t)−1.\chi_R(t)=\chi_P(-t)^{-1}.χR​(t)=χP​(−t)−1.

This is the common-resolvent-domain form of the source rational identity. The hypotheses avoid assigning total-inverse values at poles; the two determinant conditions also imply that the scalar being inverted is nonzero.

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 inversion lemma, PDF p.28. Pointwise form on the common resolvent
set; the excluded poles are essential because Lean's matrix inverse is total. -/
theorem resolventInversion {d : ℕ} (A : BasicODEData d) (t : ℂ)
    (hP : ((-t) • (1 : Matrix (Fin d) (Fin d) ℂ) - A.P).det ≠ 0)
    (hR : (t • (1 : Matrix (Fin d) (Fin d) ℂ) -
      (linearRankOneMatrix A.v A.phi - A.P)).det ≠ 0) :
    resolventScalar (linearRankOneMatrix A.v A.phi - A.P) A.v A.phi t =
      (resolventScalar A.P A.v A.phi (-t))⁻¹ := 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: Inversion lemma
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 every coordinate of vvv in each of these two bases is nonzero; and that, for distinct i,ji,ji,j and every integer nnn, both λi−λj≠n\lambda_i-\lambda_j\ne nλi​−λj​=n and μi−μj≠n\mu_i-\mu_j\ne nμi​−μj​=n. For every t∈Ct\in\mathbb Ct∈C satisfying det⁡((−t)Id−P)≠0\det((-t)I_d-P)\ne0det((−t)Id​−P)=0 and det⁡(tId−(Q−P))≠0\det(tI_d-(Q-P))\ne0det(tId​−(Q−P))=0, one has

1+ϕ ⁣((tId−(Q−P))−1v)=(1+ϕ ⁣(((−t)Id−P)−1v))−1.1+\phi\!\left((tI_d-(Q-P))^{-1}v\right) = \left(1+\phi\!\left(((-t)I_d-P)^{-1}v\right)\right)^{-1}.1+ϕ((tId​−(Q−P))−1v)=(1+ϕ(((−t)Id​−P)−1v))−1.

Both matrix inverses are of invertible matrices by the stated hypotheses; the outer inverse on the right is complex inversion, whose total convention assigns 0−1=00^{-1}=00−1=0.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me