Elementary-embedding large-cardinal schema¶
A set-theoretic schema that classifies certain large-cardinal properties by an elementary embedding from V to a transitive class, its critical point, and an explicitly quantified target-model condition.
Core Idea¶
Some large-cardinal properties are characterized by a nontrivial elementary embedding \(j:V\to M\): a map from the set-theoretic universe to a transitive class that preserves and reflects every first-order statement. The least ordinal moved by \(j\) is its critical point. A property then specifies which cardinal occupies that role, what the target \(M\) must contain or be closed under, and whether a suitable embedding is needed once or for every parameter of a specified kind. This reusable pattern is the elementary-embedding large-cardinal schema; it is not itself one more cardinal property.[ref-f4538b0de069][ref-a44706ad2fd1]
For example, bare existence of a suitable embedding with critical point \(\kappa\) characterizes measurability. A Shelah cardinal instead requires, for every \(f:\kappa\to\kappa\), a witness with \(V_{j(f)(\kappa)}\subseteq M\). The frozen discovery candidate was Shelah cardinal; this family-level reframe does not replace a separate Shelah entry or claim that every large cardinal has this exact embedding definition.[ref-f4538b0de069][ref-a44706ad2fd1]
Scope of Application¶
The schema is useful in classical set theory when comparing exact embedding definitions. Strong-cardinal formulations require witnesses at each rank target; supercompactness requires witnesses at each relevant scale with sequence closure; hugeness uses one embedding whose target is closed under sequences of length \(j(\kappa)\). These differences in target condition and quantifier order are essential, not cosmetic.[ref-a44706ad2fd1][ref-4542f55c8e14]
Woodinness is a cautionary extension: one standard characterization uses embeddings with critical point \(\alpha\) below the Woodin cardinal \(\delta\). It is wrong to place Woodinness in a table that silently assumes the named cardinal always equals the critical point.[^ref-a44706ad2fd1]
Clarity¶
The schema asks six concrete questions: What is the source universe? Is the map elementary? What is its critical point? What must \(M\) capture? Which parameters are quantified before choosing the witness? What cardinal property follows? A proof for one favored function \(f\) does not establish a Shelah condition that says for every \(f\) there is a suitable embedding.[^ref-a44706ad2fd1]
It also separates property implication, relative consistency strength and the numerical position of the least witness. Jech notes that huge-cardinal existence is stronger in consistency strength than supercompact-cardinal existence, yet the least huge cardinal can be below the least supercompact if both exist. “Higher” must therefore name its comparison axis.[^ref-4542f55c8e14]
Manages Complexity¶
Instead of memorizing a list of names, one can compare a small table of witness clauses. Measurable has a bare critical-point witness; strong adds rank capture across targets; supercompact adds scale-indexed sequence closure; Shelah adds function-indexed rank capture; huge ties closure to \(j(\kappa)\) in one witness. The table reveals missing proof obligations without pretending all target conditions are interchangeable.[^ref-a44706ad2fd1]
The compression fails if it drops the quantifiers or the location of the critical point. For example, one \(\lambda\)-supercompact witness is not automatically full supercompactness at all \(\lambda\). A good comparison preserves the formula, not just the common arrow \(V\to M\).[^ref-a44706ad2fd1]
Abstract Reasoning¶
To test a proposed Shelah proof, hold \(\kappa\) fixed and take an arbitrary \(f:\kappa\to\kappa\). Seek an elementary \(j_f:V\to M_f\) with \(\operatorname{crit}(j_f)=\kappa\) and \(V_{j_f(f)(\kappa)}\subseteq M_f\). Only after the construction works for every such \(f\) does it meet the cited definition. A single example of \(f\) or a weaker rank segment leaves the argument incomplete.[^ref-a44706ad2fd1]
The same audit applies to another named property: write the exact quantifiers, map, critical point and target clause, then compare them with the theorem being invoked. A shared diagram can suggest an implication, but a changed capture condition requires proof rather than verbal ranking.[ref-a44706ad2fd1][ref-4542f55c8e14]
Knowledge Transfer¶
The checklist transfers literally within set theory—from ultrafilter and ultrapower descriptions to rank-capture, sequence-closure and extender-based characterizations—provided their equivalences and hypotheses are established. It helps reveal where a proposed new definition differs from an accepted one.[ref-a44706ad2fd1][ref-4542f55c8e14]
The live prime Embedding supplies the broader idea of a faithful structure-preserving map. Yet \(V\), transitive inner classes, critical points and rank segments remain set-theoretic. A machine-learning or software embedding does not become a large-cardinal witness by analogy. This schema is therefore domain-specific and provisionally presupposes the Embedding prime; the DAG relation.
[^ref-a44706ad2fd1]: Asaf Karagila, Lecture Notes: Large Cardinals, updated April 13, 2026, Definition 4.1, Definition 5.4, Definition 5.11, Corollary 6.19 and Definition 7.1. https://karagila.org/files/LC-2025.pdf [^ref-f4538b0de069]: Rohan Srivastava, “The Landscape of Large Cardinals” (2022), §5 and Proposition 5.4. https://cpb-us-w2.wpmucdn.com/sites.wustl.edu/dist/7/3279/files/2022/04/The_Landscape_of_Large_Cardinals___Rohan_Srivastava-2.pdf [^ref-4542f55c8e14]: Thomas Jech, Set Theory, Chapter 20, “Very Large Cardinals,” PDF pp.9,16–17. https://fa.ewi.tudelft.nl/~hart/onderwijs/set_theory/Jech/20-very_large_cardinals.pdf
Relationships to Other Abstractions¶
Current abstraction Elementary-embedding large-cardinal schema Domain-specific
Parents (1) — more general patterns this builds on
-
Elementary-embedding large-cardinal schema presupposes Embedding Prime
Every instance requires a truth-preserving elementary embedding; the schema adds set-theoretic critical-point, target, and quantifier conditions.
Hierarchy path (1) — routes to 1 parentless root
- Elementary-embedding large-cardinal schema → Embedding → Representation → Abstraction
Neighborhood in Abstraction Space¶
Elementary-embedding large-cardinal schema sits in a moderately populated region (53rd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Property Ontology & Code Smells (18 abstractions)
Nearest neighbors
- Intuitionistic Type Theory — 0.86
- Peirce's Law — 0.86
- Lindström quantifier — 0.85
- Maharam Algebra — 0.85
- Quantifier Shift — 0.85
Computed from structural-signature embeddings · 2026-10-08