U-rank

Last updated November 22, 2021

In model theory, a branch of mathematical logic, U-rank is one measure of the complexity of a (complete) type, in the context of stable theories. As usual, higher U-rank indicates less restriction, and the existence of a U-rank for all types over all sets is equivalent to an important model-theoretic condition: in this case, superstability.

Definition

U-rank is defined inductively, as follows, for any (complete) n-type p over any set A:

U(p) ≥ 0
If δ is a limit ordinal, then U(p) ≥ δ precisely when U(p) ≥ α for all α less than δ
For any α = β + 1, U(p) ≥ α precisely when there is a forking extension q of p with U(q) ≥ β

We say that U(p) = α when the U(p) ≥ α but not U(p) ≥ α + 1.

If U(p) ≥ α for all ordinals α, we say the U-rank is unbounded, or U(p) = ∞.

Note: U-rank is formally denoted $U_{n}(p)$ , where p is really p(x), and x is a tuple of variables of length n. This subscript is typically omitted when no confusion can result.

Ranking theories

U-rank is monotone in its domain. That is, suppose p is a complete type over A and B is a subset of A. Then for q the restriction of p to B, U(q) ≥ U(p).

If we take B (above) to be empty, then we get the following: if there is an n-type p, over some set of parameters, with rank at least α, then there is a type over the empty set of rank at least α. Thus, we can define, for a complete (stable) theory T, $U_{n}(T)=\sup\{U_{n}(p):p\in S(T)\}$ .

We then get a concise characterization of superstability; a stable theory T is superstable if and only if $U_{n}(T)<\infty$ for every n.

Properties

As noted above, U-rank is monotone in its domain.
If p has U-rank α, then for any β < α, there is a forking extension q of p with U-rank β.
If p is the type of b over A, there is some set B extending A, with q the type of b over B.
If p is unranked (that is, p has U-rank ∞), then there is a forking extension q of p which is also unranked.
Even in the absence of superstability, there is an ordinal β which is the maximum rank of all ranked types, and for any α < β, there is a type p of rank α, and if the rank of p is greater than β, then it must be ∞.

Examples

U(p) > 0 precisely when p is nonalgebraic.
If T is the theory of algebraically closed fields (of any fixed characteristic) then $U_{1}(T)=1$ . Further, if A is any set of parameters and K is the field generated by A, then a 1-type p over A has rank 1 if (all realizations of) p are transcendental over K, and 0 otherwise. More generally, an n-type p over A has U-rank k, the transcendence degree (over K) of any realization of it.

Related Research Articles

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

In mathematics, in set theory, the constructible universe, denoted by L, is a particular class of sets that can be described entirely in terms of simpler sets. L is the union of the constructible hierarchyL_α . 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, 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.

The von Neumann cardinal assignment is a cardinal assignment that uses ordinal numbers. For a well-orderable set U, we define its cardinal number to be the smallest ordinal number equinumerous to U, using the von Neumann definition of an ordinal number. More precisely:

In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written $, where is the second Hebrew letter (beth). The beth numbers are related to the aleph numbers, but unless the generalized continuum hypothesis is true, there are numbers indexed by that are not indexed by .$

In axiomatic set theory, a function f : Ord → Ord is called normal if and only if it is continuous and strictly monotonically increasing. This is equivalent to the following two conditions:

For every limit ordinal γ, f(γ) = sup {f(ν) : ν < γ}.
For all ordinals α < β, f(α) < f(β).

In mathematics, Hausdorff measure is a generalization of the traditional notions of area and volume to non-integer dimensions, specifically fractals and their Hausdorff dimensions. It is a type of outer measure, named for Felix Hausdorff, that assigns a number in [0,∞] to each set in $or, more generally, in any metric space.$

In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled "New Foundations for Mathematical Logic"; hence the name. Much of this entry discusses NFU, an important variant of NF due to Jensen (1969) and exposited in Holmes (1998). In 1940 and in a revision of 1951, Quine introduced an extension of NF sometimes called "Mathematical Logic" or "ML", that included proper classes as well as sets.

In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets. It states that if X is a non-empty chain complete poset, and $such that for all then f has a fixed point. Such a function f is called inflationary or progressive .$

The Kripke–Platek set theory (KP), pronounced, is an axiomatic set theory developed by Saul Kripke and Richard Platek.

In mathematics, a matrix norm is a vector norm in a vector space whose elements (vectors) are matrices.

In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit well-ordered set that represents the result of the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. In addition to these usual ordinal operations, there are also the "natural" arithmetic of ordinals and the nimber operations.

This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC and in NFU, the version of Quine's New Foundations shown to be consistent by R. B. Jensen in 1969.

In mathematics, the epsilon numbers are a collection of transfinite numbers whose defining property is that they are fixed points of an exponential map. Consequently, they are not reachable from 0 via a finite series of applications of the chosen exponential map and of "weaker" operations like addition and multiplication. The original epsilon numbers were introduced by Georg Cantor in the context of ordinal arithmetic; they are the ordinal numbers ε that satisfy the equation

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.

In set theory, a continuous function is a sequence of ordinals such that the values assumed at limit stages are the limits of all values at previous stages. More formally, let γ be an ordinal, and $be a γ-sequence of ordinals. Then s is continuous if at every limit ordinal β < γ,$

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 mathematics, particularly set theory, non-recursive ordinals are large countable ordinals greater than all the recursive ordinals, and therefore can not be expressed using ordinal collapsing functions.

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.

Ordinal number Generalization of natural numbers used to describe a way to arrange elements of a set

In set theory, an ordinal number, or ordinal, is one generalization of the concept of a natural number that is used to describe a way to arrange a collection of objects in order, one after another.

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

Pillay, Anand (2008) [1983]. An Introduction to Stability Theory. Dover. p. 57. ISBN 978-0-486-46896-9.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.