Skip to main content
Log in

Representability and compactness for pseudopowers

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We prove a compactness theorem for pseudopower operations of the form \({{\,\mathrm{pp}\,}}_{\Gamma (\mu ,\sigma )}(\mu )\) where \(\aleph _0<\sigma ={{\,\mathrm{cf}\,}}(\sigma )\le {{\,\mathrm{cf}\,}}(\mu )\). Our main tool is a result that has Shelah’s cov versus pp Theorem as a consequence. We also show that the failure of compactness in other situations has significant consequences for pcf theory, in particular, implying the existence of a progressive set A of regular cardinals for which \({{\,\mathrm{pcf}\,}}(A)\) has an inaccessible accumulation point.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. This follows easily from work of Shelah; see Corollary 6.3 in this paper.

  2. The original proof of the cov vs. pp Theorem (Theorem 5.4 of Chapter III of [8]) is perfectly fine, although it has a weaker conclusion and the methods do not seem to give the applications we derive here. That proof was also written before the existence of generators was proved, so it can also be simplified quite a bit.

  3. This is standard pcf theory: see Theorem 4.4 of [1], and use the fact that \(\lambda =\max {{\,\mathrm{pcf}\,}}(B_\lambda [A])\).

  4. This appears in published form at the end of the book [8], but the document – known as [E:12] – has been updated many times, and is available on Shelah’s Archive.

  5. See also the last section of [5].

  6. To get a positive answer to Question 1, just take \(\sigma ={{\,\mathrm{cf}\,}}(\mu )\) in Theorem 6.8.

References

  1. Abraham, U., Magidor, M.: Cardinal arithmetic. In: Handbook of Set Theory, vol. 1–3, pp. 1149–1227. Springer, Dordrecht (2010)

  2. Foreman, M., Kanamori, A. (eds.) Handbook of Set Theory, vol. 1–3. Springer, Dordrecht (2010)

  3. Holz, M., Steffens, K., Weitz, E.: Introduction to cardinal arithmetic. Birkhäuser Advanced Texts: Basler Lehrbücher. [Birkhäuser Advanced Texts: Basel Textbooks]. Birkhäuser Verlag, Basel (1999)

  4. Kojman, M.: The A,B,C of pcf: a companion to pcf theory, part I (Unpublished). arXiv:math/9512201

  5. Shelah, S.: Advances in cardinal arithmetic. In: Sauer, N.W., et al. (eds) Finite and Infinite Combinatorics in Sets and Logic, pp. 355–383. Kluwer Academic Publishers (1993). arxiv:0708.1979

  6. Shelah, S.: Advanced: cofinalities of small reduced products. In: Dov, M., Gabbay, A.M., Dana, S. (eds.) Cardinal Arithmetic, volume 29 of Oxford Logic Guides. Oxford University Press, Oxford (1994)

    Google Scholar 

  7. Shelah, S.: \(\aleph _{\omega +1}\) has a Jonsson Algebra. In: Dov, M., Gabbay, A.M., Dana, S. (eds.) Cardinal Arithmetic, volume 29 of Oxford Logic Guides. Oxford University Press, Oxford (1994)

    Google Scholar 

  8. Shelah, Saharon: Cardinal Arithmetic, volume 29 of Oxford Logic Guides. Oxford University Press, Oxford (1994)

    Google Scholar 

  9. Shelah, Saharon: Cardinal Arithmetic. In: Dov, M., Gabbay, A.M., Dana, S. (eds.) Cardinal Arithmetic, volume 29 of Oxford Logic Guides. Oxford University Press, Oxford (1994)

    Google Scholar 

  10. Shelah, S.: Further cardinal arithmetic. Israel J. Math. 95, 61–114 (1996). arXiv:math.LO/9610226

  11. Shelah, S.: On what I do not understand (and have something to say). I. Fund. Math. 166(1–2), 1–82 (2000). (Saharon Shelah’s anniversary issue)

  12. Shelah, S.: The generalized continuum hypothesis revisited. Israel J. Math. 116, 285–321 (2000). arXiv:math/9809200

    Article  MathSciNet  Google Scholar 

  13. Shelah, S.: PCF and infinite free subsets in an algebra. Arch. Math. Logic 41, 321–359 (2002). arXiv:math.LO/9807177

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Todd Eisworth.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eisworth, T. Representability and compactness for pseudopowers. Arch. Math. Logic 61, 55–80 (2022). https://doi.org/10.1007/s00153-021-00780-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-021-00780-9

Keywords

Mathematics Subject Classification

Navigation