let F be Field; for E being FieldExtension of F
for a being F -algebraic Element of E ex f being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) st f is bijective
let E be FieldExtension of F; for a being F -algebraic Element of E ex f being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) st f is bijective
let a be F -algebraic Element of E; ex f being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) st f is bijective
set G = Auts ((FAdj (F,{a})),F);
set R = Roots ((FAdj (F,{a})),(MinPoly (a,F)));
set p = MinPoly (a,F);
defpred S1[ object , object ] means ex f being Element of Auts ((FAdj (F,{a})),F) st
( $1 = f & $2 = f . a );
A:
now for x being object st x in Auts ((FAdj (F,{a})),F) holds
ex y being object st
( y in Roots ((FAdj (F,{a})),(MinPoly (a,F))) & S1[x,y] )let x be
object ;
( x in Auts ((FAdj (F,{a})),F) implies ex y being object st
( y in Roots ((FAdj (F,{a})),(MinPoly (a,F))) & S1[x,y] ) )assume
x in Auts (
(FAdj (F,{a})),
F)
;
ex y being object st
( y in Roots ((FAdj (F,{a})),(MinPoly (a,F))) & S1[x,y] )then reconsider f =
x as
Element of
Auts (
(FAdj (F,{a})),
F) ;
f . a in Roots (
(FAdj (F,{a})),
(MinPoly (a,F)))
by FIELD_16:13;
hence
ex
y being
object st
(
y in Roots (
(FAdj (F,{a})),
(MinPoly (a,F))) &
S1[
x,
y] )
;
verum end;
consider h being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) such that
B:
for x being object st x in Auts ((FAdj (F,{a})),F) holds
S1[x,h . x]
from FUNCT_2:sch 1(A);
now for x1, x2 being object st x1 in Auts ((FAdj (F,{a})),F) & x2 in Auts ((FAdj (F,{a})),F) & h . x1 = h . x2 holds
x1 = x2let x1,
x2 be
object ;
( x1 in Auts ((FAdj (F,{a})),F) & x2 in Auts ((FAdj (F,{a})),F) & h . x1 = h . x2 implies x1 = x2 )assume B1:
(
x1 in Auts (
(FAdj (F,{a})),
F) &
x2 in Auts (
(FAdj (F,{a})),
F) &
h . x1 = h . x2 )
;
x1 = x2then reconsider f1 =
x1,
f2 =
x2 as
Element of
Auts (
(FAdj (F,{a})),
F) ;
(
S1[
f1,
h . f1] &
S1[
f2,
h . f2] )
by B;
hence
x1 = x2
by B1, FIELD_16:16;
verum end;
then C:
h is one-to-one
by FUNCT_2:19;
D:
rng h c= Roots ((FAdj (F,{a})),(MinPoly (a,F)))
by RELAT_1:def 19;
now for o being object st o in Roots ((FAdj (F,{a})),(MinPoly (a,F))) holds
o in rng hlet o be
object ;
( o in Roots ((FAdj (F,{a})),(MinPoly (a,F))) implies o in rng h )assume C1:
o in Roots (
(FAdj (F,{a})),
(MinPoly (a,F)))
;
o in rng h
Roots (
(FAdj (F,{a})),
(MinPoly (a,F)))
= { b where b is Element of (FAdj (F,{a})) : b is_a_root_of MinPoly (a,F), FAdj (F,{a}) }
by FIELD_4:def 4;
then consider b being
Element of
(FAdj (F,{a})) such that C2:
(
o = b &
b is_a_root_of MinPoly (
a,
F),
FAdj (
F,
{a}) )
by C1;
the
carrier of
(FAdj (F,{a})) c= the
carrier of
E
by EC_PF_1:def 1;
then reconsider b1 =
b as
Element of
E ;
consider f being
F -fixing Automorphism of
(FAdj (F,{a})) such that C3:
f . a = b1
by C1, C2, ID2b;
C4:
(
f in Auts (
(FAdj (F,{a})),
F) &
dom h = Auts (
(FAdj (F,{a})),
F) )
by FUNCT_2:def 1;
then
S1[
f,
h . f]
by B;
hence
o in rng h
by C2, C3, C4, FUNCT_1:3;
verum end;
then
h is onto
by D, TARSKI:2;
hence
ex f being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) st f is bijective
by C; verum