Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 11 — a traceless Hermitian matrix is a balanced commutator of Hermitian matrices

Proved
SKAlgorithm.Qudit.lemma_2

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

commutatorhermitian-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1solovay-kitaev

Let HHH be a traceless d×dd \times dd×d Hermitian matrix. Then there are Hermitian d×dd \times dd×d matrices FFF and GGG such that

[F,G]=FG−GF=iH[F, G] = FG - GF = iH[F,G]=FG−GF=iH

and

∥F∥, ∥G∥≤d1/4(d−12)1/2∥H∥.\|F\|,\ \|G\| \le d^{1/4} \left(\frac{d - 1}{2}\right)^{1/2} \sqrt{\|H\|} .∥F∥, ∥G∥≤d1/4(2d−1​)1/2∥H∥​.

The lemma lets the qudit algorithm write the generator of a gate close to the identity as a commutator of two generators, each of norm O(∥H∥)O(\sqrt{\|H\|})O(∥H∥​); exponentiating them gives the balanced group commutator of Eq. (33).

Formalization Note. Norms are operator norms (QAlgorithms.specNorm). The factor ((d−1)/2)1/2((d-1)/2)^{1/2}((d−1)/2)1/2 is written Real.sqrt (((d:ℝ) - 1) / 2); for d≤1d \le 1d≤1 every traceless Hermitian matrix is zero and the statement is satisfied by F=G=0F = G = 0F=G=0.

Preamble
import Mathlib
import Definitions.Def_SKAlgorithm_Qudit_Model

open scoped Matrix
open QAlgorithms
Formal statement
namespace SKAlgorithm.Qudit

theorem lemma_2 {d : ℕ} (H : Matrix (Fin d) (Fin d) ℂ) (hH : H.IsHermitian)
    (htr : H.trace = 0) :
    ∃ F G : Matrix (Fin d) (Fin d) ℂ, F.IsHermitian ∧ G.IsHermitian ∧
      F * G - G * F = Complex.I • H ∧
      specNorm F ≤ (d : ℝ) ^ ((1 : ℝ) / 4) * Real.sqrt (((d : ℝ) - 1) / 2) * Real.sqrt (specNorm H) ∧
      specNorm G ≤ (d : ℝ) ^ ((1 : ℝ) / 4) * Real.sqrt (((d : ℝ) - 1) / 2) * Real.sqrt (specNorm H) := by sorry

end SKAlgorithm.Qudit
Source
Dawson and Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030v2, p. 11, §5.2, Lemma 2, Eqs. (24)–(25)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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