Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

1. n-tuples. N = {0, 1, 2, . . . , n, . . .}

Summary: 1. n-tuples.
We let
N = {0, 1, 2, . . . , n, . . .}
be the set of natural numbers and we let
= {n N : n > 0}.
For each n N we let
I(n) = {m N : m < n};
Note that I(n) has n members and that I(0) = .
If A and B are sets we say A is equipollent with B and write
if there are f : A B such that f-1
: B A. Note that the relation is reflexive,
symmetric and transitive. Whenever A is a set we let
|A| =
n if n N and A I(n),
A I(n) for no n N.
Suppose n N. An n-tuple is, by definition, a function whose domain is I(n).
Thus the only 0-tuple is the empty function which equals the empty set. Note that
if x is an n-tuple then |x| = n; we call |x| the length of x. We say x is tuple if x


Source: Allard, William K. - Department of Mathematics, Duke University


Collections: Mathematics