Christoph Weiß's paper 'The combinatorial essence of supercompactness' introduced the two-cardinal combinatorial principles TP, SP, ITP and ISP, which characterize strong compactness and supercompactness at inaccessible cardinals yet remain meaningful at successors. Its Conclusion (Section 6) states a single motivating open problem: 'the quest for an inner model for a supercompact cardinal' — construct a canonical (fine-structural) inner model of ZFC containing a supercompact cardinal. Two related calibration questions are suggested by the paper but are not posed in it as open problems: the exact consistency strength of the principles ITP(κ,λ) and ISP(κ,λ) at successor cardinals (the abstract calls the forcing upper bounds — an ineffable cardinal for ISP(ω₂,ω₂); a supercompact cardinal for ISP(ω₂,λ) for all λ — 'supposedly optimal', and the inner-model lower bounds — an inner model with a proper class of strong and Woodin cardinals, via failure of weak square — 'the best currently known'), and the exact consistency strength of the Proper Forcing Axiom (PFA), which implies ISP(ω₂) (the Conclusion describes the Viale–Weiß iteration theorems as 'strong heuristic evidence on the lower bound of the consistency strength of PFA'). As of August 2026 the inner model problem is open: the inner-model frontier has reached fine structure for mice at the level of κ⁺-supercompactness and no canonical inner model with a supercompact cardinal has been constructed; the best general lower bound for the combinatorial principles is unchanged since 2009, and PFA's strength remains bracketed between the consistency of AD_R with regular Θ and a supercompact cardinal.
Background
A cardinal is supercompact if for every there is an elementary embedding into a transitive class with critical point such that and is closed under -sequences; is strongly compact if every -complete filter on any set extends to a -complete ultrafilter. Both notions far exceed measurability, and both admit purely combinatorial reformulations. Write . A -list is a sequence with . A set is an ineffable branch of if for all in some stationary subset of , and a cofinal branch if every is contained in some with . The list is thin if there is a club such that for every the set of traces at , , has size (automatic when is inaccessible, since then for every ), and slender if for all sufficiently large (where is the collection of sets whose transitive closure has size ) there is a club with for all and . Weiß defined: TP(κ,λ), every thin list has a cofinal branch; SP(κ,λ), every slender list has a cofinal branch; ITP(κ,λ) (the ineffable tree property), every thin list has an ineffable branch; ISP(κ,λ), every slender list has an ineffable branch. At inaccessible these recover the large cardinal hierarchy: is strongly compact iff TP(κ,λ) holds for all (a reformulation of a classical characterization via cofinal branches), and is supercompact iff ITP(κ,λ) holds for all (Magidor's combinatorial characterization of supercompactness). The point of the definitions is that, unlike the original characterizations, TP/SP/ITP/ISP remain non-vacuous at successor cardinals, so one can ask how much of the combinatorial content of strong compactness and supercompactness can be forced down to small cardinals such as . Weiß proved two-sided estimates. Upper bounds by Mitchell-style forcing iterations with the -approximation and covering properties (a forcing has the -covering property if every set of ordinals of size in the extension is contained in a ground-model set of size , and the -approximation property if a set of ordinals of the extension is in the ground model whenever its intersections with all -small ground-model sets are): if an ineffable cardinal exists then ISP(ω₂,ω₂) is consistent, and if a supercompact cardinal exists then ISP(ω₂,λ) is consistent for every . Lower bounds by anti-square arguments: when , ITP(κ,λ) implies the failure of the weak two-cardinal square principle , which asserts a coherent, unthreadable system : each is a family of fewer than many club subsets of , the system coheres in the sense that whenever is a limit point of , and there is no thread, i.e. no club with for all limit points of of cofinality . The failure of square at a regular with for all yields, by the Jensen–Schimmerling–Schindler–Steel 'stacking mice' theorem, an inner model — indeed a sharp — with a proper class of strong cardinals and a proper class of Woodin cardinals. Weiß also showed ITP(κ,κ) implies is ineffable in (Gödel's constructible universe), so even the smallest instance carries real strength. The Proper Forcing Axiom (PFA) asserts that for every proper forcing notion (one preserving stationary subsets of for every uncountable cardinal ; in particular, proper forcings do not collapse ) and every family of dense subsets of there is a filter meeting them all; it is forced by collapsing a supercompact cardinal to and is the central forcing axiom of the hierarchy. Viale and Weiß proved that PFA implies ISP(ω₂) — i.e. ISP(ω₂,λ) for all — and that any standard proper iteration forcing PFA must start from a universe where the collapsed cardinal is supercompact, heuristic evidence that a supercompact is the true consistency strength of PFA. An inner model of ZFC is a transitive proper class containing all ordinals and satisfying ZFC; the canonical ('fine-structural') ones are the mice — models built level by level from extenders (fragments of elementary embeddings coding large cardinal structure) with a definability structure that supports the comparison method, in which two such models are iterated to a common model without conflict, yielding canonicity and covering theorems. The inner model program has produced canonical inner models with Woodin cardinals and, at its current frontier, a fine-structural theory of mice with long extenders reaching only the level of -supercompactness; the construction of a canonical inner model with a fully supercompact cardinal — Weiß's stated main motivation — remains unsolved, and Woodin has argued (Suitable Extender Models, Ultimate-L) that its solution would yield an 'Ultimate-L' but that current approaches must be fundamentally altered to achieve it.
Problem Statement
The problem is the one stated in the Conclusion (Section 6) of Weiß's 'The combinatorial essence of supercompactness' (2012), which the paper names as 'the main motivation behind the principles we considered'.
Construct an inner model for a supercompact cardinal: build a canonical, fine-structural inner model of ZFC (a mouse / suitable extender model in the sense of the inner model program, i.e. a model built from extenders whose iterates compare without conflict) that contains a supercompact cardinal; equivalently, show that the existence of a supercompact cardinal is witnessed by a canonical inner model, in the sense in which canonical inner models are known for Woodin cardinals.
Related calibration questions — suggested by the source's hedges and remarks, but not stated by the source as open problems and not required parts of a solution of the problem above: (a) determine the exact consistency strength of the principles ITP(κ,λ) and ISP(κ,λ) when κ is a successor cardinal — closing the gap between the forcing upper bounds (an ineffable cardinal for ISP(ω₂,ω₂), a supercompact cardinal for ISP(ω₂,λ) for all λ ≥ ω₂; the source notes that ω₂ serves only as the minimal instance and that one can take successors of larger regular cardinals instead) and the inner-model lower bounds obtained via the failure of weak square and the Jensen–Schimmerling–Schindler–Steel stacking-mice theorem (an inner model with a proper class of strong cardinals and a proper class of Woodin cardinals) — including whether the upper-bound hypotheses are optimal (the source proves they are optimal only relative to its Mitchell-style forcing method, via pullback under the approximation and covering properties); and (b) determine the exact consistency strength of the Proper Forcing Axiom in terms of these two-cardinal ineffability principles — PFA implies ISP(ω₂), every standard proper iteration forcing PFA starts from a supercompact cardinal, and the best current lower bound is the consistency of ZF + AD_R + 'Θ is regular'. Is a supercompact cardinal (or any specific large-cardinal hypothesis) equiconsistent with PFA? Progress on these calibration questions advances the surrounding program; the source's stated problem is the inner model construction above.
References
- Christoph Weiß, "The combinatorial essence of supercompactness", Annals of Pure and Applied Logic 163(11) (2012) 1710–1717. DOI 10.1016/j.apal.2011.12.017 (preprint arXiv:1012.2040). https://doi.org/10.1016/j.apal.2011.12.017
- Matteo Viale, Christoph Weiß, "On the consistency strength of the proper forcing axiom", Advances in Mathematics 228(5) (2011) 2672–2687. DOI 10.1016/j.aim.2011.07.016. https://doi.org/10.1016/j.aim.2011.07.016
- Ronald Jensen, Ernest Schimmerling, Ralf Schindler, John Steel, "Stacking mice", Journal of Symbolic Logic 74(1) (2009) 315–335. DOI 10.2178/jsl/1231082314. https://doi.org/10.2178/jsl/1231082314
- Menachem Magidor, "Combinatorial characterization of supercompact cardinals", Proceedings of the American Mathematical Society 42(1) (1974) 279–285. DOI 10.1090/S0002-9939-1974-0327518-9. https://doi.org/10.1090/S0002-9939-1974-0327518-9
- W. Hugh Woodin, "Suitable extender models I", Journal of Mathematical Logic 10(1–2) (2010) 101–339. DOI 10.1142/S021906131000095X. https://doi.org/10.1142/S021906131000095X
- W. Hugh Woodin, "In search of Ultimate-L: the 19th Midrasha Mathematicae lectures", Bulletin of Symbolic Logic 23(1) (2017) 1–109. DOI 10.1017/bsl.2016.34. https://doi.org/10.1017/bsl.2016.34
- Gabriel Goldberg, "The Ultrapower Axiom", De Gruyter (2022), ISBN 978-3-11-071973-4. DOI 10.1515/9783110719734 (preprint arXiv:2006.03293). https://doi.org/10.1515/9783110719734
- Farmer Schlutzenberg, "The initial segment condition for κ⁺-supercompactness", preprint (2023), arXiv:2306.13827. https://arxiv.org/abs/2306.13827
- Farmer Schlutzenberg, "Full normalization for κ⁺-supercompactness", preprint (2025), arXiv:2506.08287. https://arxiv.org/abs/2506.08287
- John R. Steel, "The comparison lemma", Annals of Pure and Applied Logic 175(1) (2024) 103329. DOI 10.1016/j.apal.2023.103329. https://doi.org/10.1016/j.apal.2023.103329
- Laura Fontanella, "The strong tree property at successors of singular cardinals", Journal of Symbolic Logic 79(1) (2014) 193–207. DOI 10.1017/jsl.2013.3. https://doi.org/10.1017/jsl.2013.3
- Sherwood Hachtman, Dima Sinapova, "ITP, ISP, and SCH", Journal of Symbolic Logic 84(2) (2019) 713–725. DOI 10.1017/jsl.2019.2. https://doi.org/10.1017/jsl.2019.2
- Sherwood Hachtman, Dima Sinapova, "The super tree property at the successor of a singular", Israel Journal of Mathematics 236(1) (2020) 473–500. DOI 10.1007/s11856-020-2000-5. https://doi.org/10.1007/s11856-020-2000-5
- James Cummings, Yair Hayut, Menachem Magidor, Itay Neeman, Dima Sinapova, Spencer Unger, "The ineffable tree property and failure of the singular cardinals hypothesis", Transactions of the American Mathematical Society 373(8) (2020) 5937–5955. DOI 10.1090/tran/8110. https://doi.org/10.1090/tran/8110
- William Adkisson, "The strong and super tree properties at successors of singular cardinals", Journal of Symbolic Logic 89(3) (2024) 1251–1283. DOI 10.1017/jsl.2023.96. https://doi.org/10.1017/jsl.2023.96
- William Adkisson, "Strong tree properties along many segments of successors of singulars", preprint (2026), arXiv:2608.07689. https://arxiv.org/abs/2608.07689
- Sy-David Friedman, Peter Holy, "A quasi-lower bound on the consistency strength of PFA", Transactions of the American Mathematical Society 366(8) (2014) 4021–4065. DOI 10.1090/S0002-9947-2014-05955-2. https://doi.org/10.1090/S0002-9947-2014-05955-2
- Nam Trang, "PFA and guessing models", Israel Journal of Mathematics 215(2) (2016) 607–667. DOI 10.1007/s11856-016-1390-x. https://doi.org/10.1007/s11856-016-1390-x
- John Krueger, "Guessing models imply the singular cardinal hypothesis", Proceedings of the American Mathematical Society 147(12) (2019) 5427–5434. DOI 10.1090/proc/14739. https://doi.org/10.1090/proc/14739
- Douglas Blue, Paul Larson, Grigor Sargsyan, "The failure of square at all uncountable cardinals is weaker than a Woodin limit of Woodin cardinals", preprint (2026), arXiv:2602.13077. https://arxiv.org/abs/2602.13077
- Matteo Viale, "Guessing models and generalized Laver diamond", Annals of Pure and Applied Logic 163(11) (2012) 1660–1678. DOI 10.1016/j.apal.2011.12.015. https://doi.org/10.1016/j.apal.2011.12.015
- Radek Honzik, Chris Lambie-Hanson, Šárka Stejskalová, "Indestructibility of some compactness principles over models of PFA", Annals of Pure and Applied Logic 175(1) (2024) 103359. DOI 10.1016/j.apal.2023.103359. https://doi.org/10.1016/j.apal.2023.103359
- Chris Lambie-Hanson, Šárka Stejskalová, "Almost Kurepa Suslin trees and destructibility of the Guessing Model Property", preprint (2026), arXiv:2603.10539. https://arxiv.org/abs/2603.10539
- Rahman Mohammadpour, "A road to compactness through guessing models", survey preprint (2022, revised 2024), arXiv:2210.02514. https://arxiv.org/abs/2210.02514