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

From Xenharmonic Wiki
Jump to navigation Jump to search
m FloraC moved page User:FloraC/Solution to constrained tuning to Analytical solution to constrained Euclidean tunings: Tho the reasoning can use more improvement, these are correct and production-ready results
CEE tuning: I don't think these are ever gonna be solved, so I'm gonna discuss them as plain observations
 
(12 intermediate revisions by 3 users not shown)
Line 1: Line 1:
{{Breadcrumb}}
This article gives an analytical form of Euclidean-normed [[constrained tuning]]s.
== Preliminaries ==
== Preliminaries ==
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 primes in terms of monzos. 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 map on the left yields its 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 [[tempered monzos and vals|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''<sub>2</sub> tunings, the weighted projection map is
The [[Frobenius tuning|Frobenius projection map]] can be used to characterize a temperament. If ''V'' is the temperament mapping matrix, then its Frobenius projection map ''P''<sub>F</sub> is


<math>\displaystyle P_W = V^+V</math>
<math>\displaystyle P_{\rm F} = V^+ V</math>


where V = AW is the weighted val list of the temperament. Removing the weight, it is
We can generalize that to any other Euclidean a.k.a. ''L''<sup>2</sup> tuning without constraints, so that the weight–skew transformed projection map ''P''<sub>''X''</sub> is


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


== CFE tuning ==
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
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.  


Denote the constraint by B<sub>C</sub>. In the case of CFE, it is the octave:
<math>\displaystyle P = XV_X^+ V_X X^+ = X(VX)^+V</math>


<math>\displaystyle B_{\rm C} = [ \begin{matrix} 1 & 0 & \ldots & 0 \end{matrix} \rangle</math>
== CEE tuning ==
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.


but it works as long as it is the first ''r'' elements of the subgroup basis.
Denote the constraint by ''M''<sub>''I''</sub>. In the case of CEE, it is the octave:


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 M_I = [ \begin{matrix} 1 & 0 & \ldots & 0 \end{matrix} \rangle</math>


<math>\displaystyle  
The following observations work as long as the constraint is the first ''r'' elements of the [[subgroup basis matrix|subgroup basis]].
AP_{\rm C} = A \\
 
P_{\rm C}B = O
We will denote the Frobenius projection map by ''P''<sub>F</sub>. The goal is to work out the constrained projection map ''P''<sub>C</sub>, which, like ''P''<sub>F</sub>, also satisfies
 
<math>\displaystyle
\begin{align}
VP_{\rm C} &= V \\
P_{\rm C}M &= O
\end{align}
</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>
 
For an arbitrary projection map ''P'' of the same temperament, notice
 
<math>\displaystyle P_{\rm F} = P^+ P</math>


Since P is characteristic of the temperament and is independent of the specific tuning, notice
so if we substitute ''P''<sub>C</sub> for ''P'', we have


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


where <sup>+</sup> is the pseudoinverse. That makes the pseudoinverse of P<sub>C</sub> easier to work with than P<sub>C</sub> itself, as
and


<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_{\rm F} 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.
Since ''PM''<sub>''I''</sub> is the tuning of ''M''<sub>''I''</sub> in terms of monzos, which is just the slice of the first ''r'' columns of ''P'' in this case, it follows that {{subsup|''P''|C|+}} and ''P''<sub>F</sub> share the first ''r'' columns.


With the first ''r'' rows and columns removed, the remaining part in the mapping will be dubbed the minor, denoted A<sub>M</sub>. The minor of the projection map
With the first ''r'' rows and columns removed, the remaining part in the mapping is another invariant of the temperament, which will be dubbed the minor matrix, denoted ''V''<sub>M</sub>. We observe that 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>, and the top-right section comprises only zeros.  


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
Therefore, 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 94: Line 107:
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 111: Line 124:
0 & 0
0 & 0
\end{bmatrix},  
\end{bmatrix},  
B_{\rm C}^\perp =  
M_I^\perp =  
\begin{bmatrix}
\begin{bmatrix}
0 & 0 \\
0 & 0 \\
Line 127: Line 140:
</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 140: Line 153:
<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 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 185: Line 198:
<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 196: Line 209:
</math>
</math>


The minor 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 projection map is
and the minor matrix of the projection map is


<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 214: Line 227:
</math>
</math>


In fact,
The pseudoinverse of the CEE projection map can be composed as


<math>\displaystyle  
<math>\displaystyle  
Line 237: Line 250:
\end{bmatrix}
\end{bmatrix}
</math>
</math>
The tuning map ''T''<sub>C</sub> is
<math>\displaystyle
\begin{align}
T_{\rm C} &= JP_{\rm C} \\
&= \langle \begin{matrix} 1200 & 1896.8843 & 2787.5374 & 3368.8435 \end{matrix} ]
\end{align}
</math>
== Notes ==
<references group="note"/>
[[Category:Math]]
[[Category:Pages with open problems]]

Latest revision as of 14:51, 1 September 2025

This article gives an analytical form of Euclidean-normed constrained tunings.

Preliminaries

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 primes in terms of monzos. 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{ \displaystyle T = JP }[/math]

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 matrix on the left yields its tempered monzos. In particular, if V is the temperament mapping matrix of P, then

[math]\displaystyle{ \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 M is the comma list of P, then

[math]\displaystyle{ \displaystyle PM = O }[/math]

The Frobenius projection map can be used to characterize a temperament. If V is the temperament mapping matrix, then its Frobenius projection map PF is

[math]\displaystyle{ \displaystyle P_{\rm F} = V^+ V }[/math]

We can generalize that to any other Euclidean a.k.a. L2 tuning without constraints, so that the weight–skew transformed projection map PX is

[math]\displaystyle{ \displaystyle P_X = V_X^+ V_X }[/math]

where + is the pseudoinverse, and VX = VX is the weight–skew transformed val list of the temperament. Removing the transformation, it is

[math]\displaystyle{ \displaystyle P = XV_X^+ V_X X^+ = X(VX)^+V }[/math]

CEE tuning

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 MI. In the case of CEE, it is the octave:

[math]\displaystyle{ \displaystyle M_I = [ \begin{matrix} 1 & 0 & \ldots & 0 \end{matrix} \rangle }[/math]

The following observations work as long as the constraint is the first r elements of the subgroup basis.

We will denote the Frobenius projection map by PF. The goal is to work out the constrained projection map PC, which, like PF, also satisfies

[math]\displaystyle{ \displaystyle \begin{align} VP_{\rm C} &= V \\ P_{\rm C}M &= O \end{align} }[/math]

in addition to

[math]\displaystyle{ \displaystyle P_{\rm C} M_I = M_I }[/math]

For an arbitrary projection map P of the same temperament, notice

[math]\displaystyle{ \displaystyle P_{\rm F} = P^+ P }[/math]

so if we substitute PC for P, we have

[math]\displaystyle{ \displaystyle P_{\rm F} = P_{\rm C}^+P_{\rm C} }[/math]

and

[math]\displaystyle{ \displaystyle P_{\rm C}^+ M_I = P_{\rm C}^+P_{\rm C} M_I = P_{\rm F} M_I }[/math]

Since PMI is the tuning of MI in terms of monzos, which is just the slice of the first r columns of P in this case, it follows that P +
C
 
and PF share the first r columns.

With the first r rows and columns removed, the remaining part in the mapping is another invariant of the temperament, which will be dubbed the minor matrix, denoted VM. We observe that the minor matrix of the projection map

[math]\displaystyle{ \displaystyle P_{\rm M} = V_{\rm M}^+ V_{\rm M} }[/math]

forms an orthogonal projection map filling the bottom-right section of PC+, and the top-right section comprises only zeros.

Therefore, in general, if MI is the first r elements of the subgroup basis, then PC is of the form

[math]\displaystyle{ \displaystyle P_{\rm C} = \begin{bmatrix} V^+VM_I & \begin{matrix} O \\ V_{\rm M}^+V_{\rm M} \end{matrix} \end{bmatrix}^+ }[/math]

Otherwise normed tuning

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{ \displaystyle \begin{align} V_X &= VX \\ (M_I)_X &= X^+ M_I \end{align} }[/math]

Working from here, we find the weight–skew transformed projection map (PC)X:

[math]\displaystyle{ \displaystyle (P_{\rm C})_X = \begin{bmatrix} V_X^+ V_X (M_I)_X & \begin{matrix} O \\ (V_X)_{\rm M}^+ (V_X)_{\rm M} \end{matrix} \end{bmatrix}^+ }[/math]

To reconstruct the original projection map, apply

[math]\displaystyle{ \displaystyle P_{\rm C} = X (P_{\rm C})_X X^+ }[/math]

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 basis matrix S is formed by the constraint and its orthonormal complement.

[math]\displaystyle{ \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

[math]\displaystyle{ \displaystyle M_I = \begin{bmatrix} 1 & 0 \\ 0 & -1 \\ 0 & 1 \\ 0 & 0 \end{bmatrix}, M_I^\perp = \begin{bmatrix} 0 & 0 \\ 1/\sqrt{2} & 0 \\ 1/\sqrt{2} & 0 \\ 0 & 1 \end{bmatrix}, S = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & -1 & 1/\sqrt{2} & 0 \\ 0 & 1 & 1/\sqrt{2} & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix} }[/math]

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

[math]\displaystyle{ \displaystyle \begin{align} V_S &= VS \\ (M_I)_S &= S^{-1}M_I \end{align} }[/math]

Proceed as before. The projection map found this way will be in the working basis. To reconstruct the original projection map, apply

[math]\displaystyle{ \displaystyle P_{\rm C} = S (P_{\rm C})_S S^{-1} }[/math]

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

[math]\displaystyle{ \displaystyle \begin{align} V_X &= VX \\ (M_I)_X &= X^+ M_I \end{align} }[/math]

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

[math]\displaystyle{ \displaystyle S = [\begin{matrix} M_I & M_I^\perp \end{matrix}] }[/math]

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{ \displaystyle \begin{align} V_{XS} &= VXS \\ (M_I)_{XS} &= (XS)^+ M_I \end{align} }[/math]

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{ \displaystyle P_{\rm C} = XS (P_{\rm C})_{XS} (XS)^+ }[/math]

Example

Let us try tuning septimal meantone to CEE.

Its mapping is

[math]\displaystyle{ \displaystyle V = \begin{bmatrix} 1 & 0 & -4 & -13 \\ 0 & 1 & 4 & 10 \end{bmatrix} }[/math]

The projection map is

[math]\displaystyle{ \displaystyle \begin{align} P &= V^+V \\ &= \frac{1}{446} \begin{bmatrix} 117 & 146 & 116 & -61 \\ 146 & 186 & 160 & -38 \\ 116 & 160 & 176 & 92 \\ -61 & -38 & 92 & 413 \end{bmatrix} \end{align} }[/math]

The minor matrix of the mapping is

[math]\displaystyle{ \displaystyle V_{\rm M} = \begin{bmatrix} 1 & 4 & 10\end{bmatrix} }[/math]

and the minor matrix of the projection map is

[math]\displaystyle{ \displaystyle \begin{align} P_{\rm M} &= V_{\rm M}^+V_{\rm M} \\ &= \frac{1}{117} \begin{bmatrix} 1 & 4 & 10 \\ 4 & 16 & 40 \\ 10 & 40 & 100 \end{bmatrix} \end{align} }[/math]

The pseudoinverse of the CEE projection map can be composed as

[math]\displaystyle{ \displaystyle P_{\rm C}^+ = \begin{bmatrix} 117/446 & 0 & 0 & 0 \\ 146/446 & 1/117 & 4/117 & 10/117 \\ 116/446 & 4/117 & 16/117 & 40/117 \\ -61/446 & 10/117 & 40/117 & 100/117 \end{bmatrix} }[/math]

Hence,

[math]\displaystyle{ \displaystyle P_{\rm C} = \frac{1}{117} \begin{bmatrix} 117 & 146 & 116 & -61 \\ 0 & 1 & 4 & 10 \\ 0 & 4 & 16 & 40 \\ 0 & 10 & 40 & 100 \end{bmatrix} }[/math]

The tuning map TC is

[math]\displaystyle{ \displaystyle \begin{align} T_{\rm C} &= JP_{\rm C} \\ &= \langle \begin{matrix} 1200 & 1896.8843 & 2787.5374 & 3368.8435 \end{matrix} ] \end{align} }[/math]

Notes