Zero-Dimensional $\Sigma $-Homogeneous Spaces

Total Page:16

File Type:pdf, Size:1020Kb

Zero-Dimensional $\Sigma $-Homogeneous Spaces ZERO-DIMENSIONAL σ-HOMOGENEOUS SPACES ANDREA MEDINI AND ZOLTAN´ VIDNYANSZKY´ Dedicated to the memory of Ken Kunen Abstract. All spaces are assumed to be separable and metrizable. Ostrovsky showed that every zero-dimensional Borel space is σ-homogeneous. Inspired by this theorem, we obtain the following results: ‚ Assuming AD, every zero-dimensional space is σ-homogeneous, ‚ Assuming AC, there exists a zero-dimensional space that is not σ-homogeneous, ‚ Assuming V “ L, there exists a coanalytic zero-dimensional space that is not σ-homogeneous. Along the way, we introduce two notions of hereditary rigidity, and give alter- native proofs of results of van Engelen, Miller and Steel. It is an open problem whether every analytic zero-dimensional space is σ-homogeneous. Contents 1. Introduction 1 2. Preliminaries and notation 3 3. The basics of Wadge theory 6 4. Relativization 7 5. The notion of level 8 6. Steel’stheoremandgoodWadgeclasses 9 7. Zero-dimensionalhomogeneousspacesoflowcomplexity 9 8. The positive result 12 9. Hereditarily rigid spaces 14 10. A counterexample in ZFC 15 11. Preliminaries on V “ L 16 12. Definable counterexamples under V “ L 17 13. Final remarks and open questions 19 arXiv:2107.07747v1 [math.GN] 16 Jul 2021 References 21 1. Introduction Throughout this article, unless we specify otherwise, we will be working in the theory ZF ` DC, that is, the usual axioms of Zermelo-Fraenkel (without the Axiom Date: July 14, 2021. 2010 Mathematics Subject Classification. 54H05, 03E15, 03E60. Key words and phrases. Homogeneous, zero-dimensional, determinacy, V “ L, Wadge theory, constructible, rigid. The first-listed author was supported by the FWF grant P 30823. The second-listed author was partially supported by the National Research, Development and Innovation Office – NKFIH grants no. 113047, no. 129211 and FWF grant M 2779. 1 2 ANDREAMEDINIANDZOLTAN´ VIDNYANSZKY´ of Choice) plus the principle of Dependent Choices (see Section 2 for more details). By space we will always mean separable metrizable topological space. A space X is homogeneous if for every x, y P X there exists a homeomorphism h : X ÝÑ X such that hpxq“ y. For example, using translations, it is easy to see that every topological group is homogeneous (as [vE2, Corollary 3.6.6] shows, the converse is not true, not even for zero-dimensional Borel spaces). Homogeneity is a classical notion in topology, which has been studied in depth (see for example the survey [AvM1]). Here, we will focus on a much less studied notion.1 We will say that a space X is σ-homogeneous if there exist homogeneous subspaces Xn of X for n P ω such that X “ nPω Xn. Homogeneous spaces and countable spaces are trivial examples of σ-homogeneousŤ spaces. In [Os], Alexey Ostrovsky sketched a proof that every zero-dimensional Borel space is σ-homogeneous. Inspired by his result, we obtained the following theorem (see Theorem 8.2 for a stronger result), where AD denotes the Axiom of Determinacy. Theorem 1.1. Assume AD. Then every zero-dimensional space is σ-homogeneous. To complete the picture, it seemed natural to look for counterexamples under the Axiom of Choice, and for definable counterexamples under V “ L. This is exactly the content of the following two results (see Corollary 10.2 and Theorem 12.2), even though the analytic case still eludes us (see Question 13.2). Theorem 1.2. There exists a ZFC example of a zero-dimensional space that is not σ-homogeneous. Theorem 1.3. Assume V “ L. Then there exists a coanalytic zero-dimensional space that is not σ-homogeneous. While the proof of Theorem 1.2 is a rather straightforward diagonalization, the proof of Theorem 1.3 uses a method developed by the second-listed author in [Vi]. This method is a “black-box” version of the technique that is mostly known by the applications given by Miller in [Mi], and has spawned many more since then. It seems particularly fitting for this special issue to mention that the very first instance of this idea seems to have appeared in a paper by Erd˝os, Kunen and Mauldin (see [EKM, Theorems 13, 14 and 16]). Regarding Theorem 1.1, our fundamental tool will be Wadge theory, which was founded by William Wadge in his doctoral thesis [Wa1] (see also [Wa2]), and has become a classical topic in descriptive set theory. The application of Wadge the- ory to topology was pioneered by Fons van Engelen, based on the fine analysis of the Borel Wadge classes given by Alain Louveau in [Lo1]. In particular, in his remarkable doctoral thesis [vE2] (see also [vE1]), van Engelen gave a complete clas- sification of the homogeneous zero-dimensional Borel spaces. Other articles in this vein are [vE3] and [Me3], where purely topological characterizations of Borel filters and Borel semifilters on ω are given.2 Notice that, as the analysis in [Lo1] is limited to the Borel context, the same limitation holds for all the results mentioned above. In fact, apart from the present article, the only applications of Wadge theory to topology that go beyond the 1 See however [vM], [AvM2] and [AvM3], where somewhat related questions are investigated. 2 There, by identifying each subset of ω with its characteristic function, filters and semifilters on ω are viewed as subspaces of 2ω. ZERO-DIMENSIONAL σ-HOMOGENEOUSSPACES 3 Borel realm are given in [vEMS] and [CMM1]. In [vEMS], the authors take a very game-oriented approach (using Lipschitz-reduction and the machinery of filling in), while [CMM1] gives a more systematic structural analysis of the Wadge classes generated by zero-dimensional homogeneous spaces, based on ideas from Louveau’s unpublished book [Lo2]. Here, we will proceed in the spirit of the latter article. In fact, our main reference will be [CMM2], where the Wadge-theoretic portion of [Lo2] is generalized, and presented in full detail. Something that all topological applications of Wadge theory have in common (and this article is no exception) is that they ultimately rely on a theorem of Steel from [St1], which is discussed in Section 6. This theorem, loosely speaking, allows one to make the very considerable leap from Wadge equivalence to homeomorphism. We conclude this section by recalling two more topological notions that will appear naturally in the course of our investigations. A space X is rigid if |X|ě 2 and the only homeomorphism h : X ÝÑ X is the identity.3 See [vD, Appendix 2] and [MvMZ1] for an introduction to rigid spaces. A space X is strongly homogeneous (or h-homogeneous) if every non-empty clopen subspace of X is homeomorphic to X. This notion has been studied by sev- eral authors, both “instrumentally” and for its own sake (see the list of references in [Me1]). While it is well-known that every zero-dimensional strongly homogeneous space is homogeneous (see for example [vE2, 1.9.1] or [Me2, Proposition 3.32]), the other implication depends on set-theoretic assumptions (see [CMM1, Theorems 1.1 and 1.2]). 2. Preliminaries and notation Let Z be a set, and let Γ Ď PpZq. Define Γ “ tZzA : A P Γu. We will say that Γ is selfdual if Γ “ Γ. Also define ∆pΓq “ Γ X Γ. Given a function q f : Z ÝÑ W , A Ď Z and B Ď W , we will use the notation frAs“tfpxq : x P Au ´1 q q and f rBs“tx P Z : fpxq P Bu. We will use idX : X ÝÑ X to denote the identity function on a set X. Definition 2.1 (Wadge). Let Z be a space, and let A, B Ď Z. We will write A ď B if there exists a continuous function f : Z ÝÑ Z such that A “ f ´1rBs.4 In this case, we will say that A is Wadge-reducible to B. We will write A ă B if A ď B and B ę A. We will write A ” B if A ď B and B ď A. We will say that A is selfdual if A ” ZzA. Definition 2.2 (Wadge). Let Z be a space. Given A Ď Z, define AÓ“tB Ď Z : B ď Au.5 Given Γ Ď PpZq, we will say that Γ is a Wadge class if there exists A Ď Z such that Γ “ AÓ , and that Γ is continuously closed if AÓĎ Γ for every A P Γ. We will denote by NSDpZq the collection of all non-selfdual Wadge classes in Z. 3 The requirement that |X|ě 2 is not standard, but it will enable us to avoid trivialities, thus simplifying the statement of several results. 4 Wadge-reduction is usually denoted by ďW, which allows to distinguish it from other types of reduction (such as Lipschitz-reduction). Since we will not consider any other type of reduction in this article, we decided to simplify the notation. 5 We point out that AÓ is sometimes denoted by rAs (see for example [CMM1], [vE1], [vE2], [vE3] and [Lo1]). We decided to avoid this notation, as it conflicts with the notation for the Wadge degree of A, that is tB Ď Z : B ” Au. 4 ANDREAMEDINIANDZOLTAN´ VIDNYANSZKY´ Both of the above definitions depend of course on the space Z. Often, for the sake of clarity, we will specify what the ambient space is by saying, for example, that “A ď B in Z” or “Γ is a Wadge class in Z”. Notice that t∅u and tZu are trivial examples of Wadge classes in Z for every space Z. Our reference for descriptive set theory is [Ke]. In particular, we assume famil- iarity with the basic theory of Borel, analytic and coanalytic sets in Polish spaces, and mostly use the same notation as in [Ke].
Recommended publications
  • The Wadge Hierarchy : Beyond Borel Sets
    Unicentre CH-1015 Lausanne http://serval.unil.ch Year : 2016 The Wadge Hierarchy : Beyond Borel Sets FOURNIER Kevin FOURNIER Kevin, 2016, The Wadge Hierarchy : Beyond Borel Sets Originally published at : Thesis, University of Lausanne Posted at the University of Lausanne Open Archive http://serval.unil.ch Document URN : urn:nbn:ch:serval-BIB_B205A3947C037 Droits d’auteur L'Université de Lausanne attire expressément l'attention des utilisateurs sur le fait que tous les documents publiés dans l'Archive SERVAL sont protégés par le droit d'auteur, conformément à la loi fédérale sur le droit d'auteur et les droits voisins (LDA). A ce titre, il est indispensable d'obtenir le consentement préalable de l'auteur et/ou de l’éditeur avant toute utilisation d'une oeuvre ou d'une partie d'une oeuvre ne relevant pas d'une utilisation à des fins personnelles au sens de la LDA (art. 19, al. 1 lettre a). A défaut, tout contrevenant s'expose aux sanctions prévues par cette loi. Nous déclinons toute responsabilité en la matière. Copyright The University of Lausanne expressly draws the attention of users to the fact that all documents published in the SERVAL Archive are protected by copyright in accordance with federal law on copyright and similar rights (LDA). Accordingly it is indispensable to obtain prior consent from the author and/or publisher before any use of a work or part of a work for purposes other than personal use within the meaning of LDA (art. 19, para. 1 letter a). Failure to do so will expose offenders to the sanctions laid down by this law.
    [Show full text]
  • Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank Author(S): J
    Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank Author(s): J. Duparc Source: The Journal of Symbolic Logic, Vol. 66, No. 1 (Mar., 2001), pp. 56-86 Published by: Association for Symbolic Logic Stable URL: http://www.jstor.org/stable/2694911 Accessed: 04/01/2010 12:38 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=asl. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Association for Symbolic Logic is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. http://www.jstor.org THE JOURNAL OF SYMBOLICLOGIC Voluime 66.
    [Show full text]
  • Wadge Hierarchy of Omega Context Free Languages Olivier Finkel
    Wadge Hierarchy of Omega Context Free Languages Olivier Finkel To cite this version: Olivier Finkel. Wadge Hierarchy of Omega Context Free Languages. Theoretical Computer Science, Elsevier, 2001, 269 (1-2), pp.283-315. hal-00102489 HAL Id: hal-00102489 https://hal.archives-ouvertes.fr/hal-00102489 Submitted on 1 Oct 2006 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. WADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Math´ematique CNRS URA 753 et Universit´eParis 7 U.F.R. de Math´ematiques 2 Place Jussieu 75251 Paris cedex 05, France. E Mail: fi[email protected] Abstract The main result of this paper is that the length of the Wadge hierarchy of omega context free languages is greater than the Cantor ordinal ε0, and the same result holds for the conciliating Wadge hierarchy, defined in [Dup99], of infinitary context free languages, studied in [Bea84a]. In the course of our proof, we get results on the Wadge hierarchy of iterated counter ω-languages, which we define as an extension of classical (finitary) iterated counter languages to ω-languages. Keywords: omega context free languages; topological properties; Wadge hier- archy; conciliating Wadge hierarchy; infinitary context free languages; iterated counter ω-languages.
    [Show full text]
  • Descriptive Set Theory and Ω-Powers of Finitary Languages Olivier Finkel, Dominique Lecomte
    Descriptive Set Theory and !-Powers of Finitary Languages Olivier Finkel, Dominique Lecomte To cite this version: Olivier Finkel, Dominique Lecomte. Descriptive Set Theory and !-Powers of Finitary Languages. Adrian Rezus. Contemporary Logic and Computing, 1, College Publications, pp.518-541, 2020, Land- scapes in Logic. hal-02898919 HAL Id: hal-02898919 https://hal.archives-ouvertes.fr/hal-02898919 Submitted on 14 Jul 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Descriptive Set Theory and ω-Powers of Finitary Languages Olivier FINKEL and Dominique LECOMTE1 March 18, 2020 • CNRS, Universit´ede Paris, Sorbonne Universit´e, Institut de Math´ematiques de Jussieu-Paris Rive Gauche, Equipe de Logique Math´ematique Campus des Grands Moulins, bˆatiment Sophie-Germain, case 7012, 75205 Paris cedex 13, France fi[email protected] •1 Sorbonne Universit´e, Universit´ede Paris, CNRS, Institut de Math´ematiques de Jussieu-Paris Rive Gauche, Equipe d’Analyse Fonctionnelle Campus Pierre et Marie Curie, case 247, 4, place Jussieu, 75 252 Paris cedex 5, France [email protected] •1 Universit´ede Picardie, I.U.T. de l’Oise, site de Creil, 13, all´ee de la fa¨ıencerie, 60 107 Creil, France Abstract.
    [Show full text]
  • Wadge Degrees of Ω-Languages of Petri Nets Olivier Finkel
    Wadge Degrees of !-Languages of Petri Nets Olivier Finkel To cite this version: Olivier Finkel. Wadge Degrees of !-Languages of Petri Nets. 2018. hal-01666992v2 HAL Id: hal-01666992 https://hal.archives-ouvertes.fr/hal-01666992v2 Preprint submitted on 26 Mar 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Wadge Degrees of ω-Languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. [email protected] Abstract We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Tur- ing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective analytic CK 0 sets. In particular, for each non-null recursive ordinal α < ω1 there exist some Σα-complete and some 0 Πα-complete ω-languages of Petri nets, and the supremum of the set of Borel ranks of ω-languages of 1 CK Petri nets is the ordinal γ2 , which is strictly greater than the first non-recursive ordinal ω1 .
    [Show full text]
  • Effective Wadge Hierarchy in Computable Quasi-Polish Spaces
    Effective Wadge hierarchy in computable quasi-Polish spaces Victor Selivanov1 A.P. Ershov IIS SB RAS (Novosibirsk) Mathematical Logic and its Applications Workshop March 22, 2021 Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Contents 1. Introduction. 2. Effective spaces. 3. Iterated labeled trees. 4. Defining the (effective) WH. 5. The preservation property. 6. Hausdorff-Kuratowski-type results. 7. The non-collapse property. 8. Conclusion. Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Introduction The classical Borel, Luzin, and Hausdorff hierarchies in Polish spaces, which are defined using set operations, play an important role in descriptive set theory (DST). In 2013 these hierarchies were extended and shown to have similar nice properties also in quasi-Polish spaces which include many non-Hausdorff spaces of interest for several branches of mathematics and theoretical computer science (M. de Brecht). The Wadge hierarchy is non-classical in the sense that it is based on a notion of reducibility that was not recognized in the classical DST, and on using ingenious versions of Gale-Stewart games rather than on set operations. For subsets A; B of the Baire space ! −1 N = ! , A is Wadge reducible to B (A ≤W B), if A = f (B) for some continuous function f on N . The quotient-poset of the preorder (P(N ); ≤W ) under the induced equivalence relation ≡W on the power-set of N is called the structure of Wadge degrees in N . Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Introduction W. Wadge characterised the structure of Wadge degrees of Borel sets (i.e., the quotient-poset of (B(N ); ≤W )) up to isomorphism.
    [Show full text]
  • Towards a Descriptive Theory of Cb 0-Spaces
    Towards a Descriptive Theory of cb0-Spaces Victor Selivanov A.P. Ershov Institute of Informatics Systems SB RAS Novosibirsk, Russia October 28, 2018 Abstract The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T0-spaces (cb0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we consider also the more general case of k-partitions. In particular, we investigate the difference hierarchy of k-partitions and the fine hierarchy closely related to the Wadge hierarchy. Key words. Borel hierarchy, Luzin hierarchy, Hausdorff hierarchy, Wadge reducibility, cb0-space, k-partition, h-preorder, well preorder. 1 Introduction Classical Descriptive Set Theory [Ke95] is an important field of mathematics with numerous applications. It investigates descriptive complexity of sets, functions and equivalence relations in Polish (i.e., separable complete metrizable) spaces. Although Polish spaces are sufficient for many fields of classical mathematics, they are certainly not sufficient for many fields of Theoretical Computer Science where non-Hausdorff spaces (in particular, ω-continuous domains) and non-countably-based spaces (in particular, Kleene-Kreisel continuous func- tionals) are of central importance. For this reason, the task of extending classical Descriptive Set Theory (DST) to as many non-Polish spaces as possible attracted attention of several researchers. Some parts of DST for ω-continuous domains (which are typically non-Polish) were developed in [Se04, Se05a, Se06, Se08]. In [Br13] a good deal of DST was developed for the so called quasi-Polish spaces (see the next section for a definition of this class of cb0-spaces) which include both the Polish spaces and the ω-continuous domains.
    [Show full text]
  • Wadge Hierarchy on Second Countable Spaces Reduction Via Relatively Continuous Relations
    Wadge Hierarchy on Second Countable Spaces Reduction via relatively continuous relations Yann Honza Pequignot Université de Lausanne Université Paris Diderot Winter School In Abstract analysis Set Theory & Topology Hejnice, 15th January – 1st February, 2014 Classify Definable subsets of topological spaces nd X a 2 countable T0 topological space: A countable basis of open sets, Two points which have same neighbourhoods are equal. Borel sets are naturally classified according to their definition 0 Σ1(X) = {O ⊆ X | X is open}, 0 [ Σ (X) = Bi Bi is a Boolean combination of open sets , 2 i∈ω 0 { 0 Πα(X) = A A ∈ Σα(X) , 0 \ [ 0 Σ (X) = Pi Pi ∈ Π (X) , for α > 2. α β i∈ω β<α [ 0 [ 0 Borel subsets of X = Σα(X) = Πα(X) α<ω1 α<ω1 Wadge reducibility Let X be a topological space, A, B ⊆ X. A is Wadge reducible to B, or A ≤W B, if there is a continuous function f : X → X that reduces A to B, i.e. such that f −1(B) = A or equivalently ∀x ∈ X x ∈ A ←→ f (x) ∈ B. Bill Wadge The idea is that the continuous function f reduces the membership question for A to the membership question for B. The identity on X is continous, and continuous functions compose, so Wadge reducibility is a quasi order on subsets of X. Is it useful? On non 0-dim metric spaces, and many other non metrisable spaces the relation ≤W yields no hierarchy at all, by results of Schlicht, Hertling, Ikegami, Tanaka, Grigorieff, Selivanov and others.
    [Show full text]
  • Wadge Degrees of $\Omega $-Languages of Petri Nets
    Wadge Degrees of ω-Languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. [email protected] Abstract We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Tur- ing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective analytic CK 0 sets. In particular, for each non-null recursive ordinal α < ω1 there exist some Σα-complete and some 0 Πα-complete ω-languages of Petri nets, and the supremum of the set of Borel ranks of ω-languages of 1 CK Petri nets is the ordinal γ2 , which is strictly greater than the first non-recursive ordinal ω1 . We also 1 prove that there are some Σ1-complete, hence non-Borel, ω-languages of Petri nets, and that it is consist- 1 ent with ZFC that there exist some ω-languages of Petri nets which are neither Borel nor Σ1-complete. This answers the question of the topological complexity of ω-languages of (non-deterministic) Petri nets which was left open in [9, 19]. Keywords and phrases Automata and formal languages; logic in computer science; Petri nets; infinite words; Cantor topology; Borel hierarchy; Wadge hierarchy; Wadge degrees. Digital Object Identifier 10.4230/LIPIcs... 1 Introduction In the sixties, Büchi was the first to study acceptance of infinite words by finite automata with the now called Büchi acceptance condition, in order to prove the decidability of the monadic second order theory of one successor over the integers.
    [Show full text]
  • Study on Sets
    International Journal of Research (IJR) Vol-1, Issue-10 November 2014 ISSN 2348-6848 Study on Sets Sujeet Kumar & Ashish Kumar Gupta Department of Information and technology Dronacharya College of Engineering,Gurgaon-122001, India Email:[email protected], Email:[email protected] Set difference of U and A, denoted U \ A, Abstract- is the set of all members of Uthat are not members of A. The set difference {1,2,3} \ Set theory is the branch of mathematical logic that studies sets, which {2,3,4} is {1} , while, conversely, the set are collections of objects. Although any type of object can be collected difference {2,3,4} \ {1,2,3} is {4} . into a set, set theory is applied most often to objects that are relevant to mathematics.In this research paper we studied about Basic concepts and When A is a subset of U, the set notation, some ontology and applications. We have also study about difference U \ A is also called combinational set theory, forcing, cardinal invariants, fuzzy set theory. the complement of A inU. In this case, if We have described all the basic concepts of Set Theory. the choice of U is clear from the context, the notation Acis sometimes used instead Keywords- of U \ A, particularly if U is a universal set as in the study of Venn diagrams. Combinational ;fuzzy ; forcing; cardinals; ontology 1. INTRODUCTION Symmetric difference of sets A and B, denoted A △ B or A ⊖ B, is the set of all Set theory is the branch of mathematical logic that studies objects that are a member of exactly one sets, which are collections of objects.
    [Show full text]
  • Borel Subsets of the Real Line and Continuous Reducibility
    BOREL SUBSETS OF THE REAL LINE AND CONTINUOUS REDUCIBILITY DAISUKE IKEGAMI, PHILIPP SCHLICHT, AND HISAO TANAKA Abstract. We study classes of Borel subsets of the real line R such as levels of the Borel hierarchy and the class of sets that are reducible to the set Q of rationals, endowed with the Wadge quasi-order of reducibility with respect to continuous functions on R. Notably, we explore several structural properties of Borel subsets of R that diverge from those of Polish spaces with dimension zero. Our first main result is on the existence of embeddings of several posets into the restriction of this quasi-order to any Borel class that is strictly above the classes of open and ‹ closed sets, for instance the linear order !1, its reverse !1 and the poset Pp!q{fin of inclusion modulo finite error. As a consequence of its proof, it is shown that there are no complete sets for these classes. We further extend the previous theorem to targets that are reducible to Q. These non-structure results motivate the study of further restrictions of the Wadge quasi-order. In our second main theorem, we introduce a combinatorial property that is shown to characterize those Fσ sets that are reducible to Q. This is applied to construct a minimal set below Q and prove its uniqueness up to Wadge equivalence. We finally prove several results concerning gaps and cardinal characteristics of the Wadge quasi-order and thereby answer questions of Brendle and Geschke. Contents 1. Introduction 1 2. Notation 3 3. Embedding posets into the Wadge quasi-order4 4.
    [Show full text]
  • Operations on a Wadge-Type Hierarchy of Ordinal-Valued Functions
    Operations on a Wadge-Type Hierarchy of Ordinal-Valued Functions MSc Thesis (Afstudeerscriptie) written by Alexander C. Block (born November 10th, 1989 in Bad Segeberg, Germany) under the supervision of Prof Dr Benedikt Lowe¨ , and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: January 28th, 2014 Dr Jakub Szymanik (chair) Dr Benno van den Berg Dr Nick Bezhanishvili Dr Yurii Khomskii Prof Dr Benedikt Lowe¨ Prof Dr Jouko Va¨an¨ anen¨ Contents 1 Introduction and Acknowledgments 1 1.1 Outline of the Thesis . .1 1.2 Original Contribution . .3 1.3 Acknowledgments . .4 2 Prerequisites 5 2.1 Basic Notation and Results . .5 2.1.1 Axiomatic Framework and Set Theory . .5 2.1.2 Sequences . .7 2.1.3 Order Theory . .8 2.1.4 Trees and Topology . .9 2.2 Games and Determinacy . 11 2.3 Descriptive Set Theory . 14 2.3.1 The Original Wadge Hierarchy and the Ordinal Θ ................. 15 2.3.2 Regular Norms . 16 3 Induced Hierarchies of Norms 19 3.1 Original Wadge Hierarchy and Hierarchy of Strictly Regular Norms Revisited . 19 3.2 Games and Wadge’s Lemma . 22 3.3 Better Quasi-Orders and Well-Foundedness . 24 3.4 Self-Duality and the Steel-Van Wesep Theorem . 28 3.5 An Alternative Characterization of Self-Duality . 32 4 The Hierarchy of Regular Norms 35 4.1 The Ordinal Σ ........................................ 35 4.1.1 A Lower Bound .
    [Show full text]