Indescribable cardinal

Last updated

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).

Contents

A cardinal number is called -indescribable if for every proposition , and set with there exists an with . [1] Following Lévy's hierarchy, here one looks at formulas with m-1 alternations of quantifiers with the outermost quantifier being universal. -indescribable cardinals are defined in a similar way, but with an outermost existential quantifier. Prior to defining the structure , one new predicate symbol is added to the language of set theory, which is interpreted as . [2] The idea is that cannot be distinguished (looking from below) from smaller cardinals by any formula of n+1-th order logic with m-1 alternations of quantifiers even with the advantage of an extra unary predicate symbol (for A). This implies that it is large because it means that there must be many smaller cardinals with similar properties. [ citation needed ]

The cardinal number is called totally indescribable if it is -indescribable for all positive integers m and n.

If is an ordinal, the cardinal number is called -indescribable if for every formula and every subset of such that holds in there is a some such that holds in . If is infinite then -indescribable ordinals are totally indescribable, and if is finite they are the same as -indescribable ordinals. There is no that is -indescribable, nor does -indescribability necessarily imply -indescribability for any , but there is an alternative notion of shrewd cardinals that makes sense when : if holds in , then there are and such that holds in . [3] However, it is possible that a cardinal is -indescribable for much greater than . [1] Ch. 9, theorem 4.3

Historical note

Originally, a cardinal κ was called Q-indescribable if for every Q-formula and relation , if then there exists an such that . [4] [5] Using this definition, is -indescribable iff is regular and greater than . [5] p.207 The cardinals satisfying the above version based on the cumulative hierarchy were called strongly Q-indescribable. [6] This property has also been referred to as "ordinal -indescribability". [7] p.32

Equivalent conditions

A cardinal is -indescribable iff it is -indescribable. [8] A cardinal is inaccessible if and only if it is -indescribable for all positive integers , equivalently iff it is -indescribable, equivalently if it is -indescribable.

-indescribable cardinals are the same as weakly compact cardinals.

The indescribability condition is equivalent to satisfying the reflection principle (which is provable in ZFC), but extended by allowing higher-order formulae with a second-order free variable. [8]

For cardinals , say that an elementary embedding a small embedding if is transitive and . For any natural number , is -indescribable iff there is an such that for all there is a small embedding such that . [9] , Corollary 4.3

If V=L, then for a natural number n>0, an uncountable cardinal is Π1
n
-indescribable iff it's (n+1)-stationary. [10]

Enforceable classes

For a class of ordinals and a -indescribable cardinal , is said to be enforced at (by some formula of ) if there is a -formula and an such that , but for no with does hold. [1] p.277This gives a tool to show necessary properties of indescribable cardinals.

Properties

The property of being -indescribable is over , i.e. there is a sentence that satisfies iff is -indescribable. [11] For , the property of being -indescribable is and the property of being -indescribable is . [11] Thus, for , every cardinal that is either -indescribable or -indescribable is both -indescribable and -indescribable and the set of such cardinals below it is stationary. The consistency strength of -indescribable cardinals is below that of -indescribable, but for it is consistent with ZFC that the least -indescribable exists and is above the least -indescribable cardinal (this is proved from consistency of ZFC with -indescribable cardinal and a -indescribable cardinal above it).[ citation needed ]

Totally indescribable cardinals remain totally indescribable in the constructible universe and in other canonical inner models, and similarly for - and -indescribability.

For natural number , if a cardinal is -indescribable, there is an ordinal such that , where denotes elementary equivalence. [12] For this is a biconditional (see Two model-theoretic characterisations of inaccessibility).

Measurable cardinals are -indescribable, but the smallest measurable cardinal is not -indescribable. However, assuming choice, there are many totally indescribable cardinals below any measurable cardinal.

For , ZFC+"there is a -indescribable cardinal" is equiconsistent with ZFC+"there is a -indescribable cardinal such that ", i.e. "GCH fails at a -indescribable cardinal". [8]

Related Research Articles

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal κ is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than κ cardinals smaller than κ, and implies .

In set theory, a Woodin cardinal is a cardinal number such that for all functions , there exists a cardinal with and an elementary embedding from the Von Neumann universe into a transitive inner model with critical point and .

In set theory, a supercompact cardinal is a type of large cardinal independently introduced by Solovay and Reinhardt. They display a variety of reflection properties.

In mathematics, in set theory, the constructible universe, denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy. It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis". In this paper, he proved that the constructible universe is an inner model of ZF set theory, and also that the axiom of choice and the generalized continuum hypothesis are true in the constructible universe. This shows that both propositions are consistent with the basic axioms of set theory, if ZF itself is consistent. Since many other theorems only hold in systems in which one or both of the propositions is true, their consistency is an important result.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that is a regular cardinal if and only if every unbounded subset has cardinality . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular.

The Gram–Charlier A series, and the Edgeworth series are series that approximate a probability distribution in terms of its cumulants. The series are the same; but, the arrangement of terms differ. The key idea of these expansions is to write the characteristic function of the distribution whose probability density function f is to be approximated in terms of the characteristic function of a distribution with known and suitable properties, and to recover f through the inverse Fourier transform.

In set theory, a branch of mathematics, a reflection principle says that it is possible to find sets that, with respect to any given property, resemble the class of all sets. There are several different forms of the reflection principle depending on exactly what is meant by "resemble". Weak forms of the reflection principle are theorems of ZF set theory due to Montague (1961), while stronger forms can be new and very powerful axioms for set theory.

In theoretical physics, a source field is a background field coupled to the original field as

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not ; various more-concrete ways of defining ordinals that definitely have notations are available.

The Newman–Penrose (NP) formalism is a set of notation developed by Ezra T. Newman and Roger Penrose for general relativity (GR). Their notation is an effort to treat general relativity in terms of spinor notation, which introduces complex forms of the usual variables used in GR. The NP formalism is itself a special case of the tetrad formalism, where the tensors of the theory are projected onto a complete vector basis at each point in spacetime. Usually this vector basis is chosen to reflect some symmetry of the spacetime, leading to simplified expressions for physical observables. In the case of the NP formalism, the vector basis chosen is a null tetrad: a set of four null vectors—two real, and a complex-conjugate pair. The two real members often asymptotically point radially inward and radially outward, and the formalism is well adapted to treatment of the propagation of radiation in curved spacetime. The Weyl scalars, derived from the Weyl tensor, are often used. In particular, it can be shown that one of these scalars— in the appropriate frame—encodes the outgoing gravitational radiation of an asymptotically flat system.

In the Newman–Penrose (NP) formalism of general relativity, Weyl scalars refer to a set of five complex scalars which encode the ten independent components of the Weyl tensor of a four-dimensional spacetime.

In proof theory, ordinal analysis assigns ordinals to mathematical theories as a measure of their strength. If theories have the same proof-theoretic ordinal they are often equiconsistent, and if one theory has a larger proof-theoretic ordinal than another it can often prove the consistency of the second theory.

In mathematical logic and set theory, an ordinal collapsing function is a technique for defining certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals, and then "collapse" them down to a system of notations for the sought-after ordinal. For this reason, ordinal collapsing functions are described as an impredicative manner of naming ordinals.

In set theory, an extender is a system of ultrafilters which represents an elementary embedding witnessing large cardinal properties. A nonprincipal ultrafilter is the most basic case of an extender.

In set theory and mathematical logic, the Lévy hierarchy, introduced by Azriel Lévy in 1965, is a hierarchy of formulas in the formal language of the Zermelo–Fraenkel set theory, which is typically called just the language of set theory. This is analogous to the arithmetical hierarchy, which provides a similar classification for sentences of the language of arithmetic.

The table of chords, created by the Greek astronomer, geometer, and geographer Ptolemy in Egypt during the 2nd century AD, is a trigonometric table in Book I, chapter 11 of Ptolemy's Almagest, a treatise on mathematical astronomy. It is essentially equivalent to a table of values of the sine function. It was the earliest trigonometric table extensive enough for many practical purposes, including those of astronomy. Since the 8th and 9th centuries, the sine and other trigonometric functions have been used in Islamic mathematics and astronomy, reforming the production of sine tables. Khwarizmi and Habash al-Hasib later produced a set of trigonometric tables.

A non-expanding horizon (NEH) is an enclosed null surface whose intrinsic structure is preserved. An NEH is the geometric prototype of an isolated horizon which describes a black hole in equilibrium with its exterior from the quasilocal perspective. It is based on the concept and geometry of NEHs that the two quasilocal definitions of black holes, weakly isolated horizons and isolated horizons, are developed.

In the Newman–Penrose (NP) formalism of general relativity, independent components of the Ricci tensors of a four-dimensional spacetime are encoded into seven Ricci scalars which consist of three real scalars , three complex scalars and the NP curvature scalar . Physically, Ricci-NP scalars are related with the energy–momentum distribution of the spacetime due to Einstein's field equation.

In mathematics, Rathjen's  psi function is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals to generate large countable ordinals. A weakly Mahlo cardinal is a cardinal such that the set of regular cardinals below is closed under . Rathjen uses this to diagonalise over the weakly inaccessible hierarchy.

References

Citations

  1. 1 2 3 Drake, F. R. (1974). Set Theory: An Introduction to Large Cardinals (Studies in Logic and the Foundations of Mathematics ; V. 76). Elsevier Science Ltd. ISBN   0-444-10535-2.
  2. Jech, Thomas (2006). Set Theory: The Third Millennium Edition, revised and expanded. Springer Monographs in Mathematics. p. 295. doi:10.1007/3-540-44761-X. ISBN   3-540-44085-2.
  3. M. Rathjen, "The Higher Infinite in Proof Theory" (1995), p.20. Archived 14 January 2024.
  4. K. Kunen, "Indescribability and the Continuum" (1971). Appearing in Axiomatic Set Theory: Proceedings of Symposia in Pure Mathematics, vol. 13 part 1, pp.199--203
  5. 1 2 Azriel Lévy, "The Sizes of the Indescribable Cardinals" (1971). Appearing in Axiomatic Set Theory: Proceedings of Symposia in Pure Mathematics, vol. 13 part 1, pp.205--218
  6. Richter, Wayne; Aczel, Peter (1974). "Inductive Definitions and Reflecting Properties of Admissible Ordinals". Studies in Logic and the Foundations of Mathematics. 79: 301–381. doi:10.1016/S0049-237X(08)70592-5. hdl: 10852/44063 .
  7. W. Boos, "Lectures on large cardinal axioms". In Logic Conference, Kiel 1974. Lecture Notes in Mathematics 499 (1975).
  8. 1 2 3 Hauser, Kai (1991). "Indescribable Cardinals and Elementary Embeddings". Journal of Symbolic Logic. 56 (2): 439–457. doi:10.2307/2274692. JSTOR   2274692.
  9. Holy, Peter; Lücke, Philipp; Njegomir, Ana (2019). "Small embedding characterizations for large cardinals". Annals of Pure and Applied Logic. 170 (2): 251–271. arXiv: 1708.06103 . doi: 10.1016/j.apal.2018.10.002 .
  10. Bagaria, Joan; Magidor, Menachem; Sakai, Hiroshi (2015). "Reflection and indescribability in the constructible universe". Israel Journal of Mathematics . 208: 1–11. doi:10.1007/s11856-015-1191-7.
  11. 1 2 Kanamori, Akihiro (2003). The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings (2nd ed.). Springer. p. 64. doi:10.1007/978-3-540-88867-3_2. ISBN   3-540-00384-3.
  12. W. N. Reinhardt, "Ackermann's set theory equals ZF", pp.234--235. Annals of Mathematical Logic vol. 2, iss. 2 (1970).