Lattice of subgroups
Summary
The subgroups of a group , ordered by inclusion, form a complete lattice. The meet of a family of subgroups is their intersection, and the join is the subgroup generated by their union. The least element is the trivial subgroup and the greatest element is .
Remarks
For two subgroups and , the meet is and the join is . The lattice of subgroups of is the set of the subgroups , and exactly when divides . The lattice of normal subgroups of a group is a modular lattice.
Explanations
L1 human
You can draw the subgroups of a small group as a diagram, with a line from each subgroup up to each next bigger subgroup. This diagram shows the lattice of subgroups. Two subgroups always have a largest common subgroup below them and a smallest subgroup above them.
What this node needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Subgroup definition
- Subgroup criterion statement
- Intersection of subgroups is a subgroup statement
- Subgroup generated by a subset definition
- Lattice of subgroups concept
What depends on this
4 nodes use this node, directly or through other nodes.
- A finite group is nilpotent iff it is the product of its Sylow subgroups 00Y9N80VSS
- Finite p-groups are nilpotent 081WTKYX6C
- Upper central series 0DJ9Y9V610
- Correspondence theorem 0S9ZVZ34MD
Sources
What links here
Used by
- Correspondence theorem 0S9ZVZ34MD