How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 16 results · all verified · 9 also independently AI-judged

Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic

1 · Prerequisites

2 · Summary

Divisibility in $Z$ , Bézout’s identity, the gcd characterisation, and the coprime-divides-product lemma provide the arithmetic background. In particular, If $\gcd (a, b) = 1$ and $a ∣ b c$ then $a ∣ c$ ; and if $a ∣ c$ , $b ∣ c$ and $\gcd (a, b) = 1$ then $a b ∣ c$ converts coprimality into divisibility of a factor without assuming primality, while The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity supplies the finite-product convention used throughout. Integer order, absolute value, and the natural-number embedding control positivity, signs, induction, and the empty product.

Prime integers and $p$ -adic valuations are defined. Euclid’s lemma and its finite-product form lead to existence and uniqueness of prime factorisation and to infinitude of the primes. Canonical factorisation then expresses divisibility, gcd, and lcm through valuations. Finally $v_{p}$ extends from nonzero integers to nonzero rationals, and the valuation formulas show that a rational $k$ th root of an integer is itself an integer.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$

Definition

Let $p \in Z$ (The integers as equivalence classes of pairs of naturals), ordered as in Order on the integers, with divisibility as in Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ . Then $p$ is prime when

$p > 1 and d ∣ p with d > 0 force d = 1 or d = p .$

In words: $p$ exceeds $1$ , and its only positive divisors are $1$ and $p$ . An integer $n$ with $n > 1$ that is not prime is composite; unfolding the definition, $n$ is composite exactly when $n > 1$ and $n$ has a positive divisor $d$ with $d \neq 1$ and $d \neq n$ .

Numerals. For $k \in N$ the symbol $k$ inside $Z$ means $ι (k)$ , the embedding of The naturals embed in the integers; in particular $0$ and $1$ are the ring constants of Arithmetic on the integers.

Boundary values, stated rather than assumed. $N$ contains $0$ (The natural numbers $N$ (von Neumann)) and $Z$ contains $0$ , $1$ and the negatives, so the small cases are recorded explicitly. The clause $p > 1$ decides all of them at once:

$1$ is not prime, since $1 > 1$ is false, and not composite either, since composite also requires $n > 1$ .
$0$ is not prime, since $0 > 1$ is false. This is decided by the size clause alone and not by counting divisors: every integer divides $0$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ), so the divisor condition is not what rules $0$ out.
Every negative integer is neither prime nor composite, again because $p > 1$ fails. So a prime is in particular positive, and $- 2$ , $- 3$ , $- 5$ are not primes in this library, though each is $- 1$ times one.

Thus "prime" and "composite" between them classify exactly the integers greater than $1$ , and nothing else.

The same condition read over all divisors. For $p > 1$ the following are equivalent:

the only positive divisors of $p$ are $1$ and $p$ ;
the only divisors of $p$ are $1$ , $- 1$ , $p$ and $- p$ .

That 2 implies 1 is immediate, since of those four only $1$ and $p$ are positive ( $p > 1 > 0$ , so $- 1 < 0$ and $- p < 0$ ). For the converse let $d ∣ p$ . Since $p > 1$ we have $p \neq 0$ , so $d \neq 0$ by If $d ∣ a$ and $a \neq 0$ then $d \neq 0$ and $∣ d ∣ \leq ∣ a ∣$ ; hence the set of divisors of a nonzero integer is bounded above by $∣ a ∣$ ; and $∣ d ∣ ∣ p$ , because $∣ d ∣$ is $d$ or $- d$ (The absolute value $∣ a ∣$ of an integer) and those two divide $p$ together (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ). Also $∣ d ∣ \geq 0$ and $∣ d ∣ \neq 0$ (Absolute value in $Z$ : $∣ a ∣ \geq 0$ ; $∣ a ∣ = 0$ exactly when $a = 0$ ; $∣ - a ∣ = ∣ a ∣$ ; $∣ a b ∣ = ∣ a ∣ ∣ b ∣$ ; $- ∣ a ∣ \leq a \leq ∣ a ∣$ ; and $∣ a ∣ \leq c$ exactly when $- c \leq a \leq c$ ), so $∣ d ∣ > 0$ and clause 1 gives $∣ d ∣ = 1$ or $∣ d ∣ = p$ . If $∣ d ∣ = 1$ then $d = 1$ or $d = - 1$ , by the case split defining $∣ d ∣$ ; and if $∣ d ∣ = p = ∣ p ∣$ then $d = u p$ for a unit $u \in {1, - 1}$ (For integers $a$ and $b$ the following are equivalent: $a ∣ b$ and $b ∣ a$ ; $b = u a$ for a unit $u$ ; $∣ a ∣ = ∣ b ∣$ . Being associates is an equivalence relation whose class of $a$ is ${a, - a}$ , $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ), that is $d = p$ or $d = - p$ . Both readings are used below without further comment.

Why $1$ is excluded, and it is not a matter of taste. The exclusion is forced by the uniqueness half of The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ , proved on this page: if $1$ counted as a prime, a factorisation could be padded with any number of factors $1$ , so lists of different lengths would represent the same integer and no permutation could match them. Existence of a factorisation would survive the change; it is uniqueness alone that fixes the convention, and the explicit witness is recorded on the companion page.

Remarks

The witness for the exclusion of $1$ . The companion page carries it explicitly: If $1$ were admitted as a prime, uniqueness would fail: $6 = 2 \cdot 3 = 1 \cdot 2 \cdot 3 = 1 \cdot 1 \cdot 2 \cdot 3$ , lists of different lengths that no permutation matches ↗ displays $6 = 2 \cdot 3 = 1 \cdot 2 \cdot 3 = 1 \cdot 1 \cdot 2 \cdot 3$ , three lists of lengths $2$ , $3$ and $4$ that no permutation can match.
No ring vocabulary is used here, deliberately. In a general commutative ring one distinguishes a prime element from an irreducible element, and in $Z$ the two notions coincide; that dictionary needs the definition of a ring, which this library develops far above this page, so it is not stated here and nothing below depends on it. What is proved here is the arithmetic content of the coincidence: For an integer $p > 1$ : $p$ is prime if and only if, for all integers $a$ and $b$ , $p ∣ a b$ implies $p ∣ a$ or $p ∣ b$ shows that for $p > 1$ the definition above is equivalent to the property that $p ∣ a b$ forces $p ∣ a$ or $p ∣ b$ .
Primality is about $p$ ; coprimality is about a pair. Coprime integers: $\gcd (a, b) = 1$ is the condition $\gcd (a, b) = 1$ on two integers and needs no primality at all — $4$ and $9$ are coprime and neither is prime. The bridge in the other direction is For a prime $p$ and any integer $a$ , $\gcd (p, a)$ is $p$ when $p ∣ a$ and $1$ otherwise; so $p ∤ a$ makes $p$ and $a$ coprime, the next item, and it is the only place on this page where primality is converted into coprimality.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

For a prime $p$ and any integer $a$ , $\gcd (p, a)$ is $p$ when $p ∣ a$ and $1$ otherwise; so $p ∤ a$ makes $p$ and $a$ coprime

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) and let $a \in Z$ . Then

$\gcd (p, a) = {\begin{cases} p & if p ∣ a, \\ 1 & if p ∤ a, \end{cases}$

with $\gcd$ as in Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ and divisibility as in Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ . In particular, if $p ∤ a$ then $p$ and $a$ are coprime (Coprime integers: $\gcd (a, b) = 1$ ).

Facts & Assumptions

Given: A prime $p$ , an integer $a$ , and $g : = \gcd (p, a)$ (Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ).

[L1]

$p > 1$ , and every positive divisor $d$ of $p$ satisfies $d = 1$ or $d = p$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L2]

$g \geq 0$ , $g ∣ p$ , $g ∣ a$ , and every common divisor of $p$ and $a$ divides $g$ (Every common divisor of $a$ and $b$ divides $\gcd (a, b)$ ; consequently $d = \gcd (a, b)$ exactly when $d \geq 0$ , $d ∣ a$ , $d ∣ b$ , and every common divisor of $a$ and $b$ divides $d$ — a characterisation that holds at $(a, b) = (0, 0)$ as well, Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ).

[L3]

$\gcd (u, v) \geq 1$ unless $u = v = 0$ , in which case $\gcd (u, v) = 0$ ( $\gcd$ is symmetric and unchanged by signs: $\gcd (a, b) = \gcd (b, a) = \gcd (∣ a ∣, ∣ b ∣)$ ; moreover $\gcd (a, 0) = ∣ a ∣$ , $\gcd (a, 1) = 1$ , $\gcd (a, a) = ∣ a ∣$ , and $\gcd (a, b) \geq 1$ unless $a = b = 0$ ).

[L4]

Divisibility is reflexive and transitive: $u ∣ u$ for every $u$ , and $d ∣ u$ with $u ∣ v$ gives $d ∣ v$ (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ , Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L5]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L6]

$u$ and $v$ are coprime exactly when $\gcd (u, v) = 1$ (Coprime integers: $\gcd (a, b) = 1$ ).

[L7]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition; $x < y$ means $x \leq y$ together with $x \neq y$ (The integers form a totally ordered ring, Order on the integers).

[L8]

The embedding $ι : N \to Z$ is injective, preserves the order, and has as image exactly the nonnegative integers, with $ι (0) = 0$ and $ι (1) = 1$ ; and $0 \neq 1$ in $N$ (The naturals embed in the integers, The natural numbers $N$ (von Neumann), The integers as equivalence classes of pairs of naturals).

[L9]

$Z$ is a commutative ring: addition is associative and commutative, $x + 0 = x$ , and every $x$ has an additive inverse $- x$ , with $- (- x) = x$ ; we write $u - v$ for $u + (- v)$ (The integers form a commutative ring, Arithmetic on the integers).

Proof

technique · cases

1.1

$0 < 1$ in $Z$ : $1 = ι (1)$ lies in the image of $ι$ , hence $1 \geq 0$ , and $1 \neq 0$ because $ι$ is injective and $0 \neq 1$ in $N$ .

1.2

Suppose $p ∣ a$ . Then $p$ is a common divisor of $p$ and $a$ , since $p ∣ p$ , so $p ∣ g$ .

assume-case divL2L4

2.1

$- 1 < 0$ : adding $- 1$ to both sides of $0 < 1$ preserves the order, giving $- 1 < 0$ .

step 1.1L7L9

2.2

$p > 0$ and $p \neq 0$ , so $(p, a) \neq (0, 0)$ ; consequently $g \geq 1$ , and in particular $g > 0$ .

step 1.1L1L3L7

3.1

$p \neq 1$ and $p \neq - 1$ : the first because $p > 1$ , the second because $- 1 < 0 < 1 < p$ and the order is transitive.

step 1.1step 2.1L1L7

3.2

$g$ is a positive divisor of $p$ , so $g = 1$ or $g = p$ .

step 2.2L1L2

4.1

In that case $g \neq 1$ : otherwise $p ∣ 1$ , forcing $p = 1$ or $p = - 1$ and contradicting step 3.1. So $g = p$ by step 3.2.

assume-case divstep 3.1step 3.2L5

4.2

Suppose instead $p ∤ a$ . Then $g \neq p$ , since $g ∣ a$ and $g = p$ would give $p ∣ a$ . So $g = 1$ by step 3.2, that is, $p$ and $a$ are coprime.

assume-case nodivstep 3.2L2L6

5.1

Either $p ∣ a$ or $p ∤ a$ , and no third possibility exists, so the two cases above are exhaustive and give the stated value of $g$ in each.

step 4.1step 4.2cases-exhaustive∎

Remarks

This is the only place on this page where primality becomes coprimality. Every later appeal to Bézout's identity — Euclid's lemma (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ) first among them — runs through this lemma rather than through the definition of a prime, because the published If $\gcd (a, b) = 1$ and $a ∣ b c$ then $a ∣ c$ ; and if $a ∣ c$ , $b ∣ c$ and $\gcd (a, b) = 1$ then $a b ∣ c$ is stated for coprime integers and uses no primality at all.
The hypothesis that $p$ is prime is used twice, and both uses are essential: once for $p > 1$ , which puts $(p, a)$ outside the pair $(0, 0)$ where the $\gcd$ convention lives and excludes $p$ from being a unit, and once for the divisor condition, which is what leaves only the two candidate values $1$ and $p$ . For a composite $p$ the conclusion fails: $\gcd (4, 6) = 2$ , which is neither $4$ nor $1$ , while $4 ∤ 6$ .

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) and let $a, b \in Z$ . If $p ∣ a b$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ) then

$p ∣ a or p ∣ b .$

Facts & Assumptions

Given: A prime $p$ and integers $a, b$ with $p ∣ a b$ .

[L1]

For a prime $p$ and any integer $u$ : if $p ∤ u$ then $\gcd (p, u) = 1$ (For a prime $p$ and any integer $a$ , $\gcd (p, a)$ is $p$ when $p ∣ a$ and $1$ otherwise; so $p ∤ a$ makes $p$ and $a$ coprime, Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ).

[L2]

If $\gcd (u, v) = 1$ and $u ∣ v w$ then $u ∣ w$ , for all integers $u, v, w$ (If $\gcd (a, b) = 1$ and $a ∣ b c$ then $a ∣ c$ ; and if $a ∣ c$ , $b ∣ c$ and $\gcd (a, b) = 1$ then $a b ∣ c$ ).

[L3]

$u$ and $v$ are coprime exactly when $\gcd (u, v) = 1$ (Coprime integers: $\gcd (a, b) = 1$ ).

[L4]

$d ∣ u$ means $u = d q$ for some $q \in Z$ ; divisibility is reflexive and transitive (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L5]

$Z$ is a commutative ring; in particular multiplication is commutative and associative (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L6]

$p > 1$ , and every positive divisor of $p$ is $1$ or $p$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

Proof

technique · cases

1.1

Suppose $p ∣ a$ . Then the disjunction $p ∣ a$ or $p ∣ b$ holds on its first alternative, and there is nothing further to prove.

assume-case div

1.2

Suppose instead $p ∤ a$ . Then $\gcd (p, a) = 1$ , so $p$ and $a$ are coprime.

assume-case nodivL1L3L6

2.1

Apply [L2] with $u : = p$ , $v : = a$ and $w : = b$ . Its two hypotheses are exactly $\gcd (p, a) = 1$ , which is step 1.2, and $p ∣ a b$ , which is given; its conclusion is $p ∣ b$ .

assume-case nodivstep 1.2L2L4L5

3.1

Either $p ∣ a$ or $p ∤ a$ , so the two cases are exhaustive; in the first $p ∣ a$ and in the second $p ∣ b$ , which is the assertion.

step 1.1step 2.1cases-exhaustive∎

Remarks

This is a two-line consequence, and that is the point. The work was done one page earlier: If $\gcd (a, b) = 1$ and $a ∣ b c$ then $a ∣ c$ ; and if $a ∣ c$ , $b ∣ c$ and $\gcd (a, b) = 1$ then $a b ∣ c$ proves that $\gcd (u, v) = 1$ together with $u ∣ v w$ forces $u ∣ w$ , and its own Remarks record that "no primality is used" in it — the proof is pure Bézout. The summary of the page carrying it says in as many words that "primes, Euclid's lemma and unique factorisation are not proved here; they belong to a later page". This is that page, and the only new ingredient is For a prime $p$ and any integer $a$ , $\gcd (p, a)$ is $p$ when $p ∣ a$ and $1$ otherwise; so $p ∤ a$ makes $p$ and $a$ coprime, which converts primality into the coprimality that lemma actually consumes.
The hypothesis cannot be weakened to $p > 1$ . For a composite modulus the conclusion fails, and the published witness is $6 ∣ 4 \cdot 9$ while $6 ∤ 4$ and $6 ∤ 9$ : dividing a product does not force dividing a factor, and the coprimality hypothesis is what fails: $6 ∣ 4 \cdot 9$ while $6 ∤ 4$ and $6 ∤ 9$ . Its Remarks identify the failure as exactly the failure of coprimality, which is what primality supplies here.
The converse holds too. For $p > 1$ the property proved here characterises primality; that is For an integer $p > 1$ : $p$ is prime if and only if, for all integers $a$ and $b$ , $p ∣ a b$ implies $p ∣ a$ or $p ∣ b$ , next on this page.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

For an integer $p > 1$ : $p$ is prime if and only if, for all integers $a$ and $b$ , $p ∣ a b$ implies $p ∣ a$ or $p ∣ b$

Statement

Let $p \in Z$ with $p > 1$ . The following are equivalent:

$p$ is prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ );
for all $a, b \in Z$ , $p ∣ a b$ implies $p ∣ a$ or $p ∣ b$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

Facts & Assumptions

Given: An integer $p$ with $p > 1$ .

[L1]

$p$ is prime exactly when $p > 1$ and every positive divisor $d$ of $p$ satisfies $d = 1$ or $d = p$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L2]

If $q$ is prime and $q ∣ u v$ then $q ∣ u$ or $q ∣ v$ (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L3]

$u ∣ v$ and $v ∣ u$ together hold exactly when $∣ u ∣ = ∣ v ∣$ , and exactly when $v = w u$ for a unit $w \in {1, - 1}$ (For integers $a$ and $b$ the following are equivalent: $a ∣ b$ and $b ∣ a$ ; $b = u a$ for a unit $u$ ; $∣ a ∣ = ∣ b ∣$ . Being associates is an equivalence relation whose class of $a$ is ${a, - a}$ , $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L4]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L5]

If $x z = y z$ and $z \neq 0$ then $x = y$ (The integers have no zero divisors; multiplicative cancellation).

[L6]

$d ∣ u$ means $u = d q$ for some $q \in Z$ ; divisibility is reflexive (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L7]

$Z$ is a commutative ring: multiplication is associative and commutative, $x \cdot 1 = x$ , and every $x$ has an additive inverse $- x$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L8]

[L9]

[L10]

$∣ x ∣ = x$ when $x \geq 0$ and $∣ x ∣ = - x$ when $x < 0$ ; $∣ x ∣ \geq 0$ (The absolute value $∣ a ∣$ of an integer, Absolute value in $Z$ : $∣ a ∣ \geq 0$ ; $∣ a ∣ = 0$ exactly when $a = 0$ ; $∣ - a ∣ = ∣ a ∣$ ; $∣ a b ∣ = ∣ a ∣ ∣ b ∣$ ; $- ∣ a ∣ \leq a \leq ∣ a ∣$ ; and $∣ a ∣ \leq c$ exactly when $- c \leq a \leq c$ ).

Proof

technique · direct

1.1

$0 < 1$ : $1 = ι (1)$ lies in the image of $ι$ , so $1 \geq 0$ , and $1 \neq 0$ because $ι$ is injective and $0 \neq 1$ in $N$ . Adding $- 1$ throughout gives $- 1 < 0$ .

L7L8L9

1.2

Claim 1 implies claim 2: if $p$ is prime this is exactly [L2].

1.3

Assume claim 2, and let $d$ be a positive divisor of $p$ ; fix $c \in Z$ with $p = d c$ .

L6choose

2.1

$p > 1 > 0$ , so $p > 0$ and $p \neq 0$ .

step 1.1L8

2.2

Then $p ∣ d c$ , since $p ∣ p$ and $p = d c$ ; so claim 2 applied with $a : = d$ and $b : = c$ gives $p ∣ d$ or $p ∣ c$ .

step 1.3L6

3.1

Suppose $p ∣ d$ . Since also $d ∣ p$ , [L3] gives $∣ d ∣ = ∣ p ∣$ , hence $d = w p$ for a unit $w \in {1, - 1}$ . If $w = - 1$ then $d = - p < 0$ , contradicting $d > 0$ ; so $w = 1$ and $d = p$ .

step 2.1step 1.3step 2.2L3L7L8L10

3.2

Suppose instead $p ∣ c$ , and fix $e$ with $c = p e$ . Then $1 \cdot p = p = d c = d (p e) = (d e) \cdot p$ , and $p \neq 0$ , so cancellation gives $d e = 1$ . Hence $d ∣ 1$ , so $d = 1$ or $d = - 1$ , and $d > 0 > - 1$ leaves $d = 1$ .

step 1.1step 2.1step 1.3step 2.2L4L5L6L7L8

4.1

By step 2.2 one of the two cases occurs, so every positive divisor $d$ of $p$ satisfies $d = 1$ or $d = p$ ; together with the standing hypothesis $p > 1$ this says $p$ is prime, so claim 2 implies claim 1.

step 2.2step 3.1step 3.2L1

5.1

The two implications of steps 1.2 and 4.1 give the equivalence.

step 1.2step 4.1∎

Remarks

Both directions need $p > 1$ , and it is a standing hypothesis rather than part of either claim. Claim 2 alone does not force primality: $p = 1$ satisfies it vacuously, since $1 ∣ a$ for every $a$ , and so does $p = 0$ , because $0 ∣ a b$ forces $a b = 0$ and hence $a = 0$ or $b = 0$ (The integers have no zero divisors; multiplicative cancellation). Neither is prime, and the clause $p > 1$ of Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ is what excludes them.
The two halves of the equivalence are the two notions a general theory keeps apart. Claim 1 says $p$ cannot be split into smaller positive factors; claim 2 says $p$ , when it divides a product, already divides a factor. In $Z$ they coincide, and that coincidence is what makes unique factorisation work; the counterexample In the multiplicative monoid $H = {1, 4, 7, 10, \dots}$ of positive integers one more than a multiple of $3$ , the element $100$ has two genuinely different factorisations into irreducibles, $4 \cdot 25$ and $10 \cdot 10$ ↗ on the companion page shows what fails in a setting where the analogue of claim 1 holds and the analogue of claim 2 does not.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

If a prime $p$ divides a finite product $\prod_{i < n} a_{i}$ of integers then $p ∣ a_{i}$ for some $i < n$ ; at $n = 0$ the product is $1$ and the hypothesis cannot hold

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ), let $n \in N$ , and let $a : N \to Z$ , with the finite product $\prod_{i < n} a_{i}$ taken in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ as in The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity. If

$p ∣ \prod_{i < n} a_{i},$

then $p ∣ a_{i}$ for some $i < n$ .

At $n = 0$ the product is the empty product $1$ , and $p ∣ 1$ is impossible for a prime, so the hypothesis is never satisfied there and the assertion is true rather than excluded. Since $\prod_{i < n} a_{i}$ depends only on $a_{0}, \dots, a_{n - 1}$ (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity), the statement applies verbatim to a finite list $a : n \to Z$ .

Facts & Assumptions

Given: A prime $p$ ; the property $P (n)$ : "for every family $a : N \to Z$ , if $p ∣ \prod_{i < n} a_{i}$ then $p ∣ a_{i}$ for some $i < n$ ".

[L1]

$(Z, \cdot, 1)$ is a commutative monoid, and $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid).

[L2]

In a monoid, $\prod_{i < 0} g_{i} = e$ and $\prod_{i < σ (n)} g_{i} = (\prod_{i < n} g_{i}) \cdot g_{n}$ ; the value depends only on $g_{0}, \dots, g_{n - 1}$ (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

[L3]

If $q$ is prime and $q ∣ u v$ then $q ∣ u$ or $q ∣ v$ (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L4]

$p > 1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L5]

Induction: a property holding at $0$ and inherited by successors holds at every natural number (The principle of mathematical induction).

[L6]

On $N$ : $n < σ (n)$ , and $m < σ (n)$ exactly when $m \leq n$ (On $N$ the order is membership: $m < n ⟺ m \in n$ , The natural numbers $N$ (von Neumann)).

[L7]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition (The integers form a totally ordered ring, Order on the integers); $Z$ is a commutative ring (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L8]

[L9]

$d ∣ u$ means $u = d q$ for some $q \in Z$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

Proof

technique · induction

1.1

$0 < 1$ , since $1 = ι (1)$ is nonnegative and $1 \neq 0$ by injectivity of $ι$ ; adding $- 1$ gives $- 1 < 0$ . Hence $- 1 < 0 < 1 < p$ , so $p \neq 1$ and $p \neq - 1$ .

L4L7L8

1.2

Let $n \in N$ and assume $P (n)$ .

1.3

Let $a : N \to Z$ and suppose $p ∣ \prod_{i < σ (n)} a_{i}$ . By the recursion clause this product equals $(\prod_{i < n} a_{i}) \cdot a_{n}$ , so [L3] gives $p ∣ \prod_{i < n} a_{i}$ or $p ∣ a_{n}$ .

L1L2L3L9

2.1

$P (0)$ holds: $\prod_{i < 0} a_{i} = 1$ for every family $a$ , and $p ∣ 1$ would force $p = 1$ or $p = - 1$ , which step 1.1 excludes. So the hypothesis of $P (0)$ is never satisfied and $P (0)$ is true vacuously.

basestep 1.1L1L2

2.2

In the first case step 1.2 supplies $i < n$ with $p ∣ a_{i}$ , and $i < n < σ (n)$ gives $i < σ (n)$ ; in the second case $i : = n$ works, since $n < σ (n)$ . Either way some $i < σ (n)$ has $p ∣ a_{i}$ , so $P (σ (n))$ holds.

step 1.2step 1.3L6

3.1

$P (0)$ holds and $P (n)$ implies $P (σ (n))$ for every $n$ , so $P (n)$ holds for every $n \in N$ .

step 2.1step 2.2L5discharge-induction∎

Remarks

The case $n = 0$ is real and is not an exception. The empty product is $1$ by The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, and a prime never divides $1$ , so the implication holds with a false hypothesis. Stating the corollary from $n = 1$ upwards would be a weaker theorem for no gain, and would have to be repaired at every use.
No commutativity is used. The proof consumes only the recursion clause $\prod_{i < σ (n)} a_{i} = (\prod_{i < n} a_{i}) a_{n}$ and Euclid's lemma; the monoid is named commutative only because $(Z, \cdot, 1)$ is, and because later items on this page do use commutativity.
A prime dividing a product of primes equals one of them. If every $a_{i}$ is prime and $p ∣ \prod_{i < n} a_{i}$ , then $p ∣ a_{k}$ for some $k$ , and then $p$ is a positive divisor of the prime $a_{k}$ other than $1$ , so $p = a_{k}$ by Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ . That one-line consequence is the engine of the uniqueness half of The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ .

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime

Statement

Let $n \in Z$ with $n > 1$ , and put

$S : = {d \in Z : d ∣ n and d > 1}$

(Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ). Then $S$ is nonempty and has a least element $q$ , and $q$ is prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ). In particular every integer greater than $1$ has a prime divisor.

Facts & Assumptions

Given: An integer $n$ with $n > 1$ , and the set $S$ above.

[L2]

Divisibility is reflexive and transitive (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L3]

A nonempty set of integers with a lower bound has a unique least element (A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element).

[L4]

If $d ∣ u$ and $u \neq 0$ then $d \neq 0$ and $∣ d ∣ \leq ∣ u ∣$ (If $d ∣ a$ and $a \neq 0$ then $d \neq 0$ and $∣ d ∣ \leq ∣ a ∣$ ; hence the set of divisors of a nonzero integer is bounded above by $∣ a ∣$ ).

[L5]

$p$ is prime exactly when $p > 1$ and every positive divisor of $p$ is $1$ or $p$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L6]

[L8]

The embedding $ι : N \to Z$ is injective, preserves addition and order, and has as image exactly the nonnegative integers, with $ι (0) = 0$ and $ι (1) = 1$ (The naturals embed in the integers).

[L9]

On $N$ : $0 \leq k$ for every $k$ , since $0 + k = k$ (Order on the natural numbers); $m < k$ exactly when $σ (m) \leq k$ (Discreteness: $σ (n)$ is the immediate successor); and $1 = σ (0)$ (The natural numbers $N$ (von Neumann)).

[L10]

Proof

technique · direct

1.1

$0 < 1$ in $Z$ : $1 = ι (1)$ lies in the image of $ι$ , so $1 \geq 0$ , and $1 \neq 0$ because $ι$ is injective and $ι (0) = 0$ .

1.2

Discreteness: if $x \in Z$ and $0 < x$ then $1 \leq x$ . Indeed $x \geq 0$ , so $x = ι (k)$ for some $k \in N$ ; $k \neq 0$ since $ι (0) = 0 \neq x$ ; hence $0 < k$ in $N$ , so $1 = σ (0) \leq k$ , and applying the order-preserving $ι$ gives $1 = ι (1) \leq ι (k) = x$ .

L8L9

1.3

$n \in S$ , since $n ∣ n$ and $n > 1$ ; so $S$ is nonempty.

1.4

$1$ is a lower bound for $S$ : every $d \in S$ satisfies $d > 1$ , hence $1 \leq d$ .

2.1

By [L3] the set $S$ has a unique least element $q$ : that is, $q ∣ n$ , $q > 1$ , and $q \leq d$ for every $d \in S$ .

step 1.3step 1.4L3

3.1

$n > 1 > 0$ and $q > 1 > 0$ , so $n \neq 0$ and $q \neq 0$ , and $∣ q ∣ = q$ .

step 1.1step 2.1L6L10

3.2

Let $e$ be a positive divisor of $q$ with $e \neq 1$ . Then $1 \leq e$ by step 1.2, and $e \neq 1$ , so $e > 1$ .

step 1.2step 2.1L6

4.1

Also $e ∣ q$ and $q ∣ n$ , so $e ∣ n$ by transitivity; with $e > 1$ this gives $e \in S$ , hence $q \leq e$ .

step 2.1step 3.2L2

5.1

On the other hand $e ∣ q$ with $q \neq 0$ gives $∣ e ∣ \leq ∣ q ∣ = q$ , and $∣ e ∣ = e$ because $e > 0$ ; so $e \leq q$ . With step 4.1 and antisymmetry, $e = q$ .

step 3.1step 3.2step 4.1L4L6L10

6.1

So every positive divisor of $q$ is $1$ or $q$ , and $q > 1$ : $q$ is prime. Since $q ∣ n$ , the integer $n$ has a prime divisor.

step 2.1step 3.2step 5.1L5∎

Remarks

Well-ordering is used through the integer bridge, not directly. The well-ordering principle gives a least element of a nonempty subset of $N$ , whereas $S$ is a set of integers. A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element is the published lemma that crosses that gap, and its Statement covers the lower-bound case explicitly, so it is what this proof cites.
The bound $q$ is genuinely the least divisor above $1$ , not merely some prime divisor. That is what makes the argument work: minimality is the only reason $q$ has no proper divisor above $1$ , since any such divisor would divide $n$ as well and be smaller.
The hypothesis $n > 1$ cannot be dropped. At $n = 1$ the set $S$ is empty, since $d ∣ 1$ forces $d = 1$ or $d = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ) and neither exceeds $1$ ; so $1$ has no prime divisor, which is exactly why the empty product is the right factorisation of $1$ in Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product. At $n = 0$ every integer divides $0$ , so $S$ is the whole set of integers greater than $1$ ; it does have a least element, namely $2$ , but a statement about the divisors of $0$ is of no use below and the lemma is not claimed there.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product

Statement

Write finite products in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , as in The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity; a list of primes of length $r$ means a function $p : r \to Z$ on the von Neumann natural $r = {0, \dots, r - 1}$ with every $p_{i}$ prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

Existence. For every $n \in Z$ with $n \geq 1$ there are $r \in N$ and a list $p : r \to Z$ of primes with

$n = \prod_{i < r} p_{i} .$

At $n = 1$ this holds with $r = 0$ : the empty product is $1$ , so $1$ is a product of primes, of no primes at all, and needs no separate clause.
Every such product is at least $1$ . Conversely, for every $r \in N$ and every list $p : r \to Z$ of primes, $\prod_{i < r} p_{i} \geq 1$ . So the integers of clause 1 are exactly the values of finite products of primes.

Facts & Assumptions

Given: The commutative monoid $(Z, \cdot, 1)$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid); the embedding $ι : N \to Z$ of The naturals embed in the integers; and the property $P (k)$ : "if $ι (k) \geq 1$ then $ι (k) = \prod_{i < r} p_{i}$ for some $r \in N$ and some list $p : r \to Z$ of primes".

[L1]

$\prod_{i < 0} g_{i} = e$ and $\prod_{i < σ (r)} g_{i} = (\prod_{i < r} g_{i}) \cdot g_{r}$ ; the value depends only on $g_{0}, \dots, g_{r - 1}$ , so a list $u : r \to M$ determines $\prod_{i < r} u_{i}$ (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

[L2]

Every integer $n > 1$ has a prime divisor (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime, Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L3]

Strong induction: if for every $k$ the truth of $P$ below $k$ implies $P (k)$ , then $P$ holds everywhere on $N$ (Strong (complete) induction).

[L4]

Induction: a subset of $N$ containing $0$ and closed under $σ$ is $N$ (The principle of mathematical induction).

[L5]

$ι$ is injective, preserves addition, multiplication and order, and its image is exactly the nonnegative integers, with $ι (0) = 0$ and $ι (1) = 1$ (The naturals embed in the integers, The integers as equivalence classes of pairs of naturals).

[L6]

Every prime satisfies $p > 1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L7]

The order on $Z$ is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication (The integers form a totally ordered ring, Order on the integers).

[L8]

$Z$ is a commutative ring: multiplication is associative and commutative, $x \cdot 1 = x$ , $x \cdot 0 = 0$ , multiplication distributes over addition, and every $x$ has an additive inverse $- x$ , with $- (- x) = x$ and $(- x) y = - (x y)$ ; we write $u - v$ for $u + (- v)$ (The integers form a commutative ring, Arithmetic on the integers).

[L9]

On $N$ : $0 \leq k$ for every $k$ (Order on the natural numbers); $m < k$ exactly when $σ (m) \leq k$ (Discreteness: $σ (n)$ is the immediate successor); $1 = σ (0)$ (The natural numbers $N$ (von Neumann)); and $r < σ (r)$ , with $i < σ (r)$ exactly when $i \leq r$ (On $N$ the order is membership: $m < n ⟺ m \in n$ ).

[L10]

Proof

technique · induction

1.1

$0 < 1$ in $Z$ : $1 = ι (1)$ lies in the image of $ι$ , so $1 \geq 0$ , and $1 \neq 0$ because $ι$ is injective and $ι (0) = 0$ .

1.2

Discreteness: if $x \in Z$ and $0 < x$ then $1 \leq x$ . Indeed $x \geq 0$ , so $x = ι (k)$ for some $k$ ; $k \neq 0$ since $ι (0) = 0 \neq x$ ; so $0 < k$ in $N$ , hence $1 = σ (0) \leq k$ , and applying the order-preserving $ι$ gives $1 \leq x$ .

L5L9

1.3

Let $k \in N$ and assume $P (j)$ for every $j < k$ .

2.1

Clause 2. Let $T$ be the set of $r \in N$ such that $\prod_{i < r} p_{i} \geq 1$ for every list $p : r \to Z$ of primes. Then $0 \in T$ , the empty product being $1$ . If $r \in T$ and $p : σ (r) \to Z$ is a list of primes, then $\prod_{i < σ (r)} p_{i} = (\prod_{i < r} p_{i}) p_{r}$ , where the restriction of $p$ to $r$ is again a list of primes, so the first factor is $\geq 1 > 0$ ; and $p_{r} > 1 > 0$ ; positives being closed under multiplication the product is $> 0$ , hence $\geq 1$ by step 1.2. So $σ (r) \in T$ , and $T = N$ .

step 1.1step 1.2L1L4L6L7

2.2

$P (0)$ holds vacuously: $ι (0) = 0$ and $0 \geq 1$ is false, since $0 < 1$ .

basestep 1.1L5

2.3

Suppose $ι (k) \geq 1$ and write $n : = ι (k)$ ; by totality either $n = 1$ or $n > 1$ . If $n = 1$ , take $r : = 0$ : the empty list is a list of primes and $\prod_{i < 0} p_{i} = 1 = n$ , so $P (k)$ holds.

step 1.1L1L7

3.1

Suppose instead $n > 1$ . Fix a prime $q$ with $q ∣ n$ and an integer $m$ with $n = q m$ .

step 2.3L2L10choose

4.1

$m > 0$ : $m = 0$ would give $n = q \cdot 0 = 0 < 1$ , and $m < 0$ would give $- m > 0$ , hence $q (- m) > 0$ , that is $- n > 0$ and $n < 0 < 1$ ; both contradict $n \geq 1$ . So $m > 0$ and therefore $m \geq 1$ by step 1.2.

step 1.1step 1.2step 3.1L7L8

5.1

$m < n$ : since $q > 1$ we have $q - 1 > 0$ , and $m > 0$ , so $(q - 1) m > 0$ ; and $(q - 1) m = q m - m = n - m$ , whence $n - m > 0$ and $m < n$ .

step 3.1step 4.1L6L7L8

6.1

As $m \geq 1 > 0$ , write $m = ι (j)$ with $j \in N$ . Then $j < k$ : otherwise $k \leq j$ , and $ι$ preserving the order would give $n = ι (k) \leq ι (j) = m$ , contradicting step 5.1.

step 4.1step 5.1L5L7

7.1

By step 1.3 applied to $j$ there are $s \in N$ and a list $p : s \to Z$ of primes with $m = \prod_{i < s} p_{i}$ .

step 1.3step 4.1step 6.1

8.1

Define $p^{'} : σ (s) \to Z$ by $p_{i}^{'} : = p_{i}$ for $i < s$ and $p_{s}^{'} : = q$ ; every value is prime, and $\prod_{i < σ (s)} p_{i}^{'} = (\prod_{i < s} p_{i}^{'}) \cdot p_{s}^{'} = m q = q m = n$ , the middle equality because the product over $i < s$ depends only on $p_{0}^{'}, \dots, p_{s - 1}^{'}$ , which agree with $p$ . So $P (k)$ holds with $r : = σ (s)$ .

step 3.1step 7.1L1L8L9

9.1

Steps 2.3 and 8.1 cover the two possibilities for $n$ , so $P (k)$ follows from the truth of $P$ below $k$ ; with step 2.2 as the case $k = 0$ , strong induction gives $P (k)$ for every $k \in N$ .

step 2.2step 2.3step 8.1L3

10.1

Finally, any $n \geq 1$ satisfies $n > 0$ , so $n = ι (k)$ for some $k \in N$ , and $P (k)$ is clause 1 for that $n$ ; clause 2 is step 2.1.

step 1.1step 2.1step 9.1L5L7discharge-induction∎

Remarks

$1$ is a product of primes here, and this is not a dodge. The empty product is the identity of the monoid by The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, so $r = 0$ gives the value $1$ exactly. Excluding $n = 1$ and starting at $n \geq 2$ would force a special case into every later statement, including The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ , whose uniqueness clause at $r = 0$ is precisely the assertion that only the empty list represents $1$ .
Uniqueness is a separate theorem and is not proved here. Existence needs only a least prime divisor and a descent; uniqueness needs Euclid's lemma. In the multiplicative monoid $H = {1, 4, 7, 10, \dots}$ of positive integers one more than a multiple of $3$ , the element $100$ has two genuinely different factorisations into irreducibles, $4 \cdot 25$ and $10 \cdot 10$ ↗ on the companion page exhibits a setting where the existence half holds and the uniqueness half fails, which is what shows the two halves are genuinely independent.
The list is appended to, not prepended to. The successor clause of The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity multiplies on the right, so putting the new prime $q$ at position $s$ costs nothing, whereas putting it at position $0$ would need the splitting law of Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either. Order is irrelevant to the value, by the commutative clause of that theorem, so nothing is lost.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$

Statement

Finite products are taken in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ as in The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, and a list of primes of length $r$ is a function $p : r \to Z$ on the von Neumann natural $r = {0, \dots, r - 1}$ with every $p_{i}$ prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

Existence. Every $n \in Z$ with $n \geq 1$ is $\prod_{i < r} p_{i}$ for some $r \in N$ and some list $p$ of primes of length $r$ (Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product).
Uniqueness up to order. Let $p$ and $q$ be lists of primes, of lengths $r$ and $s$ . If

$\prod_{i < r} p_{i} = \prod_{j < s} q_{j},$

then $r = s$ , and there is a permutation $π \in Sym (r)$ (The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition) with

$q_{i} = p_{π (i)} for every i < r .$

At $r = 0$ clause 2 says that the only list of primes whose product is $1$ is the empty list, and the permutation condition is vacuous.

Facts & Assumptions

Given: The commutative monoid $(Z, \cdot, 1)$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid); and the property $U (r)$ : "for every $s \in N$ and all lists $p$ , $q$ of primes of lengths $r$ and $s$ with $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ , one has $r = s$ and $q_{i} = p_{π (i)}$ for all $i < r$ , for some $π \in Sym (r)$ ".

[L1]

$\prod_{i < 0} g_{i} = e$ and $\prod_{i < σ (r)} g_{i} = (\prod_{i < r} g_{i}) \cdot g_{r}$ ; the value depends only on $g_{0}, \dots, g_{r - 1}$ (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

[L2]

Commutative case of generalised associativity: for a commutative monoid, $n \in N$ , $π \in Sym (n)$ and $h$ with $h_{i} = g_{π (i)}$ for $i < n$ , one has $\prod_{i < n} h_{i} = \prod_{i < n} g_{i}$ (Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either).

[L3]

If a prime $u$ divides $\prod_{j < s} q_{j}$ then $u ∣ q_{k}$ for some $k < s$ (If a prime $p$ divides a finite product $\prod_{i < n} a_{i}$ of integers then $p ∣ a_{i}$ for some $i < n$ ; at $n = 0$ the product is $1$ and the hypothesis cannot hold, Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L4]

Every prime $u$ satisfies $u > 1$ , and every positive divisor of a prime $w$ is $1$ or $w$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L5]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ); $d ∣ v$ means $v = d c$ for some $c$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L6]

If $x z = y z$ and $z \neq 0$ then $x = y$ (The integers have no zero divisors; multiplicative cancellation).

[L7]

$Sym (X)$ is the set of bijections $X \to X$ under composition, with identity ${i d}_{X}$ ; it is closed under composition, and for $a \neq b$ in $X$ the transposition $(a b)$ is a permutation of $X$ with $(a b) \circ (a b) = {i d}_{X}$ (The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition, $Sym (X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements, Injection, surjection, bijection).

[L8]

Induction on $N$ (The principle of mathematical induction).

[L9]

On $N$ : $n = {m : m < n}$ , $σ (n) = n \cup {n}$ , $n < σ (n)$ , $m < σ (n)$ exactly when $m \leq n$ , and $n \notin n$ (On $N$ the order is membership: $m < n ⟺ m \in n$ , The natural numbers $N$ (von Neumann)).

[L10]

Every natural number other than $0$ is a successor (Every nonzero natural number is a successor).

[L11]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition; $Z$ is a commutative ring (The integers form a totally ordered ring, Order on the integers, The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L12]

$ι : N \to Z$ is injective, preserves the order, and has as image the nonnegative integers, with $ι (0) = 0$ , $ι (1) = 1$ (The naturals embed in the integers).

Proof

technique · induction

1.1

$0 < 1$ : $1 = ι (1)$ is nonnegative and differs from $0 = ι (0)$ by injectivity of $ι$ . Hence every prime $u$ satisfies $u > 1 > 0$ , so $u \neq 0$ , $u \neq 1$ and, adding $- 1$ to $0 < 1$ , also $u \neq - 1$ .

L4L11L12

1.2

If $q$ is a list of primes of length $s \neq 0$ then $q_{t} ∣ \prod_{j < s} q_{j}$ , where $s = σ (t)$ : indeed the product equals $(\prod_{j < t} q_{j}) q_{t}$ .

L1L5L10

1.3

Let $r \in N$ and assume $U (r)$ .

1.4

Let $p$ be a list of primes of length $σ (r)$ and $q$ one of length $s$ , with $N : = \prod_{i < σ (r)} p_{i} = \prod_{j < s} q_{j}$ . Then $N = (\prod_{i < r} p_{i}) p_{r}$ , so $p_{r} ∣ N$ .

L1L5

2.1

A prime never divides $1$ : $u ∣ 1$ would force $u = 1$ or $u = - 1$ , both excluded by step 1.1.

step 1.1L5

2.2

By [L3] there is $k < s$ with $p_{r} ∣ q_{k}$ . Since $p_{r} > 1 > 0$ , $p_{r}$ is a positive divisor of the prime $q_{k}$ other than $1$ , so $p_{r} = q_{k}$ .

step 1.1step 1.4L3L4

3.1

$U (0)$ holds. Let $q$ be a list of primes of length $s$ with $\prod_{i < 0} p_{i} = \prod_{j < s} q_{j}$ , so $\prod_{j < s} q_{j} = 1$ . If $s \neq 0$ , then $s = σ (t)$ and step 1.2 gives $q_{t} ∣ 1$ , contradicting step 2.1; so $s = 0$ . Then $r = s = 0$ , ${i d}_{\emptyset} \in Sym (0)$ since $0 = \emptyset$ , and the condition " $q_{i} = p_{π (i)}$ for all $i < 0$ " is vacuous.

basestep 2.1step 1.2L1L7L9

3.2

$s \neq 0$ : otherwise $N = 1$ and $p_{r} ∣ 1$ , contradicting step 2.1. Write $s = σ (t)$ .

step 2.1step 1.4L1L10

4.1

Define $τ \in Sym (s)$ by $τ : = {i d}_{s}$ if $k = t$ and $τ : = (k t)$ otherwise; in both cases $τ$ is a permutation of $s$ with $τ \circ τ = {i d}_{s}$ and $τ (t) = k$ . Note $t < s$ and $k < s$ , so both lie in $s$ .

step 3.2step 2.2L7L9construct

5.1

Put $q_{j}^{'} : = q_{τ (j)}$ for $j < s$ ; every $q_{j}^{'}$ is prime, and $\prod_{j < s} q_{j}^{'} = \prod_{j < s} q_{j} = N$ by the commutative clause [L2], the monoid $(Z, \cdot, 1)$ being commutative.

step 4.1L2

6.1

Also $q_{t}^{'} = q_{τ (t)} = q_{k} = p_{r}$ , so $N = \prod_{j < σ (t)} q_{j}^{'} = (\prod_{j < t} q_{j}^{'}) q_{t}^{'} = (\prod_{j < t} q_{j}^{'}) p_{r}$ .

step 2.2step 4.1step 5.1L1

7.1

Comparing with step 1.4, $(\prod_{i < r} p_{i}) p_{r} = (\prod_{j < t} q_{j}^{'}) p_{r}$ , and $p_{r} \neq 0$ by step 1.1, so cancellation gives $\prod_{i < r} p_{i} = \prod_{j < t} q_{j}^{'}$ .

step 1.1step 1.4step 6.1L6

8.1

The restrictions of $p$ to $r$ and of $q^{'}$ to $t$ are lists of primes of lengths $r$ and $t$ , and their products are the two sides of step 7.1, since a finite product depends only on the entries it names. So $U (r)$ applies: $r = t$ , hence $s = σ (t) = σ (r)$ , and there is $ρ \in Sym (r)$ with $q_{i}^{'} = p_{ρ (i)}$ for every $i < r$ .

step 1.3step 7.1L1

9.1

Define $\hat{ρ} : σ (r) \to σ (r)$ by $\hat{ρ} (i) : = ρ (i)$ for $i < r$ and $\hat{ρ} (r) : = r$ . Since $σ (r) = r \cup {r}$ with $r \notin r$ , and $ρ$ is a bijection of $r$ , the map $\hat{ρ}$ is a bijection of $σ (r)$ , that is $\hat{ρ} \in Sym (σ (r))$ .

step 8.1L7L9construct

10.1

Put $π : = \hat{ρ} \circ τ$ , a permutation of $s = σ (r)$ because $Sym (σ (r))$ is closed under composition.

step 4.1step 8.1step 9.1L7

11.1

For $i < σ (r)$ we get $q_{i} = q_{τ (τ (i))} = q_{τ (i)}^{'}$ . If $τ (i) < r$ then $q_{τ (i)}^{'} = p_{ρ (τ (i))} = p_{\hat{ρ} (τ (i))} = p_{π (i)}$ ; and if $τ (i) = r = t$ then $q_{τ (i)}^{'} = q_{t}^{'} = p_{r} = p_{\hat{ρ} (r)} = p_{π (i)}$ . Since $τ (i) < σ (r)$ these two possibilities are exhaustive, so $q_{i} = p_{π (i)}$ throughout.

step 4.1step 6.1step 8.1step 9.1step 10.1L9

12.1

Steps 8.1 and 11.1 give $s = σ (r)$ and a permutation $π \in Sym (σ (r))$ with $q_{i} = p_{π (i)}$ for all $i < σ (r)$ , so $U (σ (r))$ holds; with step 3.1 as base, induction gives $U (r)$ for every $r \in N$ , which is clause 2. Clause 1 is Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product.

step 3.1step 8.1step 11.1L8discharge-induction∎

Remarks

"Unique up to order" is spelt out, not gestured at. The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition is available at this point in the library, so the uniqueness clause names a permutation $π$ of the von Neumann natural $r$ and asserts an equality for every index, rather than saying the two factorisations "agree up to rearrangement". The letter $π$ is used because $σ$ is already the successor function on $N$ throughout this library.
The theorem is stated for $n \geq 1$ . It is not stated for $n \geq 2$ , which would exclude the empty product and gain nothing, and it is not stated for all nonzero $n$ , which is false as it stands because a negative integer is not a product of primes. The signed form is Every nonzero integer $n$ is $u \prod_{i < r} p_{i}$ with $u \in {1, - 1}$ and every $p_{i}$ prime; $u$ and $r$ are determined by $n$ , and the list is determined up to a permutation, where the sign is carried by a unit.
Where each hypothesis is used. Primality of $p_{r}$ lets If a prime $p$ divides a finite product $\prod_{i < n} a_{i}$ of integers then $p ∣ a_{i}$ for some $i < n$ ; at $n = 0$ the product is $1$ and the hypothesis cannot hold supply the index $k$ , and also makes $p_{r}$ a nonzero factor different from $1$ . Primality of the selected $q_{k}$ is then used separately in step 2.2: the positive divisor $p_{r} ∣ q_{k}$ , being different from $1$ , must equal $q_{k}$ . Drop Euclid's lemma and the argument collapses before that comparison — In the multiplicative monoid $H = {1, 4, 7, 10, \dots}$ of positive integers one more than a multiple of $3$ , the element $100$ has two genuinely different factorisations into irreducibles, $4 \cdot 25$ and $10 \cdot 10$ ↗ is the witness.
Reading the theorem by exponents. Collecting equal primes turns clause 2 into For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list, which records the multiplicity of each prime as its $p$ -adic valuation. That is the same theorem in different notation, not a further result.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Every nonzero integer $n$ is $u \prod_{i < r} p_{i}$ with $u \in {1, - 1}$ and every $p_{i}$ prime; $u$ and $r$ are determined by $n$ , and the list is determined up to a permutation

Statement

Let $n \in Z$ with $n \neq 0$ , and take finite products in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , as in The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity.

Existence. There are $u \in {1, - 1}$ , $r \in N$ and a list $p : r \to Z$ of primes (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) with

$n = u \prod_{i < r} p_{i} .$
Uniqueness. If also $n = u^{'} \prod_{j < s} q_{j}$ with $u^{'} \in {1, - 1}$ and $q : s \to Z$ a list of primes, then $u = u^{'}$ , $r = s$ , and $q_{i} = p_{π (i)}$ for every $i < r$ , for some $π \in Sym (r)$ (The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition).

Facts & Assumptions

Given: A nonzero integer $n$ .

[L1]

Every integer $m \geq 1$ is $\prod_{i < r} p_{i}$ for some $r \in N$ and some list $p : r \to Z$ of primes; and conversely every such product is $\geq 1$ (Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product, The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid).

[L2]

If $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ for lists of primes, then $r = s$ and $q_{i} = p_{π (i)}$ for all $i < r$ , for some $π \in Sym (r)$ (The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ , The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition).

[L3]

$∣ x ∣ = x$ when $x \geq 0$ and $∣ x ∣ = - x$ when $x < 0$ (The absolute value $∣ a ∣$ of an integer); $∣ x ∣ \geq 0$ , $∣ x ∣ = 0$ exactly when $x = 0$ , and $∣ x y ∣ = ∣ x ∣ ∣ y ∣$ (Absolute value in $Z$ : $∣ a ∣ \geq 0$ ; $∣ a ∣ = 0$ exactly when $a = 0$ ; $∣ - a ∣ = ∣ a ∣$ ; $∣ a b ∣ = ∣ a ∣ ∣ b ∣$ ; $- ∣ a ∣ \leq a \leq ∣ a ∣$ ; and $∣ a ∣ \leq c$ exactly when $- c \leq a \leq c$ ).

[L4]

If $x z = y z$ and $z \neq 0$ then $x = y$ (The integers have no zero divisors; multiplicative cancellation).

[L5]

$Z$ is a commutative ring: multiplication is associative and commutative, $x \cdot 1 = x$ , $x \cdot (- 1) = - x$ , and every $x$ has an additive inverse, with $- (- x) = x$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L6]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition (The integers form a totally ordered ring, Order on the integers).

[L7]

$ι : N \to Z$ is injective, preserves the order, and has as image exactly the nonnegative integers, with $ι (0) = 0$ and $ι (1) = 1$ (The naturals embed in the integers).

[L8]

Proof

technique · direct

1.1

$0 < 1$ , since $1 = ι (1)$ is nonnegative and differs from $0 = ι (0)$ by injectivity; and if $0 < x$ then $1 \leq x$ , because $x = ι (k)$ with $k \neq 0$ , so $1 = σ (0) \leq k$ and $ι$ preserves the order.

L7L8

2.1

$∣ n ∣ \geq 0$ and $∣ n ∣ \neq 0$ , so $∣ n ∣ > 0$ and hence $∣ n ∣ \geq 1$ .

step 1.1L3L6

2.2

For uniqueness, suppose $n = u P = u^{'} P^{'}$ where $P : = \prod_{i < r} p_{i}$ and $P^{'} : = \prod_{j < s} q_{j}$ and $u, u^{'} \in {1, - 1}$ . By [L1] both $P \geq 1$ and $P^{'} \geq 1$ , so both are positive and $∣ P ∣ = P$ , $∣ P^{'} ∣ = P^{'}$ .

step 1.1L1L3L6

3.1

By [L1] there are $r \in N$ and a list $p$ of primes of length $r$ with $∣ n ∣ = \prod_{i < r} p_{i}$ .

step 2.1L1choose

3.2

Taking absolute values, $∣ n ∣ = ∣ u ∣ ∣ P ∣ = P$ and likewise $∣ n ∣ = ∣ u^{'} ∣ ∣ P^{'} ∣ = P^{'}$ , since $∣ 1 ∣ = 1$ and $∣ - 1 ∣ = 1$ . Hence $P = P^{'}$ .

step 2.2L3L5

4.1

The order is total and $n \neq 0$ , so $n > 0$ or $n < 0$ . If $n > 0$ then $∣ n ∣ = n$ and $n = 1 \cdot \prod_{i < r} p_{i}$ ; if $n < 0$ then $∣ n ∣ = - n$ , so $n = - (- n) = - ∣ n ∣ = (- 1) \prod_{i < r} p_{i}$ . In both cases clause 1 holds, with $u = 1$ and $u = - 1$ respectively.

step 3.1L3L5L6

4.2

By [L2] applied to $P = P^{'}$ we get $r = s$ and a permutation $π \in Sym (r)$ with $q_{i} = p_{π (i)}$ for every $i < r$ .

step 3.2L2

4.3

And $u P = u^{'} P$ with $P \neq 0$ , since $P \geq 1 > 0$ ; cancellation gives $u = u^{'}$ .

step 2.2step 3.2L4L6

5.1

Clause 1 is step 4.1 and clause 2 is steps 4.2 and 4.3.

step 4.1step 4.2step 4.3∎

Remarks

This is why Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ can insist on $p > 1$ without loss. The sign of $n$ is carried by the unit $u$ , not by the primes, so admitting negative primes would buy nothing and would break uniqueness, since $(- 2) (- 3)$ and $2 \cdot 3$ would be different lists with the same product.
The uniqueness of $u$ needs $P \neq 0$ , and that is why the empty product is harmless. At $r = 0$ the statement reads $n = u$ , so the nonzero integers with an empty prime list are exactly $1$ and $- 1$ — which is $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ again, from a different direction.
Nothing is claimed at $n = 0$ . Zero is divisible by every prime and is not a product of primes times a unit at all, since every such product is $1$ or $- 1$ times a positive integer. It is excluded by hypothesis, not overlooked.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Euclid's theorem: for every $n \in N$ and every list $p : n \to Z$ of primes there is a prime not among $p_{0}, \dots, p_{n - 1}$ ; consequently the set of primes is not finite

Statement

Write $P : = {x \in Z : x is prime}$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ), and take finite products in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ as in The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity.

For every $n \in N$ and every list $p : n \to Z$ of primes there is a prime $q$ with $q \neq p_{i}$ for every $i < n$ .
Consequently $P$ is not finite: there is no $m \in N$ with $P \approx m$ (Finite, countably infinite, countable, uncountable, Equinumerous sets, $A \approx B$ and $A ⪯ B$ ).

Clause 1 holds at $n = 0$ as well, where the empty product is $1$ and the witness produced by the proof is a prime divisor of $2$ .

Facts & Assumptions

Given: The set $P$ of primes.

[L1]

$\prod_{i < 0} g_{i} = e$ and $\prod_{i < σ (n)} g_{i} = (\prod_{i < n} g_{i}) \cdot g_{n}$ ; the value depends only on $g_{0}, \dots, g_{n - 1}$ (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid).

[L2]

Splitting law: $\prod_{i < m + k} g_{i} = (\prod_{i < m} g_{i}) \cdot (\prod_{l < k} g_{m + l})$ for all $m, k \in N$ (Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either).

[L3]

Every finite product of primes is $\geq 1$ (Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product).

[L4]

Every integer $> 1$ has a prime divisor (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime).

[L5]

Every prime satisfies $u > 1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L6]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L7]

Divisibility is reflexive and transitive, and is linear: $d ∣ a$ and $d ∣ b$ give $d ∣ a x + b y$ , in particular $d ∣ a - b$ (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ , Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L8]

$Z$ is a commutative ring: addition and multiplication are associative and commutative, $x + 0 = x$ , $x \cdot 1 = x$ , and every $x$ has an additive inverse (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L9]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition (The integers form a totally ordered ring, Order on the integers); $ι : N \to Z$ is injective, preserves the order, and has as image the nonnegative integers, with $ι (0) = 0$ , $ι (1) = 1$ (The naturals embed in the integers, The natural numbers $N$ (von Neumann)).

[L10]

On $N$ : $j < n$ exactly when $σ (j) \leq n$ (Discreteness: $σ (n)$ is the immediate successor); $a \leq b$ means $a + c = b$ for some $c \in N$ (Order on the natural numbers, Addition of natural numbers); and $n = {m : m < n}$ with $j < σ (j)$ (On $N$ the order is membership: $m < n ⟺ m \in n$ ).

[L11]

A function is injective when it identifies no two points, surjective when its image is the whole codomain, and bijective when it is both (Injection, surjection, bijection); $A \approx B$ means a bijection $A \to B$ exists, and $A$ is finite when $A \approx m$ for some $m \in N$ (Equinumerous sets, $A \approx B$ and $A ⪯ B$ , Finite, countably infinite, countable, uncountable).

Proof

technique · contradiction

1.1

$0 < 1$ in $Z$ , since $1 = ι (1)$ is nonnegative and differs from $0 = ι (0)$ by injectivity of $ι$ ; adding $1$ gives $1 < 1 + 1$ .

1.2

Fix $n \in N$ and a list $p : n \to Z$ of primes, and put $Π : = \prod_{i < n} p_{i}$ and $N : = Π + 1$ .

L1choose

1.3

Suppose, for contradiction, that $P$ is finite: fix $m \in N$ and a bijection $g : P \to m$ .

assume-contraL11choose

2.1

$Π \geq 1$ by [L3], so $N = Π + 1 \geq 1 + 1 > 1$ by compatibility of the order with addition.

step 1.1step 1.2L3L9

2.2

Suppose, for contradiction, that $q = p_{j}$ for some $j < n$ . Since $j < n$ we have $σ (j) \leq n$ , so $n = σ (j) + c$ for some $c \in N$ .

assume-contrastep 1.2L10

2.3

Define $f : m \to Z$ by letting $f (i)$ be the unique $x \in P$ with $g (x) = i$ ; such an $x$ exists because $g$ is surjective and is unique because $g$ is injective. Then $f$ is a list of primes of length $m$ , and $f (g (x)) = x$ for every $x \in P$ .

step 1.3L11construct

3.1

By [L4] there is a prime $q$ with $q ∣ N$ .

step 2.1L4choose

3.2

The splitting law then gives $Π = (\prod_{i < σ (j)} p_{i}) \cdot (\prod_{l < c} p_{σ (j) + l})$ , and $\prod_{i < σ (j)} p_{i} = (\prod_{i < j} p_{i}) p_{j}$ ; by associativity and commutativity $Π = p_{j} \cdot B$ where $B : = (\prod_{i < j} p_{i}) (\prod_{l < c} p_{σ (j) + l})$ . Hence $p_{j} ∣ Π$ , that is $q ∣ Π$ .

step 2.2L1L2L7L8

4.1

So $q ∣ N$ and $q ∣ Π$ , whence $q ∣ N - Π = 1$ by linearity, forcing $q = 1$ or $q = - 1$ and contradicting $q > 1 > 0 > - 1$ . Therefore $q \neq p_{i}$ for every $i < n$ , which is clause 1.

step 1.1step 1.2step 3.1step 3.2L5L6L7L8L9

5.1

Clause 1 applied to $f$ supplies a prime $q_{0}$ with $q_{0} \neq f (i)$ for every $i < m$ . But $q_{0} \in P$ , so $g (q_{0}) < m$ and $f (g (q_{0})) = q_{0}$ , a contradiction. Hence no such $m$ and $g$ exist and $P$ is not finite, which is clause 2.

step 4.1step 1.3step 2.3L10L11discharge-contradiction∎

Remarks

The theorem does not say $N$ is prime, and reading it that way is a common slip. What is proved is that $N = p_{0} \dots p_{n - 1} + 1$ has a prime divisor, and that this divisor is not on the list. The false reading is refuted on the companion page by FALSE: for every finite list $p_{0}, \dots, p_{n - 1}$ of distinct primes, $p_{0} \dots p_{n - 1} + 1$ is prime ↗, where $2 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 + 1 = 30031 = 59 \cdot 509$ .
Clause 1 is the constructive statement and clause 2 is a consequence of it. Clause 1 says nothing about infinite sets and needs no notion of cardinality; it just extends any finite list. Clause 2 turns that into "not finite" in the sense of Finite, countably infinite, countable, uncountable, and the only input it needs is that a bijection $P \to m$ produces a list enumerating every prime.
This is not a statement about where the primes are. Arbitrarily long runs of composite integers exist (For every $n \in N$ there are $n$ consecutive composite integers: with $N : = \prod_{j < n} (j + 2)$ , each of $N + 2, \dots, N + n + 1$ is composite ↗), so the gaps between consecutive primes are unbounded; the two facts are compatible and neither weakens the other.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$

Definition

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) and let $a \in Z$ with $a \neq 0$ . Powers $p^{k}$ for $k \in N$ are the natural powers of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ taken in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ and Semigroup and monoid, so that

$p^{0} = 1, p^{σ (k)} = p^{k} \cdot p (k \in N) .$

Put

$E (p, a) : = {k \in N : p^{k} ∣ a}$

(Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ). Then $E (p, a)$ has a greatest element, and the $p$ -adic valuation of $a$ is

$v_{p} (a) : = \max E (p, a) \in N,$

the greatest $k \in N$ with $p^{k} ∣ a$ .

Why a greatest element exists. Three facts are needed, and each is proved here rather than assumed.

The set is nonempty. $p^{0} = 1$ and $1 ∣ a$ for every $a$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ), so $0 \in E (p, a)$ .

Every power of $p$ exceeds its own exponent. We claim $p^{k} \geq 1$ and $ι (k) < p^{k}$ for every $k \in N$ , where $ι : N \to Z$ is the embedding of The naturals embed in the integers. Both are proved by induction (The principle of mathematical induction). At $k = 0$ we have $p^{0} = 1 \geq 1$ and $ι (0) = 0 < 1 = p^{0}$ , using $0 < 1$ , which holds because $1 = ι (1)$ is nonnegative and differs from $0 = ι (0)$ by injectivity of $ι$ . Assume both at $k$ . Since $p > 1$ we have $p - 1 > 0$ , hence $p - 1 \geq 1$ by discreteness of the order on $Z$ (Discreteness: $σ (n)$ is the immediate successor, The naturals embed in the integers: an integer $x > 0$ is $ι (j)$ with $j \neq 0$ , so $1 = σ (0) \leq j$ and $1 \leq x$ ). Therefore $p^{σ (k)} - p^{k} = p^{k} (p - 1) \geq p^{k} \geq 1$ , because $p^{k} \geq 1 > 0$ and positives are closed under multiplication (The integers form a totally ordered ring); so $p^{σ (k)} \geq p^{k} + 1 \geq 1 + 1 > 1$ . The same discreteness applied to $p^{k} - ι (k) > 0$ gives $ι (k) + 1 \leq p^{k}$ , and $ι (σ (k)) = ι (k) + 1$ because $σ (k) = k + 1$ in $N$ (Addition of natural numbers) and $ι$ preserves addition; so $ι (σ (k)) \leq p^{k} < p^{k} + 1 \leq p^{σ (k)}$ . The induction is complete.

The set is bounded. Let $k \in E (p, a)$ . Then $p^{k} ∣ a$ with $a \neq 0$ , so $∣ p^{k} ∣ \leq ∣ a ∣$ (If $d ∣ a$ and $a \neq 0$ then $d \neq 0$ and $∣ d ∣ \leq ∣ a ∣$ ; hence the set of divisors of a nonzero integer is bounded above by $∣ a ∣$ ); and $p^{k} \geq 1 > 0$ gives $∣ p^{k} ∣ = p^{k}$ (The absolute value $∣ a ∣$ of an integer, Absolute value in $Z$ : $∣ a ∣ \geq 0$ ; $∣ a ∣ = 0$ exactly when $a = 0$ ; $∣ - a ∣ = ∣ a ∣$ ; $∣ a b ∣ = ∣ a ∣ ∣ b ∣$ ; $- ∣ a ∣ \leq a \leq ∣ a ∣$ ; and $∣ a ∣ \leq c$ exactly when $- c \leq a \leq c$ ). Combining with the previous paragraph, $ι (k) < p^{k} \leq ∣ a ∣$ . So the set of integers $ι [E (p, a)] = {ι (k) : k \in E (p, a)}$ is nonempty and bounded above by $∣ a ∣$ , hence has a unique greatest element (A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element). That greatest element lies in the set, so it is $ι (k_{0})$ for some $k_{0} \in E (p, a)$ ; and since $ι$ is injective and preserves the order in both directions, $k_{0}$ is the greatest element of $E (p, a)$ and is unique. We set $v_{p} (a) : = k_{0}$ .

$v_{p} (0)$ is left undefined. Every power of $p$ divides $0$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ), so $E (p, 0) = N$ has no greatest element and the clause above defines nothing. Every statement about $v_{p}$ in this library therefore carries the hypothesis $a \neq 0$ explicitly. The convention $v_{p} (0) : = \infty$ is not adopted: it would need a value set enlarging $N$ by a greatest element in which to place $\infty$ , and no such set is available at this point in the reading order. The library does build a totally ordered set with a greatest element — the extended real line, whose greatest element is $+ \infty$ — but it is constructed far above this page, and taking the values of $v_{p}$ there would make a definition about $Z$ rest on the construction of $R$ .

Remarks

$v_{p} (a)$ is a natural number, not an integer. It is a von Neumann natural (The natural numbers $N$ (von Neumann)), which is exactly what the exponent slot of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ takes, so $p^{v_{p} (a)}$ is meaningful without any translation. Where a valuation has to be subtracted from another, as in The $p$ -adic valuation extends to the nonzero rationals by $v_{p} (a / b) : = v_{p} (a) - v_{p} (b) \in Z$ , independently of the representation; it satisfies $v_{p} (x y) = v_{p} (x) + v_{p} (y)$ , and $v_{p} (x + y) \geq \min {v_{p} (x), v_{p} (y)}$ whenever $x$ , $y$ and $x + y$ are nonzero, the values are first carried into $Z$ along $ι$ (The naturals embed in the integers).
These are monoid powers, and deliberately not Integer powers $a^{m}$ . That definition is stated for an element of the ambient ordered field $R$ ; using it here would make a statement about $Z$ rest on the whole construction of the real numbers for no gain. The two agree along the embeddings $Z \to Q \to R$ , since both are defined by the same recursion $x^{0} = 1$ , $x^{σ (k)} = x^{k} x$ and the embeddings preserve products and the constant $1$ ; nothing on this page depends on that observation, and it is recorded here only so the reader does not think a second notion of power has been introduced.
The definition is by a maximum, and For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ converts it into the form later proofs use: $p^{v_{p} (a)} ∣ a$ , $p^{v_{p} (a) + 1} ∤ a$ , and $a = p^{v_{p} (a)} a^{'}$ with $p ∤ a^{'}$ .

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ), let $a \in Z$ with $a \neq 0$ , and write $v : = v_{p} (a)$ (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ). Powers are the natural powers of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ in the commutative monoid $(Z, \cdot, 1)$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ), and $k + 1$ means $σ (k)$ . Then:

$p^{k} \geq 1$ for every $k \in N$ ; in particular $p^{k} > 0$ and $p^{k} \neq 0$ ;
$p^{v} ∣ a$ and $p^{v + 1} ∤ a$ ;
for $k \in N$ : $p^{k} ∣ a$ if and only if $k \leq v$ ;
$a = p^{v} a^{'}$ for some $a^{'} \in Z$ with $a^{'} \neq 0$ and $p ∤ a^{'}$ ;
$v \geq 1$ if and only if $p ∣ a$ ;
$v_{p} (1) = v_{p} (- 1) = 0$ and $v_{p} (p) = 1$ .

Facts & Assumptions

Given: A prime $p$ , a nonzero integer $a$ , and $v : = v_{p} (a)$ .

[L1]

$v_{p} (a)$ is the greatest $k \in N$ with $p^{k} ∣ a$ ; in particular $p^{v} ∣ a$ , and $p^{k} ∣ a$ fails for every $k > v$ (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

[L2]

$p^{0} = 1$ and $p^{σ (k)} = p^{k} \cdot p$ (Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ , Semigroup and monoid, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L3]

Exponent law in a monoid, for natural exponents: $g^{m + n} = g^{m} g^{n}$ (Exponent laws in a group: $g^{m + n} = g^{m} g^{n}$ and $(g^{m})^{n} = g^{m n}$ for all $m, n \in Z$ , and $(g h)^{n} = g^{n} h^{n}$ when $g$ and $h$ commute).

[L4]

Divisibility is reflexive and transitive; $d ∣ u$ implies $d ∣ u c$ ; and $d ∣ u$ , $d ∣ - u$ , $- d ∣ u$ are equivalent (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L5]

$d ∣ u$ means $u = d c$ for some $c \in Z$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L6]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L7]

Every prime satisfies $p > 1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L8]

If $x z = y z$ and $z \neq 0$ then $x = y$ ; and a product of two nonzero integers is nonzero (The integers have no zero divisors; multiplicative cancellation).

[L9]

On $N$ : $m \leq n$ means $m + c = n$ for some $c$ (Order on the natural numbers); $σ (k) = k + 1$ (Addition of natural numbers, The natural numbers $N$ (von Neumann)); $k < σ (k)$ and $m < σ (n)$ exactly when $m \leq n$ (On $N$ the order is membership: $m < n ⟺ m \in n$ ); $m < n$ exactly when $σ (m) \leq n$ (Discreteness: $σ (n)$ is the immediate successor); and $\leq$ is a linear order, so it is antisymmetric and total ( $\leq$ is a linear order on $N$ ).

[L10]

$Z$ is a commutative ring, its order is total, antisymmetric and transitive and compatible with addition, and $ι : N \to Z$ is injective, order preserving, with image the nonnegative integers and $ι (0) = 0$ , $ι (1) = 1$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals, The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers).

[L11]

Induction on $N$ : a subset containing $0$ and closed under $σ$ is all of $N$ (The principle of mathematical induction).

Proof

technique · direct

1.1

$p^{1} = p^{σ (0)} = p^{0} \cdot p = 1 \cdot p = p$ .

L2L10

1.2

$0 < 1 < p$ in $Z$ , since $1 = ι (1)$ is nonnegative and differs from $0$ ; hence $p \neq 0$ , $p \neq 1$ and $p \neq - 1$ .

L7L10

1.3

Clause 1. $p^{v} ∣ a$ by [L1], and $v < σ (v) = v + 1$ , so $p^{v + 1} ∣ a$ would contradict the maximality of $v$ ; hence $p^{v + 1} ∤ a$ .

L1L9

1.4

Clause 2, the other direction. If $p^{k} ∣ a$ then $k$ belongs to the set of which $v$ is the greatest element, so $k \leq v$ .

L1L9

2.1

Clause 0: $p^{k} \geq 1$ for every $k \in N$ . The set of such $k$ contains $0$ , since $p^{0} = 1$ ; and if $p^{k} \geq 1$ then $p^{σ (k)} = p^{k} p$ has both factors $\geq 1 > 0$ , so the product is positive, hence $\geq 1$ by discreteness of the order on $Z$ (a positive integer is $ι (j)$ with $j \neq 0$ , so $1 = σ (0) \leq j$ and $1 \leq ι (j)$ ). By induction the set is all of $N$ , and in particular $p^{k} > 0$ and $p^{k} \neq 0$ .

step 1.1step 1.2L2L9L10L11

2.2

Clause 2, one direction. Let $k \leq v$ and write $v = k + c$ with $c \in N$ . Then $p^{v} = p^{k + c} = p^{k} p^{c}$ , so $p^{k} ∣ p^{v}$ ; with $p^{v} ∣ a$ and transitivity, $p^{k} ∣ a$ .

step 1.3L1L3L4L5L9

2.3

Clause 3. By [L1] fix $a^{'}$ with $a = p^{v} a^{'}$ . Then $a^{'} \neq 0$ , since $a \neq 0$ . If $p ∣ a^{'}$ , say $a^{'} = p b$ , then $a = p^{v} (p b) = (p^{v} p) b = p^{v + 1} b$ , so $p^{v + 1} ∣ a$ , contradicting step 1.3. Hence $p ∤ a^{'}$ .

step 1.3L1L2L5L9L10choose

2.4

If $k \geq 1$ then $p ∣ p^{k}$ : write $k = 1 + c$ , so $p^{k} = p^{1} p^{c} = p \cdot p^{c}$ .

step 1.1L3L5L9

3.1

Clause 4. If $v \geq 1$ then $p = p^{1} ∣ a$ by step 2.2. Conversely if $p ∣ a$ then $p^{1} ∣ a$ , so $1 \leq v$ by step 1.4.

step 1.1step 2.2step 1.4

3.2

$v_{p} (1) = 0$ . If $p^{k} ∣ 1$ with $k \geq 1$ , then $p ∣ p^{k} ∣ 1$ by step 2.4 and transitivity, so $p = 1$ or $p = - 1$ , contradicting step 1.2. So no $k \geq 1$ satisfies $p^{k} ∣ 1$ , while $p^{0} = 1 ∣ 1$ ; the greatest such $k$ is $0$ .

step 1.2step 2.4L1L2L4L6L9

3.3

$v_{p} (p) = 1$ . First $p^{1} = p ∣ p$ , so $1 \leq v_{p} (p)$ by step 1.4 applied to $a : = p$ . Next $p^{2} ∤ p$ , where $2 = σ (1)$ : otherwise $p = p^{2} c = p (p c)$ for some $c$ , and cancelling $p \neq 0$ gives $1 = p c$ , so $p ∣ 1$ , contradicting step 1.2. Hence $v_{p} (p) < 2$ by step 2.2, that is $v_{p} (p) \leq 1$ , and antisymmetry gives $v_{p} (p) = 1$ .

step 1.1step 1.2step 2.2step 1.4L2L5L8L9

4.1

$v_{p} (- 1) = 0$ , because $p^{k} ∣ - 1$ holds exactly when $p^{k} ∣ 1$ , so the two sets of exponents coincide.

step 3.2L1L4

5.1

Clauses 0 to 5 are established.

step 1.3step 2.1step 2.2step 1.4step 2.3step 3.1step 3.2step 4.1step 3.3∎

Remarks

Clause 3 is the working form. Every later proof on this page writes a nonzero integer as $a = p^{v_{p} (a)} a^{'}$ with $p ∤ a^{'}$ and then argues about $a^{'}$ ; that is how $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero gets additivity, and it is where Euclid's lemma enters.
The hypothesis $a \neq 0$ is carried everywhere because $v_{p} (0)$ is not defined: every power of $p$ divides $0$ , so there is no greatest exponent (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).
Clause 2 says the exponents form an initial segment, which is what makes "the greatest $k$ with $p^{k} ∣ a$ " the same as "the number of times $p$ divides $a$ ". Without it the maximum could in principle skip values.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

$v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) and let $a, b \in Z$ be nonzero, with $v_{p}$ as in The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ . Then $a b \neq 0$ and

$v_{p} (a b) = v_{p} (a) + v_{p} (b),$

the sum taken in $N$ (Addition of natural numbers). If moreover $a + b \neq 0$ , then

$v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)},$

the minimum of two natural numbers, which exists because the order on $N$ is total ( $\leq$ is a linear order on $N$ ).

Facts & Assumptions

Given: A prime $p$ and nonzero integers $a, b$ ; $α : = v_{p} (a)$ and $β : = v_{p} (b)$ .

[L1]

For a nonzero $u$ : $p^{v_{p} (u)} ∣ u$ , and $u = p^{v_{p} (u)} u^{'}$ for some nonzero $u^{'}$ with $p ∤ u^{'}$ ; moreover $p^{k} ∣ u$ holds exactly for $k \leq v_{p} (u)$ (For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

[L2]

Exponent law in a monoid for natural exponents: $g^{m + n} = g^{m} g^{n}$ (Exponent laws in a group: $g^{m + n} = g^{m} g^{n}$ and $(g^{m})^{n} = g^{m n}$ for all $m, n \in Z$ , and $(g h)^{n} = g^{n} h^{n}$ when $g$ and $h$ commute, Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ , Semigroup and monoid, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L3]

If $p$ is prime and $p ∣ u v$ then $p ∣ u$ or $p ∣ v$ (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L4]

Divisibility is linear: $d ∣ u$ and $d ∣ v$ give $d ∣ u x + v y$ , in particular $d ∣ u + v$ (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ); $d ∣ u$ means $u = d c$ for some $c$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L5]

A product of two nonzero integers is nonzero, and $x z = y z$ with $z \neq 0$ gives $x = y$ (The integers have no zero divisors; multiplicative cancellation).

[L6]

$Z$ is a commutative ring: multiplication is associative and commutative and $x \cdot 1 = x$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals); its order is total, antisymmetric and transitive (The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers).

[L7]

On $N$ : $\leq$ is a linear order, so any two naturals are comparable and have a minimum ( $\leq$ is a linear order on $N$ ); $m \leq n$ means $m + c = n$ for some $c$ (Order on the natural numbers); $σ (k) = k + 1$ (Addition of natural numbers, The natural numbers $N$ (von Neumann)); $m < n$ exactly when $σ (m) \leq n$ (Discreteness: $σ (n)$ is the immediate successor), and $m < σ (n)$ exactly when $m \leq n$ (On $N$ the order is membership: $m < n ⟺ m \in n$ ).

Proof

technique · direct

1.1

$a b \neq 0$ , so $v_{p} (a b)$ is defined.

1.2

Fix $a^{'}$ and $b^{'}$ with $a = p^{α} a^{'}$ , $b = p^{β} b^{'}$ , both nonzero, and $p ∤ a^{'}$ , $p ∤ b^{'}$ .

L1choose

1.3

Now assume also $a + b \neq 0$ , and put $m : = \min {α, β}$ , which exists because $\leq$ is total on $N$ ; then $m \leq α$ and $m \leq β$ .

2.1

$a b = (p^{α} a^{'}) (p^{β} b^{'}) = (p^{α} p^{β}) (a^{'} b^{'}) = p^{α + β} (a^{'} b^{'})$ , using commutativity, associativity and the exponent law.

step 1.2L2L6

2.2

$p ∤ a^{'} b^{'}$ : otherwise [L3] would give $p ∣ a^{'}$ or $p ∣ b^{'}$ , both excluded by step 1.2.

step 1.2L3

2.3

By [L1], $p^{m} ∣ a$ and $p^{m} ∣ b$ , so $p^{m} ∣ a + b$ by linearity; since $a + b \neq 0$ , [L1] applied to $a + b$ gives $m \leq v_{p} (a + b)$ , which is the second assertion.

step 1.3L1L4

3.1

$p^{α + β} \neq 0$ , since $a b \neq 0$ and $a b = p^{α + β} (a^{'} b^{'})$ would otherwise be $0$ .

step 1.1step 2.1L6

3.2

$p^{α + β} ∣ a b$ by step 2.1, so $α + β \leq v_{p} (a b)$ .

step 1.1step 2.1L1L4

4.1

Suppose $α + β < v_{p} (a b)$ . Then $α + β + 1 \leq v_{p} (a b)$ , so $p^{α + β + 1} ∣ a b$ ; fix $c$ with $a b = p^{α + β + 1} c = p^{α + β} (p c)$ , using the exponent law. Cancelling $p^{α + β} \neq 0$ against step 2.1 gives $a^{'} b^{'} = p c$ , that is $p ∣ a^{'} b^{'}$ , contradicting step 2.2.

step 2.1step 2.2step 3.1L1L2L4L5L7

5.1

Hence $v_{p} (a b) = α + β$ by totality and antisymmetry of the order on $N$ , which is the first assertion.

step 3.2step 4.1L7

6.1

Both assertions are established.

step 5.1step 2.3∎

Remarks

Primality is used exactly once, at step 2.2, and it is used through Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ . That is the whole reason the additivity of $v_{p}$ is a theorem about primes and not about arbitrary integers greater than $1$ : for a composite base the analogue fails, and the companion page of the divisibility page already carries the failure of the product principle ( $6 ∣ 4 \cdot 9$ while $6 ∤ 4$ and $6 ∤ 9$ : dividing a product does not force dividing a factor, and the coprimality hypothesis is what fails).
The second clause is an inequality and cannot be an equality. Take $p = 2$ , $a = 2$ , $b = 2$ : then $v_{2} (a) = v_{2} (b) = 1$ while $v_{2} (a + b) = v_{2} (4) = 2$ . The companion page's worked example computes such valuations explicitly ( $360 = 2^{3} \cdot 3^{2} \cdot 5$ and $84 = 2^{2} \cdot 3 \cdot 7$ , with $\gcd (360, 84) = 12$ and $lcm (360, 84) = 2520$ read off the exponents ↗).
The minimum is taken in $N$ , through $\leq$ is a linear order on $N$ , not through the library's Maximum and minimum of a set, which is stated for real numbers. The values of $v_{p}$ are natural numbers, so no passage to $R$ is needed or wanted here.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list

Statement

Powers are the natural powers of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ and finite products those of The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity, both taken in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ . Call $p : r \to Z$ an injective list of primes when every $p_{i}$ is prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ) and $p_{i} = p_{j}$ forces $i = j$ (Injection, surjection, bijection).

Let $n \in Z$ with $n \geq 1$ and let $p : r \to Z$ be an injective list of primes such that every prime divisor of $n$ equals $p_{i}$ for some $i < r$ . Then, with $v_{q}$ as in The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ :

$n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ;
$v_{q} (n) = 0$ for every prime $q$ that is not among $p_{0}, \dots, p_{r - 1}$ ;
the exponents are determined by $n$ : if $e : r \to N$ and $n = \prod_{i < r} p_{i}^{e_{i}}$ , then $e_{j} = v_{p_{j}} (n)$ for every $j < r$ .

Clause 3 needs only injectivity of the list, not the covering hypothesis.

Facts & Assumptions

Given: The commutative monoid $(Z, \cdot, 1)$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , Semigroup and monoid); and the property $Q (r)$ : "for every $n \geq 1$ and every injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ".

[L1]

$\prod_{i < 0} g_{i} = e$ and $\prod_{i < σ (t)} g_{i} = (\prod_{i < t} g_{i}) g_{t}$ ; the value depends only on the entries named (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

[L2]

$g^{0} = e$ and $g^{σ (k)} = g^{k} g$ ; and $g^{m + n} = g^{m} g^{n}$ for natural exponents in a monoid (Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ , Exponent laws in a group: $g^{m + n} = g^{m} g^{n}$ and $(g^{m})^{n} = g^{m n}$ for all $m, n \in Z$ , and $(g h)^{n} = g^{n} h^{n}$ when $g$ and $h$ commute).

[L3]

For a prime $p$ and nonzero $a$ : $p^{k} \geq 1$ for every $k$ , so $p^{k} > 0$ and $p^{k} \neq 0$ ; $a = p^{v_{p} (a)} a^{'}$ with $a^{'} \neq 0$ and $p ∤ a^{'}$ ; $p^{k} ∣ a$ exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = 0$ ; and $v_{p} (p) = 1$ (For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

[L4]

For a prime $p$ and nonzero $a, b$ : $a b \neq 0$ and $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ ( $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero).

[L5]

Every integer $> 1$ has a prime divisor (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime); every prime $u$ satisfies $u > 1$ , and every positive divisor of a prime $w$ is $1$ or $w$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L6]

Divisibility is reflexive and transitive; $d ∣ u$ means $u = d c$ for some $c$ (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ , Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L7]

Induction on $N$ (The principle of mathematical induction).

[L8]

On $N$ : $m \leq n$ means $m + c = n$ for some $c$ (Order on the natural numbers); $σ (k) = k + 1$ and addition is commutative (Addition of natural numbers, Addition is commutative, The natural numbers $N$ (von Neumann)); $t < σ (t)$ and $i < σ (t)$ exactly when $i \leq t$ (On $N$ the order is membership: $m < n ⟺ m \in n$ ); $m < n$ exactly when $σ (m) \leq n$ (Discreteness: $σ (n)$ is the immediate successor).

[L9]

$Z$ is a commutative ring; its order is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication; $ι : N \to Z$ is injective and order preserving with image the nonnegative integers, $ι (0) = 0$ , $ι (1) = 1$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals, The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers).

Proof

technique · induction

1.1

Distinct primes do not divide one another: if $q$ and $w$ are primes with $q ∣ w$ , then $q$ is a positive divisor of $w$ (as $q > 1 > 0$ ) other than $1$ , so $q = w$ . Consequently $v_{q} (w) = 0$ whenever $q \neq w$ are primes.

L3L5L9

1.2

$Q (0)$ holds: an empty list contains no prime, so $n$ has no prime divisor at all; if $n > 1$ it would have one, so $n = 1$ , and $\prod_{i < 0} p_{i}^{v_{p_{i}} (n)} = 1 = n$ .

baseL1L5L9

1.3

Let $t \in N$ and assume $Q (t)$ .

1.4

Let $n \geq 1$ and let $p : σ (t) \to Z$ be an injective list of primes containing every prime divisor of $n$ . Write $π : = p_{t}$ , $v : = v_{π} (n)$ , and fix $n^{'}$ with $n = π^{v} n^{'}$ , $n^{'} \neq 0$ and $π ∤ n^{'}$ .

L3choose

2.1

For a prime $w$ and $k \in N$ : $v_{w} (w^{k}) = k$ , and $v_{q} (w^{k}) = 0$ for every prime $q \neq w$ . Both sets of $k$ for which these hold contain $0$ , since $w^{0} = 1$ and $v_{u} (1) = 0$ for every prime $u$ ; and if they hold at $k$ then, $w^{k}$ and $w$ being nonzero, additivity gives $v_{w} (w^{σ (k)}) = v_{w} (w^{k} w) = v_{w} (w^{k}) + v_{w} (w) = k + 1 = σ (k)$ and $v_{q} (w^{σ (k)}) = v_{q} (w^{k}) + v_{q} (w) = 0 + 0 = 0$ . Induction finishes both.

step 1.1L2L3L4L7L8

2.2

$n^{'} \geq 1$ : $π^{v} \geq 1 > 0$ and $n > 0$ , so $n^{'} \leq 0$ would make $π^{v} n^{'} \leq 0 < n$ ; hence $n^{'} > 0$ , and a positive integer is $\geq 1$ because $n^{'} = ι (j)$ with $j \neq 0$ , so $1 = σ (0) \leq j$ .

step 1.4L3L8L9

3.1

Clause 3. Let $p : r \to Z$ be an injective list of primes, $e : r \to N$ , and $M : = \prod_{i < r} p_{i}^{e_{i}}$ ; we claim $M \geq 1$ , that $v_{p_{j}} (M) = e_{j}$ for every $j < r$ , and that $v_{q} (M) = 0$ for every prime $q$ off the list. Let $T$ be the set of $r \in N$ for which this holds for all such $p$ and $e$ . Then $0 \in T$ : the empty product is $1$ , which is $\geq 1$ , has $v_{q} (1) = 0$ for every prime $q$ , and imposes no condition on indices. Suppose $r \in T$ and let $p : σ (r) \to Z$ be injective with primes and $e : σ (r) \to N$ . Writing $M^{'} : = \prod_{i < r} p_{i}^{e_{i}}$ we have $M = M^{'} \cdot p_{r}^{e_{r}}$ , with $M^{'} \geq 1 > 0$ and $p_{r}^{e_{r}} \geq 1 > 0$ , so $M \geq 1 > 0$ and both factors are nonzero; additivity then gives $v_{u} (M) = v_{u} (M^{'}) + v_{u} (p_{r}^{e_{r}})$ for every prime $u$ . Taking $u = p_{j}$ with $j < r$ gives $e_{j} + 0 = e_{j}$ , since $p_{j} \neq p_{r}$ by injectivity; taking $u = p_{r}$ gives $0 + e_{r} = e_{r}$ , since $p_{r}$ is off the list $p_{0}, \dots, p_{r - 1}$ ; and taking a prime $u$ off the whole list gives $0 + 0 = 0$ . So $σ (r) \in T$ , and $T = N$ by induction.

step 2.1L1L3L4L7L8L9

3.2

The restriction $p ↾ t$ is an injective list of primes containing every prime divisor of $n^{'}$ . Indeed if $q$ is prime with $q ∣ n^{'}$ then $q ∣ n$ , since $n = π^{v} n^{'}$ ; so $q = p_{i}$ for some $i < σ (t)$ ; and $q \neq π = p_{t}$ , because $π ∤ n^{'}$ ; hence $i \neq t$ , and $i < σ (t)$ gives $i \leq t$ , so $i < t$ .

step 1.4step 2.2L5L6L8

3.3

For $i < t$ we have $v_{p_{i}} (n) = v_{p_{i}} (π^{v}) + v_{p_{i}} (n^{'}) = 0 + v_{p_{i}} (n^{'}) = v_{p_{i}} (n^{'})$ , using additivity on the nonzero factors $π^{v}$ and $n^{'}$ , and step 2.1 with $p_{i} \neq π$ , which holds by injectivity since $i < t$ .

step 2.1step 1.4step 2.2L3L4L8

4.1

By step 1.3 applied to $n^{'}$ and $p ↾ t$ : $n^{'} = \prod_{i < t} p_{i}^{v_{p_{i}} (n^{'})}$ .

step 1.3step 2.2step 3.2

5.1

Therefore $\prod_{i < σ (t)} p_{i}^{v_{p_{i}} (n)} = (\prod_{i < t} p_{i}^{v_{p_{i}} (n)}) \cdot π^{v_{π} (n)} = (\prod_{i < t} p_{i}^{v_{p_{i}} (n^{'})}) \cdot π^{v} = n^{'} π^{v} = n$ , so $Q (σ (t))$ holds.

step 1.4step 4.1step 3.3L1L9

6.1

With step 1.2 as base, induction gives $Q (r)$ for every $r \in N$ , which is clause 1. Clause 2 follows because a prime $q$ off the list does not divide $n$ — otherwise it would be a prime divisor of $n$ and hence on the list — so $v_{q} (n) = 0$ ; and clause 3 is step 3.1.

step 3.1step 1.2step 5.1L3L7discharge-induction∎

Remarks

This is The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ read by exponents rather than by lists, not a further theorem. A list of primes with repetitions becomes an injective list with multiplicities, and the multiplicity of $p_{i}$ is exactly $v_{p_{i}} (n)$ ; uniqueness up to a permutation becomes clause 3, that the exponent vector is determined.
There is deliberately no product over all primes. The familiar notation $\prod_{p} p^{v_{p} (n)}$ abbreviates a product with finitely many factors different from $1$ , and an indexed product with finite support is not available at this point in the library — The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity multiplies a finite list. The honest form quantifies over a finite injective list covering the prime divisors of $n$ and adds clause 2, which says every prime off the list contributes exponent $0$ . Nothing is lost: any two such lists agree on the exponents by clause 3.
Why injectivity is a hypothesis. Without it clause 3 fails outright: with $r = 2$ , $p_{0} = p_{1} = 2$ and $(e_{0}, e_{1}) = (1, 1)$ or $(2, 0)$ , both products are $4$ , so the exponent vector is not determined. Injectivity is what makes $v_{p_{j}}$ read off one multiplicity rather than a sum of several.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

For positive integers $a$ and $b$ : $a ∣ b$ if and only if $v_{p} (a) \leq v_{p} (b)$ for every prime $p$

Statement

Let $a, b \in Z$ with $a \geq 1$ and $b \geq 1$ , and let $v_{p}$ be the $p$ -adic valuation of The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ . Then

$a ∣ b ⟺ v_{p} (a) \leq v_{p} (b) for every prime p .$

Both valuations are defined, since $a$ and $b$ are nonzero.

Facts & Assumptions

Given: The property $R (k)$ : "for every $b \geq 1$ , if $ι (k) \geq 1$ and $v_{p} (ι (k)) \leq v_{p} (b)$ for every prime $p$ , then $ι (k) ∣ b$ ", where $ι : N \to Z$ is the embedding of The naturals embed in the integers.

[L1]

For a prime $p$ and nonzero $u, v$ : $u v \neq 0$ and $v_{p} (u v) = v_{p} (u) + v_{p} (v)$ ( $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero).

[L2]

For a prime $p$ and nonzero $u$ : $v_{p} (u) \geq 1$ exactly when $p ∣ u$ (For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

[L3]

Every integer $> 1$ has a prime divisor (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime); every prime satisfies $q > 1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L4]

Strong induction on $N$ (Strong (complete) induction).

[L5]

$d ∣ u$ means $u = d c$ for some $c$ ; divisibility is reflexive and transitive, and $d ∣ u$ implies $d ∣ u c$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L6]

A product of two nonzero integers is nonzero (The integers have no zero divisors; multiplicative cancellation).

[L7]

On $N$ : $m \leq n$ means $m + c = n$ for some $c$ , so $m \leq m + n$ always (Order on the natural numbers, Addition of natural numbers); $m + x \leq m + y$ holds exactly when $x \leq y$ (Order is compatible with addition); $m < n$ exactly when $σ (m) \leq n$ , and $1 = σ (0)$ (Discreteness: $σ (n)$ is the immediate successor, The natural numbers $N$ (von Neumann)).

[L8]

$Z$ is a commutative ring; its order is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals, The integers form a totally ordered ring, Order on the integers).

[L9]

$ι$ is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers, with $ι (0) = 0$ and $ι (1) = 1$ (The naturals embed in the integers).

Proof

technique · induction

1.1

$0 < 1$ , since $1 = ι (1)$ is nonnegative and differs from $0 = ι (0)$ ; and every integer $x > 0$ satisfies $x \geq 1$ , because $x = ι (j)$ with $j \neq 0$ , so $1 = σ (0) \leq j$ and $ι$ preserves the order.

L7L9

1.2

The forward implication. Suppose $a ∣ b$ and fix $c$ with $b = a c$ . Then $c \neq 0$ , since $b \neq 0$ , so [L1] gives $v_{p} (b) = v_{p} (a) + v_{p} (c) \geq v_{p} (a)$ for every prime $p$ .

L1L5L7L8

1.3

Let $k \in N$ and assume $R (j)$ for every $j < k$ .

2.1

$R (0)$ holds vacuously: $ι (0) = 0$ and $0 \geq 1$ is false.

basestep 1.1L9

2.2

Put $a : = ι (k)$ and suppose $a \geq 1$ , and let $b \geq 1$ satisfy $v_{p} (a) \leq v_{p} (b)$ for every prime $p$ . If $a = 1$ then $a ∣ b$ , so assume $a > 1$ .

step 1.1L5L8

3.1

Fix a prime $q$ with $q ∣ a$ , and fix $a_{1}$ with $a = q a_{1}$ . Then $v_{q} (a) \geq 1$ , hence $v_{q} (b) \geq 1$ by hypothesis, so $q ∣ b$ ; fix $b_{1}$ with $b = q b_{1}$ .

step 2.2L2L3L5choose

4.1

$a_{1} \geq 1$ and $b_{1} \geq 1$ : they are nonzero because $a$ and $b$ are, and if $a_{1} < 0$ then $q a_{1} < 0$ contradicting $a > 0$ , so $a_{1} > 0$ and hence $a_{1} \geq 1$ ; the same argument applies to $b_{1}$ .

step 1.1step 3.1L6L8

5.1

$a_{1} < a$ : since $q > 1$ we have $q - 1 > 0$ , and $a_{1} > 0$ , so $a - a_{1} = (q - 1) a_{1} > 0$ .

step 3.1step 4.1L3L8

5.2

For every prime $p$ : $v_{p} (q) + v_{p} (a_{1}) = v_{p} (a) \leq v_{p} (b) = v_{p} (q) + v_{p} (b_{1})$ , so $v_{p} (a_{1}) \leq v_{p} (b_{1})$ by cancellation of $v_{p} (q)$ in the order of $N$ .

step 2.2step 3.1step 4.1L1L7

6.1

Write $a_{1} = ι (j)$ ; then $j < k$ , since otherwise $k \leq j$ and the order-preserving $ι$ would give $a \leq a_{1}$ , contradicting step 5.1. By step 1.3 applied to $j$ , together with steps 4.1 and 5.2, $a_{1} ∣ b_{1}$ .

step 1.3step 4.1step 5.1step 5.2L9

7.1

Hence $b = q b_{1} = q (a_{1} c) = (q a_{1}) c = a c$ for the $c$ with $b_{1} = a_{1} c$ , so $a ∣ b$ and $R (k)$ holds.

step 3.1step 6.1L5L8

8.1

Steps 2.2 and 7.1 cover both possibilities for $a$ , so $R$ at $k$ follows from $R$ below $k$ ; with step 2.1, strong induction gives $R (k)$ for every $k$ . Since a positive integer $a$ is $ι (k)$ for a unique $k$ , that is the reverse implication, and step 1.2 is the forward one.

step 1.2step 2.1step 2.2step 7.1L4L9discharge-induction∎

Remarks

No canonical factorisation is needed. The reverse implication is often proved by writing both integers over a common list of primes and comparing exponents; the descent used here peels off one prime divisor at a time and needs only additivity of $v_{p}$ ( $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero) and the existence of a prime divisor. The factorisation route is available too, via For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list, and gives the same statement.
Positivity is a real hypothesis, and only mildly so. $v_{p}$ is undefined at $0$ , so the pair must avoid it; signs are harmless, since $a ∣ b$ is unchanged by replacing either argument by its negative (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ) and $v_{p} (- u) = v_{p} (u)$ for the same reason. The statement is therefore about $∣ a ∣$ and $∣ b ∣$ in substance.
The valuation criterion is the shape the $\gcd$ and $lcm$ formulas need, and For positive integers $a$ and $b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; so the exponent-wise greatest common divisor is the $\gcd$ of the divisibility page and not a second notion uses exactly this lemma to check the characterisation of $\gcd$ proved on the divisibility page.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

For positive integers $a$ and $b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; so the exponent-wise greatest common divisor is the $\gcd$ of the divisibility page and not a second notion

Statement

Let $a, b \in Z$ with $a \geq 1$ and $b \geq 1$ , write $g : = \gcd (a, b)$ (Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ) and $ℓ : = lcm (a, b)$ (Common multiple, and the least common multiple $lcm (a, b)$ , taken to be $0$ when $a = 0$ or $b = 0$ ), and let $p$ be any prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ). Then $g \geq 1$ and $ℓ \geq 1$ , so all four valuations below are defined (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ), and

$v_{p} (g) = \min {v_{p} (a), v_{p} (b)}$ ;
$v_{p} (ℓ) = \max {v_{p} (a), v_{p} (b)}$ ,

the minimum and maximum being taken in $N$ , whose order is total ( $\leq$ is a linear order on $N$ ).

The exponent recipe does not define a second notion. If $d \geq 1$ satisfies $v_{p} (d) = \min {v_{p} (a), v_{p} (b)}$ for every prime $p$ , then $d = \gcd (a, b)$ ; and if $d \geq 1$ satisfies $v_{p} (d) = \max {v_{p} (a), v_{p} (b)}$ for every prime $p$ , then $d = lcm (a, b)$ .

Facts & Assumptions

Given: Integers $a, b \geq 1$ ; $g : = \gcd (a, b)$ , $ℓ : = lcm (a, b)$ ; and, for a prime $p$ , $m_{p} : = \min {v_{p} (a), v_{p} (b)}$ and $M_{p} : = \max {v_{p} (a), v_{p} (b)}$ .

[L1]

$\gcd (u, v) \geq 1$ unless $u = v = 0$ ; $\gcd (u, v)$ is a common divisor of $u$ and $v$ , and every common divisor of $u$ and $v$ divides it (Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ , $\gcd$ is symmetric and unchanged by signs: $\gcd (a, b) = \gcd (b, a) = \gcd (∣ a ∣, ∣ b ∣)$ ; moreover $\gcd (a, 0) = ∣ a ∣$ , $\gcd (a, 1) = 1$ , $\gcd (a, a) = ∣ a ∣$ , and $\gcd (a, b) \geq 1$ unless $a = b = 0$ , Every common divisor of $a$ and $b$ divides $\gcd (a, b)$ ; consequently $d = \gcd (a, b)$ exactly when $d \geq 0$ , $d ∣ a$ , $d ∣ b$ , and every common divisor of $a$ and $b$ divides $d$ — a characterisation that holds at $(a, b) = (0, 0)$ as well).

[L2]

For $u, v$ both nonzero, $lcm (u, v)$ is the least positive common multiple of $u$ and $v$ ; in particular $u ∣ lcm (u, v)$ and $v ∣ lcm (u, v)$ (Common multiple, and the least common multiple $lcm (a, b)$ , taken to be $0$ when $a = 0$ or $b = 0$ ).

[L3]

$\gcd (u, v) \cdot lcm (u, v) = ∣ u v ∣$ , and every common multiple of $u$ and $v$ is a multiple of $lcm (u, v)$ (Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ , and $\gcd (a, b) \cdot lcm (a, b) = ∣ a b ∣$ ).

[L4]

For positive $u, w$ : $u ∣ w$ exactly when $v_{q} (u) \leq v_{q} (w)$ for every prime $q$ (For positive integers $a$ and $b$ : $a ∣ b$ if and only if $v_{p} (a) \leq v_{p} (b)$ for every prime $p$ ).

[L5]

For a prime $p$ and nonzero $u, w$ : $v_{p} (u w) = v_{p} (u) + v_{p} (w)$ ( $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero).

[L6]

For a prime $p$ and nonzero $u$ : $p^{k} ∣ u$ exactly when $k \leq v_{p} (u)$ ; and $p^{k} \geq 1$ for every $k$ (For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ , Semigroup and monoid, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L7]

$u ∣ w$ and $w ∣ u$ hold together exactly when $∣ u ∣ = ∣ w ∣$ (For integers $a$ and $b$ the following are equivalent: $a ∣ b$ and $b ∣ a$ ; $b = u a$ for a unit $u$ ; $∣ a ∣ = ∣ b ∣$ . Being associates is an equivalence relation whose class of $a$ is ${a, - a}$ ); $∣ x ∣ = x$ for $x \geq 0$ (The absolute value $∣ a ∣$ of an integer, Absolute value in $Z$ : $∣ a ∣ \geq 0$ ; $∣ a ∣ = 0$ exactly when $a = 0$ ; $∣ - a ∣ = ∣ a ∣$ ; $∣ a b ∣ = ∣ a ∣ ∣ b ∣$ ; $- ∣ a ∣ \leq a \leq ∣ a ∣$ ; and $∣ a ∣ \leq c$ exactly when $- c \leq a \leq c$ ).

[L9]

On $N$ : the order is total, so any two naturals have a minimum and a maximum ( $\leq$ is a linear order on $N$ ); addition is commutative (Addition is commutative) and cancellative (Addition is cancellative); $m \leq n$ means $m + c = n$ for some $c$ (Order on the natural numbers, Addition of natural numbers); $m < n$ exactly when $σ (m) \leq n$ , and $1 = σ (0)$ (Discreteness: $σ (n)$ is the immediate successor, The natural numbers $N$ (von Neumann)).

[L10]

$Z$ is a commutative ring; its order is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication; a product of two nonzero integers is nonzero and cancellation holds (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals, The integers form a totally ordered ring, Order on the integers, The integers have no zero divisors; multiplicative cancellation).

[L11]

$ι : N \to Z$ is injective and order preserving with image the nonnegative integers, $ι (0) = 0$ , $ι (1) = 1$ (The naturals embed in the integers).

Proof

technique · direct

1.1

$0 < 1$ , and every integer $x > 0$ satisfies $x \geq 1$ : $x = ι (j)$ with $j \neq 0$ , so $1 = σ (0) \leq j$ and $ι$ preserves the order.

L9L11

1.2

For naturals $x, y$ the minimum and maximum exist by totality, and $\min {x, y} + \max {x, y} = x + y$ : if $x \leq y$ the left side is $x + y$ , and if $y \leq x$ it is $y + x = x + y$ .

2.1

$a > 0$ and $b > 0$ , so $a \neq 0$ , $b \neq 0$ and $(a, b) \neq (0, 0)$ ; hence $g \geq 1$ , and $ℓ$ is the least positive common multiple of $a$ and $b$ , so $ℓ \geq 1$ . All of $a, b, g, ℓ$ are nonzero and their valuations are defined.

step 1.1L1L2L10

3.1

$g ∣ a$ and $g ∣ b$ , so $v_{p} (g) \leq v_{p} (a)$ and $v_{p} (g) \leq v_{p} (b)$ by [L4]; hence $v_{p} (g) \leq m_{p}$ .

step 2.1step 1.2L1L4

3.2

Conversely $m_{p} \leq v_{p} (a)$ and $m_{p} \leq v_{p} (b)$ , so $p^{m_{p}} ∣ a$ and $p^{m_{p}} ∣ b$ by [L6]; thus $p^{m_{p}}$ is a common divisor of $a$ and $b$ and therefore divides $g$ . Since $g \neq 0$ , [L6] applied to $g$ gives $m_{p} \leq v_{p} (g)$ .

step 2.1step 1.2L1L6

3.3

$a b > 0$ , so $∣ a b ∣ = a b$ , and [L3] gives $g ℓ = a b$ . Applying [L5] to the nonzero pairs $(g, ℓ)$ and $(a, b)$ gives $v_{p} (g) + v_{p} (ℓ) = v_{p} (a b) = v_{p} (a) + v_{p} (b)$ .

step 2.1L3L5L7L10

4.1

Clause 1: $v_{p} (g) = m_{p}$ , by antisymmetry of the order on $N$ .

step 3.1step 3.2L9

5.1

Clause 2: substituting step 4.1 and step 1.2, $m_{p} + v_{p} (ℓ) = v_{p} (a) + v_{p} (b) = m_{p} + M_{p}$ , so $v_{p} (ℓ) = M_{p}$ by cancellation of addition on $N$ .

step 1.2step 4.1step 3.3L9

5.2

Clause 3, first half. Let $d \geq 1$ satisfy $v_{p} (d) = m_{p}$ for every prime $p$ . Then $v_{p} (d) = v_{p} (g)$ for every $p$ by step 4.1, so $d ∣ g$ and $g ∣ d$ by [L4], hence $∣ d ∣ = ∣ g ∣$ ; both are positive, so $d = g$ .

step 2.1step 4.1L4L7

6.1

Clause 3, second half, by the same argument with step 5.1 in place of step 4.1: $v_{p} (d) = M_{p} = v_{p} (ℓ)$ for every $p$ forces $d ∣ ℓ$ and $ℓ ∣ d$ , hence $d = ℓ$ .

step 2.1step 5.1L4L7

7.1

Clauses 1, 2 and 3 are established.

step 4.1step 5.1step 5.2step 6.1∎

Remarks

This is the agreement item for the two pages. The exponent-wise recipe $\min$ for $\gcd$ and $\max$ for $lcm$ is a computation of the $\gcd$ and $lcm$ defined on the divisibility page, not a rival definition: clause 3 says any positive integer with the right valuations is that $\gcd$ , respectively that $lcm$ . Nothing here redefines either symbol.
The identity $\min + \max =$ sum recovers the product formula. Adding clauses 1 and 2 gives $v_{p} (g) + v_{p} (ℓ) = v_{p} (a) + v_{p} (b) = v_{p} (a b)$ for every $p$ , which is $g ℓ = ∣ a b ∣$ of Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ , and $\gcd (a, b) \cdot lcm (a, b) = ∣ a b ∣$ read through valuations. That is a consistency check, and in this proof the implication was used in the other direction: the product formula is what pins $v_{p} (ℓ)$ from above. The independent bound $M_{p} \leq v_{p} (ℓ)$ , from $a ∣ ℓ$ and $b ∣ ℓ$ , also follows from [L2] and [L4] and agrees.
Both arguments are restricted to positive integers, and the restriction is not cosmetic. $v_{p} (0)$ is undefined (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ), so the pair $(0, 0)$ — the one where the $\gcd$ convention lives — is out of scope entirely, and a negative argument is handled first by $\gcd (a, b) = \gcd (∣ a ∣, ∣ b ∣)$ ( $\gcd$ is symmetric and unchanged by signs: $\gcd (a, b) = \gcd (b, a) = \gcd (∣ a ∣, ∣ b ∣)$ ; moreover $\gcd (a, 0) = ∣ a ∣$ , $\gcd (a, 1) = 1$ , $\gcd (a, a) = ∣ a ∣$ , and $\gcd (a, b) \geq 1$ unless $a = b = 0$ ).
The minimum and maximum are taken in $N$ , through the totality of its order ( $\leq$ is a linear order on $N$ ), and not through the library's Maximum and minimum of a set, which is stated for real numbers. Valuations are natural numbers and there is no reason to leave $N$ .

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The $p$ -adic valuation extends to the nonzero rationals by $v_{p} (a / b) : = v_{p} (a) - v_{p} (b) \in Z$ , independently of the representation; it satisfies $v_{p} (x y) = v_{p} (x) + v_{p} (y)$ , and $v_{p} (x + y) \geq \min {v_{p} (x), v_{p} (y)}$ whenever $x$ , $y$ and $x + y$ are nonzero

Statement

Let $p$ be a prime (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ). A rational is a class $[(a, b)]$ of pairs of integers with $b \neq 0$ , written $a / b$ (The rationals as equivalence classes of pairs of integers), and $[(a, b)] \neq 0$ holds exactly when $a \neq 0$ (Arithmetic on the rationals). Write $ι : N \to Z$ for the embedding of The naturals embed in the integers and $j : Z \to Q$ , $j (k) = [(k, 1)]$ , for that of The integers embed in the rationals.

For a nonzero rational $x = [(a, b)]$ set

$v_{p} (x) : = ι (v_{p} (a)) - ι (v_{p} (b)) \in Z,$

with $v_{p}$ on nonzero integers as in The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ . Then:

The value does not depend on the representative, so $v_{p}$ is a well defined function from the nonzero rationals to $Z$ .
It extends the integer valuation: $v_{p} (j (a)) = ι (v_{p} (a))$ for every nonzero integer $a$ .
$v_{p} (x y) = v_{p} (x) + v_{p} (y)$ for all nonzero rationals $x, y$ .
$v_{p} (x + y) \geq \min {v_{p} (x), v_{p} (y)}$ whenever $x$ , $y$ and $x + y$ are all nonzero, the minimum being taken in the totally ordered $Z$ .

Unlike its restriction to $Z$ , this valuation takes integer values, which is why the difference is formed after transporting the two natural numbers into $Z$ along $ι$ .

Facts & Assumptions

Given: A prime $p$ ; nonzero rationals with representatives $x = [(a, b)]$ , $y = [(c, d)]$ , where $a, b, c, d \in Z$ are all nonzero.

[L1]

$[(a, b)] = [(c, d)]$ exactly when $a d = c b$ ; $Q$ consists of such classes with $b \neq 0$ (The rationals as equivalence classes of pairs of integers).

[L2]

$[(a, b)] + [(c, d)] = [(a d + c b, b d)]$ , $[(a, b)] \cdot [(c, d)] = [(a c, b d)]$ , $0 = [(0, 1)]$ and $1 = [(1, 1)]$ (Arithmetic on the rationals); $Q$ is a field (The rationals form a field, Field).

[L3]

$j (k) = [(k, 1)]$ is injective and preserves addition, multiplication and order (The integers embed in the rationals).

[L4]

For a prime $p$ and nonzero integers $u, w$ : $u w \neq 0$ and $v_{p} (u w) = v_{p} (u) + v_{p} (w)$ ; and $v_{p} (u + w) \geq \min {v_{p} (u), v_{p} (w)}$ when $u$ , $w$ and $u + w$ are nonzero ( $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero).

[L5]

$v_{p} (1) = 0$ (For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

[L6]

$ι$ is injective and preserves addition, multiplication and order, with image the nonnegative integers and $ι (0) = 0$ , $ι (1) = 1$ (The naturals embed in the integers).

[L7]

A product of two nonzero integers is nonzero (The integers have no zero divisors; multiplicative cancellation).

[L8]

$Z$ is a commutative ring: addition and multiplication are associative and commutative, $x + 0 = x$ , and every $x$ has an additive inverse $- x$ , with $- (- x) = x$ and $- (u + w) = (- u) + (- w)$ ; we write $u - w$ for $u + (- w)$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L9]

The order on $Z$ is total, antisymmetric and transitive and is compatible with addition, so $u \leq w$ implies $u + z \leq w + z$ (The integers form a totally ordered ring, Order on the integers).

[L10]

The order on $N$ is total, so any two naturals have a minimum; addition on $N$ is commutative ( $\leq$ is a linear order on $N$ , Addition is commutative, Order on the natural numbers, Addition of natural numbers, The natural numbers $N$ (von Neumann)).

Proof

technique · direct

1.1

If $x = [(a, b)]$ is a nonzero rational then $a \neq 0$ and $b \neq 0$ , so $v_{p} (a)$ and $v_{p} (b)$ are both defined.

L1L2

2.1

Clause 1. Suppose $[(a, b)] = [(c, d)]$ with all four entries nonzero. Then $a d = c b$ , and both sides are nonzero, so [L4] gives $v_{p} (a) + v_{p} (d) = v_{p} (c) + v_{p} (b)$ in $N$ . Applying the addition-preserving $ι$ and rearranging in $Z$ gives $ι (v_{p} (a)) - ι (v_{p} (b)) = ι (v_{p} (c)) - ι (v_{p} (d))$ .

step 1.1L1L4L6L7L8

2.2

Clause 4. Assume $x$ , $y$ and $x + y$ are nonzero. Then $x + y = [(a d + c b, b d)]$ with $b d \neq 0$ , and $a d + c b \neq 0$ because $x + y \neq 0$ ; also $a d \neq 0$ and $c b \neq 0$ .

step 1.1L1L2L7

3.1

Clause 2. For a nonzero integer $a$ , $j (a) = [(a, 1)]$ , so $v_{p} (j (a)) = ι (v_{p} (a)) - ι (v_{p} (1)) = ι (v_{p} (a)) - 0 = ι (v_{p} (a))$ .

step 2.1L3L5L6L8

3.2

Clause 3. $x y = [(a c, b d)]$ , with $a c \neq 0$ and $b d \neq 0$ , so $v_{p} (x y) = ι (v_{p} (a c)) - ι (v_{p} (b d)) = ι (v_{p} (a) + v_{p} (c)) - ι (v_{p} (b) + v_{p} (d))$ .

step 1.1step 2.1L2L4L7

3.3

By [L4], $v_{p} (a d + c b) \geq \min {v_{p} (a d), v_{p} (c b)} = \min {v_{p} (a) + v_{p} (d), v_{p} (c) + v_{p} (b)}$ ; applying the order-preserving injection $ι$ turns this into the same inequality between the corresponding integers.

step 2.2L4L6L10

4.1

Since $ι$ preserves addition, that value is $(ι (v_{p} (a)) + ι (v_{p} (c))) - (ι (v_{p} (b)) + ι (v_{p} (d)))$ , which rearranges in the commutative ring $Z$ to $(ι (v_{p} (a)) - ι (v_{p} (b))) + (ι (v_{p} (c)) - ι (v_{p} (d))) = v_{p} (x) + v_{p} (y)$ .

step 3.2L6L8

4.2

Subtracting the integer $ι (v_{p} (b)) + ι (v_{p} (d)) = ι (v_{p} (b d))$ from both sides, which preserves the order, and using that subtraction of a fixed element commutes with taking the smaller of two integers, gives $v_{p} (x + y) \geq \min {ι (v_{p} (a)) - ι (v_{p} (b)), ι (v_{p} (c)) - ι (v_{p} (d))} = \min {v_{p} (x), v_{p} (y)}$ .

step 2.2step 3.3L4L6L8L9

5.1

Clauses 1 to 4 are established.

step 2.1step 3.1step 4.1step 4.2∎

Remarks

Relation to the published $2$ -adic example. The published The $2$ -adic absolute value gives an ultrametric on $Q$ , in which every triangle is isosceles and every point of a ball is a centre ↗ records that the general $p$ -adic machinery is available, but nevertheless develops $p = 2$ from parity alone. The present lemma supplies the general algebraic extension: representation-independence is exactly the assertion that $a d = c b$ forces the two candidate values to agree.
Nothing metric is stated here, deliberately. The $p$ -adic absolute value $∣ x ∣_{p} = p^{- v_{p} (x)}$ and the ultrametric it induces need real powers with integer exponents and the definition of a metric space, all of which live far above this page in the library's order; they are not defined here and nothing on this page depends on them. What is proved is the algebra: a homomorphism from the nonzero rationals under multiplication to $Z$ under addition, satisfying the ultrametric inequality on valuations.
The values are integers, not naturals. $v_{p} (1 / p) = - 1$ , so the extension genuinely leaves $N$ ; that is why the two integer valuations are transported along $ι$ before being subtracted. As on $Z$ , the value at $0$ is left undefined (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ).

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

A rational root of $x^{k} = m$ is an integer: if $k \geq 1$ , $m \in Z$ , $x \in Q$ and $x^{k}$ is the image of $m$ , then $x$ is the image of an integer

Statement

$Q$ is a field (The rationals form a field, Field), so $(Q, \cdot, 1)$ is a commutative monoid and natural powers $x^{k}$ are defined in it by Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ . Write $j : Z \to Q$ , $j (u) = [(u, 1)]$ , for the embedding of The integers embed in the rationals.

Let $k \in N$ with $k \geq 1$ , let $m \in Z$ , and let $x \in Q$ satisfy

$x^{k} = j (m) .$

Then $x = j (z)$ for some $z \in Z$ .

Facts & Assumptions

Given: $k \in N$ with $k \geq 1$ , $m \in Z$ , and $x \in Q$ with $x^{k} = j (m)$ .

[L1]

A rational is a class $[(u, w)]$ with $u, w \in Z$ , $w \neq 0$ , and $[(u, w)] = [(u^{'}, w^{'})]$ exactly when $u w^{'} = u^{'} w$ (The rationals as equivalence classes of pairs of integers).

[L2]

$[(u, w)] \cdot [(u^{'}, w^{'})] = [(u u^{'}, w w^{'})]$ , $0 = [(0, 1)]$ , $1 = [(1, 1)]$ , and $[(u, w)] \neq 0$ exactly when $u \neq 0$ (Arithmetic on the rationals).

[L3]

$Q$ is a field: multiplication is associative and commutative on all of $Q$ with $y \cdot 1 = y$ and $y \cdot 0 = 0$ (The rationals form a field, Field), so $(Q, \cdot, 1)$ is a commutative monoid (Semigroup and monoid).

[L4]

$g^{0} = e$ and $g^{σ (t)} = g^{t} \cdot g$ in a monoid (Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ ).

[L5]

$j (u) = [(u, 1)]$ is injective and preserves addition and multiplication (The integers embed in the rationals).

[L6]

For $d : = \gcd (u, w) \neq 0$ there are unique $u / d$ and $w / d$ with $u = d (u / d)$ , $w = d (w / d)$ , and $\gcd (u / d, w / d) = 1$ (If $d = \gcd (a, b)$ is nonzero then $a / d$ and $b / d$ are coprime, Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ , Coprime integers: $\gcd (a, b) = 1$ ).

[L7]

$\gcd (u, w) \geq 1$ unless $u = w = 0$ ( $\gcd$ is symmetric and unchanged by signs: $\gcd (a, b) = \gcd (b, a) = \gcd (∣ a ∣, ∣ b ∣)$ ; moreover $\gcd (a, 0) = ∣ a ∣$ , $\gcd (a, 1) = 1$ , $\gcd (a, a) = ∣ a ∣$ , and $\gcd (a, b) \geq 1$ unless $a = b = 0$ , Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ).

[L8]

If $\gcd (u, w) = 1$ then the set of common divisors of $u$ and $w$ is exactly ${1, - 1}$ ( $a$ and $b$ are coprime if and only if $a x + b y = 1$ for some integers $x, y$ ; and in that case the only common divisors of $a$ and $b$ are $1$ and $- 1$ , $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L9]

If $q$ is prime and $q ∣ u v$ then $q ∣ u$ or $q ∣ v$ (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L10]

Every integer $> 1$ has a prime divisor, and every prime $q$ satisfies $q > 1$ (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime, Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L11]

Divisibility is reflexive and transitive, $d ∣ u$ implies $d ∣ u c$ , and $d ∣ u$ means $u = d c$ for some $c$ (Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ , Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L12]

Induction on $N$ (The principle of mathematical induction); every natural $\neq 0$ is a successor (Every nonzero natural number is a successor); $m < n$ exactly when $σ (m) \leq n$ , and $1 = σ (0)$ (Discreteness: $σ (n)$ is the immediate successor, The natural numbers $N$ (von Neumann), Order on the natural numbers).

[L14]

$u ∣ 1$ exactly when $u = 1$ or $u = - 1$ ( $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ ).

[L13]

A product of two nonzero integers is nonzero (The integers have no zero divisors; multiplicative cancellation); $Z$ is a commutative ring whose order is total, antisymmetric and transitive (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals, The integers form a totally ordered ring, Order on the integers); $ι : N \to Z$ is injective and order preserving with image the nonnegative integers (The naturals embed in the integers).

Proof

technique · direct

1.1

$0 < 1$ in $Z$ , and every integer $y > 0$ satisfies $y \geq 1$ : $y = ι (t)$ with $t \neq 0$ , so $1 = σ (0) \leq t$ and $ι$ preserves the order.

L12L13

1.2

For integers $u, w$ with $w \neq 0$ and every $t \in N$ : $w^{t} \neq 0$ and $[(u, w)]^{t} = [(u^{t}, w^{t})]$ , powers on the left in $Q$ and on the right in $Z$ . The set of $t$ for which this holds contains $0$ , since $w^{0} = 1 \neq 0$ and $[(u, w)]^{0} = 1 = [(1, 1)] = [(u^{0}, w^{0})]$ ; and if it holds at $t$ then $w^{σ (t)} = w^{t} w \neq 0$ and $[(u, w)]^{σ (t)} = [(u^{t}, w^{t})] \cdot [(u, w)] = [(u^{t} u, w^{t} w)] = [(u^{σ (t)}, w^{σ (t)})]$ . Induction finishes it.

L1L2L4L12L13

1.3

Suppose first $x = 0$ . Since $k \geq 1$ , write $k = σ (t)$ ; then $x^{k} = x^{t} \cdot 0 = 0 = j (0)$ , so $j (m) = j (0)$ and $m = 0$ by injectivity of $j$ ; and $x = 0 = j (0)$ is the image of an integer.

L3L4L5L12

1.4

Suppose instead $x \neq 0$ , and write $x = [(a, b)]$ with $b \neq 0$ ; then $a \neq 0$ . If $b < 0$ , replace $(a, b)$ by $(- a, - b)$ , which represents the same rational because $a (- b) = (- a) b$ ; so we may assume $b > 0$ .

L1L2L13choose

2.1

For a prime $q$ , an integer $u$ and $t \geq 1$ : if $q ∣ u^{t}$ then $q ∣ u$ . Let $S$ be the set of $t$ for which this implication holds; $0 \in S$ vacuously, since $t \geq 1$ fails there. Suppose $t \in S$ and $q ∣ u^{σ (t)} = u^{t} u$ . By [L9] either $q ∣ u^{t}$ or $q ∣ u$ ; in the second case we are done, and in the first, if $t \geq 1$ then $t \in S$ gives $q ∣ u$ , while if $t = 0$ then $u^{t} = 1$ and $q ∣ 1$ is impossible for a prime, since $q > 1 > 0 > - 1$ would then be contradicted. So $σ (t) \in S$ and $S = N$ .

step 1.1L4L9L10L12L13L14

2.2

Put $d : = \gcd (a, b)$ ; since $a \neq 0$ we have $d \geq 1 > 0$ , so $d \neq 0$ . Put $a_{1} : = a / d$ and $b_{1} : = b / d$ , so that $a = d a_{1}$ , $b = d b_{1}$ and $\gcd (a_{1}, b_{1}) = 1$ .

step 1.1step 1.4L6L7L13

3.1

$a_{1} \neq 0$ and $b_{1} > 0$ : if $a_{1} = 0$ then $a = 0$ , and if $b_{1} \leq 0$ then $b = d b_{1} \leq 0$ , both contrary to step 1.4. Moreover $[(a, b)] = [(a_{1}, b_{1})]$ , because $a b_{1} = (d a_{1}) b_{1} = a_{1} (d b_{1}) = a_{1} b$ .

step 1.4step 2.2L1L13

4.1

By step 1.2, $x^{k} = [(a_{1}, b_{1})]^{k} = [(a_{1}^{k}, b_{1}^{k})]$ , and this equals $j (m) = [(m, 1)]$ , so $a_{1}^{k} \cdot 1 = m b_{1}^{k}$ , that is $a_{1}^{k} = m b_{1}^{k}$ .

step 1.2step 3.1L1L5L13

5.1

Suppose $b_{1} > 1$ and fix a prime $q$ with $q ∣ b_{1}$ . Since $k \geq 1$ , write $k = σ (t)$ ; then $b_{1}^{k} = b_{1}^{t} b_{1}$ , so $b_{1} ∣ b_{1}^{k}$ and hence $q ∣ b_{1}^{k}$ by transitivity. Then $q ∣ m b_{1}^{k} = a_{1}^{k}$ , so $q ∣ a_{1}$ by step 2.1.

step 2.1step 4.1L4L10L11L12

6.1

So $q$ is a common divisor of $a_{1}$ and $b_{1}$ , which are coprime, hence $q = 1$ or $q = - 1$ by [L8] and [L14]; but $q > 1 > 0 > - 1$ , a contradiction. Therefore $b_{1} \leq 1$ , and $b_{1} > 0$ gives $b_{1} \geq 1$ , so $b_{1} = 1$ .

step 1.1step 2.2step 3.1step 5.1L8L10L13L14

7.1

Hence $x = [(a_{1}, 1)] = j (a_{1})$ is the image of an integer; together with step 1.3 this covers both cases.

step 1.3step 3.1step 6.1L5∎

Remarks

The instances live on the companion page. No rational squares to $3$ or to $6$ , and none cubes to $2$ : each is this corollary followed by ruling out the finitely many integer candidates by size, and all three are worked out in No rational squares to $3$ or to $6$ , and none cubes to $2$ : three instances of the rational-root corollary ↗.
The argument lives inside $Q$ and never enters $R$ . No $n$ -th root is asserted to exist; the hypothesis is that a rational $x$ already satisfies $x^{k} = j (m)$ , and the conclusion is about its denominator. The powers are monoid powers of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ in $(Q, \cdot, 1)$ , not Integer powers $a^{m}$ , which is stated in the ambient ordered field.
This is a second route to a fact the library already had. The published FALSE: some rational number squares to 2 refutes "some rational number squares to $2$ " by parity alone, on the construction pages, long before primes existed here. The case $k = 2$ , $m = 2$ of this corollary gives the same conclusion by a different argument, and the two agree: a rational squaring to $2$ would have to be an integer $z$ with $z^{2} = 2$ , and $1 < 2 < 4$ leaves no candidate.
Where primality is used. Exactly once, in step 2.1, through Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ : a prime dividing a power divides the base. For a composite divisor the step fails, which is why the classical proof cannot be run with an arbitrary common factor in place of a prime.

5 · Examples, counterexamples and false statements

None yet.

Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

Prime and composite integers: pp is prime when p>1p>1 and its only positive divisors are 11 and pp

Definition

Remarks

For a prime pp and any integer aa, gcd⁡(p,a)gcd(p,a) is pp when p∣ap∣a and 11 otherwise; so p∤ap∤a makes pp and aa coprime

Statement

Facts & Assumptions

Proof

Remarks

Euclid's lemma: if pp is prime and p∣abp∣ab then p∣ap∣a or p∣bp∣b

Statement

Facts & Assumptions

Proof

Remarks

For an integer p>1p>1: pp is prime if and only if, for all integers aa and bb, p∣abp∣ab implies p∣ap∣a or p∣bp∣b

Statement

Facts & Assumptions

Proof

Remarks

If a prime pp divides a finite product ∏i<nai∏i<n​ai​ of integers then p∣aip∣ai​ for some i<ni<n; at n=0n=0 the product is 11 and the hypothesis cannot hold

Statement

Facts & Assumptions

Proof

Remarks

Every integer n>1n>1 has a prime divisor; indeed the least divisor of nn that exceeds 11 is prime

Statement

Facts & Assumptions

Proof

Remarks

Every integer n≥1n≥1 is a finite product of primes: there are r∈Nr∈N and a list p:r→Zp:r→Z of primes with n=∏i<rpin=∏i<r​pi​, the case n=1n=1 being the empty product

Statement

Facts & Assumptions

Proof

Remarks

The fundamental theorem of arithmetic: every integer n≥1n≥1 is a product of primes, and the factorisation is unique up to order — if ∏i<rpi=∏j<sqj∏i<r​pi​=∏j<s​qj​ with every pipi​ and qjqj​ prime, then r=sr=s and qi=pπ(i)qi​=pπ(i)​ for some π∈Sym⁡(r)π∈Sym(r)

Statement

Facts & Assumptions

Proof

Remarks

Every nonzero integer nn is u∏i<rpiu∏i<r​pi​ with u∈{1,−1}u∈{1,−1} and every pipi​ prime; uu and rr are determined by nn, and the list is determined up to a permutation

Statement

Facts & Assumptions

Proof

Remarks

Euclid's theorem: for every n∈Nn∈N and every list p:n→Zp:n→Z of primes there is a prime not among p0,…,pn−1p0​,…,pn−1​; consequently the set of primes is not finite

Statement

Facts & Assumptions

Proof

Remarks

The pp-adic valuation vp(a)vp​(a) of a nonzero integer: the greatest k∈Nk∈N with pk∣apk∣a

Definition

Remarks

For a prime pp and a nonzero integer aa: pvp(a)∣apvp​(a)∣a and pvp(a)+1∤apvp​(a)+1∤a; pk∣apk∣a holds exactly for k≤vp(a)k≤vp​(a); vp(a)≥1vp​(a)≥1 exactly when p∣ap∣a; vp(1)=vp(−1)=0vp​(1)=vp​(−1)=0; and vp(p)=1vp​(p)=1

Statement

Facts & Assumptions

Proof

Remarks

vp(ab)=vp(a)+vp(b)vp​(ab)=vp​(a)+vp​(b) for nonzero integers a,ba,b, and vp(a+b)≥min⁡{vp(a),vp(b)}vp​(a+b)≥min{vp​(a),vp​(b)} whenever aa, bb and a+ba+b are all nonzero

Statement

Facts & Assumptions

Proof

Remarks

For n≥1n≥1 and any injective list p:r→Zp:r→Z of primes containing every prime divisor of nn, one has n=∏i<rpi vpi(n)n=∏i<r​pivpi​​(n)​; the exponents are determined by nn, and vq(n)=0vq​(n)=0 for every prime qq outside the list

Statement

Facts & Assumptions

Proof

Remarks

For positive integers aa and bb: a∣ba∣b if and only if vp(a)≤vp(b)vp​(a)≤vp​(b) for every prime pp

Statement

Facts & Assumptions

Proof

Remarks

Statement

Facts & Assumptions

Proof

Remarks

Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$

For a prime $p$ and any integer $a$ , $\gcd (p, a)$ is $p$ when $p ∣ a$ and $1$ otherwise; so $p ∤ a$ makes $p$ and $a$ coprime

Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$

For an integer $p > 1$ : $p$ is prime if and only if, for all integers $a$ and $b$ , $p ∣ a b$ implies $p ∣ a$ or $p ∣ b$

If a prime $p$ divides a finite product $\prod_{i < n} a_{i}$ of integers then $p ∣ a_{i}$ for some $i < n$ ; at $n = 0$ the product is $1$ and the hypothesis cannot hold

Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime

Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product

The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$

Every nonzero integer $n$ is $u \prod_{i < r} p_{i}$ with $u \in {1, - 1}$ and every $p_{i}$ prime; $u$ and $r$ are determined by $n$ , and the list is determined up to a permutation

Euclid's theorem: for every $n \in N$ and every list $p : n \to Z$ of primes there is a prime not among $p_{0}, \dots, p_{n - 1}$ ; consequently the set of primes is not finite

The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$

For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$

$v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero

For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list

For positive integers $a$ and $b$ : $a ∣ b$ if and only if $v_{p} (a) \leq v_{p} (b)$ for every prime $p$

A rational root of $x^{k} = m$ is an integer: if $k \geq 1$ , $m \in Z$ , $x \in Q$ and $x^{k}$ is the image of $m$ , then $x$ is the image of an integer