Skip to main content
MathOverflow

Return to Answer

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link
Community Bot
Community Bot
  • 1
  • 2
  • 3

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

This is a special case of the class of Noetherian groups, also known as slender groups, in which are defined by having the property that every subgroup is finitely generated. You can find some more information on this subject in this MO questionthis MO question.

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

This is a special case of the class of Noetherian groups, also known as slender groups, in which are defined by having the property that every subgroup is finitely generated. You can find some more information on this subject in this MO question.

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

This is a special case of the class of Noetherian groups, also known as slender groups, in which are defined by having the property that every subgroup is finitely generated. You can find some more information on this subject in this MO question.

added 373 characters in body
Source Link
Max Horn
Max Horn
  • 5.7k
  • 3
  • 33
  • 50

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

This is a special case of the class of Noetherian groups, also known as slender groups, in which are defined by having the property that every subgroup is finitely generated. You can find some more information on this subject in this MO question.

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.

This is a special case of the class of Noetherian groups, also known as slender groups, in which are defined by having the property that every subgroup is finitely generated. You can find some more information on this subject in this MO question.

Source Link
Max Horn
Max Horn
  • 5.7k
  • 3
  • 33
  • 50

If $G$ is polycyclic, then every subgroup is finitely generated. In fact, one of several ways to define a polycyclic group is to demand that it is a solvable group for which all subgroups are finitely generated. So, this might seem kind of tautological, but polycyclic groups have other definitions and they come up quite a bit in various areas.