Characterizations of the weakly compact ideal on $P_\kappa\lambda$
Brent Cody

TL;DR
This paper generalizes Hellsten's characterization of $ ext{Pi}^1_n$-indescribability to subsets of $P_\u03bb$, explores associated ideals, introduces $n$-club sets, and connects these concepts to elementary embeddings and large cardinal principles.
Contribution
It extends the characterization of indescribability to $P_\u03bb$, identifies the corresponding ideals, and relates these to elementary embeddings and large cardinal properties.
Findings
The $ ext{Pi}^1_0$-indescribability ideal equals the minimal strongly normal ideal $ ext{NSS}_{,}$.
A set is $ ext{Pi}^1_n$-indescribable iff it intersects every $n$-club subset of $P_\u03bb$.
Connections established between elementary embeddings, ideals, and large cardinal hypotheses.
Abstract
Hellsten \cite{MR2026390} gave a characterization of -indescribable subsets of a -indescribable cardinal in terms of a natural filter base: when is a -indescribable cardinal, a set is -indescribable if and only if for every -club . We generalize Hellsten's characterization to -indescribable subsets of , which were first defined by Baumgartner. After showing that under reasonable assumptions the -indescribability ideal on equals the minimal \emph{strongly} normal ideal on , and is not equal to as may be expected, we formulate a notion of -club subset of and prove that a set is -indescribable if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
