The complexity of subdifferentiation and its inverse on convex functions in Banach spaces

Annals of Pure and Applied Logic 118 (3):197-217 (2002)
  Copy   BIBTEX

Abstract

Let E be a separable Banach space with separable dual. We show that the operation of subdifferentiation and the inverse operation are Borel from the convex functions on E into the monotone operators on E for the Effros–Borel structures.We also prove that the set of derivatives of differentiable convex functions is coanalytic non-Borel, by using the already known fact that the set of differentiable convex functions is itself coanalytic non-Borel, as proved in Bossard et al. 142).At last, we give a new proof of this latter fact, for reflexive E's, by giving a coanalytic rank on those sets and constructing functions of “high ranks”. This approach, based on an ordinal rank which follows from a construction of trees, is quite different — not so general but actually more constructive — from the previous results of this kind, in Bossard et al. 142) and Godefroy et al. , based on reductions of arbitrary coanalytic or difference of analytic sets to the studied sets

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-01-16

Downloads
11 (#1,145,893)

6 months
5 (#836,975)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references