Elimination of operators in nilpotent groups Evgeny Khukhro University of Lincoln and Sobolev Institute of Mathematics, Novosibirsk

BN-Pair Conference in honour of 60th birthdays of Alexandre Borovik and Ali Nesin 19–22 October 2016, Istanbul

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

1 / 32

At the 4-th All-USSR School on Finite Groups, lake Turgoyak near town of Miass in Ural mountains, 1984.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

2 / 32

At the 4-th All-USSR School on Finite Groups, lake Turgoyak near town of Miass in Ural mountains, 1984. Alexandre Borovik is second from the left. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

2 / 32

At the 4-th All-USSR School on Finite Groups, lake Turgoyak near town of Miass in Ural mountains, 1984. Alexandre Borovik is second from the left. His talk was “Finite and uncountably categorical groups” (sic!). Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

2 / 32

Some old results

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

Evgeny Khukhro (Lincoln–Novosibirsk)

= 1 for all x ∈ G .

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily;

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily; and hϕi may not act faithfully on G .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily; and hϕi may not act faithfully on G . If G is a finite p 0 -group, then CG (ϕ) = 1.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily; and hϕi may not act faithfully on G . If G is a finite p 0 -group, then CG (ϕ) = 1. If ϕ acts trivially on G , then x p = 1 for all x ∈ G .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily; and hϕi may not act faithfully on G . If G is a finite p 0 -group, then CG (ϕ) = 1. If ϕ acts trivially on G , then x p = 1 for all x ∈ G .

Thompson–Hughes–Kegel If a finite group admits a splitting automorphism of prime order, then it is nilpotent.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Some old results Definition An element ϕ acting as an automorphism on a group G is called a splitting automorphism of prime order p if 2

p−1

xx ϕ x ϕ · · · x ϕ

= 1 for all x ∈ G .

This also implies ϕp = 1, easily; and hϕi may not act faithfully on G . If G is a finite p 0 -group, then CG (ϕ) = 1. If ϕ acts trivially on G , then x p = 1 for all x ∈ G .

Thompson–Hughes–Kegel If a finite group admits a splitting automorphism of prime order, then it is nilpotent. Hughes’ subgroup: finite group F 6= Hp (F ) := hx ∈ F | x p 6= 1i ⇔ ⇔ F = G o hϕi where ϕ is a splitting automorphism of G of order p. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

3 / 32

Bounds for nilpotency class

Recall: If G is a p 0 -group, then ϕ is splitting of order p iff CG (ϕ) = 1.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

4 / 32

Bounds for nilpotency class

Recall: If G is a p 0 -group, then ϕ is splitting of order p iff CG (ϕ) = 1. For a fixed-point-free automorphism of prime order p, further to Thompson’s theorem on nilpotency, the Higman–Kreknin–Kostrikin theorem gives a bound h(p) for the nilpotency class.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

4 / 32

Bounds for nilpotency class

Recall: If G is a p 0 -group, then ϕ is splitting of order p iff CG (ϕ) = 1. For a fixed-point-free automorphism of prime order p, further to Thompson’s theorem on nilpotency, the Higman–Kreknin–Kostrikin theorem gives a bound h(p) for the nilpotency class. Another extreme case of a splitting automorphism is when G hϕi has exponent p (includes the case when ϕ acts trivially).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

4 / 32

Bounds for nilpotency class

Recall: If G is a p 0 -group, then ϕ is splitting of order p iff CG (ϕ) = 1. For a fixed-point-free automorphism of prime order p, further to Thompson’s theorem on nilpotency, the Higman–Kreknin–Kostrikin theorem gives a bound h(p) for the nilpotency class. Another extreme case of a splitting automorphism is when G hϕi has exponent p (includes the case when ϕ acts trivially). Nilpotency class bounded by f (d , p), where d is the number of generators (Kostrikin’s solution of RBP for prime exponent).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

4 / 32

Soluble group with a splitting automorphism of prime order

EKh, 1980 If a finite group G admits a splitting automorphism of prime order p, then ps − 1 the nilpotency class of G is at most , where s is the derived length. p−1

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

5 / 32

Soluble group with a splitting automorphism of prime order

EKh, 1980 If a finite group G admits a splitting automorphism of prime order p, then ps − 1 the nilpotency class of G is at most , where s is the derived length. p−1 This extended the previous result for groups of prime exponent p, basically by P. J. Higgins, 1954, as well as on fixed-point-free automorphism of prime order.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

5 / 32

Soluble group with a splitting automorphism of prime order

EKh, 1980 If a finite group G admits a splitting automorphism of prime order p, then ps − 1 the nilpotency class of G is at most , where s is the derived length. p−1 This extended the previous result for groups of prime exponent p, basically by P. J. Higgins, 1954, as well as on fixed-point-free automorphism of prime order. Proof is essentially about the case where G is a finite p-group;

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

5 / 32

Soluble group with a splitting automorphism of prime order

EKh, 1980 If a finite group G admits a splitting automorphism of prime order p, then ps − 1 the nilpotency class of G is at most , where s is the derived length. p−1 This extended the previous result for groups of prime exponent p, basically by P. J. Higgins, 1954, as well as on fixed-point-free automorphism of prime order. Proof is essentially about the case where G is a finite p-group; used the fact that G hϕi is also a finite p-group and therefore nilpotent.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

5 / 32

Operator groups Later a different proof by a general method of ‘elimination of operators’.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

6 / 32

Operator groups Later a different proof by a general method of ‘elimination of operators’. Ω-Groups: groups G admitting the group Ω acting by automorphisms (not necessarily faithfully), regarded as algebraic systems, with additional unary operations ω ∈ Ω.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

6 / 32

Operator groups Later a different proof by a general method of ‘elimination of operators’. Ω-Groups: groups G admitting the group Ω acting by automorphisms (not necessarily faithfully), regarded as algebraic systems, with additional unary operations ω ∈ Ω. One can speak of varieties of Ω-groups, defined by Ω-group words (laws): ±ωj1 ±ωj2 xi2

xi1

Evgeny Khukhro (Lincoln–Novosibirsk)

±ωjn

· · · xin

Elimination of operators

= 1.

6 / 32

Operator groups Later a different proof by a general method of ‘elimination of operators’. Ω-Groups: groups G admitting the group Ω acting by automorphisms (not necessarily faithfully), regarded as algebraic systems, with additional unary operations ω ∈ Ω. One can speak of varieties of Ω-groups, defined by Ω-group words (laws): ±ωj1 ±ωj2 xi2

xi1

±ωjn

· · · xin

= 1.

‘Projection’: ordinary group word, by putting all ωjs = 1: xi±1 xi±1 · · · xi±1 = 1. n 1 2

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

6 / 32

Operator groups Later a different proof by a general method of ‘elimination of operators’. Ω-Groups: groups G admitting the group Ω acting by automorphisms (not necessarily faithfully), regarded as algebraic systems, with additional unary operations ω ∈ Ω. One can speak of varieties of Ω-groups, defined by Ω-group words (laws): ±ωj1 ±ωj2 xi2

xi1

±ωjn

· · · xin

= 1.

‘Projection’: ordinary group word, by putting all ωjs = 1: xi±1 xi±1 · · · xi±1 = 1. n 1 2

Example 2

The projection of the hϕi-law xx ϕ x ϕ · · · x ϕ Evgeny Khukhro (Lincoln–Novosibirsk)

p−1

Elimination of operators

= 1 is x p = 1. 6 / 32

Elimination of operators: nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

7 / 32

Elimination of operators: nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

7 / 32

Elimination of operators: nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c. Notes: Nilpotency class is the same.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

7 / 32

Elimination of operators: nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c. Notes: Nilpotency class is the same. The hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

7 / 32

Elimination of operators: nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c. Notes: Nilpotency class is the same. The hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p). Ideas behind proof: later in the proof of a recent result.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

7 / 32

Applications of the nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

8 / 32

Applications of the nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c. Apply to splitting automorphism of order p: by setting ϕ = 1 in the law 2 p−1 xx ϕ x ϕ · · · x ϕ = 1 we obtain the law x p = 1. For G hϕi being a finite p-group, apply the theorem and known fact about groups of exponent p.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

8 / 32

Applications of the nilpotency theorem EKh, 1991: Suppose that V is a variety of groups with operators Ω such that the projection variety V is nilpotent of class c. If G ∈ V is such that G o Ω is locally nilpotent, then G is nilpotent of class c. Apply to splitting automorphism of order p: by setting ϕ = 1 in the law 2 p−1 xx ϕ x ϕ · · · x ϕ = 1 we obtain the law x p = 1. For G hϕi being a finite p-group, apply the theorem and known fact about groups of exponent p.

Corollary Suppose that a finite p-group P admits a finite p-group of operators Ω such that for some ω1 , ω2 , . . . , ωp ∈ Ω x ω1 x ω2 · · · x ωp = 1

for all x ∈ P.

If P has derived length s, then the nilpotency class of P is at most Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

ps − 1 . p−1 8 / 32

Locally nilpotent groups with a splitting automorphism of prime order EKh, 1987 If a finite group G admits a splitting automorphism of prime order p, then it is nilpotent of class at most f (d , p), where d is the number of generators.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

9 / 32

Locally nilpotent groups with a splitting automorphism of prime order EKh, 1987 If a finite group G admits a splitting automorphism of prime order p, then it is nilpotent of class at most f (d , p), where d is the number of generators. Analogue of the positive solution of the Restricted Burnside Problem for groups of prime exponent. (Proof uses Kostrikin’s theorem.)

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

9 / 32

Locally nilpotent groups with a splitting automorphism of prime order EKh, 1987 If a finite group G admits a splitting automorphism of prime order p, then it is nilpotent of class at most f (d , p), where d is the number of generators. Analogue of the positive solution of the Restricted Burnside Problem for groups of prime exponent. (Proof uses Kostrikin’s theorem.) Application: positive solution of the Hughes problem for ‘almost all’ finite p-groups (in spite of existence of counterexamples):

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

9 / 32

Locally nilpotent groups with a splitting automorphism of prime order EKh, 1987 If a finite group G admits a splitting automorphism of prime order p, then it is nilpotent of class at most f (d , p), where d is the number of generators. Analogue of the positive solution of the Restricted Burnside Problem for groups of prime exponent. (Proof uses Kostrikin’s theorem.) Application: positive solution of the Hughes problem for ‘almost all’ finite p-groups (in spite of existence of counterexamples):

Corollary Suppose that a finite p-group P is ‘anti-Hughes’, that is, 1 6= Hp (P) := hx ∈ P | x p 6= 1i has index greater than p. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

9 / 32

Locally nilpotent groups with a splitting automorphism of prime order EKh, 1987 If a finite group G admits a splitting automorphism of prime order p, then it is nilpotent of class at most f (d , p), where d is the number of generators. Analogue of the positive solution of the Restricted Burnside Problem for groups of prime exponent. (Proof uses Kostrikin’s theorem.) Application: positive solution of the Hughes problem for ‘almost all’ finite p-groups (in spite of existence of counterexamples):

Corollary Suppose that a finite p-group P is ‘anti-Hughes’, that is, 1 6= Hp (P) := hx ∈ P | x p 6= 1i has index greater than p. Then |P| 6 f (d , p), where d is the number of generators. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

9 / 32

Anti-Hughes monsters exist ...

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

10 / 32

... but they are caged (bounded)

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

11 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators. If G ∈ V is such that G o Ω is locally nilpotent, then G satisfies the same local nilpotency laws, with the same bounds for the nilpotency class f (d ), where d is the number of generators.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators. If G ∈ V is such that G o Ω is locally nilpotent, then G satisfies the same local nilpotency laws, with the same bounds for the nilpotency class f (d ), where d is the number of generators. Again, the hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators. If G ∈ V is such that G o Ω is locally nilpotent, then G satisfies the same local nilpotency laws, with the same bounds for the nilpotency class f (d ), where d is the number of generators. Again, the hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p). Apply to splitting automorphism of order p: by setting ϕ = 1 in the law 2 p−1 xx ϕ x ϕ · · · x ϕ = 1 we obtain the law x p = 1. Here the ‘multilinear’ condition is satisfied. Use Kostrikin’s RBP.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators. If G ∈ V is such that G o Ω is locally nilpotent, then G satisfies the same local nilpotency laws, with the same bounds for the nilpotency class f (d ), where d is the number of generators. Again, the hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p). Apply to splitting automorphism of order p: by setting ϕ = 1 in the law 2 p−1 xx ϕ x ϕ · · · x ϕ = 1 we obtain the law x p = 1. Here the ‘multilinear’ condition is satisfied. Use Kostrikin’s RBP. (Improves the original bounds for the class.)

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Elimination of operators: local nilpotency theorem EKh, 1993: Suppose that V is a variety of groups with operators Ω such that the projection variety V is locally nilpotent, in a certain ‘multilinear way’, with a bound for the nilpotency class f (d ), where d is the number of generators. If G ∈ V is such that G o Ω is locally nilpotent, then G satisfies the same local nilpotency laws, with the same bounds for the nilpotency class f (d ), where d is the number of generators. Again, the hypothesis “G o Ω is locally nilpotent” is automatically satisfied if both G and Ω are locally nilpotent p-groups (for the same p). Apply to splitting automorphism of order p: by setting ϕ = 1 in the law 2 p−1 xx ϕ x ϕ · · · x ϕ = 1 we obtain the law x p = 1. Here the ‘multilinear’ condition is satisfied. Use Kostrikin’s RBP. (Improves the original bounds for the class.) ...Or similarly, to x ω1 x ω2 · · · x ωp = 1... Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

12 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group). In other words, G is an inverse limit of finite groups, and every element of G is of finite order.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group). In other words, G is an inverse limit of finite groups, and every element of G is of finite order. Consider the closed subsets Ei = {x ∈ G | x i = 1}. Then G =

S

Ei .

i

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group). In other words, G is an inverse limit of finite groups, and every element of G is of finite order. Consider the closed subsets Ei = {x ∈ G | x i = 1}. Then G =

S

Ei .

i

By the Baire category theorem, one of these sets must contain a non-empty open subset.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group). In other words, G is an inverse limit of finite groups, and every element of G is of finite order. Consider the closed subsets Ei = {x ∈ G | x i = 1}. Then G =

S

Ei .

i

By the Baire category theorem, one of these sets must contain a non-empty open subset. The latter means that there is an open (normal) subgroup (of finite index) H and a coset tH such that tH ⊆ En for some n.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

Importance of splitting automorphisms for profinite groups. Let G be a periodic profinite group (which is the same as torsion Hausdorff compact group). In other words, G is an inverse limit of finite groups, and every element of G is of finite order. Consider the closed subsets Ei = {x ∈ G | x i = 1}. Then G =

S

Ei .

i

By the Baire category theorem, one of these sets must contain a non-empty open subset. The latter means that there is an open (normal) subgroup (of finite index) H and a coset tH such that tH ⊆ En for some n. (th)n = 1 for all h ∈ H 2

⇔ hht ht · · · ht

n−1

= 1 for all h ∈ H,

that is, t induces on H is a splitting automorphism of order n. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

13 / 32

E. Zelmanov’s theorem

E. Zelmanov, 1992 A periodic profinite group is locally finite.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

14 / 32

E. Zelmanov’s theorem

E. Zelmanov, 1992 A periodic profinite group is locally finite. E. Zelmanov’s proof was about pro-p-groups and was based on his Lie algebra technique and his deep results on Restricted Burnside Problem, including results on Lie algebras with ad -nilpotent commutators in generators.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

14 / 32

E. Zelmanov’s theorem

E. Zelmanov, 1992 A periodic profinite group is locally finite. E. Zelmanov’s proof was about pro-p-groups and was based on his Lie algebra technique and his deep results on Restricted Burnside Problem, including results on Lie algebras with ad -nilpotent commutators in generators. The reduction to pro-p-groups was obtained by J. Wilson in 1983 using Hall–Higman–type theorems and the classification of finite simple groups.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

14 / 32

Open problems Problem Does every periodic profinite group have finite exponent?

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

15 / 32

Open problems Problem Does every periodic profinite group have finite exponent? By Wilson’s reduction it is sufficient to consider pro-p-groups.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

15 / 32

Open problems Problem Does every periodic profinite group have finite exponent? By Wilson’s reduction it is sufficient to consider pro-p-groups.

EKh, 1990 If a periodic profinite group contains an open set of elements of prime order p, then it is a group of bounded exponent. Based on ‘uniform’ RBP result for splitting automorphism of prime order.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

15 / 32

Open problems Problem Does every periodic profinite group have finite exponent? By Wilson’s reduction it is sufficient to consider pro-p-groups.

EKh, 1990 If a periodic profinite group contains an open set of elements of prime order p, then it is a group of bounded exponent. Based on ‘uniform’ RBP result for splitting automorphism of prime order. The general problem remains open. One of possible ways to tackle it:

Problem Suppose that a finite p-group G admits a splitting automorphism of order p k . Is the derived length of G bounded in terms of p k and the number of generators? Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

15 / 32

More on splitting automorphisms of finite groups

K. Ersoy, 2016 A finite group with a splitting automorphism of odd order is soluble.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

16 / 32

More on splitting automorphisms of finite groups

K. Ersoy, 2016 A finite group with a splitting automorphism of odd order is soluble. There are examples of non-soluble finite groups with splitting automorphisms.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

16 / 32

More on splitting automorphisms of finite groups

K. Ersoy, 2016 A finite group with a splitting automorphism of odd order is soluble. There are examples of non-soluble finite groups with splitting automorphisms.

A. Espuelas, 1992 The p-length of a finite p-soluble group with a splitting automorphism of order p n is bounded in terms of n.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

16 / 32

Frobenius group of automorphisms

Recall:

Definition A finite Frobenius group FA with kernel F and complement A is a semidirect product F o A such that CF (a) = 1 for every a ∈ A \ {1}.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

17 / 32

Frobenius group of automorphisms

Recall:

Definition A finite Frobenius group FA with kernel F and complement A is a semidirect product F o A such that CF (a) = 1 for every a ∈ A \ {1}. Suppose a finite group G admits a Frobenius group of automorphisms FA such that CG (F ) = 1.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

17 / 32

Frobenius group of automorphisms

Recall:

Definition A finite Frobenius group FA with kernel F and complement A is a semidirect product F o A such that CF (a) = 1 for every a ∈ A \ {1}. Suppose a finite group G admits a Frobenius group of automorphisms FA such that CG (F ) = 1. The condition CG (F ) = 1 alone implies that G is soluble (Belyaev–Hartley + CFSG), bounds for the Fitting height, ....

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

17 / 32

New direction: ... proving that properties of G are close to those of CG (A) (possibly ‘times |A|’).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

18 / 32

New direction: ... proving that properties of G are close to those of CG (A) (possibly ‘times |A|’). For a Frobenius group FA 6 Aut G such that CG (F ) = 1 papers of EKh, N. Makarenko, P. Shumyatsky (2010— ) give bounds for order, rank, Fitting height, nilpotency class (when FA is metacyclic), exponent (when FA is metacyclic) of G in terms of the same parameters of CG (A) (and sometimes A, and for exponent also F ).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

18 / 32

New direction: ... proving that properties of G are close to those of CG (A) (possibly ‘times |A|’). For a Frobenius group FA 6 Aut G such that CG (F ) = 1 papers of EKh, N. Makarenko, P. Shumyatsky (2010— ) give bounds for order, rank, Fitting height, nilpotency class (when FA is metacyclic), exponent (when FA is metacyclic) of G in terms of the same parameters of CG (A) (and sometimes A, and for exponent also F ). Further results (G. Collins, G. Ercan, E. de Melo, P. Flavell, İ. Güloğlu, E. Khukhro, N. Makarenko, et al.) aim at easing the strong hypothesis CG (F ) = 1 Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

18 / 32

New direction: ... proving that properties of G are close to those of CG (A) (possibly ‘times |A|’). For a Frobenius group FA 6 Aut G such that CG (F ) = 1 papers of EKh, N. Makarenko, P. Shumyatsky (2010— ) give bounds for order, rank, Fitting height, nilpotency class (when FA is metacyclic), exponent (when FA is metacyclic) of G in terms of the same parameters of CG (A) (and sometimes A, and for exponent also F ). Further results (G. Collins, G. Ercan, E. de Melo, P. Flavell, İ. Güloğlu, E. Khukhro, N. Makarenko, et al.) aim at easing the strong hypothesis CG (F ) = 1 (although even in this case some problems remain open). Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

18 / 32

Frobenius group with splitting kernel of prime order In the following theorem CG (F ) = 1 is replaced by being splitting of prime order.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

19 / 32

Frobenius group with splitting kernel of prime order In the following theorem CG (F ) = 1 is replaced by being splitting of prime order.

Theorem (EKh, 2012) Suppose that a finite group G admits a Frobenius group of automorphisms FA with complement A and with cyclic kernel F = hϕi of prime order p 2 p−1 such that ϕ is a splitting automorphism, that is, xx ϕ x ϕ · · · x ϕ = 1 for all x ∈ G .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

19 / 32

Frobenius group with splitting kernel of prime order In the following theorem CG (F ) = 1 is replaced by being splitting of prime order.

Theorem (EKh, 2012) Suppose that a finite group G admits a Frobenius group of automorphisms FA with complement A and with cyclic kernel F = hϕi of prime order p 2 p−1 such that ϕ is a splitting automorphism, that is, xx ϕ x ϕ · · · x ϕ = 1 for all x ∈ G . If CG (A) is soluble of derived length k, then G is nilpotent of (p, k)-bounded class.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

19 / 32

Frobenius group with splitting kernel of prime order In the following theorem CG (F ) = 1 is replaced by being splitting of prime order.

Theorem (EKh, 2012) Suppose that a finite group G admits a Frobenius group of automorphisms FA with complement A and with cyclic kernel F = hϕi of prime order p 2 p−1 such that ϕ is a splitting automorphism, that is, xx ϕ x ϕ · · · x ϕ = 1 for all x ∈ G . If CG (A) is soluble of derived length k, then G is nilpotent of (p, k)-bounded class. Proof by the method of elimination of operators

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

19 / 32

Frobenius group with splitting kernel of prime order In the following theorem CG (F ) = 1 is replaced by being splitting of prime order.

Theorem (EKh, 2012) Suppose that a finite group G admits a Frobenius group of automorphisms FA with complement A and with cyclic kernel F = hϕi of prime order p 2 p−1 such that ϕ is a splitting automorphism, that is, xx ϕ x ϕ · · · x ϕ = 1 for all x ∈ G . If CG (A) is soluble of derived length k, then G is nilpotent of (p, k)-bounded class. Proof by the method of elimination of operators (although the above-mentioned results of 1991, 1993 do not apply directly).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

19 / 32

When the splitting kernel acts trivially

Elimination of ϕ is based on the situation when ϕ acts trivially: then G hϕi is of prime exponent p admitting a group of automorphisms A of coprime order.

EKh–P. Shumyatsky, 1995 If a finite group G of prime exponent p admits a soluble group of automorphisms A of coprime order such that the fixed-point subgroup CG (A) is soluble of derived length k, then G is nilpotent of (p, k, |A|)-bounded class.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

20 / 32

Scheme of proof

Recall: G is a finite group with a Frobenius group FA 6 Aut G such that p−1 F = hϕi with xx ϕ · · · x ϕ = 1 for all x ∈ G . We need a bound for the nilpotency class of G in terms of p, k, and |A|, where k is the derived length of CG (A).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

21 / 32

Scheme of proof

Recall: G is a finite group with a Frobenius group FA 6 Aut G such that p−1 F = hϕi with xx ϕ · · · x ϕ = 1 for all x ∈ G . We need a bound for the nilpotency class of G in terms of p, k, and |A|, where k is the derived length of CG (A). G is nilpotent by Thompson–Hughes–Kegel: G = Gp × Gp0 .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

21 / 32

Scheme of proof

Recall: G is a finite group with a Frobenius group FA 6 Aut G such that p−1 F = hϕi with xx ϕ · · · x ϕ = 1 for all x ∈ G . We need a bound for the nilpotency class of G in terms of p, k, and |A|, where k is the derived length of CG (A). G is nilpotent by Thompson–Hughes–Kegel: G = Gp × Gp0 . Gp0 is nilpotent of class h(p) by Higman, since ϕ is fixed-point-free on Gp0 .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

21 / 32

Scheme of proof

Recall: G is a finite group with a Frobenius group FA 6 Aut G such that p−1 F = hϕi with xx ϕ · · · x ϕ = 1 for all x ∈ G . We need a bound for the nilpotency class of G in terms of p, k, and |A|, where k is the derived length of CG (A). G is nilpotent by Thompson–Hughes–Kegel: G = Gp × Gp0 . Gp0 is nilpotent of class h(p) by Higman, since ϕ is fixed-point-free on Gp0 . So we can assume G is a finite p-group, say, of exponent p m and of nilpotency class n. (Of course, we need a bound for the class independent of m, n.)

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

21 / 32

Using free groups

Advantageous to consider, instead of G , a (relatively) free FA-group X of exponent p m and nilpotent of class n, on free generators x1 . . . , xc+1 .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

22 / 32

Using free groups

Advantageous to consider, instead of G , a (relatively) free FA-group X of exponent p m and nilpotent of class n, on free generators x1 . . . , xc+1 . (As an abstract group, X is free in the variety of nilpotent groups of class n and of exponent p m on the free generators xiy , where y ∈ FA, which FA permutes naturally: (xih )z = xiyz for y , z ∈ FA.)

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

22 / 32

Using free groups

Advantageous to consider, instead of G , a (relatively) free FA-group X of exponent p m and nilpotent of class n, on free generators x1 . . . , xc+1 . (As an abstract group, X is free in the variety of nilpotent groups of class n and of exponent p m on the free generators xiy , where y ∈ FA, which FA permutes naturally: (xih )z = xiyz for y , z ∈ FA.) Note that X is a finite p-group, being a finitely generated nilpotent group of exponent p m . Hence the semidirect product XF is also a finite p-group and is therefore nilpotent of some class.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

22 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A). Let

2

p−1

S := h{xx ϕ x ϕ · · · x ϕ

| x ∈ X }XFA i,

be the FA-invariant normal closure.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A). Let

2

p−1

S := h{xx ϕ x ϕ · · · x ϕ

| x ∈ X }XFA i,

be the FA-invariant normal closure. It is sufficient to prove that [x1 , . . . , xc+1 ] ∈ CS.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A). Let

2

p−1

S := h{xx ϕ x ϕ · · · x ϕ

| x ∈ X }XFA i,

be the FA-invariant normal closure. It is sufficient to prove that [x1 , . . . , xc+1 ] ∈ CS. Indeed, there are natural homomorphisms X → G , and both C and S are in the kernel.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A). Let

2

p−1

S := h{xx ϕ x ϕ · · · x ϕ

| x ∈ X }XFA i,

be the FA-invariant normal closure. It is sufficient to prove that [x1 , . . . , xc+1 ] ∈ CS. Indeed, there are natural homomorphisms X → G , and both C and S are in the kernel. The subgroups C and S are invariant under any FA-endomorphism of X (are verbal FA-subgroups).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Verbal subgroups XFA i be the FA-invariant normal closure of the d th Let C = h (CX (A))(d) (d) term (CX (A)) of the derived series of CX (A). Let

2

p−1

S := h{xx ϕ x ϕ · · · x ϕ

| x ∈ X }XFA i,

be the FA-invariant normal closure. It is sufficient to prove that [x1 , . . . , xc+1 ] ∈ CS. Indeed, there are natural homomorphisms X → G , and both C and S are in the kernel. The subgroups C and S are invariant under any FA-endomorphism of X (are verbal FA-subgroups). For S this is clear, and for C this is due to the coprimeness of the action of A on X .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

23 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

24 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant. Factorization by T amounts to “trivialization” of ϕ: in the quotient (XFA)/(CST ) the image of ϕ becomes trivial.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

24 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant. Factorization by T amounts to “trivialization” of ϕ: in the quotient (XFA)/(CST ) the image of ϕ becomes trivial. Hence the image of X in (XFA)/(CST ) is of exponent p, since this image also satisfies the identity 2

p−1

x¯p = x¯x¯ϕ¯ x¯ϕ¯ · · · x¯ϕ¯

Evgeny Khukhro (Lincoln–Novosibirsk)

= 1,

x¯ ∈ (XCST )/(CST ).

Elimination of operators

24 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant. Factorization by T amounts to “trivialization” of ϕ: in the quotient (XFA)/(CST ) the image of ϕ becomes trivial. Hence the image of X in (XFA)/(CST ) is of exponent p, since this image also satisfies the identity 2

p−1

x¯p = x¯x¯ϕ¯ x¯ϕ¯ · · · x¯ϕ¯

= 1,

x¯ ∈ (XCST )/(CST ).

By coprimeness of action, C(XCST )/(CST ) (A) is also soluble of derived length d .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

24 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant. Factorization by T amounts to “trivialization” of ϕ: in the quotient (XFA)/(CST ) the image of ϕ becomes trivial. Hence the image of X in (XFA)/(CST ) is of exponent p, since this image also satisfies the identity 2

p−1

x¯p = x¯x¯ϕ¯ x¯ϕ¯ · · · x¯ϕ¯

= 1,

x¯ ∈ (XCST )/(CST ).

By coprimeness of action, C(XCST )/(CST ) (A) is also soluble of derived length d . Apply the Khukhro–Shumyatsky Theorem to (XCST )/(CST ) and A:

Evgeny Khukhro (Lincoln–Novosibirsk)

[x1 , . . . , xc+1 ] ∈ CST .

(1)

Elimination of operators

24 / 32

Trivializing F Let T = [X , F ]F be the normal closure of F in XF , which is also FA-invariant. Factorization by T amounts to “trivialization” of ϕ: in the quotient (XFA)/(CST ) the image of ϕ becomes trivial. Hence the image of X in (XFA)/(CST ) is of exponent p, since this image also satisfies the identity 2

p−1

x¯p = x¯x¯ϕ¯ x¯ϕ¯ · · · x¯ϕ¯

= 1,

x¯ ∈ (XCST )/(CST ).

By coprimeness of action, C(XCST )/(CST ) (A) is also soluble of derived length d . Apply the Khukhro–Shumyatsky Theorem to (XCST )/(CST ) and A: [x1 , . . . , xc+1 ] ∈ CST .

(1)

All we need is to eliminate T from inclusion (1). Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

24 / 32

Some collecting processes Rewrite (1) as a congruence modulo CS: [x1 , . . . , xc+1 ] ≡ t (mod CS),

(2)

where t ∈ T .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

25 / 32

Some collecting processes Rewrite (1) as a congruence modulo CS: [x1 , . . . , xc+1 ] ≡ t (mod CS),

(2)

where t ∈ T . As an abstract group, T = [X , F ]F is generated by the elements ϕ and [ϕ, w ], where w are words in xia∗ , where a∗ ∈ A denote various elements of A.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

25 / 32

Some collecting processes Rewrite (1) as a congruence modulo CS: [x1 , . . . , xc+1 ] ≡ t (mod CS),

(2)

where t ∈ T . As an abstract group, T = [X , F ]F is generated by the elements ϕ and [ϕ, w ], where w are words in xia∗ , where a∗ ∈ A denote various elements of A. The semidirect product XF is nilpotent, so by a standard collecting process we can rewrite (2) as [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS), where the ci are commutators in ϕ and xia∗ each involving at least one occurrence of ϕ. Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

25 / 32

Higman’s lemma

We can assume that each commutator cs in our congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS), depends on ϕ and on all the xi , i = 1, . . . , c + 1.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

26 / 32

Higman’s lemma

We can assume that each commutator cs in our congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS), depends on ϕ and on all the xi , i = 1, . . . , c + 1. This is proved similarly to the so-called Higman’s lemma, by applying the FA-endomorphisms ϑi of X extending the mapping xi → 1, xj → xj for j 6= i.......

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

26 / 32

More collecting process

Then each commutator cs in our congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS), can be assumed to have the form ∗ , . . .]], cs = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1

where {i1 , i2 , . . . , ic+1 } = {1, 2, . . . , c + 1}, the dots in each simple subcommutator [xias ∗ , . . .] denote (possibly absent) elements ϕ or xia∗ in any combination and any order, and there is at least one occurrence of ϕ in cs .

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

27 / 32

Self-amplification Recall: [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

(3)

28 / 32

Self-amplification Recall: [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS).

(3)

Consider one of ci on the right: ∗ ci = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1 , . . .]],

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

(4)

28 / 32

Self-amplification Recall: [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS).

(3)

Consider one of ci on the right: ∗ ci = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1 , . . .]],

(4)

Consider the FA-endomorphism ϑ of X extending the mapping xj → [xiaj ∗ , . . .],

j = 1, . . . , c + 1

(5)

(because the xi are free generators!).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

28 / 32

Self-amplification Recall: [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS).

(3)

Consider one of ci on the right: ∗ ci = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1 , . . .]],

(4)

Consider the FA-endomorphism ϑ of X extending the mapping xj → [xiaj ∗ , . . .],

j = 1, . . . , c + 1

(5)

(because the xi are free generators!). Both C and S are ϑ-invariant. Therefore, when ϑ is applied to (3) we obtain again a congruence modulo CS.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

28 / 32

Self-amplification Recall: [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS).

(3)

Consider one of ci on the right: ∗ ci = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1 , . . .]],

(4)

Consider the FA-endomorphism ϑ of X extending the mapping xj → [xiaj ∗ , . . .],

j = 1, . . . , c + 1

(5)

(because the xi are free generators!). Both C and S are ϑ-invariant. Therefore, when ϑ is applied to (3) we obtain again a congruence modulo CS. As a result, the commutator ci as the image of the left-hand side of (3) is expressed as the image under ϑ of the right-hand side of (3): ϑ [x1 , . . . , xc+1 ]ϑ = ci ≡ c1ϑ · · · cm (mod CS). Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

28 / 32

Self-amplification

Recall: ϑ [x1 , . . . , xc+1 ]ϑ = ci ≡ c1ϑ · · · cm (mod CS).

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

29 / 32

Self-amplification

Recall: ϑ [x1 , . . . , xc+1 ]ϑ = ci ≡ c1ϑ · · · cm (mod CS).

Note that each cjϑ has at least two occurrences of ϕ — at least one was already there originally,

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

29 / 32

Self-amplification

Recall: ϑ [x1 , . . . , xc+1 ]ϑ = ci ≡ c1ϑ · · · cm (mod CS).

Note that each cjϑ has at least two occurrences of ϕ — at least one was already there originally, and at least another one appears in the image of one of the xk (all of which occurred in ci ) under ϑ, since ci of the form (4) also contains an occurrence of ϕ.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

29 / 32

Self-amplification

After expressing in this way each commutator ci on the right in (3) (of the form (4)), we substitute their expressions into the right-hand side of the original congruence (3). Apply collection process......... obtain [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

(3)

30 / 32

Self-amplification

After expressing in this way each commutator ci on the right in (3) (of the form (4)), we substitute their expressions into the right-hand side of the original congruence (3). Apply collection process......... obtain [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

(3)

where each ci has the form ∗ , . . .]], ci = [[xia1∗ , . . .], [xia2∗ , . . .], . . . [xiac+1

but now each of them involves at least two occurrences of ϕ.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

30 / 32

Self-amplification Then we repeat this procedure bearing in mind that in the new congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

(3)

each ci has at least two occurrences of ϕ.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

31 / 32

Self-amplification Then we repeat this procedure bearing in mind that in the new congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

(3)

each ci has at least two occurrences of ϕ. As a result, for the same reasons, we obtain a new congruence (3) in which each ci has at least four occurrences of ϕ.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

31 / 32

Self-amplification Then we repeat this procedure bearing in mind that in the new congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

(3)

each ci has at least two occurrences of ϕ. As a result, for the same reasons, we obtain a new congruence (3) in which each ci has at least four occurrences of ϕ. We continue this “auto-amplification” process, doubling the number of occurrences of ϕ at each step.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

31 / 32

Self-amplification Then we repeat this procedure bearing in mind that in the new congruence [x1 , . . . , xc+1 ] ≡ c1 · · · cm (mod CS),

(3)

each ci has at least two occurrences of ϕ. As a result, for the same reasons, we obtain a new congruence (3) in which each ci has at least four occurrences of ϕ. We continue this “auto-amplification” process, doubling the number of occurrences of ϕ at each step. Since the group XF is nilpotent of some class, being a finite p-group, in the end the right-hand side of (3) becomes trivial due to unbounded accumulation of occurrences of ϕ.

Evgeny Khukhro (Lincoln–Novosibirsk)

Elimination of operators

31 / 32

Elimination of operators in nilpotent groups

(not necessarily faithfully), regarded as algebraic systems, with additional .... projection variety V is locally nilpotent, in a certain 'multilinear way', with a bound for ...

1MB Sizes 0 Downloads 181 Views

Recommend Documents

K1 of Chevalley groups are nilpotent
In [3], Bak developed a beautiful localisation–completion method which allowed him to prove that SK1(n; R) is nilpotent, and, more generally, K1(n; R) is ...

K1 of Chevalley groups are nilpotent
to fight zero divisors and then applying Quillen's theorem [17]. In [3], Bak ... friendly takeover of a theme of Bak [3, Lemma 4.11]. ...... [14] A. Sivatsky, A. Stepanov, On the word length of commutators in GLn(R), K-Theory 17 (1999) 295–. 302.

Selective Harmonic Elimination PWM Control for ... -
Section II presents the .... scribed in the previous section, optimization by direct search ..... [5] Z. Du, L. M. Tolbert, and J. N. Chiasson, “Harmonic elimination.

Detection Elimination and Overcoming of Vampire Attacks in ... - IJRIT
... Computer Science And Engineering, Lakkireddy Balireddy College Of Engineering ... Vampire attacks are not protocol-specific, in that they do not rely on design ... are link-state, distance vector, source routing, geo graphic and beacon.

Detection Elimination and Overcoming of Vampire Attacks in ... - IJRIT
Ad hoc wireless sensor networks (WSNs) promise exciting new applications in the near future, such as ubiquitous on-demand computing ... In the one cause of energy loss in wireless sensor network node in the idle consumption, when the nodes are not pa

Characterization and Elimination of Redundancy in Recursive Programs
common generator redundancy, lprovided that the frontier condition holds for the set of functions. {gi!O

Bitwise Operators
to the Cloud! • This is better than WinSCP and a text ... Valgrind. • Pronunciation: val-grinned. • For best results: ... Bitwise Encryption. One-time pad: My string:.

Bitwise Operators
This is better than WinSCP and a text editor. You don't want to do that. ... valgrind –v –leak-check=full . • Gives a report on ... subtree of each node contains only lesser nodes. 2) Right subtree of each node contains only greater nodes. 3) L

strategies of mobile virtual network operators in the ...
MVNOs (Mobile Virtual Network Operators) are companies that function as mobile ... Network Operators (MNOs) by leasing from them the access to mobile ...

PDF Download Nilpotent Lie Algebras
nilmanifolds. Audience: This book is intended for graduate students specialising in algebra, differential geometry and in theoretical physics and for researchers ...

Elimination chamber 2015
Mooreanatomy pdf.Elimination chamber 2015.Elimination chamber 2015.2013 ... Every thingwork.Kung fu hustle. eng.Elimination chamber 2015 wasn'teven ...

Existence of isometric immersions into nilpotent Lie ...
The fundamental theorem of submanifold theory, usually referred to as Bonnet's theorem, states that the Gauss, Codazzi and Ricci equations constitute a set of integrability con- ditions for isometric immersions of a simply connected Riemannian manifo

Span operators
Blackwell Publishing Ltd.Oxford, UK and Malden, USAANALAnalysis0003-26382007 Blackwell Publishing Ltd.January 20076717279ArticlesBerit Brogaard. SPAN OPERATORS. Span operators. BERiT BROGAARD. 1. Tensed plural quantifiers. Presentists typically assen

Monotone Operators without Enlargements
Oct 14, 2011 - concept of the “enlargement of A”. A main example of this usefulness is Rockafellar's proof of maximality of the subdifferential of a convex ...

Monotone Operators without Enlargements
Oct 14, 2011 - the graph of A. This motivates the definition of enlargement of A for a general monotone mapping ... We define the symmetric part a of A via. (8).

The Effects of Nationwide Tuition Fee Elimination on ... - Robert Garlick
Sep 28, 2017 - Field, Deon Filmer, Brian Jacob, David Lam, Jeffrey Smith, Stephen Taylor, Duncan Thomas, and conference and seminar participants at Bristol, CSAE, Duke, ESSA, .... system of need-based tuition fee exemptions, which are arguably less s

The Space Complexity of Elimination Theory: Upper ...
the family of boolean circuits in NC i and the algorithm which witnesses its uniformity, we can use the proof to build a sequential algorithm which works in space logi n. It is our intention to promote the use of this important tool for the solution

memorialcup-double-elimination-bracket.pdf
Page 1 of 1. Winner's Bracket Memorial Day Weekend Soccer Cup. 20-Minute Halves - Double Elimination. West Bank A Squad 5/22/2015 - 5/24/2015.

Content Aware Redundancy Elimination for Challenged Networks
Oct 29, 2012 - Motivated by advances in computer vision algorithms, we propose to .... We show that our system enables three existing. DTN protocols to ...

MTAP Elimination 2016.pdf
MTAP Elimination 2016.pdf. MTAP Elimination 2016.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying MTAP Elimination 2016.pdf. Page 1 of 69.

Alternation Elimination by Complementation
new complementation constructions for 2-way nondeterministic automata from which ..... To increase readability, we call r(π) ∈ (Q×N)ω also a run of A on w. Moreover, ...... 38 of IFIP Conference Proceedings, Chapman & Hall, 1996, pp. 3–18.