Math 2.0

Group theory and generalizations Definition

Polycyclic group

Builds on Subnormal seriesCyclic groupFinitely generated group

Definition

Let GG be a group. The group GG is polycyclic when it has a subnormal series {e}=G0⊴G1⊴⋯⊴Gn=G\{e\} = G_0 \trianglelefteq G_1 \trianglelefteq \cdots \trianglelefteq G_n = G in which each factor Gi/Gi−1G_i/G_{i-1} is cyclic.

Remarks

Equivalently, GG is solvable and every subgroup of GG is finitely generated. The number of infinite cyclic factors does not depend on the series; it is the Hirsch length of GG. Example: ℤ2\Z^2 is polycyclic, with the series 0≤ℤ×0≤ℤ20 \le \Z \times 0 \le \Z^2 whose factors are both isomorphic to ℤ\Z; its Hirsch length is 22. Non-example: the additive group ℚ\Q is abelian, hence solvable, but it is not polycyclic. A polycyclic group is generated by lifts of generators of its factors, so it is finitely generated, while ℚ\Q is not finitely generated. Every finite solvable group is polycyclic, and every supersolvable group is polycyclic.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cyclic group concept
  2. Finitely generated group concept
  3. Subnormal series concept
  4. Polycyclic group definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Polycyclic_group
About this page
TagJNB1VM75XP
URIm2://JNB1VM75XP
Kinddefinition
WritingW0 stub
MSC20F16, 20F05
DefinesPolycyclic group
UsesSubnormal series, Cyclic group, Finitely generated group
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.