The Heighway Dragon Revisited

We prove that the Heighway dragon is a countable union of closed geometrically similar disk-like planar sets which intersect each other in a linear order: any two of them intersect at no more than one cut point and for any three disks there exist at least two with an empty intersection. Consequently, the interior of the Heighway dragon is a countable union of disjoint open disk-like planar sets. We determine all the cut points of the dragon and show that each disk-like subset between two cut points is a graph self-similar set defined by a graph-directed iterated function system consisting of four seed sets. Our results describe a fairly complete picture of the topological and geometric structure of the Heighway dragon.     

Unions and the axiom of choice

We study statements about countable and well‐ordered unions and their relation to each other and to countable and well‐ordered forms of the axiom of choice. Using WO as an abbreviation for “well‐orderable”, here are two typical results: The assertion that every WO family of countable sets has a WO union does not imply that every countable family of WO sets has a WO union; the axiom of choice for WO families of WO sets does not imply that the countable union of countable sets is WO. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sets in a euclidean space which are not a countable union of convex subsets

We prove that if a closed planar setS is not a countable union of convex subsets, then exactly one of the following holds:

Entropy points and applications

First notions of entropy point and uniform entropy point are introduced using Bowen's definition of topological entropy. Some basic properties of the notions are discussed. As an application it is shown that for any topological dynamical system there is a countable closed subset whose Bowen entropy is equal to the entropy of the original system.

Then notions of C-entropy point are introduced along the line of entropy tuple both in topological and measure-theoretical settings. It is shown that each C-entropy point is an entropy point, and the set of C-entropy points is the union of sets of C-entropy points for all invariant measures.

     

Stable intersection of affine Cantor sets defined by two expanding maps

It is shown that in the context of affine Cantor sets with two increasing maps, the arithmetic sum of both of its elements is a Cantor set otherwise, it is a closure of countable union of nontrivial intervals. Also, a new family of pairs of affine Cantor sets is introduced such that each element of it has stable intersection. At the end, pairs of affine Cantor sets are characterized such that the sum of elements of each pair is a closed interval.     

Planar Graphs Have 1-string Representations

We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once.     

A Planar 3-Convex Set is Indeed a Union of Six Convex Sets

Suppose S is a planar set. Two points $a,b$ in S  see each other via S if $[a,b]$ is included in S . F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three convex sets. The pentagonal star shows that the number three is the best possible. We drop the condition that S is closed and show that S is a union of (at most) six convex sets. The number six is best possible.     

Simultaneously non-convergent frequencies of words in different expansions

We consider expanding maps such that the unit interval can be represented as a full symbolic shift space with bounded distortion. There are already theorems about the Hausdorff dimension for sets defined by the set of accumulation points for the frequencies of words in one symbolic space at a time. We show that the dimension is preserved when such sets defined using different maps are intersected. More precisely, it is proven that the dimension of any countable intersection of sets defined by their sets of accumulation for frequencies of words in different expansions, has dimension equal to the infimum of the dimensions of the sets that are intersected. As a consequence, the set of numbers for which the frequencies do not exist has full dimension even after countable intersections. We also prove that this holds for a dense set of non-integer base expansions.     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

A two-parameter spectral theorem

Summary We study the characteristic set of a couple (A, B) of selfadjoint compact operators on a real Hilbert spaceH. We prove thatC is the union of a sequence of characteristic curvesC _n in the (, ) plane. Each curve is the analytic image of an open interval and it is either closed or it goes to infinity at both ends of the interval. Moreover, it may intersect either itself or other characteristic curves in an at most countable set of points, which may accumulate only at infinity. Finally, to each characteristic curve one can associate an analytic function E_n, which gives the eigenprojection onto the eigenspace attached to each point of the characteristic curve, except at the intersection points, where the eigenspace is the direct sum of the projection relevant to each branch passing through the point. The dimension of the eigenprojection is constant along each curve and it is called the multiplicity of the characteristic curve.     

When a compact (countably compact) set is closed. II

We obtain (a) necessary and sufficient conditions and (b) sufficient conditions for a compact (countably compact) set to be closed in products (sequential products) and subspaces (sequential subspaces) of normal spaces. As a consequence of these, sufficient conditions are obtained for (i) the closedness of arbitrary (countable) union of closed sets and (ii) the equality of the union of the closures and the closure of the union of arbitrary (countable) families of sets in these spaces. It is also shown that these results do not hold for quotients of even T ₄,-spaces.     

On quasi-amorphous sets

A set is said to be amorphous if it is infinite, but cannot be written as the disjoint union of two infinite sets. The possible structures which an amorphous set can carry were discussed in [5]. Here we study an analogous notion at the next level up, that is to say replacing finite/infinite by countable/uncountable, saying that a set is quasi-amorphous if it is uncountable, but is not the disjoint union of two uncountable sets, and every infinite subset has a countably infinite subset. We use the Fraenkel–Mostowski method to give many examples showing the diverse structures which can arise as quasi-amorphous sets, for instance carrying a projective geometry, or a linear ordering, or both; reconstruction results in the style of [1] are harder to come by in this case. Received: 8 April 1999 / Published online: 3 October 2001     

Proper forcing axiom and selective separability

We continue the study of Selectively Separable (SS) and, a game-theoretic strengthening, strategically selectively separable spaces (SS⁺) (see Barman, Dow (2011) [1]). The motivation for studying SS⁺ is that it is a property possessed by all separable subsets of Cp(X) for each σ-compact space X. We prove that the winning strategy for countable SS⁺ spaces can be chosen to be Markov. We introduce the notion of being compactlike for a collection of open sets in a topological space and with the help of this notion we prove that there are two countable SS⁺ spaces such that the union fails to be SS⁺, which contrasts the known result about SS spaces. We also prove that the product of two countable SS⁺ spaces is again countable SS⁺. One of the main results in this paper is that the proper forcing axiom, PFA, implies that the product of two countable Fréchet spaces is SS, a statement that was shown in Barman, Dow (2011) [1] to consistently fail. An auxiliary result is that it is consistent with the negation of CH that all separable Fréchet spaces have π-weight at most ω₁.     

A certain family of self-similar sets

In this paper we consider an one-parameter family of iterated function systems. For every value of the parameter we find the set of top addresses. We prove that this set is a countable disjoint union of self-similar sets and calculate its Hausdorff dimension.     

关于CSS空间及相关结论

CSS空间是指空间中的紧集都是一致G_δ集的空间.该文的第一部分,主要证明了具有拟G_δ(2)对角线的空间是CSS空间.另外,还证明了如果X是可数个闭的CSS空间的并,则X是CSS空间.CSS空间的可数积空间是CSS空间;第二部分证明了如果空间X可以表示成可数个闭的β空间(或半层空间)的并,则X是β空间(或半层空间).     

Bounded Scott Set Saturation

We examine the relationship between two different notions of a structure being Scott set saturated and identify sufficient conditions which guarantee that a structure is uniquely Scott set saturated. We also consider theories representing Scott sets; in particular, we identify a sufficient condition on a theory T so that for any given countable Scott set there exists a completion of T that is saturated with respect to the given Scott set. These results extend Scott's characterization of countable Scott sets via models and completions of Peano arithmetic.     

Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

We consider the problem of finding a best approximation pair, i.e., two points which achieve the minimum distance between two closed convex sets in a Hilbert space. When the sets intersect, the method under consideration, termed AAR for averaged alternating reflections, is a special instance of an algorithm due to Lions and Mercier for finding a zero of the sum of two maximal monotone operators. We investigate systematically the asymptotic behavior of AAR in the general case when the sets do not necessarily intersect and show that the method produces best approximation pairs provided they exist. Finitely many sets are handled in a product space, in which case the AAR method is shown to coincide with a special case of Spingarn's method of partial inverses.     

When a Compact (Countably Compact) set is Closed

We give necessary and sufficient conditions for a compact (countably compact) set to be closed in S ₂ (Fréchet, S ₂) and in normal (Fréchet, normal) spaces. Sufficient conditions are obtained for (i) the closedness of arbitrary (countable) union of closed sets and (ii) the equality of the union of the closures and the closure of the union of arbitrary (countable) families of sets, in such spaces. Countable compactness of the closure of a countably compact set in Fréchet, S ₂-spaces, and related results are also obtained.     

Countable Random Sets: Uniqueness in Law and Constructiveness

The first part of this article deals with theorems on uniqueness in law for σ-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two approaches on uniqueness theorems: first, the study of generators for σ-fields used in this context and, secondly, the analysis of hitting functions. The last section of this paper deals with the notion of constructiveness. We prove a measurable selection theorem and a decomposition theorem for constructive countable random sets, and study constructive countable random sets with independent increments.     

On box products

We prove two theorems about box products. The first theorem says that the box product of countable spaces is pseudonormal, i.e. any two disjoint closed sets one of which is countable can be separated by open sets. The second theorem says that assuming CH a certain uncountable box product is normal (i.e. <_ω1?□_α<ω1X_α where each Xα is a compact metric space).