:: BHSP_4 semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

deffunc H1( RealUnitarySpace) -> Element of the carrier of $1 = 0. $1;

scheme :: BHSP_4:sch 1
RecFuncExRUS{ F1() -> RealUnitarySpace, F2() -> Point of F1(), F3( Nat, Point of F1()) -> Point of F1() } :
ex f being Function of NAT ,the carrier of F1() st
( f . 0 = F2() & ( for n being Element of NAT
for x being Point of F1() st x = f . n holds
f . (n + 1) = F3(n,x) ) )
proof end;

definition
let X be RealUnitarySpace;
let seq be sequence of X;
func Partial_Sums seq -> sequence of X means :Def1: :: BHSP_4:def 1
( it . 0 = seq . 0 & ( for n being Nat holds it . (n + 1) = (it . n) + (seq . (n + 1)) ) );
existence
ex b1 being sequence of X st
( b1 . 0 = seq . 0 & ( for n being Nat holds b1 . (n + 1) = (b1 . n) + (seq . (n + 1)) ) )
proof end;
uniqueness
for b1, b2 being sequence of X st b1 . 0 = seq . 0 & ( for n being Nat holds b1 . (n + 1) = (b1 . n) + (seq . (n + 1)) ) & b2 . 0 = seq . 0 & ( for n being Nat holds b2 . (n + 1) = (b2 . n) + (seq . (n + 1)) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines Partial_Sums BHSP_4:def 1 :
for X being RealUnitarySpace
for seq, b3 being sequence of X holds
( b3 = Partial_Sums seq iff ( b3 . 0 = seq . 0 & ( for n being Nat holds b3 . (n + 1) = (b3 . n) + (seq . (n + 1)) ) ) );

theorem Th1: :: BHSP_4:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq1, seq2 being sequence of X holds (Partial_Sums seq1) + (Partial_Sums seq2) = Partial_Sums (seq1 + seq2)
proof end;

theorem Th2: :: BHSP_4:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq1, seq2 being sequence of X holds (Partial_Sums seq1) - (Partial_Sums seq2) = Partial_Sums (seq1 - seq2)
proof end;

theorem Th3: :: BHSP_4:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for a being Real
for seq being sequence of X holds Partial_Sums (a * seq) = a * (Partial_Sums seq)
proof end;

theorem :: BHSP_4:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Partial_Sums (- seq) = - (Partial_Sums seq)
proof end;

theorem :: BHSP_4:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for a, b being Real
for seq1, seq2 being sequence of X holds (a * (Partial_Sums seq1)) + (b * (Partial_Sums seq2)) = Partial_Sums ((a * seq1) + (b * seq2))
proof end;

definition
let X be RealUnitarySpace;
let seq be sequence of X;
attr seq is summable means :Def2: :: BHSP_4:def 2
Partial_Sums seq is convergent;
func Sum seq -> Point of X equals :: BHSP_4:def 3
lim (Partial_Sums seq);
coherence
lim (Partial_Sums seq) is Point of X
;
end;

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

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

theorem :: BHSP_4:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
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 :: BHSP_4:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
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 :: BHSP_4:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for a being Real
for seq being sequence of X st seq is summable holds
( a * seq is summable & Sum (a * seq) = a * (Sum seq) )
proof end;

theorem Th9: :: BHSP_4:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st seq is summable holds
( seq is convergent & lim seq = 0. X )
proof end;

theorem Th10: :: BHSP_4:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st X is_Hilbert_space holds
( seq is summable iff for r being Real st r > 0 holds
ex k being Nat st
for n, m being Nat st n >= k & m >= k holds
||.(((Partial_Sums seq) . n) - ((Partial_Sums seq) . m)).|| < r )
proof end;

theorem :: BHSP_4:11  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st seq is summable holds
Partial_Sums seq is bounded
proof end;

theorem Th12: :: BHSP_4:12  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq, seq1 being sequence of X st ( for n being Nat holds seq1 . n = seq . 0 ) holds
Partial_Sums (seq ^\ 1) = ((Partial_Sums seq) ^\ 1) - seq1
proof end;

theorem Th13: :: BHSP_4:13  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st seq is summable holds
for k being Nat holds seq ^\ k is summable
proof end;

theorem :: BHSP_4:14  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st ex k being Nat st seq ^\ k is summable holds
seq is summable
proof end;

definition
let X be RealUnitarySpace;
let seq be sequence of X;
let n be Nat;
func Sum seq,n -> Point of X equals :: BHSP_4:def 4
(Partial_Sums seq) . n;
coherence
(Partial_Sums seq) . n is Point of X
;
end;

:: deftheorem defines Sum BHSP_4:def 4 :
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds Sum seq,n = (Partial_Sums seq) . n;

theorem :: BHSP_4:15  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem Th16: :: BHSP_4:16  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Sum seq,0 = seq . 0 by Def1;

theorem Th17: :: BHSP_4:17  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Sum seq,1 = (Sum seq,0) + (seq . 1)
proof end;

theorem Th18: :: BHSP_4:18  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Sum seq,1 = (seq . 0) + (seq . 1)
proof end;

theorem Th19: :: BHSP_4:19  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds Sum seq,(n + 1) = (Sum seq,n) + (seq . (n + 1)) by Def1;

theorem Th20: :: BHSP_4:20  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds seq . (n + 1) = (Sum seq,(n + 1)) - (Sum seq,n)
proof end;

theorem :: BHSP_4:21  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds seq . 1 = (Sum seq,1) - (Sum seq,0)
proof end;

definition
let X be RealUnitarySpace;
let seq be sequence of X;
let n, m be Nat;
func Sum seq,n,m -> Point of X equals :: BHSP_4:def 5
(Sum seq,n) - (Sum seq,m);
coherence
(Sum seq,n) - (Sum seq,m) is Point of X
;
end;

:: deftheorem defines Sum BHSP_4:def 5 :
for X being RealUnitarySpace
for seq being sequence of X
for n, m being Nat holds Sum seq,n,m = (Sum seq,n) - (Sum seq,m);

theorem :: BHSP_4:22  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: BHSP_4:23  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Sum seq,1,0 = seq . 1
proof end;

theorem :: BHSP_4:24  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds Sum seq,(n + 1),n = seq . (n + 1) by Th20;

theorem Th25: :: BHSP_4:25  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st X is_Hilbert_space holds
( seq is summable iff for r being Real st r > 0 holds
ex k being Nat st
for n, m being Nat st n >= k & m >= k holds
||.((Sum seq,n) - (Sum seq,m)).|| < r )
proof end;

theorem :: BHSP_4:26  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st X is_Hilbert_space holds
( seq is summable iff for r being Real st r > 0 holds
ex k being Nat st
for n, m being Nat st n >= k & m >= k holds
||.(Sum seq,n,m).|| < r )
proof end;

definition
let Rseq be Real_Sequence;
let n be Nat;
func Sum Rseq,n -> Real equals :: BHSP_4:def 6
(Partial_Sums Rseq) . n;
coherence
(Partial_Sums Rseq) . n is Real
;
end;

:: deftheorem defines Sum BHSP_4:def 6 :
for Rseq being Real_Sequence
for n being Nat holds Sum Rseq,n = (Partial_Sums Rseq) . n;

definition
let Rseq be Real_Sequence;
let n, m be Nat;
func Sum Rseq,n,m -> Real equals :: BHSP_4:def 7
(Sum Rseq,n) - (Sum Rseq,m);
coherence
(Sum Rseq,n) - (Sum Rseq,m) is Real
;
end;

:: deftheorem defines Sum BHSP_4:def 7 :
for Rseq being Real_Sequence
for n, m being Nat holds Sum Rseq,n,m = (Sum Rseq,n) - (Sum Rseq,m);

definition
let X be RealUnitarySpace;
let seq be sequence of X;
attr seq is absolutely_summable means :Def8: :: BHSP_4:def 8
||.seq.|| is summable;
end;

:: deftheorem Def8 defines absolutely_summable BHSP_4:def 8 :
for X being RealUnitarySpace
for seq being sequence of X holds
( seq is absolutely_summable iff ||.seq.|| is summable );

theorem :: BHSP_4:27  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq1, seq2 being sequence of X st seq1 is absolutely_summable & seq2 is absolutely_summable holds
seq1 + seq2 is absolutely_summable
proof end;

theorem :: BHSP_4:28  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for a being Real
for seq being sequence of X st seq is absolutely_summable holds
a * seq is absolutely_summable
proof end;

theorem :: BHSP_4:29  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds ||.seq.|| . n <= Rseq . n ) & Rseq is summable holds
seq is absolutely_summable
proof end;

theorem :: BHSP_4:30  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds
( seq . n <> 0. X & Rseq . n = ||.(seq . (n + 1)).|| / ||.(seq . n).|| ) ) & Rseq is convergent & lim Rseq < 1 holds
seq is absolutely_summable
proof end;

theorem Th31: :: BHSP_4:31  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for r being Real
for seq being sequence of X st r > 0 & ex m being Nat st
for n being Nat st n >= m holds
||.(seq . n).|| >= r & seq is convergent holds
lim seq <> 0. X
proof end;

theorem Th32: :: BHSP_4:32  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st ( for n being Nat holds seq . n <> 0. X ) & ex m being Nat st
for n being Nat st n >= m holds
||.(seq . (n + 1)).|| / ||.(seq . n).|| >= 1 holds
not seq is summable
proof end;

theorem :: BHSP_4:33  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds seq . n <> 0. X ) & ( for n being Nat holds Rseq . n = ||.(seq . (n + 1)).|| / ||.(seq . n).|| ) & Rseq is convergent & lim Rseq > 1 holds
not seq is summable
proof end;

theorem :: BHSP_4:34  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds Rseq . n = n -root ||.(seq . n).|| ) & Rseq is convergent & lim Rseq < 1 holds
seq is absolutely_summable
proof end;

theorem :: BHSP_4:35  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds Rseq . n = n -root (||.seq.|| . n) ) & ex m being Nat st
for n being Nat st n >= m holds
Rseq . n >= 1 holds
not seq is summable
proof end;

theorem :: BHSP_4:36  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st ( for n being Nat holds Rseq . n = n -root (||.seq.|| . n) ) & Rseq is convergent & lim Rseq > 1 holds
not seq is summable
proof end;

theorem Th37: :: BHSP_4:37  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X holds Partial_Sums ||.seq.|| is non-decreasing
proof end;

theorem :: BHSP_4:38  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds (Partial_Sums ||.seq.||) . n >= 0
proof end;

theorem Th39: :: BHSP_4:39  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds ||.((Partial_Sums seq) . n).|| <= (Partial_Sums ||.seq.||) . n
proof end;

theorem :: BHSP_4:40  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n being Nat holds ||.(Sum seq,n).|| <= Sum ||.seq.||,n by Th39;

theorem Th41: :: BHSP_4:41  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n, m being Nat holds ||.(((Partial_Sums seq) . m) - ((Partial_Sums seq) . n)).|| <= abs (((Partial_Sums ||.seq.||) . m) - ((Partial_Sums ||.seq.||) . n))
proof end;

theorem Th42: :: BHSP_4:42  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n, m being Nat holds ||.((Sum seq,m) - (Sum seq,n)).|| <= abs ((Sum ||.seq.||,m) - (Sum ||.seq.||,n)) by Th41;

theorem :: BHSP_4:43  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for n, m being Nat holds ||.(Sum seq,m,n).|| <= abs (Sum ||.seq.||,m,n) by Th42;

theorem :: BHSP_4:44  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X st X is_Hilbert_space & seq is absolutely_summable holds
seq is summable
proof end;

definition
let X be RealUnitarySpace;
let seq be sequence of X;
let Rseq be Real_Sequence;
func Rseq * seq -> sequence of X means :Def9: :: BHSP_4:def 9
for n being Nat holds it . n = (Rseq . n) * (seq . n);
existence
ex b1 being sequence of X st
for n being Nat holds b1 . n = (Rseq . n) * (seq . n)
proof end;
uniqueness
for b1, b2 being sequence of X st ( for n being Nat holds b1 . n = (Rseq . n) * (seq . n) ) & ( for n being Nat holds b2 . n = (Rseq . n) * (seq . n) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def9 defines * BHSP_4:def 9 :
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence
for b4 being sequence of X holds
( b4 = Rseq * seq iff for n being Nat holds b4 . n = (Rseq . n) * (seq . n) );

theorem :: BHSP_4:45  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq1, seq2 being sequence of X
for Rseq being Real_Sequence holds Rseq * (seq1 + seq2) = (Rseq * seq1) + (Rseq * seq2)
proof end;

theorem :: BHSP_4:46  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq1, Rseq2 being Real_Sequence holds (Rseq1 + Rseq2) * seq = (Rseq1 * seq) + (Rseq2 * seq)
proof end;

theorem :: BHSP_4:47  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq1, Rseq2 being Real_Sequence holds (Rseq1 (#) Rseq2) * seq = Rseq1 * (Rseq2 * seq)
proof end;

theorem Th48: :: BHSP_4:48  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for a being Real
for seq being sequence of X
for Rseq being Real_Sequence holds (a (#) Rseq) * seq = a * (Rseq * seq)
proof end;

theorem :: BHSP_4:49  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence holds Rseq * (- seq) = (- Rseq) * seq
proof end;

theorem Th50: :: BHSP_4:50  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st Rseq is convergent & seq is convergent holds
Rseq * seq is convergent
proof end;

theorem :: BHSP_4:51  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st Rseq is bounded & seq is bounded holds
Rseq * seq is bounded
proof end;

theorem :: BHSP_4:52  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st Rseq is convergent & seq is convergent holds
( Rseq * seq is convergent & lim (Rseq * seq) = (lim Rseq) * (lim seq) )
proof end;

definition
let Rseq be Real_Sequence;
attr Rseq is Cauchy means :Def10: :: BHSP_4:def 10
for r being Real st r > 0 holds
ex k being Nat st
for n, m being Nat st n >= k & m >= k holds
abs ((Rseq . n) - (Rseq . m)) < r;
end;

:: deftheorem Def10 defines Cauchy BHSP_4:def 10 :
for Rseq being Real_Sequence holds
( Rseq is Cauchy iff for r being Real st r > 0 holds
ex k being Nat st
for n, m being Nat st n >= k & m >= k holds
abs ((Rseq . n) - (Rseq . m)) < r );

notation
let Rseq be Real_Sequence;
synonym Rseq is_Cauchy_sequence for Cauchy Rseq;
end;

theorem :: BHSP_4:53  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence st X is_Hilbert_space & seq is_Cauchy_sequence & Rseq is_Cauchy_sequence holds
Rseq * seq is_Cauchy_sequence
proof end;

theorem Th54: :: BHSP_4:54  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence
for n being Nat holds (Partial_Sums ((Rseq - (Rseq ^\ 1)) * (Partial_Sums seq))) . n = ((Partial_Sums (Rseq * seq)) . (n + 1)) - ((Rseq * (Partial_Sums seq)) . (n + 1))
proof end;

theorem Th55: :: BHSP_4:55  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence
for n being Nat holds (Partial_Sums (Rseq * seq)) . (n + 1) = ((Rseq * (Partial_Sums seq)) . (n + 1)) - ((Partial_Sums (((Rseq ^\ 1) - Rseq) * (Partial_Sums seq))) . n)
proof end;

theorem :: BHSP_4:56  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being RealUnitarySpace
for seq being sequence of X
for Rseq being Real_Sequence
for n being Nat holds Sum (Rseq * seq),(n + 1) = ((Rseq * (Partial_Sums seq)) . (n + 1)) - (Sum (((Rseq ^\ 1) - Rseq) * (Partial_Sums seq)),n) by Th55;