\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{category of group-based universal algebras}

[[!redirects category of interest]]

\hypertarget{motivation}{}\subsection*{{Motivation}}\label{motivation}

Many categories of algebraic objects have similar properties. Classically [[abelian categories]], abstracted from categories of modules were central to homological algebra, but many important contexts were non-abelian, some as central as that of groups. In these non-abelian contexts, research has centred on finding common frameworks to understand better both the resulting objects and morphisms and the interpretation of their homological algebra.

There are many types of algebraic object which are `based' on some type of groups. Examples include groups themselves, [[modules]] over a ring, including, of course, vector spaces, then, adding more structure, [[associative algebras]], [[commutative algebras]], [[Lie algebras]], [[Leibniz algebras]], [[Poisson algebras]], and then the dialgebras and trialgebras introduced by [[Loday]], as well as [[crossed module]]s of groups. We will call these examples of \emph{group-based universal algebras}.

The similarities of the homological algebra of these settings suggested a study of what parts of that theory is common to all of these, and, conversely, what parts depend on particular properties of an example.

\hypertarget{remark_on_terminology}{}\paragraph*{{Remark on terminology}}\label{remark_on_terminology}

Before giving the definition, we note that categories of such group-based universal algebras are more often called \emph{categories of interest} in the literature. This term was introduced by Orzech in the first paper on their theory and, although very uninformative, has become fairly standard. Our preference for the title given here is that, hopefully, it does say more of the context of the ideas than merely saying they are `of interest'.

\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

In all these cases, the category, $\mathcal{C}$, of such `algebras' is [[monadic]] over $Set$. The monad, $\mathbf{T}=(T,\eta,\mu)$, involved is such that $T(\emptyset)$ is a singleton, the category $\mathcal{C}$ is [[pointed]], with the algebra $(T(\emptyset),\mu_\emptyset)$, that is the free algebra on the empty set, as its [[zero object]], and is complete and cocomplete. In fact, $\mathcal{C}$ is monadic over the category, $Set_*$, of \emph{pointed sets}.

Again in all these cases, the forgetful functor, $U:\mathcal{C}\to Set_*$ factors through the category of groups and all the operations in the corresponding algebraic theory of $\mathcal{C}$ are finitary, so $\mathcal{C}$ can be thought of as a category of \emph{groups with extra structure}, much as in the more general [[Omega-groups]]. We have, thus, that $\mathcal{C}$ is equivalent to a category $Grps^{\hat{\mathbf{T}}}$ for some monad $\hat{\mathbf{T}}$.

Within this abstract setting, one can formulate notions of subobject, center, etc, but to formulate in this setting the criteria for an object to be an ideal or normal subobject, it is useful to make the assumption that the theory of $\mathcal{C}$ can be presented by a set of operations and identities satisfying some extra conditions, most of which are versions of obvious ones from `algebra'.

\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

(Revision in progress)

By a \emph{group-based universal algebra}, we will mean an algebra for a theory, in the classical sense, which contains

\begin{itemize}%
\item a unique constant, denoted $0$;
\item a set, $\Omega$ of finitary operations;

\end{itemize}
and

\begin{itemize}%
\item a set, $\mathbb{E}$, of idenities or equations,

\end{itemize}
which are to satisfy

\begin{itemize}%
\item $\Omega=\Omega_0\cup \Omega_1\cup \Omega_2$ where $\Omega_i$ is the set of $i$-ary operations;


\item $\Omega_0=\{0\}$; $\Omega_1$ contains an operation $-$, $\Omega_2$ contains an operation $+$, (but $+$ is not assumed to be commutative) and $\mathbb{E}$ contains the group laws for $0,-,+$.



\end{itemize}
We define $\Omega^\prime_i$ to be the set of `extra' specified operations, so $\Omega^\prime_0 = \Omega_0\setminus \{0\}$, and so on.

We have the following conditions on the equations/identities:

\begin{itemize}%
\item for any $*\in \Omega^\prime_2$, $\Omega^\prime_2$ also contains $\ast^{op}$, where $x\ast^{op}y= y\ast x$;
\item for any $\omega \in \Omega^\prime_1$, $\mathbb{E}$ includes the identity $\omega(x+y)=\omega(x)+ \omega(y)$;
\item for any $\ast \in \Omega^\prime_2$, $\mathbb{E}$ includes the distributive law: $x\ast (y+z)= x\ast y+x\ast z$;
\item for any $\omega \in \Omega^\prime_1$ and $\ast \in \Omega^\prime_2$, $\mathbb{E}$ includes the identity $\omega(x)\ast y = \omega(x\ast y)$;
\item for any $\ast \in \Omega^\prime_2$, $\mathbb{E}$ includes the identity $x+(y\ast z)=(y\ast z)+x$;
\item for any $\ast, \circ \in \Omega^\prime_2$, there is a word $W$ such that $\mathbb{E}$ includes the identity: $(x*y)\circ z = W(x\ast_1(y\circ_1 z),\ldots, x\ast_m(y\circ_m z), y\ast_{m+1}(x\circ_{m+1} z),\ldots, y\ast_{n}(x\circ_{n} z)$, where $\ast_1\ldots,\ast_n$ and $\circ_1,\ldots,  \circ_n$ are operations in $\Omega^\prime_2$.

\end{itemize}
\hypertarget{properties}{}\subsection*{{Properties}}\label{properties}

Any category of group-based universal algebras is a variety of $\Omega$-groups (in the sense of Higgins) and so is automatically a [[semi-abelian category]]. This provides a useful set of fairly concrete examples for study in the semi-abelian / proto-modular context. In fact, they are [[protomodular category|strongly protomodular]], (and hence [[strongly semi-abelian]]). This means that in such categories you can deal with internal [[actions]] in more or less the same way as you do in the category of groups.

Moreover categories of group-based universal algebras are action accessible in the sense of Bourn-Janelidze, meaning that actions are not so far from being representable, allowing a Schreier-MacLane-like obstruction theory for the classification of extensions.

\hypertarget{related_entries}{}\subsection*{{Related entries}}\label{related_entries}

\begin{itemize}%
\item [[Omega-group]]


\item [[semi-abelian category]]


\item [[protomodular category]]


\item [[variety of algebras]]



\end{itemize}
\hypertarget{references}{}\subsection*{{References}}\label{references}

The original idea is in

\begin{itemize}%
\item Grace Orzech, \emph{Obstruction theory in algebraic categories I, II}, J. Pure Appl. Algebra \textbf{2} (1972) 287-340, 315 - 340.

\end{itemize}
The point about actions is in

\begin{itemize}%
\item [[G. Metere]], \emph{A note on strong protomodularity, actions and quotients,} Journal of Pure and Applied Algebra, 221 (2017) 75 - 88.

\end{itemize}
[[!redirects category of interest]]



\end{document}