Topological Birkhoff

Author:

Bodirsky Manuel,Pinsker Michael

Abstract

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B \mathbf {B} satisfies all equations that hold in a finite algebra A \mathbf {A} of the same signature if and only if B \mathbf {B} is a homomorphic image of a subalgebra of a finite power of A \mathbf {A} . On the other hand, if A \mathbf {A} is infinite, then in general one needs to take an infinite power in order to obtain a representation of B \mathbf {B} in terms of A \mathbf {A} , even if B \mathbf {B} is finite.

We show that by considering the natural topology on the functions of A \mathbf {A} and B \mathbf {B} in addition to the equations that hold between them, one can do with finite powers even for many interesting infinite algebras A \mathbf {A} . More precisely, we prove that if A \mathbf {A} and B \mathbf {B} are at most countable algebras which are oligomorphic, then the mapping which sends each term function over A \mathbf {A} to the corresponding term function over B \mathbf {B} preserves equations and is Cauchy-continuous if and only if B \mathbf {B} is a homomorphic image of a subalgebra of a finite power of A \mathbf {A} .

Our result has the following consequences in model theory and in theoretical computer science: two ω \omega -categorical structures are primitive positive bi-interpretable if and only if their topological polymorphism clones are isomorphic. In particular, the complexity of the constraint satisfaction problem of an ω \omega -categorical structure only depends on its topological polymorphism clone.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference35 articles.

1. Quasi-finitely axiomatizable totally categorical theories;Ahlbrandt, Gisela;Ann. Pure Appl. Logic,1986

2. The Birkhoff theorem for varieties of finite algebras;Banaschewski, B.;Algebra Universalis,1983

3. ℵ₀-categorical structures: endomorphisms and interpretations;Bodirsky, Manuel;Algebra Universalis,2010

4. Classifying the complexity of constraints using finite algebras;Bulatov, Andrei;SIAM J. Comput.,2005

5. Galois theory for Post algebras. I, II;Bodnarčuk, V. G.;Kibernetika (Kiev),1969

Cited by 30 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Complexity Classification Transfer for CSPs via Algebraic Products;SIAM Journal on Computing;2024-09-12

2. Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures;Journal of the ACM;2024-08-17

3. A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory;ACM Transactions on Computation Theory;2024-06-10

4. Polish topologies on endomorphism monoids of relational structures;Advances in Mathematics;2023-10

5. Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3