let n be Nat; for f being PartFunc of REAL,REAL st f is_C^1-Class_on ['0,1'] holds
(Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) <= (1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . n)
let f be PartFunc of REAL,REAL; ( f is_C^1-Class_on ['0,1'] implies (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) <= (1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . n) )
set n1 = n + 1;
set F1 = (In ((1 / (n + 1)),F_Real)) * (step_ (f,n));
assume A1:
f is_C^1-Class_on ['0,1']
; (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) <= (1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . n)
A2:
len (UPBND_rng_d (f,n)) = n + 1
by Def8;
then A3:
dom (UPBND_rng_d (f,n)) = Seg (n + 1)
by FINSEQ_1:def 3;
reconsider r1 = 1 / (n + 1) as Real ;
reconsider r2 = 1 / (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A4:
dom (r1 * (UPBND_rng_d (f,n))) = dom (UPBND_rng_d (f,n))
by VALUED_1:def 5;
A5:
vol ['0,1'] = 1 - 0
by INTEGRA6:5;
then A6:
EqDiv (['0,1'],(n + 1)) divide_into_equal n + 1
by MESFUN14:def 1;
then A7:
len (EqDiv (['0,1'],(n + 1))) = n + 1
by INTEGRA4:def 1;
set Dn = EqDiv (['0,1'],(n + 1));
A8: len (upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) =
len (EqDiv (['0,1'],(n + 1)))
by INTEGRA1:def 6
.=
n + 1
by A6, INTEGRA4:def 1
;
for k being Nat st k in dom (upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) holds
(upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (UPBND_rng_d (f,n))) . k
proof
let k be
Nat;
( k in dom (upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) implies (upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (UPBND_rng_d (f,n))) . k )
assume
k in dom (upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1)))))
;
(upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (UPBND_rng_d (f,n))) . k
then A10:
k in Seg (n + 1)
by A8, FINSEQ_1:def 3;
then A11:
k in dom (EqDiv (['0,1'],(n + 1)))
by A7, FINSEQ_1:def 3;
then A12:
vol (divset ((EqDiv (['0,1'],(n + 1))),k)) = 1
/ (n + 1)
by A5, A6, MESFUN14:15;
(k -' 1) / (n + 1) <= k / (n + 1)
by NAT_D:35, XREAL_1:72;
then A13:
['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).]
by INTEGRA5:def 3;
A14:
@' (
f,
['0,1'])
= (f `| rohl) | ['0,1']
by A1, Def6;
A15:
k in dom (UPBND_rng_d (f,n))
by A2, FINSEQ_1:def 3, A10;
then (r1 * (UPBND_rng_d (f,n))) . k =
(1 / (n + 1)) * ((UPBND_rng_d (f,n)) . k)
by A4, VALUED_1:def 5
.=
(upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']))) * (1 / (n + 1))
by A15, Def8
.=
(upper_bound (rng ((f `| rohl) | (divset ((EqDiv (['0,1'],(n + 1))),k))))) * (vol (divset ((EqDiv (['0,1'],(n + 1))),k)))
by A12, A10, Th1, A13
.=
(upper_bound (rng (((f `| rohl) | ['0,1']) | (divset ((EqDiv (['0,1'],(n + 1))),k))))) * (vol (divset ((EqDiv (['0,1'],(n + 1))),k)))
by A11, INTEGRA1:8, RELAT_1:74
.=
(upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k
by A14, A11, INTEGRA1:def 6
;
hence
(upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (UPBND_rng_d (f,n))) . k
;
verum
end;
then A16:
upper_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1)))) = r1 * (UPBND_rng_d (f,n))
by A3, A4, A8, FINSEQ_1:def 3;
n in NAT
by ORDINAL1:def 12;
then A18: upper_sum ((@' (f,['0,1'])),(D[01] . n)) =
Sum (r1 * (UPBND_rng_d (f,n)))
by A16, Def1
.=
Sum (r1 * (@ (UPBND_rng_d (f,n))))
by MATRTOP1:def 2
.=
r1 * (Sum (@ (UPBND_rng_d (f,n))))
by RVSUM_1:87
;
reconsider r1 = 1 / (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A19: dom ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) =
dom (step_ (f,n))
by POLYNOM1:def 1
.=
Seg (n + 1)
by Def14
;
then A20:
dom ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) = dom ('G' (f,n))
by Def13;
reconsider H = UPBND_rng_d (f,n) as FinSequence of F_Real ;
reconsider FG = ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)) as FinSequence of F_Real ;
reconsider r3 = 2 * (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A21:
dom (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))) = Seg (n + 1)
by A19, BINOM:def 1;
Seg (len (r3 * FG)) =
Seg (len (FG * r3))
by BINOM:6
.=
dom (FG * r3)
by FINSEQ_1:def 3
.=
dom FG
by POLYNOM1:def 2
.=
Seg (len FG)
by FINSEQ_1:def 3
;
then A22: len (r3 * FG) =
len FG
by FINSEQ_1:6
.=
n + 1
by A21, FINSEQ_1:def 3
;
len (UPBND_rng_d (f,n)) = n + 1
by Def8;
then A23:
dom (UPBND_rng_d (f,n)) = Seg (n + 1)
by FINSEQ_1:def 3;
dom (r2 * (UPBND_rng_d (f,n))) = dom (UPBND_rng_d (f,n))
by POLYNOM1:def 1;
then A24: len (r2 * (UPBND_rng_d (f,n))) =
len (UPBND_rng_d (f,n))
by FINSEQ_3:29
.=
n + 1
by Def8
;
A25:
for k being Nat st k in dom (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) holds
(r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k <= (r2 * (UPBND_rng_d (f,n))) . k
proof
let k be
Nat;
( k in dom (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) implies (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k <= (r2 * (UPBND_rng_d (f,n))) . k )
assume A26:
k in dom (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))))
;
(r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k <= (r2 * (UPBND_rng_d (f,n))) . k
then A27:
k in Seg (n + 1)
by A22, FINSEQ_1:def 3;
A28:
k in dom FG
by A21, A22, FINSEQ_1:def 3, A26;
then A29:
r3 * (FG . k) =
r3 * (FG /. k)
by PARTFUN1:def 6
.=
(r3 * FG) /. k
by A28, POLYNOM1:def 1
.=
(r3 * FG) . k
by A26, PARTFUN1:def 6
;
A30:
dom H = dom (r2 * H)
by POLYNOM1:def 1;
A31:
k in dom H
by A23, A22, FINSEQ_1:def 3, A26;
k in dom (r2 * H)
by A30, A23, A22, FINSEQ_1:def 3, A26;
then A33:
(r2 * H) . k =
(r2 * H) /. k
by PARTFUN1:def 6
.=
r2 * (H /. k)
by A31, POLYNOM1:def 1
.=
r2 * (H . k)
by A31, PARTFUN1:def 6
;
(((1 / (n + 1)) ^2) / 2) * (2 * (n + 1)) =
(1 / (n + 1)) * ((1 / (n + 1)) * (n + 1))
.=
(1 / (n + 1)) * 1
by XCMPLX_1:87
;
then A35:
((((UPBND_rng_d (f,n)) . k) * ((1 / (n + 1)) ^2)) / 2) * (2 * (n + 1)) = ((UPBND_rng_d (f,n)) . k) * (1 / (n + 1))
;
(((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))) . k = integral (
((const (f . (k / (n + 1)))) + (- f)),
((k -' 1) / (n + 1)),
(k / (n + 1)))
by Lm24, A1, A27;
hence
(r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k <= (r2 * (UPBND_rng_d (f,n))) . k
by A29, A33, A35, XREAL_1:64, Lm23, A1, A27;
verum
end;
A37: Sum (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) =
r3 * (Sum (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))))
by FVSUM_1:73
.=
r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (Sum ('G' (f,n))))
by A20, BINOM:7
.=
r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1)))
by Lm22, A1
;
reconsider rf = Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) as Element of F_Real ;
reconsider r0 = n + 1 as Element of F_Real by VECTSP_1:def 5, XREAL_0:def 1;
A38:
r0 * r1 = In (1,REAL)
by XCMPLX_1:106;
A39: r0 * ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) =
(r0 * r1) * (step_ (f,n))
by Lm25
.=
step_ (f,n)
by Lm26, A38, VECTSP_1:def 5
;
A40: (n + 1) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) =
(r0 * (Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))))) + (r0 * (integral ((- f),0,1)))
.=
(Sum (step_ (f,n))) + (r0 * (integral ((- f),0,1)))
by A39, FVSUM_1:73
;
A41: Sum (r2 * (UPBND_rng_d (f,n))) =
r2 * (Sum (UPBND_rng_d (f,n)))
by FVSUM_1:73
.=
upper_sum ((@' (f,['0,1'])),(D[01] . n))
by A18, MATRPROB:36, MATRTOP1:def 2
;
r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) <= upper_sum ((@' (f,['0,1'])),(D[01] . n))
by A37, A41, A25, A24, A22, E_TRANS1:2;
then
(2 * (n + 1)) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) <= (upper_sum ((@' (f,['0,1'])),D[01])) . n
by INTEGRA2:def 2;
then
(1 / 2) * ((2 * (n + 1)) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1)))) <= (1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . n)
by XREAL_1:64;
hence
(Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) <= (1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . n)
by A40; verum