:: The Series on {B}anach Algebra
:: by Yasunari Shidama
::
:: Received February 3, 2004
:: Copyright (c) 2004-2011 Association of Mizar Users


begin

definition
canceled;
end;

:: deftheorem LOPBAN_3:def 1 :
canceled;

theorem Th1: :: LOPBAN_3:1
for X being non empty right_complementable add-associative right_zeroed NORMSTR
for seq being sequence of X st ( for n being Element of NAT holds seq . n = 0. X ) holds
for m being Element of NAT holds (Partial_Sums seq) . m = 0. X
proof end;

definition
let X be RealNormSpace;
let seq be sequence of X;
attr seq is summable means :Def2: :: LOPBAN_3:def 2
 Partial_Sums seq is convergent ;
end;

:: deftheorem Def2 defines summable LOPBAN_3:def 2 :
for X being RealNormSpace
for seq being sequence of X holds
( seq is summable iff Partial_Sums seq is convergent );

registration
let X be RealNormSpace;
cluster Relation-like NAT -defined the carrier of X -valued Function-like V11() V14( NAT ) V27( NAT , the carrier of X) summable Element of K21(K22(NAT, the carrier of X));
existence
ex b1 being sequence of X st b1 is summable
proof end;
end;

definition
let X be RealNormSpace;
let seq be sequence of X;
func Sum seq -> Element of X equals :: LOPBAN_3:def 3
 lim (Partial_Sums seq);
correctness
coherence
lim (Partial_Sums seq) is Element of X;
;
end;

:: deftheorem defines Sum LOPBAN_3:def 3 :
for X being RealNormSpace
for seq being sequence of X holds Sum seq = lim (Partial_Sums seq);

definition
let X be RealNormSpace;
let seq be sequence of X;
attr seq is norm_summable means :Def4: :: LOPBAN_3:def 4
||.seq.|| is summable ;
end;

:: deftheorem Def4 defines norm_summable LOPBAN_3:def 4 :
for X being RealNormSpace
for seq being sequence of X holds
( seq is norm_summable iff ||.seq.|| is summable );

theorem Th2: :: LOPBAN_3:2
for X being RealNormSpace
for seq being sequence of X
for m being Element of NAT holds 0 <= ||.seq.|| . m
proof end;

theorem Th3: :: LOPBAN_3:3
for X being RealNormSpace
for x, y, z being Element of X holds ||.(x - y).|| = ||.((x - z) + (z - y)).||
proof end;

theorem Th4: :: LOPBAN_3:4
for X being RealNormSpace
for seq being sequence of X st seq is convergent holds
for s being Real st 0 < s holds
ex n being Element of NAT st
for m being Element of NAT st n <= m holds
||.((seq . m) - (seq . n)).|| < s
proof end;

theorem Th5: :: LOPBAN_3:5
for X being RealNormSpace
for seq being sequence of X holds
( seq is CCauchy iff for p being Real st p > 0 holds
ex n being Element of NAT st
for m being Element of NAT st n <= m holds
||.((seq . m) - (seq . n)).|| < p )
proof end;

theorem Th6: :: LOPBAN_3:6
for X being RealNormSpace
for seq being sequence of X st ( for n being Element of NAT holds seq . n = 0. X ) holds
for m being Element of NAT holds (Partial_Sums ||.seq.||) . m = 0
proof end;

theorem :: LOPBAN_3:7
canceled;

theorem :: LOPBAN_3:8
canceled;

theorem :: LOPBAN_3:9
canceled;

theorem :: LOPBAN_3:10
canceled;

theorem Th11: :: LOPBAN_3:11
for X being RealNormSpace
for seq, seq1 being sequence of X st seq1 is subsequence of seq & seq is convergent holds
seq1 is convergent
proof end;

theorem Th12: :: LOPBAN_3:12
for X being RealNormSpace
for seq, seq1 being sequence of X st seq1 is subsequence of seq & seq is convergent holds
lim seq1 = lim seq
proof end;

theorem :: LOPBAN_3:13
canceled;

theorem :: LOPBAN_3:14
for X being RealNormSpace
for seq, seq1 being sequence of X
for k being Element of NAT st seq is convergent holds
( seq ^\ k is convergent & lim (seq ^\ k) = lim seq ) by Th11, Th12;

theorem Th15: :: LOPBAN_3:15
for X being RealNormSpace
for seq, seq1 being sequence of X st seq is convergent & ex k being Element of NAT st seq = seq1 ^\ k holds
seq1 is convergent
proof end;

theorem Th16: :: LOPBAN_3:16
for X being RealNormSpace
for seq, seq1 being sequence of X st seq is convergent & ex k being Element of NAT st seq = seq1 ^\ k holds
lim seq1 = lim seq
proof end;

theorem Th17: :: LOPBAN_3:17
for X being RealNormSpace
for seq being sequence of X st seq is constant holds
seq is convergent
proof end;

theorem Th18: :: LOPBAN_3:18
for X being RealNormSpace
for seq being sequence of X st ( for n being Element of NAT holds seq . n = 0. X ) holds
seq is norm_summable
proof end;

registration
let X be RealNormSpace;
cluster Relation-like NAT -defined the carrier of X -valued Function-like V11() V14( NAT ) V27( NAT , the carrier of X) norm_summable Element of K21(K22(NAT, the carrier of X));
existence
ex b1 being sequence of X st b1 is norm_summable
proof end;
end;

theorem Th19: :: LOPBAN_3:19
for X being RealNormSpace
for s being sequence of X st s is summable holds
( s is convergent & lim s = 0. X )
proof end;

theorem Th20: :: LOPBAN_3:20
for X being RealNormSpace
for s1, s2 being sequence of X holds (Partial_Sums s1) + (Partial_Sums s2) = Partial_Sums (s1 + s2)
proof end;

theorem Th21: :: LOPBAN_3:21
for X being RealNormSpace
for s1, s2 being sequence of X holds (Partial_Sums s1) - (Partial_Sums s2) = Partial_Sums (s1 - s2)
proof end;

registration
let X be RealNormSpace;
let seq be norm_summable sequence of X;
cluster ||.seq.|| -> summable Real_Sequence;
coherence
for b1 being Real_Sequence st b1 = ||.seq.|| holds
b1 is summable by Def4;
end;

registration
let X be RealNormSpace;
cluster Function-like V27( NAT , the carrier of X) summable -> convergent Element of K21(K22(NAT, the carrier of X));
coherence
for b1 being sequence of X st b1 is summable holds
b1 is convergent by Th19;
end;

theorem Th22: :: LOPBAN_3:22
for X being RealNormSpace
for seq1, seq2 being sequence of X st seq1 is summable & seq2 is summable holds
( seq1 + seq2 is summable & Sum (seq1 + seq2) = (Sum seq1) + (Sum seq2) )
proof end;

theorem Th23: :: LOPBAN_3:23
for X being RealNormSpace
for seq1, seq2 being sequence of X st seq1 is summable & seq2 is summable holds
( seq1 - seq2 is summable & Sum (seq1 - seq2) = (Sum seq1) - (Sum seq2) )
proof end;

registration
let X be RealNormSpace;
let seq1, seq2 be summable sequence of X;
cluster seq1 + seq2 -> summable ;
coherence
seq1 + seq2 is summable by Th22;
cluster seq1 - seq2 -> summable ;
coherence
seq1 - seq2 is summable by Th23;
end;

theorem Th24: :: LOPBAN_3:24
for X being RealNormSpace
for seq being sequence of X
for z being Real holds Partial_Sums (z * seq) = z * (Partial_Sums seq)
proof end;

theorem Th25: :: LOPBAN_3:25
for X being RealNormSpace
for seq being summable sequence of X
for z being Real holds
( z * seq is summable & Sum (z * seq) = z * (Sum seq) )
proof end;

registration
let X be RealNormSpace;
let z be Real;
let seq be summable sequence of X;
cluster z * seq -> summable ;
coherence
z * seq is summable by Th25;
end;

theorem Th26: :: LOPBAN_3:26
for X being RealNormSpace
for s, s1 being sequence of X st ( for n being Element of NAT holds s1 . n = s . 0 ) holds
Partial_Sums (s ^\ 1) = ((Partial_Sums s) ^\ 1) - s1
proof end;

theorem Th27: :: LOPBAN_3:27
for X being RealNormSpace
for s being sequence of X st s is summable holds
for n being Element of NAT holds s ^\ n is summable
proof end;

registration
let X be RealNormSpace;
let seq be summable sequence of X;
let n be Element of NAT ;
cluster seq ^\ n -> summable ;
coherence
seq ^\ n is summable by Th27;
end;

theorem Th28: :: LOPBAN_3:28
for X being RealNormSpace
for seq being sequence of X holds
( Partial_Sums ||.seq.|| is bounded_above iff seq is norm_summable )
proof end;

registration
let X be RealNormSpace;
let seq be norm_summable sequence of X;
cluster Partial_Sums ||.seq.|| -> bounded_above ;
coherence
Partial_Sums ||.seq.|| is bounded_above by Th28;
end;

theorem Th29: :: LOPBAN_3:29
for X being RealBanachSpace
for seq being sequence of X holds
( seq is summable iff for p being Real st 0 < p holds
ex n being Element of NAT st
for m being Element of NAT st n <= m holds
||.(((Partial_Sums seq) . m) - ((Partial_Sums seq) . n)).|| < p )
proof end;

theorem Th30: :: LOPBAN_3:30
for X being RealNormSpace
for s being sequence of X
for n, m being Element of NAT st n <= m holds
||.(((Partial_Sums s) . m) - ((Partial_Sums s) . n)).|| <= abs (((Partial_Sums ||.s.||) . m) - ((Partial_Sums ||.s.||) . n))
proof end;

theorem Th31: :: LOPBAN_3:31
for X being RealBanachSpace
for seq being sequence of X st seq is norm_summable holds
seq is summable
proof end;

theorem :: LOPBAN_3:32
for X being RealNormSpace
for rseq1 being Real_Sequence
for seq2 being sequence of X st rseq1 is summable & ex m being Element of NAT st
for n being Element of NAT st m <= n holds
||.(seq2 . n).|| <= rseq1 . n holds
seq2 is norm_summable
proof end;

theorem :: LOPBAN_3:33
for X being RealNormSpace
for seq1, seq2 being sequence of X st ( for n being Element of NAT holds
( 0 <= ||.seq1.|| . n & ||.seq1.|| . n <= ||.seq2.|| . n ) ) & seq2 is norm_summable holds
( seq1 is norm_summable & Sum ||.seq1.|| <= Sum ||.seq2.|| )
proof end;

theorem :: LOPBAN_3:34
for X being RealNormSpace
for seq being sequence of X st ( for n being Element of NAT holds ||.seq.|| . n > 0 ) & ex m being Element of NAT st
for n being Element of NAT st n >= m holds
(||.seq.|| . (n + 1)) / (||.seq.|| . n) >= 1 holds
not seq is norm_summable by SERIES_1:31;

theorem :: LOPBAN_3:35
for X being RealNormSpace
for seq being sequence of X
for rseq1 being Real_Sequence st ( for n being Element of NAT holds rseq1 . n = n -root (||.seq.|| . n) ) & rseq1 is convergent & lim rseq1 < 1 holds
seq is norm_summable
proof end;

theorem :: LOPBAN_3:36
for X being RealNormSpace
for seq being sequence of X
for rseq1 being Real_Sequence st ( for n being Element of NAT holds rseq1 . n = n -root (||.seq.|| . n) ) & ex m being Element of NAT st
for n being Element of NAT st m <= n holds
rseq1 . n >= 1 holds
not ||.seq.|| is summable
proof end;

theorem :: LOPBAN_3:37
for X being RealNormSpace
for seq being sequence of X
for rseq1 being Real_Sequence st ( for n being Element of NAT holds rseq1 . n = n -root (||.seq.|| . n) ) & rseq1 is convergent & lim rseq1 > 1 holds
not seq is norm_summable
proof end;

theorem :: LOPBAN_3:38
for X being RealNormSpace
for seq being sequence of X
for rseq1 being Real_Sequence st ||.seq.|| is non-increasing & ( for n being Element of NAT holds rseq1 . n = (2 to_power n) * (||.seq.|| . (2 to_power n)) ) holds
( seq is norm_summable iff rseq1 is summable )
proof end;

theorem :: LOPBAN_3:39
for X being RealNormSpace
for seq being sequence of X
for p being Real st p > 1 & ( for n being Element of NAT st n >= 1 holds
||.seq.|| . n = 1 / (n to_power p) ) holds
seq is norm_summable
proof end;

theorem :: LOPBAN_3:40
for X being RealNormSpace
for seq being sequence of X
for p being Real st p <= 1 & ( for n being Element of NAT st n >= 1 holds
||.seq.|| . n = 1 / (n to_power p) ) holds
not seq is norm_summable by SERIES_1:37;

theorem :: LOPBAN_3:41
for X being RealNormSpace
for seq being sequence of X
for rseq1 being Real_Sequence st ( for n being Element of NAT holds
( seq . n <> 0. X & rseq1 . n = (||.seq.|| . (n + 1)) / (||.seq.|| . n) ) ) & rseq1 is convergent & lim rseq1 < 1 holds
seq is norm_summable
proof end;

theorem :: LOPBAN_3:42
for X being RealNormSpace
for seq being sequence of X st ( for n being Element of NAT holds seq . n <> 0. X ) & ex m being Element of NAT st
for n being Element of NAT st n >= m holds
(||.seq.|| . (n + 1)) / (||.seq.|| . n) >= 1 holds
not seq is norm_summable
proof end;

registration
let X be RealBanachSpace;
cluster Function-like V27( NAT , the carrier of X) norm_summable -> summable Element of K21(K22(NAT, the carrier of X));
coherence
for b1 being sequence of X st b1 is norm_summable holds
b1 is summable by Th31;
end;

begin

theorem Th43: :: LOPBAN_3:43
for X being Banach_Algebra
for x, y, z being Element of X
for a, b being Real holds
( x + y = y + x & (x + y) + z = x + (y + z) & x + (0. X) = x & ex t being Element of X st x + t = 0. X & (x * y) * z = x * (y * z) & 1 * x = x & 0 * x = 0. X & a * (0. X) = 0. X & (- 1) * x = - x & x * (1. X) = x & (1. X) * x = x & x * (y + z) = (x * y) + (x * z) & (y + z) * x = (y * x) + (z * x) & a * (x * y) = (a * x) * y & a * (x + y) = (a * x) + (a * y) & (a + b) * x = (a * x) + (b * x) & (a * b) * x = a * (b * x) & (a * b) * (x * y) = (a * x) * (b * y) & a * (x * y) = x * (a * y) & (0. X) * x = 0. X & x * (0. X) = 0. X & x * (y - z) = (x * y) - (x * z) & (y - z) * x = (y * x) - (z * x) & (x + y) - z = x + (y - z) & (x - y) + z = x - (y - z) & (x - y) - z = x - (y + z) & x + y = (x - z) + (z + y) & x - y = (x - z) + (z - y) & x = (x - y) + y & x = y - (y - x) & ( ||.x.|| = 0 implies x = 0. X ) & ( x = 0. X implies ||.x.|| = 0 ) & ||.(a * x).|| = (abs a) * ||.x.|| & ||.(x + y).|| <= ||.x.|| + ||.y.|| & ||.(x * y).|| <= ||.x.|| * ||.y.|| & ||.(1. X).|| = 1 & X is complete )
proof end;

registration
cluster non empty right_complementable Abelian add-associative right_zeroed vector-distributive scalar-distributive scalar-associative scalar-unital V130() V131() RealNormSpace-like V149() associative right-distributive right_unital Banach_Algebra-like -> well-unital Normed_AlgebraStr ;
coherence
for b1 being Banach_Algebra holds b1 is well-unital
proof end;
end;

definition
let X be non empty associative well-unital multLoopStr ;
let v be Element of X;
canceled;
canceled;
canceled;
redefine attr v is invertible means :Def8: :: LOPBAN_3:def 8
 ex w being Element of X st
( v * w = 1. X & w * v = 1. X );
compatibility
( v is invertible iff ex w being Element of X st
( v * w = 1. X & w * v = 1. X ) )
proof end;
end;

:: deftheorem LOPBAN_3:def 5 :
canceled;

:: deftheorem LOPBAN_3:def 6 :
canceled;

:: deftheorem LOPBAN_3:def 7 :
canceled;

:: deftheorem Def8 defines invertible LOPBAN_3:def 8 :
for X being non empty associative well-unital multLoopStr
for v being Element of X holds
( v is invertible iff ex w being Element of X st
( v * w = 1. X & w * v = 1. X ) );

definition
let X be non empty Normed_AlgebraStr ;
let S be sequence of X;
let a be Element of X;
func a * S -> sequence of X means :: LOPBAN_3:def 9
 for n being Element of NAT holds it . n = a * (S . n);
existence
ex b1 being sequence of X st
for n being Element of NAT holds b1 . n = a * (S . n)
proof end;
uniqueness
for b1, b2 being sequence of X st ( for n being Element of NAT holds b1 . n = a * (S . n) ) & ( for n being Element of NAT holds b2 . n = a * (S . n) ) holds
b1 = b2
proof end;
end;

:: deftheorem defines * LOPBAN_3:def 9 :
for X being non empty Normed_AlgebraStr
for S being sequence of X
for a being Element of X
for b4 being sequence of X holds
( b4 = a * S iff for n being Element of NAT holds b4 . n = a * (S . n) );

definition
let X be non empty Normed_AlgebraStr ;
let S be sequence of X;
let a be Element of X;
func S * a -> sequence of X means :: LOPBAN_3:def 10
 for n being Element of NAT holds it . n = (S . n) * a;
existence
ex b1 being sequence of X st
for n being Element of NAT holds b1 . n = (S . n) * a
proof end;
uniqueness
for b1, b2 being sequence of X st ( for n being Element of NAT holds b1 . n = (S . n) * a ) & ( for n being Element of NAT holds b2 . n = (S . n) * a ) holds
b1 = b2
proof end;
end;

:: deftheorem defines * LOPBAN_3:def 10 :
for X being non empty Normed_AlgebraStr
for S being sequence of X
for a being Element of X
for b4 being sequence of X holds
( b4 = S * a iff for n being Element of NAT holds b4 . n = (S . n) * a );

definition
let X be non empty Normed_AlgebraStr ;
let seq1, seq2 be sequence of X;
func seq1 * seq2 -> sequence of X means :: LOPBAN_3:def 11
 for n being Element of NAT holds it . n = (seq1 . n) * (seq2 . n);
existence
ex b1 being sequence of X st
for n being Element of NAT holds b1 . n = (seq1 . n) * (seq2 . n)
proof end;
uniqueness
for b1, b2 being sequence of X st ( for n being Element of NAT holds b1 . n = (seq1 . n) * (seq2 . n) ) & ( for n being Element of NAT holds b2 . n = (seq1 . n) * (seq2 . n) ) holds
b1 = b2
proof end;
end;

:: deftheorem defines * LOPBAN_3:def 11 :
for X being non empty Normed_AlgebraStr
for seq1, seq2, b4 being sequence of X holds
( b4 = seq1 * seq2 iff for n being Element of NAT holds b4 . n = (seq1 . n) * (seq2 . n) );

notation
let X be non empty associative well-unital multLoopStr ;
let x be Element of X;
synonym x " for / x;
end;

definition
let X be non empty associative well-unital multLoopStr ;
let x be Element of X;
assume A1: x is invertible ;
redefine func / x means :Def12: :: LOPBAN_3:def 12
( x * it = 1. X & it * x = 1. X );
compatibility
for b1 being Element of the carrier of X holds
( b1 = x " iff ( x * b1 = 1. X & b1 * x = 1. X ) )
proof end;
end;

:: deftheorem Def12 defines " LOPBAN_3:def 12 :
for X being non empty associative well-unital multLoopStr
for x being Element of X st x is invertible holds
for b3 being Element of the carrier of X holds
( b3 = x " iff ( x * b3 = 1. X & b3 * x = 1. X ) );

definition
let X be Banach_Algebra;
let z be Element of X;
func z GeoSeq -> sequence of X means :Def13: :: LOPBAN_3:def 13
( it . 0 = 1. X & ( for n being Element of NAT holds it . (n + 1) = (it . n) * z ) );
existence
ex b1 being sequence of X st
( b1 . 0 = 1. X & ( for n being Element of NAT holds b1 . (n + 1) = (b1 . n) * z ) )
proof end;
uniqueness
for b1, b2 being sequence of X st b1 . 0 = 1. X & ( for n being Element of NAT holds b1 . (n + 1) = (b1 . n) * z ) & b2 . 0 = 1. X & ( for n being Element of NAT holds b2 . (n + 1) = (b2 . n) * z ) holds
b1 = b2
proof end;
end;

:: deftheorem Def13 defines GeoSeq LOPBAN_3:def 13 :
for X being Banach_Algebra
for z being Element of X
for b3 being sequence of X holds
( b3 = z GeoSeq iff ( b3 . 0 = 1. X & ( for n being Element of NAT holds b3 . (n + 1) = (b3 . n) * z ) ) );

definition
let X be Banach_Algebra;
let z be Element of X;
let n be Element of NAT ;
func z #N n -> Element of X equals :: LOPBAN_3:def 14
(z GeoSeq) . n;
correctness
coherence
(z GeoSeq) . n is Element of X;
;
end;

:: deftheorem defines #N LOPBAN_3:def 14 :
for X being Banach_Algebra
for z being Element of X
for n being Element of NAT holds z #N n = (z GeoSeq) . n;

theorem :: LOPBAN_3:44
for X being Banach_Algebra
for z being Element of X holds z #N 0 = 1. X by Def13;

theorem Th45: :: LOPBAN_3:45
for X being Banach_Algebra
for z being Element of X st ||.z.|| < 1 holds
( z GeoSeq is summable & z GeoSeq is norm_summable )
proof end;

theorem :: LOPBAN_3:46
for X being Banach_Algebra
for x being Point of X st ||.((1. X) - x).|| < 1 holds
( ((1. X) - x) GeoSeq is summable & ((1. X) - x) GeoSeq is norm_summable ) by Th45;

Lm1: for X being RealNormSpace
for x being Point of X st ( for e being Real st e > 0 holds
||.x.|| < e ) holds
x = 0. X
proof end;

Lm2: for X being RealNormSpace
for x, y being Point of X st ( for e being Real st e > 0 holds
||.(x - y).|| < e ) holds
x = y
proof end;

Lm3: for X being RealNormSpace
for x, y being Point of X
for seq being Real_Sequence st seq is convergent & lim seq = 0 & ( for n being Element of NAT holds ||.(x - y).|| <= seq . n ) holds
x = y
proof end;

theorem :: LOPBAN_3:47
for X being Banach_Algebra
for x being Point of X st ||.((1. X) - x).|| < 1 holds
( x is invertible & x " = Sum (((1. X) - x) GeoSeq) )
proof end;