加载中…
We introduce the notion of by analogy with Chenevier’s definition of determinant laws. Symplectic determinant laws are a way to define pseudorepresentations for symplectic representations of algebras with involution over arbitrary -algebras. We prove that this notion satisfies the properties expected from a good theory of pseudorepresentations, and we compare it to Lafforgue’s -pseudocharacters. In the process, we compute generators of the invariant algebras and over an arbitrary commutative ring when , generalizing results of Zubkov.

生成讲解博客的中文版本

生成AI智能校验的中文版本