Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.38)–(5.39) — the commutant of ⨁JInJ⊗MdJ\bigoplus_J I_{n_J}\otimes M_{d_J}⨁J​InJ​​⊗MdJ​​ is ⨁JMnJ⊗IdJ\bigoplus_J M_{n_J}\otimes I_{d_J}⨁J​MnJ​​⊗IdJ​​

Proved
BaconThesis.Commutant.eq_5_39

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

linear-algebrap2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-informationrepresentation-theory

Let J\mathcal JJ be a finite set of irrep labels with degeneracies nJ≥1n_J\ge1nJ​≥1 and irrep dimensions dJ≥1d_J\ge1dJ​≥1, let WWW be a unitary from Cι\mathbb C^{\iota}Cι onto ⨁JCnJ⊗CdJ\bigoplus_J\mathbb C^{n_J}\otimes\mathbb C^{d_J}⨁J​CnJ​⊗CdJ​, and let

A={W†(⨁JInJ⊗XJ)W:XJ∈MdJ}≅⨁J∈JInJ⊗MdJ.A=\Bigl\{W^\dagger\Bigl(\bigoplus_J I_{n_J}\otimes X_J\Bigr)W : X_J\in M_{d_J}\Bigr\}\cong\bigoplus_{J\in\mathcal J} I_{n_J}\otimes M_{d_J}.A={W†(J⨁​InJ​​⊗XJ​)W:XJ​∈MdJ​​}≅J∈J⨁​InJ​​⊗MdJ​​.

Then the commutant A′={T:Ta=aT for all a∈A}A'=\{T : Ta=aT \text{ for all } a\in A\}A′={T:Ta=aT for all a∈A} is

A′={W†(⨁JYJ⊗IdJ)W:YJ∈MnJ}≅⨁J∈JMnJ⊗IdJ.A'=\Bigl\{W^\dagger\Bigl(\bigoplus_J Y_J\otimes I_{d_J}\Bigr)W : Y_J\in M_{n_J}\Bigr\}\cong\bigoplus_{J\in\mathcal J} M_{n_J}\otimes I_{d_J}.A′={W†(J⨁​YJ​⊗IdJ​​)W:YJ​∈MnJ​​}≅J∈J⨁​MnJ​​⊗IdJ​​.

Both inclusions are asserted.

This is the dual block structure behind the commutant condition of Chapter 7: operators commuting with the OSR algebra act only on the degeneracies, where decoherence-free information is stored.

Formalization Note The commutant is Mathlib's Set.centralizer; unitarity of WWW is W†W=1W^\dagger W=1W†W=1 and WW†=1WW^\dagger=1WW†=1.

Differences from the source:

  • encoding: A ≅ ⊕J I{n_J} ⊗ M_{d_J} ("there is a basis such that") → A = {W† (⊕J I{n_J} ⊗ X_J) W} for an explicit unitary W; reason: the orthonormal basis change of Theorem 5.4.1 made explicit; same instances
  • encoding: irreps J ∈ 𝒥 of Theorem 5.4.1 (each irrep present, with a degeneracy n_J and a dimension d_J) → hypotheses ∀ J, 0 < n J and ∀ J, 0 < d J; reason: the book's irreps and degeneracies are nonzero; an empty block would contribute nothing to any operator, so no instance changes
Preamble
import Mathlib
import Definitions.Def_BaconThesis_Commutant_blockC
import Definitions.Def_BaconThesis_Commutant_algebraA
Formal statement
namespace BaconThesis.Commutant

/-- **The commutant of `⊕_J I_{n_J} ⊗ M_{d_J}` is `⊕_J M_{n_J} ⊗ I_{d_J}`.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1,
§5.4.3, eqs. (5.38)–(5.39), p.80 (PDF p.97): "If the algebra `A` is reducible to the form
`A ≅ ⊕_{J∈𝒥} I_{n_J} ⊗ M_{d_J}`, (5.38) as in Eq. (5.30), then the commutant of the algebra is
reducible to the form `A′ ≅ ⊕_{J∈𝒥} M_{n_J} ⊗ I_{d_J}`. (5.39)" (restated as (7.2), p.100).

Let `𝒥` be a finite set of irrep labels with degeneracies `n_J ≥ 1` and irrep dimensions
`d_J ≥ 1`, let `W` be a unitary from `ℂ^ι` onto `⊕_J ℂ^{n_J} ⊗ ℂ^{d_J}`, and let
`A = {W† (⊕_J I_{n_J} ⊗ X_J) W : X_J ∈ M_{d_J}}`. Then the commutant `A′` (the set of operators
`T` with `aT = Ta` for every `a ∈ A`) is exactly `{W† (⊕_J Y_J ⊗ I_{d_J}) W : Y_J ∈ M_{n_J}}`.

**Formalization Note.** The commutant is Mathlib's `Set.centralizer`. Both inclusions are asserted
(set equality). Unitarity of `W` is `W† W = 1` and `W W† = 1`. -/
theorem eq_5_39 {𝒥 ι : Type} [Fintype 𝒥] [DecidableEq 𝒥] [Fintype ι] [DecidableEq ι]
    (n d : 𝒥 → ℕ) (hn : ∀ J, 0 < n J) (hd : ∀ J, 0 < d J)
    (W : Matrix (Σ J : 𝒥, Fin (n J) × Fin (d J)) ι ℂ)
    (hW₁ : W.conjTranspose * W = 1) (hW₂ : W * W.conjTranspose = 1) :
    Set.centralizer (algebraA n d W) =
      {T | ∃ Y : (J : 𝒥) → Matrix (Fin (n J)) (Fin (n J)) ℂ,
        T = W.conjTranspose * blockC n d Y * W} := by sorry

end BaconThesis.Commutant
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, §5.4.3, eqs. (5.38)–(5.39), p.80 (PDF p.97); restated as eq. (7.2), p.100 (PDF p.117)
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