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

- All Categories 2.2K
- Applied Category Theory Course 355
- Applied Category Theory Seminar 4
- Exercises 149
- Discussion Groups 49
- How to Use MathJax 15
- Chat 480
- Azimuth Code Project 108
- News and Information 145
- 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 39

Options

For any set \(S\) there is a coarsest partition, having just one part. What surjective function does it correspond to?

There is also a finest partition, where everything is in its own partition. What surjective function does it correspond to?

## Comments

#1. The constant function, taking all elements to the terminal set, isomorphic with {1}.

`#1. The constant function, taking all elements to the terminal set, isomorphic with {1}.`

`1. This one is obviously the surjective function going from S --> 1 2. The obvious answer is the bijective function going from S <--> S. But for some reason, the absurd function 0 --> S also seems like it can create total discrete partitions although it isn't function at all. Am I crazy or mistaken?`

#2. The identity function, it is also injective. Takes every part/object to unique objects.

`#2. The identity function, it is also injective. Takes every part/object to unique objects.`

`1. Since there is only one part, it is the surjective function onto a single part-label, call it 1 2. Since there is one part-label per single-member part, the function must be in bijection with the part-labels, and the identity function will do, as in Fredrick's answer.`

#2 Michael, the absurd function may not count as surjective, since to be surjective asks for every element of the co-domain to be mapped to by at least one member of the domain, but the empty set has not one element to spare! Also, since the domain is not S, I don't think you could get a useful notion of partition of S from the preimages of the absurd function.

Remark 1.16 in the book is the first time we meet the relation between surjective functions and partitions in Chapter 1.

`\#2 Michael, the absurd function may not count as surjective, since to be surjective asks for every element of the co-domain to be mapped to by at least one member of the domain, but the empty set has not one element to spare! Also, since the domain is not S, I don't think you could get a useful notion of partition of S from the preimages of the absurd function. Remark 1.16 in the book is the first time we meet the relation between surjective functions and partitions in Chapter 1.`

Allan Erskine

I see your point and realize that \( 0 \rightarrow S \) wouldn't be a appropriate function in the traditional sense. I guess my question really is then does \( 0 \rightarrow S \) generate \( S \)?

`Allan Erskine I see your point and realize that \\( 0 \rightarrow S \\) wouldn't be a appropriate function in the traditional sense. I guess my question really is then does \\( 0 \rightarrow S \\) generate \\( S \\)?`

Michael, the usual sense in which an equivalence relation is determined by a function is by identifying any elements which map to the same value. (The partition is then the set of equivalence classes.) This only works for partitioning the domain relative to the codomain, so \(0 \to S\) would have to generate a partition on \(0\), not on \(S\). We could consider a different construction, in which elements of S are identified if they're mapped to by the same input, but this gives a discrete partition for

allfunctions, not just \(0 \to S\). This is because for a function to be a function, an input can only map to one output; therefore no two values in the codomain can be mapped to by a single value in the domain. Relative to this alternative construction, \(0 \to S\) is not particularly special.`Michael, the usual sense in which an equivalence relation is determined by a function is by identifying any elements which map to the same value. (The partition is then the set of equivalence classes.) This only works for partitioning the domain relative to the codomain, so \\(0 \to S\\) would have to generate a partition on \\(0\\), not on \\(S\\). We could consider a different construction, in which elements of S are identified if they're mapped to by the same input, but this gives a discrete partition for _all_ functions, not just \\(0 \to S\\). This is because for a function to be a function, an input can only map to one output; therefore no two values in the codomain can be mapped to by a single value in the domain. Relative to this alternative construction, \\(0 \to S\\) is not particularly special.`

Shouldn't this be Exercise 37?

`Shouldn't this be Exercise 37?`

Charles: There has been some relabeling of exercises in recent drafts. I think you'll find that nearly every exercise number here is now off by 2 or more.

`Charles: There has been some relabeling of exercises in recent drafts. I think you'll find that nearly every exercise number here is now off by 2 or more.`