Difference between revisions of "Composition"
(Created page with "{{:Meta-Rule/Composition}}") |
|||
| (28 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Compsition can be thought of as a data type in [[Category Theory]]. It is often made of [[object]]s and [[map]]s. In [[Category Theory]], compositions must obey the rule of [[associativity]], which preserves sequential invariance at the [[map]] level. According to [[Jeremy Mann|Mann]]<ref>{{:Video/Intro to Category Theory I: the Data of a Category}}</ref>, the compositional structure of maps must string together in a '''compatible''' fashion. This [[compatibility]] is realized by having [[map]]s connected to the same [[object]]s in the pairing structure. This '''compatibility''' condition can be satified using the notion of [[associativity]]. This property of being [[associativity|associative]] allows for systems to be packaged in different combinatorial options. | |||
<math>A \otimes B \otimes C</math> = <math>A \otimes (B \otimes C)</math> = <math>(A \otimes B) \otimes C</math> | |||
The different arrangements of parenthesis packaging of expressions indicate that a system can be packaged in different sub systems. In other words, this condition:[[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]]. It is also important to know that if something is composable from some basic building blocks, that means almost everything can be [[decomposition|decomposed]] into certain [[universal component]]. | |||
=An Example of Composition= | |||
A concrete example of composition can be formulated this way: | |||
Let [[object]]s be elemets (<math>x_i</math>) of a [[set]] <math>X</math>, let [[map]]s, say <math>f</math> and <math>g</math> be functions between these [[object]]s. Then, [[composition]] is simply a composition of different [[function]]s. | |||
In this example, <math>f</math> and <math>g</math> can be composed in the following way: | |||
<math>h</math> =<math>f \circ g</math> = <math>f(g(x))</math> | |||
In the above example, <math>h</math> is said to be a new function that is composed of <math>f \circ g</math> in the specified sequence. | |||
{{:Meta-Rule/Composition}} | {{:Meta-Rule/Composition}} | ||
==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 [[Video/Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 3 of 5 - λC 2017|Dana Scott's lecture 3]]<ref>[https://youtu.be/8zk0yS8Jp5w?t=2100 Recursively Enumerable Sets]</ref>on Lambda Calculus. | |||
<noinclude> | |||
{{PagePostfix | |||
|category_csd=Meta Programming,Category Theory,Combinator,Recursion,Computability,Universal Component | |||
}} | |||
</noinclude> | |||
Latest revision as of 10:10, 24 July 2022
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[1], 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.
= =
The different arrangements of parenthesis packaging of expressions indicate that a system can be packaged in different sub systems. In other words, this condition: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. It is also important to know that if something is composable from some basic building blocks, that means almost everything can be decomposed into certain universal component.
An Example of Composition
A concrete example of composition can be formulated this way:
Let objects be elemets () of a set , let maps, say and be functions between these objects. Then, composition is simply a composition of different functions.
In this example, and can be composed in the following way:
= =
In the above example, is said to be a new function that is composed of in the specified sequence.
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:
- Closure: Symmetrical operations on symmetries always create symmetries
- Associativity: Symmetries composition with symmetries are symmetries Associative
- Identity/Unit: Doing nothing is a symmetrical operation
- 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[2].
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 3[3]on Lambda Calculus.
References
- ↑ Mann, Jeremy (Jun 25, 2020). Intro to Category Theory I: the Data of a Category. local page: Jeremy Mann.
- ↑ Wildberger, Norman J. (Nov 24, 2021). A (somewhat) new paradigm for mathematics and physics. local page: Insights into Mathematics.
- ↑ Recursively Enumerable Sets
Related Pages