§2.2 theorem I; §A.3: pure-environment unitary representation
ProvedQAlgorithms.Papers.Independent.Support50.P41.unitaryRepresentationLet be complex linear, completely positive, and trace preserving, with . There exist an environment of dimension , a unit vector , and a unitary on system and environment such that, for every matrix ,
This realizes the channel using a fixed initially independent pure environment.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.5--6,35--36, theorem I: pure-environment unitary representation with dimension bound. -/
theorem unitaryRepresentation {d : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
∃ e : ℕ, 0 < e ∧ e ≤ d^2 ∧
∃ eta : EuclideanSpace ℂ (Fin e), IsState eta ∧
∃ U : Matrix.unitaryGroup (Fin d × Fin e) ℂ,
∀ X, Phi X = dilationChannel U eta X := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer and every complex-linear map that preserves the trace of every matrix and whose amplification preserves positive semidefiniteness for every integer , there exist an integer with , a vector with , and a unitary matrix on , such that, for every ,
The partial trace here has entries ; complete positivity means applying to each matrix block while leaving the reference indices fixed. The assertion includes , in which case the dimension bounds require .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.