Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 12 — a gate near the identity is exp(iH), H traceless Hermitian, with d(I, U) = ‖H‖ + O(‖H‖³)

Proved
SKAlgorithm.Qudit.log_near_identity

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

matrix-exponentialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1solovay-kitaevspecial-unitary-group

Fix ddd. There are constants ϵ1>0\epsilon_1 > 0ϵ1​>0 and K>0K > 0K>0 such that every U∈SU(d)U \in SU(d)U∈SU(d) with d(I,U)<ϵ1d(I, U) < \epsilon_1d(I,U)<ϵ1​ can be written U=exp⁡(iH)U = \exp(iH)U=exp(iH) with HHH a traceless Hermitian matrix of operator norm ∥H∥<π\|H\| < \pi∥H∥<π satisfying

∣ d(I,U)−∥H∥ ∣≤K∥H∥3,\big|\, d(I, U) - \|H\| \,\big| \le K \|H\|^3 ,​d(I,U)−∥H∥​≤K∥H∥3,

i.e. d(I,U)=∥H∥+O(∥H∥3)d(I, U) = \|H\| + O(\|H\|^3)d(I,U)=∥H∥+O(∥H∥3).

This is the first step of the paper's balanced commutator construction in SU(d)SU(d)SU(d): it turns a gate close to the identity into a small generator HHH to which Lemma 2 applies.

Formalization Note. Two clauses are made explicit. (1) tr⁡H=0\operatorname{tr} H = 0trH=0: the paper does not say it on p. 12, but Lemma 2 is applied to HHH and requires it; it holds because det⁡U=1\det U = 1detU=1 and the eigenvalues of a small HHH are small. (2) ∥H∥<π\|H\| < \pi∥H∥<π: p. 3 states the expansion d(I,exp⁡(iH))=∥H∥+O(∥H∥3)d(I, \exp(iH)) = \|H\| + O(\|H\|^3)d(I,exp(iH))=∥H∥+O(∥H∥3) under the proviso that the eigenvalues of HHH lie between −π-\pi−π and π\piπ; without it, HHH could be shifted by multiples of 2π2\pi2π to a large logarithm, for which the estimate holds trivially. The constants ϵ1\epsilon_1ϵ1​ and KKK may depend on ddd. The printed "U exp(iH)" is read as "U = exp(iH)".

Preamble
import Mathlib
import Definitions.Def_SKAlgorithm_Qudit_Model

open scoped Matrix
open QAlgorithms
Formal statement
namespace SKAlgorithm.Qudit

theorem log_near_identity (d : ℕ) :
    ∃ ε₁ K : ℝ, 0 < ε₁ ∧ 0 < K ∧ ∀ U : SU d, opDist 1 U < ε₁ →
      ∃ H : Matrix (Fin d) (Fin d) ℂ, H.IsHermitian ∧ H.trace = 0 ∧ specNorm H < Real.pi ∧
        (U : Matrix (Fin d) (Fin d) ℂ) = NormedSpace.exp (Complex.I • H) ∧
        |opDist 1 U - specNorm H| ≤ K * specNorm H ^ 3 := by sorry

end SKAlgorithm.Qudit
Source
Dawson and Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030v2, p. 12, §5.2, 'Suppose d(I, U) < ǫ. We can find Hermitian H such that U exp(iH) and d(I, U) = ‖H‖ + O(‖H‖³)'; proviso from p. 3, §2
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