## Universal property for collection of epimorphisms

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Question Is there a nice universal property which captures the notion of "collection of all epimorphisms out of a given object". Of course I will have to consider two epimorphisms $X \rightarrow Y$ the same if they are isomorphic over $X$. The answer to the dual question is yes, at least in a topos: The power object $P(X)=\Omega^X$ , where $\Omega$ is the subobject classifier can be thought of as "the collection of all subobjects of X". The universal property is just the property for exponentials.

Background (Not strictly necessary for the question): I have been reading Sheaves in Geometry and Logic by Mac Lane and Moerdijk. Their definition of an elementary topos is this: A category with pullbacks, a terminal object (i.e. all finite limits), a subobject classifier, and a power object for every object. They construct all other exponential objects from these axioms. The construction they use is to basically consider the "collection" of all graphs of morphisms. This is just the standard construction in set theory suped up to toposes.

This construction agrees with the set theoretic convention that a function should be regarded as a set of ordered pairs, i.e. if $f:A \rightarrow B$, then the set theorist will define $f$ as the image of the map $A \rightarrowtail A \times B$ induced by the $1_A$ and $f$ (this may be the most convoluted sentence I have ever written). Why not define functions dually? There is also a map $A+B \twoheadrightarrow B$ induced by $1_B$ and $f$. Then we could define $f$ as the partition of $A$ induced by this epimorphism, which seems like a perfectly nice way to define functions.

I was wondering if this construction could be used to construct exponential objects if I was given finite colimits and some kind of epimorphism classifier, or collection of epimorphisms out of a given object.

Comment if it turns out that there is no really nice answer to this question, do you think that has bearing on the fact that the formula for the number of subsets of a set is easy ($2^{|X|}$) but the formula for the number of partitions of a set is relatively hard (http://en.wikipedia.org/wiki/Partition_of_a_set)?

-

## 1 Answer

I think the natural meaning of "collection of all epimorphisms out of $X$" or "epimorphism classifier" in a category $\mathbf{S}$ would be: an object $E$, an object $Y\to E$ of $\mathbf{S}/E$, and an epimorphism $p\colon E\times X \twoheadrightarrow Y$ in $\mathbf{S}/E$, such that for any object $U$ and any epimorphism $q\colon U\times X\twoheadrightarrow Z$ in $\mathbf{S}/U$, there exists a unique morphism $f\colon U\to E$ such that $(f\times 1)^*q$ is isomorphic to $p$ under $E\times X$ in $\mathbf{S}/E$. In other words, a representing object for the presheaf on $\mathbf{S}$ which sends an object $U$ to the set of (isomorphism classes of) epimorphisms out of $U\times X$.

In a topos, such epimorphism classifiers can be constructed from power objects. Every epimorphism $X\twoheadrightarrow Z$ in a topos is the quotient of its kernel pair, which is an internal equivalence relation on $X$, i.e. a particular element of $P(X\times X)$, and every internal equivalence relation has a quotient. Therefore, the subobject of $P(X\times X)$ which internally "consists of all equivalence relations" can be shown to be an epimorphism classifier in the above sense.

-

This seems like it answers my question, but I will have to take some time to really understand it.  Do you think that it would be possible to use epimorphism classifiers in this sense instead of power objects in the definition of an elementary topos, and construct power objects using cographs instead of graphs?  I will have to play more with that. – Steven Gubkin Dec 4 2009 at 18:38
So I think that I almost understand the definition you gave.  Could you clarify my intuition a bit though? Let's just think about the category of sets.  Fix a set X.  Then I understand you could take E to be the set of equivalence relations on X.  What would $p$ and $Y$ correspond to in this case? – Steven Gubkin Dec 4 2009 at 19:21
In sets, yes, E would be the set of equivalence relations on X.  Y would be the set of pairs (R,z) where R is an equivalence relation on X and z is an equivalence class of R.  The map Y --> E is the obvious projection.  The map p takes (R,x) to (R,[x]) where [x] is the equivalence class of x under R.  – Mike Shulman Dec 4 2009 at 20:37
My gut feeling is that one won't be able to reconstruct power objects from epimorphism classifiers, but I don't have a counterexample in mind.  It does seem likely that one could construct exponentials from epimorphism classifiers in the way you describe, at least as long as the category has enough internal logic (e.g. is a positive Heyting category).  – Mike Shulman Dec 4 2009 at 20:41
Thank you! This clarifies things a lot.  I will try to construct exponentials in this way.  This is really just homework I am giving myself so that I know I understand what is going on in Mac Lane and Moerdijk's book, but I am happy that a deeper understanding of equivalence relations has come out of it! – Steven Gubkin Dec 4 2009 at 21:45
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 39, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9429193139076233, "perplexity_flag": "head"}