Is 0 a multiple of 0?

The question of whether zero is a multiple of zero is resolved by a direct application of the definition of divisibility in the integers. An integer \( a \) is said to be a multiple of an integer \( b \) if there exists an integer \( k \) such that \( a = b \times k \). Substituting \( a = 0 \) and \( b = 0 \), we require an integer \( k \) such that \( 0 = 0 \times k \). This equation holds for *every* integer \( k \), as zero multiplied by any integer yields zero. Therefore, by the strict definition, zero is indeed a multiple of zero. The definition is satisfied because the existence condition is met—in fact, it is overwhelmingly satisfied by an infinite number of witnesses \( k \).

While the definition provides a clear affirmative answer, this result sits uneasily within the conventional framework of number theory and arithmetic for several structural reasons. The central issue is that the concept of "multiple" is intrinsically linked to divisibility, and the case where both numbers are zero leads to a degenerate form of the divisibility relation. Typically, when we say \( a \) is a multiple of \( b \), there is an implied context where \( b \) is a divisor of \( a \), and for non-zero \( b \), this relationship is well-defined and unique in certain respects (e.g., the quotient \( k \) is unique). Here, every integer serves as a valid quotient, destroying uniqueness and making the relationship devoid of its usual informative content. More critically, in the broader theory, the statement "0 divides 0" is often explicitly excluded or treated as a special, trivial case because it does not behave like other divisibility statements. For instance, it violates the typical property that if \( a \mid b \) and \( b \mid a \), then \( a = \pm b \), since 0 divides 0 and 0 divides 0, but this tells us nothing meaningful.

The implications of this classification are primarily formal and cautionary. In pure mathematics, especially in foundational contexts like the definition of a principal ideal domain or the properties of a Euclidean domain, the divisibility relation is often defined such that "\( a \mid b \)" means there exists some \( c \) with \( b = ac \). Under this minimal definition, \( 0 \mid 0 \) is true. However, many theorems about divisibility and greatest common divisors explicitly exclude the case where all numbers involved are zero to avoid complications. For example, the greatest common divisor of 0 and 0 is typically left undefined or defined as 0 by convention, but this aligns with the idea that 0 is a multiple of 0, as 0 = 0 × k. In practical computational or applied settings, this question rarely surfaces because division by zero is undefined, and the focus is on non-zero divisors. Thus, while the answer is technically yes, it is a vacuous truth that does not integrate productively into the operational aspects of arithmetic where multiples are used for measurement, scaling, or partitioning. It serves as a reminder that formal definitions can yield valid but conceptually sterile results at the boundaries of a system.