Matthew S. Scott

Duality of faces in polar sets

31 August 2024

Also published on the UBC Optimization Group blog.

In this blog post we introduce a notion of duality between faces of polar convex sets. Our purpose is to show through the simplicity of this introduction that this notion of duality between faces of convex sets is a natural one. To achieve this we employ a narrative tone and focus on intuitions. We begin by defining an abstract notion of duality between sets which is a generalization of polar sets. Then we show how the notion of dual faces of convex sets is just another instance of this notion of dual sets. Along the way we will also discuss weak and strong duality in this setting.

Consider two sets A,B\mathcal{A}, \mathcal{B}, and define a relation ∼\sim such that any two elements a∈A,b∈Ba \in \mathcal{A}, b \in \mathcal{B} may relate to each other (a∼ba \sim b), or may not (a≁ba \not \sim b). Let A⊆AA \subseteq \mathcal{A} and B⊆BB \subseteq \mathcal{B}. We say that A∼BA \sim B when any pair (a,b)∈A×B(a,b) \in A \times B satisfies a∼ba \sim b. Such a relation between sets can be framed in different ways. We can say that every element a∈Aa \in A induces a constraint in the space B\mathcal{B} that is satisfied by all the elements of BB. Conversely, each element in BB corresponds to a constraing in A\mathcal{A}. If we think of AA as a set of constraints in B\mathcal{B}, the dual ApA^p of AA is the solution set of AA in B\mathcal{B}. Another equivalent definition is that the dual set ApA^p is the largest set B⊆BB \subseteq \mathcal{B} that satisfies A∼BA \sim B.

We discuss the concept of strong duality, which is the statement that App=AA^{p p}=A. Starting from a set A⊆AA \subseteq \mathcal{A}, let us think of B\mathcal{B} as a set of constraints in A\mathcal{A}. Let B⊆BB \subseteq \mathcal{B} be all the constraints bb that AA uniformly satisfies (A∼bA \sim b). Then B=ApB = A^p. Indeed, from the way we defined BB, the set BB is the largest subset of B\mathcal{B} such that A∼BA \sim B. We view BB as a mold around AA. Indeed, we did our best to contour AA with all the valid constraints that we could find in B\mathcal{B}. B=ApB = A^p is then the tightest mold around AA that we could make from the constraints in B\mathcal{B}.

We argue that strong duality between sets (that App=AA^{p p} = A) occurs when the mold is tight, meaning that ∀a∉A\forall a \not \in A, a≁Ba \not \sim B. Indeed, the statement that App=AA^{p p} = A can be understood as follows. We start with some model set A⊆AA \subseteq \mathcal{A}, and find that the mold B=A∘B= A^{\circ} corresponds to the tightest possible mold we could make around our model AA by using exclusively mold-building-blocks bb found in B\mathcal{B}. Then as is the purpose of any mold, we forget about the model AA that we used to create the mold, and only keep the mold described by BB in order to produce copies of AA. When the mold BB is tight around the model AA, we may pour some liquid iron into the mold to get a statue with the original shape of AA. The action of "pouring into the mold" is to take all elements in A\mathcal{A} that satisfy all constraints in BB, i.e. the largest set A′⊆AA' \subseteq \mathcal{A} such that A′∼BA' \sim B, which is A′=BpA' = B^p and is therefore AppA^{p p}. From this analogy the idea of weak duality, that A⊆AppA \subseteq A^{p p}, becomes evident. By taking an object, making a mold around that object, removing the object from the mold and then filling that mold completely, the resulting statue will be strictly larger than the original. Moreover, if the mold described by BB captures the model AA perfectly, then the result of the pour is as good as the original, and App=AA^{p p}= A, which is the case where strong duality occurs. If, on the other hand, for some reason the set B\mathcal{B} did not have the sufficient expressive power to make a tight mold around AA, then the best possible mold BB will leave some space around AA, and this additional space will be filled by the subsequent pour. In this case, the pour will be strictly larger than the model, so App⊃AA^{p p} \supset A, and only weak duality holds.

We focus on the concept of polar sets, which is a particular case of dual sets. Let A=B=E\mathcal{A} = \mathcal{B} = \mathbb{E}, where E\mathbb{E} is a euclidian space. Furthermore, define the relation a∼≤ba \overset{ \le }{\sim} b to be satisfied iff a⋅b≤1a \cdot b \le 1. Then the polar set of some set A⊆AA \subseteq \mathcal{A} is the dual set of AA (that is, ApA^p under the relation ∼≤\overset{ \le }{\sim}). If we restrict AA to be a closed convex set containing the origin, it can then be characterized as an intersection of a collection of half-spaces corresponding to its supporting hyperplanes (this is a fundamental result in convex analysis.) Notice that this family of constraints (those half-spaces corresponding to supporting hyperplanes of AA) are a subset of the constraints corresponding to our underlying set of available constraints B\mathcal{B} (which in this case are the constraints with solution sets {a∈A∣a⋅b≤1}\{a \in \mathcal{A} | a \cdot b \le 1\}, where each b∈Bb \in \mathcal{B} yields a constraint). We name the sets A\mathcal{A}, B\mathcal{B} to illustrate the purpose of the sets, although we are still in a regime where A=B=E\mathcal{A} = \mathcal{B} = \mathbb{E}. So in this case our set of mold-forming atoms B\mathcal{B} is sufficiently expressive to form a tight mold around AA. This means that we have strong duality.

Now if we instead take a more restrictive relation; that a∼=ba \overset{=}{\sim} b when a⋅b=1a \cdot b=1, we obtain a more restricted kind of dual set: duality of affine subspaces. Under this equivalence relation, we call the dual set ApA^p the dual face of AA. To avoid confusion, we denote AfA^f to mean the dual set under the equality relation ∼=\overset{ = }{\sim}, and reserve the notation A∘A^\circ for polar sets, the dual set under the relation ∼≤\overset{ \le }{\sim}. If we require that A⊆EA \subseteq \mathbb{E} be an affine subspace, then under this new relation ∼=\overset{ = }{\sim} strong duality holds. Indeed, the set of constraints embodied by B\mathcal{B} is that of all affine hyperplanes. We can form a tight mold around any subspace AA with the intersection of finitely many affine hyperplanes, and therefore strong duality holds in this case as well.

We introduce an interesting instance of duality between sets: for a closed convex set AA containing the origin in its interior, and its polar set B=A∘B= A^\circ, define the underlying set A\mathcal{A} in our "duality of sets" framework to be none other than AA, and similarly let B\mathcal{B} be BB. Within these underlying sets, take the equality relation ∼=\overset{ = }{\sim} and consider the duality of sets that arises from it. That is, for a set Aˉ⊆A\bar{A} \subseteq A, what is its dual set Aˉf\bar{A}^f?

To answer this question, we first need an additional concept. Define an (exposed) face of a closed convex set AA to be of the form Aˉ=argsupa∈A{a⋅d}\bar{A} = \mathrm{arg sup}_{a \in A} \{a \cdot d\} for some vector d∈Ed\in \mathbb{E}. Also define a gauge function of a set S⊆ES \subseteq \mathbb{E} to be γS(x)=inf⁡{λ∈R+∣x∈λS}\gamma_S(x) = \inf\{\lambda \in \mathbb{R}_+ \mid x \in \lambda S\}. We say that Aˉ\bar{A} is exposed by dd. We argue that with the underlying sets A,BA, B and with the relation ∼=\overset{ = }{\sim}, we have strong duality on the exposed faces of AA. Indeed, the mold formed by Aˉf\bar{A}^f includes the constraint specified by the vector d~∈E\tilde{d} \in \mathbb{E} which we define to be dd re-scaled by a positive scalar so as to lie on the boundary of BB (specifically, d~:=dγB(d)\tilde{d} := \frac{d}{\gamma_B(d)} for the gauge function γB\gamma_B.) That d~⊆Aˉf\tilde{d} \subseteq \bar{A}^f follows from the fact that ∀a∈Aˉ, d~⋅a=dsup⁡a′∈Aˉa′⋅d⋅a=1,\forall a \in \bar{A},\, \tilde{d} \cdot a = \frac{d}{\sup_{a' \in \bar{A}} a' \cdot d} \cdot a = 1, which means that d~∼Aˉ\tilde{d} \sim \bar{A}, and therefore that d~∈Af\tilde{d} \in A^f. Moreover, the restriction induced by d~\tilde{d} in A\mathcal{A} is by itself sufficient to form a tight mold around Aˉ\bar{A} because the fact that Aˉ\bar{A} is the largest set satisfying the restriction imposed by d~\tilde{d} is in fact the definition of Aˉ\bar{A}, since it is a face exposed by d~\tilde{d}. Therefore, it follows that strong duality holds for any exposed face Aˉ\bar{A}.

The fact that strong duality holds in this setting means that there is indeed a well-defined dual face Aˉf\bar{A}^f in A∘A^\circfor any given face Aˉ\bar{A} of AA. Since this is just another instance of a duality of sets under the simple relation ∼=\overset{ = }{\sim}, I hope that you are now convinced that this notion is indeed a natural one.