::::: E F EXT " Some - c x . PI roots of unity " - - PowerPoint PPT Presentation

e f ext some c x pi roots of unity already proved
SMART_READER_LITE
LIVE PREVIEW

::::: E F EXT " Some - c x . PI roots of unity " - - PowerPoint PPT Presentation

Applications Kummer Theory II : Theorem Proof of ' Galois Lastttme Great . Necessary feel Thu ( Kummer Theory ) ::::: E F EXT " Some - c x . PI roots of unity " already proved " the we


slide-1
SLIDE 1

Applications

II :

Kummer Theory

slide-2
SLIDE 2

Lastttme

Proof of

Galois

'

Great

Theorem

.

Necessary feel

Thu ( Kummer Theory)

÷÷÷:÷÷:÷÷:÷:÷÷:÷÷÷÷

Some

x

"

  • c

E F EXT

.
slide-3
SLIDE 3

PI

we

already proved

"

"

in

the

roots of unity

section .

Today

we

do

" ⇒

"

.

Setup

:

Gul ( Khs) as In

and

wa EF .

So there

exists

re GallKIF)

with

Lo >

= Gal (KIF)

and

Irl

  • m

with mln

(ie ,

{ id.hr}

.
  • -irm

" )

are

district

elements

in Gakkai)

that comprise

Gal ( KIF) )

.
slide-4
SLIDE 4

Strategy

:

① F Pek

so

that

rfpl

  • wmp

where

Wm is

the

primitive

mth not

at

unity

wi

'm

② show

xm

  • pm

c- FIX

)

,

and therefore

×

"

  • p

"

=

x

"

  • (pm)"m

c-FIX)

⑦ Argue

that

k is the

splitting

field

  • f XII

by showing

K

  • e FCB)

treats are

{ P , wnp , wip .

. . ., wan
  • '

p )

slide-5
SLIDE 5

Step

since

Eid, r , o'

,

. . ., om

" )

are

pairwise

distinct, linear

independence

  • f

characters

says They

are independent

  • ver

K

. Ie , three is

no

expression

  • K. id t k

, r t - -t km, rm

  • ' E O

without

Ko

  • k,
  • --
  • km
  • O .

On the

  • ther

hand ,

since

rm

  • id

,

we

have

TM

  • id

E O

.

We

want

some

PEO

so

That

rlp)

  • wmp
.

If this

failed

, thus

(r

  • wmid)lp)=O
  • nly

when

13=0

.
slide-6
SLIDE 6

But

  • bserve

rm

  • id

equals

( r - id ) (r

  • wmid ) (r
  • Wai id)
.
  • ( r - wmm
  • ' id)

( this

comes them the foot

xm

  • I :( x
  • Nx
  • wmllx
  • wm

')

  • - -Humm)

)

since H

  • id ) ( p)
  • o

for

all

p

and th

fact

that

fr

  • wmid ) Ip)
  • O
  • nly fer

13=0 , we have

(r - id) Cr

  • wniid )
.
  • ( r
  • wmm
  • ' id)

is

the

zero

function .

But

expanding this poly gives

a dependence array {id, r

,

. .

. rn

")

→a-

slide-7
SLIDE 7

Hence

there

is

some

1340

so

that Hp)

  • Wm P.

Step②

we

want

XM - pm

C- FIX] . This

just

means we

want

pm EF

.

We

can

do this

by shoving

c- ( pm)

  • pm for

all It GallKIF)

.

Since

Crs

  • Gall KIF)

, this

is

equivalent

to

r ( pm) - pm

.
  • bserve
  • 1pm)
  • Hpk
  • Lumpy
  • wi pm
  • pm
.
slide-8
SLIDE 8

steps

we

want

K

  • Ftp)
.

Note

:

since

rlp) : Wm PFP ,

we

have

p # F

.

Since KIF is

Galois

,

we

have

[K :F)

= ( Gall KIF) I

= Kr > I

= m

.

We'll

show that

9413,132 ,

. . .. pm

" )

are

an

F

  • indep

collection

.

Hence

[ Ffp)

: F] > m

, and

since

Flp) Ek

and

Lk : F)

=

  • n

, this

forces

K

  • Ffp) .
slide-9
SLIDE 9

Suppose

instead

That

{ 413,13

'

,

. . .,pm

") is

dependent

  • ver F
.

WLOG ,

assume

we

have

a

liner

dependence

Colt c. Pt cap

' t

  • t cm . . pm

" =D

all cief

That

has

the

minimal number of

nonzero

c.effs .

Assume Tmt

fer

c.,c, ,

. ., can . .

above , Tmt

r is

chosen

to

be

the

snarliest

index

with

  • r to :

r

rt'

Cr Pt cap

t

  • t cm . . pm

" =D

all cief

slide-10
SLIDE 10

Dividing

by

P

"

gives

Cr t cap t

  • t cm . . pm
  • " r
  • O

all cief

Apply

r to both

sides :

rlcrltokr.ir/plt--trlcmn)r/plm-r--rCo)

{

u

Cr t Crt , WmB t

.
  • t cm, wmm

" -rpm

  • t - r =p

If

we

consider

① - ② ,

we

get

back

a

liner

relation

at

{ 1. P .

. -, pm

" ) that has

fewer

nonzero terms

→a-

pg