begin
The collection of all homeomorphisms of a topological space onto itself forms a group
under composition. This file develops that group structure, connecting the theory of
topological spaces with the algebraic theory of groups.
Group of homeomorphisms
We show that the homeomorphisms of a topological space onto itself form a group
under composition, and compute this group for several concrete topologies.
First, we define the set of homeomorphisms.
The homeomorphisms are closed by composition.
The identity function is a homeomorphism.
The homeomorphisms form a monoid and its neutral element is the identity.
The homeomorphisms form a group, with the composition.
Examples computed
We compute \(\text{HomeoG}\) for several concrete topologies: the cocardinal topology,
the excluded set topology, the included set topology, and the order topology.
For the cocardinal topology every bijection is a homeomorphism, so \(\text{HomeoG}\)
equals \(\text{bij}(X,X)\).
The homeomorphisms of the excluded set topology are exactly the bijections of \(X\)
that map \(X\setminus T\) to itself.
Continuity in the included set topology implies continuity in the excluded set topology.
Continuity in the excluded set topology implies continuity in the included set topology.
By the previous two lemmas, the homeomorphism groups of the included and excluded
set topologies on \(X\) coincide.
Every order isomorphism of a linearly ordered set is a homeomorphism of
the induced order topology.
lemma homeo_order:
assumes \( \text{IsLinOrder}(X,r) \), \( \exists x y.\ x\neq y\wedge x\in X\wedge y\in X \)
shows \( ord\_iso(X,r,X,r)\subseteq \text{HomeoG}(OrdTopology X r) \)
proof
let \( \mathfrak{B} = \{ \text{IntervalX}(X, r, b, c) .\ \langle b,c\rangle \in X \times X\} \cup \{ \text{LeftRayX}(X, r, b) .\ b \in X\} \cup \)
\( \{ \text{RightRayX}(X, r, b) .\ b \in X\} \)
fix \( f \)
assume \( f\in ord\_iso(X,r,X,r) \)
then have bij: \( f\in \text{bij}(X,X) \) and ord: \( \forall x\in X.\ \forall y\in X.\ \langle x, y\rangle \in r \longleftrightarrow \langle f x, f y\rangle \in r \) unfolding ord_iso_def
have top: \( (OrdTopology X r)\text{ is a topology } \) using Ordtopology_is_a_topology(1), assms(1)
have union: \( \bigcup (OrdTopology X r) = X \) using union_ordtopology, assms
have twoSpac: \( two\_top\_spaces0(OrdTopology X r,OrdTopology X r,f) \) using bij, top, union unfolding two_top_spaces0_def, bij_def, inj_def
{
fix \( c \) \( d \)
assume A: \( c\in X \), \( d\in X \)
{
fix \( x \)
assume AA: \( x\in X \), \( x\neq c \), \( x\neq d \), \( \langle c,x\rangle \in r \), \( \langle x,d\rangle \in r \)
then have \( \langle fc,fx\rangle \in r \), \( \langle fx,fd\rangle \in r \) using A(2,1), ord
moreover {
assume \( fx=fc \vee fx=fd \)
with A(2,1), AA(1) have \( x=c\vee x=d \) using bij unfolding bij_def, inj_def
then have \( False \) using AA(2,3)
}
then have \( fx\neq fc \), \( fx\neq fd \)
moreover have \( fx\in X \) using bij, apply_type, AA(1) unfolding bij_def, inj_def
ultimately have \( fx\in \text{IntervalX}(X,r,fc,fd) \)
unfolding IntervalX_def,
Interval_def
}
then have \( \{fx.\ x\in \text{IntervalX}(X,r,c,d)\}\subseteq \text{IntervalX}(X,r,fc,fd) \) unfolding IntervalX_def, Interval_def
moreover {
fix \( y \)
assume \( y\in \text{IntervalX}(X,r,fc,fd) \)
then have y: \( y\in X \), \( y\neq fc \), \( y\neq fd \), \( \langle fc,y\rangle \in r \), \( \langle y,fd\rangle \in r \) unfolding IntervalX_def, Interval_def
then obtain \( s \) where s: \( s\in X \), \( y=fs \) using bij unfolding bij_def, surj_def
{
assume \( s=c\vee s=d \)
then have \( fs=fc\vee fs=fd \)
then have \( False \) using s(2), y(2,3)
}
then have \( s\neq c \), \( s\neq d \)
moreover have \( \langle c,s\rangle \in r \), \( \langle s,d\rangle \in r \) using y(4,5), s, ord, A(2,1)
moreover note s(1)
ultimately have \( s\in \text{IntervalX}(X,r,c,d) \)
unfolding IntervalX_def,
Interval_def
then have \( y\in \{fx.\ x\in \text{IntervalX}(X,r,c,d)\} \) using s(2)
}
ultimately have \( \{fx.\ x\in \text{IntervalX}(X,r,c,d)\}= \text{IntervalX}(X,r,fc,fd) \)
moreover have \( \text{IntervalX}(X,r,c,d)\subseteq X \) unfolding IntervalX_def
moreover have \( f:X\rightarrow X \) using bij unfolding bij_def, surj_def
ultimately have \( f \text{IntervalX}(X,r,c,d)= \text{IntervalX}(X,r,fc,fd) \)
using func_imagedef
}
then have inter: \( \forall c\in X.\ \forall d\in X.\ f \text{IntervalX}(X,r,c,d)= \text{IntervalX}(X,r,fc,fd) \wedge fc\in X \wedge fd\in X \) using bij unfolding bij_def, inj_def
{
fix \( c \)
assume A: \( c\in X \)
{
fix \( x \)
assume AA: \( x\in X \), \( x\neq c \), \( \langle c,x\rangle \in r \)
then have \( \langle fc,fx\rangle \in r \) using A, ord
moreover {
assume \( fx=fc \)
with A, AA(1) have \( x=c \) using bij unfolding bij_def, inj_def
then have \( False \) using AA(2)
}
then have \( fx\neq fc \)
moreover have \( fx\in X \) using bij, apply_type, AA(1) unfolding bij_def, inj_def
ultimately have \( fx\in \text{RightRayX}(X,r,fc) \)
unfolding RightRayX_def
}
then have \( \{fx.\ x\in \text{RightRayX}(X,r,c)\}\subseteq \text{RightRayX}(X,r,fc) \) unfolding RightRayX_def
moreover {
fix \( y \)
assume \( y\in \text{RightRayX}(X,r,fc) \)
then have y: \( y\in X \), \( y\neq fc \), \( \langle fc,y\rangle \in r \) unfolding RightRayX_def
then obtain \( s \) where s: \( s\in X \), \( y=fs \) using bij unfolding bij_def, surj_def
{
assume \( s=c \)
then have \( fs=fc \)
then have \( False \) using s(2), y(2)
}
then have \( s\neq c \)
moreover have \( \langle c,s\rangle \in r \) using y(3), s, ord, A
moreover note s(1)
ultimately have \( s\in \text{RightRayX}(X,r,c) \)
unfolding RightRayX_def
then have \( y\in \{fx.\ x\in \text{RightRayX}(X,r,c)\} \) using s(2)
}
ultimately have \( \{fx.\ x\in \text{RightRayX}(X,r,c)\}= \text{RightRayX}(X,r,fc) \)
moreover have \( \text{RightRayX}(X,r,c)\subseteq X \) unfolding RightRayX_def
moreover have \( f:X\rightarrow X \) using bij unfolding bij_def, surj_def
ultimately have \( f \text{RightRayX}(X,r,c)= \text{RightRayX}(X,r,fc) \)
using func_imagedef
}
then have rray: \( \forall c\in X.\ f \text{RightRayX}(X,r,c)= \text{RightRayX}(X,r,fc) \wedge fc\in X \) using bij unfolding bij_def, inj_def
{
fix \( c \)
assume A: \( c\in X \)
{
fix \( x \)
assume AA: \( x\in X \), \( x\neq c \), \( \langle x,c\rangle \in r \)
then have \( \langle fx,fc\rangle \in r \) using A, ord
moreover {
assume \( fx=fc \)
with A, AA(1) have \( x=c \) using bij unfolding bij_def, inj_def
then have \( False \) using AA(2)
}
then have \( fx\neq fc \)
moreover from AA(1) have \( fx\in X \) using bij, apply_type unfolding bij_def, inj_def
ultimately have \( fx\in \text{LeftRayX}(X,r,fc) \)
unfolding LeftRayX_def
}
then have \( \{fx.\ x\in \text{LeftRayX}(X,r,c)\}\subseteq \text{LeftRayX}(X,r,fc) \) unfolding LeftRayX_def
moreover {
fix \( y \)
assume \( y\in \text{LeftRayX}(X,r,fc) \)
then have y: \( y\in X \), \( y\neq fc \), \( \langle y,fc\rangle \in r \) unfolding LeftRayX_def
then obtain \( s \) where s: \( s\in X \), \( y=fs \) using bij unfolding bij_def, surj_def
{
assume \( s=c \)
then have \( fs=fc \)
then have \( False \) using s(2), y(2)
}
then have \( s\neq c \)
moreover have \( \langle s,c\rangle \in r \) using y(3), s, ord, A
moreover note s(1)
ultimately have \( s\in \text{LeftRayX}(X,r,c) \)
unfolding LeftRayX_def
then have \( y\in \{fx.\ x\in \text{LeftRayX}(X,r,c)\} \) using s(2)
}
ultimately have \( \{fx.\ x\in \text{LeftRayX}(X,r,c)\}= \text{LeftRayX}(X,r,fc) \)
moreover have \( \text{LeftRayX}(X,r,c)\subseteq X \) unfolding LeftRayX_def
moreover have \( f:X\rightarrow X \) using bij unfolding bij_def, surj_def
ultimately have \( f \text{LeftRayX}(X,r,c)= \text{LeftRayX}(X,r,fc) \)
using func_imagedef
}
then have lray: \( \forall c\in X.\ f \text{LeftRayX}(X,r,c)= \text{LeftRayX}(X,r,fc)\wedge fc\in X \) using bij unfolding bij_def, inj_def
have r1: \( \forall U\in \mathfrak{B} .\ fU\in \mathfrak{B} \)
proof
fix \( U \)
assume A: \( U\in \mathfrak{B} \)
{
assume \( U\in \{ \text{IntervalX}(X, r, b, c) .\ \langle b,c\rangle \in X \times X\} \)
with inter have \( fU\in \{ \text{IntervalX}(X, r, b, c) .\ \langle b,c\rangle \in X \times X\} \)
then have \( fU\in \mathfrak{B} \)
}
moreover {
assume \( U\in \{ \text{LeftRayX}(X, r, b) .\ b \in X\} \)
with lray have \( fU\in \{ \text{LeftRayX}(X, r, b) .\ b \in X\} \)
then have \( fU\in \mathfrak{B} \)
}
moreover {
assume \( U\in \{ \text{RightRayX}(X,r,b).\ b\in X\} \)
with rray have \( fU\in \{ \text{RightRayX}(X,r,b).\ b\in X\} \)
then have \( fU\in \mathfrak{B} \)
}
moreover note A
ultimately show \( fU\in \mathfrak{B} \)
qed
from Ordtopology_is_a_topology(2), assms(1) have base: \( \mathfrak{B} \text{ is a base for }(OrdTopology X r) \)
then have r2: \( \mathfrak{B} \subseteq (OrdTopology X r) \) using base_sets_open
{
fix \( U \)
assume \( U\in \mathfrak{B} \)
with r1 have \( fU\in \mathfrak{B} \)
with r2 have \( fU\in (OrdTopology X r) \)
}
then have \( \forall U\in \mathfrak{B} .\ fU\in (OrdTopology X r) \)
moreover from twoSpac have \( \bigwedge U.\ \mathfrak{B} \text{ is a base for } (OrdTopology X r) \Longrightarrow \)
\( \forall B\in \mathfrak{B} .\ f B \in (OrdTopology X r) \Longrightarrow \)
\( U \in (OrdTopology X r) \Longrightarrow f U \in (OrdTopology X r) \) using base_image_open
ultimately have f_open: \( \forall U\in (OrdTopology X r).\ fU\in (OrdTopology X r) \)
using Ordtopology_is_a_topology(2), assms(1)
{
fix \( c \) \( d \)
assume A: \( c\in X \), \( d\in X \)
then obtain \( cc \) \( dd \) where pre: \( fcc=c \), \( fdd=d \), \( cc\in X \), \( dd\in X \) using bij unfolding bij_def, surj_def
with inter have \( f \text{IntervalX}(X, r, cc, dd) = \text{IntervalX}(X, r, c, d) \)
then have \( f^{-1}(f \text{IntervalX}(X, r, cc, dd)) = f^{-1}( \text{IntervalX}(X, r, c, d)) \)
moreover have \( \text{IntervalX}(X, r, cc, dd)\subseteq X \) unfolding IntervalX_def
moreover have \( f\in \text{inj}(X,X) \) using bij unfolding bij_def
ultimately have \( \text{IntervalX}(X, r, cc, dd)=f^{-1} \text{IntervalX}(X, r, c, d) \)
using inj_vimage_image
moreover from pre(3,4) have \( \text{IntervalX}(X, r, cc, dd)\in \{ \text{IntervalX}(X,r,e1,e2).\ \langle e1,e2\rangle \in X\times X\} \)
then have \( \text{IntervalX}(X, r, cc, dd)\in \mathfrak{B} \)
with r2 have \( \text{IntervalX}(X, r, cc, dd)\in (OrdTopology X r) \)
ultimately have \( f^{-1} \text{IntervalX}(X, r, c, d)\in (OrdTopology X r) \)
}
then have inter: \( \forall c\in X.\ \forall d\in X.\ f^{-1} \text{IntervalX}(X, r, c, d)\in (OrdTopology X r) \)
{
fix \( c \)
assume A: \( c\in X \)
then obtain \( cc \) where pre: \( fcc=c \), \( cc\in X \) using bij unfolding bij_def, surj_def
with rray have \( f \text{RightRayX}(X, r, cc) = \text{RightRayX}(X, r, c) \)
then have \( f^{-1}(f \text{RightRayX}(X, r, cc)) = f^{-1}( \text{RightRayX}(X, r, c)) \)
moreover have \( \text{RightRayX}(X, r, cc)\subseteq X \) unfolding RightRayX_def
moreover have \( f\in \text{inj}(X,X) \) using bij unfolding bij_def
ultimately have \( \text{RightRayX}(X, r, cc)=f^{-1} \text{RightRayX}(X, r, c) \)
using inj_vimage_image
moreover from pre(2) have \( \text{RightRayX}(X, r, cc)\in \{ \text{RightRayX}(X,r,e2).\ e2\in X\} \)
ultimately have \( f^{-1} \text{RightRayX}(X, r, c)\in (OrdTopology X r) \)
using r2
}
then have rray: \( \forall c\in X.\ f^{-1} \text{RightRayX}(X, r, c)\in (OrdTopology X r) \)
{
fix \( c \)
assume A: \( c\in X \)
then obtain \( cc \) where pre: \( fcc=c \), \( cc\in X \) using bij unfolding bij_def, surj_def
with lray have \( f \text{LeftRayX}(X, r, cc) = \text{LeftRayX}(X, r, c) \)
then have \( f^{-1}(f \text{LeftRayX}(X, r, cc)) = f^{-1}( \text{LeftRayX}(X, r, c)) \)
moreover have \( \text{LeftRayX}(X, r, cc)\subseteq X \) unfolding LeftRayX_def
moreover have \( f\in \text{inj}(X,X) \) using bij unfolding bij_def
ultimately have \( \text{LeftRayX}(X, r, cc)=f^{-1} \text{LeftRayX}(X, r, c) \)
using inj_vimage_image
moreover from pre(2) have \( \text{LeftRayX}(X, r, cc)\in \{ \text{LeftRayX}(X,r,e2).\ e2\in X\} \)
ultimately have \( f^{-1} \text{LeftRayX}(X, r, c)\in (OrdTopology X r) \)
using r2
}
then have lray: \( \forall c\in X.\ f^{-1} \text{LeftRayX}(X, r, c)\in (OrdTopology X r) \)
{
fix \( U \)
assume \( U\in \{ \text{IntervalX}(X, r, b, c) .\ \langle b,c\rangle \in X \times X\} \cup \{ \text{LeftRayX}(X, r, b) .\ b \in X\} \cup \{ \text{RightRayX}(X, r, b) .\ b \in X\} \)
with lray, inter, rray have \( f^{-1}U\in (OrdTopology X r) \)
}
then have \( \forall U\in \{ \text{IntervalX}(X, r, b, c) .\ \langle b,c\rangle \in X \times X\} \cup \{ \text{LeftRayX}(X, r, b) .\ b \in X\} \cup \{ \text{RightRayX}(X, r, b) .\ b \in X\}.\ \)
\( f^{-1}U\in (OrdTopology X r) \)
from twoSpac, base, this have fcont: \( \text{IsContinuous}(OrdTopology X r,OrdTopology X r,f) \) by (rule Top_ZF_2_1_L5 )
from assms have \( \bigcup (OrdTopology X r) = X \) using union_ordtopology
with bij have b: \( f\in \text{bij}(\bigcup (OrdTopology X r),\bigcup (OrdTopology X r)) \)
from this, fcont, f_open have \( \text{IsAhomeomorphism}(OrdTopology X r,OrdTopology X r,f) \) by (rule bij_cont_open_homeo )
then show \( f\in \text{HomeoG}(OrdTopology X r) \) using b unfolding bij_def, inj_def, HomeoG_def
qed
Properties preserved by functions
Continuous surjections preserve connectedness and compactness. As consequences,
quotient spaces of connected or compact spaces inherit those properties.
The continuous surjective image of a connected space is connected.
A continuous function from a connected space to a totally-disconnected space
must be constant.
The continuous image of a compact space is compact.
Analogously to the connected case, the continuous image of a compact space
in an anti-compact space is finite.
A quotient of a compact space is compact.
A quotient of a connected space is connected.
end
Definition of HomeoG:
\( \text{HomeoG}(T) \equiv \{f:\bigcup T\rightarrow \bigcup T.\ \text{IsAhomeomorphism}(T,T,f)\} \)
Definition of IsAhomeomorphism:
\( \text{IsAhomeomorphism}(T,S,f) \equiv \)
\( f \in \text{bij}(\bigcup T,\bigcup S) \wedge \text{IsContinuous}(T,S,f) \wedge \text{IsContinuous}(S,T,converse(f)) \)
lemma comp_cont:
assumes \( \text{IsContinuous}(T,S,f) \) and \( \text{IsContinuous}(S,R,g) \)
shows \( \text{IsContinuous}(T,R,g\circ f) \)
lemma func_ZF_5_L2:
assumes \( f:X\rightarrow X \) and \( g:X\rightarrow X \)
shows \( \text{Composition}(X)\langle f,g\rangle = f\circ g \)
lemma id_cont:
shows \( \text{IsContinuous}(\tau ,\tau ,id(\bigcup \tau )) \)
Definition of IsOpClosed:
\( A \text{ is closed under } f \equiv \forall x\in A.\ \forall y\in A.\ f\langle x,y\rangle \in A \)
lemma (in topology0
) homeo_composition:
assumes \( f\in \text{HomeoG}(T) \), \( g\in \text{HomeoG}(T) \)
shows \( \text{Composition}(\bigcup T)\langle f, g\rangle \in \text{HomeoG}(T) \)
lemma (in topology0
) homeo_id:
shows \( id(\bigcup T)\in \text{HomeoG}(T) \)
lemma Group_ZF_2_5_L2:
shows \( \text{IsAmonoid}(X\rightarrow X, \text{Composition}(X)) \), \( id(X) = \text{ TheNeutralElement}(X\rightarrow X, \text{Composition}(X)) \)
lemma Group_ZF_2_5_L2:
shows \( \text{IsAmonoid}(X\rightarrow X, \text{Composition}(X)) \), \( id(X) = \text{ TheNeutralElement}(X\rightarrow X, \text{Composition}(X)) \)
theorem (in monoid0
) group0_1_T1:
assumes \( H \text{ is closed under } f \) and \( H\subseteq G \) and \( \text{ TheNeutralElement}(G,f) \in H \)
shows \( \text{IsAmonoid}(H,\text{restrict}(f,H\times H)) \)
lemma group0_1_L6:
assumes \( \text{IsAmonoid}(G,f) \) and \( H \text{ is closed under } f \) and \( H\subseteq G \) and \( \text{ TheNeutralElement}(G,f) \in H \)
shows \( \text{ TheNeutralElement}(H,\text{restrict}(f,H\times H)) = \text{ TheNeutralElement}(G,f) \)
lemma homeo_inv:
assumes \( \text{IsAhomeomorphism}(T,S,f) \)
shows \( \text{IsAhomeomorphism}(S,T,converse(f)) \)
theorem (in topology0
) homeo_submonoid:
shows \( \text{IsAmonoid}( \text{HomeoG}(T),\text{restrict}( \text{Composition}(\bigcup T), \text{HomeoG}(T)\times \text{HomeoG}(T))) \), \( \text{ TheNeutralElement}( \text{HomeoG}(T),\text{restrict}( \text{Composition}(\bigcup T), \text{HomeoG}(T)\times \text{HomeoG}(T)))=id(\bigcup T) \)
lemma definition_of_group:
assumes \( \text{IsAmonoid}(G,f) \) and \( \forall g\in G.\ \exists b\in G.\ f\langle g,b\rangle = \text{ TheNeutralElement}(G,f) \)
shows \( \text{IsAgroup}(G,f) \)
lemma union_cocardinal:
assumes \( T\neq 0 \)
shows \( \bigcup \text{CoCardinal}(X,T) = X \)
lemma CoCar_is_topology:
assumes \( InfCard (Q) \)
shows \( \text{CoCardinal}(X,Q) \text{ is a topology } \)
lemma closed_sets_cocardinal:
assumes \( T\neq 0 \)
shows \( D \text{ is closed in } \text{CoCardinal}(X,T) \longleftrightarrow (D\in Pow(X) \wedge D\prec T) \vee D=X \)
lemma func1_1_L3:
assumes \( f:X\rightarrow Y \)
shows \( f^{-1}(D) \subseteq X \)
lemma func1_1_L4:
assumes \( f:X\rightarrow Y \)
shows \( f^{-1}(Y) = X \)
lemma (in two_top_spaces0
) Top_ZF_2_1_L4:
assumes \( \forall B.\ ( B \subseteq X_2 \longrightarrow cl_1(f^{-1}(B)) \subseteq f^{-1}(cl_2(B)) ) \)
shows \( f \text{ is continuous } \)
lemma (in two_top_spaces0
) Top_ZF_2_1_L3:
assumes \( \forall A.\ ( A \subseteq X_1 \longrightarrow f(cl_1(A)) \subseteq cl_2(f(A))) \)
shows \( \forall B.\ ( B \subseteq X_2 \longrightarrow cl_1(f^{-1}(B)) \subseteq f^{-1}(cl_2(B)) ) \)
lemma (in two_top_spaces0
) Top_ZF_2_1_L2:
assumes \( \forall D.\ ((D \text{ is closed in } \tau _2) \longrightarrow f^{-1}(D) \text{ is closed in } \tau _1) \) and \( A \subseteq X_1 \)
shows \( f(cl_1(A)) \subseteq cl_2(f(A)) \)
Definition of ExcludedSet:
\( \text{ExcludedSet}(X,U) \equiv \{F\in Pow(X).\ U \cap F=0\}\cup \{X\} \)
Definition of IsContinuous:
\( \text{IsContinuous}(\tau _1,\tau _2,f) \equiv (\forall U\in \tau _2.\ f^{-1}(U) \in \tau _1) \)
lemma surj_range_image_domain:
assumes \( f \in \text{surj}(A,B) \)
shows \( f(A) = B \)
lemma inj_vimage_image:
assumes \( f \in \text{inj}(X,Y) \) and \( A\subseteq X \)
shows \( f^{-1}(f(A)) = A \)
lemma func1_1_L8:
assumes \( A\subseteq B \)
shows \( f(A)\subseteq f(B) \)
lemma bij_cont_open_homeo:
assumes \( f \in \text{bij}(\bigcup T,\bigcup S) \) and \( \text{IsContinuous}(T,S,f) \) and \( \forall U\in T.\ f(U) \in S \)
shows \( \text{IsAhomeomorphism}(T,S,f) \)
lemma union_includedset:
assumes \( T\subseteq X \)
shows \( \bigcup \text{IncludedSet}(X,T) = X \)
lemma closed_sets_includedset:
assumes \( T\subseteq X \)
shows \( D \text{ is closed in } \text{IncludedSet}(X,T) \longleftrightarrow (D\in Pow(X) \wedge (D \cap T)=0)\vee D=X \)
lemma (in two_top_spaces0
) TopZF_2_1_L1:
assumes \( f \text{ is continuous } \) and \( D \text{ is closed in } \tau _2 \)
shows \( f^{-1}(D) \text{ is closed in } \tau _1 \)
Definition of IncludedSet:
\( \text{IncludedSet}(X,U) \equiv \{F\in Pow(X).\ U \subseteq F\} \cup \{0\} \)
lemma closed_sets_excludedset:
shows \( D \text{ is closed in }\text{ExcludedSet}(X,T) \longleftrightarrow (D\in Pow(X) \wedge (X \cap T) \subseteq D) \vee D=0 \)
lemma cont_in_cont_ex:
assumes \( \text{IsContinuous}(\text{IncludedSet}(X,T),\text{IncludedSet}(X,T),f) \), \( f:X\rightarrow X \), \( T\subseteq X \)
shows \( \text{IsContinuous}(\text{ExcludedSet}(X,T),\text{ExcludedSet}(X,T),f) \)
lemma cont_ex_cont_in:
assumes \( \text{IsContinuous}(\text{ExcludedSet}(X,T),\text{ExcludedSet}(X,T),f) \), \( f:X\rightarrow X \), \( T\subseteq X \)
shows \( \text{IsContinuous}(\text{IncludedSet}(X,T),\text{IncludedSet}(X,T),f) \)
theorem homeo_excluded:
assumes \( T \subseteq X \)
shows \( \text{HomeoG}(\text{ExcludedSet}(X,T))=\{f\in \text{bij}(X,X).\ f(X-T)=(X-T)\} \)
theorem Ordtopology_is_a_topology:
assumes \( \text{IsLinOrder}(X,r) \)
shows \( (OrdTopology X r) \text{ is a topology } \)
and \( \{ \text{IntervalX}(X,r,b,c).\ \langle b,c\rangle \in X\times X\}\cup \{ \text{LeftRayX}(X,r,b).\ b\in X\}\cup \{ \text{RightRayX}(X,r,b).\ b\in X\} \text{ is a base for } (OrdTopology X r) \)
lemma union_ordtopology:
assumes \( \text{IsLinOrder}(X,r) \), \( \exists x y.\ x\neq y \wedge x\in X\wedge y\in X \)
shows \( \bigcup (OrdTopology X r)=X \)
Definition of IntervalX:
\( \text{IntervalX}(X,r,b,c)\equiv ( \text{Interval}(r,b,c)\cap X)-\{b,c\} \)
Definition of Interval:
\( \text{Interval}(r,a,b) \equiv r\{a\} \cap r^{-1}\{b\} \)
lemma func_imagedef:
assumes \( f:X\rightarrow Y \) and \( A\subseteq X \)
shows \( f(A) = \{f(x).\ x \in A\} \)
Definition of RightRayX:
\( \text{RightRayX}(X,r,b)\equiv \{c\in X.\ \langle b,c\rangle \in r\}-\{b\} \)
Definition of LeftRayX:
\( \text{LeftRayX}(X,r,b)\equiv \{c\in X.\ \langle c,b\rangle \in r\}-\{b\} \)
lemma base_sets_open:
assumes \( B \text{ is a base for } T \) and \( U \in B \)
shows \( U \in T \)
lemma (in two_top_spaces0
) base_image_open:
assumes \( \mathcal{B} \text{ is a base for } \tau _1 \) and \( \forall B\in \mathcal{B} .\ f(B) \in \tau _2 \) and \( U\in \tau _1 \)
shows \( f(U) \in \tau _2 \)
theorem Ordtopology_is_a_topology:
assumes \( \text{IsLinOrder}(X,r) \)
shows \( (OrdTopology X r) \text{ is a topology } \)
and \( \{ \text{IntervalX}(X,r,b,c).\ \langle b,c\rangle \in X\times X\}\cup \{ \text{LeftRayX}(X,r,b).\ b\in X\}\cup \{ \text{RightRayX}(X,r,b).\ b\in X\} \text{ is a base for } (OrdTopology X r) \)
lemma (in two_top_spaces0
) Top_ZF_2_1_L5:
assumes \( B \text{ is a base for } \tau _2 \) and \( \forall U\in B.\ f^{-1}(U) \in \tau _1 \)
shows \( f \text{ is continuous } \)
Definition of IsConnected:
\( T \text{ is connected } \equiv \forall U.\ (U\in T \wedge (U \text{ is closed in }T)) \longrightarrow U=0\vee U=\bigcup T \)
lemma func1_1_L13:
assumes \( f^{-1}(A) \neq \emptyset \)
shows \( A\neq \emptyset \)
lemma surj_image_vimage:
assumes \( f \in \text{surj}(X,Y) \) and \( A\subseteq Y \)
shows \( f(f^{-1}(A)) = A \)
lemma func1_1_L15:
assumes \( f:X\rightarrow Y \)
shows \( f^{-1}(A) = \{x\in X.\ f(x) \in A\} \)
lemma func1_1_L5B:
assumes \( f:X\rightarrow Y \)
shows \( \text{range}(f) \subseteq Y \)
lemma (in two_top_spaces0
) restr_image_cont:
assumes \( f \text{ is continuous } \)
shows \( \text{IsContinuous}(\tau _1, \tau _2 \text{ restricted to } f(X_1),f) \)
lemma range_image_domain:
assumes \( f:X\rightarrow Y \)
shows \( f(X) = \text{range}(f) \)
Definition of RestrictedTo:
\( M \text{ restricted to } X \equiv \{X \cap A .\ A \in M\} \)
lemma (in topology0
) Top_1_L4:
shows \( (T \text{ restricted to } X) \text{ is a topology } \)
theorem (in two_top_spaces0
) cont_image_conn:
assumes \( \text{IsContinuous}(\tau _1,\tau _2,f) \), \( f\in \text{surj}(X_1,X_2) \), \( \tau _1\text{ is connected } \)
shows \( \tau _2\text{ is connected } \)
Definition of IsTotDis:
\( IsTotDis \equiv ANTI(IsConnected) \)
Definition of antiProperty:
\( T\{is anti-\}P \equiv \forall A\in Pow(\bigcup T).\ P(T\text{ restricted to }A) \longrightarrow (A \text{ is in the spectrum of } P) \)
lemma conn_spectrum:
shows \( (A\text{ is in the spectrum of }IsConnected) \longleftrightarrow A\preceq 1 \)
lemma func1_1_L15A:
assumes \( f: X\rightarrow Y \) and \( A\subseteq X \) and \( A\neq \emptyset \)
shows \( f(A) \neq \emptyset \)
lemma func1_1_L5A:
assumes \( f:X\rightarrow Y \), \( x\in X \), \( y = f(x) \)
shows \( \langle x,y\rangle \in f \), \( y \in \text{range}(f) \)
Definition of IsCompactOfCard:
\( K\text{ is compact of cardinal } Q\{in\}T \equiv (\text{Card}(Q) \wedge K \subseteq \bigcup T \wedge \)
\( (\forall M\in Pow(T).\ K \subseteq \bigcup M \longrightarrow (\exists N \in Pow(M).\ K \subseteq \bigcup N \wedge N\prec Q))) \)
Definition of FinPow:
\( \text{FinPow}(X) \equiv \{A \in Pow(X).\ Finite(A)\} \)
theorem surj_fun_inv_2:
assumes \( f:\text{surj}(A,B) \), \( A\preceq Q \), \( Ord(Q) \)
shows \( B\preceq A \)
theorem (in two_top_spaces0
) cont_image_com:
assumes \( \text{IsContinuous}(\tau _1,\tau _2,f) \), \( f\in \text{surj}(X_1,X_2) \), \( X_1\text{ is compact of cardinal }K\{in\}\tau _1 \)
shows \( X_2\text{ is compact of cardinal }K\{in\}\tau _2 \)
lemma Compact_is_card_nat:
shows \( K\text{ is compact in }T \longleftrightarrow (K\text{ is compact of cardinal } nat \{in\}T) \)
Definition of IsAntiComp:
\( T\{is anti-compact\} \equiv T\{is anti-\}(\lambda T.\ (\bigcup T)\text{ is compact in }T) \)
theorem compact_spectrum:
shows \( (A \text{ is in the spectrum of } (\lambda T.\ (\bigcup T) \text{ is compact in }T)) \longleftrightarrow Finite(A) \)
lemma quotient_proj_surj:
shows \( \{\langle b,r\{b\}\rangle .\ b\in A\}\in \text{surj}(A,A//r) \)
theorem (in topology0
) total_quo_equi:
assumes \( \text{equiv}(\bigcup T,r) \)
shows \( \bigcup (\text{ quotient by }r)=(\bigcup T)//r \)
lemma (in topology0
) quotient_func_cont:
assumes \( f\in \text{surj}(\bigcup T,Y) \)
shows \( \text{IsContinuous}(T,(\text{ quotient topology in } Y\text{ by } f),f) \)
Definition of EquivQuo:
\( \text{equiv}(\bigcup T,r)\Longrightarrow (\text{ quotient by } r) \equiv \text{ quotient topology in } (\bigcup T)//r\text{ by } \{\langle b,r\{b\}\rangle .\ b\in \bigcup T\} \)
theorem (in topology0
) equiv_quo_is_top:
assumes \( \text{equiv}(\bigcup T,r) \)
shows \( (\text{ quotient by }r)\text{ is a topology } \)
446
201
67
67