25 Boulez: Structures Recomposed: 25.1 Boulez's Idea of A Creative Analysis
25 Boulez: Structures Recomposed: 25.1 Boulez's Idea of A Creative Analysis
express thoughts and not just juxtapose myriad atomic units. Of course can
one write a computer program in machine language, but only after having un-
derstood the high-level architecture of one’s ideas. The artistic performance of
a complex composition only succeeds when it is shaped on the high mental
level of powerful gestures. And the composition of computationally complex
musical works needs comprehensive and structurally powerful concepts. Com-
binatorics is just a machine language of mathematical thinking. We shall see
in the following analysis that it was precisely Ligeti’s combinatorial limitation
that hindered his understanding of the real yoga of Boulez’s creative construc-
tions. You can do combinatorics, but only if you know what is the steering
idea—much as you can write the single notes of Beethoven’s Hammerklavier
Sonata if you know the high-level ideas. The mathematics deployed in the mod-
ern mathematical music theory is precisely the tool for such an enterprise. It
is not by chance that traditional music analysis is so poor for the composition
of advanced music: Its conceptual power is far too weak for precise complex
constructions, let alone for their computer-aided implementation.
This lesson is interesting in the creativity process when it comes to suc-
cessfully inspecting those walls. The critical point in wall inspection is to
recognize walls, but this might be very difficult for many reasons. One rea-
son is that one might stand too close to a wall and not be able to see that
there is a wall exactly where one stands. One then needs tools to recognize
the bigger architecture of the critical concept, to conceive entire walls instead
of staring at an unrecognized surface detail. Higher-level languages are exactly
what is needed to conceive higher architectures of critical concepts in the cre-
ative process. Why is this needed? Because the abstraction provided by higher
languages reduces phenomena to their essential characteristics. Modern math-
ematics are such higher languages; they enable insights into what is essential.
The great mathematician Alexander Grothendieck had exactly this ingenious
capability to construct those powerful abstractions that gave access to solutions
of difficult problems (such as the Weil conjectures or Fermat’s conjecture). If
you want to open a wall, you have to understand where it is fixed and how
it is connected to other parts of that critical concept. We shall now see that
Boulez had exactly this capability to understand the higher architecture of
serial approaches to musical composition to solve some of its basic problems.
We observe right from the beginning that there is no intrinsic reason to transfer
the twelve-pitch-class framework to the other parameters. If the number twelve
is natural in pitch classes, its transfer to other parameters is a tricky business.
How can this be performed without artificial constructs?
4
“. . . schliesslich die Tabellen fetischartig als Mass für Dauernqualitäten angewandt
...”
5
Title of a Cecil Taylor LP.
284 25 Boulez: Structures Recomposed
theory of music [78]. This language views the series as a point in the space
Z12 , but just from the perspective of a particular domain, or address, namely
Z11 . In topos theory of music, a space Z12 is replaced by its functor @Z12 ,
which at any given address B, i.e. module over a specific ring, evaluates to
the set B@Z12 of affine module morphisms f : B → Z12 . This means that the
address B is a variable and that our dodecaphonic series is just a point at a
specific address among all possible addresses. In other words, the change of
address is completely natural in this context. What does this mean? Suppose
that we have a module morphism g : C → B between address modules. Then
we obtain a natural map B@Z12 → C@Z12 that maps f : B → Z12 to the
composed arrow f · g : C → Z12 . For example, if we take B = C = Z11 , and if
g(ei ) = e12−i+1 , then the new series SP · g is the retrograde R(SP ) of the
original series.
Our claim is that all of Boulez’s constructions are simply address change
maps and as such follow a very systematic construction. So the combinatoriality
is viewed as a particular technique from topos theory. Of course, Boulez did not
know this, since topos theory was not even invented at that time, and Yoneda’s
lemma, which is the password to all these mathematical constructions, was only
published in 1954, one year after the publication of Structure I. But this makes
his approach even more remarkable; one could even state that in view of this
temporal coincidence, Boulez’s Structures are the Yoneda lemma in music.
The trick that enables Boulez to get rid of the unnatural association of different
parameters with the serial setup stemming from pitch classes is this: For any
(invertible) transformation T : Z12 → Z12 , we have a new pitch class series,
namely the composition T · SP . For a transposition T = T n , we get the n-fold
6
An affine morphism f : M → N between modules M, N over a commutative ring R
is by definition the composition f = T t · g of a R-linear homomorphism g : M → N
and a translation T t : N → N : n "→ t + n. Affine morphisms are well known in
music theory, see [78].
25.3 A First Creative Analysis of Structure Ia from Ligeti’s Perspective 285
transposed series. For an inversion U (x) = u−x, we get the inverted series, etc.
Now, it is evident that one can also obtain this effect by an address change,
more precisely, if T : Z12 → Z12 is any affine transformation, then there is
precisely one address change C(T ) : Z11 → Z11 by a base vector permutation
such that the diagram
C(T )
Z11 −−−−→ Z11
SP "
S (25.1)
" P
T
Z12 −−−−→ Z12
commutes. Instead of performing a parameter transformation on the codomain
of the pitch class row, we may perform an address change on the domain Z11 .
Note, however, that the address change C(T ) is also a function of the underlying
series SP .
What is the advantage of such a restatement of transformations? We now
have simulated the parameter-specific transformation on the level of the univer-
sal domain Z11 , which is common to all parameter-specific series. This enables
a transfer of the transformation actions on one parameter space (the pitch
classes in the above case) to all other parameter spaces, just by prepending
for any series the corresponding address change. So we take the transformation
T on Z12 , replace it with the address change C(T ) on Z11 , and then apply
this one to all other series, i.e. building SD · C(T ), SL · C(T ), SA · C(T ). This
means that we now have a completely natural understanding of the derivation
of parameter series from address changes, which act as mediators between pitch
class transformations and transformations on other parameter spaces. This is
the only natural way of carrying over these operations between intrinsically in-
compatible parameter spaces. We replace the spaces by their functors and act
on the common addresses. This is quite the opposite of purely combinatorial
gaming. It is functoriality at its best. For a deeper understanding of Boulez’s
selection of his duration series, referring to Webern’s compositions, please see
[35].
We may now view Q as an address change Q : Z11 ! Z11 → Z11 on the affine
tensor product Z11 ! Z11 , see [78, E.3.3], defined on the affine basis (ei ! ej )
by Q(ei ! ej ) = eQ(i,j) . For any such address change X : Z11 ! Z11 → Z11 , and
any parameter Z series SZ → P aramSpace with values in parameter space
P aramSpace, we obtain twelve series in that space by address change SZ · X of
the series, and then restricted to the ith rows of X, or equivalently, prepending
the address change (!) rowi : Z11 → Z11 ! Z11 defined by rowi (ej ) = ei ! ej .
Given any such address change matrix X : Z11 ! Z11 → Z11 , we therefore
get twelve series in every given parameter space. So we are now dealing with
the construction of specific matrix address changes, and the entire procedure
is settled. The general idea is this: One gives two address changes g, h : Z11 →
Z11 with g(ei ) = eg(i) , h(ei ) = eh(i) and then deduces a canonical address
change g !h : Z11 !Z11 → Z11 !Z11 by the formula g !h(ei !ej ) = eg(i) !eh(j) .
So, when X is given, we obtain a new address change of the same type by
building the composed address change X · g ! h. For example, the retrograde
matrix in Ligeti’s terminology is just the matrix Q · Id ! R deduced from Q
by the address change Id ! R. And Ligeti’s U -matrix is deduced from Q by
U ! U , where U is the address change associated with the inversion at e! , i.e.
it is the composite Q · U ! U .
Now everything is easy: For the first piano, for the primary parameters
pitch class P and duration D, and for parts A and B, Boulez creates one matrix
Q1P,A , Q1D,A , Q1P,B , Q1D,B address change each, all deduced from Q by the above
composition with product address changes TP,A 1
= U ! Id, TD,A
1
=U ·R!U ·
R, TP,B = U · R ! U · R, TD,B = R ! U via
1 1
Q1P,A = Q · TP,A
1
, Q1D,A = Q · TD,A
1
, Q1P,B = Q · TP,B
1
, Q1D,B = Q · TD,B
1
. (25.2)
This is quite systematic, but the second piano is now completely straight-
forward, in fact the product address changes of this instrument differ just by
one single product address change, namely U ! U :
2
TP,A = U ! U · TP,A
1
, (25.3)
2
TD,A = U ! U · TD,A
1
, (25.4)
2
TP,B = U ! U · TP,B
1
, (25.5)
2
TD,B =U !U · 1
TD,B . (25.6)
For the secondary parameters, loudness and attack, Boulez takes one such
value per series—deduced from the given series SL , SA —that was derived for
the primary parameters. Intuitively, for each row in one of the above matrixes,
we want to get one loudness and one attack value.
25.3 A First Creative Analysis of Structure Ia from Ligeti’s Perspective 287
For loudness, we start with the Q matrix address change for piano 1 and
with the U matrix for piano 2. We then take an address change a : Z11 →
Z11 ! Z11 for part A, and another c : Z11 → Z11 ! Z11 for part B. These
address changes are very natural paths in the given matrix. Path a is just the
codiagonal of the matrix, i.e. a(ei ) = e12−i ! ei , while path c is the path shown
in Figure 25.1.
Fig. 25.1. The two paths a, c for loudness, part A and part B, in Ligeti’s Q matrix
for piano 1; same paths in the U matrix for piano 2.
A first transduction is now immediate. Of course, there are many ways to shift
from the given analytical data to neighboring data in the space of analyti-
cal data. A first way is obvious, and it is also the one in which we urgently
need to remedy the evident imperfection of the given construction, namely the
number of instruments. Why only two instruments? In order to obtain a more
intrinsically serialist construction, one should not work with two, but with
twelve instruments. This is achieved in the most obvious way: We had seen
that the second piano is derived from the first by taking the U matrix instead
of the Q matrix. This suggests that we may now take twelve address changes
Ui : Z11 → Z11 , starting with the identity Id, and generate one instrumental
variant for each such address change, starting with the structure for the first
piano and then adding variants for each successive instrument.
This yields a total of twelve instruments and for each a succession of
twelve series for part A and twelve series for part B, according to the twelve
rows of the matrix address changes as discussed above. For the ith series, this
gives us twelve instruments playing their row simultaneously. Boulez has, of
course, not realized such a military arrangement of series. We hence propose a
completion of the serial idea in the selection of the numbers of simultaneously
playing series. Observe that the series SP of pitch classes has a unique inner
symmetry that exchanges the first and second hexachord, namely the inversion
I = T 7 .−1 between e and e! , i.e. the series defines the strong dichotomy No. 71
in the sense of mathematical counterpoint theory [78, chapter 30]. In part A, we
now select the instrument SP (i) from below and then take I(SP (i)) successive
instruments in ascending order (and using the circle identification for excessive
instrument numbers). For part B we take the I-transformed sequence of initial
instrumental numbers and attach the original serial numbers as successively
ascending occupancies of instruments. Figure 25.2 shows the result.
The next step will be to transform this scheme into a computer program
in order to realize such compositions and to test their quality. It is now evident
that such a calculation cannot be executed by a human without excessive efforts
and a high risk of making errors. Moreover, it is also not clear whether such
creative reconstructions will yield interesting results, or perhaps only for special
transformational sequences U1 , U2 , . . . U12 . We come back to this issue after the
analytical discussion of the second part of Structures.
M acroScore:.Power(N ode)
N ode:.Limit(N ote, M acroScore)
N ote:.Simple(Onset, P itch, Loudness, Duration, V oice)
Onset:.Simple(R), P itch:.Simple(Z), Loudness:.Simple(Q)
Duration:.Simple(R), V oice:.Simple(Z)
290 25 Boulez: Structures Recomposed
with the nodes MA,i , MB,j , respectively. Each node has a note, its anchor note,
and satellites, its MacroScore set denotator. Observe that the concept of an
anchor with satellites is grano cum salis also the approach taken by Boulez in
his multiplication of chords, where the anchor is the distinguished note, and
where the satellites are represented by the intervals of the other notes with
respect to the anchor. This output A, B is then united in the Set rubette and
its output C is sent to the AllFlatten rubette, which recursively “opens” all
the nodes’ satellite MacroScore. How is this performed? Given a node with
empty satellite set, one just cuts off the set. Else, one supposes that its satellite
MacroScore has already recursively performed the flattening process, resulting
in a set of notes. Then one adds these notes (coordinate-wise) to the node’s
anchor note. This means that the satellites are given a relative position with
respect to their anchor note. A trill is a typical example of such a structure: The
trill’s main note is the anchor, while the trill notes are the satellites, denoted
by their relative position with respect to the anchor note.
The output from the Boulez2Macro boulette is given as a MacroScore
denotator for strong reasons: We want to work on the output and take it
as primary material for further creative processing in the spirit of Boulez, a
processing that, as we shall see, requires a hierarchical representation. The
multiplication of chords used in Structure II implicitly also uses a hierarchical
construction of the above type. Therefore, the chosen M acroScore form acts
as a unifier of conceptual architectures in parts I and II of this composition.
But let us se first how the Boulez composition is calculated. We are given the
following input data:
Outlet 1 in the BoulezInput boulette contains the series for all param-
eters as a denotator Series:@Z11 BoulezSeries(SP , SD , SL , SA ) of the form
BoulezSeries:. lim(P, L, D, A) with the factor forms
The attack form A has values in the real 3-space, where the first coordinate
measures the fraction of increase of nominal loudness, the second the articula-
tory fraction of increase in nominal duration, and the third the fraction of shift
in onset defined by the attack type. For example, a sforzato attack (sfz) would
increase nominal loudness by factor 1.3, shorten duration to a staccato by 0.6,
and add to the nominal onset a delay of −0.2 × nominal duration. As discussed
in section 25.2, the address Z11 yields the parametrization by the twelve indices
25.4 Implementing Creative Analysis on RUBATO! 291
Fig. 25.3. The Rubato network generating MIDI files (played by the ScorePlay ru-
bette) with arbitrary input from the creative analysis that is encoded in the Boulez-
Input rubette.
required for a serial sequence of parameters. For example, the pitch class series
is the factor denotator SP :Z11 @P (3, 2, 9, 8, 7, 6, 4, 1, 0, 10, 5, 11).
Outlet 2 contains the two address changes for retrograde R and inversion
U . They are encoded as denotators
R:Z11 @Index(R1 , R2 , . . . R12 ), U :Z11 @Index(U1 , U2 , . . . U12 )
in the simple form Index:.Simple(Z), which indicates the indices Ri of the
affine basis vectors, which are the images of the basis vectors ei C(R) and
inversion C(U ).
Outlet 3 encodes the above sequence U. = (Ui ) of address changes for
the instrumental sequence, i.e. a denotator U.:Z11 @Sequ(U1 , U2 , . . . U12 ) with
Ui :Z11 @Index(Ui,1 , Ui,2 , . . . Ui,12 ), and the list type form Sequ:.List(Index).
(This, in fact, also works for any number of instruments, but we restrict our
example to twelve instruments as chosen above.)
Outlet 4 encodes the registers, which must be defined in order to transform
the pitch classes into real pitches. We give this information in the same form
as the address change sequence, where the coordinates for the ith sequence are
the octave numbers where the pitches of the respective pitch class series in the
corresponding instrument are positioned. Octaves are numbered starting from
octave 0 at pitch 60 in MIDI format. This information is also used to position
the pitches according to an instrumental range.
The Split rubette takes the input series Series and sends its pitch class
factor SP to outlet 5. This denotator is taken as input of the BoulezMatrix
292 25 Boulez: Structures Recomposed
Fig. 25.4. The final “raw” material for twelve instruments. Instruments are distin-
guished by colors. Satellites pertaining to a given anchor note are connected by rays
to that note.
This type of action is very useful if we want to transform just the anchors
and leave the relative positions of the satellite notes invariant. For example,
if the satellites encode an embellishment, such as a trill, then this is the right
operation in order to transform a trill into another trill.
This operation is easily generalized to any set S of nodes in the tree of
M acroScore denotator M , such that no two of them are hierarchically related
(one being in the satellite tree of the other). The above situation of formula
(25.7) referred to the top-level anchors. Suppose that S consists of nodes N .
For non-satellite nodes, we have the above function. Suppose now that such a
node N is a satellite pertaining to a well-defined anchor note A(N ). Thinking
of that anchor note as a local coordinate origin, we may now apply a trans-
−→
formation f ∈ GLn (R) to all selected satellite nodes of A(N ) by the above
formula (25.7), yielding a transformed set of satellites of the same anchor note.
We may apply this operation to each set of satellites of given anchors occur-
ring in S. Since there are no hierarchical dependencies, no contradiction or
ambiguity appears, i.e., no note will be transformed together with one of its
direct or iterated satellite notes. This means that we are simultaneously ap-
plying$ f to all satellite sets of S. In other words, we take the disjoint union
S = Sk of satellite sets Sk pertaining to specific anchor notes Ak and then
apply a simultaneous transformation f to each of these Sk . We denote this
operation by f ' S.
There is another operation that we may apply to a set S with the above
properties. This one takes not the relative positions of S-elements, but their
flattened position and then applies the transformation f to these flattened
notes. It is the operation one would apply in a hierarchical context, such
as a Schenker-type grouping, but without further signification of the hierar-
chy for the transformational actions. After the transformation, each of these
transformed flattened notes is taken back to its original anchor note. For ex-
ample, if s = 1, and if N = (AN , SN ) is a satellite of level zero anchor
note A(N ), then we first flatten the note (once), which means that we take
N " = (A(N ) + AN , SN ), we then apply f to its new anchor A(N ) + AN , yield-
ing N "" = (f (A(N ) + AN ), SN ), and we finally subtract the original anchor,
yielding the new satellite N """ = (f (A(N ) + AN ) − A(N ), SN ) of A(N ). This
operation is denoted similar to the above operation, i.e., by f · S.
This formula has nothing particular regarding the special nature of the
different powers of translations. This means that the formula could be gener-
alized without restrictions to describe grids of any sequence of transformations
−→
f. = (f1 , f2 , . . . , fr ) for fi ∈ GLn (R), thus yielding the generalized wallpaper
formula
%
W (f., I.)(M ) = f1λ1 ◦ f2λ2 ◦ . . . frλr (M ) (25.9)
ai ≤λi ≤bi
which also works for negative powers of the transformations, since these are all
invertible. In our context, the motif M will no longer be a set of common notes,
but a denotator of M acroScore form. Therefore, we may replace the naive
application of transformations to a set of notes by the action of transformations
on such denotators as discussed above. This means that—mutatis mutandis—
we have two transformation wallpapers for a set S of nodes of a M acroScore
denotator with the above hierarchical independency property: the relative one
%
W (f., I.) ' S = f1λ1 ◦ f2λ2 ◦ . . . frλr ' S (25.10)
ai ≤λi ≤bi
%
W (f., D) ' S = f1λ1 ◦ f2λ2 ◦ . . . frλr ' S (25.12)
(λ1 ,λ2 ,...λr )∈D
The BigBang rubette was implemented during a research visit of one of the
authors (Florian Thalmann) at the School of Music of the University of Min-
nesota. It allows for graphically interactive gestural actions for transformations
and wallpapers on ScoreF orm denotators. We shall not describe all transfor-
mations in detail, but show the typical gestural action to be taken for a rotation
of a denotator (see Figures 25.5 and 25.6).
Fig. 25.5. Rotation (right) of the first bars of Beethoven’s op. 106, Allegro (left).
The rotation circle shows the mouse movement on its periphery; the original is also
shown.
Fig. 25.6. Here, a relative rotation is performed on the two satellite sets, with their
two anchor notes at the rays’ centers. The original positions are also shown.
Fig. 25.7. A wallpaper is built from a motif (darkened). Two transformations are
used—both are translations followed by rotation and shrinking dilation.
ing from the raw material MC shown in Figure 25.4. We also applied the
alteration techniques implemented in the BigBang rubette but will not dis-
cuss this technique further here. The composition can be downloaded from
http://www.encyclospace.org/special/restructures.mp3.
This composition has four movements. Each movement is transformed
according to a specific geometric BigBang rubette technique, which we describe
in the following paragraphs. After executing these operations, the twelve voices
of each movement, which are avaliable as twelve separate MIDI files, were
elaborated by adequate orchestrations. This was realized by Tsuda, who is
an expert in sound design. He orchestrated and attributed the MIDI files to
specific sounds in order to transform the abstract events into an expressive
body of sound.
The first movement (Expansion/Compression) takes a copy of MC , then
“pinches” the satellites (but not the anchors!) of part A in the sense that the
first (in onset) satellites are alterated 100 percent in pitch direction only to
a defined pitch, whereas the last satellites are left as they were (0 percent
alteration). The satellites inbetween are pinched by linear interpolation. The
same procedure is applied to part B; however, this time the pinching is 100
percent at the end and 0 percent at the start. This is shown in Figure 25.8.
Instrumentation 1: Voice 1 = grand piano, voice 2 = scraped, bowed,
rolled, and struck suspended cymbals, voice 3 = electronic mallets, voice 4 =
solo cello, voice 5 = pizzicato strings, voice 6 = electronic space strings, voice 7
= plucked e-bass, voice 8 = grand piano, voice 9 = electronic percussion, voice
10 = timpany, voice 11 = electronic toms, voice 12 = electronic bells.
Fig. 25.8. First movement: variable pinching the satellite onsets—100 percent pinch-
ing at start and end onsets, no pinching in the meeting of end of part A and start of
part B.
25.5 A Second More Creative Analysis and Reconstruction 301
Fig. 25.9. Fourth movement: sucking down the anchors, expanding their durations,
lifting the satellites in part A, then progressive pinching of notes in part B.
Fig. 25.11. Third movement: retrograde inversion of anchors and satellites in part
A, rotation of satellites in part B.