SearcharxivSearch

arXiv · 1708.07944

Difference Galois groups under specialization

Abstract

We present a difference analogue of a result given by Hrushovski on differential Galois groups under specialization. Let $k$ be an algebraically closed field of characteristic zero and $\mathbb{X}$ an irreducible affine algebraic variety over $k$. Consider the linear difference equation $$ \sigma(Y)=AY $$ where $A\in \mathrm{GL}_n(k(\mathbb{X})(x))$ and $\sigma$ is the shift operator $\sigma(x)=x+1$. Assume that the Galois group $G$ of the above equation over $\overline{k(\mathbb{X})}(x)$ is defined over $k(\mathbb{X})$ i.e. the vanishing ideal of $G$ is generated by a finite set $S\subset k(\mathbb{X})[X,1/\det(X)]$. For a ${\bf c}\in \mathbb{X}$, denote by $v_{\bf c}$ the map from $k[\mathbb{X}]$ to $k$ given by $v_{\bf c}(f)=f({\bf c})$ for any $f\in k[\mathbb{X}]$. We prove that the set of ${\bf c}\in \mathbb{X}$ satisfying that $v_{\bf c}(A)$ and $v_{\bf c}(S)$ are well-defined and the affine variety in $\mathrm{GL}_n(k)$ defined by $v_{\bf c}(S)$ is the Galois group of $\sigma(Y)=v_{\bf c}(A)Y$ over $k(x)$ is Zariski dense in $\mathbb{X}$. We apply our result to van der Put-Singer's conjecture which asserts that an algebraic subgroup $G$ of $\mathrm{GL}_n(k)$ is the Galois group of a linear difference equation over $k(x)$ if and only if the quotient $G/G^\circ$ by the identity component is cyclic. We show that if van der Put-Singer's conjecture is true for $k=\mathbb{C}$ then it will be true for any algebraically closed field $k$ of characteristic zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruyong Feng. 2017-08-26. Difference Galois groups under specialization. https://arxiv.org/abs/1708.07944

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA