Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (5.16)–(5.19) — a pure state invariant under a trace-preserving OSR is an eigenvector of every OSR operator

Proved
BaconThesis.DFS.eq_5_16_5_19

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

decoherencep2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-channelsquantum-information

Let {Ai}\{A_i\}{Ai​} be a finite family of operators on a finite-dimensional Hilbert space HS\mathcal H_SHS​ satisfying the normalization

∑iAi†Ai=I,\sum_i A_i^\dagger A_i=I ,i∑​Ai†​Ai​=I,

and let ∣j⟩|j\rangle∣j⟩ be a unit vector whose pure state is invariant under the operator-sum evolution,

∑iAi ∣j⟩⟨j∣ Ai†=∣j⟩⟨j∣.\sum_i A_i\,|j\rangle\langle j|\,A_i^\dagger=|j\rangle\langle j| .i∑​Ai​∣j⟩⟨j∣Ai†​=∣j⟩⟨j∣.

Then every AiA_iAi​ maps ∣j⟩|j\rangle∣j⟩ to a multiple of itself: for each iii there is ai∈Ca_i\in\mathbb Cai​∈C with Ai∣j⟩=ai∣j⟩A_i|j\rangle=a_i|j\rangleAi​∣j⟩=ai​∣j⟩.

In the thesis this is the necessity half of the proof of Theorem 5.3.1, applied to the OSR operators Ai(t)A_i(t)Ai​(t) at a fixed time: decomposing Ai(t)∣j⟩=ai(t)∣j⟩+bi(t)∣j⊥(i)⟩A_i(t)|j\rangle=a_i(t)|j\rangle+b_i(t)|j_\perp(i)\rangleAi​(t)∣j⟩=ai​(t)∣j⟩+bi​(t)∣j⊥​(i)⟩, invariance forces ∑i∣ai(t)∣2=1\sum_i|a_i(t)|^2=1∑i​∣ai​(t)∣2=1 while normalization gives ∑i∣ai(t)∣2+∣bi(t)∣2=1\sum_i|a_i(t)|^2+|b_i(t)|^2=1∑i​∣ai​(t)∣2+∣bi​(t)∣2=1, so every bi(t)=0b_i(t)=0bi​(t)=0.

Formalization Note ∣j⟩⟨j∣|j\rangle\langle j|∣j⟩⟨j∣ is the rank-one matrix of jjj, and "unit" means ⟨j∣j⟩=1\langle j|j\rangle=1⟨j∣j⟩=1.

Differences from the source:

  • generalization: the OSR operators A_i(t) of a system–environment evolution at time t → any finite family A_i with ∑_i A_i†A_i = I; reason: the argument uses only the invariance (5.11) and the normalization (2.12), which the OSR operators satisfy (milestone eq_2_12)
  • encoding: a state |j⟩ → a vector j with ⟨j|j⟩ = 1; reason: |j⟩⟨j| is a pure state, so |j⟩ is normalized; same instances
Preamble
import Mathlib

open scoped Matrix
Formal statement
namespace BaconThesis.DFS

/-- **Necessity step, eqs. (5.16)–(5.19): an invariant pure state is an eigenvector of every OSR
operator.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1,
proof of Theorem 5.3.1, eqs. (5.16)–(5.19), pp.72–73 (PDF pp.89–90): write
`Aᵢ(t)|j⟩ = aᵢ(t)|j⟩ + bᵢ(t)|j_⊥(i)⟩`; invariance `∑ᵢ Aᵢ(t)|j⟩⟨j|Aᵢ†(t) = |j⟩⟨j|` gives
`∑ᵢ|aᵢ(t)|² = 1`, the normalization `∑ᵢ Aᵢ†(t)Aᵢ(t) = I` gives `∑ᵢ|aᵢ(t)|² + |bᵢ(t)|² = 1`, hence
every `bᵢ(t) = 0` and `Aᵢ(t)|j⟩ = aᵢ(t)|j⟩`.

For every finite family of operators `Aᵢ` with `∑ᵢ Aᵢ†Aᵢ = I` and every unit vector `j` with
`∑ᵢ Aᵢ|j⟩⟨j|Aᵢ† = |j⟩⟨j|`, each `Aᵢ j` is a scalar multiple of `j`.

**Formalization Note.** The book applies the argument to the OSR operators `Aᵢ(t)` of a fixed
time `t` and environment state; the statement is about any trace-preserving operator-sum
family, which is all the argument uses. `|j⟩⟨j|` is `Matrix.vecMulVec j (star j)`. -/
theorem eq_5_16_5_19 {s κ : Type} [Fintype s] [DecidableEq s] [Fintype κ]
    (A : κ → Matrix s s ℂ) (hA : ∑ i, (A i)ᴴ * A i = 1)
    (j : s → ℂ) (hj : star j ⬝ᵥ j = 1)
    (hinv : ∑ i, A i * Matrix.vecMulVec j (star j) * (A i)ᴴ = Matrix.vecMulVec j (star j)) :
    ∀ i, ∃ a : ℂ, A i *ᵥ j = a • j := by sorry

end BaconThesis.DFS
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, proof of Theorem 5.3.1, eqs. (5.16)–(5.19), pp.72–73 (PDF pp.89–90)
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