Cohomology tree probability distribution: Difference between revisions

From Groupprops
Line 22: Line 22:


* [[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.


==Worked example for groups of prime-square order==
==Worked example for groups of prime-square order==

Revision as of 03:51, 7 December 2024

BEWARE! This term is nonstandard and is being used locally within the wiki. [SHOW MORE]

Definition

Let p be a prime number and n be a positive integer. The cohomology tree probability distribution is a probability distribution on the set of isomorphism classes of groups of order pn defined inductively as follows.

Base case of inductive definition: definition for prime order (n = 1)

There is only one group of order p, 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 pn1 on the group of order p, to define group extensions. Let's go over this more specifically.

Denote by C the cyclic group of order p.

For any group G of order pn1, the elements of the second cohomology group for trivial group action H2(G;C) correspond to extensions with central subgroup C and quotient group G. Each of these extensions is therefore a group of order pn. For each element of H2(G;C), give the isomorphism class (as a group of order pn) of the corresponding group extension, a weight that equals the probability distribution weight of G divided by the size of H2(G;C).

Now, sum up these weights as G varies over all isomorphism classes of groups of order pn, to get a probability distribution for isomorphism classes of groups of orderpn.

Notes

  • Prime power order implies not centerless can be used to show that every group of order pn 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 pn1.
  • 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 p, the next layer is the groups of order p2, and so on. Each layer of the tree is groups of order pn for some n. 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.

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 p2 where p is a prime number.

Denote by C the cyclic group of order p.

Since there's only one group of order p, namely C, the cohomology tree probability distribution for order p2 is just based on the distribution of isomorphism classes of groups corresponding to the second cohomology group for trivial group action H2(C,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 H2(C;C) has order p, with the identity element corresponding to the extension that is the elementary abelian group of order p2, and the remaining p1 non-identity elements corresponding to the extension that is the cyclic group of order p2.

The cohomology tree probability distribution therefore works out to the following:

  • Cyclic group of order p2: This appears p1 out of p times, so it gets weight (p1)/p or equivalently 11/p.
  • Elementary abelian group of order p2: This appears 1 out of p times, so it gets weight 1/p.

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:

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:

Summing up

We can verify that these weights add up to 1, confirming that we have obtained a probability distribution on the groups of order 8.