Notions of rank and independence in countably categorical theories

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Koponen, Vera
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917539409297408
author Koponen, Vera
author_facet Koponen, Vera
contents For an $ω$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < ω$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$ and every imaginary element that is an equivalence class of an $\emptyset$-definable equivalence relation on $n$-tuples of elements from $M$. Using the $n$-rank we define the notion of $n$-independence. For all $n < ω$, the $n$-independence relation restricted to $M_n$ has all properties of an independence relation according to Kim and Pillay with the {\em possible exception} of the symmetry property. We prove that, given any $n < ω$, if $\mathcal{M} \models T$ and the algebraic closure in $\mathcal{M}^{\mathrm{eq}}$ restricted to imaginary elements ``up to level $n$'' which have $n$-rank 1 (over some set of parameters) satisfies the exchange property, then $n$-independence is symmetric and hence an independence relation when restricted to $M_n$. Then we show that if $n$-independence is symmetric for all $n < ω$, then $T$ is rosy. An application of this is that if $T$ has weak elimination of imaginaries and the algebraic closure in $\mathcal{M}$ restricted to elements of $M$ of 0-rank 1 (over some set of parameters from $M^{\mathrm{eq}}$) satisfies the exchange property, then $T$ is superrosy with finite U-thorn-rank.
format Preprint
id arxiv_https___arxiv_org_abs_2511_06113
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Notions of rank and independence in countably categorical theories
Koponen, Vera
Logic
03C45, 03C35, 03C50
F.4.1
For an $ω$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < ω$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$ and every imaginary element that is an equivalence class of an $\emptyset$-definable equivalence relation on $n$-tuples of elements from $M$. Using the $n$-rank we define the notion of $n$-independence. For all $n < ω$, the $n$-independence relation restricted to $M_n$ has all properties of an independence relation according to Kim and Pillay with the {\em possible exception} of the symmetry property. We prove that, given any $n < ω$, if $\mathcal{M} \models T$ and the algebraic closure in $\mathcal{M}^{\mathrm{eq}}$ restricted to imaginary elements ``up to level $n$'' which have $n$-rank 1 (over some set of parameters) satisfies the exchange property, then $n$-independence is symmetric and hence an independence relation when restricted to $M_n$. Then we show that if $n$-independence is symmetric for all $n < ω$, then $T$ is rosy. An application of this is that if $T$ has weak elimination of imaginaries and the algebraic closure in $\mathcal{M}$ restricted to elements of $M$ of 0-rank 1 (over some set of parameters from $M^{\mathrm{eq}}$) satisfies the exchange property, then $T$ is superrosy with finite U-thorn-rank.
title Notions of rank and independence in countably categorical theories
topic Logic
03C45, 03C35, 03C50
F.4.1
url https://arxiv.org/abs/2511.06113