Combinatorial proofs of Gowers' FIN and FIN theorem
arXiv:1402.6264
Abstract
A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN theorem. The proofs do not use of the concept of ultrafilter.
arXiv commentAn error in Lemma 1