6.11
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.local_isometry_invarianceAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
Both smooth min and smooth max are invariant under arbitrary local isometries U:A→Aprime,V:B→Bprime, τ=(U⊗V)ρ(U⊗V)†. ε=0 also gives the unsmoothed assertions.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.11
6.11, arXiv:1504.00233v5, PDF p.100. -/
theorem local_isometry_invariance [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(r : paperMat (A × B)) (hr : paperSubnormalized r) (e : ℝ) (he : Radius r e)
(U : Matrix C A ℂ) (V : Matrix D B ℂ) (hU : Uᴴ*U = 1) (hV : Vᴴ*V = 1) :
paperSmoothMin r e = paperSmoothMin (paperLocalEmbedding U V r) e ∧ paperSmoothMax r e = paperSmoothMax (paperLocalEmbedding U V r) e ∧
paperHmin r = paperHmin (paperLocalEmbedding U V r) ∧ hmax r = hmax (paperLocalEmbedding U V r) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
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 be a complex matrix on with , and let . Let be a complex matrix with rows indexed by and columns by , and one with rows indexed by and columns by , satisfying and . Set . For a matrix on any , define the extended-real quantities
Here means , square roots use continuous functional calculus, and , with otherwise. Define
and , . Then all four equalities hold:
The radius condition excludes trace-zero ; no identities or are assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.