Nice Hamel bases under the Covering Property Axiom
نویسندگان
چکیده
In the paper we prove that axiom CPA prism, which follows from the Covering Property Axiom CPA and holds in the iterated perfect set model, implies that there exists a Hamel basis which is a union of less than continuum many pairwise disjoint perfect sets. We will also give two consequences of this last fact. 1 The result and its consequences In this paper we will use standard set theoretic terminology as in [2]. We will consider the real line R as a linear space over the rationals Q. Any linear base of this space will be referred to as a Hamel base. For A ⊂ R we will write LIN(A) to denote the linear subspace of R spanned by A. ∗AMS classification numbers: Primary 26A15, 03E65; Secondary 26A30, 03E35.
منابع مشابه
Crowded and Selective Ultrafilters under the Covering Property Axiom
In the paper we formulate an axiom CPA prism, which is the most prominent version of the Covering Property Axiom CPA, and discuss several of its implications. In particular, we show that it implies that the following cardinal characteristics of continuum are equal to ω1, while c = ω2: the independence number i, the reaping number r, the almost disjoint number a, and the ultrafilter base number ...
متن کاملOn Additive Almost Continuous Functions under Cpa
We prove that the Covering Property Axiom CPA prism, which holds in the iterated perfect set model, implies that there exists an additive discontinuous almost continuous function f : R → R whose graph is of measure zero. We also show that, under CPA prism, there exists a Hamel basis H for which, E+(H), the set of all linear combinations of elements from H with positive rational coefficients, is...
متن کاملApplications of the Covering Property Axiom
Applications of the Covering Property Axiom Andrés Millán Millán The purpose of this work is two-fold. First, we present some consequences of the Covering Property Axiom CPA of Ciesielski and Pawlikowski which captures the combinatorial core of the Sacks’ model of the set theory. Second, we discuss the assumptions in the formulation of different versions of CPA. As our first application of CPA ...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملCovering Property Axiom CPA
Draft of March 11, 2001. We still plan to make considerable changes to this manuscript. Comments and list of typos are welcome!
متن کامل