Location

Cupples I Room 113

Start Date

7-19-2016 3:00 PM

End Date

19-7-2016 3:20 PM

Description

This talk will discuss matrix convex sets and their tracial analogs which we call contractively tracial convex sets. In both contexts completely positive (cp) maps play a central role: unital cp maps in the case of matrix convex sets and trace preserving cp (CPTP) maps in the case of contractively tracial convex sets. CPTP maps, also known as quantum channels, are fundamental objects in quantum information theory. Free convexity is intimately connected with Linear Matrix Inequalities (LMIs) $ L(x) = A_0 + A_1 x_1 + \cdots+ A_g x_g \succeq 0 $ and their matrix convex solution sets $\{ X : L(X) \text{ is positive semidefinite}\}$, called free spectrahedra. The Effros-Winkler Hahn-Banach Separation Theorem for matrix convex sets states that matrix convex sets are solution sets of LMIs with operator coefficients. Motivated in part by cp interpolation problems, we will develop the foundations of convex analysis and duality in the tracial setting, including tracial analogs of the Effros-Winkler Theorem. This is joint work with Bill Helton and Scott McCullough.

Share

COinS
 
Jul 19th, 3:00 PM Jul 19th, 3:20 PM

The tracial Hahn-Banach theorem and matrix convex sets

Cupples I Room 113

This talk will discuss matrix convex sets and their tracial analogs which we call contractively tracial convex sets. In both contexts completely positive (cp) maps play a central role: unital cp maps in the case of matrix convex sets and trace preserving cp (CPTP) maps in the case of contractively tracial convex sets. CPTP maps, also known as quantum channels, are fundamental objects in quantum information theory. Free convexity is intimately connected with Linear Matrix Inequalities (LMIs) $ L(x) = A_0 + A_1 x_1 + \cdots+ A_g x_g \succeq 0 $ and their matrix convex solution sets $\{ X : L(X) \text{ is positive semidefinite}\}$, called free spectrahedra. The Effros-Winkler Hahn-Banach Separation Theorem for matrix convex sets states that matrix convex sets are solution sets of LMIs with operator coefficients. Motivated in part by cp interpolation problems, we will develop the foundations of convex analysis and duality in the tracial setting, including tracial analogs of the Effros-Winkler Theorem. This is joint work with Bill Helton and Scott McCullough.