On lightly and countably compact spaces in ZF

Abstract

Given a topological space X = (X, T ), we show in the Zermelo-Fraenkel set theory ZF that:

1. Every locally finite family of open sets of X is finite iff every pairwise disjoint, locally finite family of open sets is finite.

2. Every locally finite family of subsets of X is finite iff every pairwise disjoint, locally finite family of subsets of X is finite iff every locally finite family of closed subsets of X is finite.

3. The statement “every locally finite family of closed sets of X is finite” implies the proposition “every locally finite family of open sets of X is finite”. The converse holds true in case X is T₄ and the countable axiom of choice holds true.

   We also show:

4. It is relatively consistent with ZF the existence of a non countably compact T₁ space such that every pairwise disjoint locally finite family of closed subsets is finite but some locally finite family of subsets is infinite.

5. It is relatively consistent with ZF the existence of a countably compact T₄ space including an infinite pairwise disjoint locally finite family of open (resp. closed) sets.

     

Wolk两个定理的推广

[1]中定理3.6是经典的Dini定理的推广。Wolk在证明了这个定理后指出,有例子说明,若将值域空间Y的全无序集(即反链)有限性条件去掉后,此定理将不成立。于是他提出了一个可供进一步思考的问题:是否可用另外一些拓扑代替Y中的Dedekind拓扑,去掉Y中全无序集有限性条件后,此定理或它的某种变形依然成立?按照这个思路我们将[1]中定理3.6和3.9进行了推广。为此,先摘录两个主要概念如下:     

Constructive Order Theory

We introduce the notion of constructive suprema and of constructively directed sets. The Axiom of Choice turns out to be equivalent to the postulate that every supremum is constructive, but also to the hypothesis that every directed set admits a function assigning to each finite subset an upper bound. The Axiom of Multiple Choice (which is known to be weaker than the full Axiom of Choice in set theory without foundation) implies a simple set‐theoretical induction principle (SIP), stating that any system of sets that is closed under unions of well‐ordered subsystems and contains all finite subsets of a given set must also contain that set itself. This is not provable without choice principles but equivalent to the statement that the existence of joins for constructively directed subsets of a poset follows from the existence of joins for nonempty well‐ordered subsets. Moreover, we establish the equivalence of SIP with several other fundamental statements concerning inductivity, compactness, algebraic closure systems, and the exchange between chains and directed sets.     

Decidable Computable A-Numberings

The article deals in the numbering theory for admissible sets, brought in sight in [1]. For models of two special classes, we resolve the problem of there being 1-1 computable numberings of the families of all computable sets and of all computable functions. In proofs, for the former case the role of finite objects is played by syntactic constructions, and for the latter — by finite subsets on hereditarily finite superstructures.     

On constraint sets of infinite linear programs over ordered fields

This paper provides a characterization of extreme points and extreme directions of the subsets of the space of generalized finite sequences occurring as the constraint sets of semi-infinite or infinite linear programs. The main result is that these sets are generated by (possibly infinitely many) extreme points and extreme directions. All results are valid over arbitrary ordered fields.     

A generalized notion of quotient for finite Abelian groups

A finite Abelian group G is partitioned into subsets which are translations of each other. A binary operation is defined on these sets in a way which generalizes the quotient group operation. Every finite Abelian group can be realized as such a generalized quotient with G cyclic.     

Statistics of random compacts in euclidean space

The article describes and studies two methods of statistical estimation of various geometrical characteristics of convex compact random subsets in the Euclidean space. Estimation accuracy using a finite number of measurements is considered. A theorem characterizing Gaussian random sets is given, which states that all these sets are of the form A=M+ξ, where M has a degenerate distribution and ξ is a normal random vector.     

Embedding relations in the lattice of recursively enumerable sets

Let ?* be the lattice of recursively enumerable sets of natural numbers modulo finite differences. We characterize the relations which can be embedded in ?* by using certain collections of maximal sets as domain and using Lachlan's notion of major subsets to code in the relation in certain natural ways. We show that attempts to prove the undecidability of ?* by using such embeddings fail.     

Equidistant sets on Alexandrov surfaces

We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets determined by two distinct points on a compact Riemannian 2-manifold. Notably, we find that the equidistant set is always a finite simplicial 1-complex. These results are applied to answer an open question concerning the Hausdorff dimension of equidistant sets in the Euclidean plane.     

On the complexity of recognizing directed path families

A Directed Path Family is a family of subsets of some finite ground set whose members can be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a given family is a Directed Path family is an NP-Complete problem, even when all members in the family have at most two elements. If instead of a family of subsets, we are given a collection of words from some finite alphabet, then deciding whether there exists a directed graph G such that each word in the language is the set of arcs of some path in G, is a polynomial-time solvable problem.     

On the additive energy of the distance set in finite fields

We use character sums to derive new bounds on the additive energy of the set of distances (counted with multiplicities) between two subsets of a vector space over a given finite field. We also give applications to sumsets of distance sets.     

Generalized closed sets with respect to an ideal in bitopological spaces

An ideal on a set X is a nonempty collection of subsets of X with heredity property which is also closed under finite unions. The concept of generalized closed sets in bitopological spaces was introduced by Sundaram. In this paper, we introduce and study the concept of generalized closed sets with respect to an ideal in an ideal bitopological space.     

Orthogonal sequences and regularity of embeddings into finite-dimensional spaces

This paper focuses on the regularity of linear embeddings of finite-dimensional subsets of Hilbert and Banach spaces into Euclidean spaces. We study orthogonal sequences in a Hilbert space H, whose elements tend to zero, and similar sequences in the space c₀ of null sequences. The examples studied show that the results due to Hunt and Kaloshin (Regularity of embeddings of infinite-dimensional fractal sets into finite-dimensional spaces, Nonlinearity 12 (1999) 1263-1275) and Robinson (Linear embeddings of finite-dimensional subsets of Banach spaces into Euclidean spaces, Nonlinearity 22 (2009) 711-728) for subsets of Hilbert and Banach spaces with finite box-counting dimension are asymptotically sharp. An analogous argument allows us to obtain a lower bound for the power of the logarithmic correction term in an embedding theorem proved by Olson and Robinson (Almost bi-Lipschitz embeddings and almost homogeneous sets, Trans. Amer. Math. Soc. 362 (1) (2010) 145-168) for subsets X of Hilbert spaces when X−X has finite Assouad dimension.     

Two combinatorial covering theorems

A theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets of integers are generalized to coverings by subsets of a finite set. These theorems are then related to quasigroups and (0, 1)-matrices.     

On the complexity of recognizing a set of vectors by a neuron

We consider the problems connected with the computational abilities of a neuron. The orderings of finite subsets of real vectors associated with neural computing are studied. We construct a lattice of such orderings and study some its properties. The interrelation between the orders on the sets and the neuron implementation of functions defined on these sets is derived. We prove the NP-hardness of “The Shortest Vector” problem and represent the relationship of the problem with neural computing.     

The Dyck and the Preiss separation uniformly

We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We show by introducing the corresponding separation trees that both of these results admit a constructive proof. This enables us to give the uniform version of these separation theorems, and to derive as corollaries the results, which are analogous to the fundamental fact “HYP is effectively bi-analytic” provided by the Suslin–Kleene Theorem.     

Set of periods of a subshift

In this article, subsets of \({\mathbb {N}}\) that can arise as sets of periods of the following subshifts are characterized: (i) subshifts of finite type, (ii) transitive subshifts of finite type, (iii) sofic shifts, (iv) transitive sofic shifts, and (v) arbitrary subshifts.     

The foundations of enumeration theory for finite nilpotent groups

This paper is the first in a series of papers that lay the foundations of enumeration theory for finite groups including the classical inversion calculus on segments of the natural series and on lattices of subsets of finite sets. Since it became possible to calculate the Möbius function on all subgroups of finite nilpotent groups, the Möbius inversion on these groups began to play a decisive role. The efficiency of the inversion method as a regular technique suitable for solution of enumeration problems of group theory is illustrated with a number of concrete and very important enumerations. Bibliography: 13 titles.     

On support properties of functions and their Jacobi transform

The qualitative uncertainty principle proved by Benedicks asserts that f and its Fourier transform \(\hat f\) cannot both concentrated in subsets of finite Lebesgue measure. In this paper we obtain some uncertainty principles concerning sets of finite measure in the Jacobi setting.     

Localization of invariant compacta of autonomous systems

A class of problems that may be characterized as localization problems are becoming increasingly popular in qualitative theory of differential equations [1–15]. The specific formulations differ, but geometrically all search for phase space subsets with desired properties, e.g., contain certain solutions of the system of differential equations. Such problems include construction of positive invariant sets that contain certain separatrices of the Lorenz system [1], analysis of asymptotic behavior of solutions of the Lorenz system and determination of sets that contain the Lorenz attractor [2–5, 14], as well as determination of sets containing all periodic trajectories [6–13], separatrices, and other trajectories [10, 11]. Such sets may be naturally called localizing sets and it is obviously interesting to study methods and results that produce exact or nearly exact localizing sets for each phase space structure. In this article we focus on localization of the invariant compact sets in the phase space of a differential equation system, specifically the problem of finding phase space subsets that contain all the invariant compacta of the system. Invariant compact sets are equilibria, periodic trajectories, separatrices, limit cycles, invariant tori, and other sets and their finite unions. These sets and their properties largely determine the phase space structure and the qualitative behavior of solutions of the differential equation system.