Restricted Tukey's Theorem/Weak Form

This article needs to be linked to other articles. In particular: category, finite character You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.

Theorem

Let $X$ be a set.

Let $\AA$ be a non-empty set of subsets of $X$.

Let $'$ be a unary operation on $X$.

Let $\AA$ have finite character.

For all $A \in \AA$ and all $x \in X$, let either:

$A \cup \set x \in \AA$

or:

$A \cup \set {x'} \in \AA$

Then there exists a $B \in \AA$ such that for all $x \in X$, either $x \in B$ or $x' \in B$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Source of Name

This entry was named for John Wilder Tukey.

Sources

• 2005: R.E. Hodel: Restricted versions of the Tukey-Teichmuller Theorem that are equivalent to the Boolean prime ideal theorem (Arch. Math. Logic Vol. 44: pp. 459 – 472)