The theorem that every integer greater than one can be written as a product of prime numbers and that this factorization is unique up to the order of the factors (and up to multiplication by units ±1 in Z).

Principle

Primes act as multiplicative atoms in the integers; existence is proved by induction or Euclid-style arguments and uniqueness follows from the Euclidean algorithm or the property that primes divide products only if they divide one factor.

Demonstration

Example: 84 = 2^2 × 3 × 7 is a prime factorization of 84; no other multiset of primes (ignoring order) multiplies to 84. The uniqueness is used to show, for instance, that gcd and lcm factor through prime exponents.

Misapplication

Assuming the same uniqueness holds automatically in other rings without verifying unique factorization (e.g., some algebraic integer rings fail unique factorization), or neglecting units and associates when comparing factorizations.

Consequence

Underpins many arithmetic results: well-definedness of prime-power exponents, canonical definitions of multiplicative arithmetic functions, basic properties of gcd and lcm, and the structure of finite abelian groups via invariant factor decompositions.

Reversal

In rings lacking unique factorization the analogue fails: elements may have two distinct irreducible factorizations (up to units), so the arithmetic consequences depending on uniqueness are false or require modification.

Boundary

Specifically concerns the integers Z (or more generally unique factorization domains when suitably generalized); excludes 0 and ±1 from prime factorization and treats primes up to associates—order is irrelevant but unit multiples are considered equivalent.

Semantic Tension

Relates to the broader concept of unique factorization domains (UFDs): the theorem is the special integer case, while in algebraic number theory failure of unique factorization motivates ideal theory and class groups.

Synthesis

The Fundamental Theorem of Arithmetic states that primes are the basic multiplicative building blocks of integers and that every integer >1 has a unique decomposition into these atoms, providing a canonical multiplicative structure for classical number theory.