Supercompact minus compact is super
Taras Banakh, Zdzisław Kosztołowicz, Sławomir Turek
T. Banakh: Ivan Franko National University of Lviv (Ukraine) and Jan Kochanowski University in Kielce (Poland)
[email protected]
Z. Kosztołowicz: Jan Kochanowski University in Kielce (Poland)
[email protected]
S. Turek: Cardinal Stefan Wyszyński University in Warsaw (Poland)
[email protected]
Abstract.
According to a folklore characterization of supercompact spaces, a compact Hausdorff space is supercompact if and only if it has a binary closed k-network. This characterization suggests to call a topological space super if it has a binary closed k-network N. The binarity of N means that every linked subfamily of N is centered. Therefore, a Hausdorff space is supercompact if and only if it is super and compact. In this paper we prove that the class of super spaces contains all GO-spaces, all supercompact spaces, all metrizable spaces, and all collectionwise normal ℵ-spaces. Moreover, the class of super spaces is closed under taking Tychonoff products and discretely dense sets in Tychonoff products. The superness of metrizable spaces implies that each compact metrizable space is supercompact, which was first proved by Strok and Szymański (1975) and then reproved by Mills (1979), van Douwen (1981), and Dȩbski (1984).
Key words and phrases:
ℵ0-space, ℵ-space, supercompact space; simplicial complex
2010 Mathematics Subject Classification:
Primary: 54D15; Secondary: 54D30
1. Introduction
By the classical Alexander Lemma [1] (see also [9, 3.12.2]), a topological space X is compact if and only if it has a subbase B of the topology such that any cover U⊂B of X contains a finite subcover. However, for the closed interval [0,1], the standard subbase
[TABLE]
of its topology has a much stronger property: each open cover U⊂B of [0,1] contains a two-element subcover {[0,b),(a,1]}⊂U.
This property of the closed interval motivated de Groot [13] to introduce supercompact spaces as topological spaces X possessing a subbase B of the topology such that every cover U⊂B of X contains a two-element subcover {U1,U2}⊂U. The class of supercompact spaces includes all linearly ordered compact space and is closed under Tychonoff products. By a result of Strok and Szymański [21] (reproved in [19], [8], [7]), every compact metrizable space is supercompact. On the other hand, the Stone-Čech compactification βω of the countable discrete space ω is not supercompact by a known result of Bell [5]. More information on supercompact spaces can be found in the monograph of van Mill [18].
There exists a convenient characterization of the supercompactness in terms of binary k-networks. Let us recall that a family N of subsets of a topological space X is called
a k-network if for any open set U⊂X and a compact set K⊂U there exists a finite subfamily F⊂N such that K⊂⋃F⊂U;
a closed k-network if N is a k-network and each set N∈N is closed in X;
linked if for any sets A,B∈N the intersection A∩B is not empty;
centered if for any finite nonempty subfamily F⊂N the intersection ⋂F is not empty;
binary if any linked subfamily F⊂N is centered.
For the first time, the following (folklore) characterization of supercompactness was explicitly proved in [4, 2.2].
Theorem 1**.**
A compact Hausdorff space X is supercompact if and only if it possesses a binary closed k-network.
This theorem shows that in the class of compact Hausdorff spaces the supercompactness is equivalent to the existence of a binary closed k-network. So, the latter property can be called the superness. More precisely, we define a topological space X to be super if it possess a binary closed k-network. In this terminology, Theorem 2 says that a Hausdorff topological space is supercompact if and only if it is super and compact.
Looking at this characterization it is natural to ask which topological spaces (besides supercompact Hausdorff spaces) are super.
Theorem 2**.**
The class of super topological spaces contains all supercompact spaces, all generalized ordered spaces, all metrizable spaces and all collectionwise normal ℵ-spaces.
Let us recall that a regular topological space X is called
generalized ordered (briefly, a GO-space) if X has a base of the topology consisting of order-convex sets with respect to some linear order on X;
an ℵ-space if X has a σ-discrete k-network;
an ℵ0-space if X possesses a countable k-network.
Because of the regularity, in above definitions we can assume that the k-networks are closed.
By the Nagata-Smirnov Metrization Theorem [9, 4.4.7], a regular topological space is metrizable if and only if it has a σ-discrete base. This characterization implies that each (separable) metrizable space is an ℵ-space (and an ℵ0-space).
ℵ0-spaces were introduced by Michael [17] who proved that the class of ℵ0-spaces is closed under taking the function spaces Ck(X,Y) endowed with the compact-open topology. ℵ-spaces were introduced by O’Meara [20] as non-Lindelöf generalizations of ℵ0-spaces. ℵ0-spaces and ℵ-spaces form two important classes of generalized metric spaces that have many applications in Topology, Topological Algebra and Functional Analysis, see [14, §11], [11], [22], [23], [2], [12].
Theorem 2 will be proved in Section 6. The most difficult part is to prove that collectionwise normal ℵ-spaces are super. This is done in the following theorem that will be proved in Section 5.
Theorem 3**.**
Each collectionwise normal ℵ-space possesses a binary σ-discrete closed k-network and hence is super.
Since each σ-discrete family in a Lindelöf space is at most countable, Theorem 3 implies
Corollary 1**.**
Each ℵ0-space possesses a binary countable closed k-network and hence is super.
Since compact metrizable spaces are ℵ0-spaces, Corollary 1 and Theorem 2 imply the Strok–Szymański theorem [21].
Corollary 2** (Strok–Szymański).**
Each compact metrizable space is supercompact.
Next, we discuss the stability of the class of super spaces under some operations. The results of Bell [5], [6] witness that the class of super(compact) Hausdorff spaces is not stable under taking closed subspaces or continuous images. Nonetheless, it is stable under taking Tychonoff products and discretely dense sets in Tychonoff products. A subset X of the Tychonoff product ∏α∈AXα of topological spaces is called discretely dense if for any element x∈∏α∈AXα and any finite set F⊂A there exists a function y∈X⊂∏α∈FXα such that y↾F=x↾F. Observe that X is discretely dense in ∏α∈AXα if and only if X is dense in the Tychonoff product topology of the spaces Xα endowed with the discrete topologies.
Theorem 4**.**
Let X be a discretely dense subspace of the Tychonoff product ∏α∈AXα of topological spaces. If all spaces Xα, α∈A, are super, then so is the space X.
Theorem 4 will be proved in Section 4. In Sections 2–4 we prove some lemmas that will be used in the proof of Theorem 3, which is the most difficult result of this paper. In the proof of this theorem we use the geometric approach of Dȩbski [7] and some ideas from the unpublished survey [15].
Theorem 3 implies that each metrizable space has a binary σ-discrete closed k-network. This motivates the following open problem:
Problem 1**.**
Has each metrizable space a binary σ-discrete base of the topology?
2. Simplicial complexes and their barycentric subdivisions
In this section we recall the necessary information on simplicial complexes. By an abstract simplicial complex we understand a pair K=(V,E) consisting of a set V called the set of vertices of K and a family E of nonempty finite subsets of V such that together with any set σ∈E the family E contains all nonempty subsets of σ. The finite sets σ∈E are called the simplexes of K.
Each vertex v∈V will be identified with the characteristic function δv:V→{0,1} of the singleton {v} in V (so, δv−1(1)={v}). The function δv is an element of the Banach space ℓ1(V) of all functions f:V→R such that ∑v∈V∣f(v)∣<∞.
Each simplicial complex K=(V,E) will be identified with its geometric realization
[TABLE]
where σ(0)={δv:v∈σ}. The geometric realization K of K is endowed with the strongest topology which coincides with the topology inherited from ℓ1(V) on each geometric simplex σ=conv(σ(0)), σ∈E.
For a simplex σ∈E let ∂σ=⋃{τ:τ⊊σ} be the combinatorial boundary of σ and σ∘=σ∖∂σ be the combinatorial interior of σ.
In the sequel, geometric realizations of abstract simplicial complexes will be called simplicial complexes.
For an abstract simplicial complex K, its dimension dim(K) is defined as sup{∣σ∣−1:σ∈E}. It is well-known that the dimension of K equals the topological dimension of the geometric realization K of K.
Let K=(V,E) be an abstract simplicial complex. A simplicial complex K′=(V′,E′) is called a subcomplex of K if V′⊂V and E′⊂E.
For two abstract simplicial complexes K1=(V1,E1) and K2=(V2,E2) with disjoint sets of vertices their joint K1∗K2 is the simplicial complex (V1∪V2,E) endowed with the set of simplexes E={σ:∃σ1∈E1,∃σ2∈E2 with σ⊂σ1∪σ2}.
The cone over a simplicial complex K with vertex v in the join K∗{v} of K and the singleton {v}.
Now we remind the necessary information on barycentric subdivisions of simplicial complexes. For a simplex σ∈E of a complex K=(V,E), the vector
[TABLE]
is called the barycenter of σ.
Let σ∈E and ≺ be a linear order on the set σ. By σ≺ we denote the set of all convex combinations ∑v∈σtvδv∈ℓ1(V) such that tu≥tv for every vertices u≺v of the symplex σ. Observe that σ≺ is convex hull of the set {b{v1},b{v1,v2},…,b{v1,v2,…,vk}}, where σ={v1,v2,…,vk} and v1≺v2≺⋯≺vk.
The family
[TABLE]
consists of ∣σ∣! sets and covers the entire set σ; we call it the barycentric subdivision of σ.
The barycentric subdivision Sd(K) of the complex K
is the family ⋃{Sd(σ):σ∈E}.
Let us consider any σ≺∈Sd(K). Analogously as above, for each total order ≺′ on the set {b{v1},b{v1,v2},…,b{v1,v2,…,vk}}, where σ={v1,v2,…,vk} and v1≺v2≺⋯≺vk we can consider the set σ≺,≺′⊂ℓ1(V) consisting of all convex combinations of the form
[TABLE]
such that if b{v1,…,vi}≺′b{v1,…,vj} then ti≥tj. The family of all σ≺,≺′ forms the second barycentric subdivision Sd2(σ≺) of σ≺. The union
[TABLE]
is called the second barycentric subdivision of σ. The family Sd2(K)=⋃σ∈ESd2(σ) is the second barycentric subdivision of the complex K.
For a simplex σ∈E and vertex u∈σ, the star of δu with respect to Sd(σ) is the set
[TABLE]
The union
[TABLE]
is called the star of δu with respect to Sd(K).
For a simplex τ∈E of the complex K by St2(bτ,K) we denote the closed star of bτ in the second barycentric subdivision of K, i.e.
[TABLE]
Lemma 1**.**
If K=(V,E) is a simplicial complex and τ∈E, then
[TABLE]
Proof.
By the definition,
[TABLE]
Fix any σˉ≺,≺′∈St2(bτ,K) and observe that bτ∈σ≺,≺′ where σ={v1,…,vn}∈E, v1≺⋯≺vn and ≺′ is linear order on the set {b{v1},…,b{v1,…,vn}}. By the definition of σ≺,≺′ we have
[TABLE]
where ∑i=1nsi=1, si≥0 and si≥sj whenever b{v1,…,vi}≺′b{v1,…,vj}.
Hence
[TABLE]
where τ={u1,…,uk}. By the linear independence of the set {δu:u∈V} in the space ℓ1(V) we get τ⊆σ. Moreover, the equality (∗) implies that τ={v1,…,vk}, k≤n, sk=1 and si=0 for for any i=k in {1,…,n}. Therefore the barycenter b{v1,…,vk} is the least element of the set {b{v1},…,b{v1,…,vn}} with respect to order ≺′. So, any point x∈σ≺,≺′ can be written as
[TABLE]
where n=∣σ∣≥∣τ∣, ∑i=1nti=1, ti≥0, σi={v1,…,vi} for each i=1,…,n, σ∣τ∣=σk=τ and tk=max1≤i≤nti.
Now let x=∑i=1ntibσi where
n≥∣τ∣, ∑i=1nti=1,
σ1⊂σ2⊂⋯⊂σn are in E, (∀i ∣σi∣=i, ti≥0), σ∣τ∣=τ, and
t∣τ∣=max1≤i≤nti. We can assume that σi={v1,…,vi} for each i∈{1,…,n} and order the set σ=σn={v1,…,vn} in the following way: v1≺v2≺⋯≺vn. On the set
{b{v1},…,b{v1,…,vn}} we choose a linear order ≺′ such that
bσi≺′bσj if ti≥tj.
Then bτ∈σ≺,≺′ and obviously x∈σ≺,≺′.
∎
Lemma 2**.**
If K=(V,E) is a simplicial complex and τ∈E, then
[TABLE]
Proof.
Let x∈St2(bτ,K). By the Lemma 1, x=i=1∑ntibσi, where i=1∑nti=1, σ1⊂⋯⊂σn are in E, ∣σi∣=i for each i=1,…,n, σ∣τ∣=τ and t∣τ∣=max1≤i≤nti. If we assume that σi={v1,…,vi} for each i=1,…,n then
[TABLE]
Thus
[TABLE]
where
[TABLE]
Obviously s1≥s2≥⋯≥sn and taking sn+1=0 we get
[TABLE]
For each k∈{1,…,n} we have
k(sk−sk+1)=kk1tk=tk, and
consequently
[TABLE]
In order to obtain reverse inclusion, fix
x=∑k=1nskδvk, where n≥∣τ∣, s1≥⋯≥sn≥0,
∑k=1nk(sk−sk+1)=1, sn+1=0,
∣τ∣(s∣τ∣−s∣τ∣+1)=max1≤k≤nk(sk−sk+1), σk={v1,…,vk}∈E for each k=1,…,n and τ=σ∣τ∣. Let
tk=k(sk−sk−1) for each k=1,…,n. Then ∑k=1ntk=1, t∣τ∣=max1≤k≤ntk and the system of equations (∗∗) is satisfied. Therefore, x can be expressed as in equation (∗). It means that
[TABLE]
and x∈St2(bτ,K) by Lemma 1.
∎
Lemma 3**.**
If St2(bσ,K)∩St2(bτ,K)=∅, then σ and τ are
comparable.
Proof.
Let x∈St2(bσ,K)∩St2(bτ,K). We can assume that ∣σ∣≤∣τ∣. We will prove that σ⊂τ. By Lemma 2,
[TABLE]
where σ={v1,…,v∣σ∣}, ∣{v1,…,vn}∣=n≥∣σ∣, τ={u1,…,u∣τ∣}, ∣{u1,…,um}∣=m≥∣τ∣,
[TABLE]
and
[TABLE]
We can assume that sk>0 and tm>0 for all k≤n and k≤m because s∣σ∣,t∣τ∣>0.
The linear independence of the set {δv:v∈V} and the equality (∗) imply that n=m and
there exists a permutation f:{1,…,n}→{1,…,m} such that tf(i)=si and uf(i)=vi for each i∈{1,…,n}.
Denote the set {s1,…,sm}={t1,…,tm} by C and write it as C={c1,…,cl} for some positive real numbers c1>⋯>cl. For every c∈C consider the subsets Sc={i∈{1,…,n}:si=c} and Tc={j∈{1,…,m}:tj=c}. The equality (∗) implies that f(Sc)=Tc for any c∈C.
For two non-empty subsets A,B⊂N we write A<B if maxA<minB.
Taking into account that s1≥⋯≥sn and t1≥⋯≥tm, we conclude that Sc1<Sc2<⋯<Scl and Tc1<Tc2<⋯<Tcl, and hence Sc=Tc for all c∈C.
Find j≤l with s∣σ∣=cj. Taking into account that s∣σ∣+1<s∣σ∣, we conclude that {s1,…,s∣σ∣}={c1,…,cj} and {1,…,∣σ∣}=S1∪⋯∪Sj=T1∪⋯∪Tj. Then
[TABLE]
∎
The last lemma implies the following lemma.
Lemma 4**.**
If S is a family of simplexes in a simplicial complex K and {St2(bσ,K):σ∈S} is linked, then S is a chain.∎
It turns out that Lemma 4 can be reversed in the following sense.
Lemma 5**.**
If σ1⊂⋯⊂σn is a chain of simplexes, then
[TABLE]
Proof.
The chain σ1⊂⋯⊂σn can be enlarged to a chain τ1⊂⋯⊂τm such that ∣τi∣=i and τm=σn. For each i∈{1,…,m} let ti=n1 if τi=σj for some j∈{1,…,n} and ti=0 otherwise. By the Lemma 1
[TABLE]
for each k∈{1,…,n}.
∎
Lemma 6**.**
If σ,τ∈E and σ∩St2(bτ,K)=∅ then τ⊂σ. In particular bτ∈σ.
Proof.
Let x∈σ∩St2(bτ,K). By Lemma 2
[TABLE]
where k=∣σ∣, σ={v1,…,vk}, ∑i=1ksi=1, ∣{u1,…,un}∣=n≥m=∣τ∣, τ={u1,…,um}, t1≥⋯≥tn≥0, ∑i=1ni(ti−ti+1)=1, tn+1=0, m(tm−tm+1)=max1≤i≤ni(ti−ti+1)>0. Suppose ui∈/σ for some i∈{1,…,m}. The linear independence of the set {δv:v∈V} implies that ti=0. Then tj=0 for j≥i. In particular tm=0 and hence m(tm−tm+1)=0, which is a contradiction. Thus τ⊂σ and hence bτ∈σ.
∎
Proposition 1**.**
Let K be a finite-dimensional simplicial complex, F be a family of subcomplexes of K, C be a subcomplex of K, and G be the family of closed stars of the second barycentric subdivision of C centered at vertices of the first barycentric subdivision of C. Then
- (1)
C=⋃G;
2. (2)
the family G is n-discrete where n=1+dim(C);
3. (3)
each linked subfamily L⊂F∪G with L∩G=∅ has ⋂L=∅.
Proof.
Let n=1+dim(C). Observe that
G=i=1⋃nGi, where
[TABLE]
for each i≤n.
Obviously C=⋃G.
We claim that each family Gi is discrete.
Indeed, let σ,τ be two distinct simplexes of C with ∣σ∣=∣τ∣.
If x∈St2(bσ,C) and y∈St2(bτ,C) then by Lemma 2 we have
[TABLE]
where
- (i)
∣{v1,…,vl}∣=l≥∣σ∣,∣{u1,…,um}∣=m≥∣τ∣,
2. (ii)
s1≥⋯≥sl≥sl+1=0, t1≥⋯≥tm≥tm+1=0,
3. (iii)
k=1∑lk(sk−sk+1)=1, k=1∑mk(tk−tk+1)=1,
4. (iv)
∣σ∣(s∣σ∣−s∣σ∣+1)=1≤k≤lmaxk(sk−sk+1), ∣τ∣(t∣τ∣−t∣τ∣+1)=1≤k≤mmaxk(tk−tk+1),
5. (v)
σ={v1,…,v∣σ∣}, τ={u1,…,u∣τ∣}.
6. (vi)
{v1,…,vl},{u1,…,um}∈E and hence max{l,m}≤1+dim(K)=n.
Since σ=τ, there is j such that vj∈/τ. Then
[TABLE]
Then no ball of radius 3n21 in the Banach space ℓ1(V) meets two distinct sets in the family Gi, witnessing that this family if discrete.
Thus
G=i=0⋃nGi is n-discrete.
We now turn to the proof of condition (3). Let L⊂F∪G, where L∩G=∅, be a linked family. Let S={σ∈C:St2(bσ,C)∈L∩G}.
By the Lemma 4, the family S is a chain. So, S={σ1,…,σk}, where σ1⊂⋯⊂σk and L∩G={St2(bσi,C):1≤i≤k}. By the Lemma 5,
[TABLE]
We claim that ∑i=1kk1bσi∈Fˉ for any subcomplex F∈L∩F.
Since
F∩St2(bσk,C)=∅, there exists a simplex τ of F such that τ∩St2(bσk,C)=∅. Lemma 6 implies that σk⊂τ and consequently σi⊂τ and hence bσi∈σˉi⊂τˉ for each i∈{1,…,k}. Then ∑i=1kk1bσi∈τ⊂F by the convexity of the geometric simplex τˉ, and finally ∑i=1kk1bσi∈⋂L.
∎
3. Simplicial realizations of n-discrete families
In this section we prove a technically difficult Proposition 2 on reflexions of n-discrete families in simplicial complexes. We start with the following lemma, which is a modification of the Sweeping Out Theorem 1.10.15 in [10].
Lemma 7**.**
Let L be a finite-dimensional simplicial complex, K⊂L be a subcomplex in L. For any subset A⊂Lˉ there exists a simplicial subcomplex M of L containing K and a continuous map r:U→Mˉ defined on an open neighborhood U⊂Lˉ of M∪A in Lˉ such that r↾M=id, r(A∪Kˉ)=Mˉ, and r(σˉ∩U)⊂σˉ for every simplex σ of L.
Proof.
By induction we shall construct a decreasing sequence (Ln)n∈ω of subcomplexes of L, a sequence (An)n∈ω of subsets An⊂Lˉn and a sequence (rn)n∈ω of continuous maps rn:dom(rn)→Lˉn+1 defined on open subsets dom(rn) of Lˉn such that Lˉ0=L, A0=A and for every n∈ω the following conditions are satisfied:
An+1=rn(An);
K⊂Ln+1 and Lˉn+1∪An⊂dom(rn)⊂Lˉn;
rn↾Lˉn+1=id;
if σ is a maximal simplex of Ln and σˉ⊂An∪Kˉ, then σˉ⊂dom(rn) and rn↾σˉ=id;
if σ is a maximal simplex of Ln and σˉ⊂An∪Kˉ, then rn(dom(rn)∩σˉ)⊂∂σ;
Lˉn+1=Lˉn∖⋃{σ∘:σ is a maximal simplex of Ln with σˉ⊂An∪Kˉ}.
Assume that for some n∈ω the subcomplex Ln and the subset An⊂Lˉn have been constructed. Let S be the family of simplexes of the complex Ln such that σ∘⊂Kˉ∪An. For every simplex σ∈S fix a point dσ∈σ∘∖(An∪Kˉ). The definition of the topology on the complex Lˉn guarantees that the set D={dσ:σ∈S} is closed in Lˉn.
Then dom(rn)=Lˉn∖D is an open subset of Lˉn. Let M be the family of all maximal simplexes of the complex Ln
and observe that Lˉn=⋃σ∈Mσˉ. Put M′={σ∈M:σˉ∩D=∅} and Lˉn+1=Lˉn∖⋃σ∈M′σ∘. It follows that Lˉn+1 coincides with the geometric realization of some subcomplex Ln+1 of the simplicial complex Ln.
For every simplex σ∈M′ fix any continuous map rσ:σˉ∖D→∂σ such that rσ∣∂σ∖D=id.
Such a map rσ can be constructed as follows. Take any homeomorphism h:σˉ→Bˉ onto the closed unit ball Bˉ={x∈Rk:∥x∥≤1} in the Euclidean space Rk of dimension k=dim(σˉ)=∣σ∣−1. Under this homeomorphism the (combinatorial) boundary ∂σ of σˉ maps onto the unit sphere S={x∈Rk:∥x∥=1}.
Next, choose any point c∈h(D∩σˉ) and consider the retraction r:Bˉ∖{c}→S∖{c} assigning to each point x∈Bˉ∖{c} the unique point of the intersection S∩(c+(x−c)R+) of the sphere S with the ray c+(x−c)R+ starting at c and passing through x. Then rσ=h−1∘r∘h∣σˉ∖D is a required retraction of σˉ∖D onto ∂σ.
Finally define the map the rn:Lˉn∖D→Lˉn+1 letting rn∣σˉ=id for every σ∈M∖M′ and rn∣σˉ∖D=rσ for every σ∈M′. Letting An+1=rn(An)⊂Lˉn+1 we complete the inductive step.
After completing the inductive construction, we obtain a decreasing sequence of subcomplexes (Ln)n∈ω of L. Since L is finite-dimensional, this sequence stabilizes, which means that Ln+1=Ln and hence An∪Kˉ=Lˉn for some n∈N. Put M=Ln=Ln+1. By finite recursion define a sequence of maps (r~k:dom(r~k)→Mˉ)k=0n such that
dom(r~n)=Lˉn, r~n=id, and dom(r~k)=rk−1(dom(r~k+1)) and r~k=r~k+1∘rk↾dom(r~k) for every k∈{n−1,n−2,…,0}. By induction it can be shown that for every k∈{n,…,0} the domain dom(r~k) of the map r~k is an open neighborhood of the set Ak in Lˉk and r~k(Ak)=An+1⊂Mˉ. Then the open neighborhood U=dom(r~0) of A∪Kˉ in Lˉ=Lˉ0 and the map r=r~0:U→Mˉ have the required properties.
∎
Proposition 2**.**
For any n-discrete family F of closed subsets of a collectively normal space X there is a continuous surjective map f:X→K onto the geometric realization of some simplicial complex K of dimension dim(K)≤n such that for every set F∈F the image f(F) is a subcomplex of K and for any subfamily E⊂F we get f(⋂E)=⋂E∈Ef(E).
Proof.
Write F as the union F=⋃i=1nFi of discrete families Fi.
Consider the family ⋀F={⋂E:E⊂F}∖{∅} endowed with the partial order induced by the inclusion relation. The set X belongs to the family ⋀F being the intersection of the empty subfamily ∅⊂F. It follows that X is the largest element of the partially ordered set ⋀F.
Let M0 be the set of minimal elements of the partially ordered set ⋀F and for every ordinal α let Mα be the set of minimal elements of the partially ordered set ⋀F∖⋃β<αMβ.
Claim 1**.**
For any distinct sets M,N∈Mα the intersection M∩N belongs to ⋃β<αMβ as long as M∩N=∅.
Proof.
Indeed, assuming that M∩N∈/⋃β<αMβ and taking into account that M∩N is a proper subset of M or N, we would conclude that M or N does not belong to Mα.
∎
Let rank(X) be the smallest ordinal α for which the set Mα is empty. The n-discreteness of the family F implies that rank(X)≤n+1.
Since the family ⋀F is locally finite, for every α≤rank(X) the sets X<α=⋃β<α⋃Mβ and
Xα=⋃β≤α⋃Mβ are closed in X.
Obviously X<rank(X)=X.
Define the function rank:X→rank(X) letting rank−1(α)=Xα∖X<α for every α<rank(X). Claim 1 implies that for every ordinal α<rank(X) and every x∈Xα∖X<α there exists a unique set μα(x)∈Mα such that x∈μα(x). So, μα:Xα∖X<α→Mα is a well-defined function. Let M˙α=μα(Xα∖X<α) and observe that Xα=X<α∪⋃M˙α.
Claim 2**.**
Let α be an ordinal, M∈M˙α and F∈F. If M∩F∖X<α=∅, then M⊂F.
Proof.
Assuming that M⊂F and taking into account that M∩F∖X<α=∅, we conclude that M∩F∈⋀F is a proper non-empty subset of M and hence M∩F∈M<α by the minimality of M. Then M∩F⊂X<α and hence M∩F∖X<α=∅, which contradicts our assumption.
∎
By (finite) induction, for every α<rank(X) we shall construct an open neighborhood Uα of the set Xα in X and a continuous map fα:Uα→Kα into the geometric realization of some simplicial complex Kα of dimension dim(Kα)≤α such that the following condition is satisfied:
for every subfamily E⊂F the image fα(Xα∩⋂E) is a subcomplex of Kα such that fα(Xα∩⋂E)=fα(Uα∩⋂E)=⋂E∈Efα(Uα∩E).
For α=0 the family M0 is discrete. By the collective normality of X, each set M∈M0 has an open neighborhood OM⊂X such that the indexed family (OM)M∈M0 is discrete in X. For every M∈M0 consider the open neighborhood UM=OM∖⋃{E∈⋀F:M∩E=∅}.
Then U0=⋃M∈M0UM is an open neighborhood of the closed set X0=⋃M0 in X. Let K0 be the 0-dimensional simplicial complex whose set of vertices coincides with M0=M˙0. Let f0:U0→Kˉ0 be the map assigning to each point X0=⋃M0 the characteristic function δM∈Kˉ0 for the unique set M∈M0 whose neighborhood UM contains x. The map f0 is continuous, since K0 is a discrete space and f0 is locally constant.
We claim that the map f0 satisfies the condition (∗0). It suffices to check that ⋂E∈Ef0(U0∩E)⊂f(X0∩⋂E) for any subfamily E⊂F. Fix any δM∈⋂E∈Ef0(U0∩E) where M is a vertex of the complex K0. Then for every E∈E we have δM∈f0(U0∩E) and hence UM∩E=∅. The choice of the neighborhood UM guarantees that M∩E=∅ and then M⊂E by the minimality of M. Then M⊂⋂E and hence {δM}=f0(M)⊂f0(X0∩⋂E).
Now assume that for some (finite) ordinal α<rank(X) we have constructed an open neighborhood Uα of Xα in X and a map fα:Uα→Kα into a similicial complex of dimension dim(Kˉα)≤α satisfying the condition (∗α).
Put β=α+1. Let us recall that M˙β={M∈Mβ:M⊂Xα}. In each set M∈M˙β fix a point zM∈M∖Xα and observe that the set Zβ={zM:M∈M˙β} is closed in X (by the local finiteness of M˙β) and Zβ⊂Xβ∖Xα.
By the normality of X there exists a continuous map λα:X→[0,1] such that the preimage λα−1(1) contains the set Zβ∪(X∖Uα) in its interior, and the preimage λα−1(0) contains some open neighborhood Wα of Xα in X. Let’s observe that Wα⊂Uα and M∖Wα=∅ for every M∈M˙β.
Let Lβ:=Kα∗M˙β be the joint of the simplicial complex Kα and the [math]-dimensional simplicial complex whose set of vertices coincides with M˙β. It follows that dim(Lβ)≤dim(Kα)+1≤α+1=β.
By Claim 1, the family of closed sets (M∖Wα)M∈M˙β is disjoint and, being locally finite, is discrete. By the collective normality of X, there exists a discrete family of open sets (VM)M∈M˙β in X such that
[TABLE]
for all M∈M˙β.
By the property (∗α), for every M∈M˙β⊂⋀F, the sets fα(Uα∩M) and fα(Xα∩M) coincide with the geometric realization KM of some subcomplex KM of Kα.
For every M∈M˙β consider the map gM:Wα∪VM→Kα∗{M}⊂Lˉβ defined by
[TABLE]
Using the properties of the function λα, it can be shown that the function gM is well-defined and continuous.
By Lemma 7, there exist a subcomplex LM of Kα∗{M} with Kˉα∪{δM}⊂LˉM, an open set OM⊂Kα∗{M} containing gM(M)∪LˉM, and a function rM:OM→LˉM such that
rM↾LˉM=id,
rM(gM(M)∪Kˉα)=LˉM,
rM(σˉ∩OM)⊂σˉ for any simplex σ of the complex Kα∗{M}.
Let ΛM be the subcomplex of LM whose geometric realization ΛˉM coincides with the closure of the set LˉM∖Kˉα in LˉM.
Consider the open neighborhood UM=VM∩gM−1(OM) of M∖Wα in X.
Let Uβ=Wα∪⋃M∈M˙βUM, Kβ=Kα∪⋃M∈M˙βΛM, and fβ:Uβ→Kˉβ be the map defined by fβ↾Wα=fα↾Wα and fβ↾UM=rM∘gM↾UM. It remains to check that the map fβ:Uβ→Kˉβ has property (∗β). The proof will be divided into a series of claims.
Claim 3**.**
fβ↾M=rM∘gM↾M* for every M∈M˙β.*
Proof.
Take any x∈M. If x∈/Wα, then fβ(x)=rM∘gM(x) by the definition of fβ. If x∈Wα, then gM(x)=fα(x)∈Kˉα⊂LˉM and rM∘gM(x)=gM(x)=fα(x)=fβ(x).
∎
Claim 4**.**
For every M∈M˙β,
[TABLE]
Proof.
Since fα(Uα∩M)=KˉM, the definition of the map gM ensures that gM(M)⊂KM∗{M}. The property (c) of the retraction rM guarantees that rM(gM(M))⊂KM∗{M}. By the property (b) of the map rM,
[TABLE]
Then ΛˉM=ΛˉM∖Kˉα⊂KM∗{M} and finally
ΛˉM∩Kˉα⊂KM∗{M}∩Kˉα=KˉM.
By Claim 3,
[TABLE]
∎
Claim 5**.**
fβ(M)=KˉM∪ΛˉM=KˉM∪(ΛˉM∖Kˉα)* for every M∈M˙β.*
Proof.
By Claim 4,
[TABLE]
and hence fβ(M)∩Kˉα=KˉM. Applying the property (b) of the retraction rM and the inclusion ΛˉM∩Kˉα⊂KˉM, we obtain the desired equality
[TABLE]
∎
Claim 6**.**
For every F∈⋀F we have
[TABLE]
Proof.
Fix any M∈M˙β. Claim 6 can be derived from the the following statements.
-
If M⊂F, then ∅=M∖Xα=F∩M∖Xα.
-
If F∩M∖Xα=∅, then M⊂F by Claim 2.
-
If M⊂F, then ∅=M∖Wα=F∩M∖Wα⊂F∩UM.
-
If UM∩F=∅, then ∅=F∩M∖Wα⊂F∩M∖Xα.
∎
Claim 7**.**
For every M∈M˙β and F∈⋀F we have
[TABLE]
Proof.
The inclusion is trivially true of UM∩F=∅. So, we assume that UM∩F=∅ and hence M⊂F by Claim 6.
By the condition (∗α) the set fα(Xα∩F)=fα(Uα∩F) is equal to the geometric realization KˉF of some subcomplex KF of Kα. The inclusion M⊂F implies KM⊂KF.
The definition of the map gM ensures that gM(UM∩F)⊂KF∗{M}. The property (c) of the retraction rM guarantees that rM∘gM(UM∩F)⊂KF∗{M}.
Then
[TABLE]
∎
Taking into account Claim 6, for every F∈⋀F, consider the subfamily
[TABLE]
Claim 8**.**
For every F∈⋀F, the sets fβ(F∩Xβ) and fβ(F∩Uβ) are equal to the subcomplex
[TABLE]
of Kˉβ.
Proof.
By the inductive assumption (∗α), the set fα(Uα∩F)=fα(Wα∩F)=fα(Xα∩F) is equal to the geometric relaization KˉF of some subcomplex KF of Kα. For every M∈M˙F the inclusion M⊂F implies
[TABLE]
and consequently, ΛˉM∩Kˉα⊂KˉM⊂KˉF.
The choice of the family M˙F ensures that
[TABLE]
and
[TABLE]
By Claim 5,
[TABLE]
and by Claim 7,
[TABLE]
which implies the desired equality
[TABLE]
∎
Finally, we are able to check the condition (∗β). Take any subfamily E⊂F and put F=⋂E. Using Claim 6, we can show that M˙F=⋂E∈EM˙E.
Taking into account that the family (ΛˉM∖Kˉα)M∈M˙β is disjoint, one can check that
[TABLE]
By Claim 8 and the condition (∗α),
[TABLE]
which completes the proof of the condition (∗β) and also completes the inductive step.
After completing the inductive construction, consider the finite ordinal α=rank(X)−1≤n and observe that Xα=X. Put K=Kα and observe that condition (∗α) implies that the map f=fα:X→K has the property required in Proposition 2.
∎
4. A Key Lemma
Lemma 8**.**
Let F be an n-discrete family of closed subsets of a collectively normal space X.
For every closed subset C⊂X there exists an (n+2)-discrete family G of closed subsets of X such that C=⋃G and for any linked family L⊂F∪G with L⊂F the intersection ⋂L is not empty.
Proof.
Since the family FC=F∪{C} is (n+1)-discrete, by Proposition 2, there exists a surjective continuous map f:X→K onto the geometric realization of some simplicial complex K of dimension dim(K)≤n+1 such that for any subfamily E⊂{C}∪F the image f(⋂E) is a subcomplex of K equal to the intersection ⋂E∈Ef(E).
Let F′={f(F):F∈F}. Let G′ be the family of all closed stars of the second barycentric subdivision of the subcomplex f(C), centered at the vertices of the first barycentric subdivision of f(C). By Proposition 1, the family G′ is an (n+2)-discrete closed cover of f(C) such that any linked family L′⊂F′∪G′ with L′∩G′=∅ has ⋂L′=∅.
Consider the family G={C∩f−1(G′):G′∈G′} and observe that G is an (n+2)-discrete closed cover of C.
Now take any linked system L⊂F∪G with L⊂F and consider the linked system L′={f(L):L∈L}⊂F′∪G′.
It follows that L′∩G′=∅ and hence ⋂L′ contains some point
[TABLE]
Then we can find a point x∈C∩⋂(L∩F) with f(x)=y and conclude that x∈⋂L.
∎
5. Proof of Theorem 3
Given a collectionwise normal ℵ-space X, we should prove that X has a binary σ-discrete closed k-network.
The space X, being an ℵ-space, admits a σ-discrete closed k-network N=⋃i∈ωNi.
By induction, for every n∈ω we shall construct a 2n+1-discrete family Fn of closed subsets of X that has the following property
Fn=⋃N∈NnFN where for every N∈Nn the subfamily FN has the properties: N=⋃FN and each linked family L⊂FN∪⋃k<nFk with L⊂⋃k<nFk has N∩⋂L=∅.
Put F0=N0 and observe that the family F0 is 2-discrete and has property (∗0). Indeed, for every N∈N0 consider the subfamily FN={N}⊂F0 and observe that for any non-empty linked family L⊂{N} we have N∩⋂L=N=∅.
Now assume that for some n∈ω we have constructed 2i+1-discrete families Fi, i<n. Then the family F=⋃i<nFi is m-discrete for m=∑i<n2i+1=2n+1−2. For every N∈Nn we can apply Lemma 8 and find a (m+2)-discrete closed cover FN of the set N such that each linked family L⊂FN∪⋃k<nFk with L⊂⋃k<nFk has N∩⋂L=∅. Then the 2n+1-discrete family Fn:=⋃N∈NnFN has the property (∗n).
We claim that F=⋃n∈ωFn is a σ-discrete binary closed k-network for X. It is clear that F is σ-discrete and consists of closed sets. Let us show that F is binary. Given any finite linked subfamily L⊂F, find the smallest number n∈ω such that L⊂⋃k≤nFk. Since the family Nn is disjoint, there exists a unique N∈Nn such that L⊂FN∪⋃k<nFk. The property (∗n) ensures that ⋂L=∅.
To see that F is a k-network for X, take any open set U⊂X and a compact subset K⊂U. Since N is a k-network, there is a finite subfamily N′⊂N such that K⊂⋃N′⊂U. By the inductive construction, for every N∈N′ there exist a number mN∈N and an mN-discrete family DN⊂F such that N=⋃DN. By the compactness of K∩N, the mN-discrete subfamily KN={D∈DN:D∩K=∅} is finite. Then E=⋃N∈N′KN is a finite subfamily of F such that K⊂⋃E⊂U. This witnesses that F is a k-network for X.
6. Proof of Theorem 2
In this section we prove Theorem 2. We need to prove that the class of super spaces contains all supercompact spaces, all generalized ordered spaces, all metrizable spaces and all collectionwise normal ℵ-spaces. The superness of collectionwise ℵ-spaces has been proved in Theorem 3. Since each metrizable space is a collectionwise normal ℵ-space, Theorem 3 implies that metrizable spaces are super. The superness of supercompact spaces is proved in Theorem 2.2 in [4].
It remains to prove the superness of generalized ordered spaces. Let X be a GO-space and B be a base of the topology of X, consisting of order-convex sets with respect to some linear order ≤ on X. Let us recall that a subset C⊂X is order-convex if for any points x,y∈C the set C contains the order interval [x,y]:={z∈X:x≤z≤y}.
Let K be the family of all closed order-convex sets in the GO-space (X,≤). We claim that K is a binary closed k-network for X, witnessing that the space X is super. To prove that K is binary, take any nonempty finite linked family L⊂K. For any sets A,B∈L choose a point xAB∈A∩B such that xAB=xBA. For every L∈L let aL:=min{xLB:B∈L} and bL:=max{xLB:B∈L}.
The order-convexity of the set L guarantees that [aL,bL]⊂L. Let a:=max{aL:L∈L} and b:=min{bL:L∈L}. Find sets A,B∈L such that a=aA and b=bB. Then a=aA≤xAB=xBA≤bB=b and hence [a,b]⊂[aL,bL]⊂L for all L∈L, which means that [a,b]⊂⋂L and the intersection ⋂L is not empty. Therefore, the linked family L is centered and the family K is binary.
It remains to show that K is a k-network for X. Fix any open set U⊂X and any compact set K⊂U. By definition, a generalized ordered space is Hausdorff. This implies (see [3]) that the linear order ≤ is closed in X×X and order-invervals [x,y] are closed subsets of X. By [16, 4.1], generalized ordered spaces are regular. This allows us for every x∈K to choose an open order-convex set Ox∈B such that x∈Ox⊂Ox⊂U. The closedness of the linear order on X implies that the closure Ox of the order-convex set Ox remains order-convex. By the compactness of K, the open cover {Ox:x∈K} of K has a finite subcover {Ox:x∈F} (here F is a suitable finite subset of K). Then the family F={Ox:x∈F}⊂K has the property K⊂⋃F⊂U, witnessing that K is a binary closed k-network and the GO-space X is super.
7. Proof of Theorem 4
Given a discretely dense subset X of the Tychonoff product ∏α∈AXα of super spaces Xα, we should prove that X is super. For every α∈A fix a binary closed k-network Kα in the super space Xα. Replacing Kα by Kα∪{Xα}, we can assume that Xα∈Kα. For every finite subset F⊂A let prF:X→∏α∈FXα, prF:x↦x↾F, be the natural projection of X onto the finite product ∏α∈FXα. The discrete density of X in ∏α∈AXα guarantees that prF(X)=∏α∈FXα.
Denote by [A]<ω the family of finite subsets of the index set A. We claim that the family
[TABLE]
is a binary k-network for the space X.
To see that K is a k-network, take any open set U⊂X and a compact set K⊂U. By the definition of the Tychonoff product topology and the compactness of K, there exists a finite subset F⊂A and an open set V⊂∏α∈FXα such that K⊂prF−1(V)⊂U.
It is easy to check that the family
[TABLE]
is a k-network for the product ∏α∈FXα. Consequently, there exists a finite subfamily F⊂KF such that prF(K)⊂⋃F⊂V. Then E:={prF−1(K):K∈F} is a finite subfamily in K such that K⊂⋃E⊂U, witnessing that K is a closed k-network for X.
Next, we prove that the family K is binary. Fix any nonempty finite linked subfamily L⊂K. By the definition of the family K, each set L∈L⊂K is equal to prFL−1(∏α∈FLKL,α) for some finite set FL⊂A and an indexed family (KL,α)α∈FL∈∏α∈FLKα. Since Xα∈Kα for all α∈A, we can replace each FL by the finite set F=⋃L∈LFL and assume that F=FL for all L∈L. The linkedness of the family L implies that for every α∈F the family {KL,α}α∈F⊂Kα is linked and hence centered (by the binarity of Kα).
Then the intersection ⋂L∈LKL,α contains some point xα. Since X is discretely dense in ∏α∈AXα, there exists x∈X such that x(α)=xα for all α∈F. It follows that
[TABLE]
witnessing that the family L is centered. Therefore, the closed k-network K for X is binary.