In set theory, an amorphous set is an infinite set which is not the disjoint union of two infinite subsets.^[1]

Amorphous sets cannot exist if the axiom of choice is assumed. Fraenkel constructed a permutation model of Zermelo–Fraenkel with Atoms in which the set of atoms is an amorphous set.^[2] After Cohen's initial work on forcing in 1963, proofs of the consistency of amorphous sets with Zermelo–Fraenkel were obtained.^[3]

Every amorphous set is Dedekind-finite, meaning that it has no bijection to a proper subset of itself. To see this, suppose that ${\displaystyle S}$ is a set that does have a bijection ${\displaystyle f}$ to a proper subset. For each natural number ${\displaystyle i\geq 0}$ define ${\displaystyle S_{i))$ to be the set of elements that belong to the image of the ${\displaystyle i}$-fold composition of f with itself but not to the image of the ${\displaystyle (i+1)}$-fold composition. Then each ${\displaystyle S_{i))$ is non-empty, so the union of the sets ${\displaystyle S_{i))$ with even indices would be an infinite set whose complement in ${\displaystyle S}$ is also infinite, showing that ${\displaystyle S}$ cannot be amorphous. However, the converse is not necessarily true: it is consistent for there to exist infinite Dedekind-finite sets that are not amorphous.^[4]

No amorphous set can be linearly ordered.^[5][6] Because the image of an amorphous set is itself either amorphous or finite, it follows that every function from an amorphous set to a linearly ordered set has only a finite image.

The cofinite filter on an amorphous set is an ultrafilter. This is because the complement of each infinite subset must not be infinite, so every subset is either finite or cofinite.

If ${\displaystyle \Pi }$ is a partition of an amorphous set into finite subsets, then there must be exactly one integer ${\displaystyle n(\Pi )}$ such that ${\displaystyle \Pi }$ has infinitely many subsets of size ${\displaystyle n}$; for, if every size was used finitely many times, or if more than one size was used infinitely many times, this information could be used to coarsen the partition and split ${\displaystyle \Pi }$ into two infinite subsets. If an amorphous set has the additional property that, for every partition ${\displaystyle \Pi }$, ${\displaystyle n(\Pi )=1}$, then it is called strictly amorphous or strongly amorphous, and if there is a finite upper bound on ${\displaystyle n(\Pi )}$ then the set is called bounded amorphous. It is consistent with ZF that amorphous sets exist and are all bounded, or that they exist and are all unbounded.^[1]

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo