Polish Spaces and Analytic Sets

2013 ◽  
pp. 239-277
Author(s):  
Donald L. Cohn
Keyword(s):  
Polish Spaces ◽  
Analytic Sets

scholarly journals Absoluteness theorems for arbitrary Polish spaces

2019 ◽  
Vol 53 (2) ◽  
pp. 109-123
Author(s):  
Diego Alejandro Mejía ◽  
Ismael E. Rivera-Madrid
Keyword(s):  
Metric Space ◽  
Metric Spaces ◽  
Classical Theorem ◽  
General Version ◽  
Polish Spaces ◽  
Analytic Sets

By coding Polish metric spaces with metrics on countable sets, we propose an interpretation of Polish metric spaces in models of ZFC and extend Mostowski's classical theorem of absoluteness of analytic sets for any Polish metric space in general. In addition, we prove a general version of Shoenfield's absoluteness theorem.

Polish Spaces and Analytic Sets

1980 ◽  
pp. 251-296
Author(s):  
Donald L. Cohn
Keyword(s):  
Polish Spaces ◽  
Analytic Sets

scholarly journals Some Random Coupled Best Proximity Points for a Generalized ω-Cyclic Contraction in Polish Spaces

2017 ◽  
Vol 59 (1) ◽  
pp. 91-105 ◽  
Author(s):  
C. Kongban ◽  
P. Kumam
Keyword(s):  
Metric Spaces ◽  
Best Proximity Point ◽  
Cyclic Contraction ◽  
Polish Spaces ◽  
Best Proximity Points ◽  
Coupled Best Proximity Point

AbstractIn this paper, we will introduce the concepts of a random coupled best proximity point and then we prove the existence of random coupled best proximity points in separable metric spaces. Our results extend the previous work of Akbar et al.[1].

scholarly journals Graph directed Markov systems on Hilbert spaces

2009 ◽  
Vol 147 (2) ◽  
pp. 455-488 ◽  
Author(s):  
R. D. MAULDIN ◽  
T. SZAREK ◽  
M. URBAŃSKI
Keyword(s):  
Hausdorff Measure ◽  
Iterated Function System ◽  
Sufficient Conditions ◽  
Topological Pressure ◽  
Limit Set ◽  
Covering Theorem ◽  
Limit Sets ◽  
Markov Systems ◽  
Polish Spaces ◽  
Iterated Function

AbstractWe deal with contracting finite and countably infinite iterated function systems acting on Polish spaces, and we introduce conformal Graph Directed Markov Systems on Polish spaces. Sufficient conditions are provided for the closure of limit sets to be compact, connected, or locally connected. Conformal measures, topological pressure, and Bowen's formula (determining the Hausdorff dimension of limit sets in dynamical terms) are introduced and established. We show that, unlike the Euclidean case, the Hausdorff measure of the limit set of a finite iterated function system may vanish. Investigating this issue in greater detail, we introduce the concept of geometrically perfect measures and provide sufficient conditions for geometric perfectness. Geometrical perfectness guarantees the Hausdorff measure of the limit set to be positive. As a by–product of the mainstream of our investigations we prove a 4r–covering theorem for all metric spaces. It enables us to establish appropriate co–Frostman type theorems.

Polish Spaces

1995 ◽  
pp. 13-17
Author(s):  
Alexander S. Kechris
Keyword(s):  
Polish Spaces

scholarly journals K-analytic versus ccm-analytic sets in nonstandard compact complex manifolds

2008 ◽  
Vol 198 (2) ◽  
pp. 139-148
Author(s):  
Rahim Moosa ◽  
Sergei Starchenko
Keyword(s):  
Complex Manifolds ◽  
Analytic Sets ◽  
Compact Complex Manifolds

scholarly journals Duality Theorem for a Minimax Vector Optimization Problem

2021 ◽  
Author(s):  
Jacob Atticus Armstrong Goodall
Keyword(s):  
Vector Optimization ◽  
Duality Theorem ◽  
Optimization Problem ◽  
Optimal Transport ◽  
Probability Distributions ◽  
Vector Optimization Problem ◽  
Complexity Science ◽  
Polish Spaces ◽  
Leibler Divergence ◽  
Mathematical Optimisation

Abstract A duality theorem is stated and proved for a minimax vector optimization problem where the vectors are elements of the set of products of compact Polish spaces. A special case of this theorem is derived to show that two metrics on the space of probability distributions on countable products of Polish spaces are identical. The appendix includes a proof that, under the appropriate conditions, the function studied in the optimisation problem is indeed a metric. The optimisation problem is comparable to multi-commodity optimal transport where there is dependence between commodities. This paper builds on the work of R.S. MacKay who introduced the metrics in the context of complexity science in [4] and [5]. The metrics have the advantage of measuring distance uniformly over the whole network while other metrics on probability distributions fail to do so (e.g total variation, Kullback–Leibler divergence, see [5]). This opens up the potential of mathematical optimisation in the setting of complexity science.

Sign in / Sign up

Export Citation Format

Share Document