Paperlane

no. 1 · Friday 23 October 2026

Computable presentations of separable Lebesgue spaces

Ruofei Xie and Xuanheng Zhao

math.LO

Abstract

For every right-c.e.\ real $p\in(1,2)$, $L^p[0,1]$ has a computable presentation. The proof combines an effective stability modulus for almost isometric embeddings with a Fraïssé-style construction in which the exponent varies. In the same range, if $\ell^p$ has a computable presentation, then $p$ is computable. Combining these with the known results gives the computable presentability classification for all separable Lebesgue spaces. We also formulate an effective Fraïssé theorem for Banach spaces and apply it to obtain a computable presentation of the Gurarij Banach space.

fields
Logic, Functional Analysis
pdf ↗ page arXiv:2610.30565 ↗