A "permutation" of a non-empty set means an injective mapping of the set onto itself. Let $S(1)$ be the statement "There exists a permutation of every set containing at least two elements, which has no fixed points". Let $S(2)$ be the statement "There exists an infinite set, all of whose permutations have at least one fixed point". All the proofs I have seen of $S(1)$ make use of Zorn's Lemma, which is equivalent to the Axiom of Choice. Is it possibe that the consistency of ZF-without the Axiom of Choice-implies the consistency of ZF $+S(2)$?
2026-04-03 01:04:29.1775178269
Is it consistent without the axiom of choice that every permutation of some infinite set have fixed points?
254 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-SET-THEORY
- how is my proof on equinumerous sets
- Composition of functions - properties
- Existence of a denumerble partition.
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- Show that $\omega^2+1$ is a prime number.
- A Convention of Set Builder Notation
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- Problem with Cartesian product and dimension for beginners
- Proof that a pair is injective and surjective
- Value of infinite product
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Related Questions in AXIOM-OF-CHOICE
- Do I need the axiom of choice to prove this statement?
- Canonical choice of many elements not contained in a set
- Strength of $\sf ZF$+The weak topology on every Banach space is Hausdorff
- Example of sets that are not measurable?
- A,B Sets injective map A into B or bijection subset A onto B
- Equivalence of axiom of choice
- Proving the axiom of choice in propositions as types
- Does Diaconescu's theorem imply cubical type theory is non-constructive?
- Axiom of choice condition.
- How does Axiom of Choice imply Axiom of Dependent Choice?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Yes, it is very much possible to have $S(2)$ without the axiom of choice.
Suppose that $X$ is a set such that:
Then I claim that every permutation of $X$ has co-finitely many fixed points (and in particular a fixed point). To see why note that if $\pi$ is a permutation of $X$, then it defines an equivalence relation by the orbits of each element. And orbits are either finite, or countably infinite.
By the first condition we know that all the orbits are finite. So this defines a partition of $X$, and all its parts are finite, which means that only finitely many elements have nontrivial orbits, which means that only finitely many elements are moved at all.
(Note that these two conditions are not necessary, just sufficient. If $X$ satisfies the above conditions, then $X\cup\Bbb N$ is also a set which every permutation of it has a fixed point.)
So, can there be such set $X$? Yes, there can. We have two easy examples:
In Cohen's first model, the Dedekind finite set of reals added satisfies this property, this is a technical check, but it's not difficult if you're familiar with symmetric extensions.
We say that a set $X$ is amorphous if $X$ cannot be partitioned into two infinite subsets, and $X$ is strongly amorphous if every partition of $X$ into finite parts has all but finitely many parts as singletons. In Fraenkel's first model (with atoms) he constructs a strongly amorphous set; and using various embedding theorems we can have such set in $\sf ZF$ (without atoms).
Similar but different example, is a strong $\kappa$-amorphous set. Which is a set $X$ such that $|X|\nleq\kappa$, and every $A\subseteq X$ has either $|A|<\kappa$ or $|X\setminus A|<\kappa$; the strongness condition is the same as before, every partition into well-ordered parts has $<\kappa$ parts which are non-singletons.
The same arguments as before work out. But the existence of such set is consistent with $\sf DC_{<\kappa}$.
Let me point out that the failure of $S(2)$ is much weaker than the axiom of choice itself. If for every infinite set $X$ we have that $|X|=|X\times\{0,1\}|$, then every infinite set has a permutation without fixed points. Simply fix such partition of $X$ into $|X|$-many pairs, and cycle each pair.
Sageev showed that the above assumption is much weaker than the axiom of choice in full.