PlanetPhysics/Alternative Definition of Category

From testwiki
Jump to navigation Jump to search

The notion of [[../Cod/|category]] may be defined in a form which only involves [[../TrivialGroupoid/|morphisms]] and does not mention [[../TrivialGroupoid/|objects]]. This definition shows that categories are a generalization of [[../TrivialGroupoid/|semigroups]] in which the closure axiom has been weakened; rather than requiring that the product of two arbitrary elements of the [[../SimilarityAndAnalogousSystemsDynamicAdjointnessAndTopologicalEquivalence/|system]] be defined as an element of the system, we only require the product to be defined in certain cases.

We define a category to be a set \footnote{ For simplicity, we will only consider [[../Cod/|small categories]] here, avoiding logical complications related to proper classes.} M (whose elements we shall term morphisms ) and a [[../Bijective/|function]] (which we shall term [[../Cod/|composition]]) from a subset D of M×M to M which satisfies the following properties:

 \item{\mathbf 1.} If a,b,c,d are elements of M such that (a,c)D and (a,d)D and (b,c)D, then (b,d)D. \item{\mathbf 2} If a,b,c are elements of M such that (a,b)D and (b,c)D, then (ab,c)D and (a,bc)D and (ab)c=a(bc) \item{\mathbf 3a} For every aM, there exists an element eM such that   #
  • (e,e)D and ee=e #
  • (a,e)D and ae=a #
  • For all xM such that (x,e)D, we have xe=x. \item{\mathbf 3a} For every aM, there exists an element eM such that #
  • (e,e)D and ee=e #
  • (e,a)D and ea=a #
  • For all xM such that (x,e)D, we have ea=x.

This definition may also be stated in terms of [[../Predicate/|predicate]] calculus. Defining the three place predicate P by P(a,b,c) if and only if (a,b)D and ab=c, our axioms look as follows:

 \item{\mathbf 0.} (a,b,c,d)P(a,b,c)P(a,b,d)c=d. \item{\mathbf 1.} (a,b,c,d)((e)P(a,c,e))((e)P(a,d,e))((e)P(b,c,e))z((e)P(b,d,e)) \item{\mathbf 2.} (a,b,c,d,e)P(a,b,d)P(b,c,e)(f)P(d,c,f)P(a,e,f) \item{\mathbf 3a.} (a)(b)P(b,b,b)P(b,a,a)((c,d)P(b,c,d)c=d) \item{\mathbf 3b.} (a)(b)P(b,b,b)P(a,b,a)((c,d)P(c,b,d)c=d)

That a category defined in the usual way satisfies these properties is easily enough established. Given two morphisms f and g, the composition fg is only defined if fHom(B,C) and gHom(A,B) for suitable objects A,B,C, i.e if the final object of f equals the initial object of g. The three hypotheses of axiom 1 state that the initial object of a equals the final objects of c and d and that the initial object of b also equals the final object of c; hence the initial object of b equals the final object of d so we may compose b with d. Axiom 2 states associativity of composition whilst axioms 3a and 3b follow from existence of [[../Cod/|identity]] elements.

To show that the new definition implies the old one is not so easy because we must first recover the objects of the category somehow. The observation which makes this possible is that to each object A we may associate two sets: the set 𝐋 of morphisms which have A as initial object, 𝐋=BObHom(A,B), and the set 𝐑 of morphisms which have A as final object, 𝐑=BObHom(B,A). Moreover, this pair of sets (𝐋,𝐑) determines A uniquely. In order for this observation to be useful for our purposes, we must somehow characterize these pairs of sets without reference to objects, which may be done by the further observation that, if we have two sets 𝐋 and 𝐑 of morphisms such that x𝐋 if and only if xy is defined for all y𝐑 and x𝐑 if and only if yx is defined for all y𝐋, then there exists an object A which gives rise to 𝐋 and 𝐑 as above. This fact may be demonstrated easily enough from the usual definition of category. We will now reverse the procedure, using our axioms to show that such pairs behave as objects should, justifying defining objects as such pairs.

Returning to our new definition, let us now define :M𝒫(M), r:m𝒫(M), ℒ𝒫(M), and ℛ𝒫(M) as follows:

(a)={bM(b,a)D}r(a)={bM(a,b)D}β„’={(a)aM}β„›={r(a)aM}

We now show that, if U,Vβ„’ then either UV= or U=V. Suppose that U,Vβ„’ and UV. Then there exists a morphism a such that aU and aV. By the definition of β„’, there exist morphisms b and c such that U=(b) and V=(c). By definition of , we have (a,b)D<math>and(a,c) \in D.Ifd \in U,then(d,b) \in D</math> so, by axiom 1, (d,c)D, i.e. d(c)=V. Likewise, switching the roles of U and V we conclude that, if dV, then dU. Hence U=V.

Making an argument similar to that of last paragraph, but with r instead of and β„› instead of β„’, we also conclude that, if U,Vβ„› then either UV= or U=V. Because of axiom 3a, we know that, for every aM, there exists bM such that a(b) and, by axiom 3b, there exists cM such that ar(c). Hence, the sets β„’ and β„› are each partitions of M.

Next, we show that, if Sβ„’ and a,bS, then r(a)=r(b). By definition, there exists a morphism c such that S=(c), so (a,c)D and (b,c)D. Now suppose that dr(a). This means that (a,d)D. By axiom 1, we conclude that (b,d)D, so dr(b)<math>.Likewise,switchingtherolesofaandb</math> in the foregoing argument, we conclude that, if dr(b), then dr(a). Thus, r(a)=r(b).

By a similar argument to that of the last paragraph, we may also show that, if Sβ„› and a,bS, then (a)=(b). Taken together, these results tell us that there is a one-to-one correspondence between of β„’ and β„› --- to each Sβ„’, there exists exactly one Tβ„› such that S×TD and vice-versa. In light of this fact, we shall define and object of our category to be a pair (P,Q) of subsets of M such that xP if and only if (x,y)D for all yQ and yQ if and only if (x,y)D for all xQ. Given two objects A=(P,Q) and B=(R,S), we define Hom(A,B)=PS. We now will verify that, with these definitions, our axioms reproduce the defining properties of the standard definition of category.

Suppose that A=(P,Q) and B=(R,S) and C=(U,V) are objects according to the above definition and that fHom(A,B) and gHom(B,C)<math>.Thenf \in Sandg \in R.Bythewaywedefinedourpairs,(g,f) \in D,sog \circ fisdefined.LethbeanyelementofQ</math>. Since fP, it follows that (f,h)D. Since (g,f)D as well, it follows from axiom 2 that (gf,h)D, so gfP. Let k be any element of U. Since gV, it follows that (k,g)D. Since (g,f)D<math>aswell,itfollowsfromaxiom2that(k,g \circ f) \in D,sog \circ f \in V.Hence,g \circ f \in P \cap V = {\rm Hom} (A,C).Thus,\circ</math> is defined as a function from Hom(A,B)×Hom(B,C)Hom(A,C).

Next, suppose that A=(P,Q) and B=(R,S) are distinct objects. By the properties described earlier, PR= and QS=. Let E and F be two objects. Since Hom(A,E)P and Hom(B,F)R, it follows that Hom(A,E)Hom(B,F)=<math>.Likewise,since{\rm Hom} (E,A) \subset Qand{\rm Hom} (F,B) \subset S,itfollowsthat{\rm Hom} (E.A) \cap {\rm Hom} (F,B) = \emptyset</math>. Hence, it follows that, given four objects A,B,E,F, we have Hom(A,E)Hom(B,F)= unless A=B and E=F.

[more to come]

Template:CourseCat