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

- All Categories 2.4K
- Chat 505
- Study Groups 21
- Petri Nets 9
- Epidemiology 4
- Leaf Modeling 2
- Review Sections 9
- MIT 2020: Programming with Categories 51
- MIT 2020: Lectures 20
- MIT 2020: Exercises 25
- Baez ACT 2019: Online Course 339
- Baez ACT 2019: Lectures 79
- Baez ACT 2019: Exercises 149
- Baez ACT 2019: Chat 50
- UCR ACT Seminar 4
- General 75
- Azimuth Code Project 111
- Statistical methods 4
- Drafts 10
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 148
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 718

Options

## Comments

I presume that the person is making a statement about graphs generally and not a specific graph.

The person is confused about the difference between a round-trip vs. a trip for which has a return flight.

`I presume that the person is making a statement about graphs generally and not a specific graph. The person is confused about the difference between a round-trip vs. a trip for which has a return flight.`

Yes, the only isomorphisms in the free category of any graph are the identity morphisms. This follows from the fact that the morphisms in \(\bf{Free}(G)\) do not obey any equations (other than those required in the definition of a category, i.e., the left and right unit laws).

Suppose, by way of contradiction, that \(f:A\to B\) is a non-identity isomorphism in \(\bf{Free}(G)(A,B)\). Then there is a morphism \(g:B\to A\) such that \(f\circ g=\text{id}_A\) and \(g\circ f=\text{id}_B\). However, since \(f\) is not an identity morphism and the only equations among elements of \(\bf{Free}(G)(A,B)\) are the left and right unit laws, no such morphism \(g\) exists. In particular, if \(A\neq B\), then there are no equations at all between elements of \(\bf{Free}(G)(A,B)\). Even if \(A=B\), the only option is \(g=\text{id}_A\), which yields \(f\circ\text{id}_A=\text{id}_A\), so that \(f=\text{id}_A\), which contradicts the assumption that \(f\) is not the identity morphism.

`Yes, the only isomorphisms in the free category of any graph are the identity morphisms. This follows from the fact that the morphisms in \\(\bf{Free}(G)\\) do not obey any equations (other than those required in the definition of a category, i.e., the left and right unit laws). Suppose, by way of contradiction, that \\(f:A\to B\\) is a non-identity isomorphism in \\(\bf{Free}(G)(A,B)\\). Then there is a morphism \\(g:B\to A\\) such that \\(f\circ g=\text{id}_A\\) and \\(g\circ f=\text{id}_B\\). However, since \\(f\\) is not an identity morphism and the only equations among elements of \\(\bf{Free}(G)(A,B)\\) are the left and right unit laws, no such morphism \\(g\\) exists. In particular, if \\(A\neq B\\), then there are no equations at all between elements of \\(\bf{Free}(G)(A,B)\\). Even if \\(A=B\\), the only option is \\(g=\text{id}_A\\), which yields \\(f\circ\text{id}_A=\text{id}_A\\), so that \\(f=\text{id}_A\\), which contradicts the assumption that \\(f\\) is not the identity morphism.`

I see, some care must be taken when constructing a graph suitable for construction of a Free category.

When parallel paths are present in the graph the are assumed to be not equal unless there is an equation specifically stating otherwise.

The only exception to this rule is the case of the identity morphisms which have the implicit \( id \circ id = id \) equation.

`I see, some care must be taken when constructing a graph suitable for construction of a Free category. When parallel paths are present in the graph the are assumed to be not equal unless there is an equation specifically stating otherwise. The only exception to this rule is the case of the identity morphisms which have the implicit \\( id \circ id = id \\) equation.`