basic constructions:
strong axioms
further
The axiom of small violations of choice, or SVC, introduced by Blass (1979) asserts that
Note that if $S=1$, then every set is a subquotient of a choice set; but choice sets are closed under subsets and quotients, so this means that every set is choice, i.e. that the axiom of choice holds. Thus, SVC is a weakened version of AC; intuitively, it says that “the failure of AC to hold is parametrized by a mere set” (rather than a proper class).
At least assuming classical logic, it is equivalent to say that every set is a quotient of $A\times S$, for we can extend any function defined on a subset of $A\times S$ to be constant on the complement of this subset.
The following statements are all consequences of SVC (some requiring excluded middle).
Assuming SVC with $S$, AC holds as soon as $S$ is choice.
The regular extension axiom (REA).
The axiom of multiple choice (AMC).
There are “enough highly filtered ordinals,” in the sense that for any set $A$, there is a limit ordinal $\alpha$ such that there is no cofinal function $A\to \alpha$. (This is actually a consequence of REA.)
There are enough injective abelian groups.
The category of anafunctors between two small categories is essentially small.
The (local) axiom of small cardinality selection.
SVC holds in all “ordinary” permutation and symmetric model?s of classical (material) set theory, as well as in hereditarily-ordinal-definable and relatively-constructible submodels. However, it can fail in permutation models over proper classes.
When we move to constructive mathematics, however, SVC quickly becomes unreasonable, because in the absence of LEM there are usually very few choice objects. In particular (see MO:a/339314) Simon Henry argues that any Grothendieck topos satisfying both SVC and $\neg LEM$ (i.e. $\neg \forall P, P\vee \neg P$, which holds in many toposes such as $Sh([0,1])$) is trivial.
SVC can be regarded as a sort of “dual” or “complement” to COSHEP, since it deals with choice sets and COSHEP deals with projective sets. And while COSHEP implies the existence of projective resolutions, SVC implies the existence of (at least some) injective resolutions.
Moreover, at least assuming classical logic, SVC + COSHEP implies AC. First note that if SVC holds with $S$, then it also holds with $S'$ for any surjection $S'\to S$; thus under SVC + COSHEP we may assume that SVC holds with a projective set $S$. Let $Z$ be any set, and let $g\colon A\times S \twoheadrightarrow Z^S$ be a surjection, where $A$ is choice. For each $s\in S$, let $Z_s = \{g(a,s)(s) \vert a\in A\} \subseteq Z$. Then each $Z_s$ is a surjective image of $A$, and hence choice. If each $Z\setminus Z_s$ is nonempty, then (since $S$ is projective) we have a function $f\colon S\to Z$ such that $f(s)\notin Z_s$ for all $s$. But $g$ is surjective, so there exist $s_0\in S$ and $a_0\in A$ with $g(a_0,s_0) = f$, whence $g(a_0,s_0)(s_0) = f(s_0) \notin Z_{s_0}$, a contradiction. Thus some $Z_s$ is all of $Z$, and hence $Z$ is choice; so AC holds.
SVC was introduced in the paper
where most of the above results were proven. Some others can be found in
Last revised on October 27, 2022 at 08:50:49. See the history of this page for a list of all contributions to it.