I am continuing from Emergent algebras as combinatory logic (Part II). In this post I am introducing the emergent algebra sector and we are starting to see how relations between approximate operations can be understood as computations.

Before starting the explanations, let me mention that I think it has not been stressed enough that emergent algebras are not only about how “exact” algebraic structures emerge from “approximate” ones, but also about the fact that emergent algebras come with their own notion of differentiability. Moreover, from the viewpoint of emergent algebras there is no essential difference between the emergence of exact operations from approximate ones and differentiation! But this is for a future post, to come soon.

__________________

In the next definition I shall introduce some graphs in which I claim they correspond to the approximate operations from Definition 2′.

* Definition 3.* For any , the following graphs in are introduced:

- the approximate sum graph

- the approximate difference graph

- the approximate inverse graph

__________________

Let be a set of symbols . (These symbols will play the role of scale parameters going to .) With and with the abelian group we construct a larger abelian group, call it , which is generated by and by .

Now I introduce the emergent algebra sector (over the set ).

* Definition 4.* is the subset of (over the group ) which is generated by the following list of gates:

- arrows and loops,
- gate and the gates for any ,
- the approximate sum gate and the approximate difference gate , for any ,

with the operations of linking output to input arrows and with the following list of moves:

- FAN-OUT moves,
- Emergent algebra moves for the group ,
- Pruning moves.

The set with the given list of moves is called the emergent algebra sector over the set .

As you notice, I have not included the approximate inverse into the list of generating gates. That is because we can prove easily that for any we have . (If then we trivially have because it is constructed from emergent algebra gates decorated by elements in , which are on the list of generating gates.) Here is the proof: we start with the approximate difference and with an gate and we arrive to the approximate inverse by a sequence of moves, as follows:

We proved the following relation for emergent algebras: . This relation appears as a computation in graphic lambda calculus.

For another example of a computation in the emergent algebra sector see the post Emergent sums and differences in graphic lambda calculus.

## 4 thoughts on “Emergent algebras as combinatory logic (Part III)”