Constrained tuning/Analytical solution to constrained Euclidean tunings: Difference between revisions

+intro; correct wording (the "minor" is actually the minor matrix, not its determinant); +final tuning map of the example
ArrowHead294 (talk | contribs)
mNo edit summary
 
(6 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{breadcrumb}}
This article gives an analytical form of Euclidean-normed [[constrained tuning]]s.  
This article gives an analytical form of Euclidean-normed [[constrained tuning]]s.  


Line 4: Line 5:
The [[projection map]] is useful in a lot of ways. We will work extensively with the projection map in the course of solving constrained tunings.  
The [[projection map]] is useful in a lot of ways. We will work extensively with the projection map in the course of solving constrained tunings.  


First, it manifests itself as a form of [[tuning map]]. Its columns represent tunings of [[formal prime]]s in terms of [[monzo]]s. The tuning map in the logarithmic scale can be obtained by multiplying the projection map by the [[JIP]] on the left.  
First, it manifests itself as a form of [[tuning map]]. Its columns represent tunings of [[formal prime]]s in terms of [[monzo]]s. The tempered tuning map in the logarithmic scale can be obtained by multiplying the projection map by the [[just tuning map]] on the left.  


<math>\displaystyle T = JP</math>
<math>\displaystyle T = JP</math>


where T is the tuning map, J the JIP, and P the projection map.  
where ''T'' is the tempered tuning map, ''J'' the just tuning map, and ''P'' the projection map.  


The projection map multipled by a [[Temperament mapping matrices|temperament map]] on the left yields its [[Tmonzos and tvals|tempered monzos]]. In particular, if A is the temperament map of P, then
The projection map multipled by a [[temperament mapping matrix]] on the left yields its [[tmonzos and tvals|tempered monzos]]. In particular, if ''V'' is the temperament mapping matrix of ''P'', then


<math>\displaystyle AP = A</math>
<math>\displaystyle VP = V</math>


Second, the projection map multipled by a monzo list on the right yields the tunings of the list in terms of monzos. In particular, if B is the [[comma list]] of P, then
Second, the projection map multipled by a monzo list on the right yields the tunings of the list in terms of monzos. In particular, if ''M'' is the [[comma list]] of ''P'', then


<math>\displaystyle PB = O</math>
<math>\displaystyle PM = O</math>


For any Euclidean aka ''L''<sup>2</sup> tunings, the weighted projection map is
For any Euclidean aka ''L''<sup>2</sup> tuning without constraints, the weight–skew transformed projection map is


<math>\displaystyle P_W = V^+V</math>
<math>\displaystyle P_X = V_X^+ V_X</math>


where V = AW is the weighted val list of the temperament. Removing the weight, it is
where <sup>+</sup> is the [[pseudoinverse]], and ''V''<sub>''X''</sub> = ''VX'' is the weight–skew transformed val list of the temperament. Removing the transformation, it is


<math>\displaystyle P = WV^+VW^{-1} = W(AW)^+A</math>
<math>\displaystyle P = XV_X^+ V_X X^+ = X(VX)^+V</math>


== CFE tuning ==
== CEE tuning ==
Let us start with CFE tuning (<u>c</u>onstrained <u>F</u>rob<u>e</u>nius tuning): there is no weight or skew, and the constraint is the octave.  
Let us start with CEE tuning (constrained equilateral-Euclidean tuning): the weight–skew transformation is represented by an identity matrix, which will be omitted below, and the constraint is the octave.  


Denote the constraint by B<sub>C</sub>. In the case of CFE, it is the octave:  
Denote the constraint by ''M''<sub>''I''</sub>. In the case of CEE, it is the octave:  


<math>\displaystyle B_{\rm C} = [ \begin{matrix} 1 & 0 & \ldots & 0 \end{matrix} \rangle</math>
<math>\displaystyle M_I = [ \begin{matrix} 1 & 0 & \ldots & 0 \end{matrix} \rangle</math>


but it works as long as it is the first ''r'' elements of the [[Subgroup basis matrices|subgroup basis]].  
but it works as long as it is the first ''r'' elements of the [[subgroup basis matrix|subgroup basis]].  


We will denote the projection map by P. The goal is to work out the constrained projection map P<sub>C</sub>, which also satisfies
We will denote the projection map by ''P''. The goal is to work out the constrained projection map ''P''<sub>C</sub>, which also satisfies


<math>\displaystyle  
<math>\displaystyle  
AP_{\rm C} = A \\
VP_{\rm C} = V \\
P_{\rm C}B = O
P_{\rm C}M = O
</math>
</math>


in addition to
in addition to


<math>\displaystyle P_{\rm C} B_{\rm C} = B_{\rm C}</math>
<math>\displaystyle P_{\rm C} M_I = M_I</math>


Since P is characteristic of the temperament and is independent of the specific tuning, notice
Since ''P'' is characteristic of the temperament and is independent of the specific tuning, notice


<math>\displaystyle P = P_{\rm C}^+P_{\rm C}</math>
<math>\displaystyle P = P_{\rm C}^+P_{\rm C}</math>


where <sup>+</sup> is the [[Wikipedia:Moore–Penrose inverse|pseudoinverse]]. That makes the pseudoinverse of P<sub>C</sub> easier to work with than P<sub>C</sub> itself, as
That makes the pseudoinverse of ''P''<sub>C</sub> easier to work with than ''P''<sub>C</sub> itself, as


<math>\displaystyle  
<math>\displaystyle  
P_{\rm C}^+ B_{\rm C}
P_{\rm C}^+ M_I
= P_{\rm C}^+P_{\rm C} B_{\rm C}
= P_{\rm C}^+P_{\rm C} M_I
= P B_{\rm C}
= P M_I
</math>
</math>


Both P<sub>C</sub><sup>+</sup>B<sub>C</sub> and PB<sub>C</sub> are the same slice of the first ''r'' columns of P.
Both ''P''<sub>C</sub><sup>+</sup>''M''<sub>''I''</sub> and ''PM''<sub>''I''</sub> are the same slice of the first ''r'' columns of ''P''.


With the first ''r'' rows and columns removed, the remaining part in the mapping will be dubbed the minor matrix, denoted A<sub>M</sub>. The minor matrix of the projection map
With the first ''r'' rows and columns removed, the remaining part in the mapping will be dubbed the minor matrix, denoted ''V''<sub>M</sub>. The minor matrix of the projection map


<math>\displaystyle P_{\rm M} = A_{\rm M}^+ A_{\rm M} </math>
<math>\displaystyle P_{\rm M} = V_{\rm M}^+ V_{\rm M} </math>


forms an orthogonal projection map filling the bottom-right section of P<sub>C</sub><sup>+</sup>.  
forms an orthogonal projection map filling the bottom-right section of ''P''<sub>C</sub><sup>+</sup>.  


In general, if B<sub>C</sub> is the first ''r'' elements of the subgroup basis, then P<sub>C</sub> is of the form
In general, if ''M''<sub>''I''</sub> is the first ''r'' elements of the subgroup basis, then ''P''<sub>C</sub> is of the form


<math>\displaystyle  
<math>\displaystyle  
P_{\rm C} =  
P_{\rm C} =  
\begin{bmatrix}  
\begin{bmatrix}  
A^+AB_{\rm C} & \begin{matrix} O \\ A_{\rm M}^+A_{\rm M} \end{matrix}
V^+VM_I & \begin{matrix} O \\ V_{\rm M}^+V_{\rm M} \end{matrix}
\end{bmatrix}^+
\end{bmatrix}^+
</math>
</math>


== Otherwise normed tuning ==
== Otherwise normed tuning ==
If there is a weight W and/or a skew X, such as CTWE tuning, the weight-skew should be applied to the map and the constraint first:  
If there is a weight–skew transformation ''X'', such as CTWE tuning, the transformation should be applied to the map and the constraint first:  


<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
V &= AWX \\
V_X &= VX \\
M_{\rm C} &= (WX)^+ B_{\rm C}
(M_I)_X &= X^+ M_I
\end{align}
\end{align}
</math>
</math>


Working from here, we find the weighted projection map (P<sub>C</sub>)<sub>WX</sub>:  
Working from here, we find the weight–skew transformed projection map (''P''<sub>C</sub>)<sub>''X''</sub>:  


<math>\displaystyle  
<math>\displaystyle  
(P_{\rm C})_{WX} =  
(P_{\rm C})_X =  
\begin{bmatrix}  
\begin{bmatrix}  
V^+VM_{\rm C} & \begin{matrix} O \\ V_{\rm M}^+V_{\rm M} \end{matrix}
V_X^+ V_X (M_I)_X & \begin{matrix} O \\ (V_X)_{\rm M}^+ (V_X)_{\rm M} \end{matrix}
\end{bmatrix}^+
\end{bmatrix}^+
</math>
</math>
Line 96: Line 97:
To reconstruct the original projection map, apply
To reconstruct the original projection map, apply


<math>\displaystyle P_{\rm C} = WX (P_{\rm C})_{WX} (WX)^+</math>
<math>\displaystyle P_{\rm C} = X (P_{\rm C})_X X^+</math>


== Nontrivially constrained tuning ==
== Nontrivially constrained tuning ==
What if the constraint is something more complex, especially when it is not the first ''r'' elements of the subgroup basis? It turns out we can always transform the subgroup basis to encapsulate the constraint. Such a subgroup S is formed by the constraint and its orthonormal complement.  
What if the constraint is something more complex, especially when it is not the first ''r'' elements of the subgroup basis? It turns out we can always transform the subgroup basis to encapsulate the constraint. Such a subgroup basis matrix ''S'' is formed by the constraint and its orthonormal complement.  


<math>\displaystyle S = [\begin{matrix} B_{\rm C} & B_{\rm C}^\perp \end{matrix}] </math>
<math>\displaystyle S = [\begin{matrix} M_I & M_I^\perp \end{matrix}] </math>


For example, if the temperament is in the subgroup basis of 2.3.5.7, and if the constraint is 2.5/3, then
For example, if the temperament is in the subgroup basis of 2.3.5.7, and if the constraint is 2.5/3, then


<math>\displaystyle  
<math>\displaystyle  
B_{\rm C} =  
M_I =  
\begin{bmatrix}
\begin{bmatrix}
1 & 0 \\
1 & 0 \\
Line 113: Line 114:
0 & 0
0 & 0
\end{bmatrix},  
\end{bmatrix},  
B_{\rm C}^\perp =  
M_I^\perp =  
\begin{bmatrix}
\begin{bmatrix}
0 & 0 \\
0 & 0 \\
Line 129: Line 130:
</math>
</math>


We should apply this S to the map and the constraint to convert them into the working basis:  
We should apply this ''S'' to the map and the constraint to convert them into the working basis:  


<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
A_S &= AS \\
V_S &= VS \\
(B_{\rm C})_S &= S^{-1}B_{\rm C}
(M_I)_S &= S^{-1}M_I
\end{align}
\end{align}
</math>
</math>
Line 142: Line 143:
<math>\displaystyle P_{\rm C} = S (P_{\rm C})_S S^{-1}</math>
<math>\displaystyle P_{\rm C} = S (P_{\rm C})_S S^{-1}</math>


Similarly, if there is a weight W and/or a skew X, it should be applied to the map and the constraint first:  
Similarly, if there is a weight–skew transformation ''X'', it should be applied to the map and the constraint first:  


<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
V &= AWX \\
V_X &= VX \\
M_{\rm C} &= (WX)^+ B_{\rm C}
(M_I)_X &= X^+ M_I
\end{align}
\end{align}
</math>
</math>


and then the basis transformation matrix should be found out in this weight-skewed space:  
and then the basis transformation matrix should be found out in this weight–skew transformed space:  


<math>\displaystyle  
<math>\displaystyle  
S = [\begin{matrix} M_{\rm C} & M_{\rm C}^\perp \end{matrix}]
S = [\begin{matrix} M_I & M_I^\perp \end{matrix}]
</math>
</math>


We should apply this S to the weight-skewed map and the weight-skewed constraint to convert them into the working basis:  
We should apply this ''S'' to the weight–skew transformed map and the weight–skew transformed constraint to convert them into the working basis:  


<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
V_S &= VS \\
V_{XS} &= VXS \\
(M_{\rm C})_S &= S^{-1} M_{\rm C}
(M_I)_{XS} &= (XS)^+ M_I
\end{align}
\end{align}
</math>
</math>


Proceed as before. The projection map found this way will be weight-skewed and in the working basis. To reconstruct the original projection map, apply
Proceed as before. The projection map found this way will be weight–skew transformed and in the working basis. To reconstruct the original projection map, apply


<math>\displaystyle P_{\rm C} = WXS (P_{\rm C})_{WXS} S^{-1} (WX)^+</math>
<math>\displaystyle P_{\rm C} = XS (P_{\rm C})_{XS} (XS)^+</math>


== Example ==
== Example ==
Let us try tuning septimal meantone to CFE.  
Let us try tuning septimal meantone to CEE.  


Its mapping is
Its mapping is


<math>\displaystyle  
<math>\displaystyle  
A =
V =
\begin{bmatrix}
\begin{bmatrix}
1 & 0 & -4 & -13 \\
1 & 0 & -4 & -13 \\
Line 187: Line 188:
<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
P &= A^+A \\
P &= V^+V \\
&= \frac{1}{446}
&= \frac{1}{446}
\begin{bmatrix}
\begin{bmatrix}
Line 200: Line 201:
The minor matrix of the mapping is
The minor matrix of the mapping is


<math>\displaystyle A_{\rm M} = \begin{bmatrix} 1 & 4 & 10\end{bmatrix}</math>
<math>\displaystyle V_{\rm M} = \begin{bmatrix} 1 & 4 & 10\end{bmatrix}</math>


and the minor matrix of the projection map is
and the minor matrix of the projection map is
Line 206: Line 207:
<math>\displaystyle  
<math>\displaystyle  
\begin{align}
\begin{align}
P_{\rm M} &= A_{\rm M}^+A_{\rm M} \\
P_{\rm M} &= V_{\rm M}^+V_{\rm M} \\
&= \frac{1}{117}
&= \frac{1}{117}
\begin{bmatrix}  
\begin{bmatrix}  
Line 240: Line 241:
</math>
</math>


The tuning map T<sub>C</sub> is
The tuning map ''T''<sub>C</sub> is


<math>\displaystyle  
<math>\displaystyle  
Line 248: Line 249:
\end{align}
\end{align}
</math>
</math>
[[Category:Math]]