Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets
lemmaSet TheoryCombinatoricslem:finite-product-tuple-sets-2026aLet be the set of natural numbers with successor map as in that definition, and for let be the initial segment determined by . The notions has elements and finite are those of the indicated definitions.
Let and be finite sets, let be a nonempty finite set, and let .
Then the following hold.
1. (Cartesian products) Let denote the Cartesian product of sets and , formed with the ordered pair. For every object the map sending to is a bijection from onto , and is finite.
2. (Extending a tuple) Let be a set. There is exactly one map
such that for every and every the tuple has th component for every , and th component . This map is a bijection.
3. (Tuple sets) The set of -tuples in is nonempty and finite.
4. (Permutation sets) The set of permutations of is nonempty and finite.
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.