Real Noncommutative Convexity II: Extremality and nc convex functions

This paper extends the theory of real noncommutative convexity by developing concepts of nc extreme points, the Choquet boundary, and nc convex functions, with a primary focus on analyzing their interactions with complexification and introducing novel notions of complexified nc functions and envelopes.

The Gist

The Big Picture: Building a Bridge Between Two Worlds

Imagine you are an architect trying to design a new kind of building. For a long time, mathematicians have been designing these buildings using Complex Numbers (numbers involving $i$, the square root of -1). This is the "Complex World." It's powerful, but it's also very abstract and sometimes hard to visualize.

However, in the real world (physics, engineering, quantum computing), things often happen with Real Numbers only. This is the "Real World."

The authors of this paper, David Blecher and Caleb McClure, are asking: "Can we build the same amazing structures in the Real World that we have in the Complex World?"

Their answer is yes, but with some tricky twists. This paper is the second part of their project. They are exploring how to take the rules of "Non-Commutative Convexity" (a fancy way of describing shapes where the order of operations matters, like rotating a 3D object) and translate them from the Complex World to the Real World.

The Main Tool: "Complexification" (The Magic Translator)

The central character in this story is a tool called Complexification.

Think of a Real Convex Set (a shape made of real numbers) as a flat, 2D drawing on a piece of paper.
Think of Complexification as a machine that takes that 2D drawing and instantly projects it into a 3D hologram.

• The Goal: The authors want to prove that if you know how to solve a problem in the 3D hologram (Complex World), you can translate the solution back to the 2D drawing (Real World).
• The Trick: Sometimes, the 3D hologram is much easier to understand than the 2D drawing. So, they solve the problem in 3D, then use the machine to bring the answer back to 2D.

Key Concepts Explained with Analogies

1. Extreme Points (The "Corners" of the Shape)

In a normal triangle, the "corners" are the most important parts. If you know the corners, you can build the whole triangle. In math, these are called Extreme Points.

• The Complex World: In the 3D hologram, finding the corners is easy.
• The Real World: The authors discovered a surprise. If you take a "corner" from the Real World and project it into the 3D hologram, it might not stay a corner. It might turn into a flat edge or a point on a face.
  • Analogy: Imagine a sharp corner of a real paper triangle. When you project it into a 3D hologram, the light might blur that corner, making it look round.
  • The Lesson: You can't just assume a corner in the Real World stays a corner in the Complex World. The authors had to figure out exactly which corners survive the trip.

2. Maximal Points (The "Tallest Peaks")

While "corners" are about shape, Maximal Points are about height. Imagine a mountain range. The "maximal" points are the peaks that cannot be made higher without changing the whole mountain.

• The Good News: The authors found that Maximal Points behave perfectly. If you take a peak from the Real World and project it to the Complex World, it stays a peak. If you take a peak from the Complex World and look at its Real shadow, it's still a peak.
• Why it matters: This is their "superpower." Because these points behave so well, they can use them to build the most important structure in the field: the C-Envelope*.
  • Analogy: Think of the C*-Envelope as the "ultimate blueprint" for a building. Because the "peaks" (maximal points) are stable, the authors can use them to construct this blueprint for Real buildings just as easily as they did for Complex ones.

3. Convex Functions (The "Slippery Slopes")

A Convex Function is like a bowl or a valley. If you roll a ball in it, it always goes to the bottom. In math, we often want to find the "lowest possible version" of a shape or function. This is called the Convex Envelope.

• The Discovery: The authors proved that the process of "smoothing out" a shape to find its lowest version (the Convex Envelope) works the same way whether you are in the Real World or the Complex World.
• The Analogy: Imagine you have a crumpled piece of paper (a messy function). You want to smooth it out into a perfect bowl. The authors showed that if you smooth the paper in 3D (Complex) and then flatten it back to 2D (Real), you get the exact same result as if you smoothed the 2D paper directly.
• Why it's cool: This saves them a ton of work. They don't have to re-prove difficult theorems for the Real World. They just prove them for the Complex World, and the "Complexification Machine" does the rest of the work for them.

The "Plot Twist" (Why this paper is necessary)

You might ask, "Why not just stick to the Complex World?"

1. Real Life is Real: Quantum physics and many engineering problems are fundamentally based on Real numbers. You can't always just pretend everything is Complex.
2. Different Rules: In the Complex World, every "corner" (extreme point) is a "peak" (maximal point). In the Real World, this isn't always true. A point can be a sharp corner but not a peak. This difference creates "glitches" in the translation machine.
3. The Quaternion Problem: The paper mentions Quaternions (a type of number system used in 3D graphics and physics). These are "Real" but act very differently than standard Real numbers. The authors had to check that their rules still work when Quaternions are involved.

Summary: What Did They Actually Do?

1. Mapped the Territory: They defined what "corners" (extreme points) and "peaks" (maximal points) look like in the Real Noncommutative world.
2. Tested the Translator: They checked if these points survive the trip to the Complex World. They found that "peaks" survive perfectly, but "corners" sometimes get blurry.
3. Built the Bridge: They proved that for the most important structures (like the C*-Envelope and Convex Envelopes), you can safely use the Complex World to solve Real World problems.
4. Fixed the Glitches: They wrote detailed proofs to handle the specific cases where the Real World behaves differently than the Complex World (like with Quaternions or specific types of matrices).

The Takeaway

This paper is a translation guide. It tells mathematicians: "Don't be afraid of the Real World. You can use the powerful tools you built for the Complex World to solve Real problems, as long as you watch out for a few specific traps where the 'corners' behave differently."

It's a foundational step that allows future scientists to apply deep mathematical theories to real-world physics and engineering without getting lost in the complexity of imaginary numbers.

Technical Summary

1. Problem Statement and Context

The paper addresses the development of real noncommutative (nc) convexity, a theory extending classical convexity to the setting of operator systems and nc convex sets (graded sets closed under direct sums and compressions). While a profound complex theory was recently established by Davidson and Kennedy (in their memoir [16]), the authors aim to:

• Establish the real analogues of key concepts: nc extreme points, pure points, maximal points, and the nc Choquet boundary.
• Investigate the theory of real nc convex and semicontinuous functions and their convex envelopes.
• Core Challenge: Determine how these real concepts interact with complexification. Specifically, the authors seek to understand whether results from the complex theory can be transferred to the real setting via complexification, and where the real theory diverges significantly from the complex case due to the distinct nature of irreducible representations of real $C^*$-algebras.

2. Methodology

The authors employ a dual methodology:

1. Direct Real Analysis: They define real nc convex sets, points, and functions directly, verifying that foundational structural results hold in the real setting (often adapting proofs from the complex case or citing existing real operator space theory).
2. Complexification as a Tool: A primary technique is the use of the complexification map ($K \to K^c$ and $f \to f^c$). The authors leverage the fact that many complex results are already proven to derive real results rapidly. They analyze the behavior of the complexification functor on:
   • Maximal elements and ucp maps.
   • Pure and extreme points.
   • Convex functions and their envelopes.
   • The relationship between the real and complex Choquet/Shilov boundaries.

3. Key Contributions and Definitions

A. Real nc Convex Sets and Points

The paper defines real nc convex sets $K$ as subsets of $M_p(E)$ (matrices over a real operator space) closed under direct sums and compressions. It introduces real analogues of:

• Maximal Points: Points where every dilation is trivial.
• Pure Points: Points that cannot be written as a non-trivial nc convex combination.
• nc Extreme Points: Points that are both pure and maximal.
• Choquet Boundary ($\partial K$): The set of nc extreme points.

B. Interaction with Complexification

A central theme is the behavior of these points under complexification ($K \to K^c$):

• Maximal Points: The authors prove that maximality is preserved perfectly under complexification. An element $x \in K$ is real maximal if and only if $x + i0$ is complex maximal in $K^c$. This allows for the immediate construction of the real $C^*$-envelope via maximal dilations.
• Extreme/Pure Points: Unlike maximality, extremality and purity are not preserved in general.
  • A real nc extreme point $x$ need not be complex extreme in $K^c$.
  • A real pure point need not be complex pure.
  • The paper provides counterexamples (e.g., involving the quaternions $\mathbb{H}$ and the algebra $C_r$) showing that the real Choquet boundary and the complex Choquet boundary of the complexification are not simply related.

C. Real nc Convex Functions and Envelopes

The authors develop the theory of real nc convex functions $f: K \to M_n(\mathbb{R})$.

• Complexification of Functions: They define the complexification $f^c$ of a real nc convex function.
• Commutativity of Envelopes: A major result is that the convex envelope construction commutes with complexification. That is, the complexification of the real convex envelope of a function $f$ is equal to the complex convex envelope of the complexification of $f$.
• Transfer of Results: This commutativity allows the authors to quickly derive profound real results (such as the noncommutative Jensen inequality and characterizations of representing maps) from the complex theorems in [16].

4. Main Results

1. Theorem 2.6 & Corollary 2.7 (Maximality): For a real compact nc convex set $K$, an element $x \in K^c$ is maximal if and only if its "real part" (via the map $c$) is maximal in $K$. Consequently, maximal elements behave perfectly under complexification.
2. Theorem 2.8 (Dritschel-McCullough in Real Case): Every element in a real compact nc convex set has a maximal dilation. This is proven by lifting to the complex case and projecting back, providing a new route to constructing the real $C^*$-envelope.
3. Theorem 2.19 (Real nc Krein-Milman): A real compact nc convex set $K$ is the nc convex hull of its nc extreme points ($K = \text{ncconv}(\partial K)$). The proof requires direct real arguments because complexification fails to preserve extremality.
4. Theorem 2.20 (Partial Converse): If a closed nc subset $X$ generates $K$ via nc convex hull, then all real nc extreme points of $K$ lie in $X$.
5. Proposition 4.2 & Theorem 5.7 (Convex Envelopes):
   • A real function is nc convex iff its complexification is nc convex.
   • The convex envelope of a real nc function $f$ is the supremum of continuous affine nc functions below it.
   • The convex envelope commutes with complexification: $(\overline{f})^c = \overline{f^c}$.
6. Theorem 5.11 (Noncommutative Jensen Inequality): For a real compact nc convex set and a selfadjoint lowersemicontinuous convex nc function $f$, $f(x) \leq \mu(f)$ for any ucp map $\mu$ with barycenter $x$.

5. Significance and Impact

• Bridging Real and Complex Theories: The paper successfully establishes that while the "extremal" structure of real nc convexity is more subtle than the complex case (due to the failure of pure/irreducible points to complexify well), the "maximal" structure and the theory of convex functions are robust.
• Tool for Operator Algebras: The results provide a rigorous framework for the real $C^*$-envelope and the real nc Choquet boundary. This is crucial for applications in operator algebras, functional analysis, and quantum physics where real structures (e.g., real Hilbert spaces, real $C^*$-algebras) are fundamental.
• Resolution of Technical Difficulties: By showing that the convex envelope commutes with complexification, the authors bypass the need for difficult direct proofs of complex real-theoretic results, instead deriving them from the established complex theory.
• Clarification of Extremality: The paper highlights a fundamental divergence: in the real setting, the relationship between the Choquet boundary (extreme points) and the Shilov boundary (maximal points) is more complex than in the complex setting. Specifically, the complexification of a real extreme point may lose its extremality, a phenomenon not present for maximal points.

In summary, this paper completes the foundational structural theory of real noncommutative convexity, demonstrating that while the real theory requires careful handling of extremality due to the nature of real irreducible representations, it remains deeply connected to and supported by the complex theory through the mechanism of complexification, particularly for maximal elements and convex functions.