TheoremBase

Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets

Statement

Let N\mathbb{N} be the set of natural numbers with successor map SS as in that definition, and for p∈Np\in\mathbb{N} let [p][p] be the initial segment determined by pp. The notions has kk elements and finite are those of the indicated definitions.

Let AA and BB be finite sets, let XX be a nonempty finite set, and let n∈Nn\in\mathbb{N}.

Then the following hold.

1. (Cartesian products) Let P×QP\times Q denote the Cartesian product of sets PP and QQ, formed with the ordered pair. For every object aa the map sending b∈Bb\in B to (a,b)(a,b) is a bijection from BB onto {a}×B\{a\}\times B, and A×BA\times B is finite.

2. (Extending a tuple) Let YY be a set. There is exactly one map

q:Yn×Y→YS(n)q:Y^{n}\times Y\to Y^{S(n)}

such that for every t∈Ynt\in Y^{n} and every x∈Yx\in Y the tuple q((t,x))q\bigl((t,x)\bigr) has kkth component tkt_{k} for every k∈[n]k\in[n], and S(n)S(n)th component xx. This map qq is a bijection.

3. (Tuple sets) The set XnX^{n} of nn-tuples in XX is nonempty and finite.

4. (Permutation sets) The set SnS_{n} of permutations of [n][n] is nonempty and finite.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…