I've been searching around for a while now and can't seem to find a clear explanation of what a subgroup lattice of a group actually is. I see the vertex set is given by the subgroups of the group, but how is the edge set related? My guess is that vertices are connected if one is a subset of the other - for example a subgroup containing just the identity would be connected to everything.
2026-04-01 16:40:24.1775061624
Subgroup lattice
229 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
Related Questions in GROUP-THEORY
- What is the intersection of the vertices of a face of a simplicial complex?
- Group with order $pq$ has subgroups of order $p$ and $q$
- How to construct a group whose "size" grows between polynomially and exponentially.
- Conjugacy class formula
- $G$ abelian when $Z(G)$ is a proper subset of $G$?
- A group of order 189 is not simple
- Minimal dimension needed for linearization of group action
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- subgroups that contain a normal subgroup is also normal
- Could anyone give an **example** that a problem that can be solved by creating a new group?
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in LATTICE-ORDERS
- When a lattice is a lattice of open sets of some topological space?
- How to identify if a given Hasse diagram is a lattice
- How to find the smallest cardinal of a minimal generating set of a lattice
- Finding a poset with a homogeneity property
- Why is the "distributive lattice" structure of domino tilings significant?
- Two lattice identities
- Quickly determining whether given lattice is a distributive lattice from a given Hasse diagram
- Characteristic of a lattice that subsets contain their meets and joins
- Equalities in Heyting algebras
- Show that $(\operatorname{Up}(P),\subset)$ is a distributive lattice
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
A lattice is a partially ordered set in which every two element has a least upper and a greatest lower bound (these are the lattice operations).
The elements of the subgroup lattice of a group are indeed the subgroups, and the partial order is defined by containment, so if you want to depict it you can draw an arrow from any subgroup $H_1$ to any other subgroup $H_2$ that contains it.. (If $G$ is finite, it is enough to draw down the coverings as @JackSchmidt commented, as, by transitivity it will generate the whole lattice.)
Anyway, the greatest lower bound of subgroups $H_1,\,H_2$ is $\ H_1\cap H_2$, and their least upper bound is the subgroup $\langle H_1\cup H_2\rangle$ generated by their union.