---
title: T-Minimal Theories in Model Theory
url: https://www.emergentmind.com/topics/t-minimal-theories
type: topic
---

# T-Minimal Theories in Model Theory

“T-Minimal theories” designates several non-equivalent notions of minimality. In recent model theory, “t-minimal” usually means a theory equipped with a definable Hausdorff topology in which a unary definable set has non-empty interior iff it is infinite; within this setting one studies dimension, visceral theories, canonical topologies on definable groups, and largeness of definable fields [2404.11453] [2605.06986] [2508.18558]. In different literatures, closely related language is used for theories minimal in generalized Keisler orders for \(L_{\theta,\theta}\) at a compact cardinal, for the minimal computational set theory \(RST_{HF}^m\), and for recursively enumerable theories that would be minimal under Turing reducibility or interpretability in the context of Gödel’s first incompleteness theorem [1303.5247] [1801.02387] [2110.12233].

## 1. t-minimality as a tame topological condition

In the topological model-theoretic sense, a theory \(T\) is equipped with a definable Hausdorff topology on the home sort \(M\). The definition used by Mathews is that \(T\) is t-minimal if every definable subset \(D \subseteq M\) in one variable has finite boundary. Equivalently, for every definable \(D \subseteq M\),
\[
int(D) \neq \varnothing \quad \Longleftrightarrow \quad D \text{ is infinite}.
\]
Since the topology is Hausdorff, this is also equivalent to saying that there are no isolated points in \(M\), and that for every definable \(D \subseteq M\), the boundary \(bd(D)\) is finite [2404.11453].

This hypothesis is explicitly described as a very weak “tame topology” assumption. It controls definable sets in one variable, but it does not imply generic continuity or cell decomposition in general. The same basic axiom is used in later work on definable groups and fields, where t-minimality is presented as broad enough to include dense o-minimal, P-minimal, C-minimal, and hensel-minimal settings [2605.06986].

A visceral theory is a specialization of this setting: it is t-minimal and the definable topology comes from a definable uniformity, i.e. a definable uniform structure. If \(\Omega\) is the family of entourages, the induced topology is generated by balls
\[
E[a]=\{b:(a,b)\in E\}.
\]
Examples explicitly listed as visceral include o-minimal expansions, C-minimal valued fields, \(p\)-adics and \(P\)-minimal expansions, and dp-minimal expansions of fields [2404.11453].

## 2. Dimension theory in t-minimal structures

A central development is that t-minimality already supports a robust dimension theory. The construction uses broadness and \(acl\)-independence. For \(R \subseteq \prod_{i=1}^n X_i\), the set \(R\) is broad if for every \(k<\omega\), there are subsets \(S_i \subseteq X_i\) of size at least \(k\) such that
\[
\prod_{i=1}^n S_i \subseteq R.
\]
Otherwise it is narrow. In the model-theoretic setting, a definable \(X \subseteq M^n\) is broad iff it contains arbitrarily large Cartesian grids; in a saturated model this is equivalent to containing an \(\omega \times \cdots \times \omega\) grid. The key equivalence is
\[
tp(\bar a/C)\text{ is broad } \iff \bar a \text{ is } acl\text{-independent over }C.
\]
Dimension of a tuple \(\bar a\) over parameters \(C\) is then defined as the length of any tuple \(\bar b\) such that \(\bar a\) and \(\bar b\) are interalgebraic over \(C\), and \(\bar b\) is \(acl\)-independent over \(C\); a technical proposition shows this is well-defined [2404.11453].

For a type-definable \(X \subseteq M^n\),
\[
\dim(X)=\max\{\dim(\bar a/C): \bar a\in X\},
\qquad
\dim(\varnothing)=-\infty.
\]
The resulting dimension satisfies a substantial rank-like calculus:
\[
\dim(X) = -\infty \iff X=\varnothing,
\]
\[
\dim(X)\le 0 \iff X \text{ is finite},
\]
\[
X\subseteq M^n \implies \dim(X)\le n,
\]
with equality iff \(X\) has non-empty interior,
\[
\dim(X\times Y)=\dim(X)+\dim(Y),
\]
\[
\dim(X\cup Y)=\max(\dim(X),\dim(Y)).
\]
It is invariant under definable bijection, monotone under definable injections, preserved by definable surjections with finite fibers, and satisfies the fiber inequality
\[
\forall b\in Y,\ \dim(f^{-1}(b))\le k \quad\Rightarrow\quad \dim(X)\le k+\dim(Y).
\]
There is also definability in families: for a definable family \(\{X_a\}_{a\in Y}\), the set
\[
Y_k=\{a\in Y:\dim(X_a)=k\}
\]
is definable [2404.11453].

This dimension is related to more classical ranks. If \(T\) has the exchange property, then \(\dim\) agrees with \(acl\)-rank. If \(T\) is dp-minimal, then \(\dim\) agrees with dp-rank. In general,
\[
\dim(X)\le d_t(X),
\]
where \(d_t(X)\) is the naive topological dimension. A major caveat is that the familiar monotonicity of dimension under arbitrary definable surjections can fail: one can have a definable function \(f:X\to Y\) with
\[
\dim(X)<\dim(\operatorname{im}(f)).
\]
This is the main exceptional phenomenon of the theory and marks a sharp difference from dp-minimal and o-minimal settings [2404.11453].

## 3. Visceral theories, cell decomposition, and space-filling pathologies

Within visceral theories, many of Dolich–Goodrick’s tame topology theorems survive without the additional assumptions of definable finite choice (DFC) and no space-filling functions (NSFF). In particular, DFC is not needed for cell decomposition. The cells are defined as sets of the form
\[
\sigma(\Gamma(f)),
\]
where \(U\subseteq M^k\) is non-empty open, \(f:U\rightrightarrows M^{n-k}\) is a continuous \(m\)-correspondence, and \(\sigma\) is a coordinate permutation. Every definable set is a finite disjoint union of cells, and every definable function, and even every definable correspondence, is continuous on each cell in some finite partition [2404.11453].

The same analysis yields generic continuity and local Euclideanity. For definable correspondences, continuity holds on a dense definable subset, and in many cases on a dense relatively open subset. For any definable set \(X\), there is a dense relatively open definable subset \(X_{\mathrm{Eu}}\subseteq X\) such that \(X_{\mathrm{Eu}}\) is locally Euclidean. This provides a strong replacement for older continuity arguments based on DFC [2404.11453].

The strongest misconception corrected by this work is that viscerality should automatically rule out space-filling phenomena. The counterexample is explicit: there exists a visceral theory with DFC that has a definable space-filling function. The first example is the 3-sorted real closed valued field with angular component \(RCVF_{ac,3}\), with sorts \(K\), \(\Gamma\), and \(k\), valuation \(v:K^\times\to\Gamma\), angular component \(ac:K^\times\to k^\times\), and the definable surjection
\[
x\mapsto (v(x),ac(x))
\]
from \(K^\times\) onto \(\Gamma\times k^\times\). The paper then converts this into a genuine 1-sorted visceral structure by taking the disjoint union of the sorts with a combined definable topology [2404.11453].

This example shows that NSFF is not automatic. Under NSFF, the stronger Dolich–Goodrick-style conclusions are recovered: \(d_t(X)\) agrees with \(\dim(X)\), definable surjections do not increase dimension, and frontier inequalities such as
\[
\dim(\partial X)\le \dim(X)
\]
hold, with
\[
\dim(\partial X)<\dim(X)
\]
under exchange. Without NSFF, the paper constructs visceral theories where \(\dim(X)=1\) but \(\dim(\partial X)\) is arbitrarily large, and where definable surjections can increase dimension dramatically [2404.11453].

## 4. Definable groups, fields, and topological 1-basedness

Recent work extends t-minimality from a theory of definable sets to a structural theory of definable groups and fields. If \((G,+)\) is a definable abelian group, a subset \(X\subseteq G\) is called big iff \(\dim(X)=\dim(G)\), and a basic neighborhood of \(0\) is a set of the form \(X-X\) with \(X\) big. From this, one obtains a translation-invariant group topology \(\tau\) on \(G\); it is definable, and it is characterized by
\[
\dim(D)=\dim(G) \iff int_\tau(D)\ne\varnothing
\]
for every definable \(D\subseteq G\). This yields uniqueness, continuity of definable homomorphisms, and product compatibility
\[
\tau_{G\times H} = \tau_G \times \tau_H.
\]
In the visceral case, abelianity can be dropped: every definable group admits a unique definable topology \(\tau\) such that \((G,\tau)\) is a definable manifold and \((G,\cdot,\tau)\) is a topological group [2605.06986].

The corresponding field theory is equally rigid. If \(K\) is a definable field in a t-minimal theory, then \(K\) is finite or large in the sense of Pop: any smooth algebraic curve \(C\) over \(K\) with at least one \(K\)-rational point has infinitely many \(K\)-rational points. The argument proceeds via a canonical topology on \(K\), together with the implication
\[
\text{bt-henselian} \implies \text{large}.
\]
For infinite definable fields, the canonical topology is st-henselian and \(K\) is large. A separate consequence of the dimension theory is that every definable field in a t-minimal theory is perfect [2404.11453] [2605.06986].

A further dividing line is topological 1-basedness. In a highly saturated t-minimal structure with the independent neighborhood property, \(tp(a/Ab)\) is topologically 1-based over \(A\) if
\[
\dim(b/Aa)=\dim\bigl(b/A\,\operatorname{germ}(a/Ab)\bigr).
\]
With exchange, this agrees with weak 1-basedness; in o-minimality, it coincides with the classical linear/non-linear divide. If the structure is non-trivial and topologically 1-based, then it admits a type-definable abelian group \((G,+)\) with \(G\) an open subset of \(M\). Moreover, \(G\) can be chosen to be a topological group with the subspace topology inherited from \(M\), and the induced structure on \(G\) satisfies a topological analog of the Hrushovski–Pillay classification of 1-based stable groups. The resulting group geometry is locally linear, and for such groups
\[
G \text{ is topologically 1-based} \iff G \text{ is locally linear}.
\]
The exclusion of definable infinite fields from the topologically 1-based side makes this a genuine linear/non-linear boundary [2508.18558].

## 5. Minimality in \(L_{\theta,\theta}\) at a compact cardinal

A distinct use of “minimal theory” appears in infinitary model theory for a compact uncountable cardinal \(\theta\). Here \(T\) is a complete theory in \(L_{\theta,\theta}(\tau)\), and minimality is defined relative to generalized Keisler-style orders built from \(\theta\)-complete ultrafilters and saturation of ultrapowers. The key ultrafilters are the \(\theta\)-complete \((\lambda,\theta)\)-regular ultrafilters \(D\), where regularity is witnessed by sets \(w_t\in[\lambda]^{<\theta}\) such that for every \(\alpha<\lambda\),
\[
\{t\in I:\alpha\in w_t\}\in D.
\]
This is the combinatorial framework used to analyze local and full saturation of \(M^I/D\) in \(L_{\theta,\theta}\) [1303.5247].

The central characterization theorems isolate exactly which theories are minimal. If
\[
\lambda=\lambda^{<\theta}\ge 2^\theta+|T|,
\]
then
\[
T\text{ is locally }(\lambda,\theta)\text{-minimal} \iff T\text{ is 1-stable with }\theta\text{-n.c.p.}
\]
For \(|T|=\theta\), one also has
\[
T \text{ is } \triangleleft_{\lambda,\theta}\text{-minimal} \iff T \text{ is definably stable with }\theta\text{-n.c.p.} \iff T \text{ is 1-stable with }\theta\text{-n.c.p.}
\]
and, for
\[
\lambda\ge 2^\theta,
\]
\[
T \text{ is } \trianglelefteq^{ful}_{\lambda,\theta}\text{-minimal} \iff T \text{ is definably stable and globally }\theta\text{-n.c.p.}
\]
These results generalize the bottom of Keisler’s order from first-order logic to the compact-cardinal \(L_{\theta,\theta}\) setting [1303.5247].

The need for separate local and full characterizations reflects a major departure from first-order stability theory: in \(L_{\theta,\theta}\), notions such as 1-stability, definable stability, and higher instability patterns no longer collapse. This suggests that “minimality” here is not a smallness condition on axioms, but a precise saturation-theoretic position in a generalized order on theories [1303.5247].

## 6. Minimal computational theories and the failure of minimality for incompleteness

In foundational set theory, “T-minimal” appears in yet another sense. The theory \(RST_{HF}^m\) is presented as the minimal predicatively acceptable theory in a static framework that proves the existence of infinite sets. Its defining feature is computationality: a theory \(\mathcal T\) is computational if the set \(\mathcal S_{\mathcal T}\) induced by its closed terms is a transitive model of \(\mathcal T\), and for every transitive model \(\mathcal M\) of \(\mathcal T\),
\[
\mathcal M = \mathcal S_{\mathcal T}.
\]
For \(RST_{HF}^m\), the minimal transitive model is \(J_2\), with
\[
J_1=\mathcal{HF},\qquad J_2=Rud(J_1),
\]
and every element of \(J_2\) is denoted by some closed term of the language. Within this minimal computational universe, the real line is treated as a proper class of Dedekind cuts rather than as a set, yet the theory still supports least upper bounds for separable subclasses of \(\mathbb R\), connectedness as intervalhood, continuity, uniform limits, the Intermediate Value Theorem, the Extreme Value Theorem, inverse functions for strictly monotone continuous functions, and standard functions such as polynomials, \(\exp\), \(\ln\), \(\sin\), and \(\arcsin\) [1801.02387].

In recursion-theoretic and interpretability-theoretic work on Gödel’s first incompleteness theorem, minimality again has a different meaning. Here one asks whether there is a consistent recursively enumerable theory for which \(G1\) holds and which is minimal under Turing reducibility or interpretability. The basic definition is that \(G1\) holds for an RE theory \(T\) if any consistent RE theory that interprets \(T\) is incomplete; for consistent RE theories this is equivalent to being essentially incomplete and to being essentially undecidable. The main conclusion is negative: there are no minimal RE theories w.r.t. Turing reducibility for which \(G1\) holds, and there are no minimal elements in the interpretability structure \((DI,<)\) below \(R\) [2110.12233].

The same negative phenomenon persists for effectively inseparable theories. The theory-version tEI is introduced by requiring a recursive separator for disjoint RE filter/ideal supersets of the nuclei \(T^P\) and \(T^R\). One proves that tEI implies essential undecidability, that \(U,V\) tEI implies \(U\oplus V\) tEI, and that there are no minimal tEI theories w.r.t. interpretability. Since
\[
T \text{ is EI} \iff T \text{ is tEI} \iff T \text{ is EET},
\]
it follows that there are no minimal EI theories w.r.t. interpretability, and even no minimal finitely axiomatizable EI theories w.r.t. interpretability [2211.06190]. This usage turns “T-minimality” into a question about degree structures, and the answer is that no bottom element exists.

These literatures are conceptually independent, but together they show that “T-Minimal Theories” is not a single doctrine. In one direction, t-minimality is a weak topological tameness axiom that nonetheless supports dimension theory, cell decomposition in visceral settings, canonical group topologies, and strong algebraic consequences for definable fields. In others, minimality names extremal positions in generalized Keisler orders, the smallest computational set-theoretic environment sustaining substantial mathematics, or the unattainable lower bound sought in incompleteness and interpretability theory [2404.11453] [1303.5247] [1801.02387] [2110.12233].

Source: https://www.emergentmind.com/topics/t-minimal-theories