Morris (1990) : Pitch-Class Complementation and Its Generalizations

Yale University Department of Music
Pitch-Class Complementation and Its Generalizations

Author(s): Robert D. Morris
Source: Journal of Music Theory, Vol. 34, No. 2 (Autumn, 1990), pp. 175-245
Published by: Duke University Press on behalf of the Yale University Department of Music
Stable URL: http://www.jstor.org/stable/843837
Accessed: 26-02-2016 00:38 UTC
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://www.jstor.org/page/
info/about/policies/terms.jsp
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content
in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship.
For more information about JSTOR, please contact support@jstor.org.
Duke University Press and Yale University Department of Music are collaborating with JSTOR to digitize, preserve and
extend access to Journal of Music Theory.
http://www.jstor.org
This content downloaded from 141.218.1.105 on Fri, 26 Feb 2016 00:38:07 UTC
All use subject to JSTOR Terms and Conditions
PITCH-CLASS COMPLEMENTATION
AND ITS GENERALIZATIONS
Robert D. Morris
One view of pc-set complementation might be described as fol-

lows: consider a pc-set or operate on a pc-set, and what is left over,
with respect to the aggregate, is the complement. And without fur-
ther ado, mutual complementation will then be seen as the case
where two pc-sets intersect in a null set-that is, where each pc-set is
contained in the complement of the other. Under such passive defi-
nitions, complementation usually plays a minor part in most general
accounts of pc-set theory. As a result, many of the implicationsof the
"complement theorem"' have been masked until relatively
recently-an ironic situation, since this celebrated theorem was
among the first results to be published in the literature.2 Only in
twelve-tone studies where the completion of the aggregate or uni-
verse of pcs is endemic do we find complementation discussed and
considered as fundamental. For instance, in the now-standardtreat-
ment of basic hexachordal combinatoriality, hexachords must either
map into themselves or into their complements under twelve-tone
transforms. This encourages a categorization of pc-sets according to
their properties of maximal and minimal self-intersection.3
In an earlier article (Morris 1982), I examined the equivalence of
the 4,096 pc-sets under various sets of operations that form groups of
175
"canonical transformations"4in order to establish differing criteria
for pc-set relatedness in the composition and analysis of nontonal
music. A major concern was to understand how and why "set-
groups" whose pc-set members are related under the operations of
Tn, I, M, and their combinations are merged and/or related under
certain other operations that tend to preserve interval-classvectors of
pc-sets. Part of that project involved the role of (literal) pc-set and
(abstract) set-class (SC) complementation in mapping pc-sets onto
each other, with the result that complementation as represented by
the ZC-relation5was demonstrated to be at the heart of pc-set rela-
tions. Nevertheless, the lack of an altogether suitably formal and gen-
eral framework for the understanding of the relations between the
"classical" pc operations of transposition and inversion (without M
and MI) and nonstandard operations (which do not preserve "dis-
tance" or interval class) made the discussion of set groups and their
systems rather formidable and arcane.
One line of inquirynot considered in my earlier article is suggested
by partitioningthe aggregate into nonoverlapping subsets. These ag-
gregate partitions represent one important generalization of pc-set
complementation, because when all pcs are grouped into n disjoint
"parts" (that is, disjoint subsets of the aggregate), each part is found
in the complement of any of the others. This motivates me to consider
a new concept for pc-set categorization, the mosaic: all partitions re-
lated under a canonical group of transformations(usually Tn and I).6
In twelve-tone music, the mosaic is developed from the interaction of
partitions of pcs (considered as operators) on partitionsof order num-
bers (considered as entities) or vice-versa.7 Unfortunately, this ele-
gant situation falls by the wayside without the isomorphism of order
number and pc. Without any particularcompositional or analyticcon-
text for mosaics, we are forced to study them by enumeration and
categorization. Such an enterprise is daunting, because the number of
mosaics is vast and their interrelationsmuch vaster still. Even so, the
study of certain specially constructed partitions will help us under-
stand the general nature of pc complementation.
There are other aspects of this subject that are not intrinsicallyre-
lated to partitions or mosaics. Issues connected to the auralor written
identificationof SCs are highlighted by considering how small pc-sets
uniquely combine to form larger pc-set members of particular SCs.
Such combinations are developed into "multiple complementation,"
which has a number of compositional and analytic applications.
My plan of attack will be to begin with a definition and discussion
of what I call the "complement union property," which involves the
combination of disjoint pc-sets. In order to get a feel for the subject
and its implications for musical structure, I provide a number of
176
compositional applications that hinge on complement unions. The
complement union property is then connected to its dual property,
the "complement intersection property," after which both properties
are generalized. Such topics lead naturally to a consideration of the
degree of (abstract) complementation of a pc-set, that is: How many
ways can a pc-set be mapped into its complement under transposition
and/or inversion? This simple question has quite a few implications
for collecting pc-sets into "combination classes" that serve as a
generalization of hexachordal "regions" in twelve-tone music. Not
surprisingly, the topic spills over into a discussion of two-row com-
binatoriality from a "source-set" orientation.
An explanation of ZC-relation via various criteria is next dis-
cussed. The extension of ZC-relations from between two pc-sets to
among many invokes various partitions of the aggregate, whose parts
are related by union or intersection under various canonical transfor-
mations.
The next section on twelve-tone operators (TTOs), operations,
and cycles continues a theme introduced by the construction of par-
titions out of cycles of an operator. A general account of operator
transformations into equivalent, but simpler, sequences of pc ex-
changes helps us understandhow the standardpc operations and oth-
ers conspire to affiliate SCs into equivalence classes of set groups.
The development of the requirements of special nonstandardopera-
tions on pc-sets explicitly reflects back on complement unions and the
ZC-relation in ways only hinted at in previous work on such matters.
An examination of a section of a work by Milton Babbitt shows
how a transformationalaccount of music structureis driven by these
results.
Some Definitions
Before we can proceed, a number of basic definitions are needed.

Although this elementary list may seem unduly long, most of these
concepts and terms are found in the atonal theory literature.8Never-
theless, there are a few deviations and additions to that literaturethat
are starred for the experienced reader's convenience.
DEF 1: A pc-set is an unordered set of pcs.

Pc sets are written as pcs within curly brackets; variables are
shown by capital letters. Examples: X = {0456}; Y = {3478}. In the
labeling of pcs, we use the character "A" to stand for "10" and "B"
for "11."
177
DEF 1.1: The universe of pcs is designated U and is known as the
aggregate.
The null or empty set is shown by { }. Complementary pc-sets, X
and X-, are defined: X U X- = U and X n X- = { }.
THEOREM 1.2: IF X c Y, Y- C X-.

If X is contained within Y, then a set Z, where Z is the rest of U
not includingX, must include that portion of Y that does not intersect
with X (i.e., X U Z = U and X n Z = { }). Since the complement of
Y overlaps Z, the complement of X includes the complement of Y.
DEF 2: An operation is a one-to-one mapping performed on pcs and

pc-sets.
DEF 2.1.1: The identity operator is To (pc transposition by 0).

The classical pc transformationsof Tn (transposition) and I (inver-
sion) are operations. In this paper, I will be additionally concerned
with other defined operations, such as M and ALPHA.9
Operation variables are denoted by capital letters, usually G, H, J,
K, and L.
L{034}means do the operation L to the set {034}. If L were T6 then
{69A} = L{034}.
The composition or concatenation of operators on a pc-set are dis-
played by a string of operator variables immediately to the left of a
pc-set or pc-set variable, as shown in the following example:
GH{6734} means do H to {6734} first, then do G to that. If H is I
(pc inversion) and G is the operation where pc 6 becomes (maps to)
pc 9, 9 maps to 8, 8 maps to 1 and 1 maps to 6, with all other pcs
remaining unchanged, then H{6734} is {6598} and G performed on
{6598} is {9581}, thus {9581} = GH{6734}.
(*) An operation can be defined by listing its cycles. Thus T4 is
defined as (048)(159)(26A) (37B). The cycles of To are singletons:
(0) (1) (2) (3) (4) (5) (6) (7) (8) (9) (A) (B). The operation G, given
above, is defined by (6981) (0) (2) (3) (4) (5) (7) (A) (B). To save space,
we usually drop the singleton cycles from an operation definition, so
that G would be defined simply as (6981) and I (pc inversion) would
be given as (1B) (2A) (39) (48) (57).
DEF 2.1.2: Two operators G and H commute if GH = HG.

To and T6 commute with all classical transformations("TrOs" in
DEF 2.2.1 below), such as T5 and T4I. All transpositions mutually
commute, while Tn and I do not. Thus TsI and IT5 produce different
results.
178
DEF 2.1.3: Every operator H has an inverse G such that GH or
HG =
T0.
The inverse of H is usually given as H-1. If H is T5, then H-1 is T7.
All operators of the form TnI are their own inverses.
If H = H-1, H is called an involution.
DEF 2.1.4: The powers of an operator H are H, HH, HHH, HHHH,

etc.
Such powers are usually notated by exponents (that is, by super-
scripts). H done n times is shown by Hn; thus H = H1, HH is H2,
HHH is H3, and so forth.
DEF 2.1.5: The periodicity p of an operator G is the number of times

G is performed so that it equals To.
In other words, if GP = To, then p is the periodicity of G.
The periodicity of T6 is 2; the periodicity of T4 is 3; all TnI oper-
ations have a periodicity of 2. From these examples, the reader will
understandthat an involution has a periodicity of 2, that H-1 is equal
to Hp-1, and that Hw = Hx if w = xmod p*
DEF 2.2.1: The term TJTOdesignates a transformationof any com-

position of pc transposition and/or pc inversion.
To, T5, TsI, T4T6I, IIT2IT5 are TITOs.
(*) In other writings, the TTOs usually include compositions of T0,
I and/or M. In contrast, here the TTOs comprise only the distance-
preserving operations.'1
DEF 2.2.2: A TTO is in canonicalform if it is of the form Tn or TnI.
There are 24 T'TOsin canonical form. These are the 24 equiva-
lence classes of all TTOs (see Morris 1987, 124). Any arbitraryTTO
is a member of one of these classes. For example, T5T6is a member
of the class denoted by TB.
DEF 2.2.3: [T1TO]designates the set of T'TOsin canonical form.

[TTO] = {TOT, T2 T3 T4 T5 T6 T7 T8 T9 TA TB T0 T11T21T3I T41
T51 T61 T71 T81 T91TAI TBI}.
DEF 3.1: A pc-set X is invariant under an operation G if X = GX.

Let X be {1278}. X is invariantunder To, T6, T3I and T9I, because
X remains unchanged under any of these TTOs.
All pc-sets are (trivially) invariant under T0.
DEF 3.1.1: The degree of symmetry of a pc-set X is the number of

distinct TTOs that keep X invariant.
179
I show the degree of symmetry of X with the function DSYM(X);
using the X given above, DSYM(X) = 4. For any pc-set,
DSYM(X) > 0. The two largest values of DSYM are given here:
DSYM({02468A}) = 12 and DSYM(U) = 24.
THEOREM 3.1.2: DSYM(X) = DSYM(FX), where F is any TTO.

Proofs for this theorem and most of the others found in this paper
are found in the Appendix.
DEF 3.3: Two pc-sets are said to be Z-related if they have the same
ic content but are not related by any TiTOs.
Z-related pc-sets have the same cardinality (i.e., they have the
same number of pcs). {0146} and {0137} are Z-related, since they
share the same ic content (one type of each nonzero ic) but are not
related by a TTO.
DEF 3.4: Two pc-sets are said to be ZC-related if they are mutual
complements and neither one can map into the complement of the
other under a TTO.
ZC-pairs need not be of the same cardinality. Two examples of
pairs of ZC-related pc-sets: {23578} and {01469AB}; {023467} and
{1589AB}.
DEF 4.1: A set class is the set of pc-sets related by all (distinct) TTOs.
Given set-class Y, if X E Y, then GX E Y for all TTOs G.
The term set class (henceforth SC) is synonymous with terms such
as chord type, collection class, or set type. We use a combination of
Allen Forte's and John Rahn's names for the SCs. SC6-1[012345] is
the name of the set class containing chromatic hexachords."1When
the identity of a SC has been established, we may simply give the
Forte name alone, with or without the "SC" prefix: as in "SC 6-1" or
"6-1." We also use the notation SC(X) to mean the set class includ-
ing pc-set X. If X is {0369}, SC(X), is the set of "diminished-seventh
chords." (We could also write SC({0369}).
Please note that such locutions as "trichordal (or 3-pc) set class"
and "set class of cardinality 3" simply refer to a SC containing tri-
chordal pc-sets (related by TTOs); and similarlyfor tetrachords, pen-
tachords, and so forth.
DEF 4.2: The number of pc-sets in SC(X) is given by 24/DSYM(X).

The SC containing "whole-tone scales" has only two members,
{02468A} and {13579B}. This is because the DSYM({02468A}) is 12,
180
so the number of pc-sets in SC({02468A}) is 24/12 = 2. If
DSYM(X) = 1, then the number of members of SC(X) = 24.
The next set of definitions give relationships between SCs. They
are therefore designated as abstract, rather than literal, relations di-
rectly between pc-sets.
DEF 5.1: Abstract Inclusion: SC(X) C SC(Y), if there exists a TTO
G such that GX CY.
DEF 5.2: Abstract Complementation: SC(X) is the complement of

SC(Y) if there exists a TTO G such that GX- = Y.
DEF 5.3: SC(X) and SC(Y) are (abstractly) Z-related if X is
Z-related to Y.
DEF 5.4: SC(X) and SC(Y) are (abstractly) ZC-related if Y = X-

and X is ZC-related to Y.
The next two definitions are David Lewin's.12
DEF 5.5: The function EMB(SC(X),SC(Y)) gives the number of pc-

set members of SC(X) literally included (embedded) in one member
of SC(Y).
The pc-sets {346} and {356} are the only pc-set members of SC
3-2[013] that are included in pc-set {3456}, a member of SC
4-1[0123]; thus, EMB(3-2,4-1) = 2.
DEF 5.6: The function COV(SC(X), SC(Y)) gives the number of pc-
set members of SC(Y) that include (cover) one member of SC(X).
The pc-set {0123}is the only member of SC 4-1 that covers {013},
a member of SC 3-2. So COV(3-2,4-1) = 1.
From the preceding examples we see that EMB(X,Y) need not
equal COV(X, Y). However,
THEOREM 5.6: EMB(SC(X),SC(Y)) = COV(SC(Y-), SC(X-)).

This immediately follows from theorem 1.2.
(*) The next theorem shows that the COV and EMB functions for
the same SCs depend on the degrees of symmetry of the SCs.
THEOREM 5.7:
COV(SC(S),SC(T)) EMB(SC(S),SC(T))
DSYM(S) DSYM(T)
181
ComplementUnions
If the readerhas a fair amountof experiencewith set classesin
compositionand/oranalysis,he or she has probablylearnedto iden-
tify the SC of a particularpc-setwithoutoften resortingto the fool-
proof, but tedious, reductionof the pc-set to its "primeform"or
"normalorder,"andthenconsultinga tableof SCs. Whilethe inter-
val classes(henceforthics) andtrichordalSCsarememorizedandau-
rallyidentifiedeasilyenough,the hexachords,thoseindispensablepc-
sets in classicalatonal and twelve-tonemusic, are not so easily
learnedandassimilated.Beforeone hascompletemastery,one often
uses certainfeaturespossessedby all the pc-setsin a SC in orderto
singleout quicklywhethera pc-setunderconsiderationis a member
of a givenSCor not. These"crutches"arenot withoutvalue,forthey
are often basedon importantstructuralresourcesof the pc-setsin a
SC. For instance,one knowsthat the pc-setsin 6-2[012346]have a
chromaticrunof five pcs attachedto a last pc via a gap of one semi-
tone, thatthe pc-setsin 6-2 haveno specialinvariances(theirdegree
of symmetryis 1) and/orthattheymapinto theircomplementsunder
TnI (that is, they are not Z or ZC related). Sometimesthe "nick-
name"of a set class impliessuch features,as in "all-combinatorial
hexachords"and "all-intervaltetrachords."
The presenttopic buildson such heuristicmethodsof identifica-
tion. Thefeaturethatis at issueis exemplifiedby the observationthat
anycombinationof a whole-tonescaleanda lone pc producesa mem-
ber of SC 7-33[012468A].Despite its informality,this assertionim-
plies that the pc is not a memberof the whole-tonescale. Another,
but perhaps more surprising,example involves the all-trichord
hexachord(6-17[012478]).Any combinationof nonintersectingpc-
sets, one fromSC 3-5[016], the otherfrom SC 3-12[048],produces
a pc-setthatis a memberof 6-17. In otherwords,we cantakea mem-
ber of 3-12, say {048},andadd anymemberof 3-5 that does not in-
tersect with it-these are {127}, {167}, {56B}, {5AB}, {39A}, and
{A23}-to producesix differentpc-sets({012478},{014678},etc.), all
of whicharemembersof 6-17. Moreover,the samepropertyholdsif
one pc-setcomesfrom4-9[0167]and the otheris any (nonintersect-
ing) ic4; the resultis still a memberof 6-17.
We shallcall thispropertythe complement-union property(abbre-
viatedCUP) and formallydefineit as follows:
DEF 6.1: Given pc-sets V, S, and T, such that SE SC(X),
T E SC(Y),andV E SC(Z), if S n T = { }, andS U T = V, for all V,
S, and T, then SC(Z) has the complement-union property.
The definitionsays that S andT are disjointpc-setsthat combine
182
in union to produce V, a member of SC(Z) and that SC(Z) has CUP
if S is always a member of SC(X) and T is always a member of SC(Y).
We shall often refer to SC(Z) as the resultant SC. The whole-tone
scale example provided above specifies that S E SC 1-1[0], T E SC
6-35[02468A], and V E (resultant) SC 7-33[012468A]. Since CUP is
among SCs, the abstract nature of this relation could be stated in a
kind of shorthand: SC(S) U SC(T) = SC(V)-providing that we re-
member that S, T, and V are defined as above. Using this shorthand
we can write SC 6-35 U SC 1-1 = SC 7-33 or SC 3-5 U SC
3-12 = SC 2-4 U SC 4-9 = SC 6-17.
Table 1 gives all of the complement unions for pentachords and
hexachords. The table shows which unions are M/MI related to others
or themselves. The reader will note that of the SCs that contribute to
a particular complement union, either one or both have degrees of
symmetry higher than 1.
But before discussing such matters, I should point out that as the
resultant SC possesses pc-sets of greater cardinalities, the number of
complement unions grows very quickly. In Table 2, I have listed the
number of complement unions for each two-partition of pc-sets from
cardinality5 to 9. The growth of the number of resultant SCs is de-
pendent on the number of combinations of pairs of SCs at larger car-
dinalities. For instance, the number of SC pairs of cardinalities of 3
and 5 is (12 times 29) or 348 pairs of which 119 are complement
unions. A calculation of the number of possible pairs of SCs for each
possible two-partition shows that as the resultant SCs climb in cardi-
nality, the percentage of complement unions increases at an often
steeper rate. Of the possible combinations of SCs that could produce
a pentachordal complement-union resultant (= 100), only 5% actu-
ally do so. As we move to resultant SCs of 6, 7, 8, and 9 pcs, the
percentages are respectively: 8.27586%, 15%, 38.2415%, and
40.7351%. For the aggregate, the percentage maximizes at 54.718%.
Because of this, CUP becomes a less distinctive feature of larger
sets.13 In addition, as the size of the resultant SC's pc-sets goes up,
the degree of symmetry of the contributingSCs becomes a negligible
factor.
Applications of CUP
Before beginning a more formal treatment of CUP, I will discuss
its role in certain compositional systems. For my first application I
will use the complement union where 2-6 and 4-17 combine uniquely
to produce 6-16. In the theory of nonaggregate combinatoriality(see
Morris 1982-83 and 1987, 90-98), a SC that has CUP is detected by
183
Table 1
SC Complement Unions (Cardinalities 5 and 6)
SC(S) SC(T) SC(V) M
(2+3 = 5)
1, 2-1 3-12: 5-13 3
2. 2-3 3-12: 5-16 S
3. 2-5 3-12: 5-30 1
4. 2-6 3-12: 5-22 S
(1+4 = 5)
1. 1-1 4-28: 5-31 6
(3+3 = 6)
1. 3-1 3-12: 6-37 6
2. 3-2 3-12: 6-39 5
3. 3-5 3-12: 6-17 S
4. 3-6 3-12: 6-14 S
5. 3-7 3-12: 6-24 2
6. 3-9 3-12: 6-48 1
7. 3-10 3-12: 6-28 S
(2+4 = 6)
1. 2-1 4-25: 6-21 9
2. 2-1 4-28: 6-42 10
3. 2-2 4-9: 6-12 S
4. 2-2 4-28: 6-45 S
5. 2-3 4-25: 6-22 S
6. 2-3 4-28: 6-27 S
7. 2-4 4-9: 6-17 S
8. 2-4 4-28: 6-28 S
9. 2-5 4-25: 6-34 1
10. 2-5 4-28: 6-29 2
11. 2-6 4-1: 6-2 16
12. 2-6 4-7: 6-15 15
13. 2-6 4-10: 6-9 S
14. 2-6 4-17: 6-16 S
15. 2-6 4-20: 6-31 12
16. 2-6 4-23: 6-33 11
17. 2-6 4-28: 6-30 S
In the M column, S = the SC maps into itself (under M/MI); a num-
ber indicates the row of a M-related CUP.
enumerating the two-partitions of any member of the SC and deter-

mining the set-class memberships of each part of each two-partition.
Finally, one makes a "graph"of the SC's two-partitionSCs. If the SC
has CUP, the graphwill be "unconnected" and have as one of its sep-
arate components a two-partition like the one in example la. This
little "two-node graph" shows that 2-6 and 4-17 (the nodes) can
184
Table 2
of
Frequency Complement Unions for SCs of Cardinalities 5 to 9
Partition Card. # Cases Total
23 5 4
14 5 1 5
33 6 7
24 6 17
15 6 0 24
34 7 70
2 5 7 25
16 7 2 97
44 8 151
3 5 8 119
26 8 2
17 8 0 472
4 5 9 439
36 9 255
27 9 104
18 9 0 798
2-6 4-17
Example la
0347
367A
28 5B
4109
69A1
Example lb
28 367A 28 0347
0149 5B 367A 5B
Example 1c Example ld
<28367A5B4109> <2837A65B9 140>

S II t I I
SI I I
I- I
I i
Example le
185
form 6-16 (represented by the line connecting the nodes).14 Because
the short lines crossing the connecting line outside of each node in-
dicate that each node's SC member has a degree of symmetrygreater
than 1, a richer pool of actual (literal) pc-set connections is possible
than Example la (which represents only abstract SC relations) im-
plies. This literal graph is shown in Example lb. The four middle
nodes each contain a member of 4-17 and the left and right nodes
each contain a member of 2-6; any single move from one node to
another following the lines produces a union of pcs which is a member
of 6-16.
The uses of Example lb are many. One could compose or impro-
vise strings (or "chains") of pcs saturated with 6-16s, 4-17s, and tri-
tones. In fact, this use of literal SC two-partitiongraphs is a complete
study in itself. Two-dimensionalarrays(for use as or in compositional
designs) can be made from the literal graph, such as those in Exam-
ples ic and id. The two arrays are such that the union of the pc-sets
in each of their rows or columns is always 6-16, with the contents of
the arraypositions (boxes) filled only with 2-6 or 4-17 members. The
difference between the two arrays is that only Example 1c is aggre-
gate completing (having no pc duplication), while the other arraypro-
duces the SC 10-4 from its complete union of pcs. The aggregate
completion of Example ic also shows that we could have formed the
array from the 2242 partition {{06} {39}{1458}{7AB2}}. Since 6-16 is
not a Z-related hexachordal SC, the aggregate can be partitioned into
two 2-6s and two 4-17s. This means that this partition and the two
other members of the partition's mosaic have a degree of symmetry
greater than one; given any member of the mosaic, its parts remain
invariant under To, T6, TnI, and/or Tn+61, for some odd n. (For the
partition given above, the n is 3 (or 9); for example ic, another mem-
ber of the same mosaic, the n is 1 (or 7).) This quartet of TTOs forms
an important set of mathematical groups commonly found in atonal
music.15 Due to the invarianceunder the groups at hand, the number
of SCs formed by the union of the four parts of such partitionsinto 6-,
8-, and 10-pc-sets is less than the number of the different unions pos-
sible. The unions of two or more parts produces SCs 6-16 (4x), 4-28,
8-28, 10-6 (2x), and 8-17 (2x).
The arrayof Example id cannot be derived from a partition, since
it has pc duplication, but it does form larger sets from the unions of
its positions. Here the SCs are 6-16 (4x), 6-49, 4-28, 8-17 (2x), 8-9,
and 8-25. The duplications of SCs derive from the invariance of
the collection of array positions under To and TAI, a basic group of
order 2.
Example le holds two twelve-tone rows both "super-saturated"
with 6-16.16 The first is simply the partition of Example ic arranged
186
in alternate 2-6s and 4-17s. The second row is suggested by both ar-
rays in Example 1; it produces a series of dyads of 2-4 and 2-6, which
overlap in threes to produce 6-16s. This row could also be generated
by the 26 partition {{04}{37}{6A} {91}{28}{5B}}, which produces, in
unions of three parts, many different hexachords: 6-7 (2x), 6-16
(8x), 6-28 (4x), 6-35 (2x), 6-49 (4x). The eight instances of SC 6-16
characterize this collection of hexachords, six of which are available
in the row (if one wraps it around to form a twelve-tone cycle, or,
almost equivalently, if one uses rotation as a basic serial operation).17
Example 2a gives an isolated subcomponent of the (abstract)
graph of two-partitions of 6-17. This is the CUP cited above involv-
ing 4-9 and 2-4. The literal graph (Example 2b), which is derived
from Example 2a, is a good deal more complex than its counterpart
in Example ib, making the pc network that much more usefully di-
verse in improvisation/composition.Its 18 nodes contain all members
of SCs 4-9 (6) and 2-4 (12). Again, every union of pcs in two con-
nected nodes is a member of 6-17.
Since 6-17 is ZC-related to its complement, the arrayin Example
2c cannot also be derived from a partition of the aggregate. The array
has a TAI invariance (just like Example id) and therefore generates
a similarly concentrated set of pc unions; beyond the two 2-4s, two
4-9s and four 6-17s, one finds a 6-7, a 4-25, two 8-25s, and two
8-8s, with its entire pc content being a member of 10-6.
The lack of aggregate completion does not mean that this com-
plement union is of no use in twelve-tone composition. Although we
cannot generate a row with nonintersecting pc-sets restricted to 2-4
and 4-9, we can "expand" a column of a two-dimensional CM (com-
position matrice) or compositional design. (CMs are used to display
compositional designs of pcs where twelve-tone rows are written in a
CM's rows and the content of each CM column contains an aggregate
[see Starr and Morris 1977-78 and Morris 1987]. Each column of a
CM is a partially ordered set; while each of its positions contains an
ordered pc-set [each presumably a segment of a member of a row
class], the vertical alignment of these ordered sets is free.)
The left part of Example 2d gives a column from a five-part CM.
Note that the CM positions have singletons or sequences of pcs form-
ing ic 4 or ic 6. The right half of the example gives five "bars," elab-
orating the array column, so that each bar contains a member of
6-17. The reader will note that the repetitions of pcs in the five bars
produce minor order reversals of the lynes in the ordered pc-sets on
the left. These violations of order are resolved by ties in the (partial)
musical realization in Example 2e. There the sustained 4-9, with
accompanying ic 4s and ic 6s, provides an aural example of the SCs
involved in this complement union. But perhaps the most intriguing
187
4-9 2-4
Example 2a
6A 1278 59
8923 04 3B 0167
7B 15 2A 48
9A34 26 91 560B
80 AB45 37
Example 2b
1278 6A
04 2389
Example 2c
6 6 6 6 6 6
0 0 0 0 0 0
95B3 95 5B 5B3
17 17 17 17 7
2A48 2A 48 48
Example 2d
t .J
.5,,9
?_....M-
Example 2e
188
aspect of this example is its articulationof an entire aggregate by 6-17
alone, without its complementary ZC correspondent, 6-43.
A last set of examples illustratingthe compositional uses of CUP
is given in Example 3. Here a portion of Example 2b (to the left of
Example 3a) is compared with a portion of a similar literal graph (to
the right of Example 3a) derived from another complement union in
Table 1. The new complement union asserts 6-12 as the resultant of
4-9 and 2-4. From the example we see that the four-pc-set nodes are
identical (the two-pc nodes differ, but only by pc exchange); the
nodes containing 2A and 48 on the left (from Example 2b) become 24
and 8A on the right, involving the exchange of pcs 4 and A; a similar
"tritone swap" occurs between nodes 91 and 37 to yield 13 and 97
(here the ic 6 is 39). An arraysimilarto Example 2c (produced by the
4A swap) is given as Example 3b. The unions of the pcs in the latter
arraydiffer only from the former in two SCs; the 6-17s become 6-12
and the 8-8s become 8-6s. Such "mappings"of one network or array
of SCs into another are of great compositional and theoretical interest
and are the subject of the last portion of this paper.
Since the complement union property is tied into so many compo-
sitional applications, we are motivated to determine further criteria
for CUP. Fortunately, this is not a very difficult task, based on the
fact that if S n T = { }, then S C T-.
The result is given by the next theorem.
THEOREM 6.2: SC(S) and SC(T) produce CUP for SC(V) if

EMB(SC(S), SC(T-)) = DSYM(T) = DSYM(T-).
Connecting this with Theorem 5.7 produces the following criteria
for CUP:
excerpt from Example 2b
0167 0167
2A 48 24 8A
B056 B056
91 13
AB45 37 AB45 79
Example 3a
1278 46
OA 2389
Example 3 Example 3b
COR 6.2.1: SC(S) and SC(T) have CUP if the following holds:
COV(SC(S),SC(T-)) =1= EMB(SC(S),SC(T-))

DSYM(S) DSYM(T-)
Example 4 exemplifies the theorem and corollary.
Example 4
SC 6-16[023478] has CUP with 2-6[06] and 4-17[0347].
SC(V) = 6-16 DSYM(V) = 1
SC(S) = 2-6 DSYM(S) = 4
SC(T) = 4-17 DSYM(T) = 2 SC(T-) = 8-17 DSYM(T-) = 2
EMB(SC(S),SC(T-)) = 2
COV(SC(S),SC(T-)) = 4
EMB(SC(S),SC(T-)) = 2 = DSYM(T) = DSYM(T-).
and
COV(SC(S),SC(T-)) _ 4 _ EMB(SC(S),SC(T-)) _ 2
DSYM(S) 4 DSYM(T-) 2
Complement Intersection
In mathematicalset theory, if one has a true statement A, one can

always generate another true statement B by (1) replacing each set in
A by its complement in B and (2) by replacing each union in A by an
intersection in B and vice versa (see Lipschutz 1976, 5, 13-14). State-
ment A is called the dual of B and vice versa. The statement
"A n B = U" has "A- U B- = { }" as its dual.
We can use the dual transformationto produce a complement in-
tersectionproperty (CIP) for the (abstract) complement of SCs in-
volved in CUP. Thus, if SC(S) and SC(T) produce a CUP for
resultant SC(V), then SC(A) and SC(B) produce a CIP for SC(C)
where SC(A) is the abstract complement of SC(S), and likewise for
the pairs: SC(T) and SC(B); SC(V) and SC(C). That SC(C) has CIP
implies the following: for set classes SC(A), SC(B), and SC(C),
among all the pairs of pc-sets {a,b}, pc-set a taken from SC(A) and
pc-set b from SC(B), in each case where #(an b)= #C,
(a n b) E=SC(C).18Obviously, SC(C) has to have a smaller (or equal)
cardinality than either A or B. Perhaps the most salient feature of
190
CIP is A U B = U (because S n T = { } in CUP). Moreover, in CUP,
since SC(S) and SC(T) produce an intersection of maximal cardinal-
ity, so must SC(A) and SC(B) produce an intersection of minimal car-
dinality. Thus if SC(A) contains 5-pc-sets and SC(B) contains 9-pc-
sets, the minimal cardinalityof intersection is 2 (since if 3 of the pcs
of a pentachord are in the complement of a 9-pc-set, then we have an
aggregate, and two pcs must remain in common). The cardinalitiesof
the intersections and unions of a dual CIP and CUP add up to 12.
Thus, the dual of the just cited 5- and 9-pc CIP's maximalintersection
of 2 is the minimal union of a CUP involving SCs of 3- and 7-pcs
equalling 10.
The following is an example of CIP. We know that SC
6-17[012478] has CUP via SCs 2-4 and 4-9. Therefore, we can assert
that 6-43 (the ZC complement of 6-17) has CIP via SCs 10-4 and
8-9. This means that for the minimal intersection of 6 pcs from pairs
of pc-sets, one from 10-4 and the other from 8-9, all of these inter-
sections, without exception, produce a member of 6-43.19 But only
two of these (given in example 5) are distinct to within the TTOs; all
other intersections between members of the two SCs are related by
TTOs to these two.
Example 5
a = {012456789A} E 10-4
b = {234589AB}I 8-9
n =
(a b) {24589A} I 6-43
a = {012456789A}I 10-4
b = {034569AB}I 8-9
(a n b) = {04569A}
I 6-43
The dual relation between CUP and CIP has other implications.
The CIPs can be deduced from Table 1 simply by substituting com-
plements for each SC. Of course, one must be sure to substitute ZC-
related pc-sets among the hexachords. Just as the number of CUPs
increases for larger pc-sets, the number of CIPs increases for smaller
ones. One can also derive theorems for CIP from those given above,
but I leave that task to the reader.
Generalizations of CUP and CIP
We can generalize CUP and CIP by relaxing or extending their re-

quirements in a number of ways. First, we will vary the degree of in-
191
tersection between the members of SC(S) and SC(T) having CUP.
Up to now, these pc-set pairs have been required to be disjoint, so
that we can consider CUP and CIP to have a "degree of 0" and we
write CUPo and CIPo. With a degree of n we have CUPn, which
means that the members of the two SCs that in union produce a
"complement"union must intersect in n pcs. Therefore, CUP1 means
that any member of SC(S) and any member of SC(T) that overlap by
one pc taken in union result in a member of the resultant SC(V). A
well-known example is the union of a diminished-seventh chord (SC
4-28) with an augmented chord (SC 3-12); no matter what member
we take of each chord-type, we get a member of SC 6-28[013569].
This example is, of course, special because it works for all 12 mem-
bers of 3-12 paired with members of 4-28. Other SCs that have CUP1
do not have this maximal property. For instance, SCs 3-11[037] and
3-12[048] produce CUP, in SC 5-31[03478], but only when their
members intersect in one pc (as in the prime form of 5-31, which is
{037} U {048}). If we have no intersection (as in {048} U {A15}) or if
there are two pcs in common (as in {048} n {48B}), there is no CUP1.
Another property associated with CUPn concerns the case where
one of the participatingSCs contributing to the CUPn is equal to n.
Then we have a "trivial CUPn" in which all SCs (of sufficient cardi-
nality) have CUPn with themselves and a SC of cardinality n that is
abstractly included in the resultant. Hence, there are no CUPns for
SCs whose cardinalityis less than n and only trivial CUPs whenever
either of the contributing SCs' cardinalities equals n or less.
A tally of all CUP1 for pentachords and hexachords reveals that
only a handful of the total repertoire of SCs are represented: 5-1,
5-7, 5-19, 5-21, 5-28, 5-31, 5-33, 5-35, 6-1, 6-3, 6-5, 6-7, 6-15,
6-16, 6-17, 6-18, 6-20, 6-25, 6-27, 6-28, 6-30, 6-31, 6-32, 6-35.
The reader will note that most of these SCs are all-combinatorial
hexachords or pentachords or "all-but-one-subsets"or "-supersets"
thereof.20 The contributing pairs of SCs of cardinalities from 2 to 5
almost exclusively have degrees of symmetry greater than 1.
As for a CIPn of SC(C) produced by SC(A) and SC(B) derived as
above from a CUPn of SC(Z) produced by SC(X) and SC(Y), we
know that the cardinalitiesof SC(Z) and SC(C) add up to twelve. In
addition, the union of the members of A and B (that intersect in n
pcs) is a pc-set of cardinalityof 12-n. Thus, for example, the abstract
complements of SCs 4-28 and 3-12 always intersect in a 6-pc-set and
produce in union an 11-pc-set. And of course, the SC of cardinalityn,
the intersection set in CUPn, will determine the SC of the union of
pc-sets that contribute to CIPn; the two SCs are complementary. Ex-
ample 6 should make these dual relationships clear.
192
Example 6
CUP1:
CIPI:
3-1 U 4-3 = 6-3[012356] 9-1 n 8-3 = 6-36[012347]
X E 3-1[012] X- E 9-1[012345678]
Y E 4-3[0134] Y- E 8-3[01234569]
#(X n Y) = 1 #(X- U Y-)= 11
#(X U Y)= 6 #(X- n Y-)=6
(X n Y) E 1-1[0] (X- U Y-) E 11-1[0123456789A]
{012} U {2356} = {012356} {3456789AB} n {014789AB} =
{4789AB}
Another direction to pursue in generalizing CUP and CIP begins

with allowing more than two SCs to participate in the production of
a unique SC via union or intersection. This may seem to be simply
another way of talking about the partitions of the aggregate, but it is
not. Consider the following strategy. Take a set of pc-sets that par-
tition the aggregate and omit one pc-set so that the others in union
produce the complement of the omitted pc-set. One might then assert
that the SC of this complementary pc-set necessarily has CUP. Un-
fortunately, this would generally be wrong. The problem is that there
may be many other ways for the remaining SCs of the pcs of the par-
tition to contribute to other partitions. For instance, the mosaic in-
volving (nonintersecting) members of 3-1, 3-2, 3-3, and 3-11 is
unique; there is no other way for these four SCs to partition the ag-
gregate (to within the TTOs). Thus, we might think that 3-1, 3-2,
and 3-3 will produce a CUP for 9-11. However, there is a mosaic
that involves SCs 3-1 (twice), 3-2, and 3-3, so that 3-1, 3-2, and 3-3
can also form a member of 9-1 in union. (The three following mo-
saics make any other putative CUPs impossible to derive from the
{3-1, 3-2, 3-3, 3-11} mosaic: {3-1, 3-1, 3-2, 3-11}; {3-2, 3-2, 3-3,
3-11}; and {3-1, 3-3, 3-11, 3-11}.) A trichordal mosaic that does
work is 3-8, 3-9, 3-11, and 3-12. However, only 3-12 can be omit-
ted to produce a CUP for 9-12 from all unions of members chosen
(one from each) from SCs 3-8, 3-9, and 3-11. The CIP that falls out
of this special case says that any intersection of 3 pcs from the trio of
SCs 8-8, 8-9, and 8-11 will be an augmented chord. But despite the
infertility of a mosaic approach to CUP, it has its utility when more
than one SC is produced from the maximal intersection of members
of other SCs.
The possibility of a CUP shared by two or more SCs is of interest
when we see what cases develop. We can write CUPm for the case
193
where any member of SC(S) and any member of SC(T) produce in
union members of m different SCs. Where m is two we have com-
plement union pairs. Table 3 holds such pairs of pentachords and
hexachords. Here the resultant pairs are SC(V) and SC(W) produced
by SC(S) and SC(T). For instance, a member of 3-1[012] and
3-9[027] will produce only two hexachordal SCs, 6-8[023457] or
6-9[012357]; the two basic cases are {234} U {027}E 6-8 and
{027} U {456}
1E6-9.
Table 3
SC Complement-Union Pairs (Cardinalities 4 to 8)
SC(S) SC(T) SC(V) SC(W) M Z

(1+3 = 4)
1. 1-1 3-12: 4-19 4-24 S
(2+2 = 4)
1. 2-1 2-6: 4-5 4-12 3
2. 2-3 2-6: 4-29 4-15 X X
3. 2-5 2-6: 4-16 4-27 1
(2+3 = 5)
1. 2-2 3-12: 5-37 5-17 X X
2. 2-4 3-12: 5-21 5-33 S
3. 2-6 3-1: 5-4 5-8 5
4. 2-6 3-6: 5-12 5-36 X X
5. 2-6 3-9: 5-29 5-34 3
6. 2-6 3-10: 5-19 5-28 S
(1+4 = 5)
1. 1-1 4-9: 5-7 5-19 S
(3+3 = 6)
1. 3-1 3-9: 6-8 6-9 S
2. 3-1 3-10: 6-42 6-45 8
3. 3-3 3-12: 6-21 6-15 9
4. 3-4 3-12: 6-16 6-22 S
5. 3-5 3-6: 6-12 6-17 S
6. 3-6 3-10: 6-45 6-28 S
7. 3-8 3-12: 6-44 6-19 X X
8. 3-9 3-10: 6-29 6-45 2
9. 3-11 3-12: 6-34 6-31 3
10. 3-12 3-12: 6-20 6-35 S
194
(2+4 = 6)
1. 2-1 4-9: 6-5 6-13 19
2. 2-1 4-21: 6-22 6-34 20
3. 2-1 4-24: 6-21 6-22 21
4. 2-1 4-26: 6-47 6-40 18
5. 2-2 4-7: 6-16 6-31 7
6. 2-2 4-17: 6-15 6-31 S
7. 2-2 4-20: 6-15 6-16 5
8. 2-2 4-25: 6-41 6-23 S
9. 2-3 4-6: 6-5 6-18 X
10. 2-3 4-8: 6-5 6-18 X
11. 2-3 4-9: 6-38 6-6 X X
12. 2-3 4-21: 6-21 6-34 S
13. 2-3 4-24: 6-21 6-34 S
14. 2-4 4-1: 6-37 6-39 16
15. 2-4 4-10: 6-39 6-24 X
16. 2-4 4-23: 6-24 6-48 14
17. 2-4 4-25: 6-49 6-43 S
18. 2-5 4-3: 6-36 6-11 4
19. 2-5 4-9: 6-18 6-50 1
20. 2-5 4-21: 6-21 6-22 2
21. 2-5 4-24: 6-22 6-34 3
22. 2-6 4-2: 6-3 6-36 32 X
23. 2-6 4-3: 6-4 6-37 34 X
24. 2-6 4-4: 6-10 6-39 30 X
25. 2-6 4-6: 6-41 6-45 S
26. 2-6 4-8: 6-43 6-28 S
27. 2-6 4-9: 6-7 6-30 S
28. 2-6 4-11: 6-11 6-40 X X
29. 2-6 4-14: 6-24 6-46 24 X
30. 2-6 4-19: 6-44 6-19 X X
31. 2-6 4-21: 6-12 6-45 S
32. 2-6 4-22: 6-25 6-47 22 X
33. 2-6 4-24: 6-28 6-17 S
34. 2-6 4-26: 6-48 6-26 23 X
S = Each SC maps into itself (under M/MI or Z)
X = The two SCs exchange (map into each other)
From Table 3 it is apparent that two SCs are connected by CUP2

in such a way as to suggest that complement-union pairs might have
something to do with mappings of SCs into each other under TnM,
TnMI, and nonstandard operations. If we added such operations to
the TTOs, then many CU pairs would collapse into a CUP. Since
there are four Z-relations, and many exchanges or invarianceswithin
CU pairs or pairs of CU pairs on the table, I will examine CUP in the
195
context of general pc mappings later in this paper. As we shall see,
finding the right operation(s) to map a CUPminto CUP is related to
the degree of symmetry of pc-sets and their SCs. Thus, the presence
of high degrees of symmetry among SCs in CUPmis quite significant.
Multiple Complementation
By the manifestly paradoxical title of this section, I mean the
number of members of a SC(X) that are found included in SC(X-).
We therefore define the degree of complementationof a set class as
follows.
DEF 7.1: The degree of (abstract) complementation of a SC(X)

is given by the function DCOM(SC(X)). DCOM(SC(X))=
EMB(SC(X),SC(X-)).
The DCOM(3-1) = 7 since there are 7 members of SC 3-1 in a
member of SC 9-1, say {012345678}.In this case the 7 members are:
{012}, {123}, {234}, {345}, {456}, {567}, and {678}.
If DCOM(SC(X)) = 0, then either the cardinality of SC(X) is
larger than SC(X-) or SC(X) is ZC-related to its complement.
Since the degree of complementation is actually the EMB func-
tion, we need to spell out the relations between complementary pc-
sets and their degrees of symmetry.
THEOREM 7.1.1: If K is a TTO and X and Y are pc-sets, KX = Y

implies KX- = Y-.
THEOREM 7.1.2: DSYM(X) = DSYM(X-)
THEOREM 7.1.3: DCOM(SC(X)) = EMB(SC(X),SC(X-)) =

COV(Sc(x),sc(x-))
THEOREM 7.1.3 indicates that the distinction between the op-
erations (TTOs) that produce invariance of a pc-set X and the inclu-
sion of X in other pc-sets is of consequence when X is abstractly
included in its complement. For instance, we have just illustratedthat
DCOM(3-1) = 7. However, the number of operations that can map
a member of 3-1 to a member of 9-1 is 14. This situation is captured
by the next definition and theorem.
DEF 7.1.4: The COMOP(X) is the set of TTOs that map X into its
complement.
THEOREM 7.1.5: #COMOP(X) is the number of TTOs that map X
into its complement and is given by DCOM(SC(X)) * DSYM(X).
196
An examination of the DCOM function for all SCs of cardinalities
3 to 6 provides some further clues to the associations of SCs under
TTOs, M, and nonstandard operators. SCs related by M have iden-
tical DCOM numbers, but so do other groups of SCs of equal cardi-
nality. SCs 4-3, 4-9, 4-10, 4-15, 4-17, 4-20, 4-25, 4-26, and 4-29
have a degree of complementation of 3. The SCs with high DCOM
numbers are not necessarily ones with a high DSYM, since the two
functions are independent of each other, as suggested by THEOREM
7.1.5. For instance, 4-19 has a DSYM of 1 but a DCOM of 8, higher
than any other tetrachordal SC. As might be expected, the DCOM
numbers for larger SCs are increasingly lower, with the first ZC re-
lation (DCOM = 0) appearing among the pentachords. A hexachord
either has a DCOM of 1 or 0. Such information may be gleaned from
Table 4.
Further, the DCOM function shows that the number of equiva-
lence classes of the combination of disjoint pc-sets X and FX (for
all FE [TTO]) is not defined directly by the DSYM(X) or
DCOM(SC(X)). I illustrate this assertion with {0145}, a member of
SC 4-7, as X; DSYM(X) = 2 and DCOM(SC(X)) = 3. We enumer-
ate the three DCOM cases as: (1) {0145} and {2367}, (FX = T2X =
T7IX); (2) {0145} and {67AB}, (FX = T6X = TBIX); and (3) {0145}
and {AB23}, (FX = TAX = T3IX). The three cases do not give the
same number of distinct "combination classes" since if we take case
(3) under T2 (or T3I), we produce case (1) with X and FX inter-
changed. So there are only two combination classes. The equality of
the DCOM number with the degree of symmetryof a pc-set X is only
coincidental since there are many counterexamples; for instance, SC
4-21[0246] has a DCOM number of 6, produces 3 distinct combina-
tion classes, and its members have a degree of symmetry of 2.
In order to calculate the number of distinct combination classes we
need the following definition.
DEF 7.2: A combination class is the set of combinations of pc-sets FX

and FY for all F where F E [TTO].
A particular combination class is denoted by CC(X,Y) and
CC(X,Y) = CC(Y,X). The combination class for X = {012} and
Y = {56} has 24 members including: { {012}{56} }, { {345}{89} },
{ {0AB} {67} }, and { {678}{OB} }. These four members are respec-
tively generated by the TTOs To, T3, Tol and T6. From the definition,
we see that if we take either the union or intersection (or any other
set-theoretic operation) of the two pc-sets in each member of a com-
bination class, the resulting pc-sets form a SC.21
We are now prepared to determine the number of combination
classes based on two members of SC(X), X and FX (where F is a
197
Table 4
Degrees of complement inclusion for all SCs from 2 to 6 pcs
SC(X) DCOM(SC(X))
3-1 7 5-4 2 6-11 0 ZC
3-2 11 5-5 1 6-12 0 ZC
3-3 11 5-6 1 6-13 0 ZC
3-4 11 5-7 5 6-14 1
3-5 13 5-8 8 6-15 1
3-6 7 5-9 2 6-16 1
3-7 11 5-10 1 6-17 0 ZC
3-8 13 5-11 2 6-18 1
3-9 7 5-12 0 ZC 6-19 0 ZC
3-10 8 5-13 2 6-20 1
3-11 11 5-14 1 6-21 1
3-12 3 5-15 2 6-22 1
5-16 1 6-23 0 ZC
4-1 5 5-17 1 6-24 0 ZC
4-2 7 5-18 1 6-25 0 ZC
4-3 3 5-19 2 6-26 0 ZC
4-4 4 5-20 1 6-27 1
4-5 6 5-21 6 6-28 0 ZC
4-6 4 5-22 2 6-29 0 ZC
4-7 3 5-23 3 6-30 1
4-8 4 5-24 2 6-31 1
4-9 3 5-25 1 6-32 1
4-10 3 5-26 2 6-33 1
4-11 4 5-27 2 6-34 1
4-12 6 5-28 2 6-35 1
4-13 6 5-29 2 6-36 0 ZC
4-14 4 5-30 2 6-37 0 ZC
4-15 3 5-31 3 6-38 0 ZC
4-16 6 5-32 1 6-39 0 ZC
4-17 3 5-33 6 6-40 0 ZC
4-18 6 5-34 2 6-41 0 ZC
4-19 8 5-35 3 6-42 0 ZC
4-20 3 5-36 1 6-43 0 ZC
4-21 6 5-37 1 6-44 0 ZC
4-22 7 5-38 1 6-45 0 ZC
4-23 5 6-46 0 ZC
4-24 6 6-1 1 6-47 0 ZC
4-25 3 6-2 1 6-48 0 ZC
4-26 3 6-3 0 ZC 6-49 0 ZC
4-27 6 6-4 0 ZC 6-50 0 ZC
4-28 2 6-5 1
4-29 3 6-6 0 ZC
6-7 1
5-1 3 6-8 1
5-2 5 6-9 1
5-3 2 6-10 0 ZC
TTO). In point of fact, the number of cases of CC(X,FX) can be less
than 24 if GX = X. The combination of X and FX is the same as the
combination of X and FGX.22In the following, X is a pc-set, /N/ is the
set of TTOs in COMOP(X) that are not involutions. Thus, /N/ can
only contain transpositions with the exception of T6 and To.
THEOREM 7.2.1: NCC(F,X) is the number of distinct cases of

CC(X,FX) for all F where X and FX are disjoint and is given by
DCOM(X) - (#/N/)/2.
Example 7a illustrates the theorem for X E 3-3[014], for which
DCOM(X) = 11. With X = {014}, the 11 cases of complement map-
ping, with the TTOs that produce them, are shown with equivalent
results given in the right-mostcolumn. Since there are two equivalent
pairs, there are 9 distinct combination classes. Theorem 7.2.1 predicts
that NCC(F,{014}) = 9. This value is derived as follows: COMOP =
{T2 T5 T6 T7 TA T3 TI T71 T81 TAI TBI}; /N/ is therefore {T2 T5 T7
TA} (all other members of COMOP are involutions); #/N/ = 4;
(#/N/)/2 = 2. After filling in the theorem, we have 11 - 2 = 9 distinct
combination classes made of X and FX.
Example 7
X = {014}
FX = T2X {236} CC({014},{236})
TsX {569} CC({014},{569})
T6X {67A} CC({014},{67A})
T7X {78B} CC({014},{78B}) = T7CC({014},{569})
TAX {AB2} CC({014},{AB2}) = TACC({014},{236})
T3IX {23B} CC({014},{23B})
TsIX {256} CC({014},{256})
T7IX {367} CC({014},{367})
T8IX {589} CC({014},{589})
TAIX {69A} CC({014},{69A})
TBIX{7AB} CC({014},{7AB})
Example 7a
X = {0134}
FX = T5X, T8IX {5689} CC({0134},{5689})
T6X, TAIX{679A} CC({0134},{679A})
TX, TBIX {78AB} CC({0134},{78AB})= T7CC({0134},{5689})
Example 7b
199
The reader will note that the result of THEOREM 7.2.1 is inde-
pendent of the degree of symmetryof X. Example 7b provides a case
for an X-a member of SC 4-3-with a degree of symmetry of 2.
Here /N/ = {T5 T7}, with DCOM(SC(X)) = 3. Thus NCC(F,X) = 2
since DCOM(SC(4-3)) - (#/N/)/2 = 3- 1 = 2.
From the consideration of these examples and (1) that all TnI op-
erations are involutions and (2) that Tn is an involution only if n is 0
or 6, THEOREM 7.2 may seem more complicated than it is worth;23
one can calculate NCC(F,X) by simply taking x away from
DCOM(X) where x is the number of operations F that are transpo-
sitions whose n is higher than 6. Now if FE /N/, then F is Tn, and F-1
is T12-n. Now, either n or 12-n is greater than 6 or the transposition
will be T6 (an involution), so that the proviso that half the number of
noninvolutions that map X into X- be subtractedfrom DCOM(X) is
accomplished simply by subtracting the number of Tn operations
where n is greater than 6. This leads to the following corollary of
THEOREM 7.2.1.
COR 7.2.2: NCC(F,X) for all F where X and FX are

disjoint = DCOM(X) - #/T/ where /T/ is the set of Tn where n > 6
that can equal F.
One can read the number of zero entries (except the last place for
ic 6) in the interval vector of X to get #/T/, and once DCOM(X) is
known, NCC(F,X) is easily established. For our two examples of X
above, 3-3 and 4-3, whose sets' interval vectors are respectively
[101100] and [212100], we compute: for 3-3, NCC(F,{014}) =
DCOM(3-3) - 2 = 11 - 2 = 9; and for 4-3, NCC(F,{0134}) =
DCOM(4-3) - 1 = 3 - 1 = 2.
There are many uses for THEOREM 7.2.1. The number of com-
bination classes for X and disjoint FX provides a way of building and
enumerating partitions of the aggregate. If all distinct combination
classes of X and Y are each taken in union and every result is of the
same SC, we have CUP. But perhaps a more practical use of THE-
OREM 7.2.1 is in the context of combinatoriality,which I will discuss
shortly.
Applications of Multiple Complementation

The degree of complementation has important implications for
theories of atonal analysis, such as Allen Forte's, that emphasize in-
clusion relations and complementation (see Forte 1973, 73-83). Forte
has pointed out that many compositions of twentieth-century music
have passages where a larger pc-set is compositionally articulated by
200
its own "embedded complement." This means that a pc-set X is mu-
sically differentiated by smaller sets, many or all of which are mem-
bers of SC(X-). Obviously, the larger the DCOM, the more
possibilities for its presence as a unifying factor in music.24Further-
more, Forte's K and Kh relations, which generalize "embedded com-
plementation," are further differentiated by the DCOM function;
some K and Kh relations are articulatable in many ways, others by
only one path of pc-set inclusions and complementations.
Another avenue for differentiation via the DCOM function is
found within the theory of twelve-tone combinatoriality. Tradition-
ally, the basics of combinatorialityare taught by examining the cases
and functions of hexachordal combinatoriality. More general ap-
proaches tend to eschew a "source-set" approach to aggregate com-
pletion, stressing rather the operations that produce partitions of the
aggregate and/or the combinations and transformationsof CMs.25In
such a context, hexachordal combinatorialityis simply seen as a sub-
species of "two-row combinatoriality," which has only two basic
cases. These two cases are given by the following rules (Starr and
Morris 1977-78, 16-17).
1. A row P has case 1 combinatorialityif it beginsor ends with a seg-
ment whose content is invariantunder a TTO F. The rows P and
RFP producethe combinatoriality.
2. A row has case 2 combinatorialityif it beginswith a segmentwhose
content is relatedunderat least one TTO F to the contentof a seg-
ment that ends the row. The rows P and FP producethe combina-
toriality.
Neither the size of the beginning nor ending segments nor the
identity of the TTO F is specified, and without loss of generality, we
can confine ourselves to segments that are of 6 pcs or fewer. Case 1
is dependent on the DSYM of the segment and the resultingrow com-
bination involves R. Case 2 is dependent on both the DCOM and
DSYM of the segment and does not include a retrograderelation be-
tween the resulting rows. We can also understand that the hexa-
chordal P and I types26of combinatoriality are instances of case 2,
while the R, nontrivial R, and RI types are instances of case 1. All
rows produce trivial R-type combinatorialityby rule 1 with F equal to
To.
The second case implies that the row P is considered to be sliced
into three parts: the opening segment, the closing segment, and the
segment between the two. Hence, if the opening segment is a tri-
chord, P can be regarded as partitioned 3,6,3. In general, such par-
titioning is of the form n, 12-2n, n, where n is cardinality of the
201
opening segment. We see that the hexachordal case is special only
because the middle segment is empty. Thus, if the first hexachord of
a row is not ZC-related, P- or I-type combinatorialityis immediately
possible due to rule 2. In the nonhexachordalcases, rule 2 is not sat-
isfied just because the first segment's content has a nonzero DCOM;
one must place a TTO transformationof that segment's content at the
end of the row.
All of this means that we can have source-sets of any cardinalityto
generate P, I, R, and RI types of two-row combinatoriality. Pc sets
that can produce all four types are "all-combinatorial."Such pc-sets
have a degree of complementation higher than 0 and a degree of sym-
metry greater than 1. Table 5 gives the all-combinatorialSCs. Exam-
ple 8 illustrates the all-combinatorialityof a row that begins with a
member of SC 4-3. Note that the TTOs in the example
(To, T41,T7,
T8IP) do not form a group or a coset of a group as they would with
all-combinatorialhexachords.
Example 8
P: 0413 AB726985
RP: 589627BA 3140
P: 0413 AB726985
RT4IP: B87A2956 1304
P: 0413 AB726985
T7P: 7B8A5629 1430
P: 0413 AB726985
T9IP: 9586BA27 3014
While it might be objected that the number of possibilities for
combinatoriality are generally limited with small begin and end seg-
ments, the high DCOM numbers that the content of small segments
possess provides a new resource. A hexachord's degree of comple-
mentation is either 1 or 0. This means that a row that starts with a
given hexachord must end with that hexachord's literal complement.
In contrast, depending on its DCOM number, a smaller opening seg-
ment may be followed by as many as 13 different end segments that
are related by different TTOs to the opening segment. To illustrate,
we review Example 8, which presents a row that begins with <0413>
and ends with <6985>, members of SC 4-3. Other rows with the
same combinatorial potential can be made by permuting P's opening
and ending 4 pcs. Thus, a family of rows that startwith {0134}and end
with {5689}, members of SC 4-3, is formed. Since the DCOM number
of members of 4-3 is 3, there are two other families of rows that begin
{0134} and end with some member of 4-3 that is not {5689} and
202
Table 5
All-combinatorial SCs
3-1 [012]
3-6 [024]
3-9 [027]
3-10 [036]
3-12 [048]
4-1 [0123]
4-3 [0134]
4-6 [0127]
4-7 [0145]
4-8 [0156]
4-9 [0167]
4-10 [0235]
4-17 [0347]
4-20 [0158]
4-21 [0246]
4-23 [0257]
4-25 [0268]
4-26 [0358]
4-28 [0369]
5-1 [01234]
5-8 [02346]
5-15 [01268]
5-17 [01348]
5-22 [01478]
5-33 [02468]
5-34 [02469]
5-35 [02479]
5-37 [03458]
6-1 [012345] A
6-7 [012678] D
6-8 [023457] B
6-20 [014589] E
6-32 [024579] C
6-35 [02468A] F
The letters after the hexachordal SCs are those used by Donald Mar-
tino to label the six all-combinatorialhexachords.
thereby have the all-combinatorial property. These are <{0134},

. . , {679A}> and <{0134}, .... ,{78AB}>. The second is really not
independent since it is TTO related (under T5 or T4I) to the first fam-
ily. By now the reader may recognize that the number of distinct fam-
203
ilies is identical to NCC(F,{0134}), the number of cases of
CC({0134},F{0134}).Example 7b enumerates the begin and end seg-
ments of our row. We now understand that hexachordal combinato-
riality is actually more limited than the present case, since a
hexachord's DCOM number is always 1 or 0, making all rows based
on a particularhexachordal SC members of the same family. Here,
using {0134}as an opening row segment, two distinct families are pos-
sible. Since the number of families is not solely a property of the
twelve-tone system, we can omit the mid-segments to make 8-pc
"rows" of which there are again only two distinct families.
The idea of families of row-classes also determines the property of
row sequences either by content or order linkage. A series of rows
from a row-class form a cycle where each row Q succeeds FQ and an
end segment X of Q is equal to a begin segment of FQ (in either only
content or actual order). Row cycles of this sort occur frequently in
Webern'smusic. Thus, the series of rows is P, FP, F2P, and so on until
FnP = P. Obviously, the number of rows in the cycle is n (the peri-
odicity of F), F and X are determined by CC(X, FX).
Understanding the ZC-Relation

Our investigations into complementation and its generalizations
lead naturally to a consideration of the ZC-relation among hexa-
chords. The well-known special case of the complement theorem, the
"hexachord theorem," states that complementary hexachords have
the same interval-class content. If two complementary hexachords
are related by a TTO, they are members of the same SC. If the two
hexachords do not enjoy any relations under TTOs, then they are
mutually ZC-related (as are their SCs). The hexachord theorem
forces ZC-related hexachords to be Z-related. This shows that the
Z-relation among hexachords is only a side effect of the more ger-
mane ZC phenomenon, despite the usual "Z-related" descriptor for
such hexachord pairs.
Understanding the ZC relation among hexachords can be handled
in a number of ways. To begin, I will develop independent criteria
that produce ZC relations among hexachords. The first of these sim-
ply imports the sole ZC relation among a five and seven complemen-
tary SC pair into the hexachordal domain via inclusion. The second
and third criteria are based on aggregate partitions into four and five
parts. A last, fourth criterion simply invokes the M/MI mappings to
map one ZC-hexachord into its complement.
Criterion1: If hexachordY includesX, a memberof SC 5-12[01356],
then Y and Y- are ZC-related.Since X is ZC-relatedto X-, and, by
204
THEOREM1.2, Y- C X-, it follows that Y and Y- are ZC-related,
since FY (for any TTO F) can not be includedin Y- and also include
X. Example:{01356}C {012356};{012356}E SC 6-3; {4789AB}E SC
6-36.
Criterion2: HexachordsX and X- are ZC-relatedif X = (Y U Z) and

X- = (T4ZU T8Z)where Y E SC 3-12[048], Z is a trichordthat con-
tains no ic 4s and Z, Y, T4Y, and T8Y partitionthe aggregate.The
ZC-relationstems from the fact that, althoughX containsthe same
numberof ic 4s as X-, only X containsan "augmentedchord,"that is,
a complete T4 (or T8) cycle. Example:{235}= Y; {048235}E 6-39;
{679AB1}E 6-10.27
Criterion3: HexachordsX andX- are ZC-relatedif X = (Y U Z), and

X- = (T3Z U T6Z U T9Z) where Y E 4-28[0369], Z is a dyad that is
not an ic 3 or ic 6, and Y, Z, T3Z, T6Z, and T9Z partitionthe aggre-
gate. A ZC-relationoccursbecauseX containsa "diminished-seventh
chord" (or complete T3-cycle)and X- does not. This kind of ZC-
relationcan be equivalentlydescribedas betweenX and X-, whereX
consistsof the nonintersectingunionof a memberof 4-28 and an ic n,
where n is not 3 or 6 and X- is the union of two diminishedtrichords
(SC 3-10[036]) at Tn. Example: {3A} = Y; X = {3A258B};
X- = {619407} (= {147690}).
Criterion4: TwoZC-relatedhexachordsmaybe relatedunderthe TnM

and/orTnMIoperations.Wherethis is not the case, a ZC-pairmapsto
a differentZC-pair,or each memberof the ZC-pairis invariantunder
these operationsinvolvingM. Like the two previouscriteria,this in-
volves Tn cycles as well, since M and MI map the T1 or TB cycles into
the T5 or T7 cycles.
As Table 6 illustrates, no other criteria are needed to cover the
cases of ZC-relations among hexachordal SCs. However, while all
four are necessary, they may overlap. For instance, the ZC-pair 6-28/
6-49 are related under all criteria but the fourth, which concerns
M/MI. Furthermore, the criteria are not of the same kind. Criterion
1 does not really "explain" hexachordal ZC-relations, as it depends
on the inclusion of a unique ZC-relation between complementarySCs
of 5 and 7 pcs, which it simply takes for granted. The three remaining
criteria are united, because they are linked to cycles of T, operations.
Nevertheless, the fourth criterion is ultimately superfluous, for if we
included M among the TTOs, the ZC-pairs that mutually map under
an operation including M would simply be in the same SC. While the
remainingtwo criteria are of the same cast, the number of parts in the
partitions involved are different. A more fundamental problem with
205
criteria 2 and 3 is that the two partitions in question (based on in-
variances and mappings under T4 and T3) are not unique; as we shall
see, there are many other partitions and mappings that can associate
ZC-related hexachords. This state of affairs might be suggested by
other approachesto the ZC-mappingproblem. It has been previously
demonstratedthat no single operation that tends to preserve interval-
class content can map all of the ZC pairs directly into each other, or
even into groups of SCs including both ZC pairs and nonZC-related
SCs. As we will point out later, even if we relax the requirement that
the nonTTO mappings involved keep certain of the interval classes
invariant, the same result ensues; ZC-pairs are mapped into each
other at the expense of mappings that associate them with a great
many other SCs as well. Thus, if we want to keep the SCs partitioned
into as many "set-groups"as possible, we shall have to use many dif-
ferent mappings. The fact that there are a vast number of different
partitions (as compared to SCs) suggests that there are many map-
pings to be had. The question is, which ones?
Table 6
Interval-Cycle Mappings of ZC-Hexachord Pairs
M/MI* ZC-pair criterion 4 criterion 2 criterion 3 criterion 1
T1/5-cyc T4-cyc T3-cyc 5-12
M 6-3/36 x
M 6-4/37 x
E 6-6/38 x
M 6-10/39 x
E 6-11/40 x
S 6-12/41 x
M 6-13/42 x
S 6-17/43 x
E 6-19/44 x
S 6-23/45 x
M 6-24/46 x
M 6-25/47 x
M 6-26/48 x
S 6-28/49 x x x
M 6-29/50 x
*This column shows the M/MI relations among the 15 ZC-pairs:

members of ZC-pairs marked by S map into themselves under TnM/
MI; members of ZC-pairs marked by E map into each other under
TnM/MI; and ZC-pairs connected by M and vertical lines map into
each other under TnM/MI.
206
ZC-partitions
Examining criteria 2 and 3 carefully, we can determine a more

general criterion for ZC-pair association. In each, the ZC-related
hexachords are based on partitions of the aggregate that either map
into one another or are invariant under their respective TTOs. It is
known that a pc-set that is invariant under a TTO is made of the
union of complete cycles of that TTO. In addition, pc-sets that map
onto each other under a TTO contain no adjacent pcs from a cycle of
the TTO. Thus, we can construct partitions of the required kind by
making their parts either out of complete cycles or out of nonadjacent
pcs from cycles of a particularTTO. I will designate such partitions as
ZC-partitions, despite the fact that they do not always contain ZC-
related SCs. Because I will be interested only in hexachords, the sizes
of ZC-partition parts will be limited only to certain TTOs whose cy-
cles are of the correct length.
Example 9a provides the criteria for a "type 1 ZC-partition." The
resulting ZC-partitionis in four parts (W, X, Y, and Z), and the TTO
K is an involution. Two of the ZC-partitions'parts (Y and Z) are each
K-invariantand made of complete cycles of K, while the other two
parts (W and X) are mutual images under K. When these require-
ments are met, three pairs of complementary pc-sets are produced:
(W U X) versus (Y U Z); (W U Y) versus (X U Z); and (W U Z) ver-
sus (X U Y). The special requirementsgiven above and spelled out in
Example 9a ensure that the last two pairs of pc-sets are members of
the same SC or ZC-related SCs. The remaining complementary pair
is of some other SC (pair), one of which, (Z U Y), is called the "con-
trolling pc-set" or Q. SC(Q) is the ZC-partition's controlling SC.
Later, I will attach actual pc operations to each ZC-partition, but for
now I will say that a single SC or ZC-pair of SCs of two pairs of com-
plementary pc-sets will be "associated" under the aegis of a control-
ling SC via a particularpartition and its generating TTO K. In sum,
the type 1 ZC-partition contains six pc-sets (pairs of partition parts)
of SC(A), SC(B), SC(Q), and SC(Q-), with SC(A) and SC(B) being
either equal or ZC-related.
207
Example 9
type 1 ZC-partition:
WUXUYUZ=U
wnxnYnfZ={}
K is an involution
W = KX
X = KW
Y = KY
Z = KZ
XUY =K(WUY)
WU Z = K(XU Z)
YU Z = K(Y U Z)
W U X = K(X U W)
(X U Y) and (W U Y) E SC(A).
(W U Z) and (X U Z) E SC(B).
SC(A) and SC(B) are either identical or ZC-related.
(W U Y) E SC(A) since K(W U Y) = (X U Y) E SC(A)
(X U Z) E SC(D) since K(X U Z) = (W U Z) E SC(B)
Q equalling (Z U Y) is the "controllingpc-set." Q is invariantunder
K. SC(Q) is the "controlling SC."
K may be any of the following: T6, TnI (for all n).
Example 9a
208
Kn = To
Y2 = KY1.
Y1 = KYn
Y(m+p) = KPYm (m+p) taken mod n.
Any pairwise union of Y1, Y2,. .., (= Yo), or Z is ZC-related
to its complement. Yn
Example: Let n = 3.
K3 = To
W = KY2 ( = K2Y1)
X = KY3 (= K2Y2)
Y = KY1 (= K2Yo)
Z = KZ
(Yi U Y2) = K(Y1U Y2) = K2(Y1 U Y2)
(Z UY3) = K(ZU Y3) = K2(ZU Y3)
Since any pairwise union is a member of either one SC or its ZC-
related counterpart, this ZC-pair of SCs is the "controlling SC."
K may equal T4, T8.
Example 9b
209
To form specific ZC-partitions from the cycles in a type 1 ZC-
partition, we consult Example 10, which lists the 12 pcs as cycle mem-
bers of K. There are two types of cycles listed. In the first, for TTOs
T, or TnI where n is odd, there are six cycles of two pcs each. a, and
a2 form a cycle of K, as does bI and b2, and so forth. If K were T51I
and a, were 0, then a2 would be 5; if bI were 1, b2 would be 4; if
Cl = B, then c2 = 6; and so on to fl and f2. The example goes on to
show two assignments, marked as. 1 and as.2, which result in control-
ling pc-sets of 4 or 8 pcs. The unions of the other pairs of ZC-partition
parts result in hexachords, however. The assignments show that once
a controlling pc-set is selected, there are a number of ways one can
take the remaining members of the cycle to produce a particularZC-
partition. For instance, in as. 1, once e1, e2, fl, and f2 are defined, the
other members of the aggregate can be assigned to a1, a2,
bl, b2, c1,
c2, and d2 as shown. In this case, there are 8 distinct ways this can
be done.
dl,
Example 10
form of cycles of K: (blb2) (c1C2) (f1f2)
W X (ala2)
Y (dld2) (ele2)
Z cont.pc-set
a2b2c2d2 flf2 e1e2f1f2
as.1:alblcldl
as.2:albl a2b2 ele2 c2d2e2f2
c1dlelfl
form of cycles of K: (al) c1c2dld2ele2f1f2
(bl) (c1c2) (did2) (ele2) (f1f2) (gg12)
W X Y Z cont.pc-set
as.3:cldlelflgl c2d2e2f2g2 a,
c2d2e2 a1f1f2 bl
b1g1g2 albl
as.4:c1dlee
c2 a1blf1f2g1g2
as.5:cI aldlelflg1 bld2e2f2g2 albldld2eee2f1f2g1g2
form of cycles of K:
(ala2a3) (c1C2C3)(dld2d3)
W X Y (blb2b3)
Z
as.6:alblcl a2b2c2 a3b3c3 dld2d3
Assignments 3 to 5 (as.3, as.4, and as.5) in Example 10 give ways

of partitioning members of the cycles of an involution that has five
2-element cycles and two singletons; this is the form of cycles of TnI
TTOs where n is even. The controllingpc-set can be of 2, 6, or 10 pcs.
In assignment 4, where the controlling pc-set is of cardinality 6, all
pc-sets in complementary pairs are hexachords, a particularlyinter-
esting situation.
210
In Example 11a, I have given all of the possible controlling SCs for
K = T6. There are three distinct controlling SCs for assignment 1 (A,
B, and C) and eight for assignment 2 (D through K). Table 7a gives
the results of the ZC-partitions for each of these SCs. For instance,
Example 12 shows the eight distinct ZC-partitions for A, which uses
assignment 1 with SC 4-9[0167] as the controlling SC. Of these, two
are ZC-partitionswhere ZC-pairs 6-10 and 6-39 are associated, two
are ZC-partitionswhere 6-24 and 6-26 are associated, and four oth-
ers associate nonZC-related hexachords. These are the SCs 6-2
[012346], 6-15[012458], 6-31[013589], and 6-33[023579]. Table 7a
summarizesExample 12 and all the other cases of controlling SCs for
assignment 1 under T6.
Example 11
Name TTO W X Y Z controlling SC
A T6 a2b2c2d2 06 17 4-9
B T6 alblcld1 a2b2c2d2 06 28 4-25
C T6 alblcld1 a2b2c2d2 06 39 4-28
D T6 alblcld1
alb1 a2b2 0167 2389 8-9
E T6 a2b2 0167 248A 8-25
F T6 albI
alb1 a2b2 0167 258B 8-9
G T6 a2b2 0167 349A 8-28
H T6 albI a2b2 0268 1379 8-9
alb1
I T6 a2b2 0268 147A 8-25
J T6 albI a2b2 0268 359B 8-28
alb1
K T6 a2b2 0369 147A 8-28
albI
Example 11a
Name TTO W X Y Z controlling SC

P Tol c2d2e2f2g2 0 6 2-6
c1dlelflg1
Q1 Tol c1dle1 c2d2e2 1BO 2A6 6-37
Q2 Tol c1dle1 c2d2e2 1B6 2A0 6-37
R1 Tol c1dle1 c2d2e2 1BO 369 6-45
R2 Tol c1dle1 c2d2e2 1B6 039 6-45
S1 Tol c2d2e2 1BO 468 6-48
S2 Tol c1dlel
c1dle1 c2d2e2 1B6 048 6-48
T1 Tol c1dle1 c2d2e2 1BO 567 6-7
T2 Tol c1dle1 c2d2e2 1B6 057 6-7
U1 Tol c2d2e2 2A0 369 6-28
U2 Tol c1dle1
cldle1 c2d2e2 2A6 039 6-28
V1 Tol c2d2e2 2A0 468 6-35
V2 Tol cldle1
c1dle1 c2d2e2 2A6 048 6-35
211
W1 T4 123 567 9AB 048 6-4/6-37
W2 T4 235 679 AB1 048 6-10/6-39
W3 T4 127 56B 9A3 048 6-17/6-43
W4 T4 136 57A 9B2 048 6-24/6-46
W5 T4 35A 792 B16 048 6-26/6-48
W6 T4 369 7A1 B25 048 6-28/6-49
Example llb
Example 12
W X Y Z SC(WUY) SC(WUZ) SC(XUY) SC(XUZ)
2345 89AB 06 17 6-2 6-2 6-2 6-2
8345 29AB 06 17 6-39 6-10 6-39 6-10
2945 83AB 06 17 6-46 6-24 6-46 6-24
23A5 894B 06 17 6-24 6-46 6-24 6-46
234B 89A5 06 17 6-10 6-39 6-10 6-39
8945 23AB 06 17 6-15 6-15 6-15 6-15
83A5 294B 06 17 6-33 6-33 6-33 6-33
834B 29A4 06 17 6-31 6-31 6-31 6-31
Table 7a
ZC-pair A B C D E F G H I J K
6-3/36 . B........
6-4/37 C
6-6/38 G
6-10/39 A
6-11/40 . B
6-12/41 E
6-13/42 . F
6-17/43 . E
6-19/44 .. B...... ..
6-23/45 .. ....... I
6-24/46 A
6-25/47 . B........
6-26/48 C
6-28/49 . .. . . . I
6-29/50 F..
2 9 5 . 21 .22 27 associated
15 . .
. 16 18 . . 34 . . . hexachordal
31 .. . .......nonZC related
33 . SCs
........
212
An important function of Table 7a is to show that ZC-partitions
produced by T6 alone can associate all ZC-related hexachordal SCs.
This occurs without the help of H, J, and K, which only associate
nonZC-related hexachordal SCs.
I list the ZC-partitions for assignments 3 and 4 of Example 10 in
Example 11lb.Note that P is the sole case of assignment 3, while as-
signment 4 produces pairs of ZC-partitions(Q1 to V2) with the same
controlling SC. Note also that these controlling SCs are either ZC-
related or all-combinatorial hexachords (all of these pc-sets are in-
variant under one or more TnI TTOs, where n is even). Table 7b gives
the hexachords associated by these ZC-partitions. Once again, all
ZC-related hexachordal SCs are associated by ZC-partitions pro-
duced by assignment 4.
Returning to Example 9, I will illustrate a way to generate ZC-
partitions of a different kind. These are called "type 2 ZC-partitions"
and are shown in Example 9b. Here all parts of the ZC-partitionsave
one are cyclicly related via K, which is not an involution. These parts
are labeled Yn. The part Z is invariantunder K. The number of par-
tition parts is n-1, where n is the periodicity of K.
Example 9b ends with a particular instance of a type 2 ZC-
partition where the periodicity of K is 3. In this case, K can equal T4
or T8. This turns out to be ZC criterion 2 given above. Criterion 3
demands that there be 5 parts to the ZC-partition, and T3 or T9 is K
(whose periodicity is 4). Assignment 6 in Example 10 gives the cycle
mappings for criterion 2, and the W ZC-partitions at the bottom of
Example llb provide the six possible outcomes of assignment 6. The
results of these W ZC-partitionsare given in the right-mostcolumn of
Table 7b; this corresponds to the second column of Table 6.
Before moving to the last section of this article, I should point out
that these special partitions have other functions besides associating
ZC-related SCs. In the cases where nonZC hexachords are produced,
as in column A of Table 7a and the associated Example 12, we have
CUP. For instance, the production of SC 6-2[012346] comes from the
ZC-partition {{2345}{89AB} {06} {17}}, the first case in Example 12.
Note that either {2345} or {89AB}, both members of SC 4-1[0123],
pair uniquely with either {06} or {17} (of SC 2-6) to form a member
of 6-2. This special case is attributableto the TTO T6, which gener-
ates the ZC-partition. The tritones-the 6 members of SC 2-6-are
the cycles of T6 and are found either in the two 2-pc partition parts or
between the 4-pc partition parts. Thus, the four instances of 6-2
({234506}, {234517}, {89AB06}, and {89AB17}) show that only com-
binations of nonintersectingmembers of 4-1 and 2-6 are members of
6-2.
When we look at this matter from the viewpoint of CUP, it is
213
Table 7b
ZC-pair P 01 Q2 R1 R2 S1 S2 T1 T2 Ul U2 V1 V2 Wn
6-3/36 P. . R1. . . T1 .
6-4/37 . Q1 . . S1 ....... W1
6-6/38 P .
6-10/39 . . . . S1 S2 . . U1. W2
6-11/40 P. . R1 R2. V1 .
6-12/41 .. .. ..... U1 .
6-13/42 . . R1 .
6-17/43 .. .. . W3
6-19/44 P . . ......U2
6-23/45 . ..... ...... . U1 ...V2
6-24/46 . 1 2. .... . U. . W4
6-25/47 P. T2 .
6-26/48 . Q2 . R2.. 2 . W5
6-28/49 .. . ..... . W6
.........U2.
6-29/50 . . . R2 .
1 15 9 5 8 2 16 1 8 . 15 8 14 associated
14 16 33 . . 9 31 8 32 . 31 14 20 nonZC SCs
perhaps easier to see that if we have a CUP whose resultant SC is not

a ZC-related hexachord, then the two disjoint parts of the hexachord
will be found under a TTO in the hexachord'scomplement. Thus, we
have a ZC-partitionof pc-sets S, T, GS, and GT (where G is a TTO)
and, due to CUP, either S U T or S U GT will produce a member of
the same SC. Examining Table i under the "(2 + 4 = 6)" case, rows
1 and 9 correspond to the ZC-partitionH, given in Example 11a and
in Table 7a. In this case, TTO G is T6. Other correspondences found
in this section of Table 1 include rows 11, 12, 15, and 16 as exemplars
of ZC-partition A in the Example 11a and Table 7a. The CUP pairs
of ZC-related hexachords in Table 3 also correlate with ZC-
partitions. Here the pc-sets S and T form members of two ZC-related
hexachordal SCs. Thus, we have a ZC-partition S, T, GS, and U (G
is a TTO), so that S U T and T U U are members of one SC and
S U GS and U U GS are members of the other. This means that CUP
pairs in the "(2 + 4 = 6)" section of Table 3 that are marked with an
X (to indicate the ZC-relation between them) correspond to cases of
ZC-partitions in Example 11a and Table 7a: rows 24 and 29 are re-
lated to ZC-partition A; rows 22, 28, 30, and 33 are related to ZC-
partition B; rows 23 and 34 result from ZC-partition C; and row 11 is
the sole example of ZC-partition G.
Of course, the production of CUP via ZC-partitions can be gen-
eralized to complementary pc-sets of all cardinalities. The role of the
214
controlling SC in a case of CUP is also of interest, but I do not have
space to expound on any of these extensions.
It is importantenough to remarkhere that ZC-partitionsmap their
parts into each other (into each part's complements) and into them-
selves (invariance) under a particularTTO. We have also seen that
the distinction between pc-sets of high degrees of symmetryand those
pc-sets of minimal degrees of symmetry (often ZC pc-sets) is not re-
flected in the pc-sets found in the unions of the parts of the ZC-
partition. This is of obvious aural consequence, since the difference
between pc-sets with highly contrasting degrees of symmetry is re-
flected in the distribution of their respective interval-class vectors;
vectors of pc-sets of high symmetry have an "all or nothing," skewed
profile where pc-sets with low symmetry have "flat," more or less
evenly distributed vectors. This observation also suggests that map-
pings that preserve, or only mildly change, interval classes are not
sufficient to map ZC-related pc-sets into each other or among small
groups of SCs.
TTOs and Operations
In principle, any pc-set can be mapped by an operation into an-

other pc-set of equal cardinality. When the operation is a TTO,
interval-class content is preserved, giving the pc-set and its image a
similarsound. This aural connection is one of the most importantrea-
sons why SC membership is based on the TTOs. If we are interested
in preserving some other aspect or property of a pc-set, we may ac-
complish its transformationvia an operation that does not retain in-
terval classes. While this seems straightforwardenough, a nonTTO
operation chosen to preserve the properties of pc-set S is not usually
obliged to preserve the same properties of other pc-sets in the same
set class as S (SC(S)). This means that understandinghow nonTTO
operations and TTOs interact is of crucial importance in relating dif-
ferent pc-sets and SCs to each other. Unfortunately, the study of op-
erations on pcs is neither tidy nor obvious, since the number and
interactions of operations are literally astronomical, and the opera-
tions need not be taken to form mathematical groups. Nevertheless,
we can make some progress in this direction. Equipped with the in-
troductory definitions of operations, TTOs and their notations, we
will introduce some further notations and theorems.28These will help
make the universe of operations manageable enough to shed light on
many of the topics discussed in earlier portions of this article.
First I must discuss the composition or concatenation of two op-
erations L and K, designated by H = LK. We can form the cycles of
215
H from those of K and L as follows. Starting with any pc x, we first
find x and its successor y in a cycle of K, we then find y and its suc-
cessor z in a cycle of L. We then can construct a portion of a cycle of
H that contains the succession <x,z>. We continue in like fashion for
all pcs x, y, and z until the entire set of cycles for H has been con-
structed. For example, we define K as (023) and L as (47) (92). (Re-
call that the singleton cycles of operators are not notated.) The cycles
of H are (0923) (47).29 The example brings up another matter of no-
tation. If we want to notate operator concatenation directly, without
using variables, we use a star (*) to indicate concatenation. Thus, we
can write (0923) (47) = (47) (92) * (023) for the case of H above. To
be clear, I will give two more examples. In the first, L is defined as
above and X designates the pc-set {02468}.
{06789} = (47) (92) * {02468} = (47) (92) * X = L{02468} = LX
If Q = (01)(23) then T1Q = T, * (01)(23) = (0123456789AB)*

(01)(23) = (02456789AB).
When we wish to refer directly to the (content of the) cycles of an
operator K, we will use the notation cyc(K), which is read as "the
cycles of K." Thus, there is a difference between concatenating op-
erations L with K and operating with L on the cycles of K. This dis-
tinction is shown by the following illustration, where K and L are
defined as above.
Lcyc(K) = (LOL2 L3) (L1) (L4) (L5) (L6) (L7) (L8) (L9) (LA) (LB) =
(093) (1)(7) (5) (6) (4) (8) (2) (A) (B)
LK = H = (0923) (47)
In some of the work that follows, we will be operating on the

cycles of a nonTTO operation with a TTO. As an example:
T4cyc(K) = (467).
It is often useful to be able to do the reverse of concatenation. We
can "factor"an operation K into two or more suboperationsthat con-
catenate to produce K. After the presentation of two simple theo-
rems, I will introduce a rule that will allow us to modify the cycles of
K to produce the cycles of the suboperations.
THEOREM 8.1: Two operations commute if the cycles of one share

no pc with the cycles of the other.
In THEOREM 8.1, I 'refer to the cycles that are notated, not the
implicit singleton cycles. The theorem is true, because the two oper-
216
ations affect completelydifferentpcs. If J = (367)(98), K = (045),
and L = (7A), JK = KJ and KL = LK. JL 4 LJ, since their cycles
share7. Of course,THEOREM8.1 is not the sole criterionfor op-
eratorcommutivity.
THEOREM8.2: Each of the k cyclesof the operationK definesa
separatesuboperationKn. The concatenationof the suboperations
K1,K2, ...., Kk, takenin any order,producesK.
Sincethe cyclesof an operationpartitionthe aggregate,theyshare
no pcs. FromTHEOREM8.1, the resultingsubpartitions commute.
Given the operationG = (034)(AB) (186) with G, = (034), G2 =
(AB), and G3 = (186), we have G = G1G2G3= (034)*(AB)*
(186) = G1G3G2= (034)*(186)*(AB)= G2G1G3= (AB)*(034)*
(186), and so forth.
To factora given operationK, we must factorit into subopera-
tions,as in THEOREM8.2. Wethenfurtherfactoreachof thesesub-
operationsinto a seriesof (sub-)suboperations, each havinga single
two-elementcycleaccordingto the followingrule.The concatenation
of the entireset of suboperationswill produceK.
RULE 8.3: Given the operationJ definedby the single n-element
cycle(jl j2 . Jn),we producethe concatenationof n - 1 operations,
so that:J = ?(j jn)* (j1 * *
Some examples:Letj(n-1))
J = (0356); (J j2).
."' J can be rewrittenas (06) * (05)
* (03). GivenH = (056)(29)(147A), we produceH = (056) * (29) *
(147A) which,by applyingRULE 8.3, becomesin turnH = (06) *
(05) * (29) * (1A) * (17) * (14). Accordingto THEOREM8.1, we can
intermixthe suboperationsthat are pc disjointto form:H = (06) *
(1A) * (05) * (17) * (29) * (14). THEOREM8.2 permitsus to group
the six suboperations into three:H = (06)(1A) * (05)(17) * (29)(14).
Labeling the threeresultingsuboperationsE, F, andG, respectively,
we can alsowrite:H = EFG. The following"mappingcharts"verify
both the six and three suboperatorfactoringof H.
pcs: 0123456789AB
(14)*pcs: 0423156789AB
(17)*(14)*pcs: 0423756189AB
(1A)*(17)*(14)*pcs: 0423756A891B
(29)*(1A)*(17)*(14)*pcs: 0493756A821B
(05)*(29)*(1A)*(17)*(14)*pcs: 5493706A821B
(06)*(05)*(29)*(1A)*(17)*(14)*pcs: 5493760A821B= H(pcs)
pcs: 0123456789AB
G(pcs): 0493156782AB
FG(pcs): 5493706182AB
EFG(pcs): 5493760A821B= H(pcs)
217
THEOREM 8.4: H = Fcyc(Q) = FQF-' for operators F and Q.
The theorem states that operating on the cycles of Q with F is the
same as the operation produced by preconcatenatingQ by the inverse
of F and postconcatenating Q with F.30
For example, let Q = (047)(196) and F = T1. H =
T1QTB
T1*(047)(196)*TB. These relationships are shown below.
pcs: 0123456789AB
F-' (pcs) = TB(pCs): B0123456789A
QF- l(pcs) = QTB(pCS): B4923751086A
=
FQF- '(pcs) T1QTB(pcs): 05A34862197B = H(pcs) = Fcyc(Q)(pcs)
COR 8.4.1: Given H = Fcyc(Q), if FQ = QF, then H = Q.

This result is established by asserting, via THEOREM 8.4, that
FQF-1 = H. Since F and Q commute, we have FF-1Q = H and
Q= H.
Another useful theorem related to factoring is the following.
THEOREM 8.5: Given the operator K such that K = (a b), we can

form the operator L = (a Gb) such that L = KHK where H = (b
Gb).
Note that the cycles of G are undefined. The theorem states that
(a Gb) = (a b)*(b Gb)*(a b). The use of the following abstractmap-
ping diagram proves the theorem:
pcs: a b Gb
K(pcs) = (ab)*(pcs): b a Gb
HK(pcs)= (b Gb)*(ab)*(pcs): Gb a b
KHK(pcs) = (ab)*(b Gb)*(ab)*(pcs): Gb b a = L(pcs)
The most important use of THEOREM 8.5 is that it allows us to
factor operations with TTOs. The operation G in the theorem is
the TTO. For example, if L = (02), then a = 0 and Gb = 2. If we
consider G to be T1, then L = (0 T11). As a result, we can define
K = (a b) = (0 1) and H = (b Gb) = (1 2). In turn,
L = KHK = (02) = (01)*(12)*(01)
pcs: 0123456789AB
K(pcs): 1023456789AB
HK(pcs): 2013456789AB
KHK(pcs): 2103456789AB = L(pcs)
Using the techniques introduced by the preceding theorems, we

can now reduce complex operations to sequences of TTOs and in-
218
stances of one simple one-cycle involution. For example, we can fur-
ther reduce the result of the previous paragraph by substituting
Tl*(01)*TB for (12) via THEOREM 8.4 to produce
L = KHK = (02) =
(01)*TI*(01)*TB*(01).
Likewise, we can factor the operation (03) to a string of TTOs and
Ks.31
(03) = (02)*(23)*(02) by THEOREM 8.5
(03) =
(01)*T1*(01)*TB*(01)*(23)*(01)*T1*(01)*TB*(01)
from the above
(03) = (01)*TI*(01)*TB*(01)*T2*(01)*TA*(01)*TI*(01)*TB*(01)
by THEOREM 8.4
(03) = KTIKTBKT2KTAKTIKTBK
THEOREM 8.6: Any operation H can be factored into a string of

transpositionalTTOs and the operation (01).
This result provides the basis for all operations. We can map any
pc-set into any other of the same cardinalityvia (0 1) and transposi-
tions. Thinking through the interval classes (the SCs of cardinality2),
we can see that if a 2-pc-set contains pcs 0 or 1, it will become con-
tracted or enlarged by one semitone under (0 1). When we allow the
(0 1) to be "transposed"into (n n+ 1), (0 1) becomes Tn*(0 1)*T-n,
so that any 2-pc-set can be enlarged or contracted indefinitely.32
Thus, any nonzero interval class can be changed into any other.
The theorem also highlights the primacy of the transpositions as
essential to pc-set and SC mappings. I and M are not needed; indeed,
they themselves can be factored into transpositionsand (0 1)s. On the
other hand, (0 1) is not essential in the same way as the transpositions
are. One could use (0 5) in the same role. This could be accomplished
by doing M or MI to any operator factored according to THEOREM
8.6. The other possibilities for substitutes for (0 1)-for instance,
(0 2), (0 3), not have the special feature of (0 1) or (0 5). The
expansion ofetc.--do
(0 1) into a cycle consisting of a chain of <n n + 1> seg-
ments for all n produces one and only one cycle; the T1 cycle. All
other operators of the form (0 s) produce more than one cycle from
<n n + s> chains, except for (0 5) (and (0 7) and (0 11), transposi-
tional inverses of (0 1) and (0 5)).
THEOREM 8.6 permits inquiry into the relations between TTOs
and nonTTO operations. Given a pc-set X and a nonTTO operation
Q, we want to know not only what happens to X under Q, but what
happens to HX under Q where H is any TTO. This is equivalent to
knowing what happens to SC(X), or more precisely, to the members
of SC(X), under Q. For instance, if Q maps X from its own SC into
219
another SC, does Q map other members of SC(X) to the same or
different SCs? Since SC(X) contains TIX, T2X, and so forth, when we
ask what happens to SC(X) under Q, we are also asking about the
effect of QT1, QT2, and so forth on X. Thus, when we have an op-
eration Q and a set class, to understand the total sum of pc-set map-
pings we need only examine the effect of all operations QH
(H E [TTO]) on one member of the SC.
For the balance of this section, I shall be concerned only with the
affiliations among members of SC(X) under Q.33 This is simply an
enumeration of the SC membership of each member of SC(X) under
Q, or that of the result of the operators QH (H runs through the
TTOs) on X. The result is a list of the SCs that are connected with
SC(X) under Q. Example 13a, 13b, and 13c each provide a list of the
members of the SCs 3-12[048] and 3-6[024]. Both SCs have fewer
than 24 members due to their relatively high degrees of symmetry.
Lines show what SC connections are made when various operations
are applied to each member of each SC. In Example 13a the Q op-
erator is (06). Pc sets not containing pcs 0 or 6 are unaffected and
remain invariant. Pc sets of 3-12 that are changed under the opera-
tion map into those in 3-6, while pc-sets in 3-6 either map into mem-
bers of 3-12 or into other members of the same SC. The example
shows that the two SCs are connected or affiliated under (06). Look-
ing at the rest of the example, we see that the same two SCs are
connected under the Q operation (4A) (06) but not under
Q = (06) (28) (4A).
(06) (4A) (06) (06) (28) (4A)
048--, 024-, 048 - -024 048-, 024-----%

159 135 159 135 159 i 135
26A-. 1 246-- 26A--' 246--, 26A- 246-- -
37B 357 37B 357 37B 357 I
S--468 I 468-, 468
579 I 579 579 -,
68A- -- 68A 68A-+-t-
79B 79B
8AO-' 8AO-' 8AO- +-
9B1 9B1 9B1
---A02 A02-"
A02--"
B13 B13 B13
3-12<-->3-6 3-12<- ->3-6 3-12 3-6
Example 13
220
Example 13 makes the question about nonTTO operations and SC
associations under such operations more vivid. We now know that
when we apply a Q operation to each member of SC(X), we produce
a set of SC affiliations; but do we get the same set of SC affiliations
with SC(X) under, say, QT1? A moment's reflection confirmsthat the
answer is yes. As implied above, when we enumerate the affiliations
for SC(X) and QT1, each case is of the form QT1HX, where H is a
TTO. Now T1H can always be reduced to a TTO (in canonical form).
Thus, QT1HX turns into QGX where G is a TTO, but we have al-
ready determined QGX's SC membership when we examined the
cases of SC(X) and Q. Generalizing, from T1 to all TTOs, we can
assert that the SC affiliationsof Q on SC(X) are the same as those of
QH on SC(X), where H is any TTO.
And what about HQ on SC(X)? Are any new SC affiliations, be-
yond those created by Q and SC(X), produced? Since HQGX is a
member of the same SC as QGX for any TTOs G and H, the answer
is no. This leads us to assert that GQH produces the same SC map-
pings as Q on SC(X) for all TTOs G and H. If H = G-1, then we can
use THEOREM 8.4 to derive the following.
THEOREM 8.7: Two operators, Q and GQG-1, where G is a TTO,

whose cycles are TTO transformsof each other, produce the same SC
affiliations for SC(X) when they operate on each member of SC(X).
As a result, the affiliation of SC 3-12 with SC 3-6 under the op-
eration (06) is also produced under the operations (17), (28), (39),
and so forth. In addition, the theorem applies when Q is also a TTO.
Then the operation GQG-1 is called an (inner) automorphism,which
maps the group of TTOs into itself. In this case the SC(X) members
merely interchange (cyclicly) or remain invariant under GQG-1.
Before continuing, it is necessary to clarify my notion of SC affil-
iation. In the previous discussion and examples, we have been study-
ing what SCs are associated with SC(X) when the members of SC(X)
are transformedunder Q. I will now call such associations of SCs with
SC(X) local SC affiliations. Consider the case where X, a pc-set mem-
ber of SC(X), is transformed under Q into Y, a member of SC(Y);
thus Y = QX. Then suppose that Y becomes Z, a member of SC(Z),
under Q and SC(Z) is not the same as SC(X) or SC(Y). Since
Z = QY, we can write Z = Q2X. This shows that while SC(Z) and
SC(X) are not directly associated via Q, they are still connected via
a double application of Q. We can, therefore, indirectly associate
many SCs with SC(X) under repeated applicationsof Q and TTOs to
SC(X)'s pc-sets. The total of all of these associationswill be called the
complete SC affiliation of SC(X) via the operation Q. In many cases,
the local and total affiliations of SCs are one and the same. An ex-
221
ample of a case where the local and complete affiliations are not
equivalent occurs when Q is (01) and all SCs of a given cardinalityare
related via operations that are strings of Qs and TTOs.
All of this is addressed by the next theorem.
THEOREM 8.8: If SC(Y) is a member of the complete affiliation of

SCs produced by operation Q on members of SC(X), then Y = KX,
where K is some string of TTOs and Qs.
This follows directly from the definition of complete affiliation.
Note that if SC(Y) is a member of the complete SC affiliations
of SC(X) with Q, then SC(X) is a member of the complete SC affil-
iations of SC(Y) and Q. Also note that once the complete SC
affiliations of SC(X) are determined, arbitraryoperators such as Q5,
T5QT4IQT2,T8Q2I,ad infinitum,will not introduce any new SCs into
the network of SC connections generated by Q and SC(X). There-
fore, the connections of SCs 3-12 and 3-6 in Example 13a will not be
augmented by the addition of more SCs if one operates on members
of 3-12 or 3-6 with any string of TTOs and (06)s. This is borne out
by Example 13b, which uses (4A) (06) as its operator. (4A) is equiv-
alent to T4*(06)*T8, so that the entire operator of Example 13b is the
combination of two strings of TTOs and (06)s. We see that the affil-
iation of the two SCs is the same as in Example 13a.
The situation in Example 13c adds a new twist to our understand-
ing of THEOREM 8.8. Here the operation (06)(28)(4A) is also
based on transpositions of cycles of (06), and thus we have (06),
T2*(06)*TA,and T4*(06)*T8.While no new SC affiliations are pro-
duced, as compared with Examples 13a and 13b, the connection be-
tween 3-12 and 3-6 is eradicated; each SC maps into itself under
(06) (28) (4A). Thus, we see that the elaboration of an operation Q by
concatenating Qs and TTOs not only does not produce more SC af-
filiations, it may reduce such affiliations by partitioning the network
of SC connections produced by Q and SC(X) into subnetworks.
The reason some strings of Qs and TTOs may reduce SC affilia-
tions can be illustrated by the following scenario. Suppose pc-set X
can be mapped to pc-set Y under Q, and similarlyfrom Y to Z under
Q, with X, Y and Z being members of three distinct SCs. Further,
suppose that these three SCs are only connected via the operation Q
through these three pc-sets; no other member of SC(X) maps into
SC(Y) under Q, and SC(Y) and SC(Z) are locally affiliated only via
the Q relation between Y and Z. Now, QX = Y, QY = Z and
Q2X = Z. Consider the complete SC affiliationsof SCs under the op-
eration Q2. SC(X) is now related to SC(Z) under Q2 but no longer to
SC(Y).34 Thus, the move from Q to Q2 effectively undid a SC affil-
iation available among the complete SC affiliations via Q. On the
222
other hand, a substitution of Q-1 for Q continues to associate SC(X),
SC(Y), and SC(Z) again, since Y = Q-1Z and X= Q-1Y.
The possibility of reducing the number of complete SC affiliations
for SC(X) and Q is of great interest. Startingwith a Q that associates
all, or a great number, of SCs in one huge network, we can reduce the
number of associations of SCs by partitioning the network using an
appropriateelaboration of Q. This idea is suggested by THEOREM
8.6, where (01) with TTOs associates all SCs of the same cardinality.
Since the theorem asserts that all other operations can be derived via
(01) and TTOs (actually transpositions), and we know that there are
operations that partition the SCs into groups of few or even single
SCs, certain strings of TTOs and (01)s must partition the maximal SC
affiliations of (01) on any SC.
Set-Groups and Set-Group Systems
Complete SC affiliations under Q and TTOs for all SCs partition

the corpus of SCs into equivalence classes. This generalizes the way
in which the 4096 pc-sets are partitioned by the TTOs into equiva-
lence classes, each of which is a SC.35
DEF 9.1.1: A Q set-group is the set of SCs that are completely af-
filiated (via their pc-set mappings) under the nonTTO operation Q.
DEF 9.1.2: A Q set-group system is the entire collection of Q set-

groups.
SG(Q) is the abbreviationfor the Q set-group system. We can also
write SG((034) (24)) for the set-group system set up by the operation
(034) (24).36
An example of a Q set-group is produced by operating on mem-
bers of SC 6-1[012345] with the operation (02468A), which I will call
ALPHA.37 The completely affiliated SCs are 6-1, 6-8[023457], and
6-32[024579]. Thus, these three SCs comprise the members of one of
the eighteen hexachordal ALPHA set-groups. Perhaps the reader
will wonder why we can be assured that operating with ALPHA on
members of SC 6-8 or 6-32 will produce only the same SC affilia-
tions. The following theorem answers such doubts.
THEOREM 9.2: Q and the TTOs that affiliate SCs into Q set-groups
generate a mathematical group.
This follows from the facts we have already discussed-that QH,
HQ, and Q all produce the same complete SC affiliationswhen per-
formed on each member of SC(X) (with H being any TTO). When we
223
perform the operation H-1Q-1 on QH, we get the identity operator.
The same holds for Q-1H-1 on HQ, and Q-1 on Q. This means that
either H-1Q-1, Q-1H-1, or Q performed on members of the SCs al-
ready completely affiliated under Q produces the same set of affili-
ations. The entire collection of distinct combinations of H and Q and
their inverses produces a group. However, a subcollection of strings
of Qs and TTOs may form its own group, a subgroup of the group of
all the available operations.
Table 8 provides the reader with a list of the hexachordal portion
of eight Q set-group systems. The Qs are (01), (02), (04), (048), (03),
(06), (0369), and (02468A). The last Q is ALPHA, and it generates
the hexachordal portion of the ALPHA set-group system mentioned
above.38 The first Q is the operator of THEOREM 8.6, which implies
that the group /g/ formed from (01) and the TTOs will connect any
hexachordalpc-set to another via mappingsof (01)s and TTOs. Thus,
there is only one hexachordal (01) set-group. Since all other opera-
tions can be factored into (01)s and TTOs, the groups associated with
all other Q set-group systems are subgroups of /g/.
Table 8
Hexachordal Set-Groups
(01)
1. All hexachordal SCs.
(02)
1. 1 3/36 5 6/38 8 11/40 13/42 14 18 19/44 20 25/47 27 29/50 32
2. 2 4/37 7 9 10/39 12/41 15 16 17/43 23/45 24/46 26/48 28/49 30 31 33
3. 21 22 34
4. 35
(04)
1. 1 3/36 5 6/38 8 11/40 13/42 18 25/47 27 29/50 32
2. 2 7 9 12/41 23/45 30 33
z3. 4/ 10/ 26/ 43/ 46/ 49/
4. 14 19/44
5. 15 16 31
z6. 17/ 24/ 28/ 37/ 39/ 48/
7. 20
8. 21 22 34
9. 35
(048)
1. 1 3/36 5 6/38 8 11/40 13/42 18 25/47 27 29/50 32
2. 2 7 9 12/41 23/45 30 33
224
z3. 4/ 10/ 26/ 43/ 46/ 49/
4. 14 19/44
5. 15 16 31
z6. 17/ 24/ 28/ 37/ 39/ 48/
7. 20
8. 21 22 34
9. 35
(03)
1. 1 4/37 6/38 7 8 9 14 16 20 22 26/48 32 35
2. 2 3/36 5 10/39 11/40 12/41 15 17/43 18 19/44 21 24/46 25/47 31 33 34
z3. 13/ 23/ 49/ 50/
z4. 28/ 29/ 42/ 45/
5. 27 30
(06)
1. 1 8 14 20 32
2. 2 10/39 15 24/46 31 33
3. 3/36 11/40 19/44 25/47
4. 4/37 9 16 26/48
5. 5 18
6. 6/38
7. 7
z8. 12/ 17/
z9. 13/ 50/
10. 21 34
11. 22
z12. 23/ 49/
13. 27
z14. 28/ 45/
zl5. 29/ 42/
16. 30
17. 35
z18. 41/ 43/
(0369)
1. 1 8 14 20 32
2. 2 3/36 10/39 11/40 15 19/44 24/46 25/47 31 33
3. 4/37 9 16 26/48
4. 5 12/41 17/43 18 21 34
5. 6/38 22
6. 735
7. 13/42 23/45 28/49 29/50
8. 27
9. 30
225
(02468A)
1. 18 32
2. 29 33
3. 3/36 11/40 25/47
z4. 4/ 10/ 26/ 46/
5. 5 18 27
6. 6/38 13/42 29/50
7. 7 30
z8. 12/ 45/
9. 14
10. 15 16 31
z11l. 17/ 28/
12. 19/44
13. 20
14. 21 22 34
z15. 23/ 41/
z16. 24/ 37/ 39/ 48/
17. 35
z18. 43/ 49/
Each hexachordalset-group system on Table 8 is given by listing its

set-groups, which are numbered from 1 to n. Set-groups that do not
contain instances of both ZC-related hexachordal SCs are designated
with a z, in the manner of Allen Forte.39 The SC content of each
hexachordal set-group is shown by numbers derived from the second
numeral in the SC's name. (For instance, "7" stands for
6-7[012678].) ZC-related SCs are shown by slashes; ZC-pairs are
listed with the slash between numbers: "3/36" stands for the ZC-pair
6-3[012356] and 6-36[012347]; a ZC-hexachord included in a set-
group without its partner is shown by its number, followed by a slash
(as for example "10/").
With the set-groups of Table 8, we will demonstrate how various
set-groups can be embedded in one another.40 From THEOREM 8.8
and the subsequent discussion, we know that the complete SC affil-
iations for SC(X) under Q and SC(X) and an operation Q' (a string
of Q and TTO operations) are either the same or are reduced. Thus,
not all of the SC affiliations that partition the SCs under Q and the
TTOs can partition the SCs under Q' and TTOs. This means that
under Q' the partition of SCs may be finer than under Q. If this is the
case, set-groups in SG(Q') will be proper subsets of set-groups in
SG(Q).41 Consequently:
THEOREM 9.3: For operations Q and P, Q set-groups are subsets of
P set-groups if Q is any string of Ps and TTOs.
226
We shall say that SG(Q) is embedded in SG(P) if THEOREM 9.3
holds for P and Q.
A close look at Table 8 reveals that some of its systems' set-groups
are embedded in others. For instance, besides the fact that all of the
systems of set-groups in the table are embedded in SG(01), SG(04) is
embedded in SG(02). SG(04) and SG(048) generate the same set-
groups. Example 14 shows the relations among set-groups from cer-
tain set-group systems on the table. Example 14a illustrates the
embedding among (048), (04), (02), and (01). Example 14b shows
that SG(06) is embedded in SG(03). Two more embeddings are given
in Examples 14c and d; SG(02468A), that is, SG(ALPHA), embeds
in SG(04) and (02). Unlike the other cases, Example 14e shows that
SG(ALPHA) does not embed in SG(06).
We can verify these embeddings by showing that the various Q op-
erations are related as specified in THEOREM 9.3. For instance, by
applying some of the preceding theorems, we can factor (04) into
(02)*(24)*(02) and then into (02)*T2*(02)*TA*(02).This means (04)
is a series of (02)s and TTOs. Thus, as indicated, SG(04) is embedded
in SG(02). A similar, but more elaborate, set of transformations
shows that (02468A) can also be rewritten as a series of TTOs and
(02)s.42 In addition we can also factor (048) into (04)*Ts*(04)*T4.
This means SG(048) embeds in SG(04) but via improper inclusion,
that is, identity. In contrast, SG(06) does not embed in SG(02468A).
The reason for this follows from the fact that (06) can be rewritten as
a string of either (02)s and TTOs or (03)s and TTOs. While
SG(02468A) is embedded in SG(02), SG(02468A) is not embedded in
SG(03), since it is impossible to factor (02468A) into strings of (03)s
and TTOs. Thus, (02468A) cannot be embedded in SG(06), since
SG(06) is embedded in SG(03).
Now that the embedding of one Q set-group system in another is
understood by means of THEOREM 9.3, only one question remains:
What is the relation between the operations that generate set-group
systems and the different degrees of complete SC affiliation within
the set-groups of these systems? Why does SG(02) have only four set-
groups, with from 1 to 24 SCs in each set-group, while SG(ALPHA)
(01) 1
(02) 2. 3. 4.
(04) 4. 7. 2. z3. z6. 5. 8. 9.
(048) 1. 4. 7. 2. z3. z6. 5. 8. 9.
Example 14a
227
(01) 1.
00 (03) 1. 2. z 3.
(06) 1K, 1
I
1. 4. 6. 7. 11. 17. 2. 3. 5. z8. 10. z18. z9. z1
-
Example 14b
(048): i. 2. z3. 4.
(02468A): 1. 3. 5. 6. 2. 7. z8. z15. z4. z18. 9. 12.
Example 14c
(02): 1 23.
(02468A) 1. 3. 5. 6. 9. 12. 13. 2. z4. 7. z8. 10. zll.
Example 14d
(06): 1. 2. 4. 3. 5. 13. 6. 9. 15.
(02468A) 1. 9. 13. 2. z4. 10. 16. 3. 12. 5. 6.
(06): 7. 16. 8. 14. 10. 11. 12. 18. 17.
(02468A): 7. 7.
(02468A): z8.
z8. zl. 14.
14. z
z18. 5.
z15. 17.
17.
zl1.
Example 14e
has 18 set-groups, with a maximum of 6 SCs in each? In general, the

answer depends on the number of TTOs that commute with Q. Let us
examine a case where TTO H commutes with Q. We can then assert
that, given two members of SC(X), the pc-sets X and HX, both map
into the same SC under Q. Because Q and H commute, QHX is the
same as HQX, and QX and HQX are related by H, a TTO. Thus, QX
and QHX are members of the same SC. The result is that SC(X) has
fewer SC affiliations than would be the case if H did not commute
with Q. This can be stated as a theorem.
THEOREM 9.4: The greater the number of TTOs that commute

with Q, the fewer the number of SC affiliations in each Q set-group
and the greater the number of Q set-groups in SG(Q).
The efficient production of Q set-groups with various degrees of
SC affiliation depends on having a systematic way to produce Q op-
erations that commute with TTOs. A slight variation of a theorem
found in the literature answers this need.43
THEOREM 9.5: If an operation Q has cycles that are invariantunder

P, Q commutes with P.
When we say that a set of cycles is invariant under a TTO, we
mean that either one cycle maps into itself or another cycle in the
same set. Such mappings respect ordering to within cyclic permuta-
tion. Looking for TTOs that commute with operations of the set-
group systems given in Table 8 will explain the differences of number
and content of set-groups in each system. Since (02) is invariantonly
under T21, there are many ways to map members of a SC in SG(02)
into other SCs, making the size of (02) set-groups generally large.
This accounts for the generally large number of SCs in a set-group of
SG(02). In addition, as (02) is an involution, it is its own inverse. The
(02468A) operation that generates SG(ALPHA) offers a striking
contrast: (02468A) is invariant under six TTOs, the transpositions
Tn where n is even. The complete SC affiliation of any SC in SG
(ALPHA) is further reduced not only since (02468A)'s inverse is
229
similarly invariant but also because ALPHA-1 is TTO related to
(02468A). Here the TTOs are TnI where n is even.
In sum, the characteristics of any SG(Q) are dependent on the
commutivity of Q with TTOs and Q's factoribility into strings of P
operations and TTOs.
Set-Group Systems and the ZC Relation
With the foregoing in mind, we can examine the role of comple-

mentation of SCs in any Q set-group system. When Q and the TTOs
affiliate the SCs into set-groups, it may be the case that ZC-related
SCs are placed in the same set-group.44 This would "resolve" the ZC
relation. It has been shown elsewhere (Morris 1982) that which SCs
are ZC-related depends on what operations are defined as TTOs.
When the TTOs include the M and MI operations, along with the
transpositionsand inversion, the SCs 6-6, 6-11, and 6-19 merge, re-
spectively, with 6-38, 6-40, and 6-44 into three M/MI SCs. In gen-
eral, when we form a Q set-group system, the set of TTOs is
expanded by the inclusion of Q, while the number of different SCs is
reduced. Thus, we will have ZC-related set-groups if the SCs in one
set-group have their complementary SCs in another. Looking once
again at Table 8, we see that many of the systems have ZC-related
set-groups (designated by a "z" before their numeral names). If we
want to create a set-group system that has no ZC-related set-groups,
we must search for an appropriate Q operation. While only opera-
tions (01), (02), and (0369) on Table 8 satisfy this requirement, one
should not assume that set-group systems that do not have ZC-related
set-groups are particularly scarce. For instance, (06)(15) or (0167)
each produce a system with four non ZC-related (hexachordal) set-
groups.
However, when we want to create a set-group system without ZC
relations and one with many set-groups, each containing few SCs, the
situation is different. We are obliged to choose a Q whose cycles are
invariant under as many TTOs as possible. Some possibilities are
given in Example 15.
Example 15
Q invariant under
(02)(46)(8A) T4 T8 T21 T61 TAI
(17)(39)(5B) T4 T8 T21 T61 TAI
(03)(47)(8B) T4 T8 T31 T71 TBI
(01)(34)(56)(78) T3 T9 T11 T41 T71 TAI
T6
(15) (48) (7B) (A2) T3 T6 T9 TOIT31 T61 T91
(02) (35) (68) (9B) T3 T6 T9 T21 T51 T81 TBI
230
The systems produced in each all have ZC-related set-groups. This
situation could have been predicted by examining the make-up of
each Q. Each Q operation is built out of involutions whose (non-
singleton) cycles are based on one interval class. This means that each
operation can be factored into TTOs and a string of operations of the
form "(0 n)," where n is an interval class. From Table 8 we see that
only (01) and (02) [and (05) by implication] produce systems without
ZC relations. Thus, systems built out of embellishments of a Q (via
TTOs and more Qs), where Q is either (03), (04), or (06), will have
ZC relations, even if the embellished Q operator breaks up ZC-
related set-groups in the old Q-system into smaller set-groups in the
newly embellished Q-system, an outcome predicted by THEOREM
9.3. This proviso eliminates all but three of the Qs above from gen-
erating nonZC-related set-groups. Nevertheless, the remaining Qs
having cycles of icl or ic2 also generate ZC groups. One could con-
jecture that this happens because these highly commutative Qs cut up
the SCs into such small set groups that some ZC-related SC pairs
must straddle a set-group. In any case, the three set-group systems in
question do contain fewer ZC-related set-groups and merge more
ZC-related SCs than the other systems generated from Example 15's
collection of Q operations. It is also interesting to note that the sys-
tems with the smallest set-groups (all of which contain at most two
SCs) have Q's that are none other than the M and MI operations,
respectively: (15)(48)(7B)(A2) and (17)(39) (5B). To date, no Q
without ZC relations has yet been found that has more than nine
hexachordal set-groups. This indicates once again that the ZC rela-
tion is deeply interconnected with the whole concept of pc-set equiv-
alence under operations.
While we have been relatively unsuccessfulin mapping ZC-related
SCs into each other in set-group systems of much more than minimal
fragmentation, more favorable results obtain when we interrelate the
ZC-partitions via some operator mapping. It is, therefore, quite pos-
sible to map many or all ZC-related SCs into each other; one simply
maps the entire ZC partition into another under Q and TTOs. The
reader should remember that the ZC-related SCs in the ZC partition
are not obliged to be members of the same Q set-group.
Example 16 gives two instances of ZC-partition mapping. In the
first case (Example 16a) the ZC partition X is found in Example 11b
as W1--one of the set of ZC partitions that instantiates criterion 2 for
the ZC relation. The Q operation commutes with T4 and T8, which
are the generating TTOs of the W ZC partitions. The example shows
how operation Q maps X and its transpositions and inversions into
TTO transformsof all and only other W ZC partitions. Example 16b
provides a new X ZC partition whose parts in pairs are members of
231
6-10, 6-39, 4-9 and 8-9 (6-10 and 6-39 are ZC pairs and 4-9 is the
controlling SC). X is of the A type of T6-generated ZC partitions
listed in Example 11a and is identical to the second ZC partition in
Example 12. The Q at hand, (94) (3A), commutes with T6, as well as
TjI and T71I.The result of QH (H is a TTO) on X maps it into ZC
partitions that are either members of the A or B group of Example
1la. This indicates that Q either preserves X's controlling SC 4-9 or
maps it into 4-25.
Example 16
Q = (048) Q2 = Q-1 = (084)

cyc(Q) = T4cyc(Q) = T8cyc(Q)
X = { {012}{456}{89A}{37B}}
QX = { {412}{856}{09A}{37B}}
QIX = { {4BA}{876}{032}{951}}
X (E) 6-4/37
QX (E) 6-10/39 Q2X (E) 6-17/43
(E) 6-4/37 Q2T1X (E) 6-4/37
QTIX
QT2X (E) 6-17/43 Q2T2X (E) 6-10/39
QT3X (E) 6-24/46 Q2T3X (E) 6-24/46
QIX (E) 6-26/48 Q2IX (E) 6-10/39
QTjIX (E) 6-28/49 Q2TjIX (E=)6-4/376
QT2IX (E) 6-10/39 Q2T2IX (E=)6-10/39
QT3IX (E) 6-4/37 Q2T3IX (E) 6-17/43
Example 16a
Q = (94)(3A)
=
cyc(Q) T6cyc(Q) = T1Icyc(Q) = T7Icyc(Q)
X = { {29AB}{3458}{06}{17}}
QX = { {243B}{A958}{06}{17}}
X (E) 6-10/39, controlling SCs: 4-9/8-9
QX (E=)6-10/39, cont. SCs: 4-9/8-9
QT1X (E=)6-15, cont. SCs: 4-9/8-9
QT2X (E) 6-3/36, cont. SCs: 4-25/8-25
QT3X (E) 6-10/39, cont. SCs: 4-9/8-9
QT4X (E) 6-19/44, cont. SCs: 4-25/8-25
QT5X (E) 6-24/46, cont. SCs: 4-9/8-9
Example 16b
232
The characteristicfeatures of the class of mappingsthat transforms
ZC partitions into each other should now be apparent. The mapping
must map each cycle of a ZC partition's generating TTO into itself or
another cycle of the same operation. In short, Q must commute with
the generating TTO. Thus, the TTO cycles found either as cross sec-
tions45 or members of the parts of the ZC partition are invariant
under Q and vice versa. The outcome is that the SC members of the
ZC partition will be mapped into SCs in the same Q set-group. For
example, 4-9 and 4-25, the controlling SC of ZC partitions in Ex-
ample 16b, are members of the same set-group in the (94) (3A) set-
group system. In general, any of these ZC partitions of the same
cardinalityof parts can be mapped into any other by an appropriately
constructed Q.
Mapping SCs
The mapping or equivalence of ZC-related SCs within or among
set-groups is, of course, a more specific concern of the mapping of
any SC into itself or one or more other SCs. The criteria for such
mapping is the same as given above. As we have seen, to keep the
size of each set-group small, one uses operators whose cycles are in-
variant under as many TTOs as possible. This means that such cycles
can be formed out of pc-sets with high degrees of symmetryand com-
plementation. This connects with two-row combinatoriality, since
such pc-sets are members of the all-combinatorial SCs of Table 5.
As in the discussion of ZC partitions, if a pc-set is made up of the
cycles of a Q operator, it will be mapped into itself under Q. There-
fore, the selection of Q will have much to do with the TTO and Q
cycles that may totally or partially generate the pc-set. In Example
3a, the operation (39) (4A) mapped one network of members of SC
6-17 into members of 6-12. This occurs because there is a set-group
in SG((39)(4A)) that contains only 6-12 and 6-17. The sole mem-
bership of these SCs in this set-group derives from the operator in
question and the fact that both have the complement-union property;
6-12 can be formed out of members of 4-9 and 2-2, while 6-17 can
be derived from members of 4-9 and 2-4. When we consider the cy-
cles of the operator (39) (4A), we see that it must preserve members
of 4-9 or 2-6, since its cycles are each members of 2-6 and comprise
a member of 4-9. Furthermore, the operator either changes a mem-
ber of 2-2 into a member of 2-4 or vice versa or has no effect on the
members. Due to the configuration of the members of 4-9, 2-2
and/or 2-4 in 6-12 and 6-17, and their complement-union proper-
ties, only members of these two hexachordal SCs can be related by
the operation. It is interesting to note that these two SCs are also
233
complement-union pairs, a property only marginally related to this
discussion. In any case, an inspection of the set-groups in Table 8
shows that SG(06) will also uniquely connect 6-17 to 6-12, while
SG(02468A) maps 6-17 to 6-28 and 6-12 to 6-45, so that the net-
works in Example 3a can be mapped into other SCs while retaining
the same number of associations and distributions of pcs and SCs.
Our final example shows some of the possibilities of the mapping
of SCs in a transformationalcontext. This time, we will examine the
structure of a passage of extant music, a song, Traum, from Milton
Babbitt's Du, written in 1951.46 Our brief look gives an inkling of
some of the ways in which pc structures are transformed, directed,
and/or preserved via nonTTO operations that commute with TTOs.
This contrasts vividly with an entity orientation, via intersecting mo-
saics, toward the same musical "facts."47
Example 17
Block 1: Block 2: Block 3:
soprano: 904 2B7 158 A63 907 2B4 A58 163 780 43B 912 A65
high pn.: 158 A63 904 2B7 A58 163 907 2B4 59A 621 B04 873
mid pn.: 2B7 904 A63 158 2B4 907 163 A58 43B 780 A65 912
low pn.: A63 158 2B7 904 163 A58 2B4 907 621 59A 873 B04
partition:D1 D1 D1 D1 D2 D2 D2 D2 D3 D3 D4 D4
Block 4:
soprano: 803 B74 691 52A
high pn.: A15 962 48B 730
mid pn.: B74 803 52A 691
low pn.: 962 A15 730 48B
partition:D5 D5 D6 D6
Example 17a
X1 T5IX TBIX , T6X1 = /P1/

{{904}{158} {2B7} {A63}} =
D1
(X2 = JX1)
X2 T5IX2 TBIX2 T6X2 = = J/P1/
/P2/
{{907}{A58} {2B4} {163}} = D2 = JD1
(X3 = KX2)
X3 T5IX3 TBIX3 T6X3 = /P3/ = K/P2/
{{780}{59A} {43B} {621}} = D3 = KD2
(X4 = T4X3)
X4 TIX4 T7IX4 T6X4 = /P4/ = AUT(T4)/P3/
234
Example 17 (cont.)
{{B04} {912} {873} {A65}} = D4 = T4D3
(X5 = LX4)
X5 TIlX5 T7IX5 T6X5 = /P51/= L/P4/
{{A15} {803} {962} {B74}} = D5 = LD4
(X6 = T4X5 = NX3)
X6 T5IX6 TBIX6 T6X5 = /P6/ = AUT(Ts)P5 = N/P3/
{{691}{48B} {52A} {730}} = D6 = T8D5 = ND3
Operations:
J = (47) (1A) commutes with T6,
T5I, TBI
K = (23) (89) commutes with T6, T51, TBI
L = (01) (23) (45) (67) (89) (AB) commutes with Tn (n is even) and
TnI (n is odd)
N = T8LT4= T8T4L = L
Example 17b
The compositional design of the song is given in Example 17a. It

consists of a 4 x 16 combinatorial matrix that is multiply aggregate
completing on the 12-pc, hexachordal, and trichordal levels. The
design has four sections, or blocks, of four aggregates. Each block has
its own vocabulary of SCs. Block 1 is based on related orderings
of 3-11[037], 6-32[024579] in the block's lynes (first and last
hexachords), and 6-20[014589] in the paired trichordsof each column
(upper pair and lower pair). The SCs of other blocks are as follows:
block 2, 3-7[025], 6-32, and 6-8[023457]; block 3, 3-4[015], 6-20,
6-8; and block 4, 3-11, 6-20, and 6-32. The passage can be heard as
a "modulation" away from and returning to music based on 3-11,
6-20, and 6-32, since the first and last blocks contain the same SCs.
However, the closure is local, not ultimate, since the horizontal and
vertical hexachordal SCs are interchanged.
Each 3 x 4 aggregate of a block can be considered a partition, so
that we can also consider the song to be a series of transformations
from the first partition to the last. Since there are only six different
partitions, labeled from D1 to D6, there are five transformationsto
identify. Example 17b lists the six partitions and the five transforms,
two of which are TTOs. For each partition Dn there is pc-set Xn from
which the other three parts of the partition are derived via TTOs. The
transform that changes each partition into the next changes Xn into
Xn+1, as shown in the example inside the parentheses. The partition
parts can be labeled with the transform names given in the set /Pn-.
235
For example, D1 is the partition {{904}{158} {2B7} {A63}}, which has
{904} as X1, and /Pi/ consists of {X1 T51X1 and T6X1}. The
transform names and the parts of each partition TBIX1
are lined up in Ex-
ample 17b. From the /Pn/ sets, we see that each partition is based on
a TTO group of the form /To T6 T +6I/. As for the transforma-
TnI
tions, the two TTOs are T4 and T8 and the nonTTO operations are J,
K, and L, each of which commutes with every TTO in every /P,/ set
of the partitions it transforms. The operation L is actually
TiALPHA, which also commutes with T4 and T8. Since the TTOs of
the partitions always commute with the transformations, the four
parts of partition Dn are always derived from Xn. Moreover, the com-
mutivity ensures that the SCs that are mapped from corresponding
unions of one partitions' parts to the next are consistently obtained.
One other operation, N, is given that shows how D6 is related to
D3. Since L commutes with T4 and T8, the example indicates that N
is the same as L. Thus, the change from D4 to D5 is the same as from
D3 to D6. This means that the nonadjacent move from the beginning
of block 3 to the end of block 4 is the same as the adjacent move from
the end of block 3 to the beginning of block 4. The result is the em-
bedding of one transform in itself, a kind of "prolongation" empha-
sized by the higher rate of partition change in the last two blocks. In
addition, since L also commutes with To, T6, T51, and TBI, the last
partition is interrelatedby the same TTOs as the partitionsof the first
two and the first part of the third blocks. This permits the new TTO
group of /P4/ and /Ps/ to mark the embedded structure. The new
T T71/, is the (inner) automorphismof the other under
group, /T T61
T4.48 In the example, we show that /P4/ is the automorphism of /P3/
under T4 by the notation /P4/ = AUT(T4)/P31/, where AUT(G)H is
the operation GHG-1 (G and H are TTOs). An automorphismvia T8
also relates /P61to /P5/.49
Final Remarks
This study of complementation and set-group systems has shown

that complementation is connected, albeit indirectly and not obvi-
ously, to the mappings of pc-sets and their equivalence under TTOs
and other operations. While my approach has been somewhat taxo-
nomic, the Babbitt example indicates that approaches to nontonal
music structurethat are process-oriented or transformationalin man-
ner and tone are addressed directly by my results.50My emphasis on
operations, as defined and related by cycles, is easily correlated with
work that deals with networks of transformationdriven by mathemat-
ical groups.51Specifically, the techniques used to build sets that are
236
both mutual complements and related by factored operations can be
applied to any relations among musical entities or states in any kind
of musical space. Nevertheless, the distinction between the enumer-
ation of pc-sets and the number of operations interrelating them (as
exemplified by the COV, EMB, DCOM, and CC(X,FX) functions)
argues that a transformational approach unbalanced by a consider-
ation of the entities related by the transformationscan produce un-
checked degrees of redundancy52in the modeling of the structure of
a musical design or passage.53
APPENDIX
Proofs of Theorems in this Paper
Proof of THEOREM 3.1.2: DSYM(X) = DSYM(FX) where F is any
TTO.
Let /K/ be a set of TTOs such that if KX = X, then K E /K/; thus,
#/K/ = DSYM(X).
Now let Y = FX, and F-1Y = F-1FX = X.
Since X = KX, KF-1Y = F-1Y so that FKF-1Y = Y
and FKF-I(FX) = (FX).
Therefore for every K in /K/, there is a TTO FKF-1 that keeps FX
invariant and the DSYM(FX) = DSYM(X).
Proof of THEOREM 5.7:
COV(SC(S),SC(T)) EMB(SC(S),SC(T))
DSYM(S) DSYM(T)
For convenience, let
C = COV(SC(S),SC(T))
E = EMB(SC(S),SC(T))
DS = DSYM(S)
DT = DSYM(T)
Thus,
C E
DS DT
and,
1. C -DT = E-DS
Let /F/ = the set of TTOs F that map S onto pc-set W, where W C T.
/G/ = the set of TTOs G that map W (the subset of T) onto S.
(Note, 0W = #S.)
Thus, for F E /F/ and G E /G/,
FS = W and GW = S
237
and GFS = S so that F = G-1 or FGW = W so that G = F-1. This
means that for each F E /F/ there is a G e /G/, such that G = F-1 (or
G-1 = F).
Therefore,
2. I/F/= I/G/.
Now suppose that there is a TTO H E /G/, such that HS = S. Then
GHS = W since GS = W. So both G and GH E /F/, but both map S
into W.
Generalizing, given the subset /H/ of /F/ such that for each H E /H/,
HS = S, then there are #/H/ members of /F/ that map S into W.
Now, #/H/ = DS (the DSYM(S)). So that
3. 4/F/ = E (= EMB(SC(S),SC(T)).
DS
A similar argument can be made for #/G/ and COV so that
4/G/
4. # C ( = COV(SC(S),SC(T))
DT
With the substitution of (3) and (4) into (1) we have:
#/G/ DT _ #/F/ DS
DT DS
which is an identity by 2.
Proof of THEOREM 6.2: SC(S) and SC(T) produce CUP for SC(V)
if EMB(SC(S), SC(T-)) = DSYM(T) = DSYM(T-).
Let S, T, and V be pc-sets and /F/ and /G/ be sets of TTOs and F E
/F/, and GE I/G/.
For S E SC(S) and T E SC(T), let us assume that (1) S n T = { } and
(2) S U T E SC(V). Now (1) implies S C T-. Now we can ensure
CUP if there are no other members of SC(S) that are included in T-.
In this case, EMB(SC(S), SC(T-)) = 1. We will call this case 1.
Now let us see if there can be other members of SC(S) and SC(T) that
do not intersect but also only form members of SC(V). We need only
consider alternative members of SC(S), because if FS and GT possess
both properties (1) and (2), then so does G-1FS and T.
So let us examine the cases where (3) FS n T = { } and (4) FS U T
E SC(V), for all TTOs F in /F/, where /F/ is the set of Fs that satisfy
(3) and (4). As a result, (5) FS C T- for all F. To have CUP we must
show that all cases in which a member of SC(S) is included in T- are
equivalent. This occurs if all the included members of SC(S) are
related by operations which keep T- invariant. For this, we must
238
stipulate that (6) only FS is included in T- for each F in /F/ and that
(7) T- is invariant under all F. If /F/ only includes To, then we have
case 1.
With the identity, #I/F/= DSYM(T-) and (5) it follows that
EMB(SC(S),SC(T-)) = #/F/ = DSYM(T-). Now if (6) or (7) do not
hold, then the previous sentence will be false (since then EMB
(SC(S),SC(T-)) will not equal #/F/). Finally, because DSYM(T-) =
DSYM(T) (by THEOREM 7.1.2) we have proved the theorem.
Proof of THEOREM 7.1.1: If K is a TTO and X and Y are pc-sets,
KX = Y implies KX- = Y-.
1. KX = Y
2. XUX- = KXUKX- = YUY- = U= KU
Now subtract 1 from 2 as follows:
KK U KX- = YU Y-
KK = Y
KK- = Y-
Proof of THEOREM 7.1.2: DSYM(X) = DSYM(X-)

By THEOREM 7.1.1, for each FE /F/ where FX = X, FX- = X-.
Thus, the set of TTOs that keeps X invariant is the same set that
keeps X- invariant. Since #/F/ = DSYM(X), DSYM(X) =
DSYM(X-).
Proof of THEOREM 7.1.3: DCOM(SC(X)) = EMB(SC(X),
SC(X-))= COV(SC(X),SC(X-))
Since the firstpart of the theorem was given as definition 7.1, we need
only prove that EMB(SC(X),SC(X-)) = COV(SC(X),SC(X-)).
From THEOREM 5.7 we can write:
EMB(SC(X),SC(X-)) COV(SC(X),SC(X-))
DSYM(X-) DSYM(X)
Because THEOREM 7.1.2 equalizes the two divisors, the theorem is
proved.
Proof of THEOREM 7.1.5: #COMOP is the number of TTOs that
map X into its complement and is given by DCOM(SC(X)) *
DSYM(X).
Let /F/ be the set of TTOs that keeps X invariantand H be a TTO that
maps X into X-. So HX C X-. Now for every F in /F/, we can assert
HFX C X- since FX and X are the same pc-set. Thus for HX in-
cluded in X- there are n TTOs HF that map X into HX where n is #/F/
which equals DSYM(X).
239
Proof of THEOREM 7.2.1: NCC(F,X) is the number of distinctcases
of CC(X,FX) for all F where X and FX are disjoint =
DCOM(X) - (#/N/)/2.
X is a pc-set, F E COMOP, /N/ is the set of TTOs in COMOP(X) that
are not involutions.
Now, CC(X,FX) = CC(X,F-'X) if F is an involution.
Thus, each involution F E COMOP generates some combinationclass
for X and FX and {X U FX} and {X U F-'X} are the same pc-set. But
if F is not an involution then F and F-' are both in /N/, and although
{X U FX} and {X U F-'X} are not the same pc-set, the two unions are
members of the same combination class because CC(X,FX) =
CC(FX,X) = CC(X,F-'X). Thus half of the members of /N/ gener-
ate distinct but redundantmembers of the set of CC(X,FX) for all F.
Proof of THEOREM 8.4: H = Fcyc(Q) = FQF-' for operatorsF and
Q.
Let (. . ab . .) be a cycle of Q and (. . cd. .) be a cycle of H where
H = Fcyc(Q). Also let c = Fa and d = Fb. Now, b = Qa, d = Hc,
c = Fa, d = FQa, and thus, HFa = FQa. Solving for H in HF = FQ
yields what we sought: H = FQF-1.
Proof of THEOREM 8.6: Any operation H can be factored into a
string of transpositional TTOs and the operation (01).
Every operation H can be factored via RULE 8.3 into a series of
2-element cycles. Each of these can be reduced via THEOREM 8.4
into a composite operation H' of the form Tn*(O x)*T_n. This occurs
since the cycle (ab) can be written as (Tna where = 0 and
= x. Then we can write (ab) = Tnb) Now Tna
Tnb x)T-n. using THEO-
REM 8.4 and 8.5 in tandem, we canTn(O recursively reduce each of the
(0 x) cycles (for all x) in H' into a series of transpositions and (01)
operations.
The technique used reinterprets (0 x) under THEOREM 8.5:
(0 x) = (0 (x- 1))*((x- 1) Ti(x- 1))*(0 (x- 1))
The middle cycle is rewritten under THEOREM 8.4 as Tx-1 * (0 1)
* T1_x so we now have
(0 x) = (0 (x-1))*Tx-_*(O 1)*T_-x*(0 (x-1))

Once all the (0 x) operators have been reduced to strings of (0,1),
(0 (x-1)) and transpositions, we may reduce the (0 (x-1)) operators
to transpositions and (0 (x-2)) operations by substituting x-1 for
every x in the preceding paragraph. Continuing repetitively until
x = 1 will reduce the operator H' and therefore the original operator
H into a final string of operators that contains only transpositionsand
(01)operations.
240
NOTES
1. The complement theorem occurs in many guises in the more comprehensive

discussions of pc-set theory. See Morris 1987, 74-77 for a detailed treatment
with proof.
2. I refer to David Lewin 1959 and 1960. Other writings of the early sixties, such
as Hanson 1960 and Forte 1964, also contain versions of the theory.
3. See Howe 1965 for a discussion and taxonomy of pc-set types grouped accord-
ing to their invariances under transposition, inversion, and/or M (multiplication
times 5). The invariance vectors found in the Set-Class Table in Morris 1987,
313-19 provide information on each set-class as to its members' invariance and
complement mapping under the same operations as in Howe.
4. The term is borrowed from Lewin 1977. It "is understood, in a given theoretic
context, to transform the total contents of any pc-set into a pc-set which is ac-
cepted as [equivalent] in that context." (p. 195).
5. DEFs 3.3, 3.4, 5.3 and 5.4 found later in this paper provide definitions of the
Z and ZC-relations among pc-sets and set classes.
6. The term "mosaic" (equivalent to my "partition") originated in Martino 1961.
Mosaics (by my definition, sometimes called "mosaic-classes" in conformance
with Martino's terminology) have been extensively studied in Mead 1988 and
Morris and Alegant 1988.
7. If we take a partition of pcs from a twelve-tone row, we are also partitioning the
order numbers associated with the partitioned pcs. Similarly, when we take a
partition of order numbers from a row, we partition the pcs of that row. See
Mead 1988.
8. An extensive glossary of terms commensurate with this paper is found in Morris
1987, 339-48.
9. The M and MI operators (also known as M5 and M7) are discussed in Howe
1965 and Starr 1978. The latter article and Morris 1982 mix the M and MI op-
erations with Tn and I to form the TTOs or the basic, canonical group of op-
erations on pcs. In this paper, as stated below, TTOs include only Tn and TJI
operations. NonTTO operations, such as ALPHA, are examined in some detail
in Morris 1982 and Mead 1988 and 1989.
10. Although TTO is an acronym for twelve-tone operation, it should not be iden-
tified with order transformations, such as R or rotation. The acronym SO, for
serial operator, stands for combinations of TTOs and order operations and has
been used in Morris 1988. See also note 8.
11. In "6-1[012345]," "6-1" is Forte's contribution and "[012345]" is Rahn's. See
Forte 1973, 179-81 and Rahn 1980, 140-42.
12. See Lewin, 1980, 433-44, and Lewin 1987, 105, 106, 122.
13. For instance, for 8-pc two-partitions divided into 3 and 5 pcs, all eight-pc SCs
are involved in complement unions.
14. Of course, inspecting a two-partition graph for such two-node components will
not always indicate CUP for the generating SC.
15. See Chapter 4 of Morris 1987 for a detailed discussion of mathematical group
structure among operations acting on pcs.
16. The second of the two rows was used in the author's Aubade composed in 1981
and realized at the Eastman School of Music's Digital Electronic Music Studio.
17. For contrast's sake, {{04} {15} {6A} {7B} {28} {39}} is one other "Z-related" mo-
241
saic based on ics 4 and 6 but whichcannot produceany membersof 4-17 or
6-16 by the union of its parts.
18. The sharpsign (#) functionsas the cardinalityoperator.#X is the cardinalityof
set X; if X is {035A}, #X = 4.
19. And eachpairof intersectionpc-setsthatproduceCIPwillin unionproducethe
aggregate.
20. All-combinatorial pentachordalSCsare definedlaterin thispaper.A list of the
all-combinatorial SCs is found in Table 5.
21. With any numberof arguments(as in CC(X,Y,Z, .. .)), combination-classes
representa generalizationof the set-classor set-groupthatapproachesbut does
not equal the mosaicconcept.
22. In addition,CC(X,Y)can have fewerthan24 membersif FX = X andFY = Y
for F E [TTO].
23. The theoremis couchedin the more generalform so that it can be used with
SCs definedby any canonicalgroupof operations.
24. For an exampleof a musicalpassagewherethe full potentialof a high DCOM
numberis compositionallyutilized,see Forte 1973, 79 (Example81). The ex-
ampleshowsa segmentationof SC 8-19 into eight membersof 4-19 in Stravin-
sky's Three Pieces for String Quartet.
25. See Starrand Morris1977-78 and the discussionof generalcombinatoriality
and partitioningin Babbitt 1973.
26. The fourtypesof hexachordalcombinatoriality(P, I, R, and RI) are presented
in Martino1961and Babbitt1961.
27. This partialdescriptionof the ZC-phenomenais found in Morrisand Alegant
1988, 81, n. 18.
28. Furtherbackgroundon operations,cycles and the like is foundin Morris1982
and 1987, 123-35.
29. The order of concatenationmatters. If H were KL, then H would equal
(47)(3902).
30. GivenoperationF performedon pc-setX, thatis, FX, preconcatenating F with
operationE is FEX and postconcatenatingF with E is EFX.
31. To be sure,there are otherwaysto factor(03) to get a seriesof (01)s andtrans-
positions.
32. However,a 2-pc-setcannotcontractinto a unisonunder(01) andTTOs, since
(n n + 1) is always an operation, that is, one-to-one.
33. Thiscorrespondsto the developmentof "familiesof SG(3) set-groups"in Mor-
ris 1982and to "relatingSCs"in Morris1987, 176-77. Note: in the latterref-
erence, a typographicalerrormisidentifiesthe group/H/; it shouldbe defined
as {TOT, T5I TBI} throughout.
34. SC(Y) mapsto itself underQ2.
35. Morris1982correlatesdifferentconceptionsof the way the universeof pc-sets
can be partitionedinto sets of equivalenceclassescalled "set-groups."Thatis,
SG(1) is the collectionof "SCs"whose membershipcriterionis relationunder
T, alone;the definitionof SC we use in this articleis the same as a SG(2) set-
group.The SG(3) system,whoseset-groupsarecomprisedof pc-setsrelatedby
the group of canonicaltransformationsconsistingof combinationsof Tn, I
and/or M, is the orientation of the cited article, so that relations between SG(3)
set-groupsdo not exactlycorrespondto relationshipsbetweenour SCs;rather,
it correspondsto the relationshipsbetween sets composedof the union of the
242
members of M/MI related SCs. Moreover, the term "set-group" is reserved
here for a collection of SCs whereas the term "family (of set-groups)" in the
cited article has the analogous meaning. "Set-group-system," however, has the
same referent: a set of set-groups or SCs related by operations outside the
group of canonical transformations.
36. Where an operation has only one nonsingleton cycle I will use only one pair of
parentheses. That is, I write SG(01) rather than SG((01)).
37. The ALPHA mapping is transpositionally related to the "AL3" mapping,
whose powers generate the system of SG(a) families in Morris 1982. AL3 is
(B97531), which is the same as T2ALPHA. We shall see that the "SG(a)
[hexachordal] families" are the same as the set-groups generated by ALPHA
(in Table 8). This occurs since ALPHA3 is the same as T6MI, which is an equiv-
alence operation in the cited article (see note 27). AL3 and its powers, AL3z,
are also found in Mead 1989, where they are identified as Oz.
38. As mentioned in note 28, the "SG(a) families" in Appendix A of Morris 1982
are the same as the set-groups of the SG(ALPHA) system. One family was in-
advertently omitted from the list of families of SG(a); this family contains the
ZC- and M/MI-related pair of SCs, 6-19 and 6-44, which corresponds to set-
group 12 in the SG(02468A) in Table 8.
39. That is, like Forte, we use "z" instead of "zc."
40. This topic is covered in depth in Morris 1982, where various set-group systems
are (partially) ordered according to embedding. For instance, the system of SCs
(= "SG(2)") is embedded in the M/MI SCs (= "SC(3)"), which is embedded
in SG(ALPHA) (= SG(a)), etc.
41. If this is not the case, then the set-groups in SG(Q) will be the same as the
set-groups in SG(Q').
42. We start with (02468A) which is factored into (OA)*(08)*(06)*(04)*(02). We
then convert each composite operations into a series of (02)s and TTOs.
43. This theorem and its proof is found in Morris 1987, 134.
44. We can distinguish between direct and indirect ZC-pair mapping in Q set-
groups. If Q maps a member of SC(X) into a member of SC(Y), then the map-
ping is direct; if an operation containing more than one Q is needed to map
SC(X) to SC(Y), then the SCs are indirectly mapped and affiliated.
45. A "cross section" is a set of n pcs, each one of which is taken from a different
cycle of an operator H. If the cycles are of equal length, operating with H suc-
cessively on the cross section will generate the aggregate. See Morris, 1987,
130-31, or Starr, 1978.
46. Milton Babbitt, Du, Song Cycle for Soprano and Piano on texts of August
Stramm (Hillsdale, N.Y.: Boelke-Bomart, 1957).
47. The same section of Du is analyzed in some detail in Morris and Alegant 1988.
It is instructive to compare that description with the one offered here.
48. That is, /T T TT1 T71/ is /T4TT8 T4T6T8T4T5IT8 T4TBIT8/.
49. It is interesting to note that the relation of N to L (in Example 17b) can be
considered an automorphism via T4 since N = T8LT4or N = AUT(T4)L.
50. After all, SC affiliation under Q and TTOs sets up a network of interconnec-
tions among SCs, the nodes of which comprise a set-group. Such network as-
pects of set-groups are discussed in Morris 1982 (see the discussion of figures 2
and 3, p. 129) and in Morris 1987, 176-77.
51. See Lewin 1987.
243
52. For example, if we were to specify only the /P,/ sets and transformations in
Example 17 but randomly define X, and therefore the content of Dn, the re-
sulting compositional scheme would neither be guaranteed to be aggregate
completing or possess the cyclic return of SCs to within exchange. The consis-
tency of SC transformation would be maintained, but in some cases the SCs of
a partition might be preserved rather than mapped into other SCs.
53. I am grateful to Richard Hermann for his careful reading of this paper's first
draft and his subsequent corrections and suggestions.
LIST OF WORKS CITED

Babbitt, Milton. 1961. "Set Structure as a Compositional Determinant." Journal of
Music Theory 5, no. 1: 72-94.
- . 1973. "Since Schoenberg." Perspectives of New Music 12, nos. 1 and 2
(double issue): 3-28.
Forte, Allen. 1964. "A Theory of Set-Complexes for Music." Journal of Music The-
ory 8, no. 2: 136-83.
- . 1973. The Structure of Atonal Music. New Haven, Yale University Press.
Hanson, Howard. 1960. The Harmonic Materials of Modern Music. New York: Ap-
pleton Century Crofts.
Howe, Hubert. 1965. "Some Combinational Properties of Pitch-Structures." Per-
spectives of New Music 4, no. 1: 45-61.
Lewin, David. 1959. "Re: Intervallic Relations between Two Collections of
Notes." Journal of Music Theory 3, no. 2: 298-301.
-. 1960. "Re: The Intervallic Content of Notes, Intervallic Relations between
a Collection of Notes and Its Complement: An Application to Schoenberg's
Hexachordal Pieces." Journal of Music Theory 4, no. 1: 98-101.
1977. "Forte's Interval Vector, My Interval Function, and Regener's
Common-Note Function." Journal of Music Theory 21, no. 2: 194-237.
- . 1980. "Some New Constructs Involving Abstract Pcsets, and Probabilistic
Applications." Perspectives of New Music 18, no. 2: 433-44.
- . 1987. Generalized Musical Intervals and Transformations. New Haven:
Yale University Press.
Lipschutz, Seymour. 1976. Discrete Mathematics. New York: McGraw-Hill.
Martino, Donald. 1961. "The Source-Set and its Aggregate Formations." Journal
of Music Theory 5, no. 2: 224-73.
Mead, Andrew. 1988. "Some Implications of the Pitch Class/Order Number Iso-
morphism Inherent in the Twelve-Tone System: Part One." Perspectives of New
Music 26, no. 2: 96-163.
- . 1989. "Some Implications of the Pitch Class/Order Number Isomorphism
Inherent in the Twelve-Tone System: Part Two: The Mallalieu Complex: Its Ex-
tensions and Related Rows." Perspectives of New Music 27, no. 1: 180-223.
Morris, Robert D. 1982. "Set-Groups, Complementation, and Mappings Among
Pitch-Class Sets." Journal of Music Theory 26, no. 1: 101-44.
- . 1982-83. "Combinatoriality Without the Aggregate." Perspectives of New
Music 21, nos. 1 and 2 (double issue): 432-86.
- . 1987. Composition with Pitch-Classes: A Theory of Compositional Design.
New Haven: Yale University Press.
244
-. 1988. "Generalizing Rotational Arrays." Journal of Music Theory 32, no.
1: 75-132.
Morris, Robert D. and Brian Alegant. 1988. "The Even Partitions in Twelve-Tone
Music." Music Theory Spectrum 10: 74-101.
Rahn, John. 1980. Basic Atonal Theory. New York: Longman.
Starr, Daniel V. 1978. "Sets, Invariance, and Partitions." Journal of Music Theory
22, no. 1: 1-42.
Starr, Daniel V. and Robert D. Morris. 1977-78. "A General Theory of Combi-
natoriality and the Aggregate." Perspectives of New Music 16, no. 1: 364-89
and no. 2: 50-84.
245

Morris (1990) : Pitch-Class Complementation and Its Generalizations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Morris (1990) : Pitch-Class Complementation and Its Generalizations

Uploaded by

Copyright:

Available Formats

Yale University Department of Music

Pitch-Class Complementation and Its Generalizations

AND ITS GENERALIZATIONS

One view of pc-set complementation might be described as fol-

Before we can proceed, a number of basic definitions are needed.

DEF 1: A pc-set is an unordered set of pcs.

THEOREM 1.2: IF X c Y, Y- C X-.

DEF 2: An operation is a one-to-one mapping performed on pcs and

DEF 2.1.1: The identity operator is To (pc transposition by 0).

DEF 2.1.2: Two operators G and H commute if GH = HG.

DEF 2.1.4: The powers of an operator H are H, HH, HHH, HHHH,

DEF 2.1.5: The periodicity p of an operator G is the number of times

DEF 2.2.1: The term TJTOdesignates a transformationof any com-

DEF 2.2.3: [T1TO]designates the set of T'TOsin canonical form.

DEF 3.1: A pc-set X is invariant under an operation G if X = GX.

DEF 3.1.1: The degree of symmetry of a pc-set X is the number of

THEOREM 3.1.2: DSYM(X) = DSYM(FX), where F is any TTO.

DEF 4.2: The number of pc-sets in SC(X) is given by 24/DSYM(X).

DEF 5.2: Abstract Complementation: SC(X) is the complement of

DEF 5.4: SC(X) and SC(Y) are (abstractly) ZC-related if Y = X-

The next two definitions are David Lewin's.12

DEF 5.5: The function EMB(SC(X),SC(Y)) gives the number of pc-

THEOREM 5.6: EMB(SC(X),SC(Y)) = COV(SC(Y-), SC(X-)).

enumerating the two-partitions of any member of the SC and deter-

<28367A5B4109> <2837A65B9 140>

THEOREM 6.2: SC(S) and SC(T) produce CUP for SC(V) if

COV(SC(S),SC(T-)) =1= EMB(SC(S),SC(T-))

Example 4 exemplifies the theorem and corollary.

In mathematicalset theory, if one has a true statement A, one can

Generalizations of CUP and CIP

We can generalize CUP and CIP by relaxing or extending their re-

Another direction to pursue in generalizing CUP and CIP begins

SC(S) SC(T) SC(V) SC(W) M Z

From Table 3 it is apparent that two SCs are connected by CUP2

DEF 7.1: The degree of (abstract) complementation of a SC(X)

THEOREM 7.1.1: If K is a TTO and X and Y are pc-sets, KX = Y

THEOREM 7.1.2: DSYM(X) = DSYM(X-)

THEOREM 7.1.3: DCOM(SC(X)) = EMB(SC(X),SC(X-)) =

DEF 7.2: A combination class is the set of combinations of pc-sets FX

THEOREM 7.2.1: NCC(F,X) is the number of distinct cases of

COR 7.2.2: NCC(F,X) for all F where X and FX are

Applications of Multiple Complementation

thereby have the all-combinatorial property. These are <{0134},

Understanding the ZC-Relation

Criterion2: HexachordsX and X- are ZC-relatedif X = (Y U Z) and

Criterion3: HexachordsX andX- are ZC-relatedif X = (Y U Z), and

Criterion4: TwoZC-relatedhexachordsmaybe relatedunderthe TnM

*This column shows the M/MI relations among the 15 ZC-pairs:

Examining criteria 2 and 3 carefully, we can determine a more

Assignments 3 to 5 (as.3, as.4, and as.5) in Example 10 give ways

Name TTO W X Y Z controlling SC

perhaps easier to see that if we have a CUP whose resultant SC is not

TTOs and Operations

In principle, any pc-set can be mapped by an operation into an-

{06789} = (47) (92) * {02468} = (47) (92) * X = L{02468} = LX

If Q = (01)(23) then T1Q = T, * (01)(23) = (0123456789AB)*

In some of the work that follows, we will be operating on the

THEOREM 8.1: Two operations commute if the cycles of one share

COR 8.4.1: Given H = Fcyc(Q), if FQ = QF, then H = Q.

THEOREM 8.5: Given the operator K such that K = (a b), we can

L = KHK = (02) = (01)*(12)*(01)

Using the techniques introduced by the preceding theorems, we

THEOREM 8.6: Any operation H can be factored into a string of

L = KHK = (02) = (01)(12)(01)

(0 x) = (0 (x-1))Tx-_(O 1)T_-x(0 (x-1))