Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-23T22:09:07.575Z Has data issue: false hasContentIssue false
  • English
  • Français

The structure of graphs all of whose Y-sections are internal sets

Published online by Cambridge University Press:  12 March 2014

Boško Živaljević
Boško Živaljević*
Affiliation:
Department of Mathematics, University of Wisconsin at Platteville, Platteville, Wisconsin 53818
*
Department of Mathematics, University of Sarajevo, 71000 Sarajevo, Yugoslavia
Get access Rights & Permissions [Opens in a new window]

Extract

The purpose of this paper is to give structural results on graphs lying in the product of two hyperfinite sets X and Y, whose Y-sections are either all internal sets or all of “small” cardinality with respect to the saturation assumption imposed on our nonstandard universe. These results generalize those of [KKML] and [HeRo]. In [KKML] Keisler, Kunen, Miller and Leth proved, among other results, that any countably determined function in the product of two internal sets X and Y can be covered by countably many internal functions provided that the nonstandard universe is at least ℵ-saturated. This shows that any countably determined function can be represented as a union of countably many restrictions of internal functions to countably determined sets. On the other hand, Henson and Ross use in [HeRo] Choquet's capacitability theorem to prove that any Souslin function in the product of two internal sets X and Y is a.e. equal to an internal function. (Here “a.e.” refers to an arbitrary but fixed bounded Loeb measure.) Therefore, in our terminology, every Souslin function possesses an internal a.e. lifting.

After the introductory §0, where all the necessary terminology is introduced, we continue by presenting the structural result for graphs all of whose Y-sections are of cardinality ≤κ (provided that the nonstandard universe is ≤κ+-saturated) in §1. We show that, under the above saturation assumption, a κ-determined graph with all of the Y-sections of cardinality ≤κ is covered by κ-many internal functions. Therefore, any such graph is a union of κ-many κ-determined functions. In particular if the graph in question is Borel, Souslin, κ-Borel or κ-Souslin (or a member of one of the Borel, κ-Borel or projective hierarchies) then the corresponding constituting functions are of the same “complexity”. Thus, any Borel graph all of whose Y-sections are at most countable is a union of countably many Borel functions and, consequently, has Borel domain. In the setting of Polish topological spaces this was proved by Novikov (see [De]).

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 1 , March 1991 , pp. 50 - 66
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[Bo]Bourgain, J., Borel sets with Fσδ sections, Fundamenta Mathematicae, vol. 107 (1980), pp. 149–159.CrossRefGoogle Scholar
[De]Dellacherie, C., Un cours sur les ensembles analytiques, Analytic sets (Rogers, C. A., editor), Academic Press, New York, 1980, pp. 183–316.Google Scholar
[He1]Henson, C. W., Analytic sets, Baire sets, and the standard part map, Canadian Journal of Mathematics, vol. 31 (1979), pp. 663–672.CrossRefGoogle Scholar
[He2]Henson, C. W., Unbounded Loeb measures, Proceedings of the American Mathematical Society, vol. 74 (1979), pp. 143–150.CrossRefGoogle Scholar
[HeRo]Henson, C. W. and Ross, D., Analytic mappings on hyperfinite sets (to appear).Google Scholar
[HuLo]Hurd, A. E. and Loeb, P. A., An introduction to nonstandard real analysis, Academic Press, New York, 1985.Google Scholar
[JaRo]Jayne, J. E. and Rogers, C. A., K-analytic sets, Analytic sets (Rogers, C. A., editor), Academic Press, New York, 1980, pp. 1–181.Google Scholar
[KKML]Keisler, H. J., Kunen, K., Miller, A., and Leth, S., Descriptive set theory over hyperfinite sets, this Journal, vol. 54 (1989), pp. 1167–1180.Google Scholar
[Mo]Moschovakis, Y. N., Descriptive set theory, North-Holland, Amsterdam, 1980.Google Scholar
[Sa]Saint-Raymond, J., Boréliens à coupes Kσ, Bulletin de la Société Mathématique de France, vol. 104 (1976), pp. 389–400.CrossRefGoogle Scholar
[StBa]Stroyan, K. D. and Bayod, J. M., Foundations of infinitesimal stochastic analysis, North-Holland, Amsterdam, 1986.Google Scholar
[StLu]Stroyan, K. D. and Luxemburg, W. A. J., Introduction to the theory of infinitesimals, Academic Press, New York, 1976.Google Scholar
[Ži1]Živaljević, B., Some results about Borel sets in descriptive set theory of hyperfinite sets, this Journal, vol. 55 (1990), pp. 604–615.Google Scholar
[Ži2]Živaljević, B., Every Borel function is monotone Borel (to appear).Google Scholar