let X be Banach_Algebra; :: thesis: ( (0. X) rExpSeq is norm_summable & Sum ((0. X) rExpSeq ) = 1. X )
defpred S1[ set ] means (Partial_Sums ||.((0. X) rExpSeq ).||) . $1 = 1;
(Partial_Sums ||.((0. X) rExpSeq ).||) . 0 = ||.((0. X) rExpSeq ).|| . 0 by SERIES_1:def 1
.= ||.(((0. X) rExpSeq ) . 0 ).|| by NORMSP_1:def 10
.= ||.(1. X).|| by Th14
.= 1 by LOPBAN_3:43 ;
then A1: S1[ 0 ] ;
A2: for n being Nat st S1[n] holds
S1[n + 1]
proof
let n be Nat; :: thesis: ( S1[n] implies S1[n + 1] )
assume A3: (Partial_Sums ||.((0. X) rExpSeq ).||) . n = 1 ; :: thesis: S1[n + 1]
X: n in NAT by ORDINAL1:def 13;
hence (Partial_Sums ||.((0. X) rExpSeq ).||) . (n + 1) = 1 + (||.((0. X) rExpSeq ).|| . (n + 1)) by A3, SERIES_1:def 1
.= 1 + ||.(((0. X) rExpSeq ) . (n + 1)).|| by NORMSP_1:def 10
.= 1 + ||.(((1 / (n + 1)) * (0. X)) * (((0. X) rExpSeq ) . n)).|| by Th14, X
.= 1 + ||.((0. X) * (((0. X) rExpSeq ) . n)).|| by LOPBAN_3:43
.= 1 + ||.(0. X).|| by LOPBAN_3:43
.= 1 + 0 by LOPBAN_3:43
.= 1 ;
:: thesis: verum
end;
A4: (0. X) rExpSeq is norm_summable
proof
X: for n being Nat holds S1[n] from NAT_1:sch 2(A1, A2);
not REAL is empty ;
Partial_Sums ||.((0. X) rExpSeq ).|| is constant
proof
take 1 ; :: according to VALUED_0:def 18 :: thesis: for b1 being set holds (Partial_Sums ||.((0. X) rExpSeq ).||) . b1 = 1
let n be Nat; :: thesis: (Partial_Sums ||.((0. X) rExpSeq ).||) . n = 1
thus (Partial_Sums ||.((0. X) rExpSeq ).||) . n = 1 by X; :: thesis: verum
end;
then Partial_Sums ||.((0. X) rExpSeq ).|| is convergent ;
hence ||.((0. X) rExpSeq ).|| is summable by SERIES_1:def 2; :: according to LOPBAN_3:def 4 :: thesis: verum
end;
defpred S2[ set ] means (Partial_Sums ((0. X) rExpSeq )) . $1 = 1. X;
(Partial_Sums ((0. X) rExpSeq )) . 0 = ((0. X) rExpSeq ) . 0 by BHSP_4:def 1
.= 1. X by Th14 ;
then A5: S2[ 0 ] ;
A6: for n being Element of NAT st S2[n] holds
S2[n + 1]
proof
let n be Element of NAT ; :: thesis: ( S2[n] implies S2[n + 1] )
assume A7: (Partial_Sums ((0. X) rExpSeq )) . n = 1. X ; :: thesis: S2[n + 1]
thus (Partial_Sums ((0. X) rExpSeq )) . (n + 1) = (1. X) + (((0. X) rExpSeq ) . (n + 1)) by A7, BHSP_4:def 1
.= (1. X) + (((1 / (n + 1)) * (0. X)) * (((0. X) rExpSeq ) . n)) by Th14
.= (1. X) + ((0. X) * (((0. X) rExpSeq ) . n)) by LOPBAN_3:43
.= (1. X) + (0. X) by LOPBAN_3:43
.= 1. X by LOPBAN_3:43 ; :: thesis: verum
end;
for n being Element of NAT holds S2[n] from NAT_1:sch 1(A5, A6);
hence ( (0. X) rExpSeq is norm_summable & Sum ((0. X) rExpSeq ) = 1. X ) by A4, Th2; :: thesis: verum