Skip to content

Latest commit

 

History

History
17 lines (15 loc) · 755 Bytes

File metadata and controls

17 lines (15 loc) · 755 Bytes
uid T000141
if
P000017
true
then
P000070
true
refs
doi name
10.1016/S0166-8641(96)00075-2
The combinatorics of open covers II

See the proof of Theorem 2.2 in {{doi:10.1016/S0166-8641(96)00075-2}}, which we summarize here.

An $\omega$-cover of a compact space admits a finite subcover that covers all $k$-sized subsets for any positive integer $k$. Write the space $X$ as an ascending union of ${K_n:n\in\omega}$ where each $K_n$ is compact. Given an $\omega$-cover $\mathscr U_n$ of $X$, let $\mathscr V_n$ be a finite subset of $\mathscr U_n$ that covers all $n$-sized subsets of $K_n$. Note that this is a winning Markov strategy in the $\omega$-Menger game (equivalent to {P70}).