Corrected rank-dependent length restriction for formation
OpenQAlgorithms.Papers.Independent.Support50.P35.formation_rank_length_boundLet , let be continuous, unitarily invariant, and concave on density matrices on , and let be a normalized density matrix on . Put . Then
Every decomposition is finite and normalized, with unit vectors and nonnegative weights of total one. The left side allows every finite length. The printed is corrected using the explicit discussion on p.17 and the intended finite upper bound. For rank one the restricted interval is exactly . This restriction preserves the optimization value rather than using an empty-set default.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
noncomputable section
open scoped Matrix ComplexConjugate Topology Manifold
namespace QAlgorithms.Papers.Independent.Support50.P35
/-- PDF pp.17,19, Eq.(61), corrected r<=s<=r^2: restricting the finite
formation infimum to this rank-dependent interval leaves its value unchanged. -/
theorem formation_rank_length_bound (M N : ℕ) (hN : 0 < N) (hNM : N ≤ M)
(f : Matrix (Fin M) (Fin M) ℂ → ℝ) (hf : IsMarginalCost f)
(rho : Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ) (hrho : IsDensityMatrix rho) :
QAlgorithms.Papers.Independent.Information100.P03.convexRoof (fun psi => f (traceRight (pureDensity psi))) rho =
sInf (rankRestrictedValues f rho) := by sorry
end QAlgorithms.Papers.Independent.Support50.P35
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers with , every real-valued function on complex matrices that is continuous and concave on the convex set of positive semidefinite trace- matrices and invariant under unitary conjugation on that set, and every positive semidefinite trace- matrix on , the following two real infima are equal: the infimum of
over all natural numbers , nonnegative real weights summing to , and norm- vectors satisfying ; and the infimum of the same values restricted to families with . Zero weights and repeated vectors are allowed, and the length counts all listed terms. The conclusion is equality of infima and does not assert that either infimum is attained.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.