Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 8628

An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually disjoint nonempty sets, there exists at least one set that contains exactly one element in common with each of the nonempty sets. The axiom of choice is related to the first of Hilbert's problems.

23 votes
2 answers
3k views

Does the "three-set-lemma" imply the Axiom of Choice?

Consider the following curious statement: $(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 X$). Then there are subsets $X_1, X_2, X_3 …
5 votes
1 answer
166 views

The equivalence of Dedekind-infinite and dually Dedekind-infinite as a weak form of (AC)

A set $X$ is Dedekind-infinite if there is an injective map $f: X\to X$ that is not surjective. A set $X$ is dually Dedekind-infinite if there is a surjective map $f: X\to X$ that is not injective. In …
4 votes
Accepted

Proof of the axiom of choice for finite sets in ZF

It holds vacuously for $A = \emptyset$: then $\bigcup A = \emptyset$ and the empty function $\emptyset: \emptyset \to \emptyset$ trivially fulfills $f(a) \in A$ for all $a\in A$ -- because it is impos …
Dominic van der Zypen's user avatar
3 votes
1 answer
266 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 …
4 votes
1 answer
207 views

Weak Power Hypothesis and Dependent Choice

Consider in $\newcommand{\ZF}{{\sf (ZF)}}\ZF$ the following statement: Weak Power Hypothesis (WPH): if $X,Y$ are sets and there is a bijection between $\newcommand{\P}{{\cal P}}\P(X)$ and $\P(Y)$, th …
13 votes
1 answer
932 views

Cantor-Bernstein with "weakly injective" functions

Let us call a map $f: X \to Y$ between non-empty sets a "weak injection" if $f^{-1}(\{y\})\subseteq X$ is finite for every $y \in Y$. Recall that the (Schroeder-)Cantor-Bernstein-Theorem (sometimes ab …
6 votes
1 answer
279 views

The Parity Principle and $\mathbf{C}_2$ (choice for $2$-sets)

The Parity Principle states that if $X\neq \emptyset$ is a set, then there is $\mathcal B\subseteq \mathcal P(X)$ such that whenever $a,b\in \mathcal P(X)$ with $a\mathbin\Delta b = \{x\}$ for some $ …
15 votes
1 answer
1k views

Parity and the Axiom of Choice

Motivation. The three-dimensional cube can be formalized by $\mathcal P(\{0,1,2\})$ where vertices $x,y\in\mathcal P(\{0,1,2\})$ are connected by an edge if and only if their symmetric difference $x\m …
3 votes
2 answers
205 views

Posets such that the collection of principal down-sets does not have property ${\bf B}$

We say that a hypergraph $H=(V,E)$ has property ${\bf B}$ if there is $S\subseteq V$ such that for all $e\in E$ with $|e|>1$ we have $S\cap e \neq \emptyset \neq e \setminus S$. Let $(P,\leq)$ be a pa …
4 votes
0 answers
147 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 monochro …
9 votes
1 answer
244 views

Non-Ramsey functions $c:[\omega]^\omega\to\{0,1\}$ and the Axiom of Choice

Let $[\omega]^\omega$ denote the collection of infinite subsets of $\omega$, and let $c:[\omega]^\omega\to\{0,1\}$ be a function. We say that $a\in [\omega]^\omega$ is monochromatic with respect to $c …
7 votes
0 answers
196 views

Does the Weak Power Hypothesis imply the Boolean Prime Ideal Theorem?

If there is a bijection $\varphi:x\to y$ between two sets $x$ and $y$, we use the notation $x\simeq y$. The Weak Power Hypothesis is the following statement: (WPH) For all sets $x, y$, whenever ${\ca …
3 votes
0 answers
207 views

Weak Power Hypothesis with injections instead of bijections

Let $x,y$ be sets. We use the following notation: $x\simeq y$ means that there is a bijection $\varphi:x\to y$, and $x\leq y$ means that there is an injection $\iota:x\to y$. The Weak Power Hypothes …
9 votes
1 answer
506 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 …
3 votes
1 answer
478 views

Does the partition principle imply (DC)?

For sets $x, y$ we write $x\leq y$, if there is an injection $\iota: x \to y$, and we write $x \leq^* y$ if either $x = \emptyset$ or there is a surjection $s: y \to x$. In ${\sf (ZF)}$ we have that $ …

15 30 50 per page