SearcharxivSearch

arXiv · 2607.17014

Model theory of generic vector space endomorphisms III: Reducts

Abstract

This paper further studies the model companion of an endomorphism acting on a vector space, possibly with extra structure. Let $T$ be a model-complete theory that $\varnothing$-defines an infinite $K$-vector space $\mathbb{V}$. In previous work, we introduced a family $\{T^C_\theta : C \in \mathcal{C}\}$ of extensions of the theory $T_\theta := T \cup \{\text{``$\theta$ is an endomorphism of $\mathbb{V}$''}\}$ that parameterizes all consistent extensions of the form $$ T_\theta \cup \left\{\sum\nolimits_{k}\bigcap\nolimits_{l}\operatorname{Ker}(\rho_{j, k, l}[\theta]) = \sum\nolimits_{k}\bigcap\nolimits_{l} \operatorname{Ker}(\eta_{j, k, l}[\theta]) : j \in \mathcal{J}\right\}, $$ where all sums and intersections are finite, all the $\rho[\theta]$'s and $\eta[\theta]$'s are polynomials over $K$ with $\theta$ plugged in, and $\mathcal{J}$ is some possibly infinite index set. We also presented a sufficient condition that implies that every $T^C_\theta$ has a model companion $T\theta^C$. We simplify our axiomatization of $T\theta^C$ and the criterion for its existence for theories ``close to the theory of $K$-vector spaces''. We apply this to the explicit case where $T$ is the pure theory of $K$-vector spaces and characterize all $\varnothing$-definable endomorphisms of $\mathbb{V}$ in this case. Given an existentially closed model $(\mathcal{M}, \theta) \models T^C_\theta$ and a polynomial $\rho\in K[X]$, we show that $(\mathcal{M},\operatorname{Ker}(\rho[\theta]))$ is, unless $\operatorname{Ker}(\rho[\theta]) = \{0\}$ or $\operatorname{Ker}(\rho[\theta]) = \mathbb{V}$, an existentially closed model of $T_V := T \cup \{\text{``$V$ is a vector subspace of $\mathbb{V}$''}\}$. In the same vein, we present a criterion for when $(\mathcal{M}, \rho[\theta])$ is again an existentially closed model of $T^{C'}_\theta$ for some $C' \in \mathcal{C}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Leon Chini. 2026-07-19. Model theory of generic vector space endomorphisms III: Reducts. https://arxiv.org/abs/2607.17014

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO