×

Metrization theorem for space-times: from Urysohn’s problem towards physically useful constructive mathematics. (English) Zbl 1287.03109

Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 470-487 (2010).
Summary: In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as “first non-trivial result of point set topology”). Among other applications, this lemma was instrumental in proving that under reasonable conditions, every topological space can be metrized.
A few years before that, in 1919, a complex mathematical theory was experimentally proven to be extremely useful in the description of real world phenomena: namely, during a solar eclipse, General Relativity theory – that uses pseudo-Riemann spaces to describe space-time – was (spectacularly) experimentally confirmed. Motivated by this success, Urysohn started working on an extension of his lemma and of the metrization theorem to (causality-)ordered topological spaces and corresponding pseudo-metrics. After Urysohn’s early death in 1924, this activity was continued in Russia by his student Vadim Efremovich, Efremovich’s student Revolt Pimenov, and by Pimenov’s students (and also by H. Busemann in the US and by E. Kronheimer and R. Penrose in the UK). By the 1970s, reasonably general space-time versions of Urysohn’s lemma and metrization theorem have been proven.
However, these 1970s results are not constructive. Since one of the main objectives of this activity is to come up with useful applications to physics, we definitely need constructive versions of these theorems – versions in which we not only claim the theoretical existence of a pseudo-metric, but we also provide an algorithm enabling the physicist to generate such a metric based on empirical data about the causality relation. An additional difficulty here is that for this algorithm to be useful, we need a physically relevant constructive description of a causality-type ordering relation.
In this paper, we propose such a description and show that, for this description, a combination of the existing constructive ideas with the known (non-constructive) proof leads to successful constructive space-time versions of the Urysohn’s lemma and of the metrization theorem.
For the entire collection see [Zbl 1194.03003].

MSC:

03F65 Other constructive mathematics
54A35 Consistency and independence results in general topology
54F05 Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces
83A05 Special relativity

Software:

PNM
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aberth, O.: Introduction to Precise Numerical Methods. Academic Press, San Diego (2007) · Zbl 1127.65001
[2] Beeson, M.: Foundations of Constructive Mathematics: Metamathematical Studies. Springer, Heidelberg (1985) · Zbl 0565.03028 · doi:10.1007/978-3-642-68952-9
[3] Beeson, M.: Some relations between classical and constructive mathematics. Journal of Symbolic Logic 43, 228–246 (1987) · Zbl 0393.03041 · doi:10.2307/2272821
[4] Bishop, E., Bridges, D.S.: Constructive Analysis. Springer, Heidelberg (1985) · Zbl 0656.03042 · doi:10.1007/978-3-642-61667-9
[5] Bridges, D.S.: The construction of a continuous demand function for uniformly rotund preferences. J. Math. Economics 21, 217–227 (1992) · Zbl 0765.90033 · doi:10.1016/0304-4068(92)90002-O
[6] Bridges, D.S.: The constructive theory of preference orderings on a locally compact space II. Math. Social Sciences 27, 1–9 (1994) · Zbl 0879.90008 · doi:10.1016/0165-4896(94)00718-7
[7] Bridges, D.S.: Constructive methods in mathematical economics. Mathematical Utility Theory, J. Econ. (Zeitschrift für Nationalökonomie) (suppl. 8), 1–21 (1999) · Zbl 0946.91005
[8] Bridges, D.S., Mehta, G.B.: Representations of Preference Orderings. Lecture Notes in Economics and Mathematical Systems, vol. 422. Springer, Heidelberg (1996) · Zbl 0836.90017
[9] Bridges, D.S., Vîta, L.: Techniques of Constructive Mathematics. Springer, New York (2006) · Zbl 1107.03065
[10] Busemann, H.: Timelike Spaces. Warszawa, PWN (1967) · Zbl 0156.43201
[11] Gurevich, Y.: Platonism, constructivism, and computer proofs vs. proofs by hand. Bulletin of EATCS (European Association for Theoretical Computer Science) 57, 145–166 (1995) · Zbl 1026.03503
[12] Kelley, J.L.: General Topology. Springer, New York (1975) · Zbl 0306.54002
[13] Kronheimer, E.H., Penrose, R.: On the structure of causal spaces. Proc. Cambr. Phil. Soc. 63, 481–501 (1967) · Zbl 0148.46502 · doi:10.1017/S030500410004144X
[14] Kreinovich, V.: On the metrization problem for spaces of kinematic type. Soviet Mathematics Doklady 15, 1486–1490 (1974) · Zbl 0304.54031
[15] Kreinovich, V.: Categories of Space-Time Models. Ph.D. dissertation, Soviet Academy of Sciences, Siberian Branch, Institute of Mathematics, Novosibirsk (1979) (in Russian)
[16] Kreinovich, V.: Symmetry characterization of Pimenov’s spacetime: a reformulation of causality axioms. International J. Theoretical Physics 35, 341–346 (1996) · Zbl 0846.53071 · doi:10.1007/BF02083820
[17] Kreinovich, V., Kosheleva, O.: Computational complexity of determining which statements about causality hold in different space-time models. Theoretical Computer Science 405, 50–63 (2008) · Zbl 1158.68015 · doi:10.1016/j.tcs.2008.06.028
[18] Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998) · Zbl 0945.68077 · doi:10.1007/978-1-4757-2793-7
[19] Kushner, B.A.: Lectures on Constructive Mathematical Analysis. American Mathematical Society, Providence (1985) · Zbl 0547.03040
[20] Misner, C.W., Thorne, K.S., Wheeler, J.A.: Gravitation. W.H. Freeman, New York (1973)
[21] Nachbin, L.: Topology and Order. Van Nostrand, Princeton (1965); reprinted by R. E. Kreiger: Huntington (1976) · Zbl 0131.37903
[22] Pimenov, R.I.: Kinematic spaces: Mathematical Theory of Space-Time. Consultants Bureau, N.Y (1970) · Zbl 0203.28303
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.