|
FS(C) – being
the set of equivalence classes generated from the five graphs of the set-maps f,g,h,i,j
within FS(F123) ×FS(F123). The reader may imagine chains of dominos that provide
equivalences between their two ends. The dominos themselves are elements from the five
graphs (x1,f(x1)), (x1,g(x1)), (x2,h(x2)), (x3,i(x3)), (x2,j(x2)) (xi Ai) and can be
turned into their “mirror images” as well, i.e., into (f(x1),x1), ..., (j(x2),(x2)).
The three maps q1, q2 and q3 of this solution are induced by the injections
ei : Ai FS(F123).
In order to inspect a music-theoretical example, we study a much simpler diagram
M3, whose graph consists of just one node and one arrow. The node is loaded with the
TwelveToneChord- ![]() X}. For simplicity of notation, from now on, we use the
same symbol t3 instead of t3{}.
The reader might try to determine its Limit and Colimit before he or she continues reading. The diagram M3 has only one node, hence its Limit is a filter of the
TwelveToneChord-
Concrete examples of Messiaen3Chord- ![]() The Colimit of M3 classifies those TwelveToneChord-
|