A1: for u, v being VECTOR of l2_Space holds (seq_id u) (#) (seq_id v) is summable
proof
set q0 = 1 / 2;
let u, v be VECTOR of l2_Space; :: thesis: (seq_id u) (#) (seq_id v) is summable
set p = (seq_id v) (#) (seq_id v);
set q = (seq_id u) (#) (seq_id u);
set r = abs ((seq_id u) (#) (seq_id v));
A2: for n being Element of NAT holds 0 <= (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n
proof
set rr = (seq_id u) (#) (seq_id v);
let n be Element of NAT ; :: thesis: 0 <= (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n
reconsider tt = abs (((seq_id u) (#) (seq_id v)) . n) as Real ;
A3: 0 <= tt by COMPLEX1:46;
(2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n = 2 * ((abs ((seq_id u) (#) (seq_id v))) . n) by SEQ_1:9
.= 2 * (abs (((seq_id u) (#) (seq_id v)) . n)) by SEQ_1:12 ;
hence 0 <= (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n by A3; :: thesis: verum
end;
A4: for n being Element of NAT holds (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n <= (((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u))) . n
proof
set s = seq_id v;
set t = seq_id u;
let n be Element of NAT ; :: thesis: (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n <= (((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u))) . n
reconsider sn = (seq_id v) . n, tn = (seq_id u) . n as Real ;
reconsider ss = abs sn, tt = abs tn as Real ;
A5: (((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u))) . n = (((seq_id v) (#) (seq_id v)) . n) + (((seq_id u) (#) (seq_id u)) . n) by SEQ_1:7
.= (((seq_id v) . n) * ((seq_id v) . n)) + (((seq_id u) (#) (seq_id u)) . n) by SEQ_1:8
.= (sn ^2) + (((seq_id u) . n) * ((seq_id u) . n)) by SEQ_1:8
.= ((abs sn) ^2) + (tn ^2) by COMPLEX1:75
.= ((abs sn) ^2) + ((abs tn) ^2) by COMPLEX1:75 ;
A6: 0 <= ((abs sn) - (abs tn)) ^2 by XREAL_1:63;
(2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n = 2 * ((abs ((seq_id u) (#) (seq_id v))) . n) by SEQ_1:9
.= 2 * (abs (((seq_id u) (#) (seq_id v)) . n)) by SEQ_1:12
.= 2 * (abs (((seq_id u) . n) * ((seq_id v) . n))) by SEQ_1:8
.= 2 * (ss * tt) by COMPLEX1:65
.= (2 * (abs sn)) * (abs tn) ;
then 0 + ((2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n) <= (((((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u))) . n) - ((2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n)) + ((2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n) by A5, A6, XREAL_1:7;
hence (2 (#) (abs ((seq_id u) (#) (seq_id v)))) . n <= (((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u))) . n ; :: thesis: verum
end;
A7: (1 / 2) (#) (2 (#) (abs ((seq_id u) (#) (seq_id v)))) = ((1 / 2) * 2) (#) (abs ((seq_id u) (#) (seq_id v))) by SEQ_1:23
.= abs ((seq_id u) (#) (seq_id v)) by SEQ_1:27 ;
( (seq_id v) (#) (seq_id v) is summable & (seq_id u) (#) (seq_id u) is summable ) by RSSPACE:def 11, RSSPACE:def 13;
then ((seq_id v) (#) (seq_id v)) + ((seq_id u) (#) (seq_id u)) is summable by SERIES_1:7;
then 2 (#) (abs ((seq_id u) (#) (seq_id v))) is summable by A2, A4, SERIES_1:20;
then abs ((seq_id u) (#) (seq_id v)) is summable by A7, SERIES_1:10;
then (seq_id u) (#) (seq_id v) is absolutely_summable by SERIES_1:def 4;
hence (seq_id u) (#) (seq_id v) is summable by SERIES_1:35; :: thesis: verum
end;
A8: for x being set holds
( x is Element of l2_Space iff ( x is Real_Sequence & (seq_id x) (#) (seq_id x) is summable ) )
proof end;
A9: for v, w being VECTOR of l2_Space holds v .|. w = Sum ((seq_id v) (#) (seq_id w))
proof
let v, w be VECTOR of l2_Space; :: thesis: v .|. w = Sum ((seq_id v) (#) (seq_id w))
thus v .|. w = the scalar of l2_Space . (v,w) by BHSP_1:def 1
.= Sum ((seq_id v) (#) (seq_id w)) by RSSPACE:def 12, RSSPACE:def 13 ; :: thesis: verum
end;
A10: for u, v being VECTOR of l2_Space holds u + v = (seq_id u) + (seq_id v)
proof end;
A12: for r being Real
for u being VECTOR of l2_Space holds r * u = r (#) (seq_id u)
proof end;
A14: for u being VECTOR of l2_Space holds u = seq_id u
proof end;
A15: for u being VECTOR of l2_Space holds
( - u = - (seq_id u) & seq_id (- u) = - (seq_id u) )
proof
let u be VECTOR of l2_Space; :: thesis: ( - u = - (seq_id u) & seq_id (- u) = - (seq_id u) )
- u = (- 1) * u by RLVECT_1:16
.= (- 1) (#) (seq_id u) by A12
.= - (seq_id u) by SEQ_1:17 ;
hence ( - u = - (seq_id u) & seq_id (- u) = - (seq_id u) ) by A14; :: thesis: verum
end;
A16: for u, v being VECTOR of l2_Space holds u - v = (seq_id u) - (seq_id v)
proof
let u, v be VECTOR of l2_Space; :: thesis: u - v = (seq_id u) - (seq_id v)
thus u - v = (seq_id u) + (seq_id (- v)) by A10
.= (seq_id u) + (- (seq_id v)) by A15
.= (seq_id u) - (seq_id v) by SEQ_1:11 ; :: thesis: verum
end;
0. l2_Space = 0. Linear_Space_of_RealSequences by RSSPACE:def 10, RSSPACE:def 13
.= Zeroseq by RSSPACE:def 7 ;
hence ( the carrier of l2_Space = the_set_of_l2RealSequences & ( for x being set holds
( x is VECTOR of l2_Space iff ( x is Real_Sequence & (seq_id x) (#) (seq_id x) is summable ) ) ) & 0. l2_Space = Zeroseq & ( for u being VECTOR of l2_Space holds u = seq_id u ) & ( for u, v being VECTOR of l2_Space holds u + v = (seq_id u) + (seq_id v) ) & ( for r being Real
for u being VECTOR of l2_Space holds r * u = r (#) (seq_id u) ) & ( for u being VECTOR of l2_Space holds
( - u = - (seq_id u) & seq_id (- u) = - (seq_id u) ) ) & ( for u, v being VECTOR of l2_Space holds u - v = (seq_id u) - (seq_id v) ) & ( for v, w being VECTOR of l2_Space holds
( (seq_id v) (#) (seq_id w) is summable & ( for v, w being VECTOR of l2_Space holds v .|. w = Sum ((seq_id v) (#) (seq_id w)) ) ) ) ) by A8, A14, A10, A12, A15, A16, A1, A9, RSSPACE:def 13; :: thesis: verum