Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces
Theory of Computing Systems · 2026-06 · 70 (2)
DOI: 10.1007/s00224-026-10282-x ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory of Computing Systems, online erschienen am 28.05.2026. Verfasst von Diego A. Rojas. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of Dallas.
Abstract (Originalsprache)
Prokhorov’s Theorem in probability theory states that a family $$\Gamma $$ Γ of probability measures on a Polish space is tight if and only if every sequence in $$\Gamma $$ Γ has a weakly convergent subsequence. Due to the highly non-constructive nature of (relative) sequential compactness, however, the effective content of this theorem has not been studied. To this end, we generalize the effective notions of weak convergence of measures on the real line due to McNicholl and Rojas to computable Polish spaces. Then, we introduce an effective notion of tightness for families of measures on computable Polish spaces. Finally, we prove an effective version of Prokhorov’s Theorem for computable sequences of probability measures.
Förderung
- University of Dallas
Zitieren
APA
Rojas, D. A. (2026). Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces. Theory of Computing Systems, 70(2). https://doi.org/10.1007/s00224-026-10282-x
Vancouver
Rojas DA. Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces. Theory of Computing Systems. 2026;70(2). doi:10.1007/s00224-026-10282-x
BibTeX
@article{Rojas2026,
author = {Rojas, Diego A.},
title = {Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces},
journal = {Theory of Computing Systems},
year = {2026},
volume = {70},
number = {2},
doi = {10.1007/s00224-026-10282-x}
}
EUVIMED