Matrix echelon forms: Difference between revisions
Cmloegcmluin (talk | contribs) →cases temperaments can be regarding which of their mapping forms equal each other: fix section capitalization |
Cmloegcmluin (talk | contribs) unhyphenate "comma basis" |
||
| Line 84: | Line 84: | ||
== IRREF == | == IRREF == | ||
'''[[Normal_lists|Integer Reduced Row Echelon Form]]''', or '''IRREF''': based on the name, one might expect this form to be a combination of the constraints for RREF and IREF, and therefore if represented in an [https://en.wikipedia.org/wiki/Euler_diagram Euler diagram] (generalization of Venn diagram) would only exist within their intersection. However this is not the case. That's because the IRREF does not include the key constraint of RREF which is that all of the pivots must be 1. IRREF is produced by simply taking the unique RREF and multiplying each row by whatever minimum value is necessary to make all of the entries integers<ref>Alternatively, IRREF can be computed by finding the null-space of a mapping, or in other words, the corresponding [[comma | '''[[Normal_lists|Integer Reduced Row Echelon Form]]''', or '''IRREF''': based on the name, one might expect this form to be a combination of the constraints for RREF and IREF, and therefore if represented in an [https://en.wikipedia.org/wiki/Euler_diagram Euler diagram] (generalization of Venn diagram) would only exist within their intersection. However this is not the case. That's because the IRREF does not include the key constraint of RREF which is that all of the pivots must be 1. IRREF is produced by simply taking the unique RREF and multiplying each row by whatever minimum value is necessary to make all of the entries integers<ref>Alternatively, IRREF can be computed by finding the null-space of a mapping, or in other words, the corresponding [[comma basis]] for the temperament represented by the mapping, and then in turn taking the null-space of the comma basis to get back to an equivalent mapping. The relationship between the process for finding the IRREF from the RREF and this process is not proven, but thousands of automated tests run as an experiment strongly suggest that these two techniques are equivalent.<br> | ||
<span style="font-family: monospace; font-size: 10px;"><br> | <span style="font-family: monospace; font-size: 10px;"><br> | ||
rref[m_] := RowReduce[m]<br> | rref[m_] := RowReduce[m]<br> | ||