Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.3.1 — a subspace is decoherence-free iff every system operator SαS_\alphaSα​ acts on it as a scalar

Proved
BaconThesis.DFS.theorem_5_3_1

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

decoherencedecoherence-free-subspacesp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-information

Let a system and an environment have finite-dimensional Hilbert spaces HS\mathcal H_SHS​ and HE\mathcal H_EHE​, and let them be coupled by a Hamiltonian

H=∑αSα⊗BαH=\sum_{\alpha}S_\alpha\otimes B_\alphaH=α∑​Sα​⊗Bα​

with finitely many system operators SαS_\alphaSα​ and linearly independent environment operators BαB_\alphaBα​, HHH Hermitian. Then a subspace S⊆HS\mathcal S\subseteq\mathcal H_SS⊆HS​ is a decoherence-free subspace for HHH (Definition 5.3.1: every pure state ∣j⟩⟨j∣|j\rangle\langle j|∣j⟩⟨j∣ with ∣j⟩∈S|j\rangle\in\mathcal S∣j⟩∈S satisfies TrE[U(t)(∣j⟩⟨j∣⊗ρE)U†(t)]=∣j⟩⟨j∣\mathrm{Tr}_E[U(t)(|j\rangle\langle j|\otimes\rho_E)U^\dagger(t)]=|j\rangle\langle j|TrE​[U(t)(∣j⟩⟨j∣⊗ρE​)U†(t)]=∣j⟩⟨j∣ for every environment density operator ρE\rho_EρE​ and every t≥0t\ge0t≥0) if and only if there are complex numbers cαc_\alphacα​ with

Sα∣j⟩=cα∣j⟩for every α and every ∣j⟩∈S.S_\alpha|j\rangle=c_\alpha|j\rangle\qquad\text{for every }\alpha\text{ and every }|j\rangle\in\mathcal S .Sα​∣j⟩=cα​∣j⟩for every α and every ∣j⟩∈S.

The constants cαc_\alphacα​ are the same for all vectors of S\mathcal SS: a DFS is a degenerate common eigenspace of the system operators.

This is the basic criterion for decoherence-free subspaces: it replaces a condition on the evolution under every environment initial state by a finite set of linear-algebraic conditions on the coupling.

Formalization Note The coupling is the sum of Kronecker products on pairs (system index, environment index), system first; U(t)=exp⁡[−iHt]U(t)=\exp[-iHt]U(t)=exp[−iHt] and the partial trace is WildeQIT.partialTraceRight.

Differences from the source:

  • generalization: B_α Hermitian, trace-orthonormal and a complete fixed basis (pp.68–69) → B_α only linearly independent; reason: Theorem 5.3.1's own hypothesis (§5.3, p.71) is linear independence; every expansion the book allows is covered
  • reading: the time t in (5.12), not restricted in the text → every t ≥ 0; reason: the OSR evolution (2.8) runs forward from the initial time 0
  • encoding: the OSR sum ∑_i A_i(t)|j⟩⟨j|A_i†(t) in (5.12) → Tr_E[U(t)(|j⟩⟨j| ⊗ ρ_E)U†(t)]; reason: the two are equal by (2.9)–(2.11) (milestone eq_2_9_2_11)
  • encoding: "every pure state from this subspace", "∀ρ_E(0)" → every j ∈ S with ⟨j|j⟩ = 1, every density operator ρ_E on the environment; reason: Lean convention; same instances
  • encoding: α = 0, …, A → a finite index type ι; reason: Lean convention; same instances
Preamble
import Mathlib
import Definitions.Def_BaconThesis_DFS_IsDFS

open scoped Matrix Kronecker
Formal statement
namespace BaconThesis.DFS

/-- **Theorem 5.3.1 (Decoherence-free subspace Hamiltonian criteria).**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1,
Theorem 5.3.1, eq. (5.13), p.72 (PDF p.89), for a system-environment coupling
`H = ∑_α S_α ⊗ B_α` (eq. (5.1), p.68) with linearly independent environment operators `B_α`
(§5.3, p.71): a subspace `S` is a DFS iff the system operators `S_α` act proportional to identity
on the subspace, `S_α|j⟩ = c_α|j⟩` for all `|j⟩ ∈ S`.

For finite system and environment index types, a finite family `S_α`, `B_α` with `B_α` linearly
independent and `H = ∑_α S_α ⊗ B_α` Hermitian, and every subspace `W` of the system space:
`W` is a decoherence-free subspace (Definition 5.3.1, `IsDFS`) if and only if there are complex
numbers `c_α`, one for each `α` and the same for every vector of `W`, with `S_α j = c_α j` for
all `j ∈ W`.

**Formalization Note.** Hilbert spaces are `s → ℂ`, `e → ℂ` with `Fintype s`, `Fintype e`; the
coupling is `∑_α Sα α ⊗ₖ Bα α` on `s × e` (system first). The book also takes the `B_α`
Hermitian, trace-orthonormal and complete; only linear independence (stated by the book for this
theorem) and Hermiticity of `H` are assumed. -/
theorem theorem_5_3_1 {s e ι : Type} [Fintype s] [DecidableEq s] [Fintype e] [DecidableEq e]
    [Fintype ι]
    (Sα : ι → Matrix s s ℂ) (Bα : ι → Matrix e e ℂ)
    (hH : (∑ α, Sα α ⊗ₖ Bα α).IsHermitian) (hB : LinearIndependent ℂ Bα)
    (W : Submodule ℂ (s → ℂ)) :
    IsDFS (∑ α, Sα α ⊗ₖ Bα α) W ↔ ∃ c : ι → ℂ, ∀ α, ∀ j ∈ W, Sα α *ᵥ j = c α • j := by sorry

end BaconThesis.DFS
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, Theorem 5.3.1, eq. (5.13), p.72 (PDF p.89); Definition 5.3.1, eq. (5.12), p.72 (PDF p.89); eq. (5.1), p.68 (PDF p.85); §5.3, p.71 (PDF p.88)
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 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