let X, Y be ComplexNormSpace; :: thesis: for f, g being Point of
for c being Complex holds
( ( = 0 implies f = 0. ) & ( f = 0. implies = 0 ) & ||.(c * f).|| = |.c.| * & ||.(f + g).|| <= + )

let f, g be Point of ; :: thesis: for c being Complex holds
( ( = 0 implies f = 0. ) & ( f = 0. implies = 0 ) & ||.(c * f).|| = |.c.| * & ||.(f + g).|| <= + )

let c be Complex; :: thesis: ( ( = 0 implies f = 0. ) & ( f = 0. implies = 0 ) & ||.(c * f).|| = |.c.| * & ||.(f + g).|| <= + )
A1: now :: thesis: ( f = 0. implies = 0 )
assume A2: f = 0. ; :: thesis:
thus ||.f.|| = 0 :: thesis: verum
proof
reconsider g = f as Lipschitzian LinearOperator of X,Y by Def7;
set z = the carrier of X --> (0. Y);
reconsider z = the carrier of X --> (0. Y) as Function of the carrier of X, the carrier of Y ;
consider r0 being object such that
A3: r0 in PreNorms g by XBOOLE_0:def 1;
reconsider r0 = r0 as Real by A3;
A4: ( ( for s being Real st s in PreNorms g holds
s <= 0 ) implies upper_bound () <= 0 ) by SEQ_4:45;
A5: ( not PreNorms g is empty & PreNorms g is bounded_above ) by Th26;
A6: z = g by ;
A7: now :: thesis: for r being Real st r in PreNorms g holds
( 0 <= r & r <= 0 )
let r be Real; :: thesis: ( r in PreNorms g implies ( 0 <= r & r <= 0 ) )
assume r in PreNorms g ; :: thesis: ( 0 <= r & r <= 0 )
then consider t being VECTOR of X such that
A8: r = ||.(g . t).|| and
||.t.|| <= 1 ;
||.(g . t).|| = ||.(0. Y).|| by
.= 0 by NORMSP_0:def 6 ;
hence ( 0 <= r & r <= 0 ) by A8; :: thesis: verum
end;
then 0 <= r0 by A3;
then upper_bound () = 0 by ;
then (BoundedLinearOperatorsNorm (X,Y)) . f = 0 by Th29;
hence ||.f.|| = 0 ; :: thesis: verum
end;
end;
A9: ||.(f + g).|| <= +
proof
reconsider f1 = f, g1 = g, h1 = f + g as Lipschitzian LinearOperator of X,Y by Def7;
A10: ( ( for s being Real st s in PreNorms h1 holds
s <= + ) implies upper_bound (PreNorms h1) <= + ) by SEQ_4:45;
A11: now :: thesis: for t being VECTOR of X st <= 1 holds
||.(h1 . t).|| <= +
let t be VECTOR of X; :: thesis: ( <= 1 implies ||.(h1 . t).|| <= + )
assume A12: ||.t.|| <= 1 ; :: thesis: ||.(h1 . t).|| <= +
0 <= by Th32;
then A13: ||.g.|| * <= * 1 by ;
0 <= by Th32;
then ||.f.|| * <= * 1 by ;
then A14: (||.f.|| * ) + () <= ( * 1) + ( * 1) by ;
A15: ||.((f1 . t) + (g1 . t)).|| <= ||.(f1 . t).|| + ||.(g1 . t).|| by CLVECT_1:def 13;
A16: ||.(g1 . t).|| <= * by Th31;
||.(f1 . t).|| <= * by Th31;
then ||.(f1 . t).|| + ||.(g1 . t).|| <= () + () by ;
then A17: ||.(f1 . t).|| + ||.(g1 . t).|| <= + by ;
||.(h1 . t).|| = ||.((f1 . t) + (g1 . t)).|| by Th34;
hence ||.(h1 . t).|| <= + by ; :: thesis: verum
end;
A18: now :: thesis: for r being Real st r in PreNorms h1 holds
r <= +
let r be Real; :: thesis: ( r in PreNorms h1 implies r <= + )
assume r in PreNorms h1 ; :: thesis:
then ex t being VECTOR of X st
( r = ||.(h1 . t).|| & <= 1 ) ;
hence r <= + by A11; :: thesis: verum
end;
(BoundedLinearOperatorsNorm (X,Y)) . (f + g) = upper_bound (PreNorms h1) by Th29;
hence ||.(f + g).|| <= + by ; :: thesis: verum
end;
A19: ||.(c * f).|| = |.c.| *
proof
reconsider f1 = f, h1 = c * f as Lipschitzian LinearOperator of X,Y by Def7;
A20: ( ( for s being Real st s in PreNorms h1 holds
s <= |.c.| * ) implies upper_bound (PreNorms h1) <= |.c.| * ) by SEQ_4:45;
A21: now :: thesis: for t being VECTOR of X st <= 1 holds
||.(h1 . t).|| <= |.c.| *
A22: 0 <= by Th32;
let t be VECTOR of X; :: thesis: ( <= 1 implies ||.(h1 . t).|| <= |.c.| * )
assume ||.t.|| <= 1 ; :: thesis: ||.(h1 . t).|| <= |.c.| *
then A23: ||.f.|| * <= * 1 by ;
||.(f1 . t).|| <= * by Th31;
then A24: ||.(f1 . t).|| <= by ;
A25: ||.(c * (f1 . t)).|| = |.c.| * ||.(f1 . t).|| by CLVECT_1:def 13;
A26: 0 <= |.c.| by COMPLEX1:46;
||.(h1 . t).|| = ||.(c * (f1 . t)).|| by Th35;
hence ||.(h1 . t).|| <= |.c.| * by ; :: thesis: verum
end;
A27: now :: thesis: for r being Real st r in PreNorms h1 holds
r <= |.c.| *
let r be Real; :: thesis: ( r in PreNorms h1 implies r <= |.c.| * )
assume r in PreNorms h1 ; :: thesis:
then ex t being VECTOR of X st
( r = ||.(h1 . t).|| & <= 1 ) ;
hence r <= |.c.| * by A21; :: thesis: verum
end;
A28: now :: thesis: ( ( c <> 0c & |.c.| * <= ||.(c * f).|| ) or ( c = 0c & ||.(c * f).|| = |.c.| * ) )
per cases ( c <> 0c or c = 0c ) ;
case A29: c <> 0c ; :: thesis: |.c.| * <= ||.(c * f).||
A30: now :: thesis: for t being VECTOR of X st <= 1 holds
||.(f1 . t).|| <= () * ||.(c * f).||
A31: 0 <= ||.(c * f).|| by Th32;
let t be VECTOR of X; :: thesis: ( <= 1 implies ||.(f1 . t).|| <= () * ||.(c * f).|| )
assume ||.t.|| <= 1 ; :: thesis: ||.(f1 . t).|| <= () * ||.(c * f).||
then A32: ||.(c * f).|| * <= ||.(c * f).|| * 1 by ;
||.(h1 . t).|| <= ||.(c * f).|| * by Th31;
then A33: ||.(h1 . t).|| <= ||.(c * f).|| by ;
h1 . t = c * (f1 . t) by Th35;
then A34: (c ") * (h1 . t) = ((c ") * c) * (f1 . t) by CLVECT_1:def 4
.= 1r * (f1 . t) by
.= f1 . t by CLVECT_1:def 5 ;
A35: |.(c ").| = |.c.| " by COMPLEX1:66;
A36: 0 <= |.(c ").| by COMPLEX1:46;
||.((c ") * (h1 . t)).|| = |.(c ").| * ||.(h1 . t).|| by CLVECT_1:def 13;
hence ||.(f1 . t).|| <= () * ||.(c * f).|| by ; :: thesis: verum
end;
A37: now :: thesis: for r being Real st r in PreNorms f1 holds
r <= () * ||.(c * f).||
let r be Real; :: thesis: ( r in PreNorms f1 implies r <= () * ||.(c * f).|| )
assume r in PreNorms f1 ; :: thesis: r <= () * ||.(c * f).||
then ex t being VECTOR of X st
( r = ||.(f1 . t).|| & <= 1 ) ;
hence r <= () * ||.(c * f).|| by A30; :: thesis: verum
end;
A38: ( ( for s being Real st s in PreNorms f1 holds
s <= () * ||.(c * f).|| ) implies upper_bound (PreNorms f1) <= () * ||.(c * f).|| ) by SEQ_4:45;
A39: 0 <= |.c.| by COMPLEX1:46;
(BoundedLinearOperatorsNorm (X,Y)) . f = upper_bound (PreNorms f1) by Th29;
then ||.f.|| <= () * ||.(c * f).|| by ;
then |.c.| * <= |.c.| * (() * ||.(c * f).||) by ;
then A40: |.c.| * <= (|.c.| * ()) * ||.(c * f).|| ;
|.c.| <> 0 by ;
then |.c.| * <= 1 * ||.(c * f).|| by ;
hence |.c.| * <= ||.(c * f).|| ; :: thesis: verum
end;
case A41: c = 0c ; :: thesis: ||.(c * f).|| = |.c.| *
reconsider fz = f as VECTOR of ;
c * f = (Mult_ ((),())) . [c,f] by CLVECT_1:def 1
.= c * fz by CLVECT_1:def 1
.= 0. by
.= 0. ;
hence ||.(c * f).|| = |.c.| * by ; :: thesis: verum
end;
end;
end;
(BoundedLinearOperatorsNorm (X,Y)) . (c * f) = upper_bound (PreNorms h1) by Th29;
then ||.(c * f).|| <= |.c.| * by ;
hence ||.(c * f).|| = |.c.| * by ; :: thesis: verum
end;
now :: thesis: ( = 0 implies f = 0. )
reconsider g = f as Lipschitzian LinearOperator of X,Y by Def7;
set z = the carrier of X --> (0. Y);
reconsider z = the carrier of X --> (0. Y) as Function of the carrier of X, the carrier of Y ;
assume A42: ||.f.|| = 0 ; :: thesis:
now :: thesis: for t being VECTOR of X holds g . t = z . t
let t be VECTOR of X; :: thesis: g . t = z . t
||.(g . t).|| <= * by Th31;
then ||.(g . t).|| = 0 by ;
hence g . t = 0. Y by NORMSP_0:def 5
.= z . t by FUNCOP_1:7 ;
:: thesis: verum
end;
then g = z by FUNCT_2:63;
hence f = 0. by Th30; :: thesis: verum
end;
hence ( ( ||.f.|| = 0 implies f = 0. ) & ( f = 0. implies = 0 ) & ||.(c * f).|| = |.c.| * & ||.(f + g).|| <= + ) by A1, A19, A9; :: thesis: verum