Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 1, p. 3 — if eiεDe^{i\varepsilon D}eiεD is logical for all ε\varepsilonε, then (I−P)DP=0(I-P)DP=0(I−P)DP=0

Proved
EastinKnill.Transversal.infinitesimal_logical

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

eastin-knilllie-algebramatrix-exponentialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-error-correction

Let PPP be an operator on a finite-dimensional system and DDD a Hermitian operator. Suppose that for every real ε\varepsilonε the unitary eiεDe^{i\varepsilon D}eiεD is logical, i.e. (I−P)eiεDP=0(I-P)e^{i\varepsilon D}P = 0(I−P)eiεDP=0. Then

(I−P) D P=0.(I-P)\,D\,P = 0.(I−P)DP=0.

This is the derivative step of the proof of Theorem 1: an element DDD of the Lie algebra of the identity component C\mathcal CC generates a one-parameter group of logical gates, and differentiating at ε=0\varepsilon = 0ε=0 shows that DDD itself preserves the code space.

Formalization Note The hypothesis "D∈cD \in \mathfrak cD∈c" is replaced by what the step uses: eiεDe^{i\varepsilon D}eiεD is logical for all real ε\varepsilonε. The factor iii and the Hermiticity of DDD follow the physics convention of footnote 1. The exponential is NormedSpace.exp.

Preamble
import Mathlib
import Definitions.Def_EastinKnill_Transversal_Setting

open scoped Matrix
Formal statement
namespace EastinKnill.Transversal

theorem infinitesimal_logical {n : Type*} [Fintype n] [DecidableEq n] (P D : Matrix n n ℂ)
    (hD : D.IsHermitian)
    (h : ∀ ε : ℝ, IsLogical P (NormedSpace.exp (((ε : ℂ) * Complex.I) • D))) :
    (1 - P) * D * P = 0 := by sorry

end EastinKnill.Transversal
Source
Eastin & Knill, Restrictions on Transversal Encoded Quantum Gate Sets, arXiv:0811.4262v2, p. 3, proof of Theorem 1, display "0 = lim (I − P)[(e^{iεD} − I)/(iε)]P = (I − P)DP"
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