# PlanetPhysics/Axioms of Metacategories and Supercategories
### Introduction

This is a topic on the axioms of categories, metacategories and supercategories that are relevant, respectively, to mathematics and meta-mathematics.

### ETAS and ETAC

Categories were defined in refs. as mathematical interpretations of the `theories of abstract category' (ETAC). One can generalize the theory of categories to higher dimensions-- as in higher dimensional algebra (HDA)-- by defining multiple composition laws and allowing higher dimensional, functorial morphisms of several variables to be employed in such higher dimensional structures. Thus, one can introduce an elementary theory of supercategories (ETAS; as a natural extension of Lawvere's ETAC theory to higher dimensions. Then, supercategories can be defined as mathematical interpretations of the ETAS axioms as in ref..
Related concepts to the general notion of a supercategory recalled above can also be rendered graphically on a computer as a multigraph or a hypergraph. On the other hand, a supercomputer architecture and operating system software are examples of realizations of relatively simple, or lower dimensional supercategories, as explained in further detail in the next subsections.

### Metagraphs and Metacategories

A more recent version of Lawvere's axioms was presented by MacLane (2000) in which a metagraph is first defined as a structure consisting of objects $a,b,c,...x,y,z$, arrows $f,g,h,...$, and two operations-- the domain (which assigns to each arrow $f$ an object $a=dom~f$), and a codomain (which assigns to each arrow $f$ an object $b=cod~f$. Such operations can be readily represented by displaying $f$ as an actual arrow $.\to .$ starting at the $dom~f$ and ending at $cod~f$, $f:a\to b$. With this pictorial, or `geometric' representation, a finite number of arrows is depicted as a finite graph. Then, one defines a metacategory as a metagraph with two additional operations, identity and composition(viz.). Identity assigns to each object $a$ an arrow $id_{a}=1_{a}:a\to a<math>.A$composition$operationassignstoeachpairofarrows$(f,g)$with$dom ~g = cod~ f</math> an arrow called their composite, $g\circ f:dom~f\to cod~g$.
(See also the remark and example following this definition).
A metacategory is also subject to two additional axioms specified as the Associativity and unit law. Associativity requires that one always has the equality: $k\circ (g\circ f)=(k\circ g)\circ f$ for any given objects and arrows in the sequence: $f:a\to b,g:b\to c,k:c\to d$, whenever the compositions involved are defined. The Unit (law) axiom asserts that the identity arrow $1_{b}$ yields: $1_{b}\circ f=f$ and $g\circ 1_{b}=g$, for any $f:a\to b$ and $g:b\to c$.
Then, an extension of a metagraph to a `super-metagraph' with $(n+1)$ operations, $n$ of which are compositions $\circ ,*,\bullet ,...$ (or $\Gamma _{1},\Gamma _{2},...\Gamma _{n}$), and an additional operation being the Identity , defines a supercategory if the Unit law is also satisfied for all identity arrows.

### Graphic example of a supercategory

A pictorial representation of a particular class of metagraphs --the class of multigraphs, $M_{g}$-- is also useful as a visual or `geometric' (or topological) representation of a specific example of a supercategory defined over the topological space of the multigraph with the composition operations of the supercategory heteromorphisms defined, in this case of the multigraph, by the concatenations of the multigraph vertices in $n$ dimensions for a finite , $n$-dimensional multigraph that can be graphically rendered on a computer.
A supercomputer and its operating systems ($OS_{s}$ ) can be considered also as a practical realization of the concept of $n$-dimensional multigraph, and therefore as a specific example of a supercategory (but not of a super-category).
Let us recall in detail Lawvere's ETAC axioms (that are similar to the more concise version of MacLane's metacategory axioms in ref.):
0. For any letters $x,y,u,A,B$, and unary function symbols $\Delta _{0}$ and $\Delta _{1}$, and composition law $\Gamma$, the following are defined as formulas: $\Delta _{0}(x)=A$, $\Delta _{1}(x)=B$, $\Gamma (x,y;u)$, and $x=y$; These formulas are to be, respectively, interpreted as ``$A$ is the domain of $x$", ``$B$ is the codomain, or range, of $x$", ``$u$ is the composition of $x$ followed by $y$", and ``$x$ equals $y$".
1. If $\Phi$ and $\Psi$ are formulas, then "$[\Phi ]$ and $[\Psi ]$" , "$[\Phi ]$ or$[\Psi ]$", "$[\Phi ]\Rightarrow [\Psi ]$", and "$[not\Phi ]$" are also formulas.
2. If $\Phi$ is a formula and $x$ is a letter, then "$\forall x[\Phi ]$", "$\exists x[\Phi ]$" are also formulas.
3. A string of symbols is a formula in ETAC iff it follows from the above axioms 0 to 2.
A sentence is then defined as any formula in which every occurrence of each letter $x$ is within the scope of a quantifier, such as $\forall x$ or $\exists x$. The theorems of ETAC are defined as all those sentences which can be derived through logical inference from the following ETAC axioms:
4. $\Delta _{i}(\Delta _{j}(x))=\Delta _{j}(x)$ for $i,j=0,1$.
5a. $\Gamma (x,y;u)$ and $\Gamma (x,y;u')\Rightarrow u=u'$.
5b. $\exists u[\Gamma (x,y;u)]\Rightarrow \Delta _{1}(x)=\Delta _{0}(y)$;
5c. $\Gamma (x,y;u)\Rightarrow \Delta _{0}(u)=\Delta _{0}(x)$ and $\Delta _{1}(u)=\Delta _{1}(y)$.
6. Identity axiom: $\Gamma (\Delta _{0}(x),x;x)$ and $\Gamma (x,\Delta _{1}(x);x)$ yield always the same result.
7. Associativity axiom: $\Gamma (x,y;u)$ and $\Gamma (y,z;w)$ and $\Gamma (x,w;f)$ and $\Gamma (u,z;g)\Rightarrow f=g$. With these axioms in mind, one can see that commutative diagrams can be now regarded as certain abbreviated formulas corresponding to systems of equations such as: $\Delta _{0}(f)=\Delta _{0}(h)=A$, $\Delta _{1}(f)=\Delta _{0}(g)=B$, $\Delta _{1}(g)=\Delta _{1}(h)=C$ and $\Gamma (f,g;h)$, instead of $g\circ f=h$ for the arrows f, g, and h, drawn respectively between the `objects' A, B and C, thus forming a `triangular commutative diagram' in the usual sense of category theory. Compared with the ETAC formulas such diagrams have the advantage of a geometric--intuitive image of their equivalent underlying equations. The common property of A of being an object is written in shorthand as the abbreviated formula Obj(A) standing for the following three equations:
8a. $A=\Delta _{0}(A)=\Delta _{1}(A)$,
8b. $\exists x[A=\Delta _{0}(x)]\exists y[A=\Delta _{1}(y)]$,
and
8c. $\forall x\forall u[\Gamma (x,A;u)\Rightarrow x=u]$ and $\forall y\forall v[\Gamma (A,y;v)]\Rightarrow y=v$ .
With this terminology and axioms, a category is meant to be any structure which is a direct interpretation of ETAC. A functor is then understood to be a triple consisting of two such categories and of a rule F (`the functor') which assigns to each arrow or morphism $x$ of the first category, a unique morphism, written as `$F(x)$' of the second category, in such a way that the usual two conditions on both objects and arrows in the standard functor definition are fulfilled --the functor is well behaved, it carries object identities to image object identities, and commutative diagrams to image commmutative diagrams of the corresponding image objects and image morphisms. At the next level, one then defines natural transformations or functorial morphisms between functors as metalevel abbreviated formulas and equations pertaining to commutative diagrams of the distinct images of two functors acting on both objects and morphisms. As the name indicates natural transformations are also well--behaved in terms of the ETAC equations satisfied.

## ETAS Axioms:

* (S1) . All symbols, formulas and the eight axioms defined in ETAC are, respectively, also ETAS symbols, formulas and axioms; thus, for any letters $x,y,i,u,A,B$, and unary function symbols $\Delta _{0}$ and $\Delta _{1}$, and composition laws $\Gamma _{i}$, the following are defined as formulas : $\Delta _{0}(x)=A$,$\Delta _{1}(x)=B$, $\Gamma (x,y;u)$, and $x=y$.
The above formulas are to be, respectively, interpreted as ``$A$ is the domain of $x$", ``$B$ is the codomain, or range, of $x$", ``$u$ is the composition $x$ followed by $y$", and ``$x$ equals $y$"; letters $i,j,k,l,m,...$ are to be interpreted as ``either element, set or class ($C$ ) indices". An example of valid ETAC and ETAS formula is a couple or pair of two letters written as ``$(x,y)$"; a more general related example is that of Cartesian or direct products ${\Pi }_{i~in~C}$.
* (S2) . There are several composition laws defined in ETAS (as distinct from ETAC where there is only one composition law for each interpretation in any specific type of category ); such multiple composition laws $\Gamma _{i}$, with $i~in~C$ are interpreted as ``definitions of multiple (specific) mathematical structures, within the same supercategory ${\mathcal {\S }}$" .
In the case of general algebras, the multiple composition laws are interpreted as "definitions of \htmladdnormallink{algebraic structures" {http://planetphysics.us/encyclopedia/TrivialGroupoid.html}"}, (whereas categorical algebra is interpreted as being ``defined by a single composition law ${\Gamma }_{1}=\circ$ (or ``*" for -involution or $C^{*}$ -algebras )". An ETAC structure is thus identified by the singleton $\left\{1\right\}$ index set.

### Examples of supercategories

Pseudographs, hypergraphs, 1-categories, categorical algebras, $2$-categories, $n$-categories, functor categories, super-categories, super-diagrams, functor supercatgeories, double groupoids, double categories, organismic supercategories, self-replicating quantum automata, standard Heyting topos, generalized $LM_{n}$-logic algebra topoi, double algebroids, super-categories of double algebroids, and any higher dimensional algebra (HDA) are examples of supercategories of various orders.