:: LOPBAN_1 semantic presentation

definition
let c1 be set ;
let c2 be non empty set ;
let c3 be Function of [:REAL ,c2:],c2;
let c4 be real 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: :: LOPBAN_1:1
for b1 being non empty set
for b2 being non empty LoopStr ex b3 being BinOp of Funcs b1,the carrier of b2 st
for b4, b5 being Element of Funcs b1,the carrier of b2 holds b3 . b4,b5 = the add of b2 .: b4,b5
proof end;

theorem Th2: :: LOPBAN_1:2
for b1 being non empty set
for b2 being RealLinearSpace ex b3 being Function of [:REAL ,(Funcs b1,the carrier of b2):], Funcs b1,the carrier of b2 st
for b4 being Real
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 non empty LoopStr ;
func FuncAdd c1,c2 -> BinOp of Funcs a1,the carrier of a2 means :Def1: :: LOPBAN_1:def 1
for b1, b2 being Element of Funcs a1,the carrier of a2 holds a3 . b1,b2 = the add of a2 .: b1,b2;
existence
ex b1 being BinOp of Funcs c1,the carrier of c2 st
for b2, b3 being Element of Funcs c1,the carrier of c2 holds b1 . b2,b3 = the add of c2 .: b2,b3
by Th1;
uniqueness
for b1, b2 being BinOp of Funcs c1,the carrier of c2 st ( for b3, b4 being Element of Funcs c1,the carrier of c2 holds b1 . b3,b4 = the add of c2 .: b3,b4 ) & ( for b3, b4 being Element of Funcs c1,the carrier of c2 holds b2 . b3,b4 = the add of c2 .: b3,b4 ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines FuncAdd LOPBAN_1:def 1 :
for b1 being non empty set
for b2 being non empty LoopStr
for b3 being BinOp of Funcs b1,the carrier of b2 holds
( b3 = FuncAdd b1,b2 iff for b4, b5 being Element of Funcs b1,the carrier of b2 holds b3 . b4,b5 = the add of b2 .: b4,b5 );

definition
let c1 be non empty set ;
let c2 be RealLinearSpace;
func FuncExtMult c1,c2 -> Function of [:REAL ,(Funcs a1,the carrier of a2):], Funcs a1,the carrier of a2 means :Def2: :: LOPBAN_1:def 2
for b1 being Real
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 [:REAL ,(Funcs c1,the carrier of c2):], Funcs c1,the carrier of c2 st
for b2 being Real
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 Th2;
uniqueness
for b1, b2 being Function of [:REAL ,(Funcs c1,the carrier of c2):], Funcs c1,the carrier of c2 st ( for b3 being Real
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 Real
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 Def2 defines FuncExtMult LOPBAN_1:def 2 :
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Function of [:REAL ,(Funcs b1,the carrier of b2):], Funcs b1,the carrier of b2 holds
( b3 = FuncExtMult b1,b2 iff for b4 being Real
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) );

definition
let c1 be set ;
let c2 be non empty ZeroStr ;
func FuncZero c1,c2 -> Element of Funcs a1,the carrier of a2 equals :: LOPBAN_1:def 3
a1 --> (0. a2);
coherence
c1 --> (0. c2) is Element of Funcs c1,the carrier of c2
proof end;
end;

:: deftheorem Def3 defines FuncZero LOPBAN_1:def 3 :
for b1 being set
for b2 being non empty ZeroStr holds FuncZero b1,b2 = b1 --> (0. b2);

Lemma5: for b1, b2 being non empty set
for b3 being Element of b1
for b4 being Function of b1,b2 holds b3 in dom b4
proof end;

theorem Th3: :: LOPBAN_1:3
for b1 being non empty set
for b2 being non empty LoopStr
for b3, b4, b5 being Element of Funcs b1,the carrier of b2 holds
( b5 = (FuncAdd b1,b2) . b3,b4 iff for b6 being Element of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th4: :: LOPBAN_1:4
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of b1 holds (FuncZero b1,b2) . b3 = 0. b2 by FUNCOP_1:13;

theorem Th5: :: LOPBAN_1:5
for b1 being non empty set
for b2 being RealLinearSpace
for b3, b4 being Element of Funcs b1,the carrier of b2
for b5 being Real holds
( b3 = (FuncExtMult b1,b2) . [b5,b4] iff for b6 being Element of b1 holds b3 . b6 = b5 * (b4 . b6) )
proof end;

theorem Th6: :: LOPBAN_1:6
for b1 being non empty set
for b2 being RealLinearSpace
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 Th7: :: LOPBAN_1:7
for b1 being non empty set
for b2 being RealLinearSpace
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 Th8: :: LOPBAN_1:8
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . (FuncZero b1,b2),b3 = b3
proof end;

theorem Th9: :: LOPBAN_1:9
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncAdd b1,b2) . b3,((FuncExtMult b1,b2) . [(- 1),b3]) = FuncZero b1,b2
proof end;

theorem Th10: :: LOPBAN_1:10
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of Funcs b1,the carrier of b2 holds (FuncExtMult b1,b2) . [1,b3] = b3
proof end;

theorem Th11: :: LOPBAN_1:11
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of Funcs b1,the carrier of b2
for b4, b5 being Real holds (FuncExtMult b1,b2) . [b4,((FuncExtMult b1,b2) . [b5,b3])] = (FuncExtMult b1,b2) . [(b4 * b5),b3]
proof end;

theorem Th12: :: LOPBAN_1:12
for b1 being non empty set
for b2 being RealLinearSpace
for b3 being Element of Funcs b1,the carrier of b2
for b4, b5 being Real holds (FuncAdd b1,b2) . ((FuncExtMult b1,b2) . [b4,b3]),((FuncExtMult b1,b2) . [b5,b3]) = (FuncExtMult b1,b2) . [(b4 + b5),b3]
proof end;

Lemma16: for b1 being non empty set
for b2 being RealLinearSpace
for b3, b4 being Element of Funcs b1,the carrier of b2
for b5 being Real 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 Th13: :: LOPBAN_1:13
for b1 being non empty set
for b2 being RealLinearSpace holds RLSStruct(# (Funcs b1,the carrier of b2),(FuncZero b1,b2),(FuncAdd b1,b2),(FuncExtMult b1,b2) #) is RealLinearSpace
proof end;

definition
let c1 be non empty set ;
let c2 be RealLinearSpace;
func RealVectSpace c1,c2 -> RealLinearSpace equals :: LOPBAN_1:def 4
RLSStruct(# (Funcs a1,the carrier of a2),(FuncZero a1,a2),(FuncAdd a1,a2),(FuncExtMult a1,a2) #);
coherence
RLSStruct(# (Funcs c1,the carrier of c2),(FuncZero c1,c2),(FuncAdd c1,c2),(FuncExtMult c1,c2) #) is RealLinearSpace
by Th13;
end;

:: deftheorem Def4 defines RealVectSpace LOPBAN_1:def 4 :
for b1 being non empty set
for b2 being RealLinearSpace holds RealVectSpace b1,b2 = RLSStruct(# (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 RealLinearSpace;
cluster RealVectSpace a1,a2 -> strict ;
coherence
RealVectSpace c1,c2 is strict
;
end;

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

definition
let c1 be non empty set ;
let c2 be RealLinearSpace;
let c3 be VECTOR of (RealVectSpace 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 Th14: :: LOPBAN_1:14
for b1 being non empty set
for b2 being RealLinearSpace
for b3, b4, b5 being VECTOR of (RealVectSpace b1,b2) holds
( b5 = b3 + b4 iff for b6 being Element of b1 holds b5 . b6 = (b3 . b6) + (b4 . b6) )
proof end;

theorem Th15: :: LOPBAN_1:15
for b1 being non empty set
for b2 being RealLinearSpace
for b3, b4 being VECTOR of (RealVectSpace b1,b2)
for b5 being Real holds
( b4 = b5 * b3 iff for b6 being Element of b1 holds b4 . b6 = b5 * (b3 . b6) ) by Th5;

theorem Th16: :: LOPBAN_1:16
for b1 being non empty set
for b2 being RealLinearSpace holds 0. (RealVectSpace b1,b2) = b1 --> (0. b2) ;

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

:: deftheorem Def5 defines additive LOPBAN_1:def 5 :
for b1 being non empty RLSStruct
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 RLSStruct ;
let c3 be Function of c1,c2;
attr a3 is homogeneous means :Def6: :: LOPBAN_1:def 6
for b1 being VECTOR of a1
for b2 being Real holds a3 . (b2 * b1) = b2 * (a3 . b1);
end;

:: deftheorem Def6 defines homogeneous LOPBAN_1:def 6 :
for b1, b2 being non empty RLSStruct
for b3 being Function of b1,b2 holds
( b3 is homogeneous iff for b4 being VECTOR of b1
for b5 being Real holds b3 . (b5 * b4) = b5 * (b3 . b4) );

registration
let c1 be non empty RLSStruct ;
let c2 be RealLinearSpace;
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 RealLinearSpace;
mode LinearOperator of a1,a2 is additive homogeneous Function of a1,a2;
end;

definition
let c1, c2 be RealLinearSpace;
func LinearOperators c1,c2 -> Subset of (RealVectSpace the carrier of a1,a2) means :Def7: :: LOPBAN_1:def 7
for b1 being set holds
( b1 in a3 iff b1 is LinearOperator of a1,a2 );
existence
ex b1 being Subset of (RealVectSpace 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 (RealVectSpace 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 Def7 defines LinearOperators LOPBAN_1:def 7 :
for b1, b2 being RealLinearSpace
for b3 being Subset of (RealVectSpace 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 RealLinearSpace;
cluster LinearOperators a1,a2 -> non empty functional ;
coherence
( not LinearOperators c1,c2 is empty & LinearOperators c1,c2 is functional )
proof end;
end;

theorem Th17: :: LOPBAN_1:17
for b1, b2 being RealLinearSpace holds LinearOperators b1,b2 is lineary-closed
proof end;

theorem Th18: :: LOPBAN_1:18
for b1, b2 being RealLinearSpace holds RLSStruct(# (LinearOperators b1,b2),(Zero_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)),(Add_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)),(Mult_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)) #) is Subspace of RealVectSpace the carrier of b1,b2
proof end;

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

definition
let c1, c2 be RealLinearSpace;
func R_VectorSpace_of_LinearOperators c1,c2 -> RealLinearSpace equals :: LOPBAN_1:def 8
RLSStruct(# (LinearOperators a1,a2),(Zero_ (LinearOperators a1,a2),(RealVectSpace the carrier of a1,a2)),(Add_ (LinearOperators a1,a2),(RealVectSpace the carrier of a1,a2)),(Mult_ (LinearOperators a1,a2),(RealVectSpace the carrier of a1,a2)) #);
coherence
RLSStruct(# (LinearOperators c1,c2),(Zero_ (LinearOperators c1,c2),(RealVectSpace the carrier of c1,c2)),(Add_ (LinearOperators c1,c2),(RealVectSpace the carrier of c1,c2)),(Mult_ (LinearOperators c1,c2),(RealVectSpace the carrier of c1,c2)) #) is RealLinearSpace
;
end;

:: deftheorem Def8 defines R_VectorSpace_of_LinearOperators LOPBAN_1:def 8 :
for b1, b2 being RealLinearSpace holds R_VectorSpace_of_LinearOperators b1,b2 = RLSStruct(# (LinearOperators b1,b2),(Zero_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)),(Add_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)),(Mult_ (LinearOperators b1,b2),(RealVectSpace the carrier of b1,b2)) #);

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

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

definition
let c1, c2 be RealLinearSpace;
let c3 be Element of (R_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 Th19: :: LOPBAN_1:19
canceled;

theorem Th20: :: LOPBAN_1:20
for b1, b2 being RealLinearSpace
for b3, b4, b5 being VECTOR of (R_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 Th21: :: LOPBAN_1:21
for b1, b2 being RealLinearSpace
for b3, b4 being VECTOR of (R_VectorSpace_of_LinearOperators b1,b2)
for b5 being Real holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th22: :: LOPBAN_1:22
for b1, b2 being RealLinearSpace holds 0. (R_VectorSpace_of_LinearOperators b1,b2) = the carrier of b1 --> (0. b2)
proof end;

theorem Th23: :: LOPBAN_1:23
for b1, b2 being RealLinearSpace holds the carrier of b1 --> (0. b2) is LinearOperator of b1,b2
proof end;

theorem Th24: :: LOPBAN_1:24
for b1 being RealNormSpace
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 RealNormSpace;
let c3 be LinearOperator of c1,c2;
attr a3 is bounded means :Def9: :: LOPBAN_1:def 9
ex b1 being Real st
( 0 <= b1 & ( for b2 being VECTOR of a1 holds ||.(a3 . b2).|| <= b1 * ||.b2.|| ) );
end;

:: deftheorem Def9 defines bounded LOPBAN_1:def 9 :
for b1, b2 being RealNormSpace
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 Th25: :: LOPBAN_1:25
for b1, b2 being RealNormSpace
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 RealNormSpace;
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 RealNormSpace;
func BoundedLinearOperators c1,c2 -> Subset of (R_VectorSpace_of_LinearOperators a1,a2) means :Def10: :: LOPBAN_1:def 10
for b1 being set holds
( b1 in a3 iff b1 is bounded LinearOperator of a1,a2 );
existence
ex b1 being Subset of (R_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 (R_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 Def10 defines BoundedLinearOperators LOPBAN_1:def 10 :
for b1, b2 being RealNormSpace
for b3 being Subset of (R_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 RealNormSpace;
cluster BoundedLinearOperators a1,a2 -> non empty ;
coherence
not BoundedLinearOperators c1,c2 is empty
proof end;
end;

theorem Th26: :: LOPBAN_1:26
for b1, b2 being RealNormSpace holds BoundedLinearOperators b1,b2 is lineary-closed
proof end;

theorem Th27: :: LOPBAN_1:27
for b1, b2 being RealNormSpace holds RLSStruct(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)) #) is Subspace of R_VectorSpace_of_LinearOperators b1,b2
proof end;

registration
let c1, c2 be RealNormSpace;
cluster RLSStruct(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)) #) -> Abelian add-associative right_zeroed right_complementable RealLinearSpace-like ;
coherence
( RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is Abelian & RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is add-associative & RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is right_zeroed & RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is right_complementable & RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is RealLinearSpace-like )
by Th27;
end;

definition
let c1, c2 be RealNormSpace;
func R_VectorSpace_of_BoundedLinearOperators c1,c2 -> RealLinearSpace equals :: LOPBAN_1:def 11
RLSStruct(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)) #);
coherence
RLSStruct(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)) #) is RealLinearSpace
;
end;

:: deftheorem Def11 defines R_VectorSpace_of_BoundedLinearOperators LOPBAN_1:def 11 :
for b1, b2 being RealNormSpace holds R_VectorSpace_of_BoundedLinearOperators b1,b2 = RLSStruct(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)) #);

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

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

definition
let c1, c2 be RealNormSpace;
let c3 be Element of (R_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 Th28: :: LOPBAN_1:28
canceled;

theorem Th29: :: LOPBAN_1:29
for b1, b2 being RealNormSpace
for b3, b4, b5 being VECTOR of (R_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 Th30: :: LOPBAN_1:30
for b1, b2 being RealNormSpace
for b3, b4 being VECTOR of (R_VectorSpace_of_BoundedLinearOperators b1,b2)
for b5 being Real holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th31: :: LOPBAN_1:31
for b1, b2 being RealNormSpace holds 0. (R_VectorSpace_of_BoundedLinearOperators b1,b2) = the carrier of b1 --> (0. b2)
proof end;

definition
let c1, c2 be RealNormSpace;
let c3 be set ;
assume E38: c3 in BoundedLinearOperators c1,c2 ;
func modetrans c3,c1,c2 -> bounded LinearOperator of a1,a2 equals :Def12: :: LOPBAN_1:def 12
a3;
coherence
c3 is bounded LinearOperator of c1,c2
by E38, Def10;
end;

:: deftheorem Def12 defines modetrans LOPBAN_1:def 12 :
for b1, b2 being RealNormSpace
for b3 being set st b3 in BoundedLinearOperators b1,b2 holds
modetrans b3,b1,b2 = b3;

definition
let c1, c2 be RealNormSpace;
let c3 be LinearOperator of c1,c2;
func PreNorms c3 -> non empty Subset of REAL equals :: LOPBAN_1:def 13
{ ||.(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 Def13 defines PreNorms LOPBAN_1:def 13 :
for b1, b2 being RealNormSpace
for b3 being LinearOperator of b1,b2 holds PreNorms b3 = { ||.(b3 . b4).|| where B is VECTOR of b1 : ||.b4.|| <= 1 } ;

theorem Th32: :: LOPBAN_1:32
for b1, b2 being RealNormSpace
for b3 being bounded LinearOperator of b1,b2 holds
( not PreNorms b3 is empty & PreNorms b3 is bounded_above )
proof end;

theorem Th33: :: LOPBAN_1:33
for b1, b2 being RealNormSpace
for b3 being LinearOperator of b1,b2 holds
( b3 is bounded iff PreNorms b3 is bounded_above )
proof end;

theorem Th34: :: LOPBAN_1:34
for b1, b2 being RealNormSpace 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 RealNormSpace;
func BoundedLinearOperatorsNorm c1,c2 -> Function of BoundedLinearOperators a1,a2, REAL means :Def14: :: LOPBAN_1:def 14
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 Th34;
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 Def14 defines BoundedLinearOperatorsNorm LOPBAN_1:def 14 :
for b1, b2 being RealNormSpace
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 Th35: :: LOPBAN_1:35
for b1, b2 being RealNormSpace
for b3 being bounded LinearOperator of b1,b2 holds modetrans b3,b1,b2 = b3
proof end;

theorem Th36: :: LOPBAN_1:36
for b1, b2 being RealNormSpace
for b3 being bounded LinearOperator of b1,b2 holds (BoundedLinearOperatorsNorm b1,b2) . b3 = sup (PreNorms b3)
proof end;

definition
let c1, c2 be RealNormSpace;
func R_NormSpace_of_BoundedLinearOperators c1,c2 -> non empty NORMSTR equals :: LOPBAN_1:def 15
NORMSTR(# (BoundedLinearOperators a1,a2),(Zero_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Add_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(Mult_ (BoundedLinearOperators a1,a2),(R_VectorSpace_of_LinearOperators a1,a2)),(BoundedLinearOperatorsNorm a1,a2) #);
coherence
NORMSTR(# (BoundedLinearOperators c1,c2),(Zero_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Add_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(Mult_ (BoundedLinearOperators c1,c2),(R_VectorSpace_of_LinearOperators c1,c2)),(BoundedLinearOperatorsNorm c1,c2) #) is non empty NORMSTR
;
end;

:: deftheorem Def15 defines R_NormSpace_of_BoundedLinearOperators LOPBAN_1:def 15 :
for b1, b2 being RealNormSpace holds R_NormSpace_of_BoundedLinearOperators b1,b2 = NORMSTR(# (BoundedLinearOperators b1,b2),(Zero_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Add_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(Mult_ (BoundedLinearOperators b1,b2),(R_VectorSpace_of_LinearOperators b1,b2)),(BoundedLinearOperatorsNorm b1,b2) #);

theorem Th37: :: LOPBAN_1:37
for b1, b2 being RealNormSpace holds the carrier of b1 --> (0. b2) = 0. (R_NormSpace_of_BoundedLinearOperators b1,b2)
proof end;

theorem Th38: :: LOPBAN_1:38
for b1, b2 being RealNormSpace
for b3 being Point of (R_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 Th39: :: LOPBAN_1:39
for b1, b2 being RealNormSpace
for b3 being Point of (R_NormSpace_of_BoundedLinearOperators b1,b2) holds 0 <= ||.b3.||
proof end;

theorem Th40: :: LOPBAN_1:40
for b1, b2 being RealNormSpace
for b3 being Point of (R_NormSpace_of_BoundedLinearOperators b1,b2) st b3 = 0. (R_NormSpace_of_BoundedLinearOperators b1,b2) holds
0 = ||.b3.||
proof end;

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

definition
let c1, c2 be RealNormSpace;
let c3 be Element of (R_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 Th41: :: LOPBAN_1:41
for b1, b2 being RealNormSpace
for b3, b4, b5 being Point of (R_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 Th42: :: LOPBAN_1:42
for b1, b2 being RealNormSpace
for b3, b4 being Point of (R_NormSpace_of_BoundedLinearOperators b1,b2)
for b5 being Real holds
( b4 = b5 * b3 iff for b6 being VECTOR of b1 holds b4 . b6 = b5 * (b3 . b6) )
proof end;

theorem Th43: :: LOPBAN_1:43
for b1, b2 being RealNormSpace
for b3, b4 being Point of (R_NormSpace_of_BoundedLinearOperators b1,b2)
for b5 being Real holds
( ( ||.b3.|| = 0 implies b3 = 0. (R_NormSpace_of_BoundedLinearOperators b1,b2) ) & ( b3 = 0. (R_NormSpace_of_BoundedLinearOperators b1,b2) implies ||.b3.|| = 0 ) & ||.(b5 * b3).|| = (abs b5) * ||.b3.|| & ||.(b3 + b4).|| <= ||.b3.|| + ||.b4.|| )
proof end;

theorem Th44: :: LOPBAN_1:44
for b1, b2 being RealNormSpace holds R_NormSpace_of_BoundedLinearOperators b1,b2 is RealNormSpace-like
proof end;

theorem Th45: :: LOPBAN_1:45
for b1, b2 being RealNormSpace holds R_NormSpace_of_BoundedLinearOperators b1,b2 is RealNormSpace
proof end;

registration
let c1, c2 be RealNormSpace;
cluster R_NormSpace_of_BoundedLinearOperators a1,a2 -> non empty Abelian add-associative right_zeroed right_complementable RealLinearSpace-like RealNormSpace-like ;
coherence
( R_NormSpace_of_BoundedLinearOperators c1,c2 is RealNormSpace-like & R_NormSpace_of_BoundedLinearOperators c1,c2 is RealLinearSpace-like & R_NormSpace_of_BoundedLinearOperators c1,c2 is Abelian & R_NormSpace_of_BoundedLinearOperators c1,c2 is add-associative & R_NormSpace_of_BoundedLinearOperators c1,c2 is right_zeroed & R_NormSpace_of_BoundedLinearOperators c1,c2 is right_complementable )
by Th45;
end;

theorem Th46: :: LOPBAN_1:46
for b1, b2 being RealNormSpace
for b3, b4, b5 being Point of (R_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 RealNormSpace;
attr a1 is complete means :Def16: :: LOPBAN_1:def 16
for b1 being sequence of a1 st b1 is CCauchy holds
b1 is convergent;
end;

:: deftheorem Def16 defines complete LOPBAN_1:def 16 :
for b1 being RealNormSpace holds
( b1 is complete iff for b2 being sequence of b1 st b2 is CCauchy holds
b2 is convergent );

registration
cluster complete NORMSTR ;
existence
ex b1 being RealNormSpace st b1 is complete
proof end;
end;

definition
mode RealBanachSpace is complete RealNormSpace;
end;

Lemma55: 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 Th47: :: LOPBAN_1:47
for b1 being RealNormSpace
for b2 being sequence of b1 st b2 is convergent holds
( ||.b2.|| is convergent & lim ||.b2.|| = ||.(lim b2).|| )
proof end;

theorem Th48: :: LOPBAN_1:48
for b1, b2 being RealNormSpace st b2 is complete holds
for b3 being sequence of (R_NormSpace_of_BoundedLinearOperators b1,b2) st b3 is CCauchy holds
b3 is convergent
proof end;

theorem Th49: :: LOPBAN_1:49
for b1 being RealNormSpace
for b2 being RealBanachSpace holds R_NormSpace_of_BoundedLinearOperators b1,b2 is RealBanachSpace
proof end;

registration
let c1 be RealNormSpace;
let c2 be RealBanachSpace;
cluster R_NormSpace_of_BoundedLinearOperators a1,a2 -> non empty Abelian add-associative right_zeroed right_complementable RealLinearSpace-like RealNormSpace-like complete ;
coherence
R_NormSpace_of_BoundedLinearOperators c1,c2 is complete
by Th49;
end;