arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.12600math.LOmath.CT
收藏

演化系统:一个研究通用数学结构的框架

Evolution systems: A framework for studying generic mathematical structures

Wiesław Kubiś, Paulina Radecka

AI总结:

本文提出抽象演化系统框架,用范畴、转换和原点统一描述通用数学结构,给出最复杂演化的存在条件,并将其推广到重写系统且证明 Newman 引理的类似结论。

摘要:

我们引入抽象演化系统的概念,它为研究通用数学结构及其性质提供了一个便利框架。粗略地说,演化系统是一个范畴,配有一类被称为转换的选定态射,以及一个被称为原点的选定对象。我们通过来自若干数学领域的一系列例子来说明它。我们表述了唯一“最复杂”演化存在的充分条件。当演化系统“生活”在模型论中且非平凡转换是一点扩张时,最复杂演化的极限以 Fraïssé 极限之名为人所知,即由满足若干显见公理的固定一类有限生成模型所确定的唯一可数万有齐次模型。演化系统也可被视为抽象重写系统的推广,其中偏序集被替换为范畴。在我们的设定中,重写过程发挥非平凡作用,而在重写系统中只有重写过程的结果是相关的。Newman 引理的一个类似结论在我们的设定中成立,尽管证明稍显精细,但仍基于 Huet 使用良基归纳的思想。

英文摘要:

We introduce the concept of an abstract evolution system, which provides a convenient framework for studying generic mathematical structures and their properties. Roughly speaking, an evolution system is a category endowed with a selected class of morphisms called transitions, and with a selected object called the origin. We illustrate it by a series of examples from several areas of mathematics. We formulate sufficient conditions for the existence of the unique "most complicated" evolution. In case the evolution system "lives" in model theory and nontrivial transitions are one-point extensions, the limit of the most complicated evolution is known under the name Fraisse limit, a unique countable universal homogeneous model determined by a fixed class of finitely generated models satisfying some obvious axioms. Evolution systems can also be viewed as a generalization of abstract rewriting systems, where the partially ordered set is replaced by a category. In our setting, the process of rewriting plays a nontrivial role, whereas in rewriting systems only the result of a rewriting procedure is relevant. An analogue of Newman's Lemma holds in our setting, although the proof is a bit more delicate, nevertheless, still based on Huet's idea using well founded induction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑