Composition

Compsition can be thought of as a data type in Category Theory. It is often made of objects and maps. In Category Theory, compositions must obey the rule of associativity, which preserves sequential invariance at the map level. According to Mann, the compositional structure of maps must string together in a compatible fashion. This compatibility is realized by having maps connected to the same objects in the pairing structure. This compatibility condition can be satified using the notion of associativity. This property of being associative allows for systems to be packaged in different combinatorial options.

Failed to parse (unknown function "\tensor"): {\displaystyle A \tensor B \tensor C}
 = Failed to parse (unknown function "\tensor"): {\displaystyle A \tensor (B \tensor C)<>}
 = Failed to parse (unknown function "\tensor"): {\displaystyle (A \tensor B) \tensor C}

Associativity enables system abstraction and packaging in ways that are more convenient for mental absorption or complexity reduction. Composition is closely related to Monad and Symmetry.

Symmetries as the first Meta-Rule

According to Mathemaniac, symmetries can be thought of as mathematical operands that gets to be manipulated through some operations that preserves the properties of being symmetrical. These four most general properties are:

1. Closure: Symmetrical operations on symmetries always create symmetries
2. Associativity: Symmetries composition with symmetries are symmetries Associative
3. Identity/Unit: Doing nothing is a symmetrical operation
4. Inverse Exists: Symmetrical operations can be undone, and returns to the original symmetry.

A mathematical treatment of this subject was explained by Norm Wilberger in a video.

Talks about Combinators and Enumerable Sets here

Particularly talks about SK Combinators, and showing that these ideas, and enumerability, determines whether certain kinds of building blocks can be recursively composed or not. Watch Dana Scott's lecture 3on Lambda Calculus.