SearcharxivSearch

arXiv · 1906.02516

The Koszul map K

Abstract

The Bitableax correspondence isomorphism/Koszul map Theorem (BCK Theorem, for short, Theorem 6.5 below) describes a relevant pair of mutually inverse vector space isomorphisms, the Koszul map K : U(gl(n))-> Sym(gl(n)) and the bitableaux correspondence iWe describe a linear \emph{equivariant isomorphism} $\mathcal{K}$ from the enveloping algebra $\mathbf{U}(gl(n))$ to the algebra ${\mathbb C}[M_{n,n}] \cong \mathbf{Sym}(gl(n))$ of polynomials in the entries of a ``generic'' square matrix of order $n$. The isomorphism $\mathcal{K}$ maps any {\textit{Capelli bitableau}} $[S|T]$ in $\mathbf{U}(gl(n))$ to the {\textit{(determinantal) bitableau}} $(S|T)$ in ${\mathbb C}[M_{n,n}]$ and any {\textit{Capelli *-bitableau}} $[S|T]^*$ in $\mathbf{U}(gl(n))$ to the {\textit{(permanental) *-bitableau}} $(S|T)^*$ in ${\mathbb C}[M_{n,n}]$. These results are far-reaching generalizations of the pioneering result of J.-L. Koszul [19] on the Capelli determinant in $\mathbf{U}(gl(n))$ (see, e.g. [24], [27]). We introduce {\textit{column}} Capelli bitableaux and *-bitableaux in Section 6; since they are mapped by the isomorphism $\mathcal{K}$ to {\textit{monomials}} in ${\mathbb C}[M_{n,n}]$, this isomorphism can be regarded as a sharpened version of the PBW isomorphism for the enveloping algebra $\mathbf{U}(gl(n))$. Since the center $\boldsymbolζ(n)$ of $\mathbf{U}(gl(n))$ equals the subalgebra of invariants $\mathbf{U}(gl(n))^{Ad_{gl(n)}}$, then $$ \mathcal{K} \big[ \boldsymbolζ(n) \big] = {\mathbb C}[M_{n,n}]^{ad_{gl(n)}}. $$somorphism B : Sym(gl(n)) -> U(gl(n)) that deeply link the enveloping algebra U(gl(n)) of the general linear Lie algebra gl(n) and the symmetric algebra Sym(gl(n)). The BCK Theorem can be regarded as a sharpened version of the PBW Theorem for the enveloping algebra U(gl(n)).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrea Brini, Antonio Teolis. 2020-06-15. The Koszul map K. https://arxiv.org/abs/1906.02516

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