Tietze Equivalences as Weak Equivalences

by   Simon Henry, et al.

A given monoid usually admits many presentations by generators and relations and the notion of Tietze equivalence characterizes when two presentations describe the same monoid: it is the case when one can transform one presentation into the other using the two families of so-called Tietze transformations. The goal of this article is to provide an abstract and geometrical understanding of this well-known fact, by constructing a model structuree on the category of presentations, in which two presentations are weakly equivalent when they present the same monoid. We show that Tietze transformations form a pseudo-generating family of trivial cofibrations and give a proof of the completeness of these transformations by an abstract argument in this setting.


page 1

page 2

page 3

page 4


Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm

This work is meant to be a step towards the formal definition of the not...

Genetic algorithms and the Andrews-Curtis conjecture

The Andrews-Curtis conjecture claims that every balanced presentation of...

General Theory of Image Normalization

We give a systematic, abstract formulation of the image normalization me...

Strictification of weakly stable type-theoretic structures using generic contexts

We present a new strictification method for type-theoretic structures th...

A Set-Theoretic Framework for Parallel Graph Rewriting

We tackle the problem of attributed graph transformations and propose a ...

Contractible_Spaces, Homotopy Equivalence and Homeomorphism in Digital Topology

This article provides a brief overview of the main results in the field ...

Neural-Network Guided Expression Transformation

Optimizing compilers, as well as other translator systems, often work by...