:: CLOPBAN1 semantic presentation

definition
let c1 be set ;
let c2 be non empty set ;
let c3 be Function of [:COMPLEX ,c2:],c2;
let c4 be complex number ;
let c5 be Function of c1,c2;
redefine func [;] as c3 [;] c4,c5 -> Element of Funcs a1,a2;
coherence
c3 [;] c4,c5 is Element of Funcs c1,c2
proof end;
end;

theorem Th1: :: CLOPBAN1:1
for b1 being non empty set
for b2 being ComplexLinearSpace ex b3 being Function of [:COMPLEX ,(Funcs b1,the carrier of b2):], Funcs b1,the carrier of b2 st
for b4 being Complex
for b5 being Element of Funcs b1,the carrier of b2
for b6 being Element of b1 holds (b3 . [b4,b5]) . b6 = b4 * (b5 . b6)
proof end;

definition
let c1 be non empty set ;
let c2 be ComplexLinearSpace;
func FuncExtMult c1,c2 -> Function of [:COMPLEX ,(Funcs a1,the carrier of a2):], Funcs a1,the carrier of a2 means :Def1: :: CLOPBAN1:def 1
for b1 being Complex
for b2 being Element of Funcs a1,the carrier of a2
for b3 being Element of a1 holds (a3 . [b1,b2]) . b3 = b1 * (b2 . b3);
existence
ex b1 being Function of [:COMPLEX ,(Funcs c1,the carrier of c2):], Funcs c1,the carrier of c2 st
for b2 being Complex
for b3 being Element of Funcs c1,the carrier of c2
for b4 being Element of c1 holds (b1 . [b2,b3]) . b4 = b2 * (b3 . b4)
by Th1;
uniqueness
for b1, b2 being Function of [:COMPLEX ,(Funcs c1,the carrier of c2):], Funcs c1,the carrier of c2 st ( for b3 being Complex
for b4 being Element of Funcs c1,the carrier of c2
for b5 being Element of c1 holds (b1 . [b3,b4]) . b5 = b3 * (b4 . b5) ) & ( for b3 being Complex
for b4 being Element of Funcs c1,the carrier of c2
for b5 being Element of c1 holds (b2 . [b3,b4]) . b5 = b3 * (b4 . b5) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines FuncExtMult CLOPBAN1:def 1 :
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Function of [:COMPLEX ,(Funcs b1,the carrier of b2):], Funcs b1,the carrier of b2 holds
( b3 = FuncExtMult b1,b2 iff for b4 being Complex
for b5 being Element of Funcs b1,the carrier of b2
for b6 being Element of b1 holds (b3 . [b4,b5]) . b6 = b4 * (b5 . b6) );

theorem Th2: :: CLOPBAN1:2
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of b1 holds (FuncZero b1,b2) . b3 = 0. b2
proof end;

theorem Th3: :: CLOPBAN1:3
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4 being Element of Funcs b1,the carrier of b2
for b5 being Complex holds
( b3 = (FuncExtMult b1,b2) . [b5,b4] iff for b6 being Element of b1 holds b3 . b6 = b5 * (b4 . b6) )
proof end;

theorem Th4: :: CLOPBAN1:4
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . b3,b4 = (FuncAdd b1,b2) . b4,b3
proof end;

theorem Th5: :: CLOPBAN1:5
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4, b5 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . b3,((FuncAdd b1,b2) . b4,b5) = (FuncAdd b1,b2) . ((FuncAdd b1,b2) . b3,b4),b5
proof end;

theorem Th6: :: CLOPBAN1:6
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . (FuncZero b1,b2),b3 = b3
proof end;

theorem Th7: :: CLOPBAN1:7
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . b3,((FuncExtMult b1,b2) . [(- 1r ),b3]) = FuncZero b1,b2
proof end;

theorem Th8: :: CLOPBAN1:8
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncExtMult b1,b2) . [1r ,b3] = b3
proof end;

theorem Th9: :: CLOPBAN1:9
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of Funcs b1,the carrier of b2
for b4, b5 being Complex holds (FuncExtMult b1,b2) . [b4,((FuncExtMult b1,b2) . [b5,b3])] = (FuncExtMult b1,b2) . [(b4 * b5),b3]
proof end;

theorem Th10: :: CLOPBAN1:10
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3 being Element of Funcs b1,the carrier of b2
for b4, b5 being Complex holds (FuncAdd b1,b2) . ((FuncExtMult b1,b2) . [b4,b3]),((FuncExtMult b1,b2) . [b5,b3]) = (FuncExtMult b1,b2) . [(b4 + b5),b3]
proof end;

Lemma12: for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4 being Element of Funcs b1,the carrier of b2
for b5 being Complex holds (FuncAdd b1,b2) . ((FuncExtMult b1,b2) . [b5,b3]),((FuncExtMult b1,b2) . [b5,b4]) = (FuncExtMult b1,b2) . [b5,((FuncAdd b1,b2) . b3,b4)]
proof end;

theorem Th11: :: CLOPBAN1:11
for b1 being non empty set
for b2 being ComplexLinearSpace holds CLSStruct(# (Funcs b1,the carrier of b2),(FuncZero b1,b2),(FuncAdd b1,b2),(FuncExtMult b1,b2) #) is ComplexLinearSpace
proof end;

definition
let c1 be non empty set ;
let c2 be ComplexLinearSpace;
func ComplexVectSpace c1,c2 -> ComplexLinearSpace equals :: CLOPBAN1:def 2
CLSStruct(# (Funcs a1,the carrier of a2),(FuncZero a1,a2),(FuncAdd a1,a2),(FuncExtMult a1,a2) #);
coherence
CLSStruct(# (Funcs c1,the carrier of c2),(FuncZero c1,c2),(FuncAdd c1,c2),(FuncExtMult c1,c2) #) is ComplexLinearSpace
by Th11;
end;

:: deftheorem Def2 defines ComplexVectSpace CLOPBAN1:def 2 :
for b1 being non empty set
for b2 being ComplexLinearSpace holds ComplexVectSpace b1,b2 = CLSStruct(# (Funcs b1,the carrier of b2),(FuncZero b1,b2),(FuncAdd b1,b2),(FuncExtMult b1,b2) #);

registration
let c1 be non empty set ;
let c2 be ComplexLinearSpace;
cluster ComplexVectSpace a1,a2 -> strict ;
coherence
ComplexVectSpace c1,c2 is strict
;
end;

registration
let c1 be non empty set ;
let c2 be ComplexLinearSpace;
cluster ComplexVectSpace a1,a2 -> strict constituted-Functions ;
coherence
ComplexVectSpace c1,c2 is constituted-Functions
by MONOID_0:89;
end;

definition
let c1 be non empty set ;
let c2 be ComplexLinearSpace;
let c3 be VECTOR of (ComplexVectSpace c1,c2);
let c4 be Element of c1;
redefine func . as c3 . c4 -> VECTOR of a2;
coherence
c3 . c4 is VECTOR of c2
proof end;
end;

theorem Th12: :: CLOPBAN1:12
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4, b5 being VECTOR of (ComplexVectSpace b1,b2) holds
( b5 = b3 + b4 iff for b6 being Element of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th13: :: CLOPBAN1:13
for b1 being non empty set
for b2 being ComplexLinearSpace
for b3, b4 being VECTOR of (ComplexVectSpace b1,b2)
for b5 being Complex holds
( b4 = b5 * b3 iff for b6 being Element of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th14: :: CLOPBAN1:14
for b1 being non empty set
for b2 being ComplexLinearSpace holds 0. (ComplexVectSpace b1,b2) = b1 --> (0. b2) by LOPBAN_1:def 3;

definition
let c1 be non empty CLSStruct ;
let c2 be non empty LoopStr ;
let c3 be Function of c1,c2;
attr a3 is additive means :Def3: :: CLOPBAN1:def 3
for b1, b2 being VECTOR of a1 holds a3 . (b1 + b2) = (a3 . b1) + (a3 . b2);
end;

:: deftheorem Def3 defines additive CLOPBAN1:def 3 :
for b1 being non empty CLSStruct
for b2 being non empty LoopStr
for b3 being Function of b1,b2 holds
( b3 is additive iff for b4, b5 being VECTOR of b1 holds b3 . (b4 + b5) = (b3 . b4) + (b3 . b5) );

definition
let c1, c2 be non empty CLSStruct ;
let c3 be Function of c1,c2;
attr a3 is homogeneous means :Def4: :: CLOPBAN1:def 4
for b1 being VECTOR of a1
for b2 being Complex holds a3 . (b2 * b1) = b2 * (a3 . b1);
end;

:: deftheorem Def4 defines homogeneous CLOPBAN1:def 4 :
for b1, b2 being non empty CLSStruct
for b3 being Function of b1,b2 holds
( b3 is homogeneous iff for b4 being VECTOR of b1
for b5 being Complex holds b3 . (b5 * b4) = b5 * (b3 . b4) );

registration
let c1 be non empty CLSStruct ;
let c2 be ComplexLinearSpace;
cluster additive homogeneous M4(the carrier of a1,the carrier of a2);
existence
ex b1 being Function of c1,c2 st
( b1 is additive & b1 is homogeneous )
proof end;
end;

definition
let c1, c2 be ComplexLinearSpace;
mode LinearOperator of a1,a2 is additive homogeneous Function of a1,a2;
end;

definition
let c1, c2 be ComplexLinearSpace;
func LinearOperators c1,c2 -> Subset of (ComplexVectSpace the carrier of a1,a2) means :Def5: :: CLOPBAN1:def 5
for b1 being set holds
( b1 in a3 iff b1 is LinearOperator of a1,a2 );
existence
ex b1 being Subset of (ComplexVectSpace the carrier of c1,c2) st
for b2 being set holds
( b2 in b1 iff b2 is LinearOperator of c1,c2 )
proof end;
uniqueness
for b1, b2 being Subset of (ComplexVectSpace the carrier of c1,c2) st ( for b3 being set holds
( b3 in b1 iff b3 is LinearOperator of c1,c2 ) ) & ( for b3 being set holds
( b3 in b2 iff b3 is LinearOperator of c1,c2 ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def5 defines LinearOperators CLOPBAN1:def 5 :
for b1, b2 being ComplexLinearSpace
for b3 being Subset of (ComplexVectSpace the carrier of b1,b2) holds
( b3 = LinearOperators b1,b2 iff for b4 being set holds
( b4 in b3 iff b4 is LinearOperator of b1,b2 ) );

registration
let c1, c2 be ComplexLinearSpace;
cluster LinearOperators a1,a2 -> non empty functional ;
coherence
( not LinearOperators c1,c2 is empty & LinearOperators c1,c2 is functional )
proof end;
end;

theorem Th15: :: CLOPBAN1:15
for b1, b2 being ComplexLinearSpace holds LinearOperators b1,b2 is lineary-closed
proof end;

theorem Th16: :: CLOPBAN1:16
for b1, b2 being ComplexLinearSpace holds CLSStruct(# (LinearOperators b1,b2),(Zero_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)),(Add_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)),(Mult_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)) #) is Subspace of ComplexVectSpace the carrier of b1,b2
proof end;

registration
let c1, c2 be ComplexLinearSpace;
cluster CLSStruct(# (LinearOperators a1,a2),(Zero_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)),(Add_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)),(Mult_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)) #) -> Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ;
coherence
( CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is Abelian & CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is add-associative & CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is right_zeroed & CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is right_complementable & CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is ComplexLinearSpace-like )
by Th16;
end;

definition
let c1, c2 be ComplexLinearSpace;
func C_VectorSpace_of_LinearOperators c1,c2 -> ComplexLinearSpace equals :: CLOPBAN1:def 6
CLSStruct(# (LinearOperators a1,a2),(Zero_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)),(Add_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)),(Mult_ (LinearOperators a1,a2),(ComplexVectSpace the carrier of a1,a2)) #);
coherence
CLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(ComplexVectSpace the carrier of c1,c2)) #) is ComplexLinearSpace
;
end;

:: deftheorem Def6 defines C_VectorSpace_of_LinearOperators CLOPBAN1:def 6 :
for b1, b2 being ComplexLinearSpace holds C_VectorSpace_of_LinearOperators b1,b2 = CLSStruct(# (LinearOperators b1,b2),(Zero_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)),(Add_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)),(Mult_ (LinearOperators b1,b2),(ComplexVectSpace the carrier of b1,b2)) #);

registration
let c1, c2 be ComplexLinearSpace;
cluster C_VectorSpace_of_LinearOperators a1,a2 -> strict ;
coherence
C_VectorSpace_of_LinearOperators c1,c2 is strict
;
end;

registration
let c1, c2 be ComplexLinearSpace;
cluster C_VectorSpace_of_LinearOperators a1,a2 -> strict constituted-Functions ;
coherence
C_VectorSpace_of_LinearOperators c1,c2 is constituted-Functions
by MONOID_0:89;
end;

definition
let c1, c2 be ComplexLinearSpace;
let c3 be Element of (C_VectorSpace_of_LinearOperators c1,c2);
let c4 be VECTOR of c1;
redefine func . as c3 . c4 -> VECTOR of a2;
coherence
c3 . c4 is VECTOR of c2
proof end;
end;

theorem Th17: :: CLOPBAN1:17
canceled;

theorem Th18: :: CLOPBAN1:18
for b1, b2 being ComplexLinearSpace
for b3, b4, b5 being VECTOR of (C_VectorSpace_of_LinearOperators b1,b2) holds
( b5 = b3 + b4 iff for b6 being VECTOR of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th19: :: CLOPBAN1:19
for b1, b2 being ComplexLinearSpace
for b3, b4 being VECTOR of (C_VectorSpace_of_LinearOperators b1,b2)
for b5 being Complex holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th20: :: CLOPBAN1:20
for b1, b2 being ComplexLinearSpace holds 0. (C_VectorSpace_of_LinearOperators b1,b2) = the carrier of b1 --> (0. b2)
proof end;

theorem Th21: :: CLOPBAN1:21
for b1, b2 being ComplexLinearSpace holds the carrier of b1 --> (0. b2) is LinearOperator of b1,b2
proof end;

theorem Th22: :: CLOPBAN1:22
for b1 being ComplexNormSpace
for b2 being sequence of b1
for b3 being Point of b1 st b2 is convergent & lim b2 = b3 holds
( ||.b2.|| is convergent & lim ||.b2.|| = ||.b3.|| )
proof end;

definition
let c1, c2 be ComplexNormSpace;
let c3 be LinearOperator of c1,c2;
attr a3 is bounded means :Def7: :: CLOPBAN1:def 7
ex b1 being Real st
( 0 <= b1 & ( for b2 being VECTOR of a1 holds ||.(a3 . b2).|| <= b1 * ||.b2.|| ) );
end;

:: deftheorem Def7 defines bounded CLOPBAN1:def 7 :
for b1, b2 being ComplexNormSpace
for b3 being LinearOperator of b1,b2 holds
( b3 is bounded iff ex b4 being Real st
( 0 <= b4 & ( for b5 being VECTOR of b1 holds ||.(b3 . b5).|| <= b4 * ||.b5.|| ) ) );

theorem Th23: :: CLOPBAN1:23
for b1, b2 being ComplexNormSpace
for b3 being LinearOperator of b1,b2 st ( for b4 being VECTOR of b1 holds b3 . b4 = 0. b2 ) holds
b3 is bounded
proof end;

registration
let c1, c2 be ComplexNormSpace;
cluster bounded M4(the carrier of a1,the carrier of a2);
existence
ex b1 being LinearOperator of c1,c2 st b1 is bounded
proof end;
end;

definition
let c1, c2 be ComplexNormSpace;
func BoundedLinearOperators c1,c2 -> Subset of (C_VectorSpace_of_LinearOperators a1,a2) means :Def8: :: CLOPBAN1:def 8
for b1 being set holds
( b1 in a3 iff b1 is bounded LinearOperator of a1,a2 );
existence
ex b1 being Subset of (C_VectorSpace_of_LinearOperators c1,c2) st
for b2 being set holds
( b2 in b1 iff b2 is bounded LinearOperator of c1,c2 )
proof end;
uniqueness
for b1, b2 being Subset of (C_VectorSpace_of_LinearOperators c1,c2) st ( for b3 being set holds
( b3 in b1 iff b3 is bounded LinearOperator of c1,c2 ) ) & ( for b3 being set holds
( b3 in b2 iff b3 is bounded LinearOperator of c1,c2 ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def8 defines BoundedLinearOperators CLOPBAN1:def 8 :
for b1, b2 being ComplexNormSpace
for b3 being Subset of (C_VectorSpace_of_LinearOperators b1,b2) holds
( b3 = BoundedLinearOperators b1,b2 iff for b4 being set holds
( b4 in b3 iff b4 is bounded LinearOperator of b1,b2 ) );

registration
let c1, c2 be ComplexNormSpace;
cluster BoundedLinearOperators a1,a2 -> non empty ;
coherence
not BoundedLinearOperators c1,c2 is empty
proof end;
end;

theorem Th24: :: CLOPBAN1:24
for b1, b2 being ComplexNormSpace holds BoundedLinearOperators b1,b2 is lineary-closed
proof end;

theorem Th25: :: CLOPBAN1:25
for b1, b2 being ComplexNormSpace holds CLSStruct(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)) #) is Subspace of C_VectorSpace_of_LinearOperators b1,b2
proof end;

registration
let c1, c2 be ComplexNormSpace;
cluster CLSStruct(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)) #) -> Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ;
coherence
( CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is Abelian & CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is add-associative & CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is right_zeroed & CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is right_complementable & CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is ComplexLinearSpace-like )
by Th25;
end;

definition
let c1, c2 be ComplexNormSpace;
func C_VectorSpace_of_BoundedLinearOperators c1,c2 -> ComplexLinearSpace equals :: CLOPBAN1:def 9
CLSStruct(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)) #);
coherence
CLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)) #) is ComplexLinearSpace
;
end;

:: deftheorem Def9 defines C_VectorSpace_of_BoundedLinearOperators CLOPBAN1:def 9 :
for b1, b2 being ComplexNormSpace holds C_VectorSpace_of_BoundedLinearOperators b1,b2 = CLSStruct(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)) #);

registration
let c1, c2 be ComplexNormSpace;
cluster C_VectorSpace_of_BoundedLinearOperators a1,a2 -> strict ;
coherence
C_VectorSpace_of_BoundedLinearOperators c1,c2 is strict
;
end;

registration
let c1, c2 be ComplexNormSpace;
cluster -> Relation-like Function-like Element of the carrier of (C_VectorSpace_of_BoundedLinearOperators a1,a2);
coherence
for b1 being Element of (C_VectorSpace_of_BoundedLinearOperators c1,c2) holds
( b1 is Function-like & b1 is Relation-like )
by Def8;
end;

definition
let c1, c2 be ComplexNormSpace;
let c3 be Element of (C_VectorSpace_of_BoundedLinearOperators c1,c2);
let c4 be VECTOR of c1;
redefine func . as c3 . c4 -> VECTOR of a2;
coherence
c3 . c4 is VECTOR of c2
proof end;
end;

theorem Th26: :: CLOPBAN1:26
canceled;

theorem Th27: :: CLOPBAN1:27
for b1, b2 being ComplexNormSpace
for b3, b4, b5 being VECTOR of (C_VectorSpace_of_BoundedLinearOperators b1,b2) holds
( b5 = b3 + b4 iff for b6 being VECTOR of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th28: :: CLOPBAN1:28
for b1, b2 being ComplexNormSpace
for b3, b4 being VECTOR of (C_VectorSpace_of_BoundedLinearOperators b1,b2)
for b5 being Complex holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th29: :: CLOPBAN1:29
for b1, b2 being ComplexNormSpace holds 0. (C_VectorSpace_of_BoundedLinearOperators b1,b2) = the carrier of b1 --> (0. b2)
proof end;

definition
let c1, c2 be ComplexNormSpace;
let c3 be set ;
assume E35: c3 in BoundedLinearOperators c1,c2 ;
func modetrans c3,c1,c2 -> bounded LinearOperator of a1,a2 equals :Def10: :: CLOPBAN1:def 10
a3;
coherence
c3 is bounded LinearOperator of c1,c2
by E35, Def8;
end;

:: deftheorem Def10 defines modetrans CLOPBAN1:def 10 :
for b1, b2 being ComplexNormSpace
for b3 being set st b3 in BoundedLinearOperators b1,b2 holds
modetrans b3,b1,b2 = b3;

definition
let c1, c2 be ComplexNormSpace;
let c3 be LinearOperator of c1,c2;
func PreNorms c3 -> non empty Subset of REAL equals :: CLOPBAN1:def 11
{ ||.(a3 . b1).|| where B is VECTOR of a1 : ||.b1.|| <= 1 } ;
coherence
{ ||.(c3 . b1).|| where B is VECTOR of c1 : ||.b1.|| <= 1 } is non empty Subset of REAL
proof end;
end;

:: deftheorem Def11 defines PreNorms CLOPBAN1:def 11 :
for b1, b2 being ComplexNormSpace
for b3 being LinearOperator of b1,b2 holds PreNorms b3 = { ||.(b3 . b4).|| where B is VECTOR of b1 : ||.b4.|| <= 1 } ;

theorem Th30: :: CLOPBAN1:30
for b1, b2 being ComplexNormSpace
for b3 being bounded LinearOperator of b1,b2 holds
( not PreNorms b3 is empty & PreNorms b3 is bounded_above )
proof end;

theorem Th31: :: CLOPBAN1:31
for b1, b2 being ComplexNormSpace
for b3 being LinearOperator of b1,b2 holds
( b3 is bounded iff PreNorms b3 is bounded_above )
proof end;

theorem Th32: :: CLOPBAN1:32
for b1, b2 being ComplexNormSpace ex b3 being Function of BoundedLinearOperators b1,b2, REAL st
for b4 being set st b4 in BoundedLinearOperators b1,b2 holds
b3 . b4 = sup (PreNorms (modetrans b4,b1,b2))
proof end;

definition
let c1, c2 be ComplexNormSpace;
func BoundedLinearOperatorsNorm c1,c2 -> Function of BoundedLinearOperators a1,a2, REAL means :Def12: :: CLOPBAN1:def 12
for b1 being set st b1 in BoundedLinearOperators a1,a2 holds
a3 . b1 = sup (PreNorms (modetrans b1,a1,a2));
existence
ex b1 being Function of BoundedLinearOperators c1,c2, REAL st
for b2 being set st b2 in BoundedLinearOperators c1,c2 holds
b1 . b2 = sup (PreNorms (modetrans b2,c1,c2))
by Th32;
uniqueness
for b1, b2 being Function of BoundedLinearOperators c1,c2, REAL st ( for b3 being set st b3 in BoundedLinearOperators c1,c2 holds
b1 . b3 = sup (PreNorms (modetrans b3,c1,c2)) ) & ( for b3 being set st b3 in BoundedLinearOperators c1,c2 holds
b2 . b3 = sup (PreNorms (modetrans b3,c1,c2)) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def12 defines BoundedLinearOperatorsNorm CLOPBAN1:def 12 :
for b1, b2 being ComplexNormSpace
for b3 being Function of BoundedLinearOperators b1,b2, REAL holds
( b3 = BoundedLinearOperatorsNorm b1,b2 iff for b4 being set st b4 in BoundedLinearOperators b1,b2 holds
b3 . b4 = sup (PreNorms (modetrans b4,b1,b2)) );

theorem Th33: :: CLOPBAN1:33
for b1, b2 being ComplexNormSpace
for b3 being bounded LinearOperator of b1,b2 holds modetrans b3,b1,b2 = b3
proof end;

theorem Th34: :: CLOPBAN1:34
for b1, b2 being ComplexNormSpace
for b3 being bounded LinearOperator of b1,b2 holds (BoundedLinearOperatorsNorm b1,b2) . b3 = sup (PreNorms b3)
proof end;

definition
let c1, c2 be ComplexNormSpace;
func C_NormSpace_of_BoundedLinearOperators c1,c2 -> non empty CNORMSTR equals :: CLOPBAN1:def 13
CNORMSTR(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(C_VectorSpace_of_LinearOperators a1,a2)),(BoundedLinearOperatorsNorm a1,a2) #);
coherence
CNORMSTR(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(C_VectorSpace_of_LinearOperators c1,c2)),(BoundedLinearOperatorsNorm c1,c2) #) is non empty CNORMSTR
;
end;

:: deftheorem Def13 defines C_NormSpace_of_BoundedLinearOperators CLOPBAN1:def 13 :
for b1, b2 being ComplexNormSpace holds C_NormSpace_of_BoundedLinearOperators b1,b2 = CNORMSTR(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(C_VectorSpace_of_LinearOperators b1,b2)),(BoundedLinearOperatorsNorm b1,b2) #);

theorem Th35: :: CLOPBAN1:35
for b1, b2 being ComplexNormSpace holds the carrier of b1 --> (0. b2) = 0. (C_NormSpace_of_BoundedLinearOperators b1,b2)
proof end;

theorem Th36: :: CLOPBAN1:36
for b1, b2 being ComplexNormSpace
for b3 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2)
for b4 being bounded LinearOperator of b1,b2 st b4 = b3 holds
for b5 being VECTOR of b1 holds ||.(b4 . b5).|| <= ||.b3.|| * ||.b5.||
proof end;

theorem Th37: :: CLOPBAN1:37
for b1, b2 being ComplexNormSpace
for b3 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2) holds 0 <= ||.b3.||
proof end;

theorem Th38: :: CLOPBAN1:38
for b1, b2 being ComplexNormSpace
for b3 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2) st b3 = 0. (C_NormSpace_of_BoundedLinearOperators b1,b2) holds
0 = ||.b3.||
proof end;

registration
let c1, c2 be ComplexNormSpace;
cluster -> Relation-like Function-like Element of the carrier of (C_NormSpace_of_BoundedLinearOperators a1,a2);
coherence
for b1 being Element of (C_NormSpace_of_BoundedLinearOperators c1,c2) holds
( b1 is Function-like & b1 is Relation-like )
by Def8;
end;

definition
let c1, c2 be ComplexNormSpace;
let c3 be Element of (C_NormSpace_of_BoundedLinearOperators c1,c2);
let c4 be VECTOR of c1;
redefine func . as c3 . c4 -> VECTOR of a2;
coherence
c3 . c4 is VECTOR of c2
proof end;
end;

theorem Th39: :: CLOPBAN1:39
for b1, b2 being ComplexNormSpace
for b3, b4, b5 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2) holds
( b5 = b3 + b4 iff for b6 being VECTOR of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th40: :: CLOPBAN1:40
for b1, b2 being ComplexNormSpace
for b3, b4 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2)
for b5 being Complex holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th41: :: CLOPBAN1:41
for b1, b2 being ComplexNormSpace
for b3, b4 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2)
for b5 being Complex holds
( ( ||.b3.|| = 0 implies b3 = 0. (C_NormSpace_of_BoundedLinearOperators b1,b2) ) & ( b3 = 0. (C_NormSpace_of_BoundedLinearOperators b1,b2) implies ||.b3.|| = 0 ) & ||.(b5 * b3).|| = |.b5.| * ||.b3.|| & ||.(b3 + b4).|| <= ||.b3.|| + ||.b4.|| )
proof end;

theorem Th42: :: CLOPBAN1:42
for b1, b2 being ComplexNormSpace holds C_NormSpace_of_BoundedLinearOperators b1,b2 is ComplexNormSpace-like
proof end;

theorem Th43: :: CLOPBAN1:43
for b1, b2 being ComplexNormSpace holds C_NormSpace_of_BoundedLinearOperators b1,b2 is ComplexNormSpace
proof end;

registration
let c1, c2 be ComplexNormSpace;
cluster C_NormSpace_of_BoundedLinearOperators a1,a2 -> non empty Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ComplexNormSpace-like ;
coherence
( C_NormSpace_of_BoundedLinearOperators c1,c2 is ComplexNormSpace-like & C_NormSpace_of_BoundedLinearOperators c1,c2 is ComplexLinearSpace-like & C_NormSpace_of_BoundedLinearOperators c1,c2 is Abelian & C_NormSpace_of_BoundedLinearOperators c1,c2 is add-associative & C_NormSpace_of_BoundedLinearOperators c1,c2 is right_zeroed & C_NormSpace_of_BoundedLinearOperators c1,c2 is right_complementable )
by Th43;
end;

theorem Th44: :: CLOPBAN1:44
for b1, b2 being ComplexNormSpace
for b3, b4, b5 being Point of (C_NormSpace_of_BoundedLinearOperators b1,b2) holds
( b5 = b3 - b4 iff for b6 being VECTOR of b1 holds b5 . b6 = (b3 . b6) - (b4 . b6) )
proof end;

definition
let c1 be ComplexNormSpace;
attr a1 is complete means :Def14: :: CLOPBAN1:def 14
for b1 being sequence of a1 st b1 is CCauchy holds
b1 is convergent;
end;

:: deftheorem Def14 defines complete CLOPBAN1:def 14 :
for b1 being ComplexNormSpace holds
( b1 is complete iff for b2 being sequence of b1 st b2 is CCauchy holds
b2 is convergent );

registration
cluster complete CNORMSTR ;
existence
ex b1 being ComplexNormSpace st b1 is complete
proof end;
end;

definition
mode ComplexBanachSpace is complete ComplexNormSpace;
end;

Lemma52: for b1 being Real
for b2 being Real_Sequence st b2 is convergent & ex b3 being Nat st
for b4 being Nat st b3 <= b4 holds
b2 . b4 <= b1 holds
lim b2 <= b1
proof end;

theorem Th45: :: CLOPBAN1:45
for b1 being ComplexNormSpace
for b2 being sequence of b1 st b2 is convergent holds
( ||.b2.|| is convergent & lim ||.b2.|| = ||.(lim b2).|| )
proof end;

theorem Th46: :: CLOPBAN1:46
for b1, b2 being ComplexNormSpace st b2 is complete holds
for b3 being sequence of (C_NormSpace_of_BoundedLinearOperators b1,b2) st b3 is CCauchy holds
b3 is convergent
proof end;

theorem Th47: :: CLOPBAN1:47
for b1 being ComplexNormSpace
for b2 being ComplexBanachSpace holds C_NormSpace_of_BoundedLinearOperators b1,b2 is ComplexBanachSpace
proof end;

registration
let c1 be ComplexNormSpace;
let c2 be ComplexBanachSpace;
cluster C_NormSpace_of_BoundedLinearOperators a1,a2 -> non empty Abelian add-associative right_zeroed right_complementable ComplexLinearSpace-like ComplexNormSpace-like complete ;
coherence
C_NormSpace_of_BoundedLinearOperators c1,c2 is complete
by Th47;
end;