:: TOPALG_3 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
set I = the carrier of I[01] ;
set R = the carrier of R^1 ;
Lm1:
the carrier of [:I[01] ,I[01] :] = [:the carrier of I[01] ,the carrier of I[01] :]
by BORSUK_1:def 5;
reconsider j0 = 0, j1 = 1 as Point of I[01] by BORSUK_1:def 17, BORSUK_1:def 18;
theorem :: TOPALG_3:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: TOPALG_3:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: TOPALG_3:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: TOPALG_3:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: TOPALG_3:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: TOPALG_3:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: TOPALG_3:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: TOPALG_3:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: TOPALG_3:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
S,
T,
T1,
T2,
Y being non
empty TopSpace for
f being
Function of
[:Y,T1:],
S for
g being
Function of
[:Y,T2:],
S for
F1,
F2 being
closed Subset of
T st
T1 is
SubSpace of
T &
T2 is
SubSpace of
T &
F1 = [#] T1 &
F2 = [#] T2 &
([#] T1) \/ ([#] T2) = [#] T &
f is
continuous &
g is
continuous & ( for
p being
set st
p in ([#] [:Y,T1:]) /\ ([#] [:Y,T2:]) holds
f . p = g . p ) holds
ex
h being
Function of
[:Y,T:],
S st
(
h = f +* g &
h is
continuous )
theorem :: TOPALG_3:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
S,
T,
T1,
T2,
Y being non
empty TopSpace for
f being
Function of
[:T1,Y:],
S for
g being
Function of
[:T2,Y:],
S for
F1,
F2 being
closed Subset of
T st
T1 is
SubSpace of
T &
T2 is
SubSpace of
T &
F1 = [#] T1 &
F2 = [#] T2 &
([#] T1) \/ ([#] T2) = [#] T &
f is
continuous &
g is
continuous & ( for
p being
set st
p in ([#] [:T1,Y:]) /\ ([#] [:T2,Y:]) holds
f . p = g . p ) holds
ex
h being
Function of
[:T,Y:],
S st
(
h = f +* g &
h is
continuous )
theorem :: TOPALG_3:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: TOPALG_3:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: TOPALG_3:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: TOPALG_3:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: TOPALG_3:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
S,
T being non
empty TopSpace for
f being
continuous Function of
S,
T for
a,
b being
Point of
S for
P,
Q being
Path of
a,
b for
P1,
Q1 being
Path of
f . a,
f . b for
F being
Homotopy of
P,
Q st
P,
Q are_homotopic &
P1 = f * P &
Q1 = f * Q holds
f * F is
Homotopy of
P1,
Q1
theorem Th30: :: TOPALG_3:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
S,
T being non
empty TopSpace for
f being
continuous Function of
S,
T for
a,
b,
c being
Point of
S for
P being
Path of
a,
b for
Q being
Path of
b,
c for
P1 being
Path of
f . a,
f . b for
Q1 being
Path of
f . b,
f . c st
a,
b are_connected &
b,
c are_connected &
P1 = f * P &
Q1 = f * Q holds
P1 + Q1 = f * (P + Q)
theorem Th31: :: TOPALG_3:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let S,
T be non
empty TopSpace;
let s be
Point of
S;
let f be
Function of
S,
T;
assume A1:
f is
continuous
;
set pS =
pi_1 S,
s;
set pT =
pi_1 T,
(f . s);
func FundGrIso f,
s -> Function of
(pi_1 S,s),
(pi_1 T,(f . s)) means :
Def1:
:: TOPALG_3:def 1
for
x being
Element of
(pi_1 S,s) ex
ls being
Loop of
s ex
lt being
Loop of
f . s st
(
x = Class (EqRel S,s),
ls &
lt = f * ls &
it . x = Class (EqRel T,(f . s)),
lt );
existence
ex b1 being Function of (pi_1 S,s),(pi_1 T,(f . s)) st
for x being Element of (pi_1 S,s) ex ls being Loop of s ex lt being Loop of f . s st
( x = Class (EqRel S,s),ls & lt = f * ls & b1 . x = Class (EqRel T,(f . s)),lt )
uniqueness
for b1, b2 being Function of (pi_1 S,s),(pi_1 T,(f . s)) st ( for x being Element of (pi_1 S,s) ex ls being Loop of s ex lt being Loop of f . s st
( x = Class (EqRel S,s),ls & lt = f * ls & b1 . x = Class (EqRel T,(f . s)),lt ) ) & ( for x being Element of (pi_1 S,s) ex ls being Loop of s ex lt being Loop of f . s st
( x = Class (EqRel S,s),ls & lt = f * ls & b2 . x = Class (EqRel T,(f . s)),lt ) ) holds
b1 = b2
end;
:: deftheorem Def1 defines FundGrIso TOPALG_3:def 1 :
for
S,
T being non
empty TopSpace for
s being
Point of
S for
f being
Function of
S,
T st
f is
continuous holds
for
b5 being
Function of
(pi_1 S,s),
(pi_1 T,(f . s)) holds
(
b5 = FundGrIso f,
s iff for
x being
Element of
(pi_1 S,s) ex
ls being
Loop of
s ex
lt being
Loop of
f . s st
(
x = Class (EqRel S,s),
ls &
lt = f * ls &
b5 . x = Class (EqRel T,(f . s)),
lt ) );
theorem :: TOPALG_3:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let S,
T be non
empty TopSpace;
let s be
Point of
S;
let f be
continuous Function of
S,
T;
:: original: FundGrIsoredefine func FundGrIso f,
s -> Homomorphism of
(pi_1 S,s),
(pi_1 T,(f . s));
coherence
FundGrIso f,s is Homomorphism of (pi_1 S,s),(pi_1 T,(f . s))
end;
theorem Th33: :: TOPALG_3:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: TOPALG_3:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)