Vopěnka's principle
From Wikipedia the free encyclopedia
In mathematics, Vopěnka's principle is a large cardinal axiom. The intuition behind the axiom is that the set-theoretical universe is so large that in every proper class, some members are similar to others, with this similarity formalized through elementary embeddings.
Vopěnka's principle was first introduced by Petr Vopěnka and independently considered by H. Jerome Keisler, and was written up by Solovay, Reinhardt & Kanamori (1978). According to Pudlák (2013, p. 204), Vopěnka's principle was originally intended as a joke: Vopěnka was apparently unenthusiastic about large cardinals and introduced his principle as a bogus large cardinal property, planning to show later that it was not consistent. However, before publishing his inconsistency proof he found a flaw in it.
Definition[edit]
Vopěnka's principle asserts that for every proper class of binary relations (each with set-sized domain), there is one elementarily embeddable into another. This cannot be stated as a single sentence of ZFC as it involves a quantification over classes. A cardinal κ is called a Vopěnka cardinal if it is inaccessible and Vopěnka's principle holds in the rank Vκ (allowing arbitrary S ⊂ Vκ as "classes"). [1]
Many equivalent formulations are possible. For example, Vopěnka's principle is equivalent to each of the following statements.
- For every proper class of simple directed graphs, there are two members of the class with a homomorphism between them.[2]
- For any signature Σ and any proper class of Σ-structures, there are two members of the class with an elementary embedding between them.[1][2]
- For every predicate P and proper class S of ordinals, there is a non-trivial elementary embedding j:(Vκ, ∈, P) → (Vλ, ∈, P) for some κ and λ in S.[1]
- The category of ordinals cannot be fully embedded in the category of graphs.[2]
- Every subfunctor of an accessible functor is accessible.[2]
- (In a definable classes setting) For every natural number n, there exists a C(n)-extendible cardinal.[3]
Strength[edit]
Even when restricted to predicates and proper classes definable in first order set theory, the principle implies existence of Σn correct extendible cardinals for every n.
If κ is an almost huge cardinal, then a strong form of Vopěnka's principle holds in Vκ:
- There is a κ-complete ultrafilter U such that for every {Ri: i < κ} where each Ri is a binary relation and Ri ∈ Vκ, there is S ∈ U and a non-trivial elementary embedding j: Ra → Rb for every a < b in S.
References[edit]
- ^ a b c Kanamori, Akihiro (2003). The higher infinite: large cardinals in set theory from their beginnings (2nd ed.). Berlin [u.a.]: Springer. ISBN 9783540003847.
- ^ a b c d Rosicky, Jiří Adámek ; Jiří (1994). Locally presentable and accessible categories (Digital print. 2004. ed.). Cambridge [u.a.]: Cambridge Univ. Press. ISBN 0521422612.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Bagaria, Joan (23 December 2011). "C(n)-cardinals". Archive for Mathematical Logic. 51 (3–4): 213–240. doi:10.1007/s00153-011-0261-8. S2CID 208867731.
- Kanamori, Akihiro (1978), "On Vopěnka's and related principles", Logic Colloquium '77 (Proc. Conf., Wrocław, 1977), Stud. Logic Foundations Math., vol. 96, Amsterdam-New York: North-Holland, pp. 145–153, ISBN 0-444-85178-X, MR 0519809
- Pudlák, Pavel (2013), Logical foundations of mathematics and computational complexity. A gentle introduction, Springer Monographs in Mathematics, Springer, doi:10.1007/978-3-319-00119-7, ISBN 978-3-319-00118-0, MR 3076860
- Solovay, Robert M.; Reinhardt, William N.; Kanamori, Akihiro (1978), "Strong axioms of infinity and elementary embeddings" (PDF), Annals of Mathematical Logic, 13 (1): 73–116, doi:10.1016/0003-4843(78)90031-1
External links[edit]
- Friedman, Harvey M. (2005), EMBEDDING AXIOMS gives a number of equivalent definitions of Vopěnka's principle.
 | This set theory-related article is a stub. You can help Wikipedia by expanding it. |