Mathematical theory of saturation: Difference between revisions
Cmloegcmluin (talk | contribs) No edit summary |
Cmloegcmluin (talk | contribs) fix bad vector and map templates |
||
| Line 7: | Line 7: | ||
Because unsaturated subgroups of <span><math>\mathbb{Z}^n</math></span> are for these reasons problematic, it is useful to have a means to saturate them; that is, to find the minimal saturated subgroup of <span><math>\mathbb{Z}^n</math></span> containing the given subgroup. We may do this by inverting the right-reducing matrix which in part converts a matrix of basis elements for the subgroup <span><math>V</math></span> to [http://en.wikipedia.org/wiki/Smith_normal_form Smith normal form]. If <span><math>A</math></span> is a matrix with <span><math>r</math></span> (the rank) rows of dimension <span><math>n</math></span> whose rows form a basis for <span><math>V</math></span>, then there are two square matrices <span><math>L</math></span> and <span><math>R</math></span>, such that <span><math>S = LAR</math></span>, where <span><math>S</math></span> is the Smith normal form. The right-reducing matrix is <span><math>R</math></span>, the matrix multiplying <span><math>A</math></span> on the right. The first <span><math>r</math></span> rows of <span><math>R</math></span> generate the saturation of <span><math>V</math></span>. This procedure is only useful if there is a routine for finding the Smith normal form available, so we will assume there is one and not concern ourselves with the Smith form as such. | Because unsaturated subgroups of <span><math>\mathbb{Z}^n</math></span> are for these reasons problematic, it is useful to have a means to saturate them; that is, to find the minimal saturated subgroup of <span><math>\mathbb{Z}^n</math></span> containing the given subgroup. We may do this by inverting the right-reducing matrix which in part converts a matrix of basis elements for the subgroup <span><math>V</math></span> to [http://en.wikipedia.org/wiki/Smith_normal_form Smith normal form]. If <span><math>A</math></span> is a matrix with <span><math>r</math></span> (the rank) rows of dimension <span><math>n</math></span> whose rows form a basis for <span><math>V</math></span>, then there are two square matrices <span><math>L</math></span> and <span><math>R</math></span>, such that <span><math>S = LAR</math></span>, where <span><math>S</math></span> is the Smith normal form. The right-reducing matrix is <span><math>R</math></span>, the matrix multiplying <span><math>A</math></span> on the right. The first <span><math>r</math></span> rows of <span><math>R</math></span> generate the saturation of <span><math>V</math></span>. This procedure is only useful if there is a routine for finding the Smith normal form available, so we will assume there is one and not concern ourselves with the Smith form as such. | ||
To give an example, consider the matrix {{ | To give an example, consider the matrix {{ket|{{map|12 19 28 34}} {{map|26 41 60 72}}}} whose rows are the two vals we considered above. The Smith form itself is the 2×4 matrix {{ket|{{map|1 0 0 0}} {{map|0 2 0 0}}}}; this does not concern us. The left-reducing matrix does not concern us either; our interest lies in the right reducing matrix, which is an invertible square integral matrix, {{ket|{{map|-11 19 4 13}} {{map|7 -12 -4 -10}} {{map|0 0 1 0}} {{map|0 0 0 1}}}}. Inverting this matrix gives another square integral matrix, {{ket|{{map|12 19 28 34}} {{map|7 11 16 19}} {{map|0 0 1 0}} {{map|0 0 0 1}}}}. The rank of <span><math>V</math></span> is two, so to find a basis for the saturation of <span><math>V</math></span>, we take the first two rows, which gives us the group generated by {{ket|{{map|12 19 28 34}} {{map|7 11 16 19}}}}. The [[Normal_lists|normal val list]] for this is {{ket|{{map|1 0 -4 -13}} {{map|0 1 4 10}}}}, which are period and generator maps for septimal meantone, which is the saturated temperament corresponding to the contorted <span><math>V</math></span>. | ||
To test for saturation, we may take the wedge product of the generators. Wedging {{map|26 41 60 72}} with {{map|12 19 28 34}} gives us {{multimap|2 8 20 8 26 24}}; this is not zero, so the rank of the group these generate is two. However the coefficients have a gcd of two, and hence the group is not saturated; for saturation, the coefficients must be relatively prime, with a gcd of one. | To test for saturation, we may take the wedge product of the generators. Wedging {{map|26 41 60 72}} with {{map|12 19 28 34}} gives us {{multimap|2 8 20 8 26 24}}; this is not zero, so the rank of the group these generate is two. However the coefficients have a gcd of two, and hence the group is not saturated; for saturation, the coefficients must be relatively prime, with a gcd of one. | ||