Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 30 min ago
PreprintCC BY 4.0arXiv

Computable presentations of separable Lebesgue spaces

Abstract

For every right-c.e.\ real p∈(1,2), Lp[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 ℓ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.

Related

  1. Computable presentations of reduced group C*-algebras of hyperbolic groups
    Isaac Goldbring
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  2. Computable presentations of reduced group C*-algebras of groups with the rapid decay property
    Isaac Goldbring
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  3. Non-aware computable presentations of randomizations
    Xuanheng Zhao
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  4. Characterization of the boundedness of the segment multiplier on weighted Lebesgue spaces
    Miguel F. Barea-Fernández, Jan Lang, Javier Soria
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Some weighted modular inequalities in variable Lebesgue spaces
    Megha Madan, Arun Pal Singh
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{xie2026computable,
  title = {{Computable presentations of separable Lebesgue spaces}},
  author = {Ruofei Xie and Xuanheng Zhao},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30565},
  eprint = {2610.30565},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30565},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Computable presentations of separable Lebesgue spaces
AU  - Ruofei Xie
AU  - Xuanheng Zhao
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.30565
UR  - https://arxiv.org/abs/2610.30565
AB  - For every right-c.e.\ real p∈(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 ℓ^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.
ER  -