We define an extension of parity from the integers to the rational numbers. Three parity classes are found — even, odd and *none*. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure.

The natural numbers split nicely into two subsets, the odd and even numbers

As the sets get larger, the ratio of odd to even numbers tends to , so we can say informally that there are the same number of odd and even integers. Similar arguments apply to the integers , which split into two subsets

**Parity**

The distinction between odd and even numbers is called *parity*. The even/odd concept is defined only for the integers. Is there is a natural way to extend the concept of parity to larger sets of numbers.

What characteristics might one require of such an extension?

- The sum of two even numbers is even; the product is even.
- The sum of two odd numbers is even; the product is odd.
- The sum of an even and an odd number is odd; the product is even.
- An odd number plus is even; an even number plus is odd.

If the concept of parity is extended to larger sets of numbers, some of the properties indicated above may have to be sacrificed. For rational numbers, we might define a number to be even if the numerator is even and odd if is odd. But then , meaning that two odd rationals would add to yield another odd one.

**A three-way split**

There is a simple way of separating the rational numbers into three subsets:

The term ** none** is an initialism for

**.**

*neither odd nor even*These three sets are mutually disjoint and . It is immediately obvious that and , confirming that the definition of parity for the rationals is an extension of the usual meaning for the integers. We see that the even and odd rationals respect the four `rules of parity’ listed above.

The rational numbers are countable: they can be put into one-to-one correspondence with the natural numbers. We can list all rationals in in a sequence where, for each in turn, all (new) numbers with are listed in order. For we have

A **Mathematica** program was written to count the proportion of rationals in each parity class in the interval , with denominators less than or equal to , for a range of cut-off values . As increases, the ratios of numbers with parity even, odd and none all tend to the limit (see Figure). Colloquially, there are an equal number of rationals with parity even, odd and none.

**2-Adic valuation and the “degree of evenness”.**

*All multiples of 2 are even, but* *some are more even than others.*

The -adic valuation — or -adic order [Katok, 2007] — of an integer is the function

This is extended to the rational numbers :

It is easily proved that, for any rationals and ,

with equality holding if .

We shall be concerned exclusively with the case . We note that and . The “degree of evenness” of a number can be expressed in terms of the 2-adic valuation. For an integer , the 2-adic valuation is the largest natural number such that divides . It is normally written or . For even integers, ; for odd integers, . By convention, (since zero is divisible by every power of ).

If we write a rational number in the form with , then . Odd rationals have order and rationals with no parity have negative 2-adic order. In particular, half-integers have 2-adic order equal to .

The 2-adic order clearly identifies the parity classes of the rationals, and it provides a means of partitioning them into finer-grain parity classes. The resulting partition reveals a wealth of algebraic structure. For all , we define the set of all rational numbers with 2-adic valuation :

The union of all the -sets comprises the entire set of rationals

We illustrate the subsets in ihe Figure below. The vertical axis is the 2-adic valuation .

**Dyadic rational numbers**

A dyadic rational is a number that can be expressed as a fraction whose denominator is a power of two. The usual definition of the dyadic rational numbers [Bajnok, 2001, p. 122] is

Note that the integers are included in the set of dyadic rationals. A convenient alternative definition is

since all the numbers of the form are in . Moreover, the expression of each number in this form is unique.

By analogy with the definition of the -sets, we construct a countable infinity of subgroups of :

Particular cases of the -sets include

There is an infinite chain of subgroups starting with and extending through all the groups to the full group of dyadic rationals:

**Challenge:** Readers familiar with the theory of -adic numbers may wish to show that is the ring of rational-valued 2-adic integers, , and the dyadic rational numbers may be expressed as

This article is a condensation of part of a paper [Lynch & Mackey, 2022] recently posted on arXiv. In a following post, we will show that the three parity classes have equal natural density in the rationals.

**Sources**

[1] Conway, J. H., 2001: *On Numbers and Games*. CRC Press, 242 pp. ISBN: 978-1-5688-1127-7.

[2] Dummit, David S. and Foote, Richard M., 2004: *Abstract Algebra.* John Wiley & Sons, Inc., 932pp. ISBN: 978-0-4714-3334-7.

[3] Katok, Svetlana, 2007: * p-adic Analysis Compared with Real.* Student Math. Lib., Vol. 37. Amer. Math. Soc., ISBN: 978-0-8218-4220-1.

[4] Lynch, Peter & Michael Mackey, 2022: Parity and Partition of the Rational Numbers. arXiv .

* * *