6 vues

Transféré par takestock

- [Simon R. Blackburn, Peter M. Neumann, Geetha Venk-Enumeration of Finite Groups
- Clases de Lessly
- Measure Theory 3: Measure Algebras - D.H. Fremlin
- Bm Variations
- GL2.pdf
- theory 5 silvio luchetti
- 955Ass1_2010
- Haskell.pdf
- mathgen-801290006.pdf
- 4301 Math Syllabus
- Lect 2
- Soft Neutrosophic Algebraic Structures and Their Generalization
- Bamunoba Arithmetic 2014
- 40
- BSc Syllabus
- Multiplicative Structures Subm 130626
- hw3sol
- TJUSAMO 2013-2014 Modular Arithmetic
- Abelian Group
- Quli Article

Vous êtes sur la page 1sur 33

group schemes

Jerald J. Kovacic

Department of Mathematics

The City College of The City University of New York

New York, NY 10031

email: jkovacic@verizon.net

URL: mysite.verizon.net/jkovacic

September 30, 2005

Abstract

We start with the classical denition of Picard-Vessiot extension.

We show that the Galois group is an algebraic subgroup of GL(n).

Next we introduce the notion of Picard-Vessiot ring and describe the

Galois group as spec of a certain subring of a tensor product. We shall

also show existence and uniqueness of Picard-Vessiot extensions, using

properties of the tensor product. Finally we hint at an extension of

the Picard-Vessiot theory by looking at the example of the Weierstra

-function.

We use only the most elementary properties of tensor products,

spec, etc. We will dene these notions and develop what we need. No

prior knowledge is assumed.

1

1 Introduction

Throughout this talk we x an ordinary -eld F of characteristic 0 and with

algebraically closed eld of constants

C = F

If you want, you may assume that F = C(x) is the eld of rational functions

of a single complex variable.

I usually use the prex - instead of the word dierential. Thus I speak of

-rings and -elds, -ideals, etc.

2 Classical Picard-Vessiot theory

We consider a linear homogeneous -equation

L(y) = y

(n)

+a

n1

y

(n1)

+ +a

0

y = 0

Denition 2.1. By a fundamental system of solutions of L(y) = 0, we mean

a set

1

, . . . ,

n

of elements of some -extension eld G of F such that

1. L(

i

) = 0,

2.

1

, . . . ,

n

are linearly independent over C.

We usually write = (

1

, . . .

n

) for the row vector.

Denition 2.2. By a Picard-Vessiot extension for L we mean a -eld G

containing F such that

1. G

= F

= C,

2. G = F

1

, . . . ,

n

) where

1

, . . . ,

n

is a fundamental system of solutions

of L(y) = 0.

2

Denition 2.3. Suppose that G is a Picard-Vessiot extension. Then the

group of -automorphisms of G over F,

G(G/F) = - Aut(G/F)

is called the Galois group of G over F.

Proposition 2.4. Suppose that G is a Picard-Vessiot extension. If

G(G/F) then there is an invertible matrix c() with constant coecients such

that

= c().

The mapping

c: G(G/F) GL(n)

is an injective homomorphism.

Proof. The easiest way to see this is to look at the Wronskian matrix.

W =

_

_

_

_

_

1

n

n

.

.

.

.

.

.

(n1)

1

(n1)

n

_

_

_

_

_

Because

1

, . . . ,

n

are linearly independent over C the Wronskian is invert-

ible.

A simple computation shows that

W

=

_

_

_

_

_

_

_

_

n

.

.

.

.

.

.

(n)

1

(n)

n

_

_

_

_

_

_

_

_

=

_

_

_

_

_

_

_

_

0 1 0 . . . . . . . 0

.

.

. 0 1

.

.

.

.

.

. 0

.

.

.

.

.

.

.

.

.

.

.

.

1 0

0 . . . . . . . . . 0 1

a

0

a

1

. . . . . .a

n2

a

n1

_

_

_

_

_

_

_

_

_

_

_

_

_

_

_

_

1

n

n

.

.

.

.

.

.

(n1)

1

(n1)

n

_

_

_

_

_

_

_

_

i.e.

W

W

1

= A =

_

_

_

_

_

_

_

_

0 1 0 . . . . . . . 0

.

.

. 0 1

.

.

.

.

.

. 0

.

.

.

.

.

.

.

.

.

.

.

.

1 0

0 . . . . . . . . . 0 1

a

0

a

1

. . . . . .a

n2

a

n1

_

_

_

_

_

_

_

_

3

The matrix A is called the companion matrix for L.

Dierentiate

c() = W

1

W

and you get 0, so c() GL

C

(n) = GL(C). The rst row of W is so

W = Wc() implies that = c() .

Suppose that , G(G/F). Then

c() = W

1

(Wc()) = W

1

(W)c() = c()c() ,

because c() has constant coordinates and therefore is left xed by . There-

fore c is a homomorphism of groups. c is injective since G = F) = F(W).

3 Algebraic subgroups of GL(n)

Here we take a classical point of view, later on we shall be more modern

and use group schemes.

We start by putting a topology on ane m-space

A

m

= C

m

Denition 3.1. A subset X of A

m

is Zariski closed if there exists a nite

set of polynomials in m variables

f

1

, . . . , f

r

C[X

1

, . . . , X

m

]

such that X is the zero set of f

1

= = f

r

= 0, i.e.

X = (a

1

, . . . , a

m

) C

m

[ f

1

(a

1

, . . . , a

m

) = = f

r

(a

1

, . . . , a

m

) = 0 .

4

We can drop the adjective nite in the denition. Indeed X being the zero

set of a collection f

i

(i I) of polynomials is equivalent to saying that X is

the zero set of the entire ideal

a = ((f

i

)

iI

)

and even the radical ideal

a = f [ f

e

a for some e N

By the Hilbert Basis Theorem this ideal is generated by a nite number of

polynomials.

Theorem 3.2. (Hilbert Nullstellensatz) There is a bijection between closed

subsets of A

m

and radical ideals of C[X

1

, . . . , X

m

].

Now lets put a topology on GL(n), the set of invertible n n matrices with

coecients in C. We do this by embedding GL(n) into A

n

2

+1

:

_

_

_

c

11

c

1n

.

.

.

.

.

.

c

n1

c

nn

_

_

_

(c

11

, . . . , c

1n

, . . . , c

n1

, . . . , c

nn

, 1/ det c

ij

) A

n

2

+1

.

The image is closed, it is the zero set of

det(X

ij

)Y = 1

where Y is the (n

2

+ 1)

st

coordinate.

Denition 3.3. A subset X GL(n) is Zariski closed is if it closed in the

subset topology as a subset of A

n

2

+1

.

Denition 3.4. A linear algebraic group is a closed subgroup of GL(n) for

some n.

4 The Galois group of a Picard-Vessiot ex-

tension

In this section G is a Picard-Vessiot extension of F.

5

Proposition 4.1. The image of

c: G(G/F) GL(n)

is an algebraic subgroup of GL(n).

Proof. Let y

1

, . . . , y

n

be -indeterminates over F. This means that

y

1

, . . . , y

n

, y

1

, . . . , y

n

, y

1

, . . . y

n

, . . .

is an innite family of indeterminates over F. We use vector notation and

write y = (y

1

, . . . , y

n

). Then

Fy = F[y, y

, . . . ]

is a polynomial ring in an innite number of variables. There is a homomor-

phism over F, called the substitution homomorphism, dened by

: Fy F

y

i

i

y

i

.

.

.

Evidently, it is a -homomorphism. Let p be its kernel

0

E

p

E

Fy

E

F

E

0

For C GL(n) we let

C

be the substitution homomorphism

C

: Fy Fy

y yC

This means

y

i

j

y

j

C

ji

.

Lemma 4.2. C is in the image of c: G(G/F) GL(n) if and only if

C

p p and

C

1p p

(This is equivalent to

C

p = p.)

6

Proof. Suppose that C = c() for some G(G/F). We have both

= C and

C

y = yC

We have the commutative diagram:

0

E

p

E

Fy

E

F

E

0

c

C

c

0

E

p

E

Fy

E

F

E

0

To show that

C

p p, we chase the diagram. If a p then a = 0 so

0 = (a) = (

C

a)

which implies that

C

a ker = p .

We have shown that

C

p p .

For the other inclusion, use

1

.

Now suppose that

C

p = p. Then there is a -homomorphism

0

E

p

E

Fy

E

F

E

0

c

C

c

0

E

p

E

Fy

E

F

E

0

In fact is dened by

a = (

C

A), where A = a (a F, A Fy) .

Since y = , we have the matrix equation

= (

C

(y)) = (yC) = C

We can see that is bijective by diagram chasing. Tberefore extends to a

-automorphism of the eld of quotients

: F) = G G

7

So G(G/F) and since = C,

c() = C .

We think of p as a vector space over F and choose a basis A for it. We also

extend A to a basis B of Fy over F, so that A B.

Lemma 4.3. There exist polynomials

Q

bc

F[X

11

, . . . , X

nn

] b, c B

with the property that for every C GL(n) and b B,

C

(b) =

dB

Q

bc

(C) d .

Proof. We rst examine how

C

acts on Fy. Let Mbe the set of monomials,

thus an element M of M is a power product

M =

r

k=1

_

y

(e

k

)

i

k

_

f

k

of the y

i

and their derivatives. Since the coordinates of C are constants,

C

(y

(e)

i

) =

k

y

(e)

k

C

ki

.

The right hand side is linear combination of the y

(e)

i

with coecients that

are coordinates of C. If we apply

C

to a monomial we will get product

of these right hand sides which is a linear combination of monomials with

coecients that are polynomials over Z in the coordinates of C. I.e. there

exist polynomials

P

MN

Z[X

11

, . . . , X

nn

] M, N M

such that

C

M =

NM

P

MN

(C)N .

8

Because B and Mare both bases of Fy over F, we can express each element

of B as a linear combination over F of monomials, and, conversely, every

monomial as a linear combination over F of elements of B. It follows that

there exist polynomials

Q

bc

F[X

11

, . . . , X

nn

] b, c B

with the property that for every C GL(n) and b B,

C

(b) =

dB

Q

bc

(C) d .

Lemma 4.4. There is a (possibly innite) family of polynomials

R

i

F[X

11

, . . . , X

nn

, Y ] i I

such that C GL(n) is in the image of c if and only if

R

i

(C,

1

det C

) = 0, i I

Proof. We know, by Lemma 4.2, that C GL(n) is in the image of c if and

only if

C

p p and

C

1p p .

Recall that A is a basis of p over F and, by the previous lemma,

C

(a) =

b

Q

ab

(C) b

so

C

p p if and only if

Q

ab

(C) = 0 for every a A, b B, b / A.

Similarly

C

1p p if and only if

Q

ab

(C

1

) = 0 for every a A, b B, b / A.

Of course, the coordinates of C

1

are

1

det C

times polynomials in the coordi-

nates of C. Thus there exist polynomials

R

ab

F[X

11

, . . . , X

nn

, Y ]

9

such that

R

ab

(C,

1

det C

) = Q

ab

(C

1

)

To conclude the proof of the theorem we need to nd polynomials as above,

except that the coecients should be in C not F.

Choose a basis of F over C. We then can write

R

i

=

S

i

where

S

i

C[X

11

, . . . , X

nn

, Y ] .

If R

i

(C,

1

det C

) = 0 then

0 =

S

i

(C,

1

det C

)

Because the elements of are linearly independent over C, we must have

S

i

(C,

1

det C

) = 0 for all

It follows from the previous lemma that C GL(n) is in the image of c if

and only if

S

i

(C,

1

det C

) = 0 for all i I and

This proves the theorem.

5 Matrix equations

Starting with a linear homogeneous -equation (a scalar -equation) we chose

a fundamental system of solutions

1

, . . . ,

n

and formed the Wronskian

_

_

_

1

n

.

.

.

.

.

.

(n1)

1

(n1)

n

_

_

_

10

We discovered that

W

= AW

where

A =

_

_

_

_

_

_

_

_

0 1 0 . . . . . . . 0

.

.

. 0 1

.

.

.

.

.

. 0

.

.

.

.

.

.

.

.

.

.

.

.

1 0

0 . . . . . . . . . 0 1

a

0

a

1

. . . . . .a

n2

a

n1

_

_

_

_

_

_

_

_

was a matrix with coecients in F.

We can also start with a matrix equation

Y

= AY

where A Mat

F

(n) is any matrix with coordinates in F, and look for a

solution matrix Z that is invertible. The matrix Z is called a fundamental

solution matrix for the matrix -equation.

6 The Picard-Vessiot ring

Let A Mat

F

(n) be a given n n matrix with coecients in F.

Denition 6.1. By a Picard-Vessiot ring for A we mean an integral domain

R such that

1. (qf R)

= F

= C,

2. R = F[Z, Z

1

] where Z

Z

1

= A Mat

F

(n).

Item 2 could also be written R = F[Z,

1

det Z

]. There is a popular abuse of

notation that writes R = F[Z,

1

det

].

Proposition 6.2. If G = F) = F(W) is a Picard-Vessiot extension, as

before, then R = F[W, W

1

] is a Picard-Vessiot ring.

Conversly, if R is a Picard-Vessiot ring then G = qf R is a Picard-Vessiot

extension.

11

If F contains a non-constant this is a consequence of the cyclic vector the-

orem. If F = C it must (and can be) proven by a dierent method.

Denition 6.3. By the Galois group of R over F, denoted G(R/F) we mean

the group of a -automorphisms of R over F.

Proposition 6.4. If G = qf R, then G(R/F) = G(G/F).

7 Dierential simple rings

Denition 7.1. Let R be a -ring. We say that R is -simple if R has no

proper non-trivial -ideal.

In algebra (not -algebra) a simple (commutative) ring R is uninteresting.

Indeed (0) is a maximal ideal and the quotient

R/(0) = R

is a eld, i.e. R is a eld. But in -algebra the concept is very important.

Example 7.2. Let R = C[x] where x

= 1 is -simple. If a R is a

non-zero -ideal then it contains a non-zero polynomial. Choose a non-zero

polynomial P(x) in a having smallest degree. But P

so P

Note that (0) is a maximal -ideal (there is no proper -ideal containing it)

but is not a maximal ideal.

More generally, if R is any -ring and m a maximal -ideal of R then R/m

is -simple. It is a eld if and only if m is a maximal ideal.

Proposition 7.3. Let R be a Picard-Vessiot ring. Then R is -simple.

Proposition 7.4. Suppose that R is a -simple ring containing F. Then

1. R is an integral domain, and

12

2. (qf R)

= C.

This suggests a way of creating Picard-Vessiot rings.

Theorem 7.5. Let A Mat

F

(n). Then there exists a Picard-Vessiot ring R

for A.

Proof. Let y = (y

ij

) be a family of n

2

-indeterminates over F and let

S = Fy[

1

det y

]

(The derivation on Fy extends to S by the quotient rule.) We want to nd

a maximal -ideal of S that contains the -ideal

a = [y

Ay]

We can do this, using Zorns Lemma, as long as a is proper, i.e. no power of

det y is in a. But this is certainly true since every element of a has order at

least 1 and det y has order 0.

Let m be a maximal -ideal of S that contains a and set

R = S/m

R is -simple so it is a domain and (qf R)

matrix y in R then

Z

= AZ

since a is contained the kernel of S R.

Corollary 7.6. Given a linear homogeneous -equation L(y) = 0 there exists

a Picard-Vessiot extension for L.

8 Example where [y

/

A] is not maximal

The example I gave at the seminar was wrong. I had forgotten that the

containing ring is F[

1

det y

].

13

Let F = C(e

x

) and A = 1 (a 1 1 matrix). The we must look at the ideal

[y

y] Fy[

1

y

] = Fy,

1

y

1 [y]. However

[y

y] [y e

x

] .

Indeed

y

y = (y e

x

)

(y e

x

)

Also [y e

x

] is a maximal -ideal (even a maximal ideal) since it is the kernel

of the substitution homomorphism

Fy,

1

y

Fe

x

, e

x

= C(e

x

) = F

9 Tensor products

Let R and S be -rings that both contain F. We are interested in the tensor

product

R

F

S

This is a -ring. The easiest way to describe it uses vector space bases.

Let x

i

, (i I), be a vector space basis of R over F and y

j

, (j J), be

a basis of S over F. Consider the set of all pairs (x

i

, y

j

) and the set R

F

S

of all formal nite sums

i.j

a

ij

(x

i

, y

j

) where a

ij

F

R

F

S is a vector space over F with basis (x

i

, y

i

).

If x =

i

a

i

x

i

R and y =

j

b

j

y

j

S we write

x y =

j

a

i

b

j

(x

i

, y

j

) R

F

S

We have

14

1. (x +x) y = x y +x y

2. x (y +y) = x y +x y

3. a(x y) = ax y = x ay

One denes multiplication so that

(x y)(x y) = xx yy

and shows that R

F

S is a ring. Finally we dene a derivation with the

property

(x y)

= x

y +x y

We have two canonical mappings

: R R

F

S

a a 1

and

: S R

F

S

a 1 a

10 C

R

C

Be careful. Tensor products are usually much worse than the rings you

started with. For example

C

R

C

is not a eld, in fact it is not even an integral domain! Indeed

(i 1 + 1 i)(i 1 1 i) = 1 1 i i +i i 1 1 = 0

In fact C

R

C C C. Every element of C

R

C has the form

x = a(1 1) +b(i 1) +c(1 i) +d(i i)

15

We dene : C

R

C C

2

by

(x) =

_

(a +d) + (b c)i, (a d) + (b +c)i

_

It is straightforward to check that is an isomorphism or rings.

11 Uniqueness of a Picard-Vessiot ring

Suppose that R and S are both Picard-Vessiot rings for the matrix A. Say

R = F[Z, Z

1

] S = F[W, W

1

]

where

Z

Z

1

= A = W

W

1

If Z and W were in some common ring extension T of both R and S, then

W = ZC

for some matrix of constants, C T

extension of both R and S, namely

R

F

S

And we can nd one whose ring of constants is C

T = (R

F

S)/m

where m is a maximal -ideal of R

F

S. (It is -simple!)

Proposition 11.1. Suppose that m is a maximal -ideal of R

F

S and let

: R

F

S (R

F

S)/m = T

be the canonical homomorphism. Then

: R

R

F

S

T

and

: S

R

F

S

T

are isomophisms.

16

Proof. The kernel of is a proper -ideal of R. Because R is -simple, this

ideal must be (0), so is injective.

Since Z

= AZ and W

C = (1 W)(Z 1)

1

is a matrix of constants and hence has coordinates in C. Therefore

(1 W) = C(Z 1) = (CZ 1)

and

(1 S) (R 1)

or

T = (R S) (R 1) = ((R)) .

The following proposition says that a Picard-Vessiot ring for A is unique

up to -isomorphism. It follows that a Picard-Vessiot extension for a linear

homogeneous -equation is also unique up to a -isomorphism.

Theorem 11.2. R and S are -isomorphic.

Proof. Both R and S are -isomorphic to T.

12 R

F

R

We continue to assume that R is a Picard-Vessiot ring. Here we are interested

in the -ring

R

F

R

and in particular relating it to the Galois group G(R/F).

Let G(R/F). Dene a mapping

: R

F

R R

by

(a b) = ab .

17

Proposition 12.1. If G(R/F) then the kernel of is a maximal -ideal

m

.

Proof.

(R

F

R)/m

R

Because R is -simple, m

is a maximal -ideal.

Proposition 12.2. Let G(R/F). Then m

is generated as an ideal by

a 1 1 a a R.

Proof. If a R then

(a 1 1 a) = a a = 0

so a 1 1 a m

.

Now suppose that

x =

i

a

i

b

i

m

so that

i

a

i

b

i

= 0

Then

x =

i

(a

i

1)(1 b

i

b

i

1) +

i

a

i

b

i

1

=

i

(a

i

1)(b

i

1 1 b

i

)

With this we can prove the converse of Proposition 12.1.

Theorem 12.3. Let m be a maximal -ideal of R

F

R. Then there exists

G(G/F) such that m = m

.

Proof. Set

T = (R

F

R)/m, : R

F

R T

18

By Proposition 11.1 the mappings

: R T and

: R T

are isomorphisms.

Dene

: R R by = ( )

1

( )

i.e., so that

R

E

R

c c

R

F

R

E

T

'

R

F

R

commutes.

Let a R, then But

(a 1 1 a) = ((a)) (a) = ( )(a) ( )(a) = 0

Therefore

a 1 1 a ker = m

By Proposition 12.2

m

m

But m

m

= m.

We have shown that G(R/F) is in bijective correspondence (i.e. can be

identied with the set of maximal -ideals of R

F

R, i.e.

G(R/F) max dispec(R

F

R) .

We have dispec but we want spec.

19

13 C

R

C bis

C is a Galois extension of R with Galois group id, , being complex

conjugation. It turns out that C

R

C has precisely two prime ideals and

they are both maximal. The rst is generated by

a 1 1 a a C

which corresponds the the identity automorphism, and the other generated

by

a 1 1 a a C

which corresponds to the automorphism . Thus

max spec(C

R

C) = spec(C

R

C)

is a nite scheme, which is in fact a group scheme and is isomorphic to the

Galois group.

14 The constants of R

F

R

Denition 14.1. Let

K = (R

F

R)

Remember that R

K = C). This is very far from the truth.

Example 14.2. Let F = C(x) and let

Z = (e

x

) GL(1)

Note that

Z

= Z, so A = 1 .

The Picard-Vessiot ring is

R = F[e

x

, e

x

] .

20

Then

(e

x

e

x

)

= e

x

e

x

+e

x

(e

x

) = 0

so

c = e

x

e

x

K

Example 14.3. Now let

Z =

_

1 log x

0 1

_

Here

Z

=

_

0

1

x

0 0

_

=

_

0

1

x

0 0

__

1 log x

0 1

_

= AZ

and

R = F[log x]

Let

c = log x 1 1 log x

then

c

=

1

x

1 1

1

x

= 0

so K.

If M, N Mat

R

(n) we dene

M N Mat

R

F

R

(n)

be the matrix whose ij

th

coordinate is

(M N)

ij

=

k

M

ik

N

kj

Proposition 14.4. Suppose that R = F[Z, Z

1

]. Then

= Z Z

1

is a matrix of constants.

Theorem 14.5.

K = C[,

1

]

21

15 Ideals in R

C

K

Denition 15.1. Let

I(K)

denote the set of ideals of K and

I(R

C

K)

the set of -ideals of R

C

K.

Suppose that a

o

is an ideal of K, then

R

C

a

o

is a -ideal of R

C

K. This gives a mapping

: I(K) I(R

C

K)

If a R

C

K is a -ideal then

c K [ 1 c a

is an ideal of K and we have a mapping

: I(R

C

K) I(K)

Theorem 15.2. The mappings and are bijective and inverse to each

other.

The mappings and are order-preserving, so we get a bijection between

maximal ideals of K and maximal -ideals of R

C

K.

16 R

F

R R

C

K

This is one of the most important theorems of Picard-Vessiot rings.

22

Recall that

K = (R

F

R)

so, in particular, K R

F

R. We have a homomorphism

: R

C

K R

F

R

given by

r k (r 1) k

Theorem 16.1. R

F

R R

C

K

Proof. We consider

: R

C

K R

F

R

The kernel is a -ideal of R

C

K. By Theorem 15.2, there is an ideal a

o

K

with

R a

o

= ker

But restricted to 1 K is injective, so a

o

= 0. Therefore is injective.

For surjectivity we need to show that 1 R R 1)[K]. But

1 Z = (Z 1)(Z

1

Z) = (Z 1) (R 1)[K]

17 spec K

Theorem 17.1. If R is a Picard-Vessiot ring and

K = (R

F

R)

then

G(R/F) max dispec(R

F

R)

max dispec(R

C

K)

max spec K

Proof. The rst line is Theorem 12.3, the second line is Theorem 16.1 and

the last is Theorem 15.2.

23

18 Zariski topology on spec K

X = spec K is the set of prime ideals of K. If a K is a radical ideal, then

we dene

V (a) = p K [ a p

Note that V is order-reversing:

a b = V (a) V (b)

Also

V ((1)) =

V ((0)) = X

V (a b) = V (a) V (b)

V (

_

i

a

i

) =

i

V (a

i

)

We put a topology on X, called the Zariski topology, by dening the closed

sets to be sets of the form V (a) for some radical ideal a of K.

By a closed point p of X we mean a point (prime ideal) such that

V (p) = p .

Thus the closed points are precisely the maximal ideals, i.e. the set of closed

points is what I previously called max spec K.

We can do the same thing for -rings R. Thus dispec R is the set of prime

-ideals, if a is a radical -ideal of R then V (a) is dened similarly. And

we get a topology, called the Kolchin topology. The set of closed points is

max dispec R.

Beware Despite the similarity of denitions of dispec R and spec K, there

are vast dierences in the theory.

I want to describe max spec K a little further. We know that

K = C[,

1

det

]

24

where = Z

1

Z Mat

K

(n). Let X = (X

ij

) be indeterminates over C

and Y another indeterminate. Then

: C[X, Y ] K

X

Y

1

det

We have an exact sequence

0

E

a

E

C[X, Y ]

E

K

E

0

where a is the kernel of .

An element of max spec K comes from a maximal ideal of C[X, Y ] that con-

tains a and conversely, i.e.

max spec K m C[X, Y ] [ m is a maximal ideal that contains a

If c GL(n) is a zero of a then

m = (X c, (det c)Y 1)

is a maximal ideal containing a. The converse is also true - this is the weak

Hilbert Nullstellensatz. Therefore the set of maximal ideals containing a,

max spec K, is the zero set of a.

19 Ane scheme and morphisms

Theorem 19.1. Let R and S be C-algebras. An algebra homomorphism

: R S

induces a scheme morphism

a

: spec S spec R

25

Conversely, a scheme morphism

f : spec S spec R

induces an algebra homomorphism

f

#

: R S

There is a bijection

Mor(spec S, spec R) Hom(R, S)

Note that the arrows get reversed.

Theorem 19.2. Let R and S be C-algebras. Then

spec R spec S = spec(R

C

S)

20 Group scheme

A group in the category of sets is well-known. But a group in the category

of schemes is somewhat dierent. It is NOT a group in the category of sets.

In category theory one deals with objects and arrows. Here too. We write

G = spec K and C = spec C. All products are over C, i.e. =

C

.

Denition 20.1. G = spec K is a group scheme if there are mappings

m: GG G, (multiplication)

e: C G, (identity)

i : G G, (inverse)

such that the following diagrams commute.

GGG

mid

G

E

GG

c

id

G

m

c

m

GG

m

E

G

(associativity)

26

GC

id

G

e

E

GG

c

m

G

id

G

E

G

T

m

C G

eid

G

E

GG

(identity)

GG

(id

G

,i)

m

d

d

d

G

E

C

e

E

G

(i,id

G

)

d

d

d

m

GG

(inverse)

21 Hopf algebra

We can translate the group scheme mappings into algebra homomorphisms.

Denition 21.1. K is a Hopf algebra if there are mappings

: K KK, (comultiplication)

I : K C, (coidentity)

S: K K, (coinverse or antipode)

such that the following diagrams commute.

K

E

KK

c

c

id

K

KK

id

K

E

KKK

(coassociativity)

27

KK

id

K

I

E

KC

T

K

id

K

E

K

c

KK

Iid

K

E

C K

(coidentity)

KK

id

K

S

d

d

ds

K

'

C

I

'

K

Sid

K

d

d

ds

KK

(antipode)

Theorem 21.2. K is a Hopf algebra if and only if spec K is a group scheme.

28

22 Sweedler coring

There is a natural structure of coring (which I will not dene) on R

F

R

dened by

: R

F

R (R

F

R)

R

(R

F

R)

a b a 1 1 b

I : R

F

R F

a b ab

S: R

F

R R

F

R

a b b a

This looks like a Hopf algebra but, in fact, is not quite.

Proposition 22.1. The mappings above restrict to

: K K

C

K

I

: K C

S

: K K

Theorem 22.2. K together with

, I

and S

is a Hopf algebra.

Theorem 22.3. spec K is a group scheme.

23 Matrices return

We can compute the comultiplication on K. Recall that

K = C[,

1

det

], = Z

1

Z .

so

() = Z

1

F

1

R

1

F

Z = Z

1

F

Z

R

Z

1

F

Z

R

29

because Z has coordinates in R. Thus

() =

C

i.e.

(

ij

) =

ik

C

kj

which is matrix multiplication.

Also

I() = I(Z

1

Z) = Z

1

Z = 1 GL

R

(n)

so

I

() = 1 GL

C

(n)

Finally

S() = S(Z

1

F

Z) = Z

F

Z

1

= (Z

1

Z)

1

=

1

24 The Weierstra -function

Up to now we have dealt only with Picard-Vessiot extensions. The Galois

group is a subgroup of GL(n), in particular, it is ane. There is a more

general theory, the theory of strongly normal extensions. Here we examine

one simple example. We use classical language of algebraic geometry.

Start with projective 2-space P

2

= P

2

(C). This is the set of equivalence class

of triples

(a, b, c) C

3

(a, b, c) ,= 0 ,

modulo the equivalence relation

(a, b, c) (a, b, c) C, ,= 0 .

The equivalence class of (a, b, c) is denoted [a, b, c].

Recall that a polynomial P C[X, Y, Z] is homogeneous if every term has

the same degree. A subset S P

2

is closed (in the Zariski topology) if it is

the set of all zeros of a nite set of homogeneous polynomials

f

1

, . . . , f

r

C[X, Y, Z]

30

We dene E P

2

to be the elliptic curve, the zero set of the single homoge-

neous polynomial

Y

2

Z 4X

3

+g

2

XZ

2

+g

3

Z

3

where g

2

, g

3

C and the discriminant g

3

2

27g

2

3

is not 0.

If [a, b, c] E and c ,= 0 then

[a, b, c] = [

a

c

,

b

c

, 1] = [x, y, 1], y

2

= 4x

3

g

2

x g

3

.

If c = 0 then it follows that a = 0. We get the single point [0, 1, 0] which we

denote by .

We can interpret the equation y

2

= 4x

3

g

2

x g

3

as dening a Riemann

surface. It has genus 1. We can integrate on this surface and the integral is

dened up to homotopy (which we call periods).

Theorem 24.1. (Abel) Given P

1

, P

2

E there is a unique P

3

E such that

_

P

1

dt

s

+

_

P

2

dt

s

=

_

P

3

dt

s

(mod periods)

Here t is a dummy variable and s

2

= 4t

3

g

2

t g

3

.

This puts an addition on E and makes it an algebraic group.

It turns out that

[x, y, 1] = [x, y, 1]

Suppose that [x

1

, y

1

, 1] and [x

2

, y

2

, 1] are in E and x

1

,= x

2

. Then

[x

1

, y

1

, 1] + [x

2

, y

2

, 1] =

[(x

1

+x

2

) +

1

4

_

y

2

y

1

x

2

x

1

_

2

,

_

y

2

y

1

x

2

x

1

_

x

3

y

1

x

2

y

2

x

1

x

2

x

1

, 1]

Weierstra inverted the integral to dene (x):

x =

_

(x)

dt

s

.

31

so that

2

= 4

3

g

2

g

3

.

In general, we simply dene to be a solution of this -equation.

Denition 24.2. A -eld extension G of F is said to be Weierstrassian if

1. G

= F

= C,

2. G = F) where

2

= 4

3

g

2

g

3

.

Compute

2

= 12

2

g

2

to get

= 6

2

1

2

g

2

,

therefore

G = F) = F(,

) .

Let G(G/F) be the group of all -automorphisms of G over F. If G(G/F)

then

2

= 4

3

g

2

g

3

We may think of [,

coordinates in G. (Recall E had coordinates in C.) The above equation

shows that [,

points.

Assume that ,= and let

[, , 1] = [,

, 1] [

, , 1] = [,

, 1] + [,

, 1] .

From the formulas above we have:

= ( +) +

1

4

_

_

2

We claim that is a constant. First compute

_

= 2( )

32

and then

+

1

2

_

_

2( ) = 0

Because

2

= 4

3

g

2

g

3

,

is also a constant.

By assumption, G

= F

= C so [, , 1] E.

Theorem 24.3. There is an mapping

G(G/F) E

given by

[,

, 1] [,

, 1]

It is injective and the image is an algebraic subgroup of E.

33

- [Simon R. Blackburn, Peter M. Neumann, Geetha Venk-Enumeration of Finite GroupsTransféré parSiavash Kavian
- Clases de LesslyTransféré parAndres Granados
- Measure Theory 3: Measure Algebras - D.H. FremlinTransféré parPaulo Henrique Macedo
- Bm VariationsTransféré parbaldor01
- GL2.pdfTransféré parFull Name
- theory 5 silvio luchettiTransféré parSilvio Luchetti
- 955Ass1_2010Transféré parAntonio Hernandez Orozco
- Haskell.pdfTransféré parVictore Anonymo
- mathgen-801290006.pdfTransféré parLucius Lunáticus
- 4301 Math SyllabusTransféré parMichael Saber
- Lect 2Transféré parammayi9845_930467904
- Soft Neutrosophic Algebraic Structures and Their GeneralizationTransféré parAnonymous 0U9j6BLllB
- Bamunoba Arithmetic 2014Transféré parspx2
- 40Transféré parEpic Win
- BSc SyllabusTransféré parMandar Priya Phatak
- Multiplicative Structures Subm 130626Transféré parcesarneyit
- hw3solTransféré paroscura
- TJUSAMO 2013-2014 Modular ArithmeticTransféré parChanthana Chongchareon
- Abelian GroupTransféré parDavid

- Quli ArticleTransféré partakestock
- Курилович Очерки по лингвистикеTransféré partakestock
- Есперсен Философия грамматикиTransféré partakestock
- Buddhist Chanting Pali-EnglishTransféré parsimion
- vol22no2-3Transféré partakestock
- Ivanov Lingvistika 3-Go TysTransféré parYury Panikov
- New CastleTransféré partakestock

- Dyn Prog ChangeTransféré parKaushik Nadikuditi
- 11 - The Pidgeonhole Principle.pdfTransféré parDaniel Ramos
- XFEMTransféré parQiang Fang
- Doc 1081 B.P.S. X S.a. I Maths I.I.T.foundation N.T.S.E. Olympiad Study Package 2014 15Transféré parKAPIL SHARMA
- MorrisonTransféré parEpic Win
- TEST 1 FORM 5 MATHSTransféré parThiyaku Marutha
- A Little Bit of Classics_ Dynamic Programming Over Subsets and Paths in Graphs - CodeforcesTransféré parCognizance_IITR
- 8 Sistem Persamaan Linier SPLTransféré parIgor M Farhan
- InformedTransféré parArvind Rawat
- micro1_quasi1Transféré parmsalquati
- Convolutional Coding Chap10Transféré pardav
- The Newton-Raphson MethodTransféré parFrente Sur Melliza
- Problems on Discrete Mathematics 1.pdfTransféré parMarciomatiascosta
- Exam Progression-Jawapan.pdfTransféré parKhairul Wars
- Snake LemmaTransféré parΠΤΟΛΕΜΑΙΟΣ ΗΡΑΚΛΕΙΔΗΣ
- FunctionsTransféré parsewcin
- Assignment 06 CluesTransféré parZia Azam
- List of ProgramsTransféré parArjunAghara
- Math IA ModelingTransféré parLucas Oliveira
- 1 LN Numerical Methods - Matrices and DeterminantsTransféré parraylandee
- Course Notes 7824 Part6Transféré parTareq Salah
- Ch5_Crypto6eTransféré parUkNir Amor
- Heuristic-search PDF PracticeTransféré parPankaj Shukla
- Descriptive Set Theory Lecture NotesTransféré parGeorge
- cvxchap1Transféré parMuhammad Sohaib Shahid
- TEACHING LEARNING BASED OPTIMIZATION: APPLICATION AND VARIATIONTransféré parIJIERT-International Journal of Innovations in Engineering Research and Technology
- Exercise 1 FormulationTransféré parHarsha
- HO14_HW6SolutionsTransféré parKenneth
- PrimesTransféré parJohn Albert Reyes
- Maxima TutorialTransféré parArif Kamal Basyariah