Subgroup Lattices of Groups

Imke Toborg
Martin-Luther-Universität Halle-Wittenberg

September 2018

Summer School of the institute of Mathematics

University of Silesiain Katowice
Brenna
What are groups?
 What are groups?
Definition
Let G be a set and · : G × G → G be a binary operation.
Then (G , ·) is a group if and only if
I ∀a, b, c ∈ G : (a · b) · c = a · (b · c),
I ∃e ∈ G ∀a ∈ G : a · e = a, and
I ∀a ∈ G ∃a∗ ∈ G : a · a∗ = e.
Let’s go back in time.

Origin:
https://pixabay.com/de/zeit-portal-time-machine-reisen-2034990/
 Évariste Galois (1811 - 1832)

Origin: https:
//de.wikipedia.org/
wiki/Évariste_Galois
 Évariste Galois (1811 - 1832)
He was interested in permuting the roots
of polynomials

Origin: https:
//de.wikipedia.org/
wiki/Évariste_Galois
 Évariste Galois (1811 - 1832)
He was interested in permuting the roots
of polynomials and in sets of such permu-
tations.

Origin: https:
//de.wikipedia.org/
wiki/Évariste_Galois
 Évariste Galois (1811 - 1832)
He was interested in permuting the roots
of polynomials and in sets of such permu-
tations.

Origin: https:
//de.wikipedia.org/
wiki/Évariste_Galois

Felix Klein(1849 -1925)

Origin: https:
//de.wikipedia.org/
wiki/Felix_Klein
 Évariste Galois (1811 - 1832)
He was interested in permuting the roots
of polynomials and in sets of such permu-
tations.

Origin: https:
//de.wikipedia.org/
wiki/Évariste_Galois

Felix Klein(1849 -1925)

He studied symmetries of geometries or ge-
ometrical objects.

Origin: https:
//de.wikipedia.org/
wiki/Felix_Klein
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois

Let M be a set and G be the set of all bijective mappings from M

to M.
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois

Let M be a set and G be the set of all bijective mappings from M

to M.
Then G forms together with the composition a group .
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois

Let M be a set and G be the set of all bijective mappings from M

to M.
Then G forms together with the composition a group (identity
mapping).
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois

Let M be a set and G be the set of all bijective mappings from M

to M.
Then G forms together with the composition a group (identity
mapping, inverse mapping).
 Évariste Galois (1811 - 1832)
He was interested in permuting the
roots of polynomials and in sets of
such permutations.
Felix Klein(1849 -1925)
He studied symmetries of geome- Origin:
Origin: https: https://de.wikipedia.
//de.wikipedia.org/ tries or geometrical objects. org/wiki/Felix_Klein
wiki/Évariste_Galois

Let M be a set and G be the set of all bijective mappings from M

to M.
Then G forms together with the composition a group (identity
mapping, inverse mapping).
Nowadays: permutational group theory or geometrical group theory.
 Carl Friedrich Gauß (1777 - 1855)
.

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss
 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers .

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss
 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers
(Z/nZ).

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss
 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers
(Z/nZ).

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss

Walther von Dyck (1856 -1934)

Foto: Deutsches Museum

 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers
(Z/nZ).

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss

Walther von Dyck (1856 -1934)

He was a student of Felix Klein.

Foto: Deutsches Museum

 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers
(Z/nZ).

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss

Walther von Dyck (1856 -1934)

He was a student of Felix Klein. He studied
sets and the way multiplaction is possible.

Foto: Deutsches Museum

 Carl Friedrich Gauß (1777 - 1855)
He investigated special sets of numbers
(Z/nZ).

Origin: hhttps:
//de.wikipedia.org/wiki/
Carl_Friedrich_Gau\T1\ss

Walther von Dyck (1856 -1934)

He was a student of Felix Klein. He studied
sets and the way multiplaction is possible.

Foto: Deutsches Museum

Nowadays: arithmetical or combinatorial group theory.
Both concepts lead to the same mathematical object.
Both concepts lead to the same mathematical object.
Definition
Let G be a set and · : G × G → G be a binary operation.
Then (G , ·) is a group if and only if

I ∃e ∈ G ∀a ∈ G : a · e = a, and
I ∀a ∈ G ∃a∗ ∈ G : a · a∗ = e.
Both concepts lead to the same mathematical object.
Definition
Let G be a set and · : G × G → G be a binary operation.
Then (G , ·) is a group if and only if
I ∀a, b, c ∈ G : (a · b) · c = a · (b · c),
I ∃e ∈ G ∀a ∈ G : a · e = a, and
I ∀a ∈ G ∃a∗ ∈ G : a · a∗ = e.
Both concepts lead to the same mathematical object.
Definition
Let G be a set and · : G × G → G be a binary operation.
Then (G , ·) is a group if and only if
I ∀a, b, c ∈ G : (a · b) · c = a · (b · c),
I ∃e ∈ G ∀a ∈ G : a · e = a, and
I ∀a ∈ G ∃a∗ ∈ G : a · a∗ = e.
In the rest of the talk, we say that G is a group and denote by 1
the neutral element and by g −1 the inverse element of g , for every
g ∈ G.
Even more abstract....
 Even more abstract....
Definition
Let G be a group and U be a subset of G . Then U is called a
subgroup of G if and only if
 Even more abstract....
Definition
Let G be a group and U be a subset of G . Then U is called a
subgroup of G if and only if
I U 6= ∅ and
 Even more abstract....
Definition
Let G be a group and U be a subset of G . Then U is called a
subgroup of G if and only if
I U 6= ∅ and
I ∀a, b ∈ U : a · b −1 ∈ U.
 Even more abstract....
Definition
Let G be a group and U be a subset of G . Then U is called a
subgroup of G if and only if
I U 6= ∅ and
I ∀a, b ∈ U : a · b −1 ∈ U.
We denote by L(G ) the set of all subgroups of G .
 Even more abstract....
Definition
Let G be a group and U be a subset of G . Then U is called a
subgroup of G if and only if
I U 6= ∅ and
I ∀a, b ∈ U : a · b −1 ∈ U.
We denote by L(G ) the set of all subgroups of G .

Task: Understand G via L(G )!

Example S3 .
 Example S3 .

Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation

Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation

2 1

Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation

(23)

2 1

Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation

(23) (13)

2 1

Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation

(23) (13)

2 1
(12)
Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation
(123)
3

(23) (13)

2 1
(12)
Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation
(123) Subgroup structure
3

(23) (13)

2 1
(12)
Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation
(123) Subgroup structure
3 S3

(23) (13) h(123)i h(13)i

h(12)i h(23)i

2 1 {id}
(12)
Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
 Example S3 .
Geometric interpretation
(123) Subgroup structure
3 S3

(23) (13) h(123)i h(13)i

h(12)i h(23)i

2 1 {id}
(12)
Arithmetic interpretation
· id (12) (13) (23) (123) (132)
id id (12) (13) (23) (123) (132)
(12) (12) id (123) (132) (13) (23)
(13) (13) (132) id (123) (23) (12)
(23) (23) (123) (132) id (12) (13)
(123) (123) (23) (12) (13) (132) id
(132) (132) (13) (23) (12) id (123)
Subgroup structure
S3

h(123)i
h(13)i
h(12)i
h(23)i

{id}
Subgroup structure
S3

h(123)i
h(13)i
h(12)i
h(23)i

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then

h(123)i
h(13)i
h(12)i
h(23)i

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then
I L(G ) forms together with
⊆ an ordered set.
h(123)i
h(13)i
h(12)i
h(23)i

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then
I L(G ) forms together with
⊆ an ordered set.
h(123)i I ∀A, B ∈ L(G ) :
h(13)i
h(12)i A ∩ B ∈ L(G )
h(23)i

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then
I L(G ) forms together with
⊆ an ordered set.
h(123)i I ∀A, B ∈ L(G ) :
h(13)i
h(12)i A ∩ B ∈ L(G )
h(23)i I ∀A, B ∈ L(G ) :
hA, Bi ∈ L(G )

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then
I L(G ) forms together with
⊆ an ordered set.
h(123)i I ∀A, B ∈ L(G ) :
h(13)i
h(12)i A ∩ B ∈ L(G ) infimum.
h(23)i I ∀A, B ∈ L(G ) :
hA, Bi ∈ L(G ) supremum.

{id}
The picture is called the Hasse Diagram.
Subgroup structure
S3 Let G be a group. Then
I L(G ) forms together with
⊆ an ordered set.
h(123)i I ∀A, B ∈ L(G ) :
h(13)i
h(12)i A ∩ B ∈ L(G ) infimum.
h(23)i I ∀A, B ∈ L(G ) :
hA, Bi ∈ L(G ) supremum.
Altogether L(G ) is a lattice.
{id}
The picture is called the Hasse Diagram.
Examples
Examples
I Lattice of natural divisors of a natural number.
Examples
I Lattice of natural divisors of a natural number.
60
20 12 30
4 10 6 15
2 5 3
1
Examples
I Lattice of natural divisors of a natural number.
60
20 12 30
4 10 6 15
2 5 3
1
I The Boolean algebra.
Examples
I Lattice of natural divisors of a natural number.
60
20 12 30
4 10 6 15
2 5 3
1
I The Boolean algebra.
x ≤y ⇔x =x ∧y
x ∧ y is the infimum and
x ∨ y is the supremum.
Examples of subgroup lattices
Examples of subgroup lattices

I
S3

h(123)i h(13)i
h(12)i h(23)i

{id}
Examples of subgroup lattices
I V4

h(10)i
h(11)i h(01)i

{id}
I S3
Examples of subgroup lattices
I V4
I S3

I
A4

h(123)i h(134)i
h(12)(34)i
h(124)i h(14)(23)i
h(234)i
h(13)(24)i

{id}
Examples of subgroup lattices
I V4
I S3

I
Z60
I
A4
Z20 Z12 Z30

Z4 Z10 Z6 Z15

Z2 Z5 Z3

1
Important questions in the theory of subgroup lattices
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Every lattice is isomorphic to a sublattice of the subgroup
lattice of some group. (Philip M. Whitman (1946))

I Given a subgroup lattice, is it possible to determine the

group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Every lattice is isomorphic to a sublattice of the subgroup
lattice of some group. (Philip M. Whitman (1946))
I Every finite lattice is isomorphic to a a sublattice of the
subgroup lattice of some finite group.
(Pavel Pudlàk and Jiří Tu̇ma (1980))
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I In general, no.

I Given a subgroup lattice, is it possible to obtain properties

of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I In general, no. E.g. L(Zp ) ∼
= L(Zq ) for all primes p and q.

I Given a subgroup lattice, is it possible to obtain properties

of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I In general, no. E.g. L(Zp ) ∼
= L(Zq ) for all primes p and q.
I Sometimes, yes.
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I In general, no. E.g. L(Zp ) ∼
= L(Zq ) for all primes p and q.
I Sometimes, yes.
V4
If G is a group such that
L(G ) ∼
= L(V4 ), then G ∼
= V4 .
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I In general, no. E.g. L(Zp ) ∼
= L(Zq ) for all primes p and q.
I Sometimes, yes.
V4
If G is a group such that
L(G ) ∼
= L(V4 ), then G ∼
= V4 .
I Recent research. Under what conditions is it possible to
describe the index of a subgroup in a subgroup lattice?
(subgroup lattice index problem)
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.

I Given a lattice theoretical property, describe all (finite)

groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.
V9 S3
E.g. L(S3 ) ∼
= L(V9 ), but V9 is
abelian and S3 is not abelian.

I Given a lattice theoretical property, describe all (finite)

groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.
V9 S3
E.g. L(S3 ) ∼
= L(V9 ), but V9 is
abelian and S3 is not abelian.
I Sometimes, yes.
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.
V9 S3
E.g. L(S3 ) ∼
= L(V9 ), but V9 is
abelian and S3 is not abelian.
I Sometimes, yes.
If G is a finite soluble group and H is a group such that
L(G ) ∼
= L(H), then H is a finite soluble group.
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.
V9 S3
∼ L(V9 ), but V9 is
E.g. L(S3 ) =
abelian and S3 is not abelian.
I Sometimes, yes.
If G is a finite soluble group and H is a group such that
L(G ) ∼
= L(H), then H is a finite soluble group.
If G is a finite cyclic group and H is a group such that
L(G ) ∼
= L(H), then H is a finite cyclic group.
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I In general, no.
I Sometimes, yes.
If G is a finite soluble group and H is a group such that
L(G ) ∼
= L(H), then H is a finite soluble group.
If G is a finite cyclic group and H is a group such that
L(G ) ∼
= L(H), then H is a finite cyclic group.
The finite group G is cyclic if and V4

only if L(G ) does not contain a

sublattice isomorphic to L(V4 ).
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
If G is a finite group, then L(G ) is V4
I distributive if and only if L(G ) has
no sublattice isomorphic to L(V4 ).
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
If G is a finite group, then L(G ) is V4
I
distributive if and only if L(G ) has
no sublattice isomorphic to L(V4 ).
⇔ G is cyclic.
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
If G is a finite group, then L(G ) is V4
I
distributive if and only if L(G ) has
no sublattice isomorphic to L(V4 ).
⇔ G is cyclic.
If G is finite a group, then L(G )
I is modular if and only if L(G )
has no sublattice isomorphic to
Important questions in the theory of subgroup lattices
I Is every lattice a subgroup lattice of some group?
I Given a subgroup lattice, is it possible to determine the
group?
I Given a subgroup lattice, is it possible to obtain properties
of the group?
I Given a lattice theoretical property, describe all (finite)
groups G such that L(G ) has that property.
If G is a finite group, then L(G ) is V4
I
distributive if and only if L(G ) has
no sublattice isomorphic to L(V4 ).
⇔ G is cyclic.
If G is finite a group, then L(G )
I is modular if and only if L(G )
has no sublattice isomorphic to
⇔ G is a direct product of P ∗ -groups and modular p-groups
with relatively prime orders. (Kenkichi Iwasawa, 1941)
 Observation
Let G be a finite p-group for some prime p.
 Observation
Let G be a finite p-group for some prime p. Then L(G ) is modular
if and only if L(G ) contains no sublattice isomorphic to
 Observation
Let G be a finite p-group for some prime p. Then L(G ) is modular
if and only if L(G ) contains no sublattice isomorphic to
L5
 Observation
Let G be a finite p-group for some prime p. Then L(G ) is modular
if and only if L(G ) contains no sublattice isomorphic to
L5 L10

or
What about finite groups in general?
What about finite groups in general?
How much differs the structure of groups with
modular subgroup lattice from those whose subgroup
lattice do not contain a sublattice isomorphic to L10 ?
What about finite groups in general?
How much differs the structure of groups with
modular subgroup lattice from those whose subgroup
lattice do not contain a sublattice isomorphic to L10 ?
L5 L10

and
Definition

Let G be a group and L be a Lattice.

Definition

Let G be a group and L be a Lattice.

We say that G is L-free if and only if L(G ) does not contain a
sublattice isomorphic to L.
Definition

Let G be a group and L be a Lattice.

We say that G is L-free if and only if L(G ) does not contain a
sublattice isomorphic to L.

Example
Definition

Let G be a group and L be a Lattice.

We say that G is L-free if and only if L(G ) does not contain a
sublattice isomorphic to L.

Example

Let L be definied via

Definition

Let G be a group and L be a Lattice.

We say that G is L-free if and only if L(G ) does not contain a
sublattice isomorphic to L.

Example

Let L be definied via

Then a finite group is L-free if and only if it is cyclic.

We are interested in finite L-free groups for L one of:

L5

L10
We are interested in finite L-free groups for L one of:

L5 L6

L10
We are interested in finite L-free groups for L one of:

L5 L6 L7

L10
We are interested in finite L-free groups for L one of:

L8
L5 L6 L7

L10
We are interested in finite L-free groups for L one of:

L8
L5 L6 L7

L10
M8
We are interested in finite L-free groups for L one of:

L8
L5 L6 L7

M9
L10
M8
We are interested in finite L-free groups for L one of:

L8
L5 L6 L7

M9
L9 L10
M8
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
K. Iwasawa
1941

M9
L9 L10
M8
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
K. Iwasawa R. Schmidt R. Schmidt
1941 2003 2003

M9
L9 L10
M8
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
S. Andreeva
K. Iwasawa R. Schmidt R. Schmidt
and R. Schmidt
1941 2003 2003
2008

M9
L9 L10
M8
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
S. Andreeva
K. Iwasawa R. Schmidt R. Schmidt
and R. Schmidt
1941 2003 2003
2008

M9
L9 L10
M8
I. Toborg 2010
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
S. Andreeva
K. Iwasawa R. Schmidt R. Schmidt
and R. Schmidt
1941 2003 2003
2008

M9
L9 L10
M8
J. Pölzing and
I. Toborg 2010 R. Waldecker
2013
 We are interested in finite L-free groups for L one of:

L8
L5 L6 L7
S. Andreeva
K. Iwasawa R. Schmidt R. Schmidt
and R. Schmidt
1941 2003 2003
2008

M9
L9 L10
M8
J. Pölzing and
work in work in
I. Toborg 2010 R. Waldecker
progress progress
2013
Babyexample
 Babyexample

Let G be a finite group and L be defined via

 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈
/ hxi,
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
y ∈ G . If y ∈ = L is a
contradiction.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
y ∈ G . If y ∈ = L is a
contradiction. Hence we have y ∈ hxi.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
y ∈ G . If y ∈ = L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
y ∈ G . If y ∈ = L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order,
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
Altogether G is cyclic from prime power order.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
Altogether G is cyclic from prime power order.
On the other hand if G is cyclic from prime power order.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
Altogether G is cyclic from prime power order.
On the other hand if G is cyclic from prime power order. Then
L(G ) is isomorphic to the lattice of natural divisors of |G |.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
Altogether G is cyclic from prime power order.
On the other hand if G is cyclic from prime power order. Then
L(G ) is isomorphic to the lattice of natural divisors of |G |. Hence
L(G ) is a chain.
 Babyexample

Let G be a finite group and L be defined via

Then G is L-free if and only if G is cyclic from prime power order.
Proof
Let G be L-free and choose x ∈ G of maximal order. Let further
y ∈ G . If y ∈/ hxi, then {hxi ∩ hy i, hxi, hy i, hx, y i} ∼
= L is a
contradiction. Hence we have y ∈ hxi. This implies that G = hxi is
cyclic. Furthermore if y , z ∈ G \ {1} have coprime order, then
{{1}, hzi, hy i, hzi, hy i} ∼
= L is a contradiction.
Altogether G is cyclic from prime power order.
On the other hand if G is cyclic from prime power order. Then
L(G ) is isomorphic to the lattice of natural divisors of |G |. Hence
L(G ) is a chain. So G is L-free.
 Dziȩkujȩ bardzo!

 Alten, H.-W.; Djafari Naini, A.; Eick, B.; Folkerts, M.;

Schlosser, H.; Schlote, K.-H.; Wesemüller-Kock, H.; Wußing,
H. 4000 Jahre Algebra (German) [4000 years of algebra].
Springer, Berlin, 2014.
 Schmidt, Roland. Subgroup lattices of groups. De Gruyter
Expositions in Mathematics, 14, Berlin, 1994.
 Andreeva, Siyka; Schmidt, Roland; Toborg, Imke.
Lattice-defined classes of finite groups with modular Sylow
subgroups. J. Group Theory 14 (2011), no. 5, 747-764.
 Pölzing, Juliane; Waldecker, Rebecca M9 -free groups. J.
Group Theory 18 (2015), no. 1, 155-190.
 Schmidt, Roland. L-free groups. Illinois J. Math. 47 (2003),
no. 1-2, 515-528.
If you have any questions, please feel free to talk to me.