let A be Ordinal; for r being Sequence of REAL
for y being positive decreasing_infinitely Surreal-Sequence st A in (dom r) /\ (dom y) & r . A = 0 holds
Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A)))
let r be Sequence of REAL ; for y being positive decreasing_infinitely Surreal-Sequence st A in (dom r) /\ (dom y) & r . A = 0 holds
Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A)))
let y be positive decreasing_infinitely Surreal-Sequence; ( A in (dom r) /\ (dom y) & r . A = 0 implies Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A))) )
assume A1:
( A in (dom r) /\ (dom y) & r . A = 0 )
; Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A)))
set P = Partial_Sums (r,y);
set SsA = Sum ((r | (succ A)),(y | (succ A)));
set SA = Sum ((r | A),(y | A));
A2:
( succ A in succ ((dom r) /\ (dom y)) & succ ((dom r) /\ (dom y)) = dom (Partial_Sums (r,y)) )
by A1, ORDINAL3:3, SURREALC:def 20;
A in succ A
by ORDINAL1:6;
then A3:
Partial_Sums (r,y),y,r simplest_on_position A
by A2, ORDINAL1:10, SURREALC:def 20;
A4:
Partial_Sums (r,y),y,r simplest_on_position succ A
by A2, SURREALC:def 20;
A5:
(Partial_Sums (r,y)) . (succ A) = Sum ((r | (succ A)),(y | (succ A)))
by Th58, A1, ORDINAL1:21;
A6:
( Sum ((r | (succ A)),(y | (succ A))) in_meets_terms Partial_Sums (r,y),y,r, succ A & ( for x being uSurreal st x in_meets_terms Partial_Sums (r,y),y,r, succ A & x <> Sum ((r | (succ A)),(y | (succ A))) holds
born (Sum ((r | (succ A)),(y | (succ A)))) in born x ) )
by A4, A5, SURREALC:def 18;
A7:
(Partial_Sums (r,y)) . A = Sum ((r | A),(y | A))
by Th58, A1, ORDINAL1:def 2;
Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A)))
proof
assume A8:
Sum (
(r | A),
(y | A))
<> Sum (
(r | (succ A)),
(y | (succ A)))
;
contradiction
Sum (
(r | A),
(y | A))
in_meets_terms Partial_Sums (
r,
y),
y,
r,
succ A
proof
let beta be
Ordinal;
SURREALC:def 17 for b1, b2 being set holds
( not beta in succ A or not b1 = (Partial_Sums (r,y)) . beta or not b2 = y . beta or Sum ((r | A),(y | A)) is b1,b2,r . beta _Term )let sb,
yb be
Surreal;
( not beta in succ A or not sb = (Partial_Sums (r,y)) . beta or not yb = y . beta or Sum ((r | A),(y | A)) is sb,yb,r . beta _Term )
assume A9:
(
beta in succ A &
sb = (Partial_Sums (r,y)) . beta &
yb = y . beta )
;
Sum ((r | A),(y | A)) is sb,yb,r . beta _Term
per cases
( beta = A or beta in A )
by A9, ORDINAL1:8;
suppose A10:
beta = A
;
Sum ((r | A),(y | A)) is sb,yb,r . beta _Term then A11:
|.((Sum ((r | A),(y | A))) - ((Sum ((r | A),(y | A))) + ((uReal . (r . beta)) * yb))).| == |.0_No.|
by SURREALC:48, A1, SURREALN:47, SURREALR:39;
0_No infinitely< yb
then
|.0_No.| infinitely< yb
by SURREALC:def 6;
hence
Sum (
(r | A),
(y | A)) is
sb,
yb,
r . beta _Term
by A11, SURREALC:11, A9, A10, A7, SURREALC:def 14;
verum end; suppose A12:
beta in A
;
Sum ((r | A),(y | A)) is sb,yb,r . beta _Term then
Sum (
(r | A),
(y | A))
in_meets_terms Partial_Sums (
r,
y),
y,
r,
A
by A7, A3, SURREALC:def 18;
hence
Sum (
(r | A),
(y | A)) is
sb,
yb,
r . beta _Term
by A12, A9, SURREALC:def 17;
verum end; end;
end;
then A13:
born (Sum ((r | (succ A)),(y | (succ A)))) in born (Sum ((r | A),(y | A)))
by A4, A5, SURREALC:def 18, A8;
A14:
A <> 0
Sum (
(r | (succ A)),
(y | (succ A)))
in_meets_terms Partial_Sums (
r,
y),
y,
r,
A
proof
let beta be
Ordinal;
SURREALC:def 17 for b1, b2 being set holds
( not beta in A or not b1 = (Partial_Sums (r,y)) . beta or not b2 = y . beta or Sum ((r | (succ A)),(y | (succ A))) is b1,b2,r . beta _Term )let sb,
yb be
Surreal;
( not beta in A or not sb = (Partial_Sums (r,y)) . beta or not yb = y . beta or Sum ((r | (succ A)),(y | (succ A))) is sb,yb,r . beta _Term )
assume A15:
(
beta in A &
sb = (Partial_Sums (r,y)) . beta &
yb = y . beta )
;
Sum ((r | (succ A)),(y | (succ A))) is sb,yb,r . beta _Term
beta in succ A
by A15, ORDINAL1:8;
hence
Sum (
(r | (succ A)),
(y | (succ A))) is
sb,
yb,
r . beta _Term
by A15, A6, SURREALC:def 17;
verum
end;
then
born (Sum ((r | (succ A)),(y | (succ A)))) in born (Sum ((r | (succ A)),(y | (succ A))))
by A13, A14, A7, A3, SURREALC:def 18;
hence
contradiction
;
verum
end;
hence
Sum ((r | A),(y | A)) = Sum ((r | (succ A)),(y | (succ A)))
; verum