Nonmultiplicity

Nonmultiplicity is a term used to describe the absence of multiplicities in a given context, meaning that features do not occur with repeated or higher-order counts. It is not a standard technical term in most disciplines, and its precise meaning depends on the subject area and the properties being measured.

In mathematics, nonmultiplicity is often discussed in relation to roots, eigenvalues, or constituents that would otherwise appear with multiplicity greater than one. For polynomials, having nonmultiplicity typically means that all roots are simple (no repeated roots), which is equivalent to the polynomial being square-free (gcd with its derivative is one). In linear algebra, a matrix with distinct eigenvalues is said to be multiplicity-free; by contrast, nonmultiplicity would indicate that at least one eigenvalue has algebraic multiplicity greater than one. In representation theory, the standard notion is multiplicity-free for a representation whose irreducible components all occur with multiplicity one; discussing nonmultiplicity here usually means the module or representation is not multiplicity-free.

In other settings, nonmultiplicity can informally describe structures that avoid repeated features, such as avoiding repeated colors in a coloring problem or ensuring that a function has only simple critical points. Because nonmultiplicity is not a widely standardized term, precise usage is typically replaced by more specific phrases like simple roots, square-free polynomials, or multiplicity greater than one.

See also: simple root, square-free polynomial, multiplicity, multiplicity-free, eigenvalue multiplicity.