Saturation, torsion, and contorsion: Difference between revisions

Mike Battaglia (talk | contribs)
added some details about saturation
No edit summary
 
(44 intermediate revisions by 12 users not shown)
Line 1: Line 1:
This is a general introduction to this concept; for a more mathematical take on this, see [[Mathematical theory of saturation]].
{{interwiki
| de =
| en = Saturation, torsion, and contorsion
| es =
| ja = 飽和、ねじれ、contorsion
}}
: ''This is a general introduction to this concept; for a more mathematical take on this, see [[Mathematical theory of saturation]].''


Saturation, torsion, contorsion, and defactoring are all terms for the same effect in [[RTT]], but used in slightly different ways.
[[Category:Regular temperament theory]]
[[Category:Terms]]
[[Category:Math]]
In [[regular temperament theory]], a [[temperament]] is '''saturated''' or ''defactored'' if its set of available intervals matches what is suggested by its mapping or comma basis. A temperament's mapping can fail with respect to saturation by being contorted, and its comma basis can fail through torsion.


== Saturation ==
This article briefly explains these issues; for lattice-based visualizations and intuitive explanations, see [[Pathology of enfactoring|Pathology of saturation]].
A temperament matrix is '''saturated''' when it represents a temperament without any redundancies due to a common factor. A [[mapping]] is saturated when no common factor is found in its rows (i.e. generator mappings). A [[comma basis]], the dual of a mapping, is saturated when no common factor is found in its columns (i.e. comma vectors).


To be more specific, a mapping is saturated if no linear combination of its rows can produce another row whose entries have a common factor (other than 1). For example, {{ket|{{map|3 0 -1}} {{map|0 3 5}}}} is ''not'' saturated, because {{map|3 0 -1}} - {{map|0 3 5}} = {{map|3 -3 6}}, which has a common factor of 3. A mapping which consists of a single row with a common factor, such as {{ket|{{map|24 38 56}}}} with a visible common factor of 2, is also not saturated.
== Contorsion ==
 
A temperament (more specifically, its [[mapping]]) displays '''contorsion''' or '''enfactoring''' if there is some generatable interval which no [[just intonation]] interval maps to. This generatable interval is a '''contorted generator''', which has the property that under any appropriate generator basis, every just interval's mapping has a multiple of ''c'' of that generator, where ''c'', the '''contorsion order''', is greater than one. In a contorted temperament, all generator bases will contain at least one contorted generator. The overall contorsion order of the temperament is the product of all the seperate orders.<ref>H. J. S. Smith [https://www.jstor.org/stable/pdf/108738.pdf ''On Systems of Linear Indeterminate Equations and Congruences''], the overall order is equivalent to the GCD of a matrix's minor determinants, which Smith calls the "greatest divisor".</ref>.
Being unsaturated is, in most cases, a bad thing<ref>Technically speaking, saturation is a property of lattices, not the matrices that generate them, and is only "bad" when referring to a comma basis or a lattice of supporting maps.</ref>.
 
An unsaturated comma basis is rarely useful at all. It means that you have, for instance, some power of a ratio being tempered out without explicitly stating that you are tempering out the ratio itself (for instance, tempering out (81/80)^2 without tempering out 81/80). The interpretation of this situation depends somewhat on the mathematical formalism of regular temperament theory: historically, these are viewed as leading to very strange mathematical objects which have intervals which are *not* tempered out, but somehow become tempered out only when you add them to themselves some number of times (a situation called '''torsion''') - a musical absurdity. In the linear algebra-centric formalism we present here, these strange objects don't arise, but we still view it as bad practice to give an unsaturated basis of commas for the kernel or null space of some temperament for this historical reason.


Unsaturated mapping matrices, on the other hand, represent a different sort of pathology: they involve tuning systems for which some pitches are "unmapped" and have no rational interpretation or relationship to just intonation at all, a situation called '''contorsion''' (as a sort of play on the word "co-torsion", being dual to the situation with "torsion" above). For this reason, unsaturated matrices are also typically considered to not truly represent temperaments. On the other hand, unsaturated mappings can also be useful in a way that unsaturated comma bases are not: unlike the situation with torsion above, these matrices do at least represent temperament-like tuning systems with sensible notions of pitch. When compared to the temperament that is represented by the saturated version of the same mapping, they simply have extra "unmapped" pitches that no just ratio tempers to.
For example, [[5-limit]] [[36edo|36et]] (with mapping {{mapping|36 57 84}}) uses 12 of its pitches per octave (the ones within [[12edo]]) to map the entire 5-limit gamut. As a result, no 5-limit just intonation interval maps to any of the other 24 pitches, making 36et contorted in the 5-limit. Therefore there is a contorted generator; since there is only one generator of 36et (namely, the 36th-octave), that generator must be contorted. Every pitch is mapped to a number of [[Generator|generators]] that is a multiple of 3 (where the generator of 36et is a 36th of the octave), so this generator has contorsion order 3. For a higher-rank example, the 13-limit {{nowrap|87 &amp; 111}} temperament Hemimist, with mapping [{{mapping|3 0 26 56 8}}, {{mapping|0 2 -8 -20 1}}], when restricted to the 2.5.7.11 subgroup, has no just intonation interval corresponding to the period or the square of the period, although there is a just intonation interval (namely, 2/1) corresponding to the cube of the period. Thus, this a contorted generator with contorsion order 3.


For more information on this, see [[The pathology of saturation]].
If a temperament has a subgroup which is contorted, especially a subgroup with small primes (for example, the 11-limit subgroup of 23-limit [[44edo|44et]]), that temperament will likely be easier to traverse than the number of generators required according to the mapping would suggest.


Saturation algorithms correct for this problem, ensuring our ability to most simply — and thereby uniquely — identify temperaments using only matrices. This need can otherwise be satisfied using [[wedgie]]s. The simplest and fastest algorithm for saturating matrices is called [[column Hermite defactoring]]. For more information on such algorithms, see [[Saturation algorithms]].
== Torsion in temperaments ==
A temperament (more specifically, its [[comma basis]]) displays '''torsion''' or ''enfactoring'' if there is some interval mapped to zero which is not formable by multiplying commas in the basis. This interval is a '''comma with torsion''', which has the property that commas in the basis can be multiplied to form the ''c''th power of this ratio, but not that ratio itself or any smaller power, where ''c'' is the '''torsion order'''.


The term saturation was coined by Nicolas Bourbaki in 1972<ref>https://pdfcoffee.com/commutative-algebra-bourbaki-pdf-free.html</ref>, working in the field of commutative algebra. It came to RTT via [[Gene Ward Smith]] and [[Graham Breed]]'s observations of the work of the mathematician William Stein and his Sage software<ref>It may also have come through PARI/GT.</ref>. The earliest identified terminology for this concept was in 1861 by H. J. S. Smith<ref>H. J. S. Smith is the creator of the [[Smith Normal Form]] used in [[Defactoring_algorithms#Precedent:_Smith_defactoring|Gene Ward Smith's saturation algorithm]].</ref> who called saturated matrices "prime matrices"<ref>See "On Systems of Linear Indeterminate Equations and Congruences", which can be accessed here: https://www.jstor.org/stable/pdf/108738.pdf, where Smith also describes the GCD of a matrix's minor determinants as its "greatest divisor" (though neither of this term nor "prime matrix" seems to have caught on).</ref>.
For instance, in a temperament with comma basis {[[6561/6250]], [[128/125]]}, there is an interval 81/80 which is not formable by multiplying commas in the basis, but is nevertheless forced to be mapped to zero because {{nowrap|(81/80)^2 {{=}} (6561/6250)/(128/125)}} is part of the basis. Thus, 81/80 displays torsion with torsion order 2.


== Torsion ==
== Torsion in periodicity blocks ==
'''Torsion''' is used to refer to the opposite of saturation, but only regarding comma bases; in other words, a comma basis is either saturated, or it ''has torsion''.
A comma basis in the context of periodicity blocks displays torsion if it displays torsion as a temperament—precisely when there is some comma with torsion where commas in the basis can be multiplied to form the ''c''th power of this ratio, but not that ratio itself or any smaller power, where ''c'' is the torsion order.


Torsion also refers to a similar situation that occurs for the list of commas defining a [[periodicity block]]; in fact, this was its original use case.
Within periodicity blocks, no mapping needs to be defined from a comma basis, so comma bases with torsion are able to form periodicity blocks where the smallest comma with torsion is not tempered out.


The term torsion has been used since at least as early as 1932<ref>https://scholar.google.com/scholar?q=%22torsion+group%22&hl=en&as_sdt=0%2C5&as_ylo=1900&as_yhi=1940</ref><ref>https://math.stackexchange.com/questions/300586/where-does-the-word-torsion-in-algebra-come-from</ref> and came to RTT from the mathematical field of group theory.
== Saturation algorithms ==
An unsaturated mapping or comma basis can be made saturated, ensuring our ability to most simply—and thereby uniquely—identify temperaments using only matrices. The simplest and fastest algorithm for saturating matrices is called [[column Hermite defactoring]]. For more information on such algorithms, see [[Defactoring algorithms]].


== Contorsion ==
== History and terminology ==
'''Contorsion''' is used to refer to the opposite of saturation, but only regarding mappings; in other words, a mapping is either saturated, or it ''has contorsion'' (or we can say that it ''is contorted'').
The term ''saturation'' was coined by {{w|Nicolas Bourbaki}} in 1972<ref>[https://pdfcoffee.com/commutative-algebra-bourbaki-pdf-free.html Nicolas Bourbaki. ''Commutative Algebra'']</ref>, working in the field of commutative algebra. It came to RTT via [[Gene Ward Smith]] and [[Graham Breed]]'s observations of the work of the mathematician {{w|William A. Stein|William Stein}} and his {{w|SageMath}} software<ref>It may also have come through PARI/GT<!-- typo of PARI/GP? -->.</ref>. The earliest identified terminology for this concept was in 1861 by {{w|Henry John Stephen Smith|H. J. S. Smith}}<ref>H. J. S. Smith is the creator of the {{w|Smith normal form}} used in [[Defactoring algorithms #Precedent: Smith defactoring|Gene Ward Smith's saturation algorithm]].</ref> who called saturated matrices "prime matrices"<ref>Also from ''On Systems of Linear Indeterminate Equations and Congruences'', linked above. Neither ''prime matrix'' nor ''greatest divisor'' seems to have caught on in the mathematical community.</ref>.


The term contorsion was invented for RTT in 2002 by [[Paul Erlich]]<ref>https://yahootuninggroupsultimatebackup.github.io/tuning-math/topicId_2033.html#2456</ref>.
The term ''torsion'' has been used since at least as early as 1932<ref>[https://scholar.google.com/scholar?q=%22torsion+group%22&hl=en&as_sdt=0%2C5&as_ylo=1900&as_yhi=1940 Google Scholar: Torsion group]</ref><ref>[https://math.stackexchange.com/questions/300586/where-does-the-word-torsion-in-algebra-come-from Stack Exchange | ''Where does the word "torsion" in algebra come from?'']</ref> and came to RTT from the mathematical field of group theory. Historically, a group-theory formalism was used to analyze comma bases with torsion, where the smallest comma displaying torsion was not made to vanish although a power of that comma was, which is musically impossible; using a linear algebra formalism as is preferred now, no such impossibility is suggested. The term ''contorsion'' was invented for RTT in 2002 by [[Paul Erlich]]<ref>[https://yahootuninggroupsultimatebackup.github.io/tuning-math/topicId_2033.html#2456 Yahoo! Tuning Group | ''My top 5--for Paul'']</ref>, as a play on the word "co-torsion", being dual to the situation with "torsion" above.


== Defactoring ==
In the case of temperaments, [[Dave Keenan]] and [[Douglas Blumeyer]] have proposed<ref>See [[Defactoring terminology proposal]] for details.</ref> and used '''defactoring''' as a replacement for ''saturation'' and '''enfactoring''' as a replacement for both ''torsion'' and ''contorsion''. So, a mapping or comma basis of a temperament is either defactored (saturated) or enfactored (unsaturated, having torsion/contorsion).
'''Defactoring''' is a synonym for saturation, so it applies to either mappings or comma bases. Its antonym is enfactoring. So, a mapping or comma basis is either defactored (saturated) or enfactored (unsaturated, having torsion/contorsion).  


Defactored and enfactored were coined by [[Dave Keenan]] in collaboration with [[Douglas Blumeyer]] in 2021 as replacement terms for saturation, torsion, and contorsion; for more information, see [[Defactoring terminology proposal]].
== See also ==
* [http://www.tonalsoft.com/enc/t/torsion.aspx Tonalsoft's page on torsion]
* [http://www.tonalsoft.com/enc/c/contortion.aspx Tonalsoft's page on contorsion]


== References ==
== References and footnotes ==
<references />