Meet and join: Difference between revisions

Lériendil (talk | contribs)
deploying new cat
m Markup
 
(5 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{Legacy|Meet_and_join}}
{{Expert|Temperament merging}}
 
Meet and join are a pair of binary operations which combine two [[abstract regular temperament]]s on a JI group G into another temperament on G. The operations are commutative and associative. More concretely, for any of the standard ways of representing an abstract regular temperament (normal val lists, normal comma lists, wedgies, Frobenius projection maps, and reduced row echelon form) we can regard them as taking any pair of such defined on G and producing another also defined on G.
Meet and join are a pair of binary operations which combine two [[abstract regular temperament]]s on a JI group G into another temperament on G. The operations are commutative and associative. More concretely, for any of the standard ways of representing an abstract regular temperament (normal val lists, normal comma lists, wedgies, Frobenius projection maps, and reduced row echelon form) we can regard them as taking any pair of such defined on G and producing another also defined on G.


Line 8: Line 9:
__TOC__
__TOC__


== Mathematical Preliminaries: Join and Meet of Subgroups ==
== Mathematical preliminaries: join and meet of subgroups ==
In general, given some group G, the subgroups of G form an order-theoretic structure called a [https://en.wikipedia.org/wiki/Lattice_of_subgroups lattice of subgroups], where here "lattice" means [https://en.wikipedia.org/wiki/Lattice_(order) lattice in the order theory sense]; "trellis" in French, "Verband" in German. A lattice is a partially ordered set in which for two subgroups A and B of group G, we have A ≤ B iff A is itself a subgroup of B.
In general, given some group G, the subgroups of G form an order-theoretic structure called a [https://en.wikipedia.org/wiki/Lattice_of_subgroups lattice of subgroups], where here "lattice" means [https://en.wikipedia.org/wiki/Lattice_(order) lattice in the order theory sense]; "treillis" in French, "Verband" in German. A lattice is a partially ordered set in which for two subgroups A and B of group G, we have A ≤ B iff A is itself a subgroup of B.


Given two subgroups A and B, the '''join''' of A and B is the smallest subgroup of G containing both; this is sometimes also called the '''subgroup generated by A and B.''' The '''meet''' of A and B is the intersection of both.
Given two subgroups A and B, the '''join''' of A and B is the smallest subgroup of G containing both; this is sometimes also called the '''subgroup generated by A and B.''' The '''meet''' of A and B is the intersection of both.
Line 15: Line 16:
Note that in this definition, it doesn't matter what kind of group G is - it could represent musical intervals, or vals, or anything (it need not even be abelian). When working with temperaments, we have at least two relevant groups - the group of vanishing commas, and the group of supporting vals - both of which have a relevant lattice of subgroups. As we will see, we will get two different notions of meet and join based on which one we'd like to do.
Note that in this definition, it doesn't matter what kind of group G is - it could represent musical intervals, or vals, or anything (it need not even be abelian). When working with temperaments, we have at least two relevant groups - the group of vanishing commas, and the group of supporting vals - both of which have a relevant lattice of subgroups. As we will see, we will get two different notions of meet and join based on which one we'd like to do.


== Intra-Subgroup Temperament Meet and Join ==
== Intra-subgroup temperament meet and join ==


Given some JI group G and dual group of vals G^, each temperament of G can be defined either as a subgroup of supporting vals within G^, or a subgroup of vanishing commas within G, also called a kernel. We will get two different notions of "meet" and "join" depending on if we are joining the kernels or the supporting vals. These are basically identical except the meaning is swapped; a join of vals is equal to a meet of kernels and so on.
Given some JI group G and dual group of vals G^, each temperament of G can be defined either as a subgroup of supporting vals within G^, or a subgroup of vanishing commas within G, also called a kernel. We will get two different notions of "meet" and "join" depending on if we are joining the kernels or the supporting vals. These are basically identical except the meaning is swapped; a join of vals is equal to a meet of kernels and so on.
Line 27: Line 28:
This definition assumes both A and B have no torsion or contorsion, and that torsion/contorsion is removed after taking the meet/join; otherwise the definition is more complicated.
This definition assumes both A and B have no torsion or contorsion, and that torsion/contorsion is removed after taking the meet/join; otherwise the definition is more complicated.


== Inter-Subgroup Temperament Meet and Join ==
== Inter-subgroup temperament meet and join ==


If A and B are two temperaments on different subgroups, then there are similarly two natural operations that we can use to combine them: informally, we can look for the "largest" temperament supported by both, and the "smallest" temperament that supports both, in a sense to be made precise below.
If A and B are two temperaments on different subgroups, then there are similarly two natural operations that we can use to combine them: informally, we can look for the "largest" temperament supported by both, and the "smallest" temperament that supports both, in a sense to be made precise below.
Line 37: Line 38:
These definitions assume that both A and B have no torsion or contorsion and that such things are removed after either type of join or meet; if one desires to keep torsion and contorsion the definitions get much more complicated.
These definitions assume that both A and B have no torsion or contorsion and that such things are removed after either type of join or meet; if one desires to keep torsion and contorsion the definitions get much more complicated.


== Poset Properties ==
== Poset properties ==
The operations of join and meet give the set of temperaments the structure of a partially ordered set, sometimes called a [[Wikipedia:Partially_ordered_set|poset]].
The operations of join and meet give the set of temperaments the structure of a partially ordered set, sometimes called a [[Wikipedia:Partially_ordered_set|poset]].


=== Same Subgroup ===
=== Same subgroup ===
Given that the set of temperaments of some subgroup G forms an order-theoretic lattice, we can look at the resulting poset and derive some interesting related ideas.
Given that the set of temperaments of some subgroup G forms an order-theoretic lattice, we can look at the resulting poset and derive some interesting related ideas.


Line 47: Line 48:
There is a partial order on the temperaments of G, given by A ≤ B iff A & B = A, or equivalently, A ≤ B iff A | B = B. Since A & G = G, G is the minimal temperament - it is JI and tempers out no commas. Similarly, if we denote G/G as the "rank-0" temperament of G in which ''everything'' is tempered out, we have that A | G/G = G/G, thus G/G is the maximal temperament.  
There is a partial order on the temperaments of G, given by A ≤ B iff A & B = A, or equivalently, A ≤ B iff A | B = B. Since A & G = G, G is the minimal temperament - it is JI and tempers out no commas. Similarly, if we denote G/G as the "rank-0" temperament of G in which ''everything'' is tempered out, we have that A | G/G = G/G, thus G/G is the maximal temperament.  


A ≤ B may be expressed by "A is supported by B", in the sense that every comma tempered out by A is also tempered out by B, thus all of the [[essentially tempered chords]] and [[comma pumps]] from temperament A are also playable in B.
A ≤ B may be expressed by "A is supported by B", in the sense that every comma tempered out by A is also tempered out by B, thus all of the [[essentially tempered chord]]s and [[comma pump]]s from temperament A are also playable in B.


If we had gone with the other convention for meet and join, we would have gotten the same result, except this would be flipped: G would now be the maximal temperament and G/G the minimal.
If we had gone with the other convention for meet and join, we would have gotten the same result, except this would be flipped: G would now be the maximal temperament and G/G the minimal.
Line 53: Line 54:
In the temperament defined by G, nothing is tempered out, and we may also call it '''JI'''; and in the temperament defined by G/G, everything is tempered out, and we may also call it [[Trivial temperament|'''OM'''<sub>G</sub>]].  
In the temperament defined by G, nothing is tempered out, and we may also call it '''JI'''; and in the temperament defined by G/G, everything is tempered out, and we may also call it [[Trivial temperament|'''OM'''<sub>G</sub>]].  


=== Different Subgroups ===
=== Different subgroups ===
The set of subgroup temperaments also, similarly, forms a lattice, from which we can derive the same basic poset operation above. Again, we have that if A ≤ B iff A & B = A, or equivalently, A ≤ B iff A | B = B. But now, the minimal subgroup temperament is the "trivial subgroup temperament" which has no intervals except for 1/1 and tempers out nothing; we may simply call this subgroup &lt;'''1'''&gt;. For all subgroup temperaments, we have that A & &lt;'''1'''&gt; = &lt;'''1'''&gt;. Similarly, the maximal temperament is Q/Q, meaning the subgroup temperament formed by taking infinite-limit JI and tempering the entire thing out; we may call this '''OM'''.
The set of subgroup temperaments also, similarly, forms a lattice, from which we can derive the same basic poset operation above. Again, we have that if A ≤ B iff A & B = A, or equivalently, A ≤ B iff A | B = B. But now, the minimal subgroup temperament is the "trivial subgroup temperament" which has no intervals except for 1/1 and tempers out nothing; we may simply call this subgroup &lt;'''1'''&gt;. For all subgroup temperaments, we have that A & &lt;'''1'''&gt; = &lt;'''1'''&gt;. Similarly, the maximal temperament is Q/Q, meaning the subgroup temperament formed by taking infinite-limit JI and tempering the entire thing out; we may call this '''OM'''.


Similarly, if we had gone with the val-join instead of kernel-join, we would have gotten the same result, except the minimal and maximal temperaments would be flipped.
Similarly, if we had gone with the val-join instead of kernel-join, we would have gotten the same result, except the minimal and maximal temperaments would be flipped.


== A Note on Terminology ==
== A note on terminology ==
Originally, the "meet" and "join" of two temperaments was proposed [https://yahootuninggroupsultimatebackup.github.io/tuning-math/topicId_19399.html on the tuning-math list] by Keenan Pepper, who used the terms "meet" and "join" to refer to what is above called the "val-meet" and "val-join," along with the caveat that it doesn't really matter which you call meet or join.
Originally, the "meet" and "join" of two temperaments was proposed [https://yahootuninggroupsultimatebackup.github.io/tuning-math/topicId_19399.html on the tuning-math list] by Keenan Pepper, who used the terms "meet" and "join" to refer to what is above called the "val-meet" and "val-join," along with the caveat that it doesn't really matter which you call meet or join.