Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T01:46:14.329Z Has data issue: false hasContentIssue false

A FINITE-TO-ONE MAP FROM THE PERMUTATIONS ON A SET

Part of:Set theory

Published online by Cambridge University Press:  19 October 2016

NATTAPON SONPANOW
Affiliation:
Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok, Thailand email chonattapon@gmail.com
PIMPEN VEJJAJIVA*
Affiliation:
Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok, Thailand email Pimpen.V@chula.ac.th
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Forster [‘Finite-to-one maps’, J. Symbolic Logic68 (2003), 1251–1253] showed, in Zermelo–Fraenkel set theory, that if there is a finite-to-one map from ${\mathcal{P}}(A)$ , the set of all subsets of a set $A$ , onto $A$ , then $A$ must be finite. If we assume the axiom of choice (AC), the cardinalities of ${\mathcal{P}}(A)$ and the set $S(A)$ of permutations on $A$ are equal for any infinite set $A$ . In the absence of AC, we cannot make any conclusion about the relationship between the two cardinalities for an arbitrary infinite set. In this paper, we give a condition that makes Forster’s theorem, with ${\mathcal{P}}(A)$ replaced by $S(A)$ , provable without AC.

Information

Type
Research Article
Copyright
© 2016 Australian Mathematical Publishing Association Inc.