SearcharxivSearch

arXiv · 1707.00689

Analogues of the $p^n$th Hilbert symbol in characteristic $p$ (updated)

Abstract

The $p$th degree Hilbert symbol $(\cdot,\cdot )_p:K^\times/K^{\times p}\times K^\times/K^{\times p}\to{}_p{\rm Br}(K)$ from characteristic $\neq p$ has two analogues in characteristic $p$, $$[\cdot,\cdot )_p:K/\wp (K)\times K^\times/K^{\times p}\to{}_p{\rm Br}(K),$$ where $\wp$ is the Artin-Schreier map $x\mapsto x^p-x$, and $$((\cdot,\cdot ))_p:K/K^p\times K/K^p\to{}_p{\rm Br}(K).$$ The symbol $[\cdot,\cdot )_p$ generalizes to an analogue of $(\cdot,\cdot )_{p^n}$ via the Witt vectors, $$[\cdot,\cdot )_{p^n}:W_n(K)/\wp (W_n(K))\times K^\times/K^{\times p^n}\to{}_{p^n}{\rm Br}(K).$$ Here $W_n(K)$ is the truncation of length $n$ of the ring of $p$-typical Witt wectors, i.e. $W_{\{1,p,\ldots,p^{n-1}\}}(K)$. In this paper we construct similar generalizations for $((\cdot,\cdot ))_p$. Our construction involves Witt vectors and Weyl algebras. In the process we obtain a new kind of Weyl algebras in characteristic $p$, with many interesting properties. The symbols we introduce, $((\cdot,\cdot ))_{p^n}$ and, more generally, $((\cdot,\cdot ))_{p^m,p^n}$, which here are defined in terms of central simple algebras, coincide with the homonymous symbols we introduced in [arXiv:1711.00980] in terms of the symbols $[\cdot,\cdot )_{p^n}$. This will be proved in a future paper. In the present paper we only introduce the symbols and we prove that they have the same properties with the symbols from [arXiv:1711.00980]. These properies are enough to obtain the representation theorem for ${}_{p^n}{\rm Br}(K)$ from [arXiv:1711.00980], Theorem 4.10.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Constantin-Nicolae Beli. 2018-02-16. Analogues of the $p^n$th Hilbert symbol in characteristic $p$ (updated). https://arxiv.org/abs/1707.00689

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