For the cardinality of integer-periodic function spaces, fix a positive period first. A periodic function with that period is completely and uniquely determined by its values at , so this class is in bijection with . The integers are a countable set, and repeated pairing shows that a finite Cartesian product of countable sets is countable. Taking the union over positive and using the countable union of countable sets proves that the integer-domain periodic functions form a countable set.
For the rational domain, even period one leaves infinitely many independent choices. Let for ; these are distinct members of . For every subset , define
The fractional part is unchanged by adding one, so is an integer-valued periodic function on . Distinct subsets give distinct functions because records whether . Thus the uncountable power set of injects into these functions. The rational-domain periodic functions form an uncountable set. The difference is that has only finitely many residue classes modulo a fixed integer period, whereas has infinitely many.