The statement that every integer greater than one can be expressed as a product of prime numbers and that this factorization is unique up to the order of the prime factors.

Principle

The integers greater than one form a free multiplicative structure generated by primes: primes serve as the irreducible building blocks and any composite integer decomposes into them in one essentially unique way.

Demonstration

Example: 84 = 2^2 × 3 × 7; no other list of primes (aside from ordering) multiplies to 84, illustrating uniqueness of factorization for this integer.

Misapplication

Assuming unique prime factorization holds in arbitrary rings or number systems; many rings (for example certain quadratic integer rings) fail uniqueness and admit distinct factorizations into irreducibles.

Consequence

Underpins divisibility theory: greatest common divisors, least common multiples, multiplicative arithmetic functions, and many algorithms in number theory rely on unique factorization in the integers.

Reversal

Reversal highlights domains where factorization is not unique: in such rings primes and irreducibles diverge and classical integer-style arithmetic properties break down, prompting alternative structural notions like ideal factorization.

Boundary

Applies to positive integers greater than one in the ring of ordinary integers Z; signs and units are accounted for by allowing an overall unit (±1). It does not apply verbatim to other rings without a unique factorization property.

Semantic Tension

Tension exists between the terms 'prime' and 'irreducible' when moving beyond Z: in Z they coincide, but in general integral domains irreducible elements need not be prime, creating conceptual divergence.

Synthesis

The Fundamental Theorem of Arithmetic asserts that primes uniquely generate the multiplicative structure of the positive integers: every integer >1 decomposes into primes in a single way up to order, a fact that grounds classical divisibility and number-theoretic methods.