Morley Rank¶
Morley rank measures recursive infinite definable splitting of a set in a first-order structure.
Core Idea¶
Morley rank assigns an ordinal, or infinity, to a definable set by asking how often it can split into infinitely many pairwise disjoint definable pieces of earlier rank. Nonempty sets start at rank at least zero; the successor step tests infinite splitting in a sufficiently rich model or elementary extension, and a limit step requires all prior lower bounds. This logical definition, not cardinality or linear-algebra rank, is the invariant. In algebraically closed fields it aligns with geometric dimension for familiar definable varieties, which is a useful example rather than the universal definition.[1][2]
Structural Signature¶
Sig role-phrases: definable set; infinite incompatible family; ordinal successor; elementary extension; limit-stage persistence.
- A definable set is specified by a formula, possibly with parameters.
- An infinite incompatible family of definable subsets supplies the successor witness.
- Ordinal recursion says rank at least α+1 when each member has rank at least α.
- An elementary extension is allowed in the successor test.
- At a limit ordinal, all lower rank bounds must hold; an unbounded rank is infinity.[1]
What It Is Not¶
Morley rank is not the size of a set: an infinite set can have rank one. It is not matrix rank, nor the number of maximal-rank pieces (Morley degree). Algebraic dimension agrees in standard algebraically closed field examples but does not replace the model-theoretic definition in arbitrary theories.[1][2]
Scope of Application¶
The invariant belongs to first-order model theory, especially stability-theoretic analysis of definable sets. Finite definable sets give a simple base case. Algebraically closed fields supply a different, geometric setting: a line can be viewed as one-dimensional because it supports infinitely many rank-zero points, while richer varieties require more levels of definable splitting.[1][2]
Clarity¶
“Infinitely many” is essential. A finite partition does not increase rank. “Definable” is also essential: arbitrary subsets of the underlying set cannot be inserted into the recursion. The extension clause prevents the answer from depending only on what a small particular model happens to visibly realize. Rank measures this recursive depth, whereas Morley degree records how many top-rank definable pieces occur at a finite-rank level. Their difference is an invariant distinction, not a forced depth-versus-multiplicity tradeoff. Likewise, geometric dimension is a theorem-backed calculation in an algebraically closed field, not a rival definition for general theories.[2]
Manages Complexity¶
Rank compresses a potentially elaborate lattice of definable subsets into an ordinal depth. Degree records another aspect—the number of top-rank components—and should be kept separate. The compression is meaningful because the same recursive test can be applied to formulas across models, rather than relying on raw cardinality.[1]
Abstract Reasoning¶
To show rank at least zero, exhibit a realization. To show at least one, find infinitely many pairwise inconsistent nonempty definable subcases in a suitable elementary extension. Repeat that demand at higher ordinals, and at a limit check every smaller ordinal. To disprove a proposed successor bound, show no qualifying infinite family exists.[1]
Knowledge Transfer¶
The rank test transfers between definable sets of different theories. The algebraic-geometric picture transfers only under special hypotheses such as algebraically closed fields; it cannot be used to assign a Morley rank to arbitrary geometric shapes without specifying a first-order structure and definability.
Examples¶
Finite definable set¶
Take the formula x(x-1)=0 in an algebraically closed field. Its solution set is exactly {0,1} (in characteristic two these are still distinct). It is nonempty, so its rank is at least zero; at most two nonempty disjoint subsets can fit inside it, so it cannot have the infinitely many rank-at-least-zero definable subsets required for rank at least one. Thus its Morley rank is exactly 0.[2]
Mapped back: the formula supplies the set; lack of infinite definable splitting stops the ordinal recursion at zero.
Affine line over an algebraically closed field¶
Let K be an infinite algebraically closed field in the language of rings. For every a ∈ K, the parameter formula x=a defines a singleton of rank 0. These infinitely many disjoint singletons prove MR(K) ≥ 1. The upper bound is not obtained merely by looking at points: quantifier elimination for algebraically closed fields makes every one-variable definable subset of K finite or cofinite. A rank-at-least-one definable subset must be infinite, hence cofinite; two cofinite subsets of an infinite K cannot be disjoint, let alone infinitely many. Therefore MR(K) \not\ge 2, and MR(K)=1. Deloro states this exact finite/cofinite argument in Example 4.8 and separately states the ACF rank–Zariski-dimension agreement; the derivation here does not silently substitute algebraic dimension for the recursion.[2]
Mapped back: the field formula supplies K; parameter-defined points give the successor witness; finite/cofinite quantifier elimination blocks the next successor, so the splitting depth is exactly one.
Structural Tensions¶
No intrinsic opposed-cost tradeoff is established for Morley rank as a formal invariant in the checked notes. Rank versus degree separates different quantities; ACF dimension versus the recursive definition separates a special theorem from the general definition. One does not choose less correct rank in exchange for more degree or geometric intuition. The genuine test is whether the definability and infinite-splitting clauses hold in the stated theory.[2]
Structural–Framed Character¶
Morley rank is strongly structural and formal: its ordinal clauses specify a mathematical invariant once a language, model, and definable formula are given. Evaluative weight lies in choosing useful structures and applying the invariant, not in deciding its rank by taste. Human mathematical practice created the terminology; no institution can decree a different rank while preserving the definition. The vocabulary travels literally between theories only when definability and elementary extensions are supplied. Calling an organizational hierarchy's “depth” Morley rank would import metaphor; recognizing it in a new model requires the recursive infinite-splitting test. Its character: a formal model-theoretic dimension surrogate with theory-dependent values.
Structural Core vs. Domain Accent¶
The skeletal relation is recursive measurement of how deeply a set can split into many qualified parts. The domain-bound mechanism is first-order definability, pairwise inconsistency, elementary extensions, and ordinal recursion. The named entry fails the prime bar because those logical qualifications are its truth conditions; replacing them with arbitrary partitions yields a different rank. A broader splitting-depth abstraction is an explicit future-prime question, not an asserted parent.
Instantiates / Related Primes¶
This is an unparented root with a missing-intermediate gate, not a claim of ultimate taxonomic isolation. A model-theoretic rank or dimension genus has not been admitted in the live graph; live Rank means matrix rank, while Quantifier Rank counts syntactic nesting. Morley degree remains a companion invariant, not a parent.
Neighborhood in Abstraction Space¶
Morley Rank sits in a sparse region of the domain-specific corpus (84th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Abstract Algebra & Category Theory (24 abstractions)
Nearest neighbors
- Cumulative Hierarchy — 0.83
- Successor Ordinal — 0.83
- Slow-Growing Hierarchy — 0.81
- Supertransitive class — 0.81
- Set Cover Problem — 0.81
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
Matrix rank: dimension of a linear image. Cardinality: number of elements. Algebraic dimension: coincident in appropriate ACF examples, not the recursive definition. Morley degree: multiplicity of maximal-rank definable pieces.[1]
References¶
[1] Thomas Scanlon, “Morley Rank,” Geometric Stability Theory tutorial. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g
[2] Adrien Deloro, Basic Model Theory of Algebraically Closed Fields, §4.2, Definition 4.6, Example 4.8 and Lemma 4.9, pp. 17–18 of the PDF. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g