Free semigroupoid algebras and the first cohomology groups

Abstract

This paper investigates derivations of the free semigroupoid algebra LG of a countable or uncountable directed graph G and its norm-closed version, the tensor algebra AG. We first prove a weak Dixmier approximation theorem for LG when G is strongly connected. Using the theorem, we show that if every connected component of G is strongly connected, then every bounded derivation δ from AG into LG is of the form δ=δT for some T∈LG with \|T\|≤slant\|δ\|. For any finite directed graph G, we also show that the first cohomology group H1(AG,LG) vanishes if and only if every connected component of G is either strongly connected or a fruit tree. To handle infinite directed graphs, we introduce the alternating number and propose conj intro-in-tree. Suppose every connected component of G is not strongly connected. We show that if every bounded derivation from AG into LG is inner, then every connected component of G is a generalized fruit tree and the alternating number A(G) of G is finite. The converse is also true if the conjecture holds. Finally, we provide some examples of free semigroupoid algebras together with their nontrivial first cohomology groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…