Free Boolean Topological Groups

Sipacheva, Olga

doi:10.3390/axioms4040492

Cited by 14 publications

(16 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…The topology of the free Boolean topological group B(X F ) = [X ∪ { * }] <ω on this space, that is, the strongest group topology that induces the topology of X F on X ∪ { * }, is described in detail in [4]. Description II in [4] takes the following form for X F . For each n ∈ N, we fix an arbitrary sequence Γ of neighborhoods of * , that is, Γ = A n ∪ { * } n∈N , where A n ∈ F , and set U(Γ) = n∈N {x 1 + y 1 + x 2 + y 2 + · · · + x n + y n : x i , y i ∈ A i ∪ { * } for i ≤ n}.…”

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…For the Graev free Boolean topological group (A precise definition can be found in [4]. For aestetic reasons, instead of the standard notation B G (F ) we use B G (F ) in this paper).…”

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…For spaces of the form X F , the Graev free Boolean topological group is topologically isomorphic to the free Boolean topological group (see [4]). …”

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…Then w i ∈ C ⊂ B 4 (κ), i < N. Let w i = α i 1 + α i 2 + α i 3 + α i 4 for i < N and consider the 36-coloring of all pairs {w i , w j }, i < j < N, defined as follows. Since w i + w j is a four-letter element, it follows that w i + w j = β 1 + β 2 + β 3 + β 4 , where β i ∈ κ. Two letters among β 1 , β 2 , β 3 , β 4 (say β 1 and β 2 ) occur in w i and the remaining two (β 3 and β 4 ) occur in w j .…”

Section: Theoremmentioning

confidence: 99%

See 4 more Smart Citations

Large Sets in Boolean and Non-Boolean Groups and Topology

Sipacheva

2017

Axioms

Self Cite

View full text Add to dashboard Cite

Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.Keywords: large set in a group; vast set; syndetic set; thick set; piecewise syndetic set; Boolean topological group; arrow ultrafilter; Ramsey ultrafilter Various notions of large sets in groups and semigroups naturally arise in dynamics and combinatorial number theory. Most familiar are those of syndetic, thick (or replete), and piecewise syndetic sets. Apparently, the term "syndetic" was introduced by Gottschalk and Hedlund in their 1955 book [1] in the context of topological groups, although syndetic sets of integers have been studied long before (they appear, e.g., in Khintchine's 1934 ergodic theorem). During the past decades, large sets in Z and in abstract semigroups have been extensively studied. It has turned out that, e.g., piecewise syndetic sets in N have many attractive properties: they are partition regular (i.e., given any partition of N into finitely many subsets, at least one of the subsets is piecewise syndetic), contain arbitrarily long arithmetic progressions, and are characterized in terms of ultrafilters on N (namely, a set is piecewise syndetic it and only if it belongs to an ultrafilter contained in the minimal two-sided ideal of βN). Large sets of other kinds are no less interesting, and they have numerous applications to dynamics, Ramsey theory, the ultrafilter semigroup on N, the Bohr compactification, and so on.Quite recently Reznichenko and the author have found yet another application of large sets. Namely, we introduced special large sets in groups, which we called vast, and applied them to construct a discrete set with precisely one limit point in any countable nondiscrete topological group in which the identity element has nonrapid filter of neighborhoods. Using this technique and special features of Boolean groups, we proved, in particular, the nonexistence of a countable nondiscrete extremally disconnected group in ZFC (see [2]).In this paper, we study right and left thick, syndetic, piecewise syndetic, and vast sets in groups (although they can be defined for arbitrary semigroups). Our main concern is the interplay between such sets in Boolean groups. We also consider natural topologies closely related to vast sets, which leads to interesting relations between vast sets and ultrafilters. Basic Definitions and NotationWe use the standard notation Z for the group of integers, N for the set (or semigroup, depending on the context) of positive integers, and ω for the set of nonnegative integers or the first infinite cardinal; we identify cardinals with the corresponding initial ordinals. Given a set X, by |X| we denote its cardinality, by [X] k for k ∈ N, the kth symmetric power of ...

show abstract

Section: Basic Definitions and Notationmentioning

confidence: 99%

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…For the Graev free Boolean topological group (A precise definition can be found in [4]. For aestetic reasons, instead of the standard notation B G (F ) we use B G (F ) in this paper).…”

Section: Basic Definitions and Notationmentioning

confidence: 99%

“…For spaces of the form X F , the Graev free Boolean topological group is topologically isomorphic to the free Boolean topological group (see [4]). …”

Section: Basic Definitions and Notationmentioning

confidence: 99%

Section: Theoremmentioning

confidence: 99%

See 3 more Smart Citations