unambiguity of factorial base representation
Theorem 1.
For all positive integers , it is the case that
Proof.
We first consider two degenerate cases. When or , the sum has no terms because the lower limitis bigger than the upper limit. By the convention thata sum with no terms equals zero, the equation reducesto or , which is correct.
Next, assume that . Note that
hence, we have a telescoping sum:
Adding 1, we conclude that
∎
Theorem 2.
If is the factoradic representation ofa positive integer , then
Proof.
By definition,
Since each term of the sum is nonnegative, the sum is positive,hence . Using the fact that to bound each term in the sum, we have
By theorem 1, the right-hand side equals , so we have, which is the same as saying.∎
Theorem 3.
If and aredistinct factoradic representations with and (i.e. not padded with leading zeros), then they denotedistinct integers.
Proof.
Let and let .
Suppose that and are distinct. Without loss of generality,we may assume that . Then, . By theorem 2,we have and . Because, we have .Because , we have . Hence, , so does not equal .
To complete the proof, we use the method of infinite descent. Assumethat factoradic representations are not unique. Then there must exista least integer such that has two distinct factoradicrepresentations and with and . By the conclusion
of theprevious paragraph, we must have . By theorem 2, we must have. Let be the chosen suchthat but and let be the chosen such that but . Then and would be distinct factoradic representations of whose leading digits are not zero but this wouldcontradict the assumption
that is the smallest number with thisproperty.∎