Definable Ranks of Ordered Fields

• The paper demonstrates that every pattern of definable convex end-segments in linear orders is realized as the definable rank of some ordered field.
• It employs lexicographic constructions and natural valuations to establish canonical isomorphisms among the ranks of the field, its value group, and its archimedean spine.
• The study extends to almost real closed fields, showing that definable ranks coincide across field, value group, and value set, which paves the way for further research in valuation theory.

Definable ranks of ordered fields constitute a model-theoretic framework capturing the hierarchy of convex substructures that are definable in the first-order language of ordered fields. This invariant refines the classical notion of rank, which classifies convex valuation rings (or subgroups, or segments), by restricting attention to those that admit a first-order definition. Recent advances have sharply clarified the structure and flexibility of definable ranks, demonstrating that all patterns of definable end-segments observed for linear orders arise as definable ranks in the setting of ordered fields, thereby fully characterizing the model-theoretic complexity that ordered fields can encode in their convex valuation theory (Boissonneau et al., 20 Dec 2025). A parallel theory holds in the context of almost real closed fields, where definable rank coincidences across field, value group, and value set are delineated (Krapp et al., 31 May 2025).

1. Model-Theoretic Notion of Definable Rank

In the language $\mathcal L$ of ordered structures, rank invariants are defined as follows:

• For a linear order $(\Gamma,<)$, the rank $\mathrm{rk}(\Gamma)$ is the set of all proper end-segments, ordered by inclusion. The definable rank $\mathrm{drk}(\Gamma)$ comprises those end-segments first-order definable in $(\Gamma,<)$.
• For an ordered abelian group $(G,+,<)$, $\mathrm{rk}(G)$ is the set of all proper convex subgroups, and $\mathrm{drk}(G)$ is the sub-poset of those convex subgroups definable in $\{0,+,-,<\}$.
• For an ordered field $(K,+,\cdot,<)$, $(\Gamma,<)$0 is the collection of proper convex valuation rings $(\Gamma,<)$1, and $(\Gamma,<)$2 those rings that are definable (with parameters) in $(\Gamma,<)$3 (Boissonneau et al., 20 Dec 2025, Krapp et al., 31 May 2025).

The process thus yields three interrelated hierarchies for any ordered field: on the underlying field, its canonical value group, and its archimedean spine. These structures admit canonical order-preserving maps, and in the purely set-theoretic (i.e., abstract, non-definable) case, are isomorphic.

2. Archimedean Spine and Natural Valuation: Structural Intermediaries

The archimedean spine of an ordered abelian group $(\Gamma,<)$4 is the linearly ordered quotient $(\Gamma,<)$5, where $(\Gamma,<)$6 if there exist $(\Gamma,<)$7 such that $(\Gamma,<)$8 and $(\Gamma,<)$9. The ordering on classes $\mathrm{rk}(\Gamma)$0 corresponds to $\mathrm{rk}(\Gamma)$1 and $\mathrm{rk}(\Gamma)$2 (Boissonneau et al., 20 Dec 2025).

For ordered fields, the natural valuation $\mathrm{rk}(\Gamma)$3 on $\mathrm{rk}(\Gamma)$4 arises by quotienting $\mathrm{rk}(\Gamma)$5 by the same archimedean equivalence, producing a value group $\mathrm{rk}(\Gamma)$6 and residue field archimedean (a subfield of $\mathrm{rk}(\Gamma)$7). The value set $\mathrm{rk}(\Gamma)$8 is again the archimedean spine of $\mathrm{rk}(\Gamma)$9, tightly connecting the three layers of structure (Krapp et al., 31 May 2025).

3. Isomorphism Theorems and Main Constructions

The principal result is as follows: Given any linear order $\mathrm{drk}(\Gamma)$0, there exists an ordered abelian group $\mathrm{drk}(\Gamma)$1 with archimedean spine $\mathrm{drk}(\Gamma)$2 and an ordered field $\mathrm{drk}(\Gamma)$3 whose natural value group is $\mathrm{drk}(\Gamma)$4, such that

$\mathrm{drk}(\Gamma)$5

This holds universally: every pattern of definable convex end-segments that appears in a linear order is instantiated as the definable rank of some ordered field (Boissonneau et al., 20 Dec 2025).

Construction Scheme

• From $\mathrm{drk}(\Gamma)$6 to $\mathrm{drk}(\Gamma)$7: Employ $\mathrm{drk}(\Gamma)$8 (the lexicographically ordered direct sum of copies of $\mathrm{drk}(\Gamma)$9 indexed by $(\Gamma,<)$0). Convex subgroups correspond bijectively to sums over end-segments $(\Gamma,<)$1; the definable ones to definable end-segments; hence $(\Gamma,<)$2.
• From $(\Gamma,<)$3 to $(\Gamma,<)$4: Form $(\Gamma,<)$5, the Hahn series field with real coefficients and value group $(\Gamma,<)$6. The natural valuation $(\Gamma,<)$7 is henselian and definable (as no nontrivial $(\Gamma,<)$8 can simultaneously force both required alignments for non-definability), hence the induced map $(\Gamma,<)$9 is an isomorphism (Boissonneau et al., 20 Dec 2025).

4. Definable Rank Coincidence in Almost Real Closed Fields

In almost real closed fields—those real fields whose natural valuation is henselian with real-closed residue field—there is a full correspondence among definable ranks on the field, its value group, and the associated value set. Explicitly,

$(G,+,<)$0

This result leverages both algebraic properties (henselianity and residue closure) and model-theoretic analyses of definability, corresponding to Krapp–Kuhlmann–Vogel's theorem (Krapp et al., 31 May 2025).

Definable Rank Structure in Examples

For discrete $(G,+,<)$1, every definable final segment has a least element and

$(G,+,<)$2

For dense $(G,+,<)$3 with endpoints,

$(G,+,<)$4

subject to extensions if endpoints exist (Krapp et al., 31 May 2025).

5. Classification, Co-augmentability, and Open Problems

Classifying possible definable ranks of ordered fields reduces to classifying which families of definable end-segments $(G,+,<)$5 arise from some linear order $(G,+,<)$6. By the co-augmentability criterion: an end-segment $(G,+,<)$7 is $(G,+,<)$8-definable if and only if the pair $(G,+,<)$9 is not co-augmentable (cf. Proposition 2.27 in [itme‐spines]; (Boissonneau et al., 20 Dec 2025)). This gives a complete description but is often highly nonexplicit; determining co-augmentability may be as subtle as hard model-theoretic or number-theoretic problems.

A consequence is that every definable rank structure realized in linear orders also appears for some ordered field. Conversely, to decide if a chain $\mathrm{rk}(G)$0 occurs as $\mathrm{rk}(G)$1 requires building $\mathrm{rk}(G)$2 with definable end-segments exactly $\mathrm{rk}(G)$3. The open-ended nature of co-augmentability ensures the classification problem remains intricate.

6. Variability and Mismatches in Definable Ranks

Concrete constructions showcase the versatility and possible discrepancies in definable rank structures. For instance, given a non-definable end-segment $\mathrm{rk}(G)$4 in $\mathrm{rk}(G)$5, one may define

$\mathrm{rk}(G)$6

yielding $\mathrm{rk}(G)$7 that strictly exceeds $\mathrm{rk}(G)$8. The universal construction (lexicographic sum by $\mathrm{rk}(G)$9) always guarantees equality of definable ranks. This flexibility supports the realization of all possible “mismatches” among $\mathrm{drk}(G)$0, $\mathrm{drk}(G)$1, and $\mathrm{drk}(G)$2 (Boissonneau et al., 20 Dec 2025).

A notable example distinguishes all three structures: setting $\mathrm{drk}(G)$3 and $\mathrm{drk}(G)$4, then $\mathrm{drk}(G)$5 is a singleton, $\mathrm{drk}(G)$6 is empty, and $\mathrm{drk}(G)$7 corresponds to the two final segments of a three-point chain (Krapp et al., 31 May 2025).

7. Corollaries and Directions for Further Research

Key corollaries include:

• In almost real closed fields, definable convex $\mathrm{drk}(G)$8-coarsenings account for all definable valuations. If $\mathrm{drk}(G)$9 is well-ordered or reverse-well-ordered, then all abstract ranks are definable and $\{0,+,-,<\}$0 (Krapp et al., 31 May 2025).
• Open questions: Which triples $\{0,+,-,<\}$1 of order types can occur as $\{0,+,-,<\}$2? What tameness conditions enforce $\{0,+,-,<\}$3 beyond almost real closed fields? Which final segments of a linear order are $\{0,+,-,<\}$4-definable? These address fundamental interfaces between valuation theory, order theory, and model theory, and remain central to ongoing research (Boissonneau et al., 20 Dec 2025, Krapp et al., 31 May 2025).