Kite'sthoughts on twin squares: Difference between revisions

TallKite (talk | contribs)
No edit summary
TallKite (talk | contribs)
No edit summary
Line 1: Line 1:
'''Twin squares'''{{idiosyncratic}} (term proposed by [[Kite Giedraitis]]) is a format for presenting a [[regular temperament]]. The [[gencom]] matrix G is shown side by side with its inverse, the [[mapping matrix]] M. M is transposed so that rows multiply with rows. Here's 5-limit meantone temperament, with period 2/1, generator 3/2 and comma 81/80:
'''Twin squares'''{{idiosyncratic}} (term proposed by [[Kite Giedraitis]]) is a format for presenting a [[regular temperament]]. The [[gencom]] matrix is shown side by side with its inverse, the [[mapping matrix]], which is transposed so that rows multiply with rows. Here's 5-limit meantone temperament, with period 2/1, generator 3/2 and comma 81/80:


<math>
<math>
Line 24: Line 24:
== Pedagogical value ==
== Pedagogical value ==


These two matrices can be thought of as a simple basis change from 2.3.5 to 2.3/2.81/80. Thus any temperament can be thought of as a basis change, with one or more of the new basis members vanishing. G expresses the new basis in terms of the old basis, and M expresses the old in terms of the new. Thus creating a temperament consists of 3 steps:
These two matrices can be thought of as a simple basis change from 2.3.5 to 2.3/2.81/80. Thus any temperament can be thought of as a basis change, with one or more of the new basis members vanishing. The lefthand matrix expresses the new basis in terms of the old basis, and the righthand matrix expresses the old in terms of the new. Thus creating a temperament consists of 3 steps:


* perform a basis change with some of the new generators being comma-sized
* perform a basis change with some of the new generators being comma-sized
* temper out those commas
* temper out those commas
* discard the rows in M that corresponds to those commas
* discard the rows in the mapping matrix that corresponds to those commas


The two matrices follow a simple rule: the dot product of any row in G with any row in M is 1 if the 2 rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of G and 3rd row of M). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as you go, similar to solving a sudoku puzzle.
The two matrices follow a simple rule: the dot product of any row in one with any row in another is 1 if the 2 rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of one and 3rd row of the other). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as you go, similar to solving a sudoku puzzle.


[[Category:Mapping]]
[[Category:Mapping]]


{{todo|review}}
{{todo|review}}