:: BROUWER semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
set T2 = TOP-REAL 2;
Lm1:
[#] (TOP-REAL 2) = the carrier of (TOP-REAL 2)
by PRE_TOPC:12;
:: deftheorem defines DiffElems BROUWER:def 1 :
theorem :: BROUWER:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: BROUWER:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines Tdisk BROUWER:def 2 :
theorem Th3: :: BROUWER:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: BROUWER:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: BROUWER:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let n be non
empty Nat;
let o be
Point of
(TOP-REAL n);
let s,
t be
Point of
(TOP-REAL n);
let r be
real non
negative number ;
assume that A1:
s is
Point of
(Tdisk o,r)
and A2:
t is
Point of
(Tdisk o,r)
and A3:
s <> t
;
func HC s,
t,
o,
r -> Point of
(TOP-REAL n) means :
Def3:
:: BROUWER:def 3
(
it in (halfline s,t) /\ (Sphere o,r) &
it <> s );
existence
ex b1 being Point of (TOP-REAL n) st
( b1 in (halfline s,t) /\ (Sphere o,r) & b1 <> s )
uniqueness
for b1, b2 being Point of (TOP-REAL n) st b1 in (halfline s,t) /\ (Sphere o,r) & b1 <> s & b2 in (halfline s,t) /\ (Sphere o,r) & b2 <> s holds
b1 = b2
end;
:: deftheorem Def3 defines HC BROUWER:def 3 :
theorem Th6: :: BROUWER:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BROUWER:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
a being
real number for
r being
real non
negative number for
n being non
empty Nat for
s,
t,
o being
Point of
(TOP-REAL n) for
S,
T,
O being
Element of
REAL n st
S = s &
T = t &
O = o &
s is
Point of
(Tdisk o,r) &
t is
Point of
(Tdisk o,r) &
s <> t &
a = ((- |((t - s),(s - o))|) + (sqrt ((|((t - s),(s - o))| ^2 ) - ((Sum (sqr (T - S))) * ((Sum (sqr (S - O))) - (r ^2 )))))) / (Sum (sqr (T - S))) holds
HC s,
t,
o,
r = ((1 - a) * s) + (a * t)
theorem Th8: :: BROUWER:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
a being
real number for
r being
real non
negative number for
r1,
r2,
s1,
s2 being
real number for
s,
t,
o being
Point of
(TOP-REAL 2) st
s is
Point of
(Tdisk o,r) &
t is
Point of
(Tdisk o,r) &
s <> t &
r1 = (t `1 ) - (s `1 ) &
r2 = (t `2 ) - (s `2 ) &
s1 = (s `1 ) - (o `1 ) &
s2 = (s `2 ) - (o `2 ) &
a = ((- ((s1 * r1) + (s2 * r2))) + (sqrt ((((s1 * r1) + (s2 * r2)) ^2 ) - (((r1 ^2 ) + (r2 ^2 )) * (((s1 ^2 ) + (s2 ^2 )) - (r ^2 )))))) / ((r1 ^2 ) + (r2 ^2 )) holds
HC s,
t,
o,
r = |[((s `1 ) + (a * r1)),((s `2 ) + (a * r2))]|
definition
let n be non
empty Nat;
let o be
Point of
(TOP-REAL n);
let r be
real non
negative number ;
let x be
Point of
(Tdisk o,r);
let f be
Function of
(Tdisk o,r),
(Tdisk o,r);
assume A1:
not
x is_a_fixpoint_of f
;
func HC x,
f -> Point of
(Tcircle o,r) means :
Def4:
:: BROUWER:def 4
ex
y,
z being
Point of
(TOP-REAL n) st
(
y = x &
z = f . x &
it = HC z,
y,
o,
r );
existence
ex b1 being Point of (Tcircle o,r) ex y, z being Point of (TOP-REAL n) st
( y = x & z = f . x & b1 = HC z,y,o,r )
uniqueness
for b1, b2 being Point of (Tcircle o,r) st ex y, z being Point of (TOP-REAL n) st
( y = x & z = f . x & b1 = HC z,y,o,r ) & ex y, z being Point of (TOP-REAL n) st
( y = x & z = f . x & b2 = HC z,y,o,r ) holds
b1 = b2
;
end;
:: deftheorem Def4 defines HC BROUWER:def 4 :
for
n being non
empty Nat for
o being
Point of
(TOP-REAL n) for
r being
real non
negative number for
x being
Point of
(Tdisk o,r) for
f being
Function of
(Tdisk o,r),
(Tdisk o,r) st not
x is_a_fixpoint_of f holds
for
b6 being
Point of
(Tcircle o,r) holds
(
b6 = HC x,
f iff ex
y,
z being
Point of
(TOP-REAL n) st
(
y = x &
z = f . x &
b6 = HC z,
y,
o,
r ) );
theorem Th9: :: BROUWER:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: BROUWER:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let n be non
empty Nat;
let r be
real non
negative number ;
let o be
Point of
(TOP-REAL n);
let f be
Function of
(Tdisk o,r),
(Tdisk o,r);
func BR-map f -> Function of
(Tdisk o,r),
(Tcircle o,r) means :
Def5:
:: BROUWER:def 5
for
x being
Point of
(Tdisk o,r) holds
it . x = HC x,
f;
existence
ex b1 being Function of (Tdisk o,r),(Tcircle o,r) st
for x being Point of (Tdisk o,r) holds b1 . x = HC x,f
uniqueness
for b1, b2 being Function of (Tdisk o,r),(Tcircle o,r) st ( for x being Point of (Tdisk o,r) holds b1 . x = HC x,f ) & ( for x being Point of (Tdisk o,r) holds b2 . x = HC x,f ) holds
b1 = b2
end;
:: deftheorem Def5 defines BR-map BROUWER:def 5 :
theorem Th11: :: BROUWER:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BROUWER:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: BROUWER:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: BROUWER:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BROUWER:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)