Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-13T02:13:22.912Z Has data issue: false hasContentIssue false
  • English
  • Français

A model in which every Boolean algebra has many subalgebras

Published online by Cambridge University Press:  12 March 2014

James Cummings  and
Saharon Shelah
James Cummings
Affiliation:
Mathematics Institute, Hebrew University of Jerusalem, Givat Ram, 91904 Jerusalem, Israel, E-mail: cummings@math.huji.ac.il
Saharon Shelah
Affiliation:
Mathematics Institute, Hebrew University of Jerusalem, Givat Ram, 91904 Jerusalem, Israel, E-mail: shelah@math.huji.ac.il
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2∣A∣ = 2∣B∣. This implies in particular that B has 2∣B∣ subalgebras. We also discuss some more general problems about subalgebras and free subsets of an algebra.

The result on the number of subalgebras in a Boolean algebra solves a question of Monk from [6]. The paper is intended to be accessible as far as possible to a general audience, in particular we have confined the more technical material to a “black box” at the end. The proof involves a variation on Foreman and Woodin's model in which GCH fails everywhere.

Keywords

Boolean algebrasfree subsetsRadin forcing
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 60 , Issue 3 , September 1995 , pp. 992 - 1004
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baumgartner, J. and Taylor, A., Saturation properties of ideals in generic extensions, I, Transactions of the American Mathematical Society, vol. 270 (1982), pp. 557–574.CrossRefGoogle Scholar
[2]Foreman, M. and Woodin, H., GCH can fail everywhere, Annals of Mathematics, vol. 133 (1991), pp. 1–35.CrossRefGoogle Scholar
[3]Jech, T., Set theory, Academic Press, 1978.Google Scholar
[4]Laver, R., Making the supercompactness of K indestructible under κ-directed-closed forcing, Israel Journal of Mathematics, vol. 29 (1978), pp. 385–388.CrossRefGoogle Scholar
[5]Magidor, M., On the singular cardinals problem I, Israel Journal of Mathematics, vol. 28 (1977), pp. 1–31.CrossRefGoogle Scholar
[6]Monk, J. D., Cardinal functions on Boolean algebras, Birkhaüser, 1990.CrossRefGoogle Scholar
[7]Monk, J. D. and Bonnet, Robert (editors), Handbook of Boolean algebras, North-Holland, 1989.Google Scholar
[8]Radin, L. B., Adding closed cofinal sequences to large cardinals, Annals of Mathematical Logic, vol. 22 (1982), pp. 243–261.CrossRefGoogle Scholar
[9]Shelah, S., Cardinal arithmetic, Oxford University Press, to appear.CrossRefGoogle Scholar