SearcharxivSearch

arXiv · 1408.5177

Algebraic differential equations from covering maps

Abstract

Let $Y$ be a complex algebraic variety, $G \curvearrowright Y$ an action of an algebraic group on $Y$, $U \subseteq Y({\mathbb C})$ a complex submanifold, $Γ< G({\mathbb C})$ a discrete, Zariski dense subgroup of $G({\mathbb C})$ which preserves $U$, and $π:U \to X({\mathbb C})$ an analytic covering map of the complex algebraic variety $X$ expressing $X({\mathbb C})$ as $Γ\backslash U$. We note that the theory of elimination of imaginaries in differentially closed fields produces a generalized Schwarzian derivative $\widetildeχ:Y \to Z$ (where $Z$ is some algebraic variety) expressing the quotient of $Y$ by the action of the constant points of $G$. Under the additional hypothesis that the restriction of $π$ to some set containing a fundamental domain is definable in an o-minimal expansion of the real field, we show as a consequence of the Peterzil-Starchenko o-minimal GAGA theorem that the \emph{prima facie} differentially analytic relation $χ:= \widetildeχ \circ π^{-1}$ is a well-defined, differential constructible function. The function $χ$ nearly inverts $π$ in the sense that for any differential field $K$ of meromorphic functions, if $a, b \in X(K)$ then $χ(a) = χ(b)$ if and only if after suitable restriction there is some $γ\in G({\mathbb C})$ with $π(γ\cdot π^{-1}(a)) = b$.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Scanlon. 2014-08-22. Algebraic differential equations from covering maps. https://arxiv.org/abs/1408.5177

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