a matrix algebra example c 11 prasad and yeung give the
play

A matrix algebra example: C 11 . Prasad and Yeung give the name C 11 - PowerPoint PPT Presentation

A matrix algebra example: C 11 . Prasad and Yeung give the name C 11 to the following pair ( k, ): Let = Q ( ), where is a primitive 12-th root of 1. 4 = 2 1, so [ : Q ] = 4. Let k = Q ( r ) for r = + 1 .


  1. A matrix algebra example: C 11 . Prasad and Yeung give the name C 11 to the following pair ( k, ℓ ): Let ℓ = Q ( ζ ), where ζ is a primitive 12-th root of 1. ζ 4 = ζ 2 − 1, so [ ℓ : Q ] = 4. Let k = Q ( r ) for r = ζ + ζ − 1 . √ √ Then r 2 = 3 and ( ζ 3 ) 2 = − 1. So k = Q ( 3) and ℓ = Q ( 3 , i ). 1

  2. Let   − r − 1 1 0 F = 1 1 − r 0  .    0 0 1 Form the algebraic group G for which G ( k ) = { g ∈ M 3 × 3 ( ℓ ) : g ∗ Fg = F and det( g ) = 1 } . So we are working with the involution ι ( x ) = F − 1 x ∗ F, as ι ( x ) x = 1 iff x ∗ Fx = F . 2

  3. √ √ → R , mapping r to + Two embeddings k ֒ 3 and − 3, respectively. √ For r = + 3, set   r + 1 − 1 0 ∆ = 0 1 0  .   √ r + 1  0 0 Then ∆ ∗ F 0 ∆ = − ( r + 1) F , and so g ∗ Fg = F if and only if g = ∆ g ∆ − 1 satisfies ˜ g ∗ F 0 ˜ ˜ g = F 0 . g gives an isomorphism G ( k v ) ∼ So g �→ ˜ = SU (2 , 1) for the archimedean place v of k corresponding to the first embedding. 3

  4. √ Now let r = − 3 and   r − 1 − 1 0 0 1 0 ∆ =  .   √− r − 1  0 0 Then ∆ ∗ ∆ = − ( r + 1) F , and so g ∗ Fg = F if and only if ˜ g = ∆ g ∆ − 1 g ∗ ˜ satisfies ˜ g = I . g gives an isomorphism G ( k v ) ∼ So g �→ ˜ = SU (3) for the archimedean place v of k corresponding to the second embedding. 4

  5. In 3 α − 1 d k,ℓ = [¯ e ′ ( P v ) , � Γ : Π] ( ∗ ) v ∈T α = 1 and T 0 = ∅ (we’re in a matrix algebra case), and d k,ℓ = 864. So e ′ ( P v ) . 864 = [¯ � Γ : Π] v ∈T If v ∈ T , then (a) q 2 v + q v + 1 divides e ′ ( P v ) if v splits in ℓ , (b) q 2 v − q v + 1 divides e ′ ( P v ) if v does not split in ℓ . If q ≥ 2, then q 2 + q + 1 never divides 864 and q 2 − q + 1 divides 864 only for q = 2. 5

  6. 2 ramifies in k , as 2 o k = p 2 for p = ( r + 1) o k . So there is only one 2-adic valuation v on k , and q v = 2. So T = ∅ or T = { v } for this 2-adic v . No v ∈ V f ramifies in ℓ . We consider in detail the case T = ∅ . So equation ( ∗ ) is 864 = [¯ Γ : Π] . 6

  7. An earlier diagram is in this case ϕ SU (2 , 1) PU (2 , 1) Γ ¯ Γ = ϕ (Γ) ϕ 3 864 864 Λ ϕ ϕ − 1 (Π) Π Here Π is the fundamental group of a hypothetical fake projective plane. 7

  8. Our strategy is to • concretely realize ¯ Γ and find a presentation for this group, then • look for a subgroup Π of index 864 which is torsion-free and has finite abelianization. It will turn out that there is, up to conjugation, just one torsion-free Γ, but its abelianization is Z 2 . subgroup of index 864 in ¯ So the ball quotient Π \ B ( C 2 ) is NOT a fake projective plane. 8

  9. When v ∈ V f splits in ℓ , G ( k v ) ∼ = SL (3 , k v ), and we can choose as our parahoric subgroup P v = SL (3 , o v ) . When v does not split in ℓ = k ( s ), G ( k v ) = { g ∈ M 3 × 3 ( k v ( s )) : g ∗ F v g = F v and det( g ) = 1 } , and we can choose v ) : g ∗ F v g = F v and det( g ) = 1 } , P v = { g ∈ M 3 × 3 ( o ˜ where ˜ v is the unique extension of v to ℓ . Let Λ = { g ∈ G ( k ) : g v ∈ P v for all v ∈ V f } . Here g v is the image of g ∈ G ( k ) in G ( k v ). 9

  10. If g ∈ G ( k ) then g is a matrix with entries a αβ + ib αβ . When v splits, then g ∈ P v iff w ( a αβ + ib αβ ) ≥ 0 for both extensions w of v to ℓ and all α, β . When v doesn’t split, then g ∈ P v iff ˜ v ( a αβ + ib αβ ) ≥ 0 for the unique extension ˜ v of v to ℓ and all α, β . An element t of ℓ is in o ℓ = Z [ ζ ] if and only if w ( t ) ≥ 0 for all non- archimedean valuations w on ℓ . So Λ = { g ∈ M 3 × 3 ( Z [ ζ ]) : g ∗ Fg = F and det( g ) = 1 } . 10

  11. We also need to find matrices g with entries in Z [ ζ ] so that g ∗ Fg = F , without the condition det( g ) = 1. This will give us the normalizer Γ of Λ in SU (2 , 1). If g ∈ M 3 × 3 ( Z [ ζ ]) and g ∗ Fg = F , then det( g ) ∈ Z [ ζ ] and | det( g ) | 2 = 1. So det( g ) = ζ j for some j ∈ { 0 , . . . , 11 } . Mapping ζ to e 2 πi/ 12 , the matrix ζ − j/ 3 ∆ g ∆ − 1 is then in SU (2 , 1) and normalizes the image { ∆ h ∆ − 1 : h ∈ Λ } of Λ in SU (2 , 1). So it is in Γ. Fact: You get all elements of Γ in this way. 11

  12. Finding matrices g ∈ M 3 × 3 ( Z [ ζ ]) satisfying g ∗ Fg = F . We use the action of U (2 , 1) on B ( C 2 ). z ′     z 1 1 g. ( z 1 , z 2 ) = ( z ′ 1 , z ′ z ′ 2 ) means that g  = c for some c. z 2     2    1 1 This action preserves the hyperbolic metric, which is given by | 1 − � z, w �| 2 cosh 2 ( d ( z, w )) = (1 − | z | 2 )(1 − | w | 2 ) , w 2 and | z | 2 = � z, z � . where � z, w � = z 1 ¯ w 1 + z 2 ¯ 12

  13. Comparing (3 , 3)-entries on both sides of g ∗ F 0 g = F 0 , we get | g 13 | 2 + | g 23 | 2 = | g 33 | 2 − 1 , (“column 3 condition”) so | g 33 | ≥ 1 for any g ∈ U (2 , 1). If g = ( g jk ) ∈ U (2 , 1), then g. (0 , 0) = ( g 13 /g 33 , g 23 /g 33 ). So column 3 condition ⇒ cosh 2 ( d (0 , g. 0)) = | g 33 | 2 . Writing 0 in place of (0 , 0). g. 0 = 0 ⇔ | g 33 | = 1 . So g. 0 = 0 implies that g 13 = 0 = g 23 . In fact, g. 0 = 0 iff   0 g 11 g 12 g = 0 g 21 g 22  .    0 0 g 33 13

  14. The group of g ∈ M 3 × 3 ( Z [ ζ ]) such that g ∗ Fg = F acts on B ( C 2 ): for g = ∆ g ∆ − 1 is in U (2 , 1), and we set such g , ˜ for z ∈ B ( C 2 ) . g.z := ˜ g.z The subgroup { ζ j I : j = 0 , . . . , 11 } acts trivially, and Γ ∼ = { g ∈ M 3 × 3 ( Z [ ζ ]) : g ∗ Fg = F } / { ζ j I : j = 0 , . . . , 11 } . ¯ g 33 = g 33 , and so cosh 2 ( d (0 , g. 0)) = | g 33 | 2 is still valid. Note that ˜ 14

  15. The column 3 condition for g satisfying g ∗ Fg = F is | g 13 | 2 + | g 13 − ( r − 1) g 23 | 2 = ( r − 1)( | g 33 | 2 − 1) . So g. 0 = 0 ⇔ | g 33 | = 1 ⇔ g 13 = g 23 = 0. Again, g. 0 = 0 iff   g 11 g 12 0 g = g 21 g 22 0  .    0 0 g 33 Since g 33 ∈ Z [ ζ ] and | g 33 | 2 = 1, we have g 33 = ζ j for some j . 15

  16. Routine calculations show that ζ 3 + ζ 2 − ζ ζ 3     1 − ζ 0 0 0 ζ 3 + ζ 2 − 1 ζ 3 + ζ 2 − ζ − 1 ζ − ζ 3 u =  and v =  , 0 1 0       0 0 1 0 0 1 which have entries in Z [ ζ ], satisfy u ∗ Fu = F = v ∗ Fv and u 3 = I, v 4 = I, and ( uv ) 2 = ( vu ) 2 . They generate a group K of order 288 with this presentation. Γ on B ( C 2 ), K is the stabilizer of the origin. Lemma. For the action of ¯ 16

  17. We next find a presentation for ¯ Γ. Let   1 0 0 − 2 ζ 3 − ζ 2 + 2 ζ + 2 ζ 3 + ζ 2 − ζ − 1 − ζ 3 − ζ 2 b =  .    ζ 2 + ζ − ζ 3 − 1 − ζ 3 + ζ + 1 This satisfies b ∗ Fb = F and det( b ) = ζ 4 . Theorem. The elements u , v and b generate ¯ Γ, and the relations u 3 = v 4 = b 3 = 1 , ( uv ) 2 = ( vu ) 2 , vb = bv, ( buv ) 3 = ( buvu ) 2 v = 1 . give a presentation of ¯ Γ. Note that ( buv ) 3 = ( buvu ) 2 v = ζ − 1 I as matrices, but we are working modulo { ζ j I : j = 0 , . . . , 11 } . 17

  18. Finding b , and showing that u , v and b generate ¯ Γ. For g ∈ U (2 , 1), g ∗ = F − 1 g ∗ F 0 g = F 0 ⇔ F − 1 g ∗ F 0 g = I ⇔ gF − 1 g ∗ F 0 = I ⇔ gF − 1 . 0 0 0 0 = F 0 . Comparing (1 , 1) entries in gF 0 g ∗ = F 0 , we get Also, F − 1 0 | g 11 | 2 + | g 12 | 2 = | g 13 | 2 + 1 . (“row 1 condition”) Lemma. If 5 complex numbers g 11 , g 12 , g 13 , g 23 and g 33 are given satisfying the above column 3 and row 1 conditions, and if a θ ∈ C is given with | θ | = 1, there is a unique g ∈ U (2 , 1) with the given 5 entries and with det( g ) = θ . 18

  19. Analogously, if g ∈ M 3 × 3 ( Z [ ζ ]) and g ∗ Fg = F , then | g 13 | 2 + | g 13 − ( r − 1) g 23 | 2 = ( r − 1)( | g 33 | 2 − 1) and | g 11 | 2 + | g 11 + ( r + 1) g 12 | 2 = ( r + 1) | g 13 | 2 + 2 . Lemma. If 5 numbers g 11 , g 12 , g 13 , g 23 and g 33 are given in ℓ = Q ( ζ ) satisfying the above modified column 3 and row 1 conditions, and if θ = ζ j is given, there is a unique g ∈ M 3 × 3 ( ℓ ) with the given 5 entries and with det( g ) = θ . If the given 5 numbers g ij are all in Z [ ζ ], the numbers g 21 , g 22 , g 31 and g 32 are in ℓ = Q ( ζ ), but might not be in Z [ ζ ]. 19

  20. Lemma. If α = a 0 + a 1 ζ + a 2 ζ 2 + a 3 ζ 3 ∈ Z [ ζ ], then | α | 2 = P ( α ) + Q ( α ) r, where P ( α ) and Q ( α ) are integers, and P ( α ) is a positive definite quadratic form in a 0 , . . . , a 3 , and | Q ( α ) | ≤ 1 r P ( α ). In fact, P ( α ) ≥ 1 j a 2 � j . 2 If α ∈ o ℓ , then | α | 2 = ¯ Proof. αα ∈ o k = { p + qr : p, q ∈ Z } . The automorphism ψ of ℓ mapping ζ to ζ 5 maps r to − r and commutes with conjugation. Apply ψ to both sides of | α | 2 = P ( α ) + Q ( α ) r , and we get | ψ ( α ) | 2 = P ( α ) − Q ( α ) r . Hence P ( α ) = 1 Q ( α ) = 1 ≤ 1 | α | 2 − | ψ ( α ) | 2 � | α | 2 + | ψ ( α ) | 2 � � � and r P ( α ) . 2 2 r 20

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend