$\operatorname{SL}(n)$ invariant valuations on super-coercive convex functions
Fabian Mussnig

TL;DR
This paper classifies all non-negative, continuous, SL(n) and translation invariant valuations on super-coercive convex functions, and also those invariant under the Legendre transform, identifying analogs of classical geometric invariants.
Contribution
It provides a complete classification of such valuations on super-coercive convex functions, including dual invariance under the Legendre transform, extending geometric valuation theory.
Findings
Characterization of valuations analogous to Euler characteristic, volume, and polar volume.
Classification of SL(n) and translation invariant valuations on super-coercive convex functions.
Extension to dual invariance under Legendre transform.
Abstract
All non-negative, continuous, and translation invariant valuations on the space of super-coercive, convex functions on are classified. Furthermore, using the invariance of the function space under the Legendre transform, a classification of non-negative, continuous, and dually translation invariant valuations is obtained. In both cases, different functional analogs of the Euler characteristic, volume and polar volume are characterized.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Invariant Valuations on Super-Coercive Convex Functions
Fabian Mussnig
Abstract
All non-negative, continuous, and translation invariant valuations on the space of super-coercive, convex functions on are classified. Furthermore, using the invariance of the function space under the Legendre transform, a classification of non-negative, continuous, and dually translation invariant valuations is obtained. In both cases, different functional analogs of the Euler characteristic, volume and polar volume are characterized.
2010 AMS subject classification: 26B25 (46A40, 52A20, 52A41, 52B45).
Keywords: valuations, convex functions, super-coercive, Legendre transform, invariance, polar volume.
1 Introduction and Main Results
At the Paris ICM in 1900, David Hilbert asked the following question: Given two polytopes with equal volume, can one of them be cut into finitely many pieces that can be used to yield the other? It was already known that this is possible in the 2-dimensional case but the higher dimensional cases were still open. In the same year, Max Dehn was able to construct two polytopes that have the same volume but cannot be cut and reassembled to yield each other. Thus the answer to Hilbert’s question is no for dimensions greater or equal than 3. In his proof, Dehn used the so-called Dehn invariant and made substantial use of its valuation property. To be more precise, let denote the space of convex bodies, i.e. compact, convex sets, in . A map is called a valuation whenever
[TABLE]
for every such that also . Since Dehn’s proof, valuations have been studied extensively in convex and discrete geometry and a first classification result was established by Blaschke in the 1930s [10]. He proved that linear combinations of the Euler characteristic and the -dimensional volume are the only continuous, and translation invariant valuations on . Here, continuity is understood with respect to the Hausdorff metric.
Important generalizations of Blaschke’s result have been obtained since then [30, 31, 25, 1]. Recently, Haberl and Parapatits generalized Blaschke’s result to valuations defined on , the set of convex bodies in that contain the origin in their interiors. Note, that by restricting to a smaller space, it is possible that more valuations appear in a classification result. In this case, not only the -dimensional volume, , and the Euler characteristic, , were characterized, but also the polar volume . Here is the polar body of .
Theorem 1.1** ([22]).**
For , a map is a continuous and invariant valuation if and only if there exist constants such that
[TABLE]
for every .
Here, a valuation is said to be invariant if for every and .
In recent years, the notion of valuation was extended to functions spaces. Let be a space of (extended) real-valued functions on . We say that a map is a valuation whenever
[TABLE]
for every such that also . Here, and denote the pointwise maximum and minimum of the functions , respectively. In particular, valuations on Sobolev spaces [26, 28, 32], spaces [29, 36, 44, 45], on definable functions [7] and on quasi-concave functions [11, 13, 14, 15, 34] were studied and characterized. See also [2, 16, 17, 46, 42, 43, 47, 27].
For convex functions, an analog of Blaschke’s characterization of continuous, and translation invariant valuations was established in [18]. More recently, this result was improved and a functional analog of Theorem 1.1 was found. Thereby, functional versions of the Euler characteristic and volume together with a new analog of the polar volume were characterized. In order to state this result, let denote the space of all convex, coercive functions . Here, a function is said to be coercive if
[TABLE]
We equip with the topology associated to pointwise convergence (see also Section 2). A map is called translation invariant if for every and translation on . Furthermore, is said to be invariant if for every and .
Theorem 1.2** ([35]).**
For , a map is a continuous, and translation invariant valuation if and only if there exist continuous functions where has finite moment of order and for all with some such that
[TABLE]
for every .
Here, a function has finite moment of order if . Note that for functions the minimum is attained and hence finite. For a convex function on
[TABLE]
denotes the Legendre transform or convex conjugate of , where denotes the inner product of . Moreover, denotes the domain of , which is needed since might attain the value . Lastly, denotes the gradient of . Note, that it follows from Rademacher’s theorem (see for example [20, Theorem 3.1.6]) that the convex function is differentiable a.e. on the interior of its domain.
Remark*.*
Observe, that (1) can be retrieved from (2) if is chosen to be , the norm with unit ball .
We will show that the statement of Theorem 1.2 is still true on the space
[TABLE]
where we say that a function , defined on , is super-coercive if
[TABLE]
It is a priori not clear that no new valuations appear on . Note, that the proof of Theorem 1.2 made extensive use of functions that are coercive but not super-coercive. Furthermore, to the best of the author’s knowledge, there does not seem to be an easy way to generalize the proof to the setting of super-coercive functions.
Moreover, we want to point out that the space is invariant under the polarity transform, that is . Results of Artstein-Avidan and Milman [4] show that the Legendre transform is the only natural, functional analog of the polarity transform on most spaces of convex functions. In contrast to the space , the space is invariant under the Legendre transform, that is,
[TABLE]
In that sense, seems to be a better functional analog of the space . For further details see Section 2.
Theorem 1.3**.**
For , a map is a continuous, and translation invariant valuation if and only if there exist continuous functions where has finite moment of order and for all with some such that
[TABLE]
for every .
By using the invariance of under the Legendre transform we also obtain the following equivalent result. Let be a space of super-coercive, convex functions on . A map is said to be dually translation invariant if for every and every linear functional on . Equivalently, is dually translation invariant if and only if is translation invariant for every such that .
Theorem 1.3***.**
For , a map is a continuous, and dually translation invariant valuation if and only if there exist continuous functions where has finite moment of order and for all with some such that
[TABLE]
for every .
Remark*.*
The volume product is of significant interest in convex geometric analysis. In particular,
[TABLE]
for every origin symmetric , i.e. , where denotes the Euclidean unit ball and is an absolute constant. The right side of (5) is sharp with the maximizers being ellipsoids [37] and is also known as the Blaschke-Santaló inequality [9, 40]. The left side is due to Bourgain and Milman [12] but the optimal constant is still not known. The famous Mahler conjecture states that the volume product is minimized for affine transforms of cubes (among others) and a proof for the two-dimensional case is due to Mahler [33]. More recently, the conjecture was confirmed for the three-dimensional case [23], but the general case remains open.
Functional versions of (5) for log-concave functions were obtained in [3, 5, 6, 24]. In particular, it was shown that
[TABLE]
for suitable convex functions on , where is again an absolute constant. Considering Theorem 1.3 and Theorem 1.3*, the question arises if a similar inequality can be obtained using the quantities
[TABLE]
for suitable functions and convex functions on .
2 Convex Functions
We will work in -dimensional Euclidean space, . Let denote the space of all convex, proper, lower semicontinuous functions , where we call a function on proper if . We will consider the following subsets of :
[TABLE]
where denotes the interior of the set . Furthermore, and will denote the sets of functions in and , respectively, that only take values in , i.e. functions that do not attain the value .
For and we will write
[TABLE]
for the sublevel sets of . Since is convex and lower semicontinuous, the sets are convex and closed. Moreover, since is proper, there exists such . If in addition is coercive, then all sublevel sets of are bounded. In particular for all .
For we will denote by
[TABLE]
the (convex) indicator function of . Observe, that for all and for all .
The space and its subspaces will be equipped with the topology due to epi-convergence. Here, we say that a sequence , is epi-convergent to if the following two conditions hold for all :
- (i)
For every sequence that converges to ,
[TABLE] 2. (ii)
There exists a sequence that converges to such that
[TABLE]
If a sequence is epi-convergent to , we will write and .
For elements in , epi-convergence coincides with local uniform convergence a.e. The only exceptions occur at the boundary of the domain of the limit function.
Theorem 2.1** ([39], Theorem 7.17).**
For any epi-convergent sequence of convex functions the limit function is convex. Moreover, under the assumption the is convex and lower semicontinuous such that has nonempty interior, the following are equivalent:
- (a)
** 2. (b)
* for all , where is a dense subset of .* 3. (c)
* converges uniformly to on every compact set that does not contain a boundary point of .*
Remark 2.2*.*
It is a consequence of Theorem 2.1 that epi-convergence coincides with pointwise convergence on and . See also [19, Example 5.13].
For functions in , epi-convergence also corresponds to Hausdorff convergence of sublevel sets. In the following we say that as if there exists such that for all .
Lemma 2.3** ([18], Lemma 5 and [8], Theorem 3.1).**
Let . If , then as for every with . Furthermore, if for every there exists a sequence such that , then .
Next, we want to recall some results about the convex conjugate or Legendre transform
[TABLE]
for every and .
Lemma 2.4** ([41], Theorem 1.6.13).**
If , then also and .
The following is easy to see and follows directly from the definition of the convex conjugate. See also [35, Section 3]
Lemma 2.5**.**
Let , with . The operator is translation invariant if and only if is dually translation invariant and is invariant if and only if is invariant, where is such that .
The next lemma shows that the Legendre transform is compatible with the valuation property.
Lemma 2.6** ([17], Lemma 3.4, Proposition 3.5).**
Let . If is convex, then so is . Furthermore,
[TABLE]
The following result establishes a connection between coercivity properties of a function and the domain of its conjugate.
Lemma 2.7** ([39], Theorem 11.8).**
For the following hold true:
- •
* is coercive if and only if .*
- •
* is super-coercive if and only if .*
We will also need the following theorem due to Wijsman, which shows that the Legendre transform is a continuous operation (see, for example, [39, Theorem 11.34]).
Theorem 2.8**.**
If , then if and only if .
Let and . We call a vector a subgradient of at if
[TABLE]
for every . The set of all subgradients of at is called the subdifferential of at and denoted by . Note, that might be empty. Furthermore, if is differentiable at , then the only possible subgradient of at is the gradient itself and .
Lemma 2.9** ([38], Theorem 23.5).**
For and the following are equivalent:
- •
,
- •
,
- •
,
- •
x\in\operatorname{argmax}_{z\in\mathbb{R}^{n}}\big{(}y\cdot z-u(z)\big{)}**
- •
y\in\operatorname{argmax}_{z\in\mathbb{R}^{n}}\big{(}x\cdot z-u^{*}(z)\big{)}.
Here, denotes the points in the set at which the function values of are maximized on .
For further results on convex functions as well as convex geometry in general we refer to the books of Gruber [21], Rockafellar & Wets [39] and Schneider [41].
3 Valuations on Convex Functions
In this section we discuss the operators that appear in Theorem 1.3. In the following we say that a valuation , where is a space of (extended) real-valued functions on , is homogeneous of degree if for every and , where for .
The following operator is a functional analog of the Euler characteristic.
Lemma 3.1** ([18], Lemma 12).**
For a continuous function the map
[TABLE]
defines a continuous, and translation invariant valuation on that is homogeneous of degree [math].
By combining the last operator with the Legendre transform we obtain a dually translation invariant valuation.
Lemma 3.2** ([35], Lemma 4.9).**
For a continuous function the map
[TABLE]
defines a continuous, and dually translation invariant valuation on that is homogeneous of degree 0.
Remark 3.3*.*
Note, that u\mapsto\zeta\big{(}-u(0)\big{)} is also well defined on
[TABLE]
and in [35, Lemma 4.9] it is wrongfully claimed that even on this larger space (6) still defines a continuous, and dually translation invariant valuation. To see that this valuation is not continuous anymore let be defined via
[TABLE]
for every with and . Let and let , where for and , where denotes the first vector of the standard basis of . Observe, that for every . By Lemma 2.3 it is easy to see that as , where but . In particular, but .
Lemma 3.4** ([18], Lemma 16).**
For a continuous function with finite moment of order , the map
[TABLE]
defines a non-negative, continuous, and translation invariant valuation on that is homogeneous of degree .
The next lemma shows that the moment condition for the function is necessary, even if one restricts to super-coercive, convex functions.
Lemma 3.5**.**
If is non-negative such that , then there exists such that
[TABLE]
Proof.
Let . By the assumption on there exists numbers , such that and . Let and let
[TABLE]
for every . We now set for every and for every . Note, that by the choice of we have , which shows that is finite. Furthermore, it is easy to see that and
[TABLE]
Hence, is continuous and furthermore for and every . In particular, is unbounded and therefore defines a super-coercive, convex function on . This gives
[TABLE]
where is the volume of the -dimensional unit ball. By the definition of this expression diverges if . Hence, it remains prove this inequality, which we will do by induction on . The statement is obviously true for , since . Furthermore, it is easy to see, that and hence the statement also holds true for . Assume now, that the statement holds for a , that is . By definition of we have
[TABLE]
which is positive by the induction hypothesis. ∎
Lemma 3.6** ([35], Lemma 4.3).**
For a continuous function with finite moment of order , the map
[TABLE]
defines a non-negative, continuous, and dually translation invariant valuation on that is homogeneous of degree .
Lemma 3.7** ([35], Lemma 4.6).**
For a continuous function such that for all with some , the map
[TABLE]
defines a continuous, and translation invariant valuation on that is homogeneous of degree .
Lemma 3.8** ([35], Lemma 4.12).**
For a continuous function such that for all with some , the map
[TABLE]
defines a continuous, and dually translation invariant valuation on that is homogeneous of degree .
4 Super-Coercive Approximations
The main idea of the proof of Theorem 1.3 is to utilize a sequence of real-valued functions that can be used to embed into . We will define and study this sequence in the following.
For let be the sum of the first factorials and let be defined as
[TABLE]
or equivalently
[TABLE]
We will need the following properties of the sequence .
Lemma 4.1**.**
For the sequence , the following properties hold true for every :
- (i)
* for every .* 2. (ii)
* is continuous.* 3. (iii)
* is strictly increasing and strictly convex.* 4. (iv)
* as for every .* 5. (v)
If , then and furthermore, if , then . 6. (vi)
* for every and .* 7. (vii)
For and we have and for , we have . 8. (viii)
* as for every .* 9. (ix)
For every translation on , and , and . 10. (x)
* and for every .* 11. (xi)
If in , then as .
Proof.
- (i)
This follows directly from the definition of since
[TABLE] 2. (ii)
Since , it follows that for every and either or there exists such that . Furthermore, it is easy to check that for
[TABLE]
Hence, is continuous since . 3. (iii)
This is easy to see, since is a continuous, piecewise linear function with positive and increasing slope. 4. (iv)
This property is immediate, since for every there exists such that for every and therefore . 5. (v)
Since is increasing and convex,
[TABLE]
for every and , which shows that is a convex function. Furthermore, since for every , the function is super-coercive. The claim now follows, since . 6. (vi)
This can be easily seen, since for every and is a strictly increasing, convex function. 7. (vii)
This follows directly from the definition of . 8. (viii)
This follows from the last property together with Lemma 2.3. 9. (ix)
This is immediate. 10. (x)
This is a direct consequence of the monotonicity of . 11. (xi)
This follows from (vii) together with Lemma 2.3.
∎
By property (iii) of the last Lemma the function is strictly increasing. Hence, there exists an inverse function . Furthermore, the particular choice of allows us to construct a function as in the next lemma.
Lemma 4.2**.**
For every there exists a sequence of functions , such that the functions and are convex, super-coercive and finite on for every . Furthermore
[TABLE]
The construction of together with the proof of Lemma 4.2 can be found in the Appendix.
5 Classification of Valuations on
The basic idea of the proof of our main result is to embed into by using the sequence that was introduced in the last section and applying Theorem 1.2.
Lemma 5.1**.**
Let and be strictly monotone sequences of real numbers such that for all and . Furthermore, let be the piecewise linear function such that and
[TABLE]
if is such that . If is defined by then
[TABLE]
Proof.
Since is a convex function, it is differentiable a.e. on the interior of its domain and since is super-coercive, it follows from Lemma 2.7 that . Hence, w.l.o.g. let be such that exists. By Lemma 2.9
[TABLE]
and furthermore . If is such that for some , , then this can be only the case if and if , then this can only be the case if and . ∎
Lemma 5.2**.**
For , let be a continuous, and translation invariant valuation. For there exist continuous functions such that has finite moment of order and for every with some such that
[TABLE]
for every . Furthermore, the limits
[TABLE]
exist and are finite for every . Moreover,
[TABLE]
for every and , where is a continuous function such that for every .
Proof.
By Lemma 4.1 the map
[TABLE]
defines a continuous, and translation invariant valuation on for every . Hence, by Theorem 1.2 there exist continuous functions such that has finite moment of order and for every with some such that
[TABLE]
for every .
Next, fix an arbitrary and let . Furthermore, for let for . Note, that by Lemma 4.1 we have as . Hence, by the continuity of , Lemma 3.4 and Lemma 3.7
[TABLE]
In particular, the limit on the right-hand side exists and is finite. Considering linear combinations of the last equation with different values of shows that
[TABLE]
exist and are finite. Moreover, the limit exists and is finite for every . Since and therefore also were arbitrary, there exists a function such that pointwise as . Since is continuous for every the function must be continuous as well.
Next, let and be arbitrary. By Lemma 4.1 we have and therefore
[TABLE]
By homogeneity and the definition of we therefore obtain
[TABLE]
∎
In the following we will call the sequences that appear in Lemma 5.2 the growth function sequences of the valuation .
Lemma 5.3**.**
For , let be a continuous, and translation invariant valuation with growth function sequence , . There exists a continuous function such that
[TABLE]
for every and .
Proof.
Let be arbitrary. Lemma 4.2 shows that for every and by Lemma 5.2 we have
[TABLE]
Since we therefore have by Lemma 3.4
[TABLE]
Since the right-hand side of this equation is independent of and only depends on , this defines a non-negative, continuous function such that or equivalently for every . ∎
For a continuous, and translation invariant valuation , we call the function from Lemma 5.3 the volume growth function of .
Lemma 5.4**.**
For , let be a continuous, and translation invariant valuation. The volume growth function has finite moment of order and furthermore
[TABLE]
for every .
Proof.
Assume that does not have finite moment of order . By Lemma 3.5 there exists such that . For let . Note, that by the properties of we have . Furthermore, by Lemma 4.1 and Lemma 5.3 we have for every and therefore
[TABLE]
which must be finite by Lemma 5.2. Since both integrals on the right-hand side are non-negative for every and is increasing in , the limit
[TABLE]
exists and is finite, which contradicts the choice of . Hence, must have finite moment of order .
By Lemma 3.4 the map
[TABLE]
defines a continuous valuation on and therefore
[TABLE]
since for every . ∎
Lemma 5.5**.**
For , let be a continuous, and translation invariant valuation with growth function sequence , . There exists such that
[TABLE]
*for every and . *
Proof.
We will prove the statement by contradiction and assume that there exists a subsequence and monotone increasing numbers , with such that , which is possible by the properties of . By possibly restricting to another subsequence we can choose the numbers as follows. Let be arbitrary and set . If and are given, let
[TABLE]
where is the volume of the -dimensional unit ball and choose large enough such that
[TABLE]
This implies that and are strictly monotone increasing sequences such that and furthermore
[TABLE]
Next, let be the piecewise affine function such that and for every with , . Note, that it follows from (7) that , which ensures that is well defined and finite. Furthermore, since is strictly increasing with , the function is super-coercive. If is such that for every , then by Lemma 5.1
[TABLE]
for a.e. such that , . Since the maps are non-negative this gives
[TABLE]
for every .
On the other hand, the limit
[TABLE]
exists and is finite by Lemma 5.2, which contradicts (8). Hence, the initial assumption must be false. ∎
Lemma 5.6**.**
For , let be a continuous, and translation invariant valuation with growth function sequence , . There exists a continuous function such that for every with some and
[TABLE]
for every .
Proof.
Let be as in Lemma 5.5 and let be such that . Furthermore, for let for . Note, that . Moreover, by the definition of and we can write with a piecewise linear function such that , for every such that and for a.e. every such that for every . Hence, by Lemma 5.1 we have for every
[TABLE]
for a.e. with and furthermore
[TABLE]
for a.e. with . Therefore, by Lemma 5.2
[TABLE]
for every and every . Since for every and , this shows that the sequence does not change for . Hence, there exists a function such that
[TABLE]
for every and . In particular, is continuous and for every . Furthermore,
[TABLE]
for every ∎
5.1 Proof of Theorem 1.3
By Theorem 1.2, equation (3) defines a continuous, and translation invariant valuation on .
Conversely, let be a continuous, and translation invariant valuation. By Lemma 5.2 there exist continuous functions such that has finite moment of order and for every with some such that
[TABLE]
for every and . By continuity of and Lemma 4.1
[TABLE]
for every . By Lemma 5.2 there exists a continuous function such that
[TABLE]
for every . By Lemma 5.4 there exists a continuous function that has finite moment of order such that
[TABLE]
for every . Furthermore, by Lemma 5.6
[TABLE]
for some continuous function such that for every with some . Hence, must be as in (3). ∎
5.2 Proof of Theorem 1.3*
Lemma 3.2, Lemma 3.6 and Lemma 3.8 show that (4) defines a continuous, and dually translation invariant valuation on .
Conversely, let be a continuous, and dually translation invariant valuation. By Lemma 2.5, Lemma 2.6, Lemma 2.7 and Theorem 2.8 the map defines a continuous, and translation invariant valuation on . Hence, by Theorem 1.3 and Lemma 2.4
[TABLE]
for every , where are continuous functions such that has finite moment of order and for every with some . The statement now follows by setting for . ∎
Appendix
We will give the construction of the function from Lemma 4.2 and discuss its properties.
By definition of the function , we can write its inverse function as
[TABLE]
Next, for let and let
[TABLE]
for . Note, that and therefore . For we define the piecewise linear function as
[TABLE]
Note, that by this definition
[TABLE]
for every , and . Hence, is continuous. Moreover, it follows immediately that is convex, increasing, super-coercive and finite on and in particular . Furthermore, by Lemma 2.3 it is easy to see that .
Next, we will consider the composition . Therefore, fix and . If we have by (10) and (11) that for every . Hence, by (9)
[TABLE]
Furthermore, if we have by (11) that . Therefore, using (9) with gives
[TABLE]
for and . In particular
[TABLE]
which shows that is continuous. Furthermore,
[TABLE]
for . In particular, the slope of is increasing, despite the fact that the slope of is decreasing. Hence, it is easy to see, that is a convex, increasing, super-coercive and finite function on . Moreover, if follows from Lemma 2.3 that .
In the case , there exists such that and therefore, similarly to the case above,
[TABLE]
Again, this is a convex, increasing, super-coercive and finite function on with.
Acknowledgments
The author would like to thank Andrea Colesanti for pointing out the idea of Lemma 3.5.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Alesker, S. Continuous rotation invariant valuations on convex sets. Ann. of Math. (2) 149 (1999), 997–1005.
- 2[2] Alesker, S. Valuations on convex functions and convex sets and Monge-Ampère operators. ar Xiv:1703.08778.
- 3[3] Artstein-Avidan, S., Klartag, B., and Milman, V. D. The Santaló point of a function, and a functional form of the Santaló inequality. Mathematika 51 (2004), 33–48.
- 4[4] Artstein-Avidan, S., and Milman, V. D. The concept of duality in convex analysis, and the characterization of the Legendre transform. Ann. of Math. (2) 169 (2009), 661–674.
- 5[5] Artstein-Avidan, S., and Slomka, B. A. A note on Santaló inequality for the polarity transform and its reverse. Proc. Amer. Math. Soc. 143 (2015), 1693––1704.
- 6[6] Ball, K. M. Isometric problems in ℓ p subscript ℓ 𝑝 \ell_{p} and sections of convex sets . Ph D thesis, Cambridge, 1986.
- 7[7] Baryshnikov, Y., Ghrist, R., and Wright, M. Hadwiger’s Theorem for definable functions. Adv. Math. 245 (2013), 573–586.
- 8[8] Beer, G., Rockafellar, R. T., and Wets, R. J.-B. A characterization of epi-convergence in terms of convergence of level sets. Proc. Amer. Math. Soc. 116 (1992), 753–761.
