Introduction Transformation theory is a branch of music theory that studies how musical objects, such as tonal areas, rhythm, or chords can transform from.

Slides:



Advertisements
Similar presentations
Discrete Mathematics II
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Chapter 4 Euclidean Vector Spaces
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Applied Informatics Štefan BEREŽNÝ
Introduction: Jeanne Knauf  Dr. James Walker  Mathematics  University of Wisconsin-Eau Claire Chord Transformations and Beethoven :  R Transformation:
Math 3121 Abstract Algebra I
Mathematical Physics Seminar Notes Lecture 3 Global Analysis and Lie Theory Wayne M. Lawton Department of Mathematics National University of Singapore.
Algebraic Structures: Group Theory II
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
Subdirect Products of M* Groups Coy L. May and Jay Zimmerman We are interested in groups acting as motions of compact surfaces, with and without boundary.
Introduction to Symmetry Handbook of Constraint Programming, Chapter 10 Presentation by: Robert Woodward Advanced CP, Fall
On the Toric Varieties Associated with Bicolored Metric Trees Khoa Lu Nguyen Joseph Shao Summer REU 2008 at Rutgers University Advisors: Prof. Woodward.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
Abstract In 1924, Stefan Banach and Albert Tarski published the paper Sur la décomposition des ensembles de points en aprties respectivement congruentes.
3.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Residuated Completely Simple Semigroups G. A. Pinto The College of The Bahamas University of York, 14 January 2015.
Subdivision Analysis via JSR We already know the z-transform formulation of schemes: To check if the scheme generates a continuous limit curve ( the scheme.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
Section 1.8: Functions A function is a mapping from one set to another that satisfies certain properties. We will first introduce the notion of a mapping.
ⅠIntroduction to Set Theory 1. Sets and Subsets
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Chapter three: Far rings and some results Far rings and some results In This chapter, we introduce some results about far rings and period profiles, and.
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Matrix Representations of Knot and Link Groups Jess May 2006 Knot Theory Knot Theory is the study of mathematical knots. A knot is a simple closed polygonal.
Post-Tonal Music.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Chap. 6 Linear Transformations
 The idea for chapter 4 came from the Masters thesis of my student Janine du Plessis, from Georgia State University,  TRANSFORMATION GROUPS AND DUALITY.
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
FUNCTIONS.
 期中测验时间:  10 月 31 日上午 9 : 40—11 : 30  第一到第四章  即,集合,关系,函数,组合数学.
Great Theoretical Ideas in Computer Science for Some.
Triangulated Categories. Jaber Akbari May 2015.
Abstract matrix spaces and their generalisation Orawan Tripak Joint work with Martin Lindsay.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
Dr. Wang Xingbo Fall , 2005 Mathematical & Mechanical Method in Mechanical Engineering.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
1 Symmetry Symmetry Chapter 14 from “Model Checking” by Edmund M. Clarke Jr., Orna Grumberg, and Doron A. Peled presented by Anastasia Braginsky March.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
-The rule of 9 - Figured Bass - 6/6-4. For diatonically-named intervals, there is a useful rule applying to all intervals (that is those of one octave.
Normal Subgroups and Factor Groups (11/11) Definition. A subgroup H of a group G is called normal if for every a  G, the left coset aH is the same set.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Section 14 Factor Groups Factor Groups from Homomorphisms. Theorem Let  : G  G’ be a group homomorphism with kernel H. Then the cosets of H form a factor.
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
Math 3121 Abstract Algebra I Lecture 14 Sections
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Unit 1: Elements Key.  Key note or tonic – central tone of a melodic line  Key/tonality– the presence of a central tone and a central chord and scale.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
CDC Relative Entropy Applied to Optimal Control of Stochastic Uncertain Systems on Hilbert Space Nasir U. Ahmed School of Information Technology.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Unit-III Algebraic Structures
The Fundamental Group Sam Kitchin.
Chapter 2 Sets and Functions.
Systems of First Order Linear Equations
Seventh Chords.
The Hodge theory of a smooth, oriented, compact Riemannian manifold
I.4 Polyhedral Theory.
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Presentation transcript:

Introduction Transformation theory is a branch of music theory that studies how musical objects, such as tonal areas, rhythm, or chords can transform from one to another. Neo-riemannian music theory, named after the music theorist Hugo Riemann, studies the transformation of chords through the so-called neo-Riemannian operators. These neo-Riemannian operators form a group, called the Riemannian group. In the early formulations of Riemannian operators, they were defined by their voice-leading properties. In other words, they were defined by how individual notes move from one chord to the next. In particular, the Riemannian group is generated by the maximally smooth voice-leading operations on the set class of major and minor triads. Unfortunately, this has the disadvantage of not easily being generalizable to arbitrary pc-set classes. Some have suggested a root-intervallic approach to Riemannian operators. Unfortunately, this has the disadvantage of abandoning the operators’ voice-leading properties. In particular, isomorphic chord progressions on different pc-set classes have different common-tone retention. In our paper, we show that there exists “dual” pc-set classes, on which isomorphic chord progressions have same common-tone retention. We do this by defining the voice-leading automorphism on the Riemannian group, which preserves common-tone retention. Music theory preliminaries We review basic standard music theory terminology, for the benefit of the musically uninitiated. The equal-tempered 12 chromatic pitches of Western music is represented by. A pitch-class set (abbreviated as “pc-set”) is simply a subset of, which could represent a chord, a melodic line, or a scale. C-major triad = {0,4,7} Next, we define two musically significant operators on pc-sets: (1) The transposition operator, which is given by (2) The inversion operator, which is given by Both of the operators defined above have the property that they preserve all of the intervals present in the pc-set, thus preserving the sound of the chord. Now define an equivalence relation on the set of all pc-sets with the same cardinality as follows: if or for some n. Such an equivalence class is called a pc-set class. For example, the set of all major and minor triads forms a pc-set class. Literature cited Cohn, Richard. Neo-riemannian operations, parsimonious trichords, and their “tonnetz” representations. Journal of Music Theory 41(1):1-66, Hook, Julian. Uniform Triadic Transformations. Journal of Music Theory 46(1/2):57-126, Hook, Julian. Cross-type transformations and the path consistency condition. Music Theory Spectrum 29(1):1-40, Hyer, Brian. Reimag(in)ing Riemann. Journal of Music Theory 39(1): , Please refer to the paper for a full list of works cited. Elementary results in Riemannian music theory Throughout this paper, γ shall denote a pc-set class of 24 elements. Also,, which is a coordinate system used to represent elements of γ, as we now define. Definition 1.1/1.2 [Operators on Coordinate Space] (1) The transposition operator is given by (2) The inversion operator is given by Definition 1.3 [Coordinate System on pc-Set Class] We choose to represent elements of γ with Γ via a bijection called the coordinate system, such that We remark that such a coordinate system is necessary, as chords in γ do not have the notion of a “root” in general. Definition [Riemannian Operators] Let, denoted as, where Theorem [The Riemannian Group], the set of all Riemannian operators, form a group under function composition. This group is isomorphic to. The Riemannian group is actually the normal subgroup of a larger class of operators, called uniform triadic transformations. Since the Riemannian operators act on Γ directly, its action on γ will vary depending on the choice of the coordinate system f. The following theorem shows that the action of a Riemannian operator on γ through a coordinate system can be preserved via an automorphism. Theorem 2.1 [Preservation Automorphism] Let f and g be coordinate systems on a pc-set class γ. Then there exists an automorphism Ω on such that for all, In other words, the following diagram commutes: In general, the preservation automorphism is an inner automorphism. The automorphism can be computed explicitly by using the modulation function, which measures the difference between two coordinate systems f and g. Please refer to the paper for details. Example We now proceed with an example to demonstrate the voice-leading automorphism. Maxx Cho Department of Mathematics/Department of Music, Swarthmore College Recent advancements I have recently begun computing dual pc-set classes for tetrachords. In particular, the set class of dominant seventh/half-diminished seventh chords and the set class containing {0,2,3,6} are dual in that they have algebraically compatible voice-leading. Acknowledgments I would like to thank the 2008 summer REU at UNCA, where this research was conducted. In particular, I would like to thank professors Sam Kaplan, Dave Peifer, and Patrick Bahls. I would also like to thank mathematical music theorists Julian Hook (University of Indiana) and Jon Kochavi (Swarthmore College) for reading my paper and providing helpful suggestions. Please contact for a copy of the paper. Algebraic compatibility of Riemannian operators’ voice-leading properties Retention operators Once a coordinate system has been chosen, this induces operators directly on the space downstairs, as the above diagram shows. We shall denote this group downstairs by. One of the most important tenets of Western music up to the 19th century is minimal voice-leading. In particular, retention notes are an important aspect of a chord progression. Definition 3.1 [Retention Value] Let γ be a pc-set class with coordinate system f. Consider some. (1) Suppose that for all. Then n is called the retention value of C and is denoted by. (2) The retention value of some relative to f is Voice-leading automorphism Consider some Riemannian operator U, which induces an operator G on γ. Now suppose that we apply the same G (that is, with the same retention value) to a different pc-set class γ’. This, in turn, induces a Riemannian operator U’. When is the mapping an automorphism? This question is important as such an automorphism would imply that isomorphic chord progressions have similar voice-leading. Definition 4.1 [Dual pc-Set Classes] Let γ and γ’ be pc-set classes of trichords. Also, fix some and. Now, suppose that and. Then γ and γ’ are dual if and. Here is the central result of this paper: Theorem 4.2 [Voice-Leading Isomorphism] Let γ and γ’ be dual pc-set classes, with corresponding groups and. Then there exists a nontrivial group isomorphism such that Corollary 4.5 [Voice-Leading Automorphim] Let γ and γ’ be dual pc-set classes with coordinate systems f and f’, respectively. Then there exists a unique automorphism such that DUAL {0,2,3,6}C7={0,4,7,10} {0,4,7} {11,4,7} ff (0,+) (11,-) {0,1,4} {5,4,1} gg (0,+) (5,-) The pc-set class containing {0,4,7} and the pc-set class containing {0,1,4} are dual. Thus, there exists an automorphism on the Riemannian group that preserves common-tone retention. In this case, the voice-leading automorphism sends the generators and. Thus,