The partitions whose members are finite and the permutations with at most n non-fixed points of a set

Abstract

We write S≤ n(A) and (A) for the set of permutations with at most n non-fixed points, where n is a natural number, and the set of partitions whose members are finite, respectively, of a set A. Among our results, we show, in the Zermelo-Fraenkel set theory, that |(A)| |S≤ n(A)| for any infinite set A and if A can be linearly ordered, then |S≤ n(A)| < |(A)| while the statement ``|S≤ n(A)|≤|(A)| for all infinite sets A" is not provable for n≥ 3.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…