Loading [MathJax]/extensions/MathZoom.js
We construct algebras of sets which are not MB-representable. The existence of such algebras was previously known under additional set-theoretic assumptions. On the other hand, we prove that every Boolean algebra is isomorphic to an MB-representable algebra of sets.
A function f: ℝ → {0,1} is weakly symmetric (resp. weakly symmetrically continuous) at x ∈ ℝ provided there is a sequence hₙ → 0 such that f(x+hₙ) = f(x-hₙ) = f(x) (resp. f(x+hₙ) = f(x-hₙ)) for every n. We characterize the sets S(f) of all points at which f fails to be weakly symmetrically continuous and show that f must be weakly symmetric at some x ∈ ℝ∖S(f). In particular, there is no f: ℝ → {0,1} which is nowhere weakly symmetric.
It is also shown that if at each point x we...
We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-ℵ₁, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's axiom for σ-linked partial orderings. This yields a new solution to an old question of the first author about the relative strength of Martin's axiom for σ-centered partial orderings together with the assertion that every Aronszajn tree is special. We also answer a question...
We consider a set, L, of lines in and a partition of L into some number of sets: . We seek a corresponding partition such that each line l in meets the set in a set whose cardinality has some fixed bound, . We determine equivalences between the bounds on the size of the continuum, , and some relationships between p, and .
We investigate some geometrical properties of squares of special Sierpiński sets. In particular, we prove that (under CH) there exists a Sierpiński set S and a function p: S → S such that the images of the graph of this function under π'(⟨x,y⟩) = x - y and π''(⟨x,y⟩) = x + y are both Lusin sets.
Let X be a set, κ be a cardinal number and let ℋ be a family of subsets of X which covers each x ∈ X at least κ-fold. What assumptions can ensure that ℋ can be decomposed into κ many disjoint subcovers?
We examine this problem under various assumptions on the set X and on the cover ℋ: among other situations, we consider covers of topological spaces by closed sets, interval covers of linearly ordered sets and covers of ℝⁿ by polyhedra and by arbitrary convex sets. We focus on...
Let X be a nonempty set of cardinality at most and T be a selfmap of X. Our main theorem says that if each periodic point of T is a fixed point under T, and T has a fixed point, then there exist a metric d on X and a lower semicontinuous map ϕ :X→ ℝ ₊ such that d(x,Tx) ≤ ϕ(x) - ϕ(Tx) for all x∈ X, and (X,d) is separable. Assuming CH (the Continuum Hypothesis), we deduce that (X,d) is compact.
On every subspace of which contains an uncountable -independent set, we construct equivalent norms whose Banach-Mazur distance is as large as required. Under Martin’s Maximum Axiom (MM), it follows that the Banach-Mazur diameter of the set of equivalent norms on every infinite-dimensional subspace of is infinite. This provides a partial answer to a question asked by Johnson and Odell.
Rasiowa and Sikorski [5] showed that in any Boolean algebra there is an ultrafilter preserving countably many given infima. In [3] we proved an extension of this fact and gave some applications. Here, besides further remarks, we present some of these results in a more general setting.
Currently displaying 21 –
40 of
47