Cohomology tree probability distribution: Difference between revisions
(→Notes) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 15: | Line 15: | ||
Denote by <math>C</math> the cyclic group of order <math>p</math>. | Denote by <math>C</math> the cyclic group of order <math>p</math>. | ||
For any group <math>G</math> of order <math>p^{n-1}</math>, the elements of the [[second cohomology group for trivial group action]] <math>H^2(G | For any group <math>G</math> of order <math>p^{n-1}</math>, the elements of the [[second cohomology group for trivial group action]] <math>H^2(G, C)</math> correspond to extensions with central subgroup <math>C</math> and quotient group <math>G</math>. Each of these extensions is therefore a group of order <math>p^n</math>. For each element of <math>H^2(G, C)</math>, give the isomorphism class (as a group of order <math>p^n</math>) of the corresponding group extension, a weight that equals the probability distribution weight of <math>G</math> divided by the size of <math>H^2(G, C)</math>. | ||
Now, sum up these weights as <math>G</math> varies over all isomorphism classes of groups of order <math>p^{n-1}</math>. This gives the cohomology tree probability distribution for isomorphism classes of groups of order<math>p^n</math>. | Now, sum up these weights as <math>G</math> varies over all isomorphism classes of groups of order <math>p^{n-1}</math>. This gives the cohomology tree probability distribution for isomorphism classes of groups of order<math>p^n</math>. | ||
| Line 23: | Line 23: | ||
* [[Prime power order implies not centerless]] can be used to show that every group of order <math>p^n</math> has a positive weight. Specifically, the center is nontrivial, so it has a subgroup of prime order, and the whole group can be obtained as an extension with normal subgroup as this group of prime order, and quotient of order <math>p^{n-1}</math>. | * [[Prime power order implies not centerless]] can be used to show that every group of order <math>p^n</math> has a positive weight. Specifically, the center is nontrivial, so it has a subgroup of prime order, and the whole group can be obtained as an extension with normal subgroup as this group of prime order, and quotient of order <math>p^{n-1}</math>. | ||
* The term "cohomology tree" refers to the idea that this process of generating extensions can be depicted using a tree, whose root is the group of order <math>p</math>, the next layer is the groups of order <math>p^2</math>, and so on. Each layer of the tree is groups of order <math>p^n</math> for some <math>n</math>. Each node of the tree can be assigned a numeric value which is its weight in its probability distribution; the sum of the numeric values in each layer is 1. The value for a given node is the sum of the values of all its children. | * The term "cohomology tree" refers to the idea that this process of generating extensions can be depicted using a tree, whose root is the group of order <math>p</math>, the next layer is the groups of order <math>p^2</math>, and so on. Each layer of the tree is groups of order <math>p^n</math> for some <math>n</math>. Each node of the tree can be assigned a numeric value which is its weight in its probability distribution; the sum of the numeric values in each layer is 1. The value for a given node is the sum of the values of all its children. | ||
* Note that in the above tree, a single isomorphism class of groups of order <math>p^n</math> may appear as multiple nodes, based on different ways of building the group (through different choices of series of subgroups with each successive quotient of order <math>p</math>). If we were to collapse all nodes that are isomorphic groups, the graph would no longer be a tree. If we gave the edges direction (going from the group of order <math>p^{n-1}</math> to the group of order <math>p^n</math>) then we would get a "graded graph" -- a directed acyclic graph rooted at the group of order <math>p</math> where the distance from the root to any isomorphism class of groups of order <math>p^n</math> is <math>n - 1</math>, though there could be multiple such paths. | |||
==Worked example for groups of prime-square order== | ==Worked example for groups of prime-square order== | ||
| Line 32: | Line 33: | ||
Since there's only one group of order <math>p</math>, namely <math>C</math>, the cohomology tree probability distribution for order <math>p^2</math> is just based on the distribution of isomorphism classes of groups corresponding to the [[second cohomology group for trivial group action]] <math>H^2(C, C)</math>. | Since there's only one group of order <math>p</math>, namely <math>C</math>, the cohomology tree probability distribution for order <math>p^2</math> is just based on the distribution of isomorphism classes of groups corresponding to the [[second cohomology group for trivial group action]] <math>H^2(C, C)</math>. | ||
This cohomology group is worked out at [[second cohomology group for trivial group action of group of prime order on group of prime order]]. The group <math>H^2(C | This cohomology group is worked out at [[second cohomology group for trivial group action of group of prime order on group of prime order]]. The group <math>H^2(C, C)</math> has order <math>p</math>, with the identity element corresponding to the extension that is the elementary abelian group of order <math>p^2</math>, and the remaining <math>p - 1</math> non-identity elements corresponding to the extension that is the cyclic group of order <math>p^2</math>. | ||
The cohomology tree probability distribution therefore works out to the following: | The cohomology tree probability distribution therefore works out to the following: | ||
Latest revision as of 19:40, 10 January 2026
BEWARE! This term is nonstandard and is being used locally within the wiki. [SHOW MORE]
Definition
Let be a prime number and be a positive integer. The cohomology tree probability distribution is a probability distribution on the set of isomorphism classes of groups of order defined inductively as follows.
Base case of inductive definition: definition for prime order (n = 1)
There is only one group of order , namely the cyclic group (see group of prime order). Therefore there is only one allowed probability distribution, that assigns a weight of 1 to this unique group.
Induction step: probability distribution for groups of order p^n based on probability distribution for groups of order p^{n - 1} for n > 1
Conceptually, the induction step is essentially a convolution product with the convolution process being the use of the second cohomology group for the trivial action of groups of order on the group of order , to define group extensions. Let's go over this more specifically.
Denote by the cyclic group of order .
For any group of order , the elements of the second cohomology group for trivial group action correspond to extensions with central subgroup and quotient group . Each of these extensions is therefore a group of order . For each element of , give the isomorphism class (as a group of order ) of the corresponding group extension, a weight that equals the probability distribution weight of divided by the size of .
Now, sum up these weights as varies over all isomorphism classes of groups of order . This gives the cohomology tree probability distribution for isomorphism classes of groups of order.
Notes
- Prime power order implies not centerless can be used to show that every group of order has a positive weight. Specifically, the center is nontrivial, so it has a subgroup of prime order, and the whole group can be obtained as an extension with normal subgroup as this group of prime order, and quotient of order .
- The term "cohomology tree" refers to the idea that this process of generating extensions can be depicted using a tree, whose root is the group of order , the next layer is the groups of order , and so on. Each layer of the tree is groups of order for some . Each node of the tree can be assigned a numeric value which is its weight in its probability distribution; the sum of the numeric values in each layer is 1. The value for a given node is the sum of the values of all its children.
- Note that in the above tree, a single isomorphism class of groups of order may appear as multiple nodes, based on different ways of building the group (through different choices of series of subgroups with each successive quotient of order ). If we were to collapse all nodes that are isomorphic groups, the graph would no longer be a tree. If we gave the edges direction (going from the group of order to the group of order ) then we would get a "graded graph" -- a directed acyclic graph rooted at the group of order where the distance from the root to any isomorphism class of groups of order is , though there could be multiple such paths.
Worked example for groups of prime-square order
Let's work out the cohomology tree probability distribution for groups of prime-square order, i.e., groups of order where is a prime number.
Denote by the cyclic group of order .
Since there's only one group of order , namely , the cohomology tree probability distribution for order is just based on the distribution of isomorphism classes of groups corresponding to the second cohomology group for trivial group action .
This cohomology group is worked out at second cohomology group for trivial group action of group of prime order on group of prime order. The group has order , with the identity element corresponding to the extension that is the elementary abelian group of order , and the remaining non-identity elements corresponding to the extension that is the cyclic group of order .
The cohomology tree probability distribution therefore works out to the following:
- Cyclic group of order : This appears out of times, so it gets weight or equivalently .
- Elementary abelian group of order : This appears 1 out of times, so it gets weight .
Sketch of worked example for groups of order 8
Let's work out the cohomology tree probability distribution for groups of order 8.
For groups of order 4, we have, per the above distribution for groups of prime-square order, that cyclic group:Z4 and Klein four-group (the elementary abelian group of order 4) both have weight 1/2.
To get the probability distribution for groups of order 8, we need to look at two cohomology groups.
Second cohomology group for trivial group action of cyclic group of order 4 on cyclic group of order 2
This is covered in second cohomology group for trivial group action of Z4 on Z2. The cyclic group of order 4 itself has weight 1/2 in the cohomology tree probability distribution on groups of order 4, so the weights need to be multiplied by 1/2.
The result is that the second cohomology group is cyclic of order two, and produces two isomorphism classes:
- Direct product of Z4 and Z2 occurs once, as the identity element, so it gets weight 1/2 times 1/2 = 1/4.
- Cyclic group:Z8 occurs once, as the non-identity element, so it gets weight 1/2 times 1/2 = 1/4.
Second cohomology group for trivial group action of Klein four-group on cyclic group of order 2
This is covered in second cohomology group for trivial group action of V4 on Z2. The Klein four-group itself has weight 1/2 in the cohomology tree probability distribution on groups of order 4, so the weights need to be multiplied by 1/2.
The result is that the second cohomology group is cyclic of order 8, and produces four isomorphism classes:
- Elementary abelian group:E8 occurs once, as the identity element, so it gets weight 1/2 times 1/8 = 1/16.
- Direct product of Z4 and Z2 occurs 3 times, so it gets weight 1/2 times 3/8 = 3/16.
- Dihedral group:D8 occurs 3 times, so it gets weight 1/2 times 3/8 = 3/16.
- Quaternion group occurs once, so it gest weight 1/2 times 1/8 = 1/16.
Summing up
- Cyclic group:Z8 is in only the first list, with a total weight of 1/4.
- Direct product of Z4 and Z2 is in both lists, with weights of 1/4 and 3/16, totaling to 7/16.
- Dihedral group:D8 is in only the second list, with a total weight of 3/16.
- Quaternion group is in only the second list, with a total weight of 1/16.
- Elementary abelian group:E8 is in only the second list, with a total weight of 1/16.
We can verify that these weights add up to 1, confirming that we have obtained a probability distribution on the groups of order 8.