pith. sign in

arxiv: 2511.13101 · v2 · submitted 2025-11-17 · 🧮 math.OA · math.FA

Matrix-Test Duality: A Support-Function Characterization for C^*-Convex Families of CP Maps

Mohsen Kian , Mario Krnic This is my paper

Pith reviewed 2026-05-17 21:32 UTC · model grok-4.3

classification 🧮 math.OA math.FA
keywords C*-convex hullcompletely positive mapsmatrix testssupport functionoperator systemsweak topologyseparation theorem
0
0 comments X

The pith

Matrix-test inequalities characterize the τ-closed C*-convex hull of families of completely positive maps.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a support-function characterization for the τ-closed C*-convex hull of a set of completely positive maps between an operator system and a unital C*-algebra. Matrix tests generate evaluation functionals and a weak topology τ on the span of such maps. The central result shows that membership in the closed hull is equivalent to satisfying a family of matrix-test inequalities obtained via a folding procedure that reduces multiple tests to one higher-level matrix test. This yields concrete criteria for non-membership, for equality of two such hulls, and for bipolar reconstruction when zero lies in the hull. The topology τ is already generated by level-one tests, yet higher-level tests remain necessary for the geometric inequalities that separate points from the hull.

Core claim

The τ-closed C*-convex hull of a family K of completely positive maps equals the set of all maps that satisfy every matrix-test inequality satisfied by K. Matrix tests of the form (k, f, s) produce functionals Φ ↦ f(Φ_k(s)), and a finite-dimensional folding compresses finite linear combinations of these functionals into a single higher-level matrix test without loss of information. The resulting support-function description gives a single-test witness for non-membership in the hull, inclusion and equality criteria for two τ-closed C*-convex hulls, and an exact normalized bipolar reconstruction when the zero map lies in the closed hull.

What carries the argument

Matrix tests (k, f, s) that induce evaluation functionals Φ ↦ f(Φ_k(s)) together with the finite-dimensional folding procedure that merges finite collections of such functionals into one higher-level matrix test.

If this is right

  • A single matrix test witnesses that a map lies outside the τ-closed C*-convex hull of K.
  • Two families have the same τ-closed C*-convex hull precisely when they satisfy the same collection of matrix-test inequalities.
  • When the zero map belongs to the τ-closed C*-convex hull, the hull admits an exact normalized bipolar reconstruction from its supporting matrix tests.
  • Although the topology τ is generated already by level-one tests, the separating inequalities for the hull require tests at all matrix levels.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same matrix-test framework could be used to decide membership questions for other convex hulls in the space of maps between operator systems once an analogous folding step is available.
  • The single-test witness property suggests a practical test for whether a given map can be approximated by C*-convex combinations of maps from a known family.
  • Because higher matrix levels remain essential for separation even though level one suffices for the topology, the geometric structure of C*-convexity is strictly richer than its topological structure.

Load-bearing premise

The finite-dimensional folding procedure compresses finite linear combinations of test functionals into a single higher-level matrix test without losing information for the operator systems and C*-algebras under consideration.

What would settle it

An explicit family K of completely positive maps together with a map outside its τ-closed C*-convex hull that nevertheless satisfies every matrix-test inequality obtained after folding.

read the original abstract

We develop a matrix-test dual framework for $C^*$-convex families of completely positive maps $\CP(\mathscr S,\mathscr T)$, where $\mathscr S$ is an operator system and $\mathscr T$ is a unital $C^*$-algebra. Matrix tests $(k,f,s)$ induce evaluation functionals $\Phi\mapsto f(\Phi_k(s))$ and generate a natural weak topology $\tau=\sigma(\mathcal E,\mathcal F)$ on $\mathcal E=\mathrm{span}_{\mathbb C}(\CP(\mathscr S,\mathscr T))$. Our main result provides a support-function/separation characterization of the $\tau$-closed $C^*$-convex hull $\overline{\cconv(\mathcal K)}^{\,\tau}$ of a family $\mathcal K\subseteq \CP(\mathscr S,\mathscr T)$ in terms of matrix-test inequalities. A key technical tool is a finite-dimensional folding procedure that compresses finite linear combinations of test functionals into a single higher-level matrix test. As consequences, we obtain a single-test witness for non-membership, support-function criteria for inclusion and equality of $\tau$-closed $C^*$-convex hulls, and, under $0\in\overline{\cconv(\mathcal K)}^{\,\tau}$, an exact normalized bipolar-type reconstruction statement. We also show that $\tau$ is already generated by level-$1$ tests, although higher matrix levels remain essential in the geometric test inequalities.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript develops a matrix-test duality framework for C*-convex families of completely positive maps CP(S,T), with S an operator system and T a unital C*-algebra. Matrix tests (k,f,s) induce evaluation functionals Φ ↦ f(Φ_k(s)) that generate a weak topology τ = σ(E,F) on the span of CP maps. The central result is a support-function/separation characterization of the τ-closed C*-convex hull of a family K ⊆ CP(S,T) in terms of matrix-test inequalities. A key tool is a finite-dimensional folding procedure that compresses finite linear combinations of test functionals into a single higher-level matrix test. Consequences include a single-test witness for non-membership, support-function criteria for inclusion/equality of hulls, and (when 0 lies in the closed hull) an exact normalized bipolar-type reconstruction. The paper also shows that τ is generated by level-1 tests, though higher levels remain essential for the geometric inequalities.

Significance. If the main result holds, the framework supplies a concrete support-function description of τ-closed C*-convex hulls in the space of CP maps, extending classical separation ideas to the C*-convex setting. The explicit construction of matrix tests and the observation that the topology τ is already generated by level-1 tests are technically useful contributions. The finite-dimensional folding procedure, if rigorously justified, would be a valuable compression tool for duality arguments in operator systems.

major comments (2)
  1. [Main Theorem and §3 (folding procedure)] Main Theorem (statement and proof of the support-function characterization): The central claim that the τ-closed C*-convex hull admits a single-matrix-test witness rests on the finite-dimensional folding procedure. The manuscript sketches this procedure only by showing that it induces the same evaluation functionals Φ ↦ f(Φ_k(s)); it does not supply an explicit argument that the compression preserves the separating power of the original family of functionals with respect to the weak topology τ = σ(E,F) when S is infinite-dimensional or non-nuclear. Because the bipolar reconstruction and the single-test non-membership witness are derived directly from this step, a detailed verification (or a counter-example check for general operator systems) is required.
  2. [Corollary on bipolar reconstruction] Consequence on normalized bipolar reconstruction (under 0 ∈ closed hull): The exact reconstruction statement assumes that the folded test continues to separate points in the same way as the original linear combination. If the folding map is not shown to be surjective onto the dual functionals that define τ, the equality between the hull and the set defined by the matrix-test inequalities may fail to hold in full generality.
minor comments (2)
  1. [§2 (topology definition)] Notation: The symbol τ is introduced as σ(E,F) but the precise identification of the dual pair (E,F) is not restated when the folding is applied; a short reminder would improve readability.
  2. [Introduction] References: The introduction of matrix tests would benefit from a brief comparison with existing notions of matrix convex sets or CP-convexity in the literature (e.g., works on operator systems by Effros–Ruan or later C*-convexity papers).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for identifying the need for greater detail in the justification of the folding procedure. We address the major comments below and will revise the paper to strengthen these arguments.

read point-by-point responses

  1. Referee: Main Theorem and §3 (folding procedure): The central claim rests on the finite-dimensional folding procedure. The manuscript sketches this only by showing that it induces the same evaluation functionals but does not supply an explicit argument that the compression preserves the separating power of the original family of functionals with respect to the weak topology τ when S is infinite-dimensional or non-nuclear.

    Authors: We agree that the current presentation of the folding procedure is only sketched via the induced functionals and lacks a full verification of separation preservation in τ for general operator systems. In the revised manuscript we will add a detailed lemma establishing that the folding map is continuous with respect to the weak topology and that the image of the compressed functionals is sufficient to separate the same τ-closed C*-convex sets as the original linear combination. The argument proceeds by reducing to the finite-dimensional range of the test, where complete positivity and C*-convexity are preserved without invoking nuclearity of S; we will also include a brief check that no counterexamples arise for non-nuclear operator systems. revision: yes

  2. Referee: Corollary on bipolar reconstruction: The exact reconstruction statement assumes that the folded test continues to separate points in the same way as the original linear combination. If the folding map is not shown to be surjective onto the dual functionals that define τ, the equality between the hull and the set defined by the matrix-test inequalities may fail to hold in full generality.

    Authors: The referee correctly notes that surjectivity of the folding onto the relevant dual functionals is needed for the bipolar equality to hold exactly. We will insert an additional proposition in the revision proving that the folding procedure is surjective onto the subspace of dual functionals generated by the original tests, thereby confirming that the matrix-test inequalities characterize the τ-closed hull precisely. This will be derived from the finite-dimensional nature of the tests and the definition of τ as the weak topology induced by all matrix tests. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation relies on newly introduced matrix tests and standard operator-system properties

full rationale

The paper defines matrix tests (k,f,s) inducing functionals Φ ↦ f(Φ_k(s)) and the weak topology τ = σ(E,F) directly from these. The finite-dimensional folding procedure is introduced as a new technical tool that compresses linear combinations into a single higher-level test, and the support-function characterization of the τ-closed C*-convex hull is derived from separation properties in this topology. No central quantity (such as the hull or the support function) is defined in terms of itself or a fitted parameter; the result is not forced by self-citation chains or ansatz smuggling. The derivation remains self-contained against external benchmarks in operator algebras, with the folding step presented as a constructive compression rather than a reduction to prior inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The paper introduces matrix tests as a new technical tool and relies on standard axioms of C*-algebras and operator systems. No numerical free parameters appear. The folding procedure is a derived technical lemma rather than an axiom.

axioms (1)
  • standard math Standard properties of unital C*-algebras and operator systems (complete positivity, unitality, and the definition of CP(S,T)).
    Invoked throughout the abstract when defining the space of maps and the convex hull.
invented entities (2)
  • Matrix test (k,f,s) no independent evidence
    purpose: Induces evaluation functionals Phi |-> f(Phi_k(s)) that generate the weak topology tau.
    Newly defined test objects that replace abstract dual functionals; no independent evidence outside the paper is given.
  • Finite-dimensional folding procedure no independent evidence
    purpose: Compresses finite linear combinations of test functionals into a single higher-level matrix test.
    Technical device needed for the support-function inequalities to remain finite; presented as a key tool without external verification.

pith-pipeline@v0.9.0 · 5562 in / 1471 out tokens · 23598 ms · 2026-05-17T21:32:37.208086+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    E. M. Alfsen and F. W. Shultz,State Spaces of Operator Algebras: Basic Theory, Orientations, and C ∗–Products, Birkh¨ auser, Boston, 2012

    work page 2012

  2. [2]

    B. V. R. Bhat, R. Devendra, N. Mallick, and K. Sumesh,C ∗–extreme points of entanglement breaking maps, Rev. Math. Phys.35(2023), 2350005

    work page 2023

  3. [3]

    B. V. R. Bhat and M. Kumar,C ∗–extreme maps and nests, J. Funct. Anal.282(2022), no. 8, 109397

    work page 2022

  4. [4]

    Balasubramanian and N

    S. Balasubramanian and N. Hotwani,C ∗–extreme entanglement breaking maps on operator systems, Linear Algebra Appl.685(2024), 182–213

    work page 2024

  5. [5]

    Choi,Completely positive linear maps on complex matrices, Linear Algebra Appl.10(1975), 285–290

    M.-D. Choi,Completely positive linear maps on complex matrices, Linear Algebra Appl.10(1975), 285–290

    work page 1975

  6. [6]

    E. G. Effros and Z.-J. Ruan,Operator Spaces, Oxford University Press, 2000

    work page 2000

  7. [7]

    E. G. Effros and S. Winkler,Matrix convexity: operator analogues of the bipolar and Hahn–Banach theorems, J. Funct. Anal.144(1997), 117–152

    work page 1997

  8. [8]

    Farenick,Extreme points of some compactC ∗–convex sets, Proc

    D. Farenick,Extreme points of some compactC ∗–convex sets, Proc. Amer. Math. Soc.118(1993), 765–775

    work page 1993

  9. [9]

    Farenick and M

    D. Farenick and M. McBurney,Toeplitz separability, entanglement, and operator–system duality, Proc. Amer. Math. Soc. series B10(2023), 114–128

    work page 2023

  10. [10]

    J. W. Helton, I. Klep, and S. McCullough,The tracial Hahn–Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra, J. Eur. Math. Soc. (JEMS)19(2017), 1845–1897

    work page 2017

  11. [11]

    A. S. Holevo,Quantum Systems, Channels, Information: A Mathematical Introduction, De Gruyter, Berlin, 2012

    work page 2012

  12. [12]

    Jamio lkowski,Linear transformations which preserve trace and positive semidefiniteness of opera- tors, Rep

    A. Jamio lkowski,Linear transformations which preserve trace and positive semidefiniteness of opera- tors, Rep. Math. Phys.3(1972), 275–278

    work page 1972

  13. [13]

    A. S. Kavruk, V. I. Paulsen, I. G. Todorov, and M. Tomforde,Tensor products of operator systems, J. Funct. Anal.261(2011), 267–299

    work page 2011

  14. [14]

    Kian,C ∗–convexity of norm unit balls, J

    M. Kian,C ∗–convexity of norm unit balls, J. Math. Anal. Appl.445(2017), 1417–1427

    work page 2017

  15. [15]

    Klep and T

    I. Klep and T. ˇStrekelj,Facial structure of matrix convex sets, J. Funct. Anal.283(2022), 109601

    work page 2022

  16. [16]

    Kriel,An introduction to matrix convex sets and free spectrahedra, Complex Anal

    T.-L. Kriel,An introduction to matrix convex sets and free spectrahedra, Complex Anal. Oper. Theory 13(2019), 3251–3335

    work page 2019

  17. [17]

    Loebl and V

    R. Loebl and V. I. Paulsen,Some remarks onC ∗–convexity, Linear Algebra Appl.35(1981), 63–78

    work page 1981

  18. [18]

    Magajna,C ∗–Convex sets and completely positive maps, Integr

    B. Magajna,C ∗–Convex sets and completely positive maps, Integr. Equ. Oper. Theory85(2016), 37–62. 14 MOHSEN KIAN

    work page 2016

  19. [19]

    P. B. Morenz,The structure ofC ∗–convex sets, Can. J. Math.46(1994), 1007–1026

    work page 1994

  20. [20]

    V. I. Paulsen and M. Tomforde,Vector spaces with an order unit, Indiana Univ. Math. J.58(2009), 1319–1359. 1Department of Mathematics, University of Bojnord, P. O. Box 1339, Bojnord 94531, Iran Email address:kian@ub.ac.ir

    work page 2009