Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Club guessing and the universal models

Mirna Džamonja

TL;DR

This survey synthesizes the Kojman–Shelah club-guessing method and pcf-based invariants to analyze when universal structures fail to exist across diverse mathematical domains, from linear orders to graphs and Banach spaces. It develops a robust framework of invariants tied to filtrations and club-guessing sequences, proves Construction and Preservation lemmas that yield negative universality results, and extends these techniques to singular cardinals and model-theoretic contexts. The paper connects combinatorial set theory with classification theory, analysis, and algebra, delivering a unifying toolkit (including a Representation Theorem) that translates universality questions into invariant- and forcing-driven arguments. It also clarifies the limitations of current forcing approaches and points to key open questions, notably the role of SOP_4 in high non-amenability and the potential for universality-preserving extensions in varied cardinal arithmetic regimes.

Abstract

We survey the use of club guessing and other pcf constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal element. The article was published in 2006. On rereading we noticed a missing parameter in Definition 1.1, which makes the rest the recounting of the Kojman-Shelah incorrect. We correct the (minor) error in this version, changes marked in red.

Club guessing and the universal models

TL;DR

This survey synthesizes the Kojman–Shelah club-guessing method and pcf-based invariants to analyze when universal structures fail to exist across diverse mathematical domains, from linear orders to graphs and Banach spaces. It develops a robust framework of invariants tied to filtrations and club-guessing sequences, proves Construction and Preservation lemmas that yield negative universality results, and extends these techniques to singular cardinals and model-theoretic contexts. The paper connects combinatorial set theory with classification theory, analysis, and algebra, delivering a unifying toolkit (including a Representation Theorem) that translates universality questions into invariant- and forcing-driven arguments. It also clarifies the limitations of current forcing approaches and points to key open questions, notably the role of SOP_4 in high non-amenability and the potential for universality-preserving extensions in varied cardinal arithmetic regimes.

Abstract

We survey the use of club guessing and other pcf constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal element. The article was published in 2006. On rereading we noticed a missing parameter in Definition 1.1, which makes the rest the recounting of the Kojman-Shelah incorrect. We correct the (minor) error in this version, changes marked in red.

Paper Structure

This paper contains 8 sections, 11 theorems, 14 equations.

Table of Contents

  1. Introduction
  2. Invariants and linear orders
  3. A few more words on orders and orderable structures
  4. Model theory
  5. Some applications in analysis and topology
  6. Some applications in algebra
  7. Some applications in graph theory and a representation theorem
  8. Some questions

Key Result

Theorem 1.3

[Shelah, Sh -g] Suppose that $\kappa$ and $\lambda$ are regular cardinals such that $\kappa^+<\lambda$. Then there is a club guessing sequence of the form $\bar{C}=\langle C_\delta:\,\delta\in S^\lambda_\kappa\rangle$.

Theorems & Definitions (22)

  • Definition 1.1
  • Definition 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Theorem 1.5
  • Lemma 1.6
  • Lemma 1.7
  • Theorem 2.1
  • Definition 3.1
  • Theorem 3.2
  • ...and 12 more