:: CSSPACE3 semantic presentation

definition
func the_set_of_l1ComplexSequences -> Subset of Linear_Space_of_ComplexSequences means :Def1: :: CSSPACE3:def 1
for b1 being set holds
( b1 in a1 iff ( b1 in the_set_of_ComplexSequences & seq_id b1 is absolutely_summable ) );
existence
ex b1 being Subset of Linear_Space_of_ComplexSequences st
for b2 being set holds
( b2 in b1 iff ( b2 in the_set_of_ComplexSequences & seq_id b2 is absolutely_summable ) )
proof end;
uniqueness
for b1, b2 being Subset of Linear_Space_of_ComplexSequences st ( for b3 being set holds
( b3 in b1 iff ( b3 in the_set_of_ComplexSequences & seq_id b3 is absolutely_summable ) ) ) & ( for b3 being set holds
( b3 in b2 iff ( b3 in the_set_of_ComplexSequences & seq_id b3 is absolutely_summable ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines the_set_of_l1ComplexSequences CSSPACE3:def 1 :
for b1 being Subset of Linear_Space_of_ComplexSequences holds
( b1 = the_set_of_l1ComplexSequences iff for b2 being set holds
( b2 in b1 iff ( b2 in the_set_of_ComplexSequences & seq_id b2 is absolutely_summable ) ) );

theorem Th1: :: CSSPACE3:1
for b1 being Complex
for b2 being Complex_Sequence
for b3 being Real_Sequence st b2 is convergent & ( for b4 being Nat holds b3 . b4 = |.((b2 . b4) - b1).| ) holds
( b3 is convergent & lim b3 = |.((lim b2) - b1).| )
proof end;

registration
cluster the_set_of_l1ComplexSequences -> non empty ;
coherence
not the_set_of_l1ComplexSequences is empty
proof end;
end;

registration
cluster the_set_of_l1ComplexSequences -> non empty lineary-closed ;
coherence
the_set_of_l1ComplexSequences is lineary-closed
proof end;
end;

Lemma3: CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is Subspace of Linear_Space_of_ComplexSequences
by CSSPACE:13;

registration
cluster CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) -> Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ;
coherence
( CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is Abelian & CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is add-associative & CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is right_zeroed & CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is right_complementable & CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is ComplexLinearSpace-like )
by CSSPACE:13;
end;

Lemma4: CLSStruct(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ) #) is ComplexLinearSpace
;

Lemma5: ex b1 being Function of the_set_of_l1ComplexSequences , REAL st
for b2 being set st b2 in the_set_of_l1ComplexSequences holds
b1 . b2 = Sum |.(seq_id b2).|
proof end;

definition
func cl_norm -> Function of the_set_of_l1ComplexSequences , REAL means :Def2: :: CSSPACE3:def 2
for b1 being set st b1 in the_set_of_l1ComplexSequences holds
a1 . b1 = Sum |.(seq_id b1).|;
existence
ex b1 being Function of the_set_of_l1ComplexSequences , REAL st
for b2 being set st b2 in the_set_of_l1ComplexSequences holds
b1 . b2 = Sum |.(seq_id b2).|
by Lemma5;
uniqueness
for b1, b2 being Function of the_set_of_l1ComplexSequences , REAL st ( for b3 being set st b3 in the_set_of_l1ComplexSequences holds
b1 . b3 = Sum |.(seq_id b3).| ) & ( for b3 being set st b3 in the_set_of_l1ComplexSequences holds
b2 . b3 = Sum |.(seq_id b3).| ) holds
b1 = b2
proof end;
end;

:: deftheorem Def2 defines cl_norm CSSPACE3:def 2 :
for b1 being Function of the_set_of_l1ComplexSequences , REAL holds
( b1 = cl_norm iff for b2 being set st b2 in the_set_of_l1ComplexSequences holds
b1 . b2 = Sum |.(seq_id b2).| );

registration
let c1 be non empty set ;
let c2 be Element of c1;
let c3 be BinOp of c1;
let c4 be Function of [:COMPLEX ,c1:],c1;
let c5 be Function of c1, REAL ;
cluster CNORMSTR(# a1,a2,a3,a4,a5 #) -> non empty ;
coherence
not CNORMSTR(# c1,c2,c3,c4,c5 #) is empty
by STRUCT_0:def 1;
end;

theorem Th2: :: CSSPACE3:2
canceled;

theorem Th3: :: CSSPACE3:3
canceled;

theorem Th4: :: CSSPACE3:4
for b1 being CNORMSTR st CLSStruct(# the carrier of b1,the Zero of b1,the add of b1,the Mult of b1 #) is ComplexLinearSpace holds
b1 is ComplexLinearSpace
proof end;

theorem Th5: :: CSSPACE3:5
for b1 being Complex_Sequence st ( for b2 being Nat holds b1 . b2 = 0c ) holds
( b1 is absolutely_summable & Sum |.b1.| = 0 )
proof end;

theorem Th6: :: CSSPACE3:6
for b1 being Complex_Sequence st b1 is absolutely_summable & Sum |.b1.| = 0 holds
for b2 being Nat holds b1 . b2 = 0c
proof end;

theorem Th7: :: CSSPACE3:7
CNORMSTR(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),cl_norm #) is ComplexLinearSpace by Lemma4, Th4;

definition
func Complex_l1_Space -> non empty CNORMSTR equals :: CSSPACE3:def 3
CNORMSTR(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),cl_norm #);
coherence
CNORMSTR(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),cl_norm #) is non empty CNORMSTR
;
end;

:: deftheorem Def3 defines Complex_l1_Space CSSPACE3:def 3 :
Complex_l1_Space = CNORMSTR(# the_set_of_l1ComplexSequences ,(Zero_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Add_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),(Mult_ the_set_of_l1ComplexSequences ,Linear_Space_of_ComplexSequences ),cl_norm #);

theorem Th8: :: CSSPACE3:8
( the carrier of Complex_l1_Space = the_set_of_l1ComplexSequences & ( for b1 being set holds
( b1 is VECTOR of Complex_l1_Space iff ( b1 is Complex_Sequence & seq_id b1 is absolutely_summable ) ) ) & 0. Complex_l1_Space = CZeroseq & ( for b1 being VECTOR of Complex_l1_Space holds b1 = seq_id b1 ) & ( for b1, b2 being VECTOR of Complex_l1_Space holds b1 + b2 = (seq_id b1) + (seq_id b2) ) & ( for b1 being Complex
for b2 being VECTOR of Complex_l1_Space holds b1 * b2 = b1 (#) (seq_id b2) ) & ( for b1 being VECTOR of Complex_l1_Space holds
( - b1 = - (seq_id b1) & seq_id (- b1) = - (seq_id b1) ) ) & ( for b1, b2 being VECTOR of Complex_l1_Space holds b1 - b2 = (seq_id b1) - (seq_id b2) ) & ( for b1 being VECTOR of Complex_l1_Space holds seq_id b1 is absolutely_summable ) & ( for b1 being VECTOR of Complex_l1_Space holds ||.b1.|| = Sum |.(seq_id b1).| ) )
proof end;

theorem Th9: :: CSSPACE3:9
for b1, b2 being Point of Complex_l1_Space
for b3 being Complex holds
( ( ||.b1.|| = 0 implies b1 = 0. Complex_l1_Space ) & ( b1 = 0. Complex_l1_Space implies ||.b1.|| = 0 ) & 0 <= ||.b1.|| & ||.(b1 + b2).|| <= ||.b1.|| + ||.b2.|| & ||.(b3 * b1).|| = |.b3.| * ||.b1.|| )
proof end;

registration
cluster Complex_l1_Space -> non empty Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ComplexNormSpace-like ;
coherence
( Complex_l1_Space is ComplexNormSpace-like & Complex_l1_Space is ComplexLinearSpace-like & Complex_l1_Space is Abelian & Complex_l1_Space is add-associative & Complex_l1_Space is right_zeroed & Complex_l1_Space is right_complementable )
by Lemma4, Th4, Th9, CLVECT_1:def 10;
end;

Lemma13: for b1 being Complex
for b2 being Complex_Sequence
for b3 being Real_Sequence st b2 is convergent & b3 is convergent holds
for b4 being Real_Sequence st ( for b5 being Nat holds b4 . b5 = |.((b2 . b5) - b1).| + (b3 . b5) ) holds
( b4 is convergent & lim b4 = |.((lim b2) - b1).| + (lim b3) )
proof end;

definition
let c1 be non empty CNORMSTR ;
let c2, c3 be Point of c1;
func dist c2,c3 -> Real equals :: CSSPACE3:def 4
||.(a2 - a3).||;
coherence
||.(c2 - c3).|| is Real
;
end;

:: deftheorem Def4 defines dist CSSPACE3:def 4 :
for b1 being non empty CNORMSTR
for b2, b3 being Point of b1 holds dist b2,b3 = ||.(b2 - b3).||;

definition
let c1 be non empty CNORMSTR ;
let c2 be sequence of c1;
attr a2 is CCauchy means :Def5: :: CSSPACE3:def 5
for b1 being Real st b1 > 0 holds
ex b2 being Nat st
for b3, b4 being Nat st b3 >= b2 & b4 >= b2 holds
dist (a2 . b3),(a2 . b4) < b1;
end;

:: deftheorem Def5 defines CCauchy CSSPACE3:def 5 :
for b1 being non empty CNORMSTR
for b2 being sequence of b1 holds
( b2 is CCauchy iff for b3 being Real st b3 > 0 holds
ex b4 being Nat st
for b5, b6 being Nat st b5 >= b4 & b6 >= b4 holds
dist (b2 . b5),(b2 . b6) < b3 );

notation
let c1 be non empty CNORMSTR ;
let c2 be sequence of c1;
synonym Cauchy_sequence_by_Norm c2 for CCauchy c2;
end;

theorem Th10: :: CSSPACE3:10
for b1 being non empty ComplexNormSpace
for b2 being sequence of b1 holds
( b2 is CCauchy iff for b3 being Real st b3 > 0 holds
ex b4 being Nat st
for b5, b6 being Nat st b5 >= b4 & b6 >= b4 holds
||.((b2 . b5) - (b2 . b6)).|| < b3 )
proof end;

theorem Th11: :: CSSPACE3:11
for b1 being sequence of Complex_l1_Space st b1 is CCauchy holds
b1 is convergent
proof end;