The universal cardinal ordering of fixed points

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a corollary. Interestingly enough, it is important to point that this theorem needs no previous information about any other orbit; also the cardinal ordering is achieved automatically with no need to compare numerical values associated with every point of the orbit (as would be the case if kneading theory were used).