cohomogeneity 3 actions on spheres j. mcgowan c. searle
Post on 22-Dec-2015
215 views
TRANSCRIPT
Cohomogeneity 3 Actions on Spheres
J. McGowan
C. Searle
History
A. Classification of actions of low cohomogeneity1. 1971 -- Hsiang & Lawson: minimal submanifolds;
classification of maximal linear cohomogeneity 1 & 2 actions
2. 1980 – Uchida (some) examples omitted from H&L’s work
3. 1987 -- Grove & Halperin: Dupin hypersufaces; descriptions of cohom. 1 actions and diameters
4. 1994 & 1996 –Straume: Complete classification of cohom. 0,1 & 2 actions on true spheres and homology spheres
History
B. Work on diameters of manifolds and orbit spaces
1. 1993 – M. lower bound on diameters of manifolds of constant curvature
2. 1994 – Flach showed that there is a lower bound on the diameters of positively curved manifolds whose sec. curvature K>δ>0
3. 2000 – Greenwald found a lower bound on diameters of curvature 1 orbifolds
4. 2008 – Dunbar, Greenwald, M, Searle found lower bounds on diameters of quotients of S3 by finite groups
Step one: identifying cohomogeneity 3 actions on spheresFrom work by Dadok,
G x M M, M/G polar cohom n-1 irreducible symmetric space of rank n corresponding to the action
Tables of cohomogeneity 0, 1, and 2 Hsiang & Lawson,
addendum by Uchida
Straume
List of symmetric spaces Helgason
Some irreducible polar cohomogeneity 3 Sn actions
Group Representation Dimension
SO(5) 9
SU(5) Ad 24
Sp(4) Ad 36
SO(8) Ad 28
SO(9) Ad 36
Sp(4) 27
4k
U(4)×SU(k) 8k
Sp(4)×Sp(k) 12k
U(8) 30
U(9) 42
U(4) 12
152 S
142
4,4 kk R
4,4 kk R
R82
R92
R42S
4,4 kk RSO(4)×SO(k)
SO(4)SO(4)
Let A and B SO(4). Represent x 16 as a 44 matrix. Then x S15 if ||x|| = 1. Let SO(4)SO(4) act on S15 by
This action can diagonalize any 44 matrix.
Since it is an isometric action, this diagonalized matrix has at most 4 nonzero entries and norm 1: the orbit space is contained in a 3-dimensional subset of S15.
1:),( AxBxBA
M, a 4x4 R-matrix, ═> is diagonal.
We choose such an M to represent each orbit.
4321
1)4(, AMBSOBA
} seigenvalue{2
4
3
2
1
1 MMAMB ti
M diagonal !orbit
Isotropy Subgroup:
4
3
2
1
1
4
3
2
1
BA
That is,
1000
0100
0010
0001
BA
where det(A) = 1. (It is this subset that we mean by S(O(1)4).)
So, for example, if an orbit has a diagonal matrix with the first two entries equal, then the isotropy subgroup for that orbit contains matrices of the type AS(O(2)O(1)2)
GxGxGM
:
1000
0100
00
00
43
21
bb
bb
A
and)2(
43
21 Obb
bbB
If where
z
y
x
x
000
000
000
000
x
xAxA 1Then
Similarly,
If isotropy subgroup: S(O(1)O(2)O(1))If S(O(1)2O(2)). If S(O(1)2O(2)), where the action is
now
43 32
43
xAxA
We get even larger isotropy groups if more entries are equal: S(O(2)O(2)), S(O(3)O(1)) or SO(4) as our isotropy group.
We summarize these results in a diagram:
y
yx
x
B
A
y
yx
x
B
A1
1
S15/(SO(4)SO(4))
S(O(2)O(1)2)
SO(4)
SO(4)
S(O(2)O(2))
S(O(2)O(2))
S(O(1)O(3))SO(3)
S(O(1)O(3))
S(O(1)O(3))
S(O(1)O(2)O(1))
S(O(1)2O(2))
S(O(1)2O(2))
S(O(1)2O(2))xSO(2)
S(O(3)O(1))
S(O(2)O(2))SO(2)
We can find the diameter of the orbit space by looking at the distances between the vertices; for this orbit space, the diameter is /3.
3/
3/
4/
4/
/3
/4
Nonpolar and Exceptional Actions
For nonpolar actions and polar actions by exceptional Lie groups, these methods do not suffice.
For most cases, we must look at the roots and weights of the representation to decipher the orbit space.
Hsiang’s Cohomology Theory of Topological Transformation Groups outlines a method of finding the connected component of the principal isotropy subgroup, given the group and the representation.
Hsiang’s Method
Let G be a group acting on XLet T be the maximal torus in G and Δ(G)
its system of rootsLet S be the maximal torus in the principal
isotropy group H. (We may assume S is a subset of T.)
Let Ω be the weight system of a complexification of X, and Ω’ the non-zero weights
Hsiang’s method, continued
1. Is Ω’ contained in Δ(G)? If yes, then S=T, Δ(H)= Δ(G)\ Ω’ . Done.
2. If not, choose w1 in Ω’ \Δ(G), and let S1 = w1
┴=exp{X in Lie(T)| w1X=0}
3. Is [Ω|S1]’=[Δ(G)|S1
]’?
4. If yes, S=S1, Δ(H)=[Δ(G)|S1]’\ [Ω|S1
]’. Done
5. If not, pick w2 in [Δ(G)|S1]’\ [Ω|S1
]’ and let S2=
w2┴∩S1
6. Eventually, the process terminates, and you have the roots of the principal isotropy group.
Another case…Once we know all our angles, how do we find the
diameter of the orbit space?For an exceptional Lie group with the adjoint action, we
can read off information about the orbit space from the Dynkin diagram
Consider the following orbit space under a the adjoint F4 action: Four surface boundaries, making the following angles
with one another:Hyperplane 1: π/2, π/2, π/3Hyperplane 2: π/2, π/2, π/3Hyperplane 3: π/2, π/3, π/4Hyperplane 4: π/2, π/3, π/4
We know we have the following type of tetrahedron:
Finding the orbit space
We may position the first hyperplane in the (x,y,z,0) subspace, having unit normal (0,0,0,1).
The second hyperplane makes an angle of π/2 to the first, so we position it in the y=0 subspace, with unit normal (0,1,0,0)
We may position the first vertex at (1,0,0,0)Plane 3 meets the others at angles π/2, π/3,
π/4, has an equation ax+by+cz+dw=0, with normal vector (a,b,c,d).
Plane 4 has the same constraints
Putting it all togetherPut the bottom of the tetrahedron in the
w=0 plane with a vertex at (1,0,0,0)
Put the back of the tetrahedron in the y=0 plane
Now determine the last 2 planes
Normal to the “front” plane
Suppose the front plane has unit normal (a,b,c,d). Then its equation is ax+by+cz+dw = 0
Since it contains the point (1,0,0,0), a=0Since it is orthogonal to the y=0 plane, b=0. Since its angle with the w=0 plane is π/3,
d=1/2.Since we want a unit vector, we solve for c,
and find
2
3c
Finishing
After we find all the unit normals in this fashion, we solve the planar equations simultaneously to find the 3 remaining vertices of the tetrahedron.
Now we can find the distances between vertices, and hence the diameter of the tetrahedron.
We find the following distances
And the diameter is π/4.
Cohomogeneity 3 classification
Using these methods and the classification of lower dimensional actions, we can classify all the actions and their orbit spaces.
From there, we can also find diameters.