We prove analogues of Schur’s lemma for endomorphisms of extensions in Tannakian categories. More precisely, let $\mathbf {T}$ be a neutral Tannakian category over a field of characteristic zero. Let E be an extension of A by B in $\mathbf {T}$. We consider conditions under which every endomorphism of E that stabilises B induces a scalar map on $A\oplus B$. We give a result in this direction in the general setting of arbitrary $\mathbf {T}$ and E, and then a stronger result when $\mathbf {T}$ is filtered and the associated graded objects to A and B satisfy some conditions. We also discuss the sharpness of the results.

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, Glymour and Halvorson.

In this paper, we determine the homotopy types of the Morse complexes of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if K contains two leaves that share a common vertex, then its Morse complex is strongly collapsible and hence has the homotopy type of a point. We also show that the pure Morse complex of a tree is strongly collapsible, thereby recovering as a corollary a result of Ayala et al. (2008, Topology and Its Applications 155, 2084–2089). In addition, we prove that the Morse complex of a disjoint union $K\sqcup L$ is the Morse complex of the join $K*L$ . This result is used to compute the homotopy type of the Morse complex of some families of graphs, including Caterpillar graphs, as well as the automorphism group of a disjoint union for a large collection of disjoint complexes.

Just like group actions are represented by group automorphisms, Lie algebra actions are represented by derivations: up to isomorphism, a split extension of a Lie algebra $B$ by a Lie algebra $X$ corresponds to a Lie algebra morphism $B\to {\mathit {Der}}(X)$ from $B$ to the Lie algebra ${\mathit {Der}}(X)$ of derivations on $X$. In this article, we study the question whether the concept of a derivation can be extended to other types of non-associative algebras over a field ${\mathbb {K}}$, in such a way that these generalized derivations characterize the ${\mathbb {K}}$-algebra actions. We prove that the answer is no, as soon as the field ${\mathbb {K}}$ is infinite. In fact, we prove a stronger result: already the representability of all abelian actions – which are usually called representations or Beck modules – suffices for this to be true. Thus, we characterize the variety of Lie algebras over an infinite field of characteristic different from $2$ as the only variety of non-associative algebras which is a non-abelian category with representable representations. This emphasizes the unique role played by the Lie algebra of linear endomorphisms $\mathfrak {gl}(V)$ as a representing object for the representations on a vector space $V$.

Let G be a group and A a set equipped with a collection of finitary operations. We study cellular automata $$\tau :{A^G} \to {A^G}$$ that preserve the operations AG of induced componentwise from the operations of A. We show τ that is an endomorphism of AG if and only if its local function is a homomorphism. When A is entropic (i.e. all finitary operations are homomorphisms), we establish that the set EndCA(G;A), consisting of all such endomorphic cellular automata, is isomorphic to the direct limit of Hom(AS, A), where S runs among all finite subsets of G. In particular, when A is an R-module, we show that EndCA(G;A) is isomorphic to the group algebra $${\rm{End}}(A)[G]$$ . Moreover, when A is a finite Boolean algebra, we establish that the number of endomorphic cellular automata over AG admitting a memory set S is precisely $${(k|S|)^k}$$ , where k is the number of atoms of A.

It is known that a countable $\omega $ -categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone homomorphism. We investigate the relationship between the existence of a clone homomorphism to the projection clone, and the existence of such a homomorphism which is continuous and thus meets the above criterion.

Fried and Kollár constructed a fully faithful functor from the category of graphs to the category of fields. We give a new construction of such a functor and use it to resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure ${\cal S}$, there exists a countable field ${\cal F}$ of arbitrary characteristic with the same essential computable-model-theoretic properties as ${\cal S}$. Along the way, we develop a new “computable category theory”, and prove that our functor and its partially defined inverse (restricted to the categories of countable graphs and countable fields) are computable functors.

Let ($\rm L$;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of ($\rm L$;C), i.e., the structures with domain $\rm L$ that are first-order definable in ($\rm L$;C). We show that up to existential interdefinability, there are finitely many such reducts. This implies that there are finitely many reducts up to first-order interdefinability, thus confirming a conjecture of Simon Thomas for the special case of ($\rm L$;C). We also study the endomorphism monoids of such reducts and show that they fall into four categories.

We devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fraïssé limit) embeds all countable semigroups. This approach not only provides us with a framework unifying the previous scattered results in this vein, but actually yields new applications for endomorphism monoids of the (rational) Urysohn space and the countable universal ultrahomogeneous semilattice.

We show that if A is a stable basis algebra satisfying the distributivity condition, then B is a reduct of an independence algebra A having the same rank. If this rank is finite, then the endomorphism monoid of B is a left order in the endomorphism monoid of A.

If $A$ is a stable basis algebra of rank $n$, then the set $S_{n-1}$ of endomorphisms of rank at most $n-1$ is a subsemigroup of the endomorphism monoid of $A$. This paper gives a number of necessary and sufficient conditions for $S_{n-1}$ to be generated by idempotents. These conditions are satisfied by finitely generated free modules over Euclidean domains and by free left $T$-sets of finite rank, where $T$ is cancellative monoid in which every finitely generated left ideal is principal.

We prove that any {0,1 }-preserving homomorphism of finite distributive lattices can be realized as the restriction of the congruence relations of a finite planar lattice with no nontrivial automorphisms to an ideal of that lattice, where this ideal also has no nontrivial automorphisms. We also prove that any {0,1 }-preserving homomorphism of finite distributive lattices with more than one element and any homomorphism of groups can be realized, simultaneously, as the restriction of the congruence relations and, respectively, the restriction of the automorphisms of a lattice L to those of an ideal of L; if the groups are both finite, then so is the lattice L.

This article fully characterizes categorically universal varieties of (0, 1)-lattices (that is, lattices with a least element 0 and a greatest element 1 regarded as nullary operations), thereby concluding a series of partial results [3, 5, 8, 10, also 14] which originated with the proof of categorical universality for the variety of all (0, 1)-lattices by Grätzer and Sichler [6].

A category C of algebras of a given type is universal if every category of algebras (and equivalently, according to Hedrlín and Pultr [7 or 14], also the category of all graphs) is isomorphic to a full subcategory of C. The universality of C is thus equivalent to the existence of a full embedding Φ : G→C of the category G of all graphs and their compatible mappings into C. When Φ assigns a finite algebra to every finite graph, we say that C is finite-to-finite universal.