It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.2K
- Programming with Categories Course 21
- Exercises - Programming with Categories Course 15
- Applied Category Theory Course 341
- Applied Category Theory Seminar 4
- Exercises - Applied Category Theory Course 149
- Discussion Groups 50
- How to Use MathJax 15
- Chat 487
- Azimuth Code Project 108
- News and Information 147
- Azimuth Blog 149
- Azimuth Forum 29
- Azimuth Project 189
- - Strategy 108
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 711
- - Latest Changes 701
- - - Action 14
- - - Biodiversity 8
- - - Books 2
- - - Carbon 9
- - - Computational methods 38
- - - Climate 53
- - - Earth science 23
- - - Ecology 43
- - - Energy 29
- - - Experiments 30
- - - Geoengineering 0
- - - Mathematical methods 69
- - - Meta 9
- - - Methodology 16
- - - Natural resources 7
- - - Oceans 4
- - - Organizations 34
- - - People 6
- - - Publishing 4
- - - Reports 3
- - - Software 21
- - - Statistical methods 2
- - - Sustainability 4
- - - Things to do 2
- - - Visualisation 1
- General 41

Options

## Comments

Apparently there is a difference between paths and morphisms. I believe the morphisms form an equivalence group over the paths.

For example, to which morphisms do the following paths belong?

$$ id_z $$ $$ s $$ $$ s.s $$ $$ s.id_z.s.s $$

`Apparently there is a difference between paths and morphisms. I believe the morphisms form an equivalence group over the paths. For example, to which morphisms do the following paths belong? $$ id_z $$ $$ s $$ $$ s.s $$ $$ s.id_z.s.s $$`

Since the set of paths is isomorphic to \(\mathbb{N}\), let's see what the equation means in \(\mathbb{N}\). \(s^4=s^2\) corresponds to \(n\equiv n-2\) for \(n\geq4\). This means that every even number except 0 is equivalent to 2, and every odd number except 1 is equivalent to 3. So, there are 4 morphisms in \(\mathcal{D}\): \(\mathrm{id}_z,s,s^2,\) and \(s^3\).

Fredrick Eisele wrote in #1:

They certainly form equivalence classes. They don't quite form a group, though the paths of length at least 2 have a \(\mathbb{Z}/2\mathbb{Z}\)-like structure (with composition corresponding to addition modulo 2, and the even numbers corresponding to the identity).

`Since the set of paths is isomorphic to \\(\mathbb{N}\\), let's see what the equation means in \\(\mathbb{N}\\). \\(s^4=s^2\\) corresponds to \\(n\equiv n-2\\) for \\(n\geq4\\). This means that every even number except 0 is equivalent to 2, and every odd number except 1 is equivalent to 3. So, there are 4 morphisms in \\(\mathcal{D}\\): \\(\mathrm{id}_z,s,s^2,\\) and \\(s^3\\). Fredrick Eisele wrote in [#1](https://forum.azimuthproject.org/discussion/comment/18569/#Comment_18569): >I believe the morphisms form an equivalence group over the paths. They certainly form equivalence classes. They don't quite form a group, though the paths of length at least 2 have a \\(\mathbb{Z}/2\mathbb{Z}\\)-like structure (with composition corresponding to addition modulo 2, and the even numbers corresponding to the identity).`