Proposition 12
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.formation_min_formulaAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Let , , and let be a state. The Rényi entanglement of formation, defined as the infimum of over finite pure decompositions, obeys
Each is nonnegative, the weights sum to one, is normalized, and . The minimum is attained by some finite ensemble; no cardinality bound is asserted. The outer weights are , not .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.12–13, Proposition 12, (4.38).
The value equals an ATTAINED minimum, with no cardinality bound. -/
theorem formation_min_formula (a : ℝ) (ha : RenyiOrder a)
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
∃ ens : FinitePureDecomposition rho,
renyiFormation a rho = (formationObjective a ens : EReal) ∧
∀ other : FinitePureDecomposition rho, formationObjective a ens ≤ formationObjective a other := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite register index types with decidable equality, , , and a positive semidefinite trace- matrix on . A finite pure decomposition consists of , weights with , and unit vectors such that , where . For such a decomposition , let and let on have entries . Write for spectral functional calculus assigning to zero eigenvalues and to nonzero eigenvalues. Define
where the first infimum is in the extended real numbers and the bracketed real values are embedded there. There exists a finite pure decomposition of such that and for every other finite pure decomposition of . Zero weights are allowed, all listed vectors must have norm , an empty decomposition cannot satisfy the weight-sum condition, and logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.