SearcharxivSearch

arXiv · 1912.02385

On n-dependent groups and fields II

Abstract

We continue the study of $n$-dependent groups, fields and related structures, largely motivated by the conjecture that every $n$-dependent field is dependent. We provide evidence towards this conjecture by showing that every infinite $n$-dependent valued field of positive characteristic is henselian, obtaining a variant of Shelah's Henselianity Conjecture in this case and generalizing a recent result of Johnson for dependent fields. Additionally, we prove a result on intersections of type-definable connected components over generic sets of parameters in $n$-dependent groups, generalizing Shelah's absoluteness of $G^{00}$ in dependent theories and relative absoluteness of $G^{00}$ in $2$-dependent theories. In an effort to clarify the scope of this conjecture, we provide new examples of strictly $2$-dependent fields with additional structure, showing that Granger's examples of non-degenerate bilinear forms over dependent fields are $2$-dependent. Along the way, we obtain some purely model-theoretic results of independent interest: we show that $n$-dependence is witnessed by formulas with all but one variable singletons; provide a type-counting criterion for $2$-dependence and use it to deduce $2$-dependence for compositions of dependent relations with arbitrary binary functions (the Composition Lemma); and show that an expansion of a geometric theory $T$ by a generic predicate is dependent if and only if it is $n$-dependent for some $n$, if and only if the algebraic closure in $T$ is disintegrated. An appendix by Martin Bays provides an explicit isomorphism in the Kaplan-Scanlon-Wagner theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Artem Chernikov, Nadja Hempel. 2019-12-05. On n-dependent groups and fields II. https://doi.org/10.1017/fms.2021.35

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