Operator capacity, the Brascamp--Lieb inequality and geometric programming

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bez, Neal, Gauvan, Anthony, Tsuji, Hiroshi
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915932673146880
author Bez, Neal
Gauvan, Anthony
Tsuji, Hiroshi
author_facet Bez, Neal
Gauvan, Anthony
Tsuji, Hiroshi
contents The capacity of completely positive operators and the Brascamp--Lieb constant can both be interpreted in terms of unconstrained geometric programming up to an additional minimisation over a compact group. We shine light on this perspective and make use of it to make novel contributions in both directions. For example, by making use of recent work of Bennett--Bez--Buschenhenke--Cowling--Flock, we prove new results regarding near-minimisers and local Hölder regularity of operator capacity. In addition, we observe that these results may be extended to the more general notion of capacity of quiver data. Furthermore, the geometric programming viewpoint allows us to give a new proof of the finiteness characterisation of the Brascamp--Lieb constant due to Bennett--Carbery--Christ--Tao (assuming Lieb's theorem on gaussian saturation).
format Preprint
id arxiv_https___arxiv_org_abs_2508_02118
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Operator capacity, the Brascamp--Lieb inequality and geometric programming
Bez, Neal
Gauvan, Anthony
Tsuji, Hiroshi
Functional Analysis
Classical Analysis and ODEs
Optimization and Control
The capacity of completely positive operators and the Brascamp--Lieb constant can both be interpreted in terms of unconstrained geometric programming up to an additional minimisation over a compact group. We shine light on this perspective and make use of it to make novel contributions in both directions. For example, by making use of recent work of Bennett--Bez--Buschenhenke--Cowling--Flock, we prove new results regarding near-minimisers and local Hölder regularity of operator capacity. In addition, we observe that these results may be extended to the more general notion of capacity of quiver data. Furthermore, the geometric programming viewpoint allows us to give a new proof of the finiteness characterisation of the Brascamp--Lieb constant due to Bennett--Carbery--Christ--Tao (assuming Lieb's theorem on gaussian saturation).
title Operator capacity, the Brascamp--Lieb inequality and geometric programming
topic Functional Analysis
Classical Analysis and ODEs
Optimization and Control
url https://arxiv.org/abs/2508.02118