nLab
cone morphism

Definition

Let F:JC be a diagram in a category C. Also, for any objects c,c in C, let T:Δ(c)F and T:Δ(c)F denote cones over F.

A cone morphism is a natural transformation α:Δ(c)Δ(c) such that the diagram

Δ(c) α Δ(c) T T F \array{ \Delta(c) &{}&\stackrel{\alpha}{\longrightarrow} &{}& \Delta(c') \\ {}& \mathllap{\scriptsize{T}}\searrow &{}& \swarrow\mathrlap{\scriptsize{T'}} &{} \\ {}&{}&F&{}&{} }

commutes. Note that naturality of any such α implies that for all i,jJ, α i=α j, so that α=Δ(ϕ) for some ϕ:cc in C. The single component ϕ itself is often referred to as the cone morphism.

An equivalent definition of a cone morphism ϕ:TT says that all component diagrams

c ϕ c T j T j F(j) \array{ c &{}&\stackrel{\phi}{\longrightarrow} &{}& c' \\ {}& \mathllap{\scriptsize{T_j}}\searrow &{}& \swarrow\mathrlap{\scriptsize{T'_j}} &{} \\ {}&{}&F(j)&{}&{} }

commute.

Discussion

The following discussion took place at the component diagram above:

Eric: What is the “component free” way to say that?

Finn Lawler: I think the category of cones over F is the comma category Δ/F, so that a morphism α:TT should be just a natural transformation α:ΔcΔc such that Tα=T. That gives your condition in components, I think.

Eric: Thanks Finn! I’m still learning all this, so it’ll take me some time to absorb what you said. It sounds good though :) Either way, it sounds like some potentially good additional content.

Finn Lawler: I should point out that a natural transformation α:ΔcΔc is very nearly exactly the same thing as a morphism ϕ:cc (it’s ϕ in each component, which you’ll see if you draw α’s naturality square, so it’s Δϕ for some ϕ). Now look at the triangle above, write Δϕ:ΔcΔc instead of ϕ and erase the js and you have the morphism in the comma category.

I hope this helps. If it’s done the opposite, apologies. I’ve a habit of trying the one and accomplishing the other.

Eric: Hmm. I’m probably confused, but when I draw the naturality square for α:Δ(c)Δ(c), I get

c Id c c α j α k c Id c c.\array{ c & \stackrel{Id_c}{\to} & c \\ \alpha_j\downarrow && \downarrow \alpha_{k} \\ c' & \stackrel{Id_{c'}}{\to} & c' } \,.

for every j,kJ.

Eric: I think I got it. My diagram is correct, except we have α j=α k and we want this to be ϕ:cc. I made that more explicit in the definition above by adding “whose component is ϕ:cc.”

The full blown diagram looks like

c Id c c ϕ ϕ c Id c c T j T k F(j) F(f) F(k)\array{ c & \stackrel{Id_c}{\to} & c \\ \mathllap{\scriptsize{\phi}}\downarrow && \downarrow\mathrlap{\scriptsize{\phi}} \\ c' & \stackrel{Id_{c'}}{\to} & c' \\ \mathllap{\scriptsize{T'_j}}\downarrow && \downarrow\mathrlap{\scriptsize{T'_k}} \\ F(j)&\stackrel{F(f)}{\to}&F(k) }

Revised on November 5, 2009 16:29:43 by Eric Forgy (65.163.59.49)