Displaying 81 – 100 of 370

Showing per page

Cofinal types of topological directed orders

SŁawomir Solecki, Stevo Todorcevic (2004)

Annales de l’institut Fourier

We investigate the structure of the Tukey ordering among directed orders arising naturally in topology and measure theory.

Combinatorics of ideals --- selectivity versus density

A. Kwela, P. Zakrzewski (2017)

Commentationes Mathematicae Universitatis Carolinae

This note is devoted to combinatorial properties of ideals on the set of natural numbers. By a result of Mathias, two such properties, selectivity and density, in the case of definable ideals, exclude each other. The purpose of this note is to measure the ``distance'' between them with the help of ultrafilter topologies of Louveau.

Compact covering mappings and cofinal families of compact subsets of a Borel set

G. Debs, J. Saint Raymond (2001)

Fundamenta Mathematicae

Among other results we prove that the topological statement “Any compact covering mapping between two Π⁰₃ spaces is inductively perfect” is equivalent to the set-theoretical statement " α ω ω , ω L ( α ) < ω "; and that the statement “Any compact covering mapping between two coanalytic spaces is inductively perfect” is equivalent to “Analytic Determinacy”. We also prove that these statements are connected to some regularity properties of coanalytic cofinal sets in (X), the hyperspace of all compact subsets of a Borel...

Compactifications of ℕ and Polishable subgroups of S

Todor Tsankov (2006)

Fundamenta Mathematicae

We study homeomorphism groups of metrizable compactifications of ℕ. All of those groups can be represented as almost zero-dimensional Polishable subgroups of the group S . As a corollary, we show that all Polish groups are continuous homomorphic images of almost zero-dimensional Polishable subgroups of S . We prove a sufficient condition for these groups to be one-dimensional and also study their descriptive complexity. In the last section we associate with every Polishable ideal on ℕ a certain Polishable...

Comparison game on Borel ideals

Michael Hrušák, David Meza-Alcántara (2011)

Commentationes Mathematicae Universitatis Carolinae

We propose and study a “classification” of Borel ideals based on a natural infinite game involving a pair of ideals. The game induces a pre-order and the corresponding equivalence relation. The pre-order is well founded and “almost linear”. We concentrate on F σ and F σ δ ideals. In particular, we show that all F σ -ideals are -equivalent and form the least equivalence class. There is also a least class of non- F σ Borel ideals, and there are at least two distinct classes of F σ δ non- F σ ideals.

Complete pairs of coanalytic sets

Jean Saint Raymond (2007)

Fundamenta Mathematicae

Let X be a Polish space, and let C₀ and C₁ be disjoint coanalytic subsets of X. The pair (C₀,C₁) is said to be complete if for every pair (D₀,D₁) of disjoint coanalytic subsets of ω ω there exists a continuous function f : ω ω X such that f - 1 ( C ) = D and f - 1 ( C ) = D . We give several explicit examples of complete pairs of coanalytic sets.

Complete sequences of coanalytic sets

Riccardo Camerlo (2014)

Fundamenta Mathematicae

The notion of a complete sequence of pairwise disjoint coanalytic sets is investigated. Several examples are given and such sequences are characterised under analytic determinacy. The ideas are based on earlier results of Saint Raymond, and generalise them.

Complexité de la famille des ensembles de synthèse d'un groupe abélien localement compact

Etienne Matheron (1996)

Studia Mathematica

On montre que si G est un groupe abélien localment compact non diskret à base dénombrable d'ouverts, alors la famille des fermés de synthèse pour l'algèbre de Fourier A(G) est une partie coanalytique non borélienne de ℱ(G), l'ensemble des fermés de G muni de la structure borélienne d'Effros. On généralise ainsi un résultat connu dans le cas du groupe 𝕋.

Complexité des boréliens à coupes dénombrables

Dominique Lecomte (2000)

Fundamenta Mathematicae

Nous donnons, pour chaque niveau de complexité Γ, une caractérisation du type "test d'Hurewicz" des boréliens d'un produit de deux espaces polonais ayant toutes leurs coupes dénombrables ne pouvant pas être rendus Γ par changement des deux topologies polonaises.

Complexity of curves

Udayan B. Darji, Alberto Marcone (2004)

Fundamenta Mathematicae

We show that each of the classes of hereditarily locally connected, finitely Suslinian, and Suslinian continua is Π₁¹-complete, while the class of regular continua is Π₀⁴-complete.

Complexity of the class of Peano functions

K. Omiljanowski, S. Solecki, J. Zielinski (2000)

Colloquium Mathematicae

We evaluate the descriptive set theoretic complexity of the space of continuous surjections from m to n .

Conjugacy equivalence relation on subgroups

Alessandro Andretta, Riccardo Camerlo, Greg Hjorth (2001)

Fundamenta Mathematicae

If G is a countable group containing a copy of F₂ then the conjugacy equivalence relation on subgroups of G attains the maximal possible complexity.

Consistency of the Silver dichotomy in generalised Baire space

Sy-David Friedman (2014)

Fundamenta Mathematicae

Silver’s fundamental dichotomy in the classical theory of Borel reducibility states that any Borel (or even co-analytic) equivalence relation with uncountably many classes has a perfect set of classes. The natural generalisation of this to the generalised Baire space κ κ for a regular uncountable κ fails in Gödel’s L, even for κ-Borel equivalence relations. We show here that Silver’s dichotomy for κ-Borel equivalence relations in κ κ for uncountable regular κ is however consistent (with GCH), assuming...

Constructing universally small subsets of a given packing index in Polish groups

Taras Banakh, Nadya Lyaskovska (2011)

Colloquium Mathematicae

A subset of a Polish space X is called universally small if it belongs to each ccc σ-ideal with Borel base on X. Under CH in each uncountable Abelian Polish group G we construct a universally small subset A₀ ⊂ G such that |A₀ ∩ gA₀| = for each g ∈ G. For each cardinal number κ ∈ [5,⁺] the set A₀ contains a universally small subset A of G with sharp packing index p a c k ( A κ ) = s u p | | : g A g G i s d i s j o i n t equal to κ.

Convexity ranks in higher dimensions

Menachem Kojman (2000)

Fundamenta Mathematicae

A subset of a vector space is called countably convex if it is a countable union of convex sets. Classification of countably convex subsets of topological vector spaces is addressed in this paper. An ordinal-valued rank function ϱ is introduced to measure the complexity of local nonconvexity points in subsets of topological vector spaces. Then ϱ is used to give a necessary and sufficient condition for countable convexity of closed sets. Theorem. Suppose that S is a closed subset of a Polish linear...

Currently displaying 81 – 100 of 370