Skip to main content

Questions tagged [axiom-of-choice]

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.

-6 votes
1 answer
124 views

Actual infinitesimals for solving Vitali paradox

Has anyone tried to use actual infinitesimals to solve paradoxes about non-measurability? In Vitali paradox, for example, they divide a set with measure 1 into $\infty$ subsets of zero measure and ...
Марат Рамазанов's user avatar
10 votes
1 answer
363 views

Hereditarily countable sets in Antifounded ZF

A set $x$ is hereditarily countable when every membership-descendant of $x$ (including $x$ itself) is countable. In this paper, Jech proved in ZF that the class of all hereditarily countable sets is a ...
Paul Blain Levy's user avatar
14 votes
2 answers
1k views

Proof/Reference to a claim about AC and definable real numbers

I’ve read somewhere on this site (I believe from a JDH comment) that an argument in favor of AC (I believe from Asaf Karagila) is that without AC, there exists a real number which is not definable ...
Lave Cave's user avatar
  • 243
10 votes
1 answer
613 views

Infinitary logics and the axiom of choice

Suppose we want to enhance ZF by allowing for infinitary formulas instead of just first-order ones in our axiom schema of separation and/or replacement. It seems that we don't need much power in our ...
Mike Battaglia's user avatar
1 vote
0 answers
85 views

Everywhere-defined unbounded operators between Banach spaces

In this post, it is said that there are no constructive examples of everywhere-defined unbounded operators between Banach spaces; every example furnished must use the axiom of choice. This seems like ...
Damalone's user avatar
  • 141
-2 votes
1 answer
162 views

Is discriminative choice provable in ZFC?

Let $\phi$ be a formula defining an equivalence relation. Definitions: The $\phi$-cardinality of a set $X$ be the cardinality of $X/\phi$. That is, the cardinality of the set of all equivalence ...
Zuhair Al-Johar's user avatar
9 votes
1 answer
295 views

Complexity of definable global choice functions

It is well-known that $L$ has a $\Sigma_{1}$-definable global choice function; it is also known that there are other transitive class models of ZFC with this property. I wonder about the complexity ...
MCarl's user avatar
  • 93
5 votes
1 answer
238 views

Is a weak version of the three sets Lemma provable in ZF?

The Three Sets Lemma is the following Lemma: Lemma: Let $f(x)$ be a function from $X$ to $X$ where $f(x)$ has no fixed points. Then there exists a partition of $X$ into three disjoint sets $X_1$, $X_2$...
JoshuaZ's user avatar
  • 6,819
10 votes
1 answer
488 views

Must strange sequences wear Russellian socks?

This is an attempt to make more precise a vague guess at the end of this answer of mine. We work in $\mathsf{ZF}$ throughout. Say that a sequence $\mathcal{A}=(A_i)_{i\in\omega}$ of disjoint sets is ...
Noah Schweber's user avatar
6 votes
2 answers
458 views

Does Well-Ordered Interval Power Set "WOIPS" principle , prove $\sf AC$ in $\sf ZFA$?

Does $\sf ZFA + WOIPS$ prove $\sf AC$? Where $\sf WOIPS$ is phrased as: for every infinite set $X$ the set of intervening cardinals between $|X|$ and $|\mathcal P(X)|$ is well-ordered. In $\sf ZF$, I ...
Zuhair Al-Johar's user avatar
3 votes
1 answer
149 views

Turning linear ordering into well-ordering

Work in ZF + DC. Assume that there is an uncountable $A \subseteq \mathbb{R}$ and a linear order $\prec$ on $A$ such that for every $x \in A$, $\{y \in A: y \prec x\}$ is countable. Must there exist ...
Ollie's user avatar
  • 33
5 votes
1 answer
149 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 ...
Dominic van der Zypen's user avatar
26 votes
1 answer
897 views

A cardinal inequality for finiteness

Nearly ten years ago, I explained in a blog post that, assuming only ZF, a cardinal number $\mathfrak{n}$ is finite if and only if it satisfies this monstrous inequality: $$2^{2^{2^{2^{\mathfrak{n}}}}}...
François G. Dorais's user avatar
12 votes
1 answer
838 views

Partition of unity without AC

Several existence theorems for partition of unity are known. For example (source), Proposition 3.1. If $(X,\tau)$ is a paracompact topological space, then for every open cover $\{U_i \subset X\}_{i \...
BonBon's user avatar
  • 223
6 votes
1 answer
160 views

Does $\mathsf{SVC}^\ast$ exist?

$\mathsf{SVC}(S)$ is the assertion that for all sets $X$ there is an ordinal $\eta$ and a surjection $f\colon\eta\times S\to X$. I would like to denote by $\mathsf{SVC}^\ast(S)$ the same assertion but ...
Calliope Ryan-Smith's user avatar
1 vote
1 answer
298 views

Proof of the axiom of choice for finite sets in ZF [closed]

Let the set $A$ be finite and $\emptyset \notin A$. How can I, without using the axiom of choice, prove by mathematical induction that there exists a function $f : A \rightarrow \bigcup A$ satisfying $...
Maria S.'s user avatar
12 votes
1 answer
419 views

Did Gödel possess a proof of the independence of $\mathsf{AC}$?

We all know Gödel proved the consistency of the Axiom of Choice with $\mathsf{ZF}$ using his constructible universe, and Cohen proved the consistency of $\neg \mathsf{AC}$ using his new method of ...
A. Bailleul's user avatar
  • 1,303
3 votes
0 answers
161 views

Periodicity in the cumulative hierarchy

Under Reinhardt cardinals in ZF, the cumulative hierarchy exhibits a periodicity in that for large enough $λ$, certain properties of $V_λ$ depend on whether $λ$ is even vs odd. See Periodicity in the ...
Dmytro Taranovsky's user avatar
7 votes
0 answers
180 views

Large cardinals beyond choice and HOD(Ord^ω)

Are Reinhardt and Berkeley cardinals (and even a stationary class of club Berkeley cardinals) consistent with $V=\mathrm{HOD}(\mathrm{Ord}^ω)$ ? It seems natural to expect no, but I do not see a proof....
Dmytro Taranovsky's user avatar
4 votes
0 answers
144 views

Consistency of definability beyond P(Ord) in ZF

Is it consistent with ZF that the satisfaction relation of $L(P(Ord))$ is $Δ^V_2$ definable? More generally, is it consistent with ZF that there is a $Δ^V_2$ formula (taking $α$ as a parameter) that ...
Dmytro Taranovsky's user avatar
5 votes
1 answer
270 views

Would strengthening Foundation and Choice in NBG, make it equi-consistent with MK?

This is a follow up to an earlier question about strengthening of foundation in relation to proving the consistency of ZFC. It was shown that it would achieve that, but it may fail short of MK. Here, ...
Zuhair Al-Johar's user avatar
5 votes
1 answer
230 views

Long chains of Dedekind finite sets

This is a variation on this question with amorphous cardinals replaced with dedekind finite sets. Dedekind finite sets are sets that have no countable subset, and it is well known that this is a ...
Ynir Paz's user avatar
  • 384
13 votes
1 answer
549 views

Long chains of amorphous cardinalities

An amorphous set is an infinite set that cannot be partitioned into 2 infinite subsets. An amorphous cardinality is the cardinality of an amorphous set. Working in $\sf ZF$, it is consistent that ...
Ynir Paz's user avatar
  • 384
12 votes
1 answer
506 views

Building the real from Dedekind finite sets

It is well known that the real numbers can be countable union of countable sets by starting with GCH and taking a finite support permutations while collapsing all of $\aleph_n$ for natural $n$. The ...
Holo's user avatar
  • 1,654
3 votes
1 answer
255 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
1 answer
199 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)$, ...
Dominic van der Zypen's user avatar
2 votes
0 answers
115 views

Adding partitions of one but not the other kind

Say that two partitions $(P_i)_{i\in I}, (Q_j)_{j\in J}$ are isomorphic iff there is a bijection $f: I\rightarrow J$ such that $\vert P_i\vert=\vert Q_{f(i)}\vert$ for all $i\in I$. (Note that in the ...
Noah Schweber's user avatar
7 votes
1 answer
400 views

How much choice is needed to prove the completeness of equational logic?

All the proofs of the completeness of (Birkhoff's) equational logic I have read seem to pick representatives for equivalence classes of terms and hence require the axiom of choice. Is AC (or a weak ...
ralphS16's user avatar
13 votes
1 answer
921 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 (...
Dominic van der Zypen's user avatar
17 votes
2 answers
1k views

Axiom of Choice for collections of Equinumerous sets

Let ACE (Axiom of Choice for Equinumerous sets) be the following choice principal: If $S$ is a set of non-empty sets such for any $X,Y\in S$ there is a bijection from $X$ to $Y$, then $S$ has a choice ...
Brian Pinsky's user avatar

15 30 50 per page
1
2 3 4 5
20