Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
271 views

A possible ${\sf (ZF)}$-theorem in the spirit of the $3$-set-lemma

The number $3$ plays an interesting role in the following statement: $\newcommand{\S}{\sf(S_3)}\S$ Let $X$ be a non-empty set and let $f:X \to X$ be fixpoint-free (that is $f(x) \neq x$ for all $x\in ...
Dominic van der Zypen's user avatar
4 votes
0 answers
148 views

The monochromatic principle and the axiom of choice

For any set $A\neq\emptyset$, denote by $[A]^A$ the collection of sets $B\subseteq A$ such that there is a bijection $\varphi:B\to A$. If ${\cal S}\subseteq [A]^A$, we say that $B\in[A]^A$ is ...
Dominic van der Zypen's user avatar
3 votes
0 answers
176 views

Ramsey's infinite principle and the axiom of choice

Frank Plumpton Ramsey, best known for giving his name to Ramsey Theory, presented the following theorem in On a Problem of Formal Logic, that was submitted in 1928 and published posthumously. Let $\...
Brendan McKay's user avatar
9 votes
1 answer
513 views

Does "$X \not\to (\omega)^\omega_2$ for every infinite $X$" imply ${\sf AC}$?

For any set $X$ and cardinal $\mu \neq \emptyset$, we denote by $[X]^\mu$ the collection of subsets of cardinality $\mu$. If $\kappa, \mu \neq \emptyset$ are cardinals and $f: [X]^\mu\to \kappa$ is a ...
Dominic van der Zypen's user avatar
1 vote
1 answer
85 views

Maximizing "happy" vertices in splitting an infinite graph

This question is motivated by a real life task (which is briefly described after the question.) Let $G=(V,E)$ be an infinite graph. For $v\in V$ let $N(v) = \{x\in V: \{v,x\}\in E\}$. If $S\subseteq ...
Dominic van der Zypen's user avatar
4 votes
0 answers
127 views

Graphs without maximal vertex-transivite subgraphs

The axiom of choice is of no use when trying to prove that every vertex-transitive subgraph is contained in a maximal vertex-transitive subgraph, because a union of an ascending chain of vertex-...
Dominic van der Zypen's user avatar
9 votes
2 answers
691 views

Choosing subsets of $\mathbb R$ of cardinality $\frak c$, who wins?

Consider the following infinite game: two players, I and II, are alternating and choosing a descending sequence of subsets of $\mathbb R$ of cardinality $\frak c$, so I chooses a set $A_1\subseteq\...
Wojowu's user avatar
  • 28.2k
11 votes
1 answer
803 views

Is it known whether every $\omega$-tree with an infinite antichain has an infinite chain in $\mathsf{ZF}$?

In this paper by Good and Tree, the following result is mentioned without proof as part of Proposition 6.5: Each of the following statements imply those beneath it. The countable union of finite ...
Cameron Buie's user avatar