Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (40) — the partial trace over the site intertwines V⊗LV\otimes LV⊗L conjugation with VVV conjugation

Proved
NonAbelianDMNRG.Recursion.eq_40

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-tracesymmetry

Let aaa and bbb be finite index sets and consider operators on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, where the second factor plays the role of the last NRG site. Write Tr⁡site\operatorname{Tr}_{\mathrm{site}}Trsite​ for the partial trace over the second factor. For every matrix VVV on Ca\mathbb C^aCa, every unitary matrix LLL on Cb\mathbb C^bCb (that is, L†L=1L^\dagger L = 1L†L=1) and every operator RRR on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb,

Tr⁡site{(V⊗L) R (V⊗L)†}=V Tr⁡site{R} V†.\operatorname{Tr}_{\mathrm{site}}\big\{(V\otimes L)\, R\, (V\otimes L)^\dagger\big\} = V\, \operatorname{Tr}_{\mathrm{site}}\{R\}\, V^\dagger .Trsite​{(V⊗L)R(V⊗L)†}=VTrsite​{R}V†.

In the paper the symmetry transformation on the first nnn sites factors as U(g)=L(g)V(g)U(g) = L(g)V(g)U(g)=L(g)V(g), with L(g)L(g)L(g) acting on site nnn and V(g)V(g)V(g) on sites 0,…,n−10,\dots,n-10,…,n−1; this identity is the step that moves the symmetry through the trace over site nnn.

Formalization Note The statement holds for an arbitrary VVV; only LLL needs to be unitary. Operators are indexed with the block factor first and the site factor second; the partial trace is the published WildeQIT.partialTraceRight.

Preamble
import Mathlib
import Definitions.Def_WildeQIT_partialTrace
open Matrix
open scoped Kronecker
Formal statement
namespace NonAbelianDMNRG.Recursion

/-- **Eq. (40), p. 7.** Tracing out the right factor (the site) intertwines conjugation by
`V ⊗ L` with conjugation by `V`, for any `V` and any unitary `L`:
`Tr_site{(V ⊗ L) R (V ⊗ L)⁺} = V Tr_site{R} V⁺`. -/
theorem eq_40 {a b : Type} [Fintype a] [Fintype b] [DecidableEq b]
    (V : Matrix a a ℂ) (L : Matrix b b ℂ) (hL : Lᴴ * L = 1)
    (R : Matrix (a × b) (a × b) ℂ) :
    WildeQIT.partialTraceRight ((V ⊗ₖ L) * R * (V ⊗ₖ L)ᴴ) =
      V * WildeQIT.partialTraceRight R * Vᴴ := by sorry

end NonAbelianDMNRG.Recursion
Source
Tóth, Moca, Legeza, Zaránd, Density matrix numerical renormalization group for non-Abelian symmetries, arXiv:0802.4332v1, p. 7, eq. (40)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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