← Latest papers
⚛️ quantum physics

Non-Subhomogeneity of Minimal Operator Systems over Positive Semidefinite and Lorentz Cones

This paper demonstrates that minimal operator systems over positive semidefinite matrices (for dimension k2k \ge 2) and Lorentz cones (for dimension m4m \ge 4) are not subhomogeneous, a result established through the construction of extreme positive maps and positive retracts, which equivalently implies the existence of entangled positive operators that become separable upon compression to any fixed finite dimension.

Original authors: Tim Netzer

Published 2026-08-26
📖 1 min read🧠 Deep dive

Original authors: Tim Netzer

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Technical Summary: Non-Subhomogeneity of Minimal Operator Systems over Positive Semidefinite and Lorentz Cones

Problem Statement
The paper investigates the structural properties of minimal operator systems associated with specific convex cones, specifically the cone of positive semidefinite (PSD) matrices Matk(C)+\text{Mat}_k(\mathbb{C})_+ for k2k \geq 2 and the Lorentz cones LmL_m for m4m \geq 4. The central question is whether these minimal operator systems are subhomogeneous.

An operator system is defined as dd-subhomogeneous if it admits a unital complete order embedding into Matd(A)\text{Mat}_d(A) for some commutative CC^*-algebra AA. In geometric terms, this corresponds to the existence of a finite-dimensional realization where the matrix size dd remains fixed regardless of the level of the system. The paper aims to determine if such a fixed dd exists for the specified cones.

Methodology
The proof strategy relies on duality and the construction of specific positive maps. The author employs the following logical reductions and constructions:

  1. Reduction via Retracts: Using Lemma 2.1, the author establishes that if a cone PP is a unital positive retract of a cone QQ, then the non-subhomogeneity of the minimal system over PP implies the non-subhomogeneity of the minimal system over QQ.

    • Lemma 2.2 demonstrates that Mat2(C)+\text{Mat}_2(\mathbb{C})_+ is a retract of Matk(C)+\text{Mat}_k(\mathbb{C})_+ for all k2k \geq 2, and L4L_4 is a retract of LmL_m for all m4m \geq 4.
    • Consequently, the problem reduces to proving that the minimal system over Mat2(C)+\text{Mat}_2(\mathbb{C})_+ (which is order-isomorphic to L4L_4) is not dd-subhomogeneous for any dd.
  2. Duality and Extreme Rays: The author utilizes the Jamiołkowski–Choi correspondence, which identifies positive maps Φ:Mat2(C)Mats(C)\Phi: \text{Mat}_2(\mathbb{C}) \to \text{Mat}_s(\mathbb{C}) with block-positive matrices.

    • Lemma 3.1 establishes that if there exists an extreme positive map Φ\Phi from Mat2(C)\text{Mat}_2(\mathbb{C}) to Mats(C)\text{Mat}_s(\mathbb{C}) (where s>ds > d) such that Φ(I2)\Phi(I_2) is invertible, then the minimal system is not dd-subhomogeneous. This is because such a map cannot be decomposed into a sum of compressions of maps into Matd(C)\text{Mat}_d(\mathbb{C}) due to rank constraints.
  3. Explicit Construction: To satisfy the conditions of Lemma 3.1, the author constructs a specific family of maps using Woronowicz's symmetric-power construction (Section 4).

    • They define a map Φ\Phi on the symmetric tensor power H=Symn(E)H = \text{Sym}_n(E) where E=C2E = \mathbb{C}^2 and n=2r+1n = 2r+1.
    • A key component is an alternating diagonal operator σ\sigma acting on the symmetric power of dimension n1n-1.
    • The map is defined via an inverse of a specific Hermitian operator ρ\rho constructed from σ\sigma and the embedding of symmetric powers.
    • The author proves that for every r1r \geq 1, this construction yields a unital, irreducible, extreme positive map Φr:Mat2(C)Mat2r+2(C)\Phi_r: \text{Mat}_2(\mathbb{C}) \to \text{Mat}_{2r+2}(\mathbb{C}) where the output dimension s=2r+2s = 2r+2 can be arbitrarily large.

Key Contributions and Results

  • Main Theorem (Theorem 2.3): For every k2k \geq 2 and m4m \geq 4, the minimal operator systems over Matk(C)+\text{Mat}_k(\mathbb{C})_+ and LmL_m are not dd-subhomogeneous for any dNd \in \mathbb{N}.
  • Construction of Extreme Maps: The paper explicitly constructs extreme positive maps from Mat2(C)\text{Mat}_2(\mathbb{C}) to Mats(C)\text{Mat}_s(\mathbb{C}) of arbitrarily large output dimension ss, where the value at the identity is invertible. This construction utilizes an alternating diagonal operator within the symmetric power framework.
  • Entanglement Interpretation: The result is equivalently stated in terms of quantum information: For fixed k2k \geq 2 and dd, there exist s>ds > d and an entangled positive operator X0X \geq 0 on CkCs\mathbb{C}^k \otimes \mathbb{C}^s such that every compression of the second factor to Cd\mathbb{C}^d results in a separable operator.
  • Sharpness of Thresholds: Remark 5.1 notes that the threshold for Lorentz cones is sharp. L2L_2 is simplicial (1-subhomogeneous), and L3L_3 admits a 2×22 \times 2 realization (2-subhomogeneous). The non-subhomogeneity property strictly begins at L4L_4.

Significance and Scope
The paper addresses a specific question raised in prior literature [4] regarding the subhomogeneity of minimal operator systems over PSD cones. By proving that these systems lack a fixed finite-dimensional realization, the work clarifies the limitations of matrix-convex descriptions for these specific cones.

The author explicitly states in the AI Declaration that the results were produced almost entirely by an artificial intelligence system (ChatGPT 5.6 Sol), with the human author acting as a facilitator for posing the question, suggesting approaches, evaluating output, and editing the text. Consequently, the author does not claim ownership and will not submit the paper to a mathematical journal, inviting comments and corrections instead. The work serves as a rigorous verification of a mathematical result generated by AI, demonstrating the capability of such systems to construct complex proofs involving operator theory, tensor products, and convex geometry, provided they are subject to human verification and refinement.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →