[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Next Article in Journal
New Expressions for Sums of Products of the Catalan Numbers
Next Article in Special Issue
Baire-Type Properties in Metrizable c0(Ω, X)
Previous Article in Journal
A Comprehensive Analysis of Hermite–Hadamard Type Inequalities via Generalized Preinvex Functions
Previous Article in Special Issue
A Relation-Theoretic Metrical Fixed Point Theorem for Rational Type Contraction Mapping with an Application
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Applying Set Theory

1
Einstein Institute of Mathematics Edmond J. Safra Campus, Givat Ram The Hebrew University of Jerusalem, Jerusalem 9190401, Israel
2
Department of Mathematics Hill Center—Busch Campus Rutgers, The State University of New Jersey, 110 Frelinghuysen Road, Piscataway, NJ 08854-8019, USA
Axioms 2021, 10(4), 329; https://doi.org/10.3390/axioms10040329
Submission received: 19 October 2021 / Revised: 19 November 2021 / Accepted: 21 November 2021 / Published: 30 November 2021
(This article belongs to the Collection Mathematical Analysis and Applications)

Abstract

:
We prove some results in set theory as applied to general topology and model theory. In particular, we study 1 -collectionwise Hausdorff, Chang Conjecture for logics with Malitz-Magidor quantifiers and monadic logic of the real line by odd/even Cantor sets.
MSC:
03C55; 03C85; 03E75; 03E35

1. Introduction

In §2 we prove a result in general topology saying: if 1 * then any normal space is 1 CWH (=collectionwise Hausdorff); done independently of and in parallel to Fleisner and Alan D. Taylor.
In §3 we prove the Chang Conjecture for Magidor-Malitz Quantifiers. A recent related piece of work is [1].
In §4 we prove the Monadic Theory of the tree ω > 2 is complicated under a quite weak set theoretic assumption. Earlier [2] proved this (i.e., the result on the monadic logic) assuming CH or at least a consequence of it.
The present note was circulated in the Spring of 1979 in a collection; it include each of the sections (as well as other preprints) but those three were not published. However, Ref. [3]. have results related to Section 3; in particular it was conjectured there (in Remark 2.15) that there are two non-principal ultrafilters of ω with no common lower bound in the Rudin Keisler order; a conjecure which had been refuted in [4].
Later, Gurevich-Shelah [5] proved undecidability in ZFC , with further developments then more in Shelah [6], still the older proof gives information not covered by them. For more see [4,7,8].
The results are old, still in particular, §2 gives a direct proof of the result compared to others and §4 gives a considerably more transparent easier proof of the later result of [5] but with an extra weak hypothesis.
The author would like to thank Shai Ben David for stimulating discussions on part §3.
We thank the referee for his help, well beyond than the call of duty.

2. A Note in General Topology If 1 * Then Any Normal Space Is 1 CWH (=Collectionwise HAUSDORFF)

The normal Moore space problem has been a major theme in general topology, see the recent survey Dow-Tall [9]. In this connection, Fleissner ([10], p. 6) proved: ( V = L ) every normal first countable (topological) space is CWH ( CWH means collectionwise Hausdorff). He used a strengthening of diamond. The author proved Fleissner strengthening (for 1 ) does not follow from ZFC + 1 + (see [11], Th. 5, p. 31). Here we prove nevertheless 1 * implies every normal first countable space is 1 CWH .
The central idea of the proof in §2 is inspired by one key idea in Fleissner [10]. Fleissner implicitly used a stronger combinatorial principle S S . In 1979, the author and independently both Fleissner and Alan D. Taylor all saw (as mentioned in [12,13] that a weaker principle, ω 1 * , would suffice. Later Smith and Szeptycki [12] derive better results. On more recent results on diamond and strong negation, see [14] and references there.
Definition 1.
Below δ always denotes a limit ordinal ( < ω 1 ) . For transparency, below we refer to the following equivalent form of ω 1 * .
Definition 2.
Let 1 * mean that there exist a sequence g δ : δ < ω 1 where g δ = g ¯ δ , k : k < ω is of the form g ¯ δ , k = g n δ , k : n < ω , where g n δ , k : δ ω has the property that, for any sequence g ¯ = g n : n < ω with g n : { δ : δ < ω 1 } ω , there is a club (closed unbounded) set C ω 1 such that, for each γ C , there is k = k ( γ ) ω with
g ¯ γ : = g n γ : n < ω = g ¯ γ , k = g n γ , k : n < ω .
Theorem 1.
Assume 1 * . If X is Hausdorff first countable normal and | X | = 1 then X is CWH.
Proof. 
Let g δ : δ < ω 1 be as in Definition 2.
Without loss of generality X * = { δ : δ < ω 1 } X and X * is closed discrete in the space X. Let U n δ ( n < ω ) be a basis of open neighborhoods of δ (for δ < ω 1 ). We shall define by induction on α < ω 1 a limit ordinal γ α < ω 1 and f n ( γ ) : n < ω , γ < γ α such that γ α is increasing continuous with α and γ 0 = 0 . For α = 0 choose γ α = ω ; f n ( γ ) = 0 . For limit α let γ α be { γ β : β < α } . For α = β + 1 if γ α > α then we let γ α = γ β + ω and let f n ( γ ) = 0 for γ [ γ β , γ α ) . Finally assume that α = δ * , γ δ * = δ * so δ * X * .
We have chosen above the functions g n δ * , k : n < ω , k < ω with g n δ * , k : δ * ω ; now for each n , k < ω let A δ * , n , k = { U g n δ * , k ( δ ) δ : δ < δ * , f n ( δ ) = } (for n < ω , < 2 ). Call k < ω good for δ * when for infinitely many (pairs) n , we have
B δ * , n , k : = cl ( A δ * , n , k ) ( X * \ δ * ) .
We let γ α = γ δ * + 1 = min { δ : δ > δ * and if < 2 and n , k < ω and B δ * , n , k then ( δ * , δ ) B δ * , n , k } .
Now we choose f n [ δ * , γ α ) such that for any k good for δ * , for some n , , δ δ * we have
f n ( δ ) = 1 ( f o r δ cl ( A δ * , n , k ) ) .
Then we complete arbitrarily the f n so that its domain is γ α .
Thus we have defined f n ( n < ω ) with f n : ω 1 2 . For each n the sets f n 1 { 1 } X * , f n 1 { 0 } X * form a partition of X * , both are closed and discrete subsets of X. But X is normal. So there are functions g n : X * ω for n < ω so that letting for = 0 , 1
A n = { U g n ( δ ) δ : δ X * , f n ( δ ) = }
we have
A 0 n A 1 n = .
Let g n + be any function from ω 1 to ω extending g n . For some closed unbounded set C X * we have: δ * C ( k ) ( g n + δ * : n < ω = g n δ * , k : n < ω ) . Let the first such k be denoted k ( δ * ) . Without loss of generality every δ * C satisfy γ δ * = γ hence if δ * C n < ω k < ω < 2 and B δ * , n , k = cl ( A δ * , n , k ) ( X * \ δ * ) then min ( B δ * , n , k ) < min ( C \ ( δ * + 1 ) ) .
For δ * C now k ( δ * ) cannot be good for δ * , (by the definition).
Now for at least one n (in fact, for infinitely many n-s) we have cl ( A n | δ * ) ( X * \ δ * ) = for { 0 , 1 } , let n ( δ * ) be the first such n.
Define
B n = { δ : for some δ * C { 0 } we have δ * δ < min ( C \ δ ) and n = max { n ( δ * ) , n ( δ ) }
Now n ( g n B n ) almost exhibits X * has the right sequence of neighborhoods. Now we can deal with each B n separately (just choose U n by induction on n such that U n is open, U n X * = B n and U n X \ c ( < n U ) , possible by normality).
By dealing as follows with each interval [ δ * , min ( C \ ( δ * + 1 ) ) ] for δ * C { 0 } we have U g n ( δ ) δ ( δ B n ) as required.
That is, for γ C { 0 } with γ + its successor in C, choose a (countable) family of pairwise disjoint open sets U γ ( β ) for β X * γ β < γ + , with β U γ ( β ) , this is possible as in the choice of the U n ’s.
Now for β X * we let W β = U n ( β ) U γ ( β ) ( β ) U g n ( β ) ( β ) β where:
  • γ ( γ ) = max ( C ( β + 1 ) )
  • m ( β ) = max { n ( δ * ) , n ( ( δ * ) + ) : δ * = max ( C β ) β < ( δ * ) + }
Finally W β : β X * is a sequence of pairwise disjoint open sets of X with β X * β W β , so we are done. □
Remark 1.
As in [10] it suffices to assume every point in the space has a neighborhood basis of cardinality 1 .

3. Chang Conjecture for Magidor-Malitz Quantifiers

Silver (see [15]) had proved the consistency of Chang conjecture, i.e.,
any model M with universe 2 (and countable signature = vocabulary) τ , has an elementary submodel N , ( N = 1 , | N ω 1 | = 0 )
Silver did this by starting with a model V with κ Ramsey (in fact, something weaker suffices), forcing MA and then collapsing κ to 2 by P Set κ = { f : Dom ( f ) { μ : 1 < μ < κ , μ a cardinal } has cardinality 1 , and for some α < ω 1 , ( μ Dom f ) ( f ( μ ) is a function from α to μ ) } . See also Koszmider [16] for a topological application.
We can ask whether this submodel N can inherit more properties from M.
Definition 3.
Let us define a (technical variant of) Magidor-Malitz quantifiers. M ( Q n x ¯ ) φ ( x 1 , , x n ) means that there is a set A M ,   A is of cardinality M such that ( a 1 a n A ) φ ( a 1 a n ) .
The result is that:
Claim 1.
In ⊕ above, we can have N an elementary submodel of M even for the logic L ( Q 0 , Q 1 , ) n < ω . So e.g., Suslinity of trees is preserved.
For this we need the following.
Definition 4.
Call a forcing P suitable when for any sequence p i : i < ω 1 of members of P there is a set U ω 1 of cardinality 1 such that: for any finite u U there is q P such that i u q p i .
Claim 2.
Forcing by suitable forcing preserves satisfaction of sentences of Magidor-Malitz quantifiers for models of power 1 .
See ([17], 1.5–13, p. 34).
Claim 3.
There is a suitable forcing P , | P | = 2 1 , such that in V P : if Q is a suitable forcing of power 1 ,   M ~ a Q -name of a model of power 1 , in a language L V , universe 1 , then there is a directed G P , which determines M ~ as M and such that for any sentence ψ from the L ( Q 0 , Q 1 , ) (the variant of Magidor-Malitz logic from Definition 3)
Q M ~ ψ implies M ψ .
Proof. 
Just iterate the required forcing notions, with direct limit (i.e., finite support) and remember it is known that suitability is preserved under iteration, i.e., Claim 2.
Proof of Main result Claim 1:
Do as Silver, start with V κ Ramsey”, force by P from Claim 3, and then use P Set κ . The rest is as in his proof.
But we have to choose G as in Definition 3, and notice that more is reflected to the submodel he uses, (just check the definition carefully) and work a little, and remember that 1 -complete forcing preserves satisfaction of sentences in L ( Q 0 , ) (and P Set κ is 1 -complete). □

4. A Remark on the Monadic Theory of Order

In [2] we prove the undecidability of the monadic theory of (the order) R, assuming CH, or the weaker Baire-like hypothesis that R is not the union of fewer than continuum sets of first category sets. This condition is weaken below to ‘‘not ( St ) at least for T where a closely related theory is the monadic theory T of M = ( ω 2 , ) where ω 2 is the set of sequences of zeros and ones of length ω , is the (partial) order of being initial segment. T is closely related to Rabin’s monadic theory of ( ω > 2 , ) which he proved decidable [18]. We prove here that the statement “ ¬ ( St ) ” implies the undecidability of T (and all results on its complexity, see [2] and the paper of Gurevich on the subject) but it was not clear (at that time) whether (St) is consistent with ZFC.
Definition 5.
A Cantor [set] C is a non-empty subset of ω 2 with the properties
(a) 
C is closed under initial segments,
(b) 
if η has length ω then η C ( n ) ( η n C ) ,
(c) 
η C ω > 2 implies η 0 C or η 1 C ,
(d) 
for every η C ω > 2 , there is ν C ω > 2 η ν  and  ν 0 C , ν 1 C .
Definition 6.
(1) For a Cantor C, the set of its splitting points is Sp ( C ) = { η ω > 2 : η 0 C and η 1 C } .
(2) For a set A ω > 2 , C is an A-Cantor, if Sp ( C ) A .
(3) For a set S ω , C is called an S-Cantor, if
Sp ( C ) n S n 2 .
(4) An odd Cantor is one that is an { 2 n + 1 : n < ω } -Cantor. An even Cantor is one that is an { 2 n : n < ω } -Cantor.
Now the statement we speak about is
Definition 7.
Let ( St ) mean: the set ω 2 is the union of less than 2 0 Cantors each of them odd or even.
Problem 1.
Is ( St ) consistent with ZFC ?; solved in [4].
Claim 4.
Let { C i : i < α } be a family of odd and even Cantors, ω 2 = i < α C i . Then 2 0 | α | + .
Proof. 
Let for η , ν ω 2 , ρ = p ( η , ν ) be defined by ρ ( 2 n ) = η ( n ) , ρ ( 2 n + 1 ) = ν ( n ) , and then let η = pr 1 ( ρ ) , ν = pr 2 ( ρ ) .
Now for any even C, and η there is at most one ν such that p ( η , ν ) C ; why? if ν 0 , ν 1 are such ν ’s, ρ = p ( η , ν ) , then, by the definition of p ( , ) , for some m < ω , ρ 0 m = ρ 1 m , ρ 0 ( m ) ρ 1 ( m ) . If m = 2 n then ρ ( m ) = ρ ( 2 n ) = η ( n ) so they are equal, contradiction. If m = 2 n + 1 , then ( ρ 0 ( m ) ρ 1 ( m ) and) ρ 0 m = ρ 1 m is a splitting point of C, however m is odd and C is an even Cantor, a contradiction. So really there is at most one ν , and let ϱ ( η , C ) be the unique ν   p ( η , ν ) C if there is one and η otherwise.
Similarly if C is odd and η ω 2 , then for at most one ν , p ( ν , η ) C and let ϱ ( η , C ) be ν for this η , and let ϱ ( η , C ) = η otherwise. Our definition of the function ϱ does not contradict, because no Cantor is odd and even.
Let for η ω 2 , Dp ( η ) = { ϱ ( η , C i ) : i < α } . So clearly Dp ( η ) is a subset of ω 2 of cardinality | α | .
Now if η , ν ω 2 , by hypothesis ρ = p ( η , ν ) belongs to some C i . If C i is odd this implies ν = ϱ ( η , C i ) Dp ( η ) and if C i is even this implies η = ϱ ( C i , ν ) Dp ( ν ) .
If | α | + < 2 0 we can easily find a counterexample. □
Definition 8.
Assume ¬ ( St ) .
If S n ω are infinite pairwise almost disjoint (for n { 0 , 1 , 2 } ), C i ( i < α < 2 0 ) are Cantors, each an S n -Cantor for some n (or just an S n S 2 -Contor for some n), C is a Cantor for every η C ω > 2 , { 0 , 1 } , there is ν, such that  η ν Sp ( C ) , ν k S k 2 .
Then there is η C \ i < α C i \ ω > 2 .
(2) Similarly for S n ω > 2
Proof. 
(1) We can find a Cantor C C , and 0 = k ( 0 ) < k ( 1 ) < < k ( n ) < < ω :
(∗)
if η k ( n ) 2 , then there are exactly two ν k ( n + 1 ) 2 C , η ν , and if they are ν 1 , ν 2 and m : = min { m : ν 1 ( m ) ν 2 ( m ) } then m S 0 S 1 but S 2 ( S 0 , S 1 ) . Moreover m S 0 if n is even.
Let A = { η k ( n ) : n < ω , η C } , so A C . Clearly there is an isomorphism f, of the models ( ω 2 , ) , ( C , ) .
Let C i = { f ( η ) : η C , η C i } , it is easy to check that each C i is countable, or the union of a countable set and a Cantor which is odd or is even.
We can find odd Cantor C i ( α i < α ω ) all countable sets we mentioned are covered by them. Now by—“ ¬ ( St ) ” there is η ω 2   η i < α ω C i (as α ω < 2 0 ) and f 1 ( η ) is the required elements.
(2) Similarly. □
(Now we have added Claim 5 and Definition 9 in 2019).
Claim 5.
Assume ¬ ( St ) . (1) The monadic theory T is undecidable.
Proof. 
Below let P vary on Cantors and note that we can repeat the proof of [2] with small adaptation (and prove T is undecidable). That is, the change needed is in ([2], (7.4)) which has a set-theoretic hypothesis (CH or the Baire-like hypothesis mentioned above), so we repeat it with the needed changes below. □
Definition 9.
Assume ¬ ( St ) and let J be an index-set of cardinality at most 2 0 , (1) Assume the D i ( i J ) countable dense subsets of ω > 2 and D = i J D i and D ¯ = D i : i J (The main case is that the D i -s are pairwise almost disjoint). Then there is Q ω 2 \ D , Q = Q [ D ¯ ] such that for every Cantor P:
(A) 
if P D D i ( i J ) and D i is dense in P then | P Q | < 2 0
(B) 
if for some i J the sets P D i , P \ D i are dense in P then P Q .
(2) For some such D ¯ we can strengthen clause (B) above to
(B) 
if P is a Cantor and for every i J the set D i P is nowhere-dense in P then for every, dense subsets D 1 * , D 2 * of P D we can find D 1 D 1 * , D 2 D 2 * satisfying for any P we have: is P D 1 , P D 2 are dense in P then P Q .
Proof. 
(1) Let { P α : 0 < α < 2 0 } be any enumeration of the Cantor sets. We define x α , α < 2 0 by induction on α .
For α = 0 , x α R is arbitrary.
For any α > 0 , if P α does not satisfy the assumptions of (B) then let x α = x 0 and if P satisfies the assumptions of (B) (hence in particular D is dense in P) let x α P α { P β : β < α , ( i J ) ( P β D D i and D is dense in P β ) } = D .
This is possible; to prove this let U = { β < α : there is i J such that P β D D i } and for β U let i β J be such that P β D i β Let i ( * ) J be such that P D i ( * ) , P \ D i ( * ) are dense in P. Now we apply Definition 8(2), (or Definition 8(1) if we restrict the D i -s, does not matter).
So by ( St ) and the hypothesis | P α D | < 2 0 there exists such x α .
Now let Q = { x α : α < 2 0 } . If P satisfies the assumptions of (A), then P { P α : 0 < α < 2 0 } . So for some α , P = P α , hence P D { x β : β < α } , so | P D | < 2 0 . If P = P α satisfies the assumption of (B) then x α P α , x α Q , hence P α Q .
(2) Similarly.
So we have proved the lemma. □
Definition 10.
We can interpret the monadic theory of ( R , < ) in T, but the converse was not clear at the time, but looking at it again probably we can carry the proof for R .

Funding

This research received no external funding.

Acknowledgments

The author would like to thank the United States-Israel Binational Science Foundation for partially supporting this research.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hayut, Y.; Unger, S. The strong tree property and weak square. MLQ Math. Log. Q. 2017, 63, 150–154. [Google Scholar] [CrossRef] [Green Version]
  2. Shelah, S. The monadic theory of order. Ann. Math. 1975, 102, 379–419. [Google Scholar]
  3. Shelah, S. Monadic logic and Löwenheim numbers. Ann. Pure Appl. Log. 1985, 28, 203–216. [Google Scholar] [CrossRef] [Green Version]
  4. Andreas, R. Blass and Saharon Shelah. There may be simple Pℵ1- and Pℵ2-points and the Rudin-Keisler ordering may be downward directed. Ann. Pure Appl. Log. 1987, 33, 213–243. [Google Scholar]
  5. Gurevich, Y.; Shelah, S. Monadic theory of order and topology in ZFC. Ann. Math. Log. 1982, 23, 179–198. [Google Scholar] [CrossRef] [Green Version]
  6. Shelah, S. Notes on monadic logic. Part A. Monadic theory of the real line. Israel J. Math. 1988, 63, 335–352. [Google Scholar] [CrossRef]
  7. Geschke, S.; Goldstern, M.; Kojman, M. Continuous Ramsey theory on Polish spaces and covering the plane by functions. J. Math. Log. 2004, 4, 109–145. [Google Scholar] [CrossRef] [Green Version]
  8. Geschke, S.; Kojman, M.; Kubiś, W.; Schipperus, R. Convex decompositions in the plane and continuous pair colorings of the irrationals. Israel J. Math. 2002, 131, 285–317. [Google Scholar] [CrossRef] [Green Version]
  9. Dow, A.; Tall, F.D. Normality versus paracompactness in locally compact spaces. Can. J. Math. 2018, 70, 74–96. [Google Scholar] [CrossRef] [Green Version]
  10. William, G. Fleissner, The normal Moore space conjecture and large cardinals. In Handbook of Set-Theoretic Topology; Elsevier: Amsterdam, The Netherlands, 1984; pp. 733–760. [Google Scholar]
  11. Shelah, S. On Fleissner’s diamond. Notre Dame J. Form. Log. 1981, 22, 29–35. [Google Scholar] [CrossRef]
  12. Smith, K.D.; Szeptycki, P.J. Paranormal spaces under *. Proc. Am. Math. Soc. 2000, 128, 903–908. [Google Scholar] [CrossRef]
  13. Taylor, A.D. Diamond principles, ideals and the normal Moore space problem. Can. J. Math. 1981, 33, 282–296. [Google Scholar] [CrossRef]
  14. Shelah, S. Diamonds. Proc. Am. Math. Soc. 2010, 138, 2151–2161. [Google Scholar] [CrossRef]
  15. Silver, J. The independence of Kurepa’s conjecture and two-cardinal conjectures in model theory. In Axiomatic Set Theory (Proc. Sympos); AMS: Providence, RI, USA, 1971; pp. 383–390. [Google Scholar]
  16. Koszmider, P. Projections in weakly compactly generated Banach spaces and Chang’s conjecture. J. Appl. Anal. 2005, 11, 187–205. [Google Scholar] [CrossRef] [Green Version]
  17. Bartoszyński, T.; Judah, H. Set Theory; A K Peters, Ltd.: Wellesley, MA, USA, 1995. [Google Scholar]
  18. Rabin, M.O. Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 1969, 141, 1–35. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shelah, S. Applying Set Theory. Axioms 2021, 10, 329. https://doi.org/10.3390/axioms10040329

AMA Style

Shelah S. Applying Set Theory. Axioms. 2021; 10(4):329. https://doi.org/10.3390/axioms10040329

Chicago/Turabian Style

Shelah, Saharon. 2021. "Applying Set Theory" Axioms 10, no. 4: 329. https://doi.org/10.3390/axioms10040329

APA Style

Shelah, S. (2021). Applying Set Theory. Axioms, 10(4), 329. https://doi.org/10.3390/axioms10040329

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop