Local isometric invariance of fixed-reference alpha entropy
ProvedQAlgorithms.Papers.Independent.Support50.P23.alphaIsometryLet and be normalized states on finite-dimensional nonzero complex systems, and let and be isometries. Define and . For every ,
The output states are constructed from the input data. The equality expresses independence from the ambient local representation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
noncomputable section
open Filter
open scoped ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P23
attribute [local instance] Classical.propDecidable
-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.
open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)
open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)
variable {A B C D I : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]
/-- Lemma 4, PDF p.4, (19): output states are the specified local isometric images. -/
theorem alphaIsometry [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(U : Matrix C A ℂ) (V : Matrix D B ℂ)
(hU : U.conjTranspose * U = 1) (hV : V.conjTranspose * V = 1) (alpha : ℝ≥0∞) :
alphaEntropy rho sigma alpha =
alphaEntropy (Matrix.kronecker U V * rho * (Matrix.kronecker U V).conjTranspose)
(V * sigma * V.conjTranspose) alpha := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality, let on and on be positive semidefinite complex matrices of trace one, and let complex matrices and satisfy and . For a bipartite matrix and reference , put , use the support condition , and define when supported and otherwise, where . For positive real , define when and support fails, and otherwise , where , for , , and otherwise; all matrix functions use continuous functional calculus. Set and . Then, for every ,
The matrices need only be isometries, so they may be rectangular; orders zero and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.