Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 8628

Enriched categories, topoi, abelian categories, monoidal categories, homological algebra.

3 votes
Accepted

Retractions and left-factoring morphisms

Yes - these terms are equivalent. First, it is easy to see that any left-factoring morphism is a retraction: Suppose $l: A \to B$ and pick $Z:= B$ in your definition above and $f:= \mathsf{id}_B$. Si …
Dominic van der Zypen's user avatar
3 votes
1 answer
407 views

Extremal, but not regular monomorphism

Is there an example of a category, and a monomorphism $m:X\to Y$ between two objects such that $m$ is extremal, but not regular? (A monomorphism $m:X\to Y$ is said to be extremal if whenever $m=g\circ …
Dominic van der Zypen's user avatar
3 votes
1 answer
995 views

"Universal maps" as a universal property

In the question Fixed points and universal maps for posets, we find the following definition: if $P, Q$ are partially ordered sets, an order-preserving map $u:P\to Q$ is said to be universal if for ev …
Dominic van der Zypen's user avatar
1 vote
1 answer
201 views

"Canonical" graph structure on $\text{Hom}(G, H)$

By a graph I mean a pair $G = (V, E)$ where $V$ is a set and $E \subseteq [V]^2 := \{\{a,b\}: a\neq b \in V\}$. A graph homomorphism between graphs $G, H$ is a map $f:V(G)\to V(H)$ such that $\{v, w\} …
Dominic van der Zypen's user avatar
2 votes
Accepted

Categorical product of graphs and chromatic number

First, let me state that I don't believe this question is suitable for MO - but I'll give an answer anyway. The categorical product (in any category) of a family of objects $(G_i)_{i\in I}$ is charac …
Dominic van der Zypen's user avatar
5 votes
0 answers
70 views

Does the $D$-property have universal objects?

A space $(X,\tau)$ is called a $D$-space if whenever one is given a neighborhood $N(x)$ of $x$ for each $x\in X$, then there is a closed discrete subset $D\subseteq X$ such that $\{N(x): x\in D\}$ cov …
Dominic van der Zypen's user avatar
1 vote

Product and coproduct for bipartite graphs

Yes - the product is the categorical product of graphs, which is also bipartite (it's easy to see that if $G, H$ are bipartite, then $G\times H$ cannot contain odd circles), and the coproduct is the d …
Dominic van der Zypen's user avatar
8 votes
2 answers
694 views

Exponential objects in the category of measurable spaces

Let $\text{Meas}$ be the category of measurable spaces with measurable functions as morphisms. Does $\text{Meas}$ have exponential objects?
Dominic van der Zypen's user avatar
3 votes
1 answer
224 views

Is every frame monomorphism regular?

Is every monomorphism in $\mathbf{Frm}$, the category of frames, regular?
Dominic van der Zypen's user avatar
-1 votes
1 answer
199 views

Regular and extremal monomorphisms in the category of graphs

Let $\textbf{Grph}$ be the category whose objects are graphs $G = (V,E)$ such that $V$ is a set and $E \subseteq \mathcal{P}_2(V) := \{\{a,b\} \subseteq V: a\neq b\}$. We sometimes write $E(G)$ for $E …
Dominic van der Zypen's user avatar
3 votes
1 answer
397 views

Projective graphs

Let the category $\mathbf{Gr}$ consist of simple, undirected graphs, together with graph homomorphisms. We say that a graph $P$ is projective if for all graphs $A, B$ with a surjective graph homomorph …
Dominic van der Zypen's user avatar
2 votes
2 answers
372 views

Exponential object in the category of simple, undirected graphs

Let $G_i = (V_i, E_i)$ be simple, undirected graphs for $i=1,2$. A graph homomorphism is a map $f:V_1\to V_2$ such that $\{f(v), f(w)\}\in E_2$ whenever $\{v,w\}\in E_1$. By $\text{Hom}(G_1, G_2)$ …
Dominic van der Zypen's user avatar
9 votes
1 answer
385 views

Example of a connected graph $G$ with $G \cong G \times G$

For any simple, undirected graphs $G, H$, let $G\times H$ denote their category-theoretical product. What is an example of an infinite connected graph $G$ with $G \cong G \times G$? (Note that the tot …
Dominic van der Zypen's user avatar
3 votes
2 answers
709 views

Topological retraction vs categorical retraction

Let $(X,\tau)$ be a topological space. We say that $A\subseteq X$ is a topological retract if there is a continuous map $r:X\to A$ onto a subspace $A \subseteq X$ such that for all $a\in A$ we have …
Dominic van der Zypen's user avatar
4 votes
1 answer
283 views

Regular epimorphisms in the category of simple undirected graphs

Let $\textbf{Grph}$ be the category whose objects are graphs $G = (V,E)$ such that $V$ is a set and $E \subseteq \mathcal{P}_2(V) := \{\{a,b\} \subseteq V: a\neq b\}$. We sometimes write $E(G)$ for $E …
Dominic van der Zypen's user avatar

15 30 50 per page