§7, equations (16)–(18): capacity, normalized projector and minimizing orbits
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.covariant_formulasLet 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.
The minimum defining is attained, and
For every unit minimizing seed , all orbit vectors have the same entanglement , and every density matrix in the convex hull of their pure projectors has formation . The convex hull is a set of mixtures of projectors, not the linear span of their supports. These formulas express the channel capacity and the formation of its normalized dilation projector through one pure-state minimum.
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 p.11, (16)--(18): capacity, normalized-projector formation, attained pure
minimum, entropy preservation on minimizing orbits, and their convex mixtures.
Both actions are irreducible; the product-case hypothesis is deliberately absent. -/
theorem covariant_formulas {G : Type*} [Group G] [TopologicalSpace G]
[IsTopologicalGroup G] [T2Space G] [CompactSpace G] {a b k : ℕ} (D : CovariantData G a b k) :
dilationCapacity D.W = Real.logb 2 b - formation (projectorState D) ∧
formation (projectorState D) = minimumEntanglement D ∧
(∃ v : EuclideanSpace ℂ (Fin k), ‖v‖ = 1 ∧
pureEntropyBits (embedded D.W v) = minimumEntanglement D) ∧
(∀ v : EuclideanSpace ℂ (Fin k), ‖v‖ = 1 →
pureEntropyBits (embedded D.W v) = minimumEntanglement D →
(∀ g : G, pureEntropyBits (embedded D.W (act (D.V g) v)) =
pureEntropyBits (embedded D.W v)) ∧
(∀ rho : Op (Fin a × Fin b), IsDensityMatrix rho → rho ∈ minimizingProjectorHull D v →
formation rho = 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, let be natural numbers, and let supply , a complex matrix with , and entrywise continuous unitary representations on and on , each with only zero and full invariant complex subspaces, such that for every and every complex matrix . Write , with applied by continuous functional calculus; write for the real infimum of over all finite decompositions with , , and ; set and ; and let be the real supremum over finite unit-vector ensembles of . The theorem asserts
that some unit vector attains , and that every unit vector attaining satisfies both for every , and for every positive semidefinite trace-one matrix in the real convex hull of . Each partial trace sums over the indicated factor, and the convex hull consists of finite convex combinations.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.