§7, equation (19): extension of projector cost equality to minimizing orbit mixtures
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.covariant_costLet be a compact topological group with continuous unitary representations on a nonzero finite-dimensional space and on a nonzero finite-dimensional output space , both irreducible. Identify with the range of an isometry . Assume, for every and every operator on ,
Let , , , and , where is pure-state marginal entropy. An arbitrary ambient environment can be compressed to the finite component span without changing any supported state or entanglement value. The group action need not factor across the two parties.
Assume in addition . Fix a unit vector attaining , and let be any density matrix in the convex hull of . Then
This extends the given projector cost equality to mixtures of a minimizing orbit; the projector equality is a hypothesis, not a consequence asserted for every group action.
Here is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. is the asymptotic EPR preparation rate under deterministic two-way LOCC, and is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
namespace QAlgorithms.Papers.Independent.Intakenext100.P60
open scoped Matrix ComplexConjugate ComplexOrder TensorProduct
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)
open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)
open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)
/-- PDF pp.11--12, (19): cost equality and positive-copy formation additivity for
minimizing-orbit mixtures, conditional on cost=formation for the normalized projector.
The undefined rho_0 on p.12 is the preceding minimizing pure projector.
No local implementability of V is assumed. -/
theorem covariant_cost {G : Type*} [Group G] [TopologicalSpace G]
[IsTopologicalGroup G] [T2Space G] [CompactSpace G] {a b k : ℕ} (D : CovariantData G a b k)
(hcost : formationCostBits (projectorState D) = formation (projectorState D))
(v : EuclideanSpace ℂ (Fin k)) (hv : ‖v‖ = 1)
(hmin : pureEntropyBits (embedded D.W v) = minimumEntanglement D)
(rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho) (horbit : rho ∈ minimizingProjectorHull D v) :
formationCostBits rho = minimumEntanglement D ∧ formation rho = minimumEntanglement D ∧
(∀ n : ℕ, 0 < n → formation (groupedPower rho n) = n * minimumEntanglement D) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a compact Hausdorff topological group, and let be positive integers. Suppose the data consist of a complex matrix with , and representations on and on satisfying , , , , , and . Every matrix entry of each representation is continuous in ; each representation is irreducible, meaning that every complex subspace invariant under all its matrices is either zero or the whole space; and, for every and every complex matrix ,
For a matrix , put , where is applied by continuous functional calculus, and let be the real infimum of
over every finite ensemble with , , , and . Let be the following formation cost: relabel its local bases by the fixed equivalences to initial segments of natural numbers, and take the real infimum of all real such that every admits integers and a finite local protocol satisfying
Here , is the grouped tensor power relabelled to local dimensions , is the similarly grouped tensor power of projectors onto , and . The finite protocols are recursively generated from identities by local Kraus operations with , outcome-dependent finite continuations, and summation over branches; has no explicit nonnegativity restriction. Set
and assume . Let satisfy and . For every positive semidefinite, trace-one matrix on belonging to the real convex hull
the declaration asserts
where the grouped tensor power has entries . The orbit condition uses the convex hull itself, without taking its closure, and the last assertion excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.