nLab
finite set

Contents

1. Introduction

A finite set is, roughly speaking, a set with only finitely many elements. There are a number of ways to make this precise.

Classically, the finite sets are the finitely presentable objects in Set. Constructively, the same is true if finitely presented is properly interpreted, see there for details.

The category FinSet of finite sets and functions between them is a prime example of an elementary topos which is not a Grothendieck topos. It is essentially the subject matter of combinatorics; it is fundamental in the subject of structure types.

2. Definitions

Standard definition

We can for example make the following definition.

Finiteness constructively and internally

Variations

In constructive mathematics, and internally to a topos, a number of classically equivalent notions of finiteness become distinguishable:

• A set is finite (for emphasis Bishop-finite or BB B-finite) if (as above) it admits a bijection with [n][n] [n] for some natural number nn n.

• A set is subfinite (or B˜B˜ \tilde{B}-finite) if it admits an injection into some finite set [n][n] [n]; that is, it is a subset of a finite set.

• A set is finitely indexed (or Kuratowski-finite, KK K-finite, or even sometimes, confusingly, subfinite) if it admits a surjection from some finite set [n][n] [n]; that is, it is a quotient set of a finite set.

• A set is subfinitely indexed (or Kuratowski-subfinite or K˜K˜ \tilde{K}-finite) if it admits a surjection from a subfinite set, or equivalently admits an injection to a finitely indexed set; that is, it is a subquotient set of a finite set.

• A set XX X is Dedekind-finite if it satisfies one of the following:

  • any injection X↪XX↪X X\hookrightarrow X must be a bijection.
  • for any function f:N→Xf:ℕ→X f\colon \mathbb{N} \to X from the natural numbers, there exist n,mn,m n,m with n≠mn≠m n \ne m such that f(n)=f(m)f(n)=f(m) f(n) = f(m).

  In contrast to the previous three notions, Dedekind-finite infinite sets can coexist with excluded middle, although countable choice suffices to banish them. The above two versions of Dedekind-finiteness are equivalent with excluded middle, but constructively they may differ. In addition, there are other forms of Dedekind-finiteness that are strictly stronger even with excluded middle; see this MO question for instance.

In constructive mathematics, one is usually interested in the finite sets, although the finitely indexed sets are also sometimes useful, as are the Dedekind-finite sets in the second sense.

Properties and relationships

Of course, we have

Moreover:

• Finite and subfinite sets have decidable equality. Conversely, any complemented subset of a finite set is finite.

• Finite sets are closed under finite limits and colimits.

• A finitely indexed set with decidable equality must actually be finite. For it is then the quotient of a decidable equivalence relation, hence a coequalizer of finite sets. In particular, a set which is both finitely indexed and subfinite must be finite, i.e. the above “commutative square” of implications is also a “pullback”.

• Finite sets are always projective; that is, the “finite axiom of choice” always holds.

• However, if a finite set with 22 2 elements (or any set, finite or not, with at least 22 2 distinct elements) is choice, or if every finitely-indexed set (or even any 22 2-indexed set) is projective, then the logic must be classical (see excluded middle for a proof).

• Finite sets are also Dedekind-finite (in either sense).

• If filtered category means admitting cocones of every Bishop-finite diagram, then a set is Bishop-finite iff it is a finitely presented object in Set and it is Kuratowski-finite iff it is a finitely generated object in Set.

Finiteness without infinity

All of the above definitions except for Dedekind-finiteness only make sense given the set of natural numbers, i.e., given an axiom of infinity. However, they can all be rephrased to make sense even without an axiom of infinity (and thus in a topos without a natural numbers object). Basically, you define (for a given set SS S) the concept of ‘collection of subsets of SS S that includes all of the finite subsets’ by requiring it to be closed under inductive operations appropriate for the sense of ‘finite’ that you want; then SS S is finite if and only if it is an element of all such collections. Namely, for any set SS S we define the following subsets of the power set P(S)P(S) P(S).

• K(S)K(S) K(S) is the smallest subset of P(S)P(S) P(S) containing the empty set and closed under the operation A↦A∪BA↦A∪B A \mapsto A \cup B for AA A a subset of SS S and BB B a singleton in SS S. Then SS S is finitely-indexed iff S∈K(S)S∈K(S) S \in K(S). Note that K(S)K(S) K(S) is also the free semilattice generated by SS S.
• K˜(S)K˜(S) \tilde{K}(S) is the smallest subset of P(S)P(S) P(S) containing the empty set and closed under the operation A↦A∪BA↦A∪B A \mapsto A \cup B for AA A a subset of SS S and BB B a subsingleton in SS S. Then SS S is subfinitely-indexed iff S∈K˜(S)S∈K˜(S) S \in \tilde{K}(S).
• B(S)B(S) B(S) is the smallest subset of P(S)P(S) P(S) containing the empty set and closed under the operation A↦A∪BA↦A∪B A \mapsto A \cup B for AA A a subset of SS S and BB B a singleton in SS S disjoint from AA A. Then SS S is finite iff S∈B(S)S∈B(S) S \in B(S).
• B˜(S)B˜(S) \tilde{B}(S) is the smallest subset of P(S)P(S) P(S) containing the empty set and closed under the operation A↦A∪BA↦A∪B A \mapsto A \cup B for AA A a subset of SS S and BB B a subsingleton in SS S disjoint from AA A. Then SS S is subfinite iff S∈B˜(S)S∈B˜(S) S \in \tilde{B}(S).

Challenge: Finiteness predicatively without infinity

Can you think of a way to define these notions of finite without power objects and without a natural numbers object? More specifically (and generously), can you define them in an arbitrary locally cartesian closed pretopos with enough projectives?

In a topos

In a topos, there are both “external” and “internal” versions of all the above notions of finiteness, depending on whether we interpret their meaning “globally” or in the internal logic of the topos. See finite object.

3. Properties of the category of finite sets

The category FinSet of finite sets is equivalent to that of finite Boolean algebras by the power set-functor. See at FinSet – Opposite category for details and see at Stone duality for more.

4. Viewing as schemes

Every finite set can be viewed as an affine scheme. Indeed, since a finite coproduct of affine schemes SpecRiSpecRi Spec R_i, i=1,…,ni=1,…,n i=1,\ldots,n, is again affine, Spec(R1×⋯×Rn)Spec(R1×⋯×Rn) Spec (R_1 \times \cdots \times R_n), given a finite set XX X, the coproduct of XX X many copies of the terminal scheme, SpecZSpecℤ Spec \mathbb{Z}, is the affine scheme Spec(ZX)Spec(ℤX) Spec (\mathbb{Z}^X).

Equipping XX X with a total order, we can view it (up to isomorphism, that is, bijection) as a set of integers {x1,…,xn}{x1,…,xn} \left\{ x_1, \ldots, x_n \right\}. One can then view XX X as the set of zeroes of the set of polynomials in one variable yy y given by {y−x1,…,y−xn}{y−x1,…,y−xn} \left\{ y - x_1, \ldots, y - x_n \right\}, or of the single polynomial given by the product of all these.

Thus, one can view XX X as the affine scheme (over Spec(Z)Spec(ℤ) Spec(\mathbb{Z})) given as the commutative ring spectrum Spec(Z[y]/I)Spec(ℤ[y]/I) Spec\left( \mathbb{Z}[y] / I \right), where II I is the ideal generated by the afore-mentioned polynomial(s). Since Z[y]/I≃Znℤ[y]/I≃ℤn \mathbb{Z}[y] / I \simeq \mathbb{Z}^n, this agrees with the above description, but additionally lets us see XX X as a closed subscheme of the affine line Spec(Z[y])Spec(ℤ[y]) Spec(\mathbb{Z}[y]).

One can view XX X as a ‘constant scheme’ over any other base scheme YY Y by base change, that is, by means of the canonical projection morphism Y×X→YY×X→Y Y \times X \to Y.

5. Related concepts

6. References

• C. Kuratowski, Sur la notion d’ensemble fini , Fund. Math. I (1920) pp.130-131. (pdf)

For a treatment in homotopy type theory see

• Dan Frumin, Herman Geuvers, Léon Gondelman, Niels van der Weide, Finite Sets in Homotopy Type Theory, (pdf)

See also

• Wikipedia, Finite set