非交换零点定理与完美博弈
Noncommutative Nullstellensätze and Perfect Games
AI总结:
本文将非交换零点定理扩展至非局部博弈,提出两种基于零点定理的完美交换算子策略刻画方法,分别适用于所有博弈和环面确定性博弈,并开发了相应的计算机代数技术。
摘要:
经典代数几何与实代数几何的基础是 Nullstellensatz 和 Positivstellensatz。在过去二十年中,矩阵与算子理论(非交换变量)的基本类似定理已经出现。本文关注非局部博弈的交换算子策略,回顾了有用的 NC Nullstellensatz,对其进行了扩展,并将其应用于非常广泛的博弈集合。在此过程中,本文汇集了分散于不同文献中的结果,因此我们的风格更偏向于阐述性,而非简略。\n本文的主要结果是两个基于 Nullstellensatz 的刻画,适用于具有完美交换算子策略的博弈。第一个刻画适用于所有博弈,将博弈是否具有完美交换算子策略的问题简化为涉及左理想和平方和的问题。此前,Paulsen 等人将完美同步博弈的研究转化为完全涉及 $*$-代数的问题。我们提出的刻画是类似的,但适用于所有博弈。第二个刻画基于我们在本文中推导出的新 Nullstellensatz。它适用于我们称之为环面确定性博弈的一类博弈,其特例包括 XOR 和线性系统博弈。对于这些博弈,我们证明了博弈是否具有完美交换算子策略的问题可以简化为子群成员问题的实例;对于线性系统博弈,我们进一步证明这种子群成员刻画等价于基于解群对完美交换算子策略的标准刻画。一般博弈和环面确定性博弈的刻画均适用于计算机代数技术,我们也对此进行了开发。
英文摘要:
The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables) have emerged. This paper concerns commuting operator strategies for nonlocal games, recalls NC Nullstellensatz which are helpful, extends these, and applies them to a very broad collection of games. In the process it brings together results spread over different literatures, hence rather than being terse, our style is fairly expository. The main results of this paper are two characterizations, based on Nullstellensatz, which apply to games with perfect commuting operator strategies. The first applies to all games and reduces the question of whether or not a game has a perfect commuting operator strategy to a question involving left ideals and sums of squares. Previously, Paulsen and others translated the study of perfect synchronous games to problems entirely involving a $*$-algebra.The characterization we present is analogous, but works for all games. The second characterization is based on a new Nullstellensatz we derive in this paper. It applies to a class of games we call torically determined games, special cases of which are XOR and linear system games. For these games we show the question of whether or not a game has a perfect commuting operator strategy reduces to instances of the subgroup membership problem and, for linear systems games, we further show this subgroup membership characterization is equivalent to the standard characterization of perfect commuting operator strategies in terms of solution groups. Both the general and torically determined games characterizations are amenable to computer algebra techniques, which we also develop.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。