Embeddable partial groups

Abstract

We record a folklore theorem that says a partial group embeds in a group if and only if each word has at most one possible multiplication, regardless of choice of parenthesization. We further investigate the partial groups which are exemplars of non-embeddability. Finally we show that a partial groupoid embeds in a groupoid if and only if its reduction embeds in a group.

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…