The Infinite Factorization Glitch

At a glance

• Part 1: 30 =2 ⋅3 ⋅5. An eleven-factor label uses eight copies of 1, followed by 2,3,5. For any 𝑘 ≥3, insert 𝑘 −3 copies of 1, so there is no last valid label.
• Part 2: The integer units are exactly 1 and −1. For every positive prime 𝑝, the integers 𝑝 and −𝑝 are associates because −𝑝 =( −1)𝑝.
• Part 3: The factorizations 30 =2 ⋅3 ⋅5 and 30 =( −2)( −3) ⋅5 cannot be matched by order alone, but their corresponding factors are associates. The examples explain the theorem's qualifiers; they do not prove the theorem.

Key idea: a unit can change a factor without changing its essential kind

On page 1, multiplying by 1 makes a factor label longer without changing its value. In the integers there is a second unit, −1. Multiplying a factor by −1 changes its sign. Thus integer factorization cannot be literally unique as a list of signed factors.

The word associates records exactly this harmless change by a unit.

1. Stretch the factor label

The ordinary three-factor decomposition is

The numbers 2,3,5 pass the draft test: none is a product of two smaller positive whole numbers.

To obtain exactly eleven factors, use eight copies of 1:

There are 8 +3 =11 displayed factors, and their product is still 30.

For any whole number 𝑘 ≥3, insert exactly 𝑘 −3 copies of 1 before 2,3,5. The list then has

factors and product 30. Moreover, any valid label can be extended by inserting one additional copy of 1. Every proposed last label therefore has a valid successor, so Rook never reaches a last one.

2. Find the integer units and associates

Suppose integers 𝑢,𝑣 satisfy

Taking absolute values gives

The values |𝑢| and |𝑣| are nonnegative integers. The only way their product can equal 1 is

Hence 𝑢 is either 1 or −1. Conversely,

so both 1 and −1 are units. These are all the integer units.

Now let 𝑝 be any positive prime. Since −1 is a unit and

the definition of associates says that 𝑝 and −𝑝 are associates. Equivalently, 𝑝 =( −1)( −𝑝), so either sign differs from the other by multiplication by a unit.

3. Compare the two irreducible factorizations

The worksheet grants that all six signed factors below are irreducible. We have

and

Changing order alone cannot turn the first list into the second. A reordering moves factors but does not change 2 into −2 or 3 into −3.

Associates give the correct comparison:

Thus 2 matches the associate −2, 3 matches the associate −3, and 5 matches itself. The two extra unit multipliers also cancel in the total product because

This is why the uniqueness statement must allow both reordering and replacement by associates.

Proof boundary and the exact theorem

The worksheet states the integer version precisely:

> Every nonzero integer that is not a unit is a finite product of irreducible integers. If two such products have the same value, then they have the same number of factors and, after reordering, corresponding factors are associates.

In symbols, if

and every displayed factor is irreducible, then 𝑟 =𝑚, and the 𝑠-factors can be reordered so that 𝑞𝑗 and 𝑠𝑗 are associates for every index 𝑗.

The examples explain why the qualifiers belong:

• nonzero excludes the absorbing behavior of 0;
• not a unit separates 1 and −1 from the objects being factored;
• irreducible factors are the pieces at which further nonunit splitting stops;
• up to order allows commuting factors; and
• up to associates allows the unavoidable sign changes caused by −1.

But examples are not a proof of a universal theorem. Parts 1–3 have not proved:

• existence: that every nonzero nonunit integer has an irreducible factorization; or
• uniqueness: that every pair of irreducible factorizations of an arbitrary integer can always be matched as the theorem claims.

Those require arguments that work for every nonzero nonunit integer, not only for 30.

Check

The page-1 glitch and page-2 repair are compatible. Copies of 1 are excluded from irreducible factorizations because 1 is a unit. Sign changes remain possible because −1 is also a unit, and associates record those changes without pretending the signed factors are literally equal.

Teaching note

The positive-prime language on page 1 is deliberately temporary. Once the worksheet moves to all integers, irreducible is the structural factor word and associate is the relation that absorbs sign choices. The item motivates the standard theorem statement but intentionally does not ask learners to prove it.