陪集关系代数的簇
The variety of coset relation algebras
AI总结:
针对陪集关系代数,证明其类是可方程公理化的簇,但无法通过有限方程组完成公理化,明确了该代数类的公理化性质。
摘要:
陪集关系代数是可嵌入某个全陪集关系代数的代数,后者由群系统、这些群商之间的协调同构系统以及用于“转移”相对乘法运算的陪集系统构造而成。我们证明陪集关系代数类是可方程公理化的(即它是一个簇),但没有有限方程组足以公理化该类(即该类不可有限公理化)。
英文摘要:
A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets that are used to "shift" the operation of relative multiplication. We prove that the class of coset relation algebras is equationally axiomatizable (that is to say, it is a variety), but no finite set of equations suffices to axiomatize the class (that is to say, the class is not finitely axiomatizable).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。