Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 12 — the group commutator of exp(iF), exp(iG) is exp(i·i[F,G]) up to O(δ³)

Proved
SKAlgorithm.Qudit.lemma_3

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

group-commutatormatrix-exponentialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1solovay-kitaev

There is a constant c1>0c_1 > 0c1​>0 with the following property. Let FFF and GGG be Hermitian d×dd \times dd×d matrices (any ddd) with ∥F∥,∥G∥<δ\|F\|, \|G\| < \delta∥F∥,∥G∥<δ. Then

d(exp⁡(iF)exp⁡(iG)exp⁡(−iF)exp⁡(−iG), exp⁡(i×i[F,G]))≤c1δ3,d\big(\exp(iF)\exp(iG)\exp(-iF)\exp(-iG),\ \exp(i \times i[F, G])\big) \le c_1 \delta^3 ,d(exp(iF)exp(iG)exp(−iF)exp(−iG), exp(i×i[F,G]))≤c1​δ3,

where [F,G]=FG−GF[F, G] = FG - GF[F,G]=FG−GF.

The paper gives c1≈4c_1 \approx 4c1​≈4. With Lemma 2 this shows that a gate near the identity is approximated to third order by a group commutator of two gates closer to the identity.

Formalization Note. The constant c1c_1c1​ is existential and is chosen before the dimension ddd and the matrices: the paper's "some constant c1≈4c_1 \approx 4c1​≈4" is a number, not a function of ddd. The value 444 is not pinned. The exponential is NormedSpace.exp, and exp⁡(i×i[F,G])\exp(i \times i[F,G])exp(i×i[F,G]) is kept in the paper's form exp (I • (I • (F * G - G * F))).

Preamble
import Mathlib
import Definitions.Def_SKAlgorithm_Qudit_Model

open scoped Matrix
open QAlgorithms
Formal statement
namespace SKAlgorithm.Qudit

theorem lemma_3 :
    ∃ c₁ : ℝ, 0 < c₁ ∧ ∀ (d : ℕ) (F G : Matrix (Fin d) (Fin d) ℂ) (δ : ℝ),
      F.IsHermitian → G.IsHermitian → specNorm F < δ → specNorm G < δ →
      specNorm (NormedSpace.exp (Complex.I • F) * NormedSpace.exp (Complex.I • G) *
          NormedSpace.exp ((-Complex.I) • F) * NormedSpace.exp ((-Complex.I) • G) -
        NormedSpace.exp (Complex.I • (Complex.I • (F * G - G * F)))) ≤ c₁ * δ ^ 3 := by sorry

end SKAlgorithm.Qudit
Source
Dawson and Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030v2, p. 12, §5.2, Lemma 3, Eq. (32)
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