Infinite combinatorial issues raised by lifting problems in universal algebra

TL;DR

This paper explores infinite combinatorial problems related to lifting issues in universal algebra, focusing on the critical point between algebraic varieties and the combinatorial tools used to analyze them.

Contribution

It surveys the combinatorial problems and results associated with lifting problems and the critical point concept in universal algebra.

Findings

Analysis of k-ladders and their role in critical point size

Use of large free set theorems in algebraic lifting problems

Development of infinite combinatorial frameworks for algebraic structures

Abstract

The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole array of problems, often involving lifting problems of either diagrams or objects, with respect to functors. These, in turn, involve problems that belong to infinite combinatorics. We survey some of the combinatorial problems and results thus encountered. The corresponding problematic is articulated around the notion of a k-ladder (for proving that a critical point is large), large free set theorems and the classical notation (k,r,l){\to}m (for proving that a critical point is small). In the middle, we find l-lifters of posets and the relation (k, < l){\to}P, for infinite cardinals k and l and a poset P.