set g = PolyHom h;
set RP = Polynom-Ring R;
set SP = Polynom-Ring S;
reconsider 1RP = 1_ (Polynom-Ring R) as Element of the carrier of (Polynom-Ring R) ;
reconsider 1SP = 1_ (Polynom-Ring S) as Element of the carrier of (Polynom-Ring S) ;
now :: thesis: for a, b being Element of the carrier of (Polynom-Ring R) holds (PolyHom h) . (a + b) = ((PolyHom h) . a) + ((PolyHom h) . b)
let a, b be Element of the carrier of (Polynom-Ring R); :: thesis: (PolyHom h) . (a + b) = ((PolyHom h) . a) + ((PolyHom h) . b)
reconsider gab = ((PolyHom h) . a) + ((PolyHom h) . b) as Element of the carrier of (Polynom-Ring S) ;
reconsider a1 = a, b1 = b as sequence of R ;
set ab1 = a1 + b1;
set ga = (PolyHom h) . a;
set gb = (PolyHom h) . b;
reconsider ga1 = (PolyHom h) . a, gb1 = (PolyHom h) . b as sequence of S ;
set gab1 = ga1 + gb1;
now :: thesis: for m being Element of NAT holds ((PolyHom h) . (a + b)) . m = gab . m
let m be Element of NAT ; :: thesis: ((PolyHom h) . (a + b)) . m = gab . m
a1 + b1 = a + b by POLYNOM3:def 10;
then ((PolyHom h) . (a + b)) . m = h . ((a1 + b1) . m) by Def2
.= h . ((a1 . m) + (b1 . m)) by NORMSP_1:def 2
.= (h . (a . m)) + (h . (b . m)) by VECTSP_1:def 20
.= (((PolyHom h) . a) . m) + (h . (b . m)) by Def2
.= (ga1 . m) + (gb1 . m) by Def2
.= (ga1 + gb1) . m by NORMSP_1:def 2 ;
hence ((PolyHom h) . (a + b)) . m = gab . m by POLYNOM3:def 10; :: thesis: verum
end;
hence (PolyHom h) . (a + b) = ((PolyHom h) . a) + ((PolyHom h) . b) by FUNCT_2:63; :: thesis: verum
end;
hence PolyHom h is additive ; :: thesis: ( PolyHom h is multiplicative & PolyHom h is unity-preserving )
now :: thesis: for a, b being Element of the carrier of (Polynom-Ring R) holds (PolyHom h) . (a * b) = ((PolyHom h) . a) * ((PolyHom h) . b)
let a, b be Element of the carrier of (Polynom-Ring R); :: thesis: (PolyHom h) . (a * b) = ((PolyHom h) . a) * ((PolyHom h) . b)
reconsider ab = a * b as Element of the carrier of (Polynom-Ring R) ;
reconsider gab = ((PolyHom h) . a) * ((PolyHom h) . b) as Element of the carrier of (Polynom-Ring S) ;
reconsider a1 = a, b1 = b as sequence of R ;
reconsider ab1 = a1 *' b1 as sequence of R ;
reconsider ga = (PolyHom h) . a, gb = (PolyHom h) . b as Element of the carrier of (Polynom-Ring S) ;
reconsider ga1 = ga, gb1 = gb as sequence of S ;
set gab1 = ga1 *' gb1;
now :: thesis: for m being Element of NAT holds ((PolyHom h) . (a * b)) . m = gab . m
let m be Element of NAT ; :: thesis: ((PolyHom h) . (a * b)) . m = gab . m
consider r being FinSequence of the carrier of R such that
A1: ( len r = m + 1 & ab1 . m = Sum r & ( for k being Element of NAT st k in dom r holds
r . k = (a1 . (k -' 1)) * (b1 . ((m + 1) -' k)) ) ) by POLYNOM3:def 9;
consider s being FinSequence of the carrier of S such that
A2: ( len s = m + 1 & (ga1 *' gb1) . m = Sum s & ( for k being Element of NAT st k in dom s holds
s . k = (ga1 . (k -' 1)) * (gb1 . ((m + 1) -' k)) ) ) by POLYNOM3:def 9;
A5: dom r = Seg (m + 1) by A1, FINSEQ_1:def 3
.= dom s by A2, FINSEQ_1:def 3 ;
A3: for k being Element of NAT st k in dom r holds
h . (r . k) = s . k
proof
let k be Element of NAT ; :: thesis: ( k in dom r implies h . (r . k) = s . k )
assume A4: k in dom r ; :: thesis: h . (r . k) = s . k
hence h . (r . k) = h . ((a1 . (k -' 1)) * (b1 . ((m + 1) -' k))) by A1
.= (h . (a1 . (k -' 1))) * (h . (b1 . ((m + 1) -' k))) by GROUP_6:def 6
.= (ga1 . (k -' 1)) * (h . (b1 . ((m + 1) -' k))) by Def2
.= (ga1 . (k -' 1)) * (gb1 . ((m + 1) -' k)) by Def2
.= s . k by A5, A4, A2 ;
:: thesis: verum
end;
reconsider m1 = m + 1 as Element of NAT ;
A6: 1 <= m + 1 by NAT_1:11;
defpred S1[ Nat] means h . (Sum (r | R)) = Sum (s | R);
A7: S1[1]
proof
A8: len (r | 1) = 1 by A1, NAT_1:11, FINSEQ_1:59;
A9: dom (r | 1) = Seg 1 by A1, A6, FINSEQ_1:17;
then (r | 1) . 1 in rng (r | 1) by FINSEQ_1:3, FUNCT_1:3;
then reconsider a = (r | 1) . 1 as Element of the carrier of R ;
r | 1 = <*a*> by A8, FINSEQ_1:40;
then A11: h . (Sum (r | 1)) = h . a by RLVECT_1:44;
A12: len (s | 1) = 1 by A2, NAT_1:11, FINSEQ_1:59;
A13: dom (s | 1) = Seg 1 by A2, A6, FINSEQ_1:17;
then (s | 1) . 1 in rng (s | 1) by FINSEQ_1:3, FUNCT_1:3;
then reconsider b = (s | 1) . 1 as Element of the carrier of S ;
A15: s | 1 = <*b*> by A12, FINSEQ_1:40;
A16: dom r = Seg (m + 1) by A1, FINSEQ_1:def 3;
A17: 1 in dom (s | (Seg 1)) by A13;
1 in dom (r | (Seg 1)) by A9;
then h . a = h . (r . 1) by FUNCT_1:47
.= s . 1 by A16, A3, A6, FINSEQ_1:1
.= b by A17, FUNCT_1:47 ;
hence S1[1] by A11, A15, RLVECT_1:44; :: thesis: verum
end;
A19: now :: thesis: for j being Element of NAT st 1 <= j & j < m1 & S1[j] holds
S1[j + 1]
let j be Element of NAT ; :: thesis: ( 1 <= j & j < m1 & S1[j] implies S1[j + 1] )
assume A20: ( 1 <= j & j < m1 ) ; :: thesis: ( S1[j] implies S1[j + 1] )
assume A21: S1[j] ; :: thesis: S1[j + 1]
A22: j + 1 <= m + 1 by A20, NAT_1:13;
then A23: len (r | (j + 1)) = j + 1 by A1, FINSEQ_1:59;
A24: r | (Seg j) = r | j ;
then reconsider rj = r | (Seg j) as FinSequence of R ;
(r | (j + 1)) | j = r | j by NAT_1:11, FINSEQ_1:82;
then consider q being FinSequence such that
A25: r | (j + 1) = rj ^ q by FINSEQ_1:80;
a26: 1 <= j + 1 by NAT_1:11;
then A27: r . (j + 1) in rng r by FUNCT_1:3, A1, A22, FINSEQ_3:25;
A28: j + 1 = len (r | (j + 1)) by A22, A1, FINSEQ_1:59
.= (len rj) + (len q) by A25, FINSEQ_1:22
.= j + (len q) by A20, A24, A1, FINSEQ_1:59 ;
then dom q = Seg 1 by FINSEQ_1:def 3;
then A29: 1 in dom q ;
A30: len (r | j) = j by A20, A1, FINSEQ_1:59;
then A31: (r | (j + 1)) . (j + 1) = q . 1 by A25, A29, FINSEQ_1:def 7;
dom (r | (j + 1)) = Seg (j + 1) by A23, FINSEQ_1:def 3;
then A32: r . (j + 1) = (r | (j + 1)) . (j + 1) by FUNCT_1:47, FINSEQ_1:3;
then reconsider a = q . 1 as Element of R by A30, A27, A25, A29, FINSEQ_1:def 7;
A33: h . a = s . (j + 1) by A31, A32, a26, A3, A1, A22, FINSEQ_3:25;
q = <*a*> by A28, FINSEQ_1:40;
then h . (Sum (r | (j + 1))) = (h . (Sum rj)) + (h . a) by A25, Th17
.= (Sum (s | j)) + (Sum <*(h . a)*>) by RLVECT_1:44, A21
.= Sum ((s | j) ^ <*(h . a)*>) by RLVECT_1:41
.= Sum (s | (j + 1)) by A20, A2, A33, FINSEQ_5:83 ;
hence S1[j + 1] ; :: thesis: verum
end;
A34: for i being Element of NAT st 1 <= i & i <= m1 holds
S1[i] from INT_1:sch 7(A7, A19);
A35: Sum s = Sum (s | (m + 1)) by A2, FINSEQ_1:58
.= h . (Sum (r | (m + 1))) by A34, A6
.= h . (Sum r) by A1, FINSEQ_1:58 ;
a1 *' b1 = a * b by POLYNOM3:def 10;
then ((PolyHom h) . (a * b)) . m = (ga1 *' gb1) . m by A35, A2, A1, Def2;
hence ((PolyHom h) . (a * b)) . m = gab . m by POLYNOM3:def 10; :: thesis: verum
end;
hence (PolyHom h) . (a * b) = ((PolyHom h) . a) * ((PolyHom h) . b) by FUNCT_2:63; :: thesis: verum
end;
hence PolyHom h is multiplicative ; :: thesis: PolyHom h is unity-preserving
now :: thesis: for m being Element of NAT holds ((PolyHom h) . (1_ (Polynom-Ring R))) . m = 1SP . m
let m be Element of NAT ; :: thesis: ((PolyHom h) . (1_ (Polynom-Ring R))) . b1 = 1SP . b1
per cases ( m = 0 or m <> 0 ) ;
suppose A36: m = 0 ; :: thesis: ((PolyHom h) . (1_ (Polynom-Ring R))) . b1 = 1SP . b1
then h . (1RP . m) = h . ((1_. R) . 0) by POLYNOM3:def 10
.= h . (1_ R) by POLYNOM3:30
.= 1_ S by GROUP_1:def 13
.= (1_. S) . 0 by POLYNOM3:30
.= 1SP . m by A36, POLYNOM3:def 10 ;
hence ((PolyHom h) . (1_ (Polynom-Ring R))) . m = 1SP . m by Def2; :: thesis: verum
end;
suppose A37: m <> 0 ; :: thesis: ((PolyHom h) . (1_ (Polynom-Ring R))) . b1 = 1SP . b1
h . (1RP . m) = h . ((1_. R) . m) by POLYNOM3:def 10
.= h . (0. R) by A37, POLYNOM3:30
.= 0. S by RING_2:6
.= (1_. S) . m by A37, POLYNOM3:30
.= 1SP . m by POLYNOM3:def 10 ;
hence ((PolyHom h) . (1_ (Polynom-Ring R))) . m = 1SP . m by Def2; :: thesis: verum
end;
end;
end;
hence PolyHom h is unity-preserving by FUNCT_2:63; :: thesis: verum