Proposition 15
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_le_formationAll 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.
For a state and , put . Then
Here formation is the infimum of over all finite normalized pure decompositions. No conjecture is assumed. The order-two endpoint is excluded because it would give formation order zero.
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.15–16, Proposition 15, (4.54).
RenyiOrder two is excluded and no conjecture is used. -/
theorem squashed_le_formation (a : ℝ) (ha : RenyiOrder a) (ha2 : a < 2)
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
renyiSquashed a rho ≤ renyiFormation ((2-a)/a) rho := 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, let , , and let be a positive semidefinite trace- matrix on . Write for continuous functional calculus with and otherwise. For a density-matrix extension on , put
where the embedding inserts the identity on and the marginals are partial traces, and define as one half of the extended-real infimum of these values over all extensions with auxiliary dimension , . Set , so and . For every finite decomposition of into unit vectors with nonnegative weights summing to , form the matrix on with blocks
Then
where the infimum and inequality are in the extended real numbers. All logarithms are natural; zero decomposition weights are permitted, every listed vector must still be unit length, and an empty decomposition cannot have total weight .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.