This paper introduces a new topological tool for analyzing the fixed point property in finite posets, using a construction that induces an endofunctor in the homotopy category of finite T0-spaces.
Contribution
It presents a novel topological construction that provides a new method to study fixed point properties of finite posets, with applications demonstrated through examples.
Findings
01
The construction induces an endofunctor in the homotopy category of finite T0-spaces.
02
The tool helps analyze fixed point properties using topological methods.
03
Several applications illustrate the effectiveness of the new construction.
Abstract
We develop a novel tool to study the fixed point property of finite posets using a topological approach. Our tool is a construction which turns out to induce an endofunctor of the homotopy category of finite T0--spaces. We study many properties of this construction and give several examples of application.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Homotopy and Cohomology in Algebraic Topology · Fuzzy and Soft Set Theory
Full text
A new tool to study the fixed point property of finite posets
We develop a novel tool to study the fixed point property of finite posets using a topological approach. Our tool is a construction which turns out to induce an endofunctor of the homotopy category of finite T0–spaces. We study many properties of this construction and give several examples of application.
Key words and phrases:
Fixed point property; Finite topological space; Finite poset.
2010 Mathematics Subject Classification:
Primary: 54H25, 55M20. Secondary: 06A99.
Research partially supported by grant M044 (2016–2018) of SeCTyP, UNCuyo.
1. Introduction
In this article we develop a novel tool to study the fixed point property of finite T0–spaces (or equivalently finite posets) which consists in analysing a new finite T0–space which is constructed from the one whose fixed point property we want to study. More specifically, given a finite T0–space X we construct a new finite T0–space C(X) whose elements are connected subspaces of X and such that each continuous map f:X→X induces a continuous map C(f):C(X)→C(X). This assignment is not functorial but defines an endofunctor of the homotopy category of finite T0–spaces.
We show with several examples that this tool is useful to study the fixed point property of finite T0–spaces and we develop many properties of this construction so as to gain a better understanding of it. Among them, we prove that our construction preserves homotopy type and we study how it changes if we remove beat points of the given space.
2. Preliminaries
Finite topological spaces
Let X be a finite topological space. For each x∈X the minimal open set that contains x is defined as the intersection of all the open subsets of X that contain x and is denoted by Ux (or by UxX if we need to make explicit the topological space in which it is considered). We denote by Fx the intersection of all closed sets that contain x. We also denote Ux=Ux−{x} and Fx=Fx−{x}. The set {Ux∣x∈X} is a basis for the topology of X. We can define a preorder in X by x1≤x2 if and only if Ux1⊆Ux2. Moreover, this defines a bijective correspondence between topologies and preorders in a given finite set, under which T0–topologies correspond to partial orders [1]. This correspondence allows us to consider a finite T0–space as a finite poset, and a finite poset as a finite T0–space. In addition, a map between finite T0–spaces is continuous if and only if it is order-preserving.
Let X be a finite topological space with associated preorder ≤. We define Xop as the finite space with underlying set X and associated preorder given by x≤opy if and only if y≤x for all x,y∈X.
Let X and Y be finite T0–spaces and let f,g:X→Y be continuous maps. Then f and g are homotopic (denoted by f≃g) if and only if there exist n∈N and continuous maps f0,f1,…,fn:X→Y such that f=f0≤f1≥…≤fn=g [2, Corollary 1.2.6].
As a consequence, if f and g are such that for each x∈X, f(x) and g(x) are comparable, then
f≃g (since both f and g are comparable with the continuous map h=max{f,g}).
Let X be a finite T0–space and let x∈X. We say that x is a down beat point of X if Ux has a maximum element. We say that x is an up beat point of X is Fx has a minimum element. If x is a down beat point or an up beat point, we say that x is a beat point of X. It is well known that if X is a finite T0–space and x0∈X is a beat point, then X−{x0} is a strong deformation retract of X [2, Proposition 1.3.4].
Let X be a finite T0–space and let A⊆X. We say that A is a dbp–retract (resp. ubp–retract) of X if A can be obtained from X by successively removing down beat points (resp. up beat points), that is, if there exist n∈N0 and a sequence X=X0⊇X1⊇⋯⊇Xn=A of subspaces of X such that, for all i∈{1,…,n}, the space Xi is obtained from Xi−1 by removing a single down beat point (resp. up beat point) of Xi−1.
Clearly, if X is a finite T0–space and A is a dbp–retract of X then the minimal elements of X belong to A since they can not be down beat points of any subspace of X. Similarly, if X is a finite T0–space and A is an ubp–retract of X then the maximal elements of X belong to A.
Observe also that if X is a finite T0–space and A⊆X then A is an ubp–retract of X if and only if Aop is a dbp–retract of Xop.
The following results of [3] give characterizations of dbp–retracts which will be needed in this work. Clearly, similar results hold for ubp–retracts.
Let X be a finite T0–space and let A be a subspace of X. Then, A is a dbp–retract of X if and only if UxX∩A has a maximum for every x∈X. Equivalently, A is a dbp–retract of X if and only if UxX∩A has a maximum for every x∈X−A.
From the proof of theorem 3.7 of [3] it follows that if A is a dbp-retract of a finite T0–space X and r:X→A is the corresponding retraction, then r(x)=max(UxX∩A) for all x∈X.
Fixed point property
Let X be a topological space.
We say that a continuous map f:X→X has a fixed point if there exists x∈X such that f(x)=x.
We say that X has the fixed point property if all continuous maps f:X→X have a fixed point. It is easy to see that if a topological space fails to be T0 or connected, then it does not have the fixed point propery. Thus, we will only consider connected finite T0–spaces in this article.
It is known that if X is a finite T0–space, f:X→X is a continuous map and there exists x∈X such that f(x) and x are comparable, then f has a fixed point. From this fact we deduce the following result.
Proposition 2.4**.**
Let X be a finite T0–space and let f:X→X be a continuous map. If there exists x∈X such that Ux (respectively Fx) has the fixed point property, and f(Ux)⊆Ux (respectively f(Fx)⊆Fx), then f has a fixed point.
Proof.
Suppose that f(Ux)⊆Ux. If there exists y∈Ux such that f(y)=x, then f has a fixed point. Otherwise, f(Ux)⊆Ux and hence f has a fixed point.
∎
Let X and Y be homotopy equivalent finite T0–spaces. If X has the fixed point property, then Y also has the fixed point property.*
It follows from the previous proposition that if X is a finite T0–space with the fixed point property and x is a beat point of X, then X−{x} also has the fixed point property. As a further consequence, if X is a contractible finite T0–space, then it has the fixed point property. Therefore, if a finite T0–space has a maximum or minimum element, then it is contractible and hence it has the fixed point property.
Let X be a finite T0–space and let n∈N such that n≥2. We say that X is a 2n–crown if X is homeomorphic to the finite T0–space given by the following Hasse diagram
For each element a in a 2n–crown X, we have that X−{a} is contractible. From this fact we obtain the following proposition.
Proposition 2.6**.**
Let n∈N such that n≥2 and let X be a 2n–crown. Let f:X→X be a continuous map. If f is not bijective then f has a fixed point.
3. The C construction
Let S be a set. The power set of X will be denoted by P(S) and the set P(S)−{∅} will be denoted by P=∅(S).
Definition 3.1**.**
Let X be a finite T0–space. Let A be a non-empty subset of X. We define
[TABLE]
When there is no risk of confusion, the superindices X of the previous definition will be omitted and thus UAX and FAX will be denoted by UA and FA respectively.
Note that if X is a finite T0–space and A is a non-empty subset of X, then UA is an open subset of X and FA is a closed subset of X.
From now on, if X is a topological space, C(X) will denote the set of connected components of X.
Definition 3.2**.**
Let X be a finite T0–space. We define
[TABLE]
We also define
[TABLE]
Note that U(X) and F(X) are finite sets.
Remark 3.3*.*
Let X be a finite T0–space.
(1) Clearly, the elements of F(X) are closed subsets of X. In addition, since finite topological spaces are locally connected it follows that the elements of U(X) are open subsets of X.
(2) For all a∈mxl([)X], Ua∈U(X) since Ua is connected. In a similar way, for all b∈mnl([)X], Fb∈F(X).
The following proposition states that the sets U(X) and F(X) of the previous definition are disjoint, except in a trivial case.
Proposition 3.4**.**
Let X be a finite T0–space.
(a)
If X is connected and U(X)∩F(X)=∅, then X has a maximum element and a minimum element.
2. (b)
If X has a maximum element then U(X)={X}.
3. (c)
If X has a minimum element then F(X)={X}.
4. (d)
If X is connected and U(X)∩F(X)=∅, then U(X)=F(X)={X}.
Proof.
(a) Let C∈U(X)∩F(X). Then C is non-empty, open and closed in X by remark 3.3. Since X is connected, C=X.
Since C∈U(X), there exists U∈U0(X) such that C is a connected component of U. Hence U=X. Since X is finite and X=U has at most one maximal element of X, then X has a unique maximal element, that is, X has a maximum element.
In a similar way, it follows that X has a minimum element.
(b) If a=maxX, then U0(X)={Ua}={X} and hence U(X)={X}.
(c) Analogous to the proof of (b).
(d) It follows immediately from (a), (b) and (c).
∎
Observe that in the previous proposition, the hypothesis that X is connected is necessary for parts (a) and (d). Indeed, consider the discrete space of two points X={0,1}. Clearly F0={0}=U0. Hence {0}∈U(X)∩F(X), but X has neither a maximum element nor a minimum element. Therefore item (a) does not hold. In addition, it is easy to verify that U(X)=F(X)={{0},{1}}, and thus item (d) does not hold.
Definition 3.5**.**
Let X be a finite T0–space. We define the relation ≤ in U(X)∪F(X) as follows.
Given C1,C2∈U(X)∪F(X), we will say that C1≤C2 if and only if one of the following conditions holds:
•
C1,C2∈U(X) and C1⊆C2,
•
C1,C2∈F(X) and C1⊇C2,
•
C1∈F(X), C2∈U(X) and C1∩C2=∅.
It is not difficult to prove that the previously defined relation ≤ is an order relation in U(X)∪F(X).
Definition 3.6**.**
Let X be a finite T0–space.
•
We define U(X) as the finite T0–space associated to the poset (U(X),⊆).
•
We define F(X) as the finite T0–space associated to the poset (F(X),⊇).
•
We define C(X) as the finite T0–space associated to the poset (U(X)∪F(X),≤), where ≤ is the order defined in 3.5.
Observe that U(X) and F(X) are subspaces of C(X).
The following is a simple example of the C construction.
Example 3.7**.**
Let X be the finite T0–space given by the following Hasse diagram.
∙0∙1∙2∙3∙4
Then the Hasse diagram of C(X) is
2030 140 101342 3 403 41
The following proposition describes the maximal and minimal elements of the poset C(X) for any given finite T0–space X.
Proposition 3.8**.**
Let X be a finite T0–space. Then
[TABLE]
Proof.
Let a∈mxl([)X]. Since Ua is connected, Ua∈C(X). Let C∈U(X) such that C≥Ua. There exists a non-empty subset A⊆mxl([)X] such that C is a connected component of UA. Then Ua⊆C⊆UA. It follows that a≤x for all x∈A, and thus a=x for all x∈A. Hence A={a} and Ua=UA=C. Therefore, Ua∈mxl([)C(X)].
Now suppose that C∈mxl([)C(X)]. Suppose, in addition, that C∈F(X) and let x∈C. Since X is finite, there exists b∈mxl([)X] such that x≤b. Hence b∈C since C is closed. Thus, C∩Ub=∅ and then C<Ub which contradicts the maximality of C.
Thus C∈U(X). Then there exists a non-empty subset A⊆mxl([)X] such that C is a connected component of UA. Let a∈A. Then C⊆Ua, that is, C≤Ua. Hence C=Ua.
The second identity can be proved in a similar way.
∎
The following proposition shows that the construction F can be interpreted as a dual version of U.
Proposition 3.9**.**
Let X be a finite T0–space.
(a)
For all A⊆mnl([)X], FAX=(UAXop)op.
2. (b)
F(X)=U(Xop)* as sets.*
3. (c)
C(Xop)=(C(X))op. In particular, F(X)=(U(Xop))op as posets with the corresponding partial orders induced from C(X) and C(Xop) respectively.
Proof.
(a) Let A⊆mnl([)X]. Note that for all a∈A, Fa=(UaXop)op. Hence
[TABLE]
(b) Follows from (a).
(c) It follows from (b) that U(Xop)∪F(Xop)=F(X)∪U(X). Then the underlying sets of C(Xop) and (C(X))op coincide. Let ≤ denote the partial order of C(X) and let ⪯ denote the partial order of C(Xop). Let C1,C2∈C(Xop).
•
If C1,C2∈U(Xop)=F(X), then C1⪯C2 if and only if C1⊆C2 if and only if C2≤C1 if and only if C1≤opC2.
•
If C1,C2∈F(Xop)=U(X), then C1⪯C2 if and only if C1⊇C2 if and only if C2≤C1 if and only if C1≤opC2.
•
If C1∈F(Xop) and C2∈U(Xop), then C1⪯C2 if and only if C1∩C2=∅ if and only if C2≤C1 if and only if C1≤opC2.
Hence, the partial orders ⪯ and ≤op coincide.
∎
Definition 3.10**.**
Let X be a finite T0–space and let B⊆X be a subset. We define
[TABLE]
Remark 3.11*.*
Let X be a finite T0–space and let B⊆X be a subset.
If B♯=∅ then B⊆UB♯. If, in addition, B is a connected subspace of X then there exists a unique connected component C0 of UB♯ such that B⊆C0.
Similarly, if B♭=∅ then B⊆FB♭, and if, in addition, B is a connected subspace of X then there exists a unique connected component C0 of FB♭ such that B⊆C0.
Lemma 3.12**.**
Let X be a finite T0–space and let B⊆X be a connected subspace. Then:
(a)
B♯=∅* if and only if {C∈U(X)∣B⊆C}=∅.*
2. (b)
B♭=∅* if and only if {C∈F(X)∣B⊆C}=∅.*
Proof.
We will prove only item (a). The proof of item (b) is similar.
(⇒) Let a0∈B♯. Then Ua0∈{C∈U(X)∣B⊆C}.
(⇐) Let C0∈U(X) such that B⊆C0 and let A⊆mxl([)X] be a non-empty subset such that C0 is a connected component of UA. Let a0∈A. Then B⊆UA⊆Ua0. Hence a0∈B♯.
∎
The following proposition states a key property of the C construction.
Proposition 3.13**.**
Let X be a finite T0–space and let B⊆X be a connected non-empty subspace.
(a)
If {C∈U(X)∣B⊆C} is non-empty, then it has a minimum element, which is the connected component of UB♯ that contains B.
2. (b)
If {C∈F(X)∣B⊆C} is non-empty, then it has a maximum element, which is the connected component of FB♭ that contains B.
Proof.
By the previous lemma, B♯=∅. Let C0 be the unique connected component of UB♯ such that B⊆C0.
Let C∈U(X) such that B⊆C. There exists a non-empty subset A⊆mxl([)X] such that C is a connected component of UA. Hence B⊆Ua for all a∈A. Then, A⊆B♯ and thus UB♯⊆UA. Hence C0⊆UA.
Since C is a connected component of UA and ∅=B⊆C0∩C, it follows that C0⊆C, that is, C0≤C. Hence C0=min{C∈U(X)∣B⊆C}.
The second part can be proved in a similar way.
∎
The following corollary follows immediately from the previous proposition.
Corollary 3.14**.**
Let X be a finite T0–space.
(a)
Let B∈U(X). Then B is a connected component of UB♯.
2. (b)
Let B∈F(X). Then B is a connected component of FB♭.
Proposition 3.13 allows us to give the following definition.
Definition 3.15**.**
Let X be a finite T0–space and let x∈X. We define
[TABLE]
and
[TABLE]
Proposition 3.16**.**
Let X be a finite T0–space.
(a)
The set U(X) is a basis for a topology in X which is coarser than the topology of X.
2. (b)
Let T be the topology generated by U(X). The Kolmogorov quotient of (X,T) is homeomorphic to a subspace of the finite T0–space associated to the poset U(X).
Proof.
(a) Since Ua∈U(X) for all a∈mxl([)X] it follows that C∈U(X)⋃C=X. Now let C1,C2∈U(X) and let x∈C1∩C2. Then x∈CU(x)⊆C1∩C2 by 3.13. Thus, U(X) is a basis for a topology in X which, by 3.3, is clearly coarser than the topology of X.
(b) Let K be the Kolmogorov quotient of (X,T) and let q:X→K be the quotient map. Let f:X→U(X) be defined by
f(x)=CU(x). We will prove that f is order-preserving. Let a,b∈X be such that a≤b then a∈CU(b) since CU(b) is an open subset of X which contains b. Thus CU(a)⊆CU(b). Hence, f is order-preserving, and therefore, it is a continuous map.
Now, let c,d∈X be such that q(c)=q(d). Thus, {C∈U(X)∣q(c)∈C}={C∈U(X)∣q(d)∈C} since U(X) is a basis for the topology T. Hence, f(c)=CU(c)=CU(d)=f(d). Therefore, there exists a continuous map f:K→U(X) such that fq=f.
We will prove now that if k,l∈K are such that f(k)≤f(l) then k≤l. Let k,l∈K be such that f(k)≤f(l). Let x,y∈X be such that k=q(x) and l=q(y). Then f(x)=f(k)≤f(l)=f(y). Hence CU(x)⊆CU(y). Then, for all C∈U(X) such that y∈C we obtain that x∈CU(x)⊆CU(y)⊆C, and thus x∈C. Therefore x≤y. Hence, k=q(x)≤q(y)=l.
∎
Definition 3.17**.**
Let X and Y be finite T0–spaces and let f:X→Y be a continuous map. We define
[TABLE]
and
[TABLE]
If, in addition, U(X)∩F(X)=∅, we define
[TABLE]
We will prove now that U(f) is well defined. Let C∈U(X). Then there exists a∈mxl([)X] such that C⊆Ua. Let b∈mxl([)Y] such that f(a)≤b. Then f(C)⊆Uf(a)⊆Ub. Hence f(C)♯=∅. Then {D∈U(Y)∣f(C)⊆D} is non-empty by 3.12, and thus it has a minimum element by 3.13.
In a similar way it can be proved that F(f) is well defined and thus C(f) is also well defined.
Note that the map C(f) might not be well defined without the assumption U(X)∩F(X)=∅. Note also that if U(X)∩F(X)=∅ then either X is not connected or it has minimum and maximum elements by 3.4.
Remark 3.18*.*
Let X and Y be finite T0–spaces and let f:X→Y be a continuous map.
Observe that, if C∈U(X), then, by 3.13, U(f)(C) is the connected component of Uf(C)♯ that contains f(C).
In a similar way, if C∈F(X), then F(f)(C) is the connected component of Ff(C)♭ that contains f(C).
We will show in the following proposition that the maps defined in 3.17 are continuous.
Proposition 3.19**.**
Let X and Y be finite T0–spaces and let f:X→Y be a continuous map. Then the maps U(f) and F(f) are continuous. If, in addition, U(X)∩F(X)=∅ then the map C(f):C(X)→C(Y) is continuous.
Proof.
Let C1,C2∈C(X) such that C1≤C2.
•
If C1,C2∈U(X), then C1⊆C2. Hence f(C1)⊆f(C2)⊆U(f)(C2). Then U(f)(C1)⊆U(f)(C2) by definition of U(f). Thus, U(f)(C1)≤U(f)(C2).
•
If C1,C2∈F(X), then C2⊆C1 and f(C2)⊆f(C1)⊆F(f)(C1). Hence F(f)(C2)⊆F(f)(C1) by definition of F(f). Thus, F(f)(C1)≤F(f)(C2).
•
If C1∈F(X) and C2∈U(X), then C1∩C2=∅. Hence ∅=f(C1)∩f(C2)⊆C(f)(C1)∩C(f)(C2). Thus, C(f)(C1)≤C(f)(C2).
The result follows.
∎
Proposition 3.20**.**
Let X and Y be finite T0–spaces and let f:X→Y be a homeomorphism. Then
(a)
for all C∈U(X), U(f)(C)=f(C),
2. (b)
for all C∈F(X), F(f)(C)=f(C),
3. (c)
U(f)* and F(f) are homeomorphisms.*
Proof.
(a) Since f is a homeomorphism, f(mxl([)X])=mxl([)Y] and f(UA)=Uf(A) for each non-empty subset A⊆mxl([)X]. Let C∈U(X). Then C is a connected component of UC♯ and hence f(C) is a connected component of Uf(C♯). Thus U(f)(C)=f(C).
(b) Analogous to (a).
(c) Let C∈U(X). Then applying (a) we obtain that U(f−1)U(f)(C)=U(f−1)(f(C))=f−1(f(C))=C. Thus U(f−1)U(f)=idU(X). Similarly U(f)U(f−1)=idU(Y).
The proof for F(f) follows similarly.
∎
In the following example we will see that the constructions U, F and C are not functorial.
Example 3.21**.**
Let X be the finite T0–space whose underlying set is {0,1,2,3,4} and whose topology is generated by the basis {{0},{0,1},{2},{0,1,2,3},{0,1,2,4}}. The Hase diagrams of X and U(X) are shown below.
∙0∙1∙2∙3∙4X
31 2041 20102U(X)
Let f:X→X be the map defined by
[TABLE]
Clearly f is a continuous map. Let g:X→X be the constant map with value 0. Then fg is the constant map with value 2. It follows that U(g) is the constant map with value {0,1} and that U(fg) is the constant map with value {2}. Then
[TABLE]
Hence, U(fg)=U(f)U(g).
This implies that C(fg)=C(f)C(g), and the fact that F is not functorial can be deduced from this example considering opposite spaces.
Proposition 3.22**.**
Let X, Y and Z be finite T0–spaces and let g:X→Y and f:Y→Z be continuous maps. Then U(fg)≤U(f)U(g) and F(fg)≥F(f)F(g). If, in addition, U(X)∩F(X)=∅ and U(Y)∩F(Y)=∅ then C(fg)≃C(f)C(g).
Proof.
Let C∈U(X). Then
[TABLE]
Hence, U(fg)(C)⊆U(f)(U(g)(C)). Therefore, U(fg)≤U(f)U(g). In a similar way it can be proved that F(fg)≥F(f)F(g).
If, in addition, U(X)∩F(X)=∅ and U(Y)∩F(Y)=∅ then the maps C(fg) and C(f)C(g) are defined. Since U(fg)≤U(f)U(g) and F(fg)≥F(f)F(g) we obtain that, for all C∈C(X), the elements C(fg)(C) and C(f)C(g)(C) are comparable. Thus, the last assertion follows.
∎
Proposition 3.23**.**
Let X and Y be finite T0–spaces and let f,g:X→Y be continuous maps.
(a)
If f≤g, then U(f)≤U(g) and F(f)≤F(g).
2. (b)
If f≤g and U(X)∩F(X)=∅, then C(f)≤C(g).
3. (c)
If f≃g, then U(f)≃U(g) and F(f)≃F(g).
4. (d)
If f≃g and U(X)∩F(X)=∅, then C(f)≃C(g).
Proof.
We will prove (a). Item (b) follows from (a), while items (c) and (d) follow from (a) and (b).
Let C∈U(X). If x∈C then f(x)≤g(x)∈g(C)⊆U(g)(C), and since U(g)(C) is an open subset of Y it follows that f(x)∈U(g)(C). Therefore, f(C)⊆U(g)(C). Hence U(f)(C)≤U(g)(C).
Now let C∈F(X). If x∈C then g(x)≥f(x)∈f(C)⊆F(f)(C), and since F(f)(C) is a closed subset of Y it follows that g(x)∈F(f)(C). Therefore, g(C)⊆F(f)(C). Hence F(f)(C)≤F(g)(C).
∎
Corollary 3.24**.**
Let X and Y be finite T0–spaces and let f:X→Y be a homotopy equivalence. Then U(f) and F(f) are homotopy equivalences. If, in addition, U(X)∩F(X)=∅ and U(Y)∩F(Y)=∅ then C(f) is a homotopy equivalence.
4. Fixed points
The following proposition and its corollaries relate the C construction to the fixed point property.
Proposition 4.1**.**
Let X be a finite T0–space and let f:X→X be a continuous map. Let C∈C(X) be a subspace of X with the fixed point property.
(a)
If C∈U(X) and U(f)(C)≤C then f has a fixed point.
2. (b)
If C∈F(X) and F(f)(C)≥C then f has a fixed point.
3. (c)
If U(X)∩F(X)=∅ and C(f)(C)=C, then f has a fixed point.
Proof.
Under the assumptions of item (a) we obtain that f(C)⊆U(f)(C)⊆C. Hence the map f has a fixed point. Item (b) can be proved in a similar way and item (c) follows immediately from (a) and (b).
∎
Corollary 4.2**.**
Let X be a finite T0–space.
•
If the space U(X) (resp. F(X)) has the fixed point property and every C∈U(X) (resp. every C∈F(X)) has the fixed point property then X has the fixed point property.
•
If U(X)∩F(X)=∅, the space C(X) has the fixed point property and every C∈C(X) has the fixed point property then X has the fixed point property.
Proof.
We will prove the result in the case that U(X) has the fixed property. Let f:X→X be a continuous map. Then the map U(f):U(X)→U(X) has a fixed point. Thus f has a fixed point by the previous proposition.
∎
Corollary 4.3**.**
Let X be a finite T0–space and let f:X→X be a continuous map.
(a)
If there exist a∈mxl([)X] and C∈U(X) such that Ua≥C and U(f)(C)=Ua, then f has a fixed point.
2. (b)
If there exist a∈mnl([)X] and C∈F(X) such that Fa≤C and F(f)(C)=Fa, then f has a fixed point.
Proof.
From the hypotheses of item (a) we obtain that U(f)(Ua)≥U(f)(C)=Ua. And since Ua∈mxl([)C(X)], U(f)(Ua)=Ua. Then f has a fixed point by proposition 4.1.
The second item follows in a similar way.
∎
Proposition 4.4**.**
Let X be a finite T0–space and let f:X→X be a continuous map. If f has a fixed point, then the maps
U(f) and F(f) have fixed points.
Proof.
Let x∈X be such that f(x)=x. Let C0=min{C∈U(X)∣x∈C}. Note that this minimum element exists by proposition 3.13. It follows that x=f(x)∈f(C0)⊆U(f)(C0). Then C0≤U(f)(C0). Hence, U(f) has a fixed point.
In a similar way it can be proved that the map F(f) has a fixed point.
∎
The following example shows that the converse of the previous proposition does not hold.
Example 4.5**.**
Let X be the finite T0–space whose underlying set is {0,1,2,3,4,5} and whose topology is generated by the basis {{0},{1},{0,1,2},{0,1,3},{0,1,2,3,4},{0,1,2,3,5}}. The Hase diagrams of X and U(X) are shown below.
∙0∙1∙2∙3∙4∙5X
42 30 152 30 12 30 1U(X)
Let f:X→X be the continuous map defined by
[TABLE]
Clearly U(X) has the fixed point property and hence the map U(f) has a fixed point. In a similar way, F(f) has a fixed point. However, the map f does not have fixed points.
5. Examples
In this section we give several examples of application which show that the tools of section 3 are useful to study the fixed point property of finite posets.
First we give the following lemmas.
Lemma 5.1**.**
Let X the finite T0–space given by the following Hasse diagram.
[TABLE]
If f:X→X is a continuous map without fixed points, then f({3,4,5})={3,4,5}.
Proof.
We will prove first that f({3,4,5})⊆X−mxl([)X]. Let x∈{3,4,5} and suppose that f(x)∈mxl([)X]. Then f(Fx)={f(x)} and hence there exist a,b∈mxl([)X] such that a=b and f(a)=f(b)=f(x). Observe that {0,1,2,3,4,5}⊆Ua∪Ub. Hence
[TABLE]
Since Uf(x) is contractible, f has a fixed point by 2.4 which entails a contradiction.
Since f({3,4,5})⊆X−mxl([)X], it follows that f(X−mxl([)X])⊆X−mxl([)X]. And since f does not have fixed points, f is bijective in this subspace by 2.6. In particular f({3,4,5})={3,4,5}.
∎
Lemma 5.2**.**
Let X the finite T0–space given by the following Hasse diagram.
[TABLE]
Let f:X→X a continuous map without fixed points. Then f({3,4,5})={3,4,5}.
Proof.
Let x∈{0,1}. Since f does not have fixed points, f(x) is not comparable with x. Hence f(x)∈{0,1,2}−{x}. In addition, note that F2⊆Fx. Then, if f(x)=2, it follows that f(F2)⊆f(Fx)⊆F2, with F2 contractible. Hence by 2.4, f has a fixed point, which entails a contradiction. Then f(0)=1 and f(1)=0. It follows that f(F0,1)⊆F0,1. In addition, as f does not have fixed points, the restriction f∣:F0,1→F0,1 is bijective by 2.6. In particular, f({3,4,5})={3,4,5}.
∎
Now we are ready to give the examples.
Example 5.3**.**
We will prove that the space P3323 of [5, Fig.1] has the fixed point property. Its Hasse diagram is given in figure 1(a). The Hasse diagrams of U(P3323) and F(P3323) are shown in figure 2 and the shaded elements of these diagrams are contractible subspaces of P3323.
Suppose that there exists a continuous map f:P3323→P3323 without fixed points.
Let C1={0,1,2,3,4,5}∈U(X). Since the poset U(P3323) has a minimum element, the map U(f):U(P3323)→U(P3323) has a fixed point, which must be C1 by 4.1. Thus, f(C1)⊆U(f)(C1)=C1.
Let C2={3,6,7,8,9,10}∈F(P3323). Proceeding as in the previous paragraph we obtain that C2 is a fixed point of F(f). Thus, f(C2)⊆F(f)(C2)=C2.
Hence, f(C1∩C2)⊆C1∩C2 and hence 3 is a fixed point of f, which entails a contradiction.
Therefore, the space P3323 has the fixed point property.
Example 5.4**.**
We will prove that the space P1343 given in [5, Fig.1] has the fixed point property. Its Hasse diagram is given in figure 1(b). The Hasse diagram of C(P1343) is shown in figure 3(a).
We will prove first that C(P1343) is homotopy equivalent to P3323. Note that the minimal elements of U(P1343) are down beat points of C(P1343) and that the maximal elements of F(P1343) are up beat points of C(P1343). Then C(P1343) is homotopy equivalent to the finite T0–space that is given by the Hasse diagram of figure 4(a). Now observe that the element labeled a in this figure is a down beat point, and by removing it we obtain the space given in figure 4(b), which is homeomorphic to P3323. Therefore C(P1343) is homotopy equivalent to P3323.
Now, let f:P1343→P1343 be a continuous map. In example 5.3 we proved that P3323 has the fixed point property. Hence, by 2.5, C(P1343) has the fixed point property. Thus, the map C(f) has a fixed point. And since all the elements of C(P1343) are contractible subspaces of P1343, applying proposition 4.1, we obtain that f has a fixed point. Therefore P1343 has the fixed point property.
Example 5.5**.**
We will prove that the space P2343 given in [5, Fig.1] has the fixed point property. Its Hasse diagram is given in figure 1(c). The Hasse diagram of C(P2343) is shown in figure 3(b). Let A, B, C, A′, B′ and C′ be the sets indicated in that figure.
Suppose that f:P2343→P2343 is a continuous map without fixed points. Since all the elements of U(P2343) are contractible subspaces of P2343, then the map U(f) does not have fixed points by 4.1. By lemma 5.2, U(f)({A,B,C})⊆{A,B,C}. In a similar way, F(f)({A′,B′,C′})⊆{A′,B′,C′}. Consider the subspace M={A,B,C,A′,B′,C′}⊆C(P2343). It follows that C(f)(M)⊆M. Since M is contractible, the map C(f) has fixed points and then, from 4.1 we obtain that f has fixed points, which entails a contradiction.
Therefore, P2343 has the fixed point property.
Example 5.6**.**
Let n,k∈N such that n≥4 and 2≤k≤n−1. Let Xn,k the finite T0–space whose underlying set is {a1,a2,a3,b1,b2,…,bn,c1,c2,…,cn} and whose minimal open sets are
Observe that the posets X4,3 and X4,2 are isomorphic to the posets P4443 and P5443 of [5, Fig.1].
We will prove that the spaces Xn,k have the fixed point property for all n,k as above. To this end we will compute U(Xn,k). Let
[TABLE]
Observe that the connected components of Ua1a2 are A and F, the connected components of Ua1a3 are B and E, the connected components of Ua2a3 are C and D and that the connected components of Ua1a2a3 are D, E and F. Hence U(Xn,k) is the finite space given by the following Hasse diagram
Suppose that f:Xn,k→Xn,k is a continuous map without fixed points. Since all the elements of U(Xn,k) are contractible subspaces of Xn,k, then U(f) does not have fixed points by 4.1. Thus, by 5.1, U(f)({A,B,C})={A,B,C}. Since S=A∪B∪C, we have that f(S)=f(A∪B∪C)=f(A)∪f(B)∪f(C)⊆A∪B∪C=S.
We will prove now that the restriction f∣:S→S is not bijective. Note that
[TABLE]
where the first inequality holds since n+k>5. Thus, the sets A, B and C do not all have the same cardinality and since U(f) does not have fixed points and U(f)({A,B,C})={A,B,C} it follows that there exists T∈{A,B,C} such that #U(f)(T)<#T. Hence #f(T)<#T and then f is not bijective.
Finally, since f∣:S→S is not bijective, it has a fixed point by 2.6 which entails a contradiction.
6. Beat points
Remark 6.1*.*
Note that the space X of example 4.5 is not contractible but U(X) is. Thus X and U(X) do not have the same homotopy type.
Proposition 6.2**.**
Let X be a finite T0–space and let A be a bp-retract of X. Let r:X→A be the corresponding retraction.
(a)
If C∈C(X), then r(C)=C∩A.
2. (b)
If mxl([)X]⊆A and C∈U(X), then C∩A∈U(A).
3. (c)
If mnl([)X]⊆A and C∈F(X), then C∩A∈F(A).
Proof.
(a) Suppose that A is a dbp-retract of X. Clearly, C∩A⊆r(C) and r(C)⊆A. It remains to prove that r(C)⊆C.
Suppose first that C∈U(X). Let z∈C. Since r(z)≤z and C is an open subset of X it follows that r(z)∈C.
Suppose now that C∈F(X). Let z∈C. Note that z≥y for all y∈C♭. Then r(z)≥r(y)=y for all y∈C♭, that is, r(z)∈FC♭. Since r(z)≤z it follows that C∪{r(z)} is a connected subspace of FC♭. Thus C∪{r(z)}⊆C and hence r(z)∈C.
(b) Note that mxl([)A]=mxl([)X] and that C∩A is connected and non-empty by item (a). Since C∈U(X), C is a connected component of UC♯X. Then C∩A⊆UC♯X∩A=UC♯A.
Thus, there exists a connected component C0 of UC♯A such that C∩A⊆C0. Then C0⊆UC♯X and since ∅=C∩A⊆C∩C0 and C is a connected component of UC♯X we obtain that C0⊆C.
Hence, C∩A⊆C0⊆C∩A. Therefore C∩A=C0∈U(A).
(c) Analogous to that of item (b).
∎
Proposition 6.3**.**
Let X be a finite T0–space and let A be a bp-retract of X. Let r:X→A be the corresponding retraction and let i:A→X be the inclusion map.
(a)
If mxl([)X]⊆A then U(r)(C)=r(C) for all C∈U(X) and U(r)U(i)=idU(A).
2. (b)
If A is an ubp-retract of X then U(r) is a homeomorphism.
3. (c)
If mxl([)X]⊆A and A is a dbp-retract of X then U(i)U(r)≤idU(X).
Proof.
(a) Let C∈U(X). Then r(C)=C∩A∈U(A) by 6.2. It follows that U(r)(C)=r(C).
Let D∈U(A). Then
[TABLE]
by 3.18. Since D is a connected component of UD♯A by 3.14 and U(r)U(i)(D) is connected, it follows that U(r)U(i)(D)=D.
(b) Since A is an ubp-retract then mxl([)X]⊆A and hence U(r)U(i)=idU(A) by item (a). Let C∈U(X). Then
[TABLE]
Note that ir(C)=C∩A and since C∈U(X) it follows that U(ir)(C)⊆C.
Let z∈C. Since r(z)≥z, r(z)∈ir(C)⊆U(ir)(C) and U(ir)(C) is an open subset of X, we obtain that z∈U(ir)(C). Hence, U(ir)(C)=C.
Let X be a finite T0–space and let A be a dbp-retract of X such that mxl([)X]⊆A. Let r and i be as in 6.3. Then U(r)U(i)=idU(A) and U(i)U(r)≤idU(X). Thus, U(i) is an embedding, and applying 2.2 it follows that U(i)(U(A)) is a dbp-retract of U(X), that is, U(i)(U(A)) can be obtained from U(X) by removing down beat points. Observe that U(i)(U(A)) is homeomorphic to U(A).
The following examples show that several of the hypotheses of the previous propositions are necessary.
Example 6.6**.**
Let X be the finite T0–space given in figure 5(a). Note that 4 is a down beat point of X. The spaces U(X), X−{4} and U(X−{4}) are given in figures 5(b), 5(c) and 5(d), respectively.
Observe that {0,2,4}∈U(X) but {0,2}∈/U(X−{4}). Thus, 6.2 might not hold if mxl([)X]⊆A.
Let i:X−{4}→X be the inclusion map and let r:X→X−{4} be the retraction. Note that U(r)({0,2,4})={0,1,2,3}=r({0,2,4}) and that U(i)U(r)({0,2,4})={0,1,2,3}≤{0,2,4}. Hence, items (a) and (c) of proposition 6.3 might not hold if mxl([)X]⊆A.
Example 6.7**.**
Let X be the finite T0–space given in figure 6(a). Note that 1 is a down beat point of X. The spaces U(X), X−{1} and U(X−{1}) are given in figures 6(b), 6(c) and 6(d), respectively.
Note that U(X) and U(X−{1}) are not homeomorphic. Hence, item (b) of 6.3 might not hold if A is a dbp-retract of X.
Proposition 6.8**.**
Let X be a finite T0–space and let a∈mxl([)X] be a down beat point of X. Let b=maxUa.
(a)
If b∈/mxl([)X−{a}] then Ua is a down beat point of U(X) and U(X−{a}) is a ubp-retract of U(X)−{Ua}.
2. (b)
If b∈mxl([)X−{a}] then U(X) and U(X−{a}) are homeomorphic.
Proof.
(a) Since b∈/mxl([)X−{a}] then there exists d∈mxl([)X] such that d>b and d=a. Hence Ub=Uad and thus Ub∈U(X). Clearly Ub<Ua. We will prove that Ub=maxUUaU(X). Let C∈U(X) be such that C<Ua. Clearly a∈/C (since otherwise Ua⊆C). Thus, C⊆Ua=Ub. Therefore, Ua is a down beat point of U(X).
Let i:X−{a}→X be the inclusion map and let r:X→X−{a} be the retraction which corresponds to the removal of the beat point a. Note that U(X−{a})⊆U(X)−{Ua}, and hence U(i)(D)=D for all D∈U(X−{a}). Then U(i):U(X−{a})→U(X) is the inclusion map.
Let D∈U(X−{a}). Note that U(r)U(i)(D)=U(r)(D)=D since a∈/D. Hence U(r)U(i)=idU(X−{a}).
Let C∈U(X)−{Ua}. Applying 6.2 we obtain that C=C−{a}=r(C)⊆U(r)(C)=U(i)U(r)(C). From
2.2 it follows that U(X−{a}) is a ubp-retract of U(X)−{Ua}.
(b) Since b∈mxl([)X−{a}], b is an up beat point of X. Hence U(X) is homeomorphic to U(X−{b}) by 6.3, which is homeomorphic to U(X−{a}) since X−{b} and X−{a} are homeomorphic.
∎
Proposition 6.9**.**
Let X be a finite T0–space. Then U(X) does not have up beat points and F(X) does not have down beat points.
Proof.
Suppose that C is an up beat point of U(X). Let D=minFCU(X). Then
Then, by 3.14, C and D are connected components of UC♯ and since C⊆D, it follows that C=D, which entails a contradiction.
The second part of the proposition can be proved in a similar way.
∎
7. Properties of U(X)
Proposition 7.1**.**
Let X be a finite T0–space such that every C∈U(X) has a maximum element. Let X′={maxC∣C∈U(X)}. Then X′ is an ubp-retract of X.
Proof.
Let i:X′→X be the inclusion map. For each x∈X let C(x)=min{C∈U(X)∣x∈C}. Let r:X→X′ be defined by r(x)=maxC(x).
We claim that r is continuous. Indeed, let x1,x2∈X such that x1≤x2. Since C(x2) is an open subset of X we obtain that x1∈C(x2) and thus C(x1)⊆C(x2). Hence, r(x1)≤r(x2).
Clearly, ir≥idX. We will prove now that ri=idX′. Let z∈X′. Then there exists C∈U(X) such that z=maxC. Since C(z) is an open subset of X we obtain that Uz⊆C(z)⊆C⊆Uz. It follows that ri(z)=z.
Observe that, under the hypotheses of the previous proposition, from 6.3 and 7.1 we obtain that U(X′)≅U(X).
Proposition 7.3**.**
Let X be a finite T0–space such that every C∈U(X) has a maximum element. Let X′={maxC∣C∈U(X)}.
Then there exists mutually inverse isomorphisms φ:U(X)→X′ and ψ:X′→U(X) given by φ(C)=maxC and ψ(z)=UzX.
Proof.
Observe that if C∈U(X) and maxC=z then, as in the proof of 7.1, we obtain that C=UzX. The result follows.
∎
Lemma 7.4**.**
Let X be a finite T0–space. Let B⊆mxl([)U(X)] be a non-empty subset. Let A={a∈mxl([)X]∣UaX∈B}. Then
Let D∈mxl([)UBU(X)]. Then D⊆UAX. Since D is connected, there exists a connected component D0∈C(UAX) such that D⊆D0. It follows that D0∈UBU(X). From the maximality of D we obtain that D=D0 and hence D∈C(UAX).
Now, let D∈C(UAX). Then, D∈UBU(X). Let C∈UBU(X) such that D⊆C. Then C⊆UAX, and since C is connected it follows that C⊆D. Thus, C=D. Therefore, D∈mxl([)UBU(X)].
(b) From (a) we obtain that
[TABLE]
Now, observe that if M1,M2∈C(UAX) are such that M1=M2 then UM1U(X)∩UM2U(X)=∅ since M1∩M2=∅. The result follows.
∎
Proposition 7.5**.**
Let X be a finite T0–space. Then there exists mutually inverse isomorphisms φ:U(U(X))→U(X) and ψ:U(X)→U(U(X)) given by φ(D)=maxD and ψ(C)=UCU(X).
Proof.
First observe that every C∈U(U(X)) has a maximum element by item (b) of 7.4. Now, if C∈U(X) then C is a connected component of UC♯X and hence UC is a connected component of U{Ua∣a∈C♯}U(X) by item (b) of 7.4. Therefore, {maxD∣D∈U(U(X))}=U(X). The result follows from 7.3.
∎
Corollary 7.6**.**
Let X be a finite T0–space. Then there exists a finite T0–space Y such that X≅U(Y) if and only if X≅U(X).
In this section we will develop more results about the C–construction. Not all of them are related to the fixed point property but are interesting on their own and permit a better understanding of this construction. In addition, these results show that the C–construction is an interesting object of study.
In the following proposition we will see that if X is a finite T0–space, then X is homotopy equivalent to the Grothendieck construction on a functor from U(X) to the category of finite posets, or equivalently to the the non-Hausdorff homotopy colimit of a U(X)–diagram of finite posets [4].
Recall that if A is a finite poset, P is the category of finite posets and F:A→P a functor, then the Grothendieck construction for F is the poset ∫F with underlying set a∈A⋃({a}×F(a)) and with partial order defined as follows: if a,b∈A, x∈F(a), y∈F(b) then (a,x)≤(b,y) if and only if a≤b and F(a≤b)(x)≤y.
Definition 8.1**.**
Let X be a finite T0–space. We define the functor IX:U(X)→P by IX(C)=C and IX(C⊆C′) as the inclusion map C↪C′.
We also define maps ρX:∫IX→X and ιX:X→∫IX by ρX(C,x)=x for all (C,x)∈∫IX and ι(x)=(CU(x),x) for all x∈X.
Proposition 8.2**.**
Let X be a finite T0–space. Then, the maps ρX:∫IX→X and ιX:X→∫IX are continuous, ρXιX=idX and ιXρX≤id∫IX.
In particular, ιX(X) is a dbp–retract of ∫IX and X is homotopy equivalent to ∫IX.
Proof.
Let (C1,x1),(C2,x2)∈∫IX such that (C1,x1)≤(C2,x2). Then C1⊆C2 and x1=inc(x1)≤x2 in C2. Hence ρX(C1,x1)=x1≤x2=ρX(C2,x2) in X. Thus, ρX is continuous.
Now, let x1,x2∈X such that x1≤x2. Since x2∈CU(x2) and CU(x2) is an open subset of X, then x1∈CU(x2). Hence, CU(x1)≤CU(x2) and thus ιX(x1)=(CU(x1),x1)≤(CU(x2),x2)=ι(x2). Therefore, ιX is continuous.
Now, for all x∈X, ρXιX(x)=ρX(CU(x),x)=x. Hence ρXιX=idX.
On the other hand, if (C,x)∈∫IX, then x∈C and ιXρX(C,x)=ιX(x)=(CU(x),x)≤(C,x). Hence ιXρX≤id∫IX.
∎
Remark 8.3*.*
Note that if X is a finite T0–space then mxl([)∫IX]={(Ua,a)∣a∈mxl([)X]}.
Lemma 8.4**.**
Let X be a finite T0–space. For each D∈U(X) let D={(C,x)∈∫IX∣C⊆D}.
(a)
Let B⊆mxl([)∫IX]. Let A={a∈mxl([)X]∣(Ua,a)∈B}. Then
[TABLE]
2. (b)
Let C∈U(X). Then U(ιX)(C)=C.
Proof.
(a) Note that B={(Ua,a)∣a∈A} by the previous remark.
We will prove first that UB∫IX=D∈C(UAX)⋃D.
Let (C,x)∈UB∫IX. Then C⊆Ua for all a∈A. Hence, C⊆UAX, and since C is connected, there exists D∈C(UAX) such that C⊆D. Thus, (C,x)∈D.
Now, let D∈C(UAX) and let (C,x)∈D. Then D⊆Ua for all a∈A. Hence (C,x)≤(Ua,a) for all a∈A. Thus, (C,x)∈UB∫IX.
We claim that if D1,D2 are distinct elements of C(UAX) then D1∩D2=∅. Indeed, if there exists (C,x)∈D1∩D2, then C⊆D1∩D2 which entails a contradiction since D1 and D2 are different connected components of UAX.
We will prove now that D is connected for all D∈C(UAX). Let D∈C(UAX). Note that
[TABLE]
Now, for each x∈D, U(D,x)∫IX∪{D}×D is a connected subspace of ∫IX since (D,x)∈U(D,x)∫IX∩{D}×D and U(D,x)∫IX and {D}×D are connected. Therefore, D is also connected.
Finally, note that D is an open subset of ∫IX for all D∈C(UAX). Since ∫IX is a finite space, the result follows.
(b) Let C∈U(X). If x∈C then ιX(x)=(CU(x),x)∈C since CU(x)⊆C. Thus, ιX(C)⊆C.
We will prove now that ιX(C)♯=C♯. Clearly, ιX(C)♯⊇C♯ since ιX(C)⊆C. Let M∈ιX(C)♯. Then there exists a∈mxl([)X] such that M=(Ua,a). Let x∈C. Then ιX(x)=(CU(x),x)≤(Ua,a) and hence x∈CU(x)⊆Ua. Therefore, C⊆Ua. Now, let (C1,x1)∈C. Then x1∈C1⊆C⊆Ua. Hence, (C1,x1)≤(Ua,a)=M. Thus, M∈C♯.
Now, by 3.14, C is a connected component of UC♯∫IX. Since ιX(C)♯=C♯ and ιX(C)⊆C we obtain that U(ιX)(C)=C by 3.13.
∎
Proposition 8.5**.**
Let X be a finite T0–space. Then U(∫IX)≅U(X). Moreover, U(ιX):U(X)→U(∫IX) is a homeomorphism with inverse U(ρX).
Proof.
Let C∈U(X). Then U(ιX)(C)={(D,x)∈∫IX∣D⊆C} by the previous lemma. Thus,
Observe that U(ιX) is surjective by the previous lemma. The result follows.
∎
Definition 8.6**.**
Let X be a finite T0–space. We define qX:∫IX→U(X) by qX(C,x)=C.
Proposition 8.7**.**
Let X be a finite T0–space.
(1)
qX* is a quotient map.*
2. (2)
Let φ and ψ be the isomorphisms of proposition 7.5. Then the following diagram commutes
[TABLE]
From 7.1 and 7.3 we obtain that U(X) and X are homotopy equivalent if every C∈U(X) has a maximum element. The following proposition provides a version of this result for weak equivalences.
Proposition 8.8**.**
Let X be a finite T0–space. Suppose that every C∈U(X) is weakly contractible. Then there exists a weak homotopy equivalence X→U(X).
Proof.
Let J:U(X)→P be the constant functor with value ∗, the one-element poset. Let α:IX⇒J be the unique natural transformation. It follows that αC is a weak homotopy equivalence for every C∈U(X) and hence, from [4, Corollary 2.6], we obtain that there exists a weak homotopy equivalence η:∫IX→∫J. Clearly ∫J≅U(X). Besides, by 8.2, X is homotopy equivalent to ∫IX. The result follows.
∎
Bibliography5
The reference list from the paper itself. Each links out to its DOI / PubMed record.
2[2] Barmak, J. A. Algebraic topology of finite topological spaces and applications , vol. 2032 of Lecture Notes in Mathematics . Springer, Heidelberg, 2011.
3[3] Cianci, N., and Ottina, M. A combinatorial characterization of Hurewicz cofibrations between finite topological spaces. Topology Appl. 256 (2019), 235–247.
4[4] Fernández, X., and Minian, E. G. Homotopy colimits of diagrams over posets and variations on a theorem of Thomason. Homology Homotopy Appl. 18 , 2 (2016), 233–245.
5[5] Schröder, B. S. W. Fixed point property for 11 11 11 -element sets. Order 10 , 4 (1993), 329–347.