UDC 519.50+50.01
MATHEMATICS
Submitted 1969-01-01 | RussiaRxiv: ru-196901.27068 | Translated from Russian

Abstract

Full Text

UDC 519.50+50.01

MATHEMATICS

I. I. PAROVICHENKO

ON TOPOLOGICAL EQUIVALENTS OF TYCHONOFF’S THEOREM

(Presented by Academician P. S. Aleksandrov, 21 V 1968)

  1. According to the well-known theorem of Kelley, Tychonoff’s theorem on the bicompactness of the product of bicompact \(T_1\)-spaces is equivalent to the axiom of choice (AC). In \((^2)\), Uok showed that, assuming the weak axiom of choice (ACF) (choice for a family of nonempty finite sets), the following three propositions are equivalent:

\((\mathrm{TF})\). Tychonoff’s theorem for the product of finite spaces.

\((\mathrm{R})\). (Rado’s theorem). Let \(\{X_i \mid i \in I\}\) be a family of nonempty finite sets. Suppose, further, that for each finite subset \(A\) of the set \(I\) a choice function \(f_A\) is given for the family \(\{X_i \mid i \in A\}\). Then there exists a choice function \(f\) for \(\{X_i \mid i \in I\}\) such that for any finite subset \(A\) of the set \(I\) there exists a finite set \(B\) such that \(A \subseteq B \subseteq I\) and \(f(i)=f_B(i)\) for all \(i \in A\).

\((\mathrm{AL})\). Alexander’s closed subbase lemma for bicompactness.

Let us add the following propositions:

\((\mathrm{TT}_2)\). Tychonoff’s theorem for the product of bicompact \(T_2\)-spaces.

\((\mathrm{V})\). Vietoris’ theorem on the bicompactness of the exponential space over a bicompact space.

The main purpose of the present paper is the following

Theorem. Without assuming the weak axiom of choice, the propositions \((\mathrm{TF})\), \((\mathrm{AL})\), and \((\mathrm{V})\) are equivalent to Tychonoff’s theorem for bicompact \(T_2\)-spaces \((\mathrm{TT}_2)\).

  1. Let us add three more propositions:

\((\mathrm{R}_2^{+})\). Let a set \(I\) be given, and for each of its finite subsets \(A\) let a nonempty family \(F(A)\) of functions be given, taking the values 0 and 1, whose domains of definition lie in \(I\) and contain \(A\), with
\[ A_1 \subseteq A_2 \Rightarrow F(A_1) \supseteq F(A_2). \]
Then on \(I\) there exists a function \(f\) such that for any finite subset \(A\) of the set \(I\) there exists \(\varphi \in F(A)\) such that \(\varphi(i)=f(i)\) for all \(i \in A\).

\((\mathrm{TD})\). The Tychonoff product of two-point spaces \(\Pi\{D_i \mid i \in I\}\) is bicompact.

\((\Phi)\). (the maximal-filter principle). Every filter in the set of all subsets of a set \(X\) is contained in a maximal filter.

The proof of the theorem is carried out according to the scheme:
\[ (\mathrm{AL}) \Rightarrow (\mathrm{V}) \Rightarrow (\mathrm{TT}_2) \Rightarrow (\mathrm{TF}) \Rightarrow (\mathrm{TD}) \Rightarrow (\mathrm{R}_2^{+}) \Rightarrow (\Phi) \Rightarrow (\mathrm{AL}). \]

The first two implications follow from the remark at the end of our preceding paper \((^1)\). \((\mathrm{TT}_2) \Rightarrow (\mathrm{TF}) \Rightarrow (\mathrm{TD})\) is obvious. \((\mathrm{TD}) \Rightarrow (\mathrm{R}_2^{+})\) is proved analogously to Gottschalk’s implication \((^2)\): it is enough to consider the (centered) system of closed sets \(\Phi_A\) of the product \(\Pi D_i\), corresponding to finite \(A \subset I\), which are defined as follows. First one takes the restrictions of all functions in \(F(A)\) to the set \(A\) (there are finitely many such restrictions!), after which \(\Phi_A\) is taken to be all possible extensions of the functions so obtained from \(A\) to all of \(I\). Since

the proof \((\Phi)\Rightarrow(\mathrm{AL})\) is generally known, so it remains only to show that \((\mathrm{R}_2^+)\Rightarrow(\Phi)\), which we shall do.

  1. As is known, a two-valued measure on a Boolean algebra \(B\) is a nonconstant mapping \(B\to\{0,1\}\) satisfying finite additivity for disjoint elements. At the same time, two-valued measures on \(B\) are nothing other than the characteristic functions of maximal filters in \(B\). If \(\Sigma\) is a filter in \(B\), then we shall call a subalgebra \(B_0\) of \(B\) \(\Sigma\)-admissible if it contains a maximal (relative to \(B_0\)) filter \(\Sigma^+\) containing \(\Sigma\). If \(\Sigma\) is a filter in \(B\), then by \(I(\Sigma)\) we denote the ideal of all complements of elements of \(\Sigma\). Obviously, \(\Sigma\cup I(\Sigma)\) is a \(\Sigma\)-admissible subalgebra of \(B\). Below \(P(X)\) denotes the algebra of all subsets of \(X\).

Lemma. If \(\Sigma\) is a filter in \(P(X)\) and \(A\) is a finite subset of \(P(X)\), then there exists a \(\Sigma\)-admissible subalgebra in \(P(X)\) containing \(A\).

It suffices to consider the case where \(A\) consists of a single set: \(A=\{M_1\}\), since the remainder can be proved by induction. If \(M_1\in \Sigma\cup I(\Sigma)\), then there is nothing to prove, so let this not be so. Then \(M_1\) intersects every element of \(\Sigma\) (otherwise \(M_1\in I(\Sigma)\)). Adding all these intersections, as well as all their supersets, to \(\Sigma\), we obtain a filter \(\Sigma^+\supseteq \Sigma\), which will be maximal in the subalgebra \(\Sigma^+\cup I(\Sigma^+)\), containing \(M_1\).

\((\mathrm{R}_2^+)\Rightarrow(\Phi)\). Let \(\Sigma\) be a filter in \(P(X)\); put, for \((\mathrm{R}_2^+)\), \(I=P(X)\), and take as \(F(A)\) all two-valued measures on all \(\Sigma\)-admissible subalgebras containing \(A\). The lemma then ensures that \(F(A)\) is nonempty. Obviously, \(f\) will be a measure on \(P(X)\), and \(\{M\mid f(M)=1\}\) is a maximal filter in \(P(X)\) containing \(\Sigma\).

In conclusion we note that in Wolk’s paper (²), in proving the equivalence of \((\mathrm{TF})\) and \((\mathrm{AL})\), the use of the weak axiom of choice is essential in both implications needed for this, which it was possible to avoid in the present work. Since the list of effective equivalents in our sense also includes the maximal filter principle, this list can be substantially enlarged by many other assertions from topology, set theory, and mathematical logic. In particular, the equivalence of \((\mathrm{TT}_2)\) and \((\Phi)\), which we have proved here incidentally, has already been mentioned in the literature. And, finally, we note that the conjunction \((\mathrm{R}\ \&\ \mathrm{ACF})\) can be added to our list, since \((\mathrm{TR})\Rightarrow(\mathrm{R}\ \&\ \mathrm{ACF})\Rightarrow(\Phi)\).

Kishinev State
University

Received
5 V 1968

REFERENCES

  1. I. I. Parovichenko, DAN, 183, No. 6 (1968).
  2. E. S. Wolk, Proc. Am. Math. Soc., 18, No. 1, 113 (1967).
  3. R. Rado, Canad. J. Math., 1, 338 (1949).

Submission history

UDC 519.50+50.01