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.
For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list
Statement
Powers are the natural powers of Powers : natural exponents in a monoid and integer exponents in a group, with and finite products those of The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity, both taken in the commutative monoid of is a commutative monoid whose group of units is ; equivalently holds exactly for and . Call an injective list of primes when every is prime (Prime and composite integers: is prime when and its only positive divisors are and ) and forces (Injection, surjection, bijection).
Let with and let be an injective list of primes such that every prime divisor of equals for some . Then, with as in The -adic valuation of a nonzero integer: the greatest with :
- ;
- for every prime that is not among ;
- the exponents are determined by : if and , then for every .
Clause 3 needs only injectivity of the list, not the covering hypothesis.
Facts & Assumptions
Given: The commutative monoid ( is a commutative monoid whose group of units is ; equivalently holds exactly for and , Semigroup and monoid); and the property : "for every and every injective list of primes containing every prime divisor of , one has ".
and ; the value depends only on the entries named (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity).
and ; and for natural exponents in a monoid (Powers : natural exponents in a monoid and integer exponents in a group, with , Exponent laws in a group: and for all , and when and commute).
For a prime and nonzero : for every , so and ; with and ; exactly for ; exactly when ; ; and (For a prime and a nonzero integer : and ; holds exactly for ; exactly when ; ; and , The -adic valuation of a nonzero integer: the greatest with ).
For a prime and nonzero : and ( for nonzero integers , and whenever , and are all nonzero).
Every integer has a prime divisor (Every integer has a prime divisor; indeed the least divisor of that exceeds is prime); every prime satisfies , and every positive divisor of a prime is or (Prime and composite integers: is prime when and its only positive divisors are and ).
Divisibility is reflexive and transitive; means for some (Divisibility is reflexive and transitive on , and is linear: if and then for all integers ; also implies , and , Divisibility in : when for some integer ).
Induction on (The principle of mathematical induction).
On : means for some (Order on the natural numbers); and addition is commutative (Addition of natural numbers, Addition is commutative, The natural numbers (von Neumann)); and exactly when (On the order is membership: ); exactly when (Discreteness: is the immediate successor).
is a commutative ring; its order is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication; is injective and order preserving with image the nonnegative integers, , (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
Distinct primes do not divide one another: if and are primes with , then is a positive divisor of (as ) other than , so . Consequently whenever are primes.
holds: an empty list contains no prime, so has no prime divisor at all; if it would have one, so , and .
Let and assume .
Let and let be an injective list of primes containing every prime divisor of . Write , , and fix with , and .
For a prime and : , and for every prime . Both sets of for which these hold contain , since and for every prime ; and if they hold at then, and being nonzero, additivity gives and . Induction finishes both.
: and , so would make ; hence , and a positive integer is because with , so .
Clause 3. Let be an injective list of primes, , and ; we claim , that for every , and that for every prime off the list. Let be the set of for which this holds for all such and . Then : the empty product is , which is , has for every prime , and imposes no condition on indices. Suppose and let be injective with primes and . Writing we have , with and , so and both factors are nonzero; additivity then gives for every prime . Taking with gives , since by injectivity; taking gives , since is off the list ; and taking a prime off the whole list gives . So , and by induction.
The restriction is an injective list of primes containing every prime divisor of . Indeed if is prime with then , since ; so for some ; and , because ; hence , and gives , so .
For we have , using additivity on the nonzero factors and , and step 2.1 with , which holds by injectivity since .
By step 1.3 applied to and : .
Therefore , so holds.
With step 1.2 as base, induction gives for every , which is clause 1. Clause 2 follows because a prime off the list does not divide — otherwise it would be a prime divisor of and hence on the list — so ; and clause 3 is step 3.1.
Remarks
-
This is The fundamental theorem of arithmetic: every integer is a product of primes, and the factorisation is unique up to order — if with every and prime, then and for some 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 is exactly ; 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 abbreviates a product with finitely many factors different from , and an indexed product with finite support is not available at this point in the library — The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity multiplies a finite list. The honest form quantifies over a finite injective list covering the prime divisors of and adds clause 2, which says every prime off the list contributes exponent . 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 , and or , both products are , so the exponent vector is not determined. Injectivity is what makes read off one multiplicity rather than a sum of several.
Depends on
- The fundamental theorem of arithmetic: every integer $n \ge 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_{\pi(i)}$ for some $\pi \in \operatorname{Sym}(r)$
- $v_p(ab) = v_p(a) + v_p(b)$ for nonzero integers $a, b$, and $v_p(a+b) \ge \min\{v_p(a), v_p(b)\}$ whenever $a$, $b$ and $a+b$ are all nonzero
- For a prime $p$ and a nonzero integer $a$: $p^{v_p(a)} \mid a$ and $p^{v_p(a)+1} \nmid a$; $p^{k} \mid a$ holds exactly for $k \le v_p(a)$; $v_p(a) \ge 1$ exactly when $p \mid 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 \mathbb{N}$ with $p^{k} \mid a$
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime
- Semigroup and monoid
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- 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^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- Injection, surjection, bijection
- The principle of mathematical induction
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
- Divisibility is reflexive and transitive on $\mathbb{Z}$, and is linear: if $d \mid a$ and $d \mid b$ then $d \mid ax + by$ for all integers $x, y$; also $d \mid a$ implies $d \mid ac$, $-d \mid a$ and $d \mid -a$
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Discreteness: $\sigma(n)$ is the immediate successor
- Order on the natural numbers
- Addition of natural numbers
- Addition is commutative
- The integers as equivalence classes of pairs of naturals
- Arithmetic on the integers
- Order on the integers
- The integers form a commutative ring
- The integers form a totally ordered ring
- The natural numbers $\mathbb{N}$ (von Neumann)
- The naturals embed in the integers
Used by
- Every subgroup of index p in a finite p-group is normal Corollary
- The number of finite abelian groups of order n is the product of the partition numbers of the prime exponents of n Corollary
- Squarefree positive integers Definition
- The number-theoretic Möbius function μ(n) from prime factorisation Definition
- 360 = 2³ · 3² · 5 and 84 = 2² · 3 · 7, with gcd(360,84) = 12 and lcm(360,84) = 2520 read off the exponents Example
- The six abelian groups of order 360 in both classification forms Example
- φ(360)=96 by both inclusion-exclusion and the prime-power product formula Example
- Elementary divisors regroup uniquely into invariant factors Lemma
- Every subgroup of a finite p-group has order a power of p Lemma
- The divisibility poset is lower-finite, and each divisor interval factorises as a product of finite chains of prime exponents Lemma
- A finite abelian group is the internal direct product of its primary components Theorem
- Euler's product formula φ(n)=n∏_p∣ n(1-1/p)=∏_pᵏ∥ n(pᵏ-pᵏ⁻¹) for n≥1, stated through a finite injective list of its prime divisors Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 98 results over 31 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Fundamental theorem of arithmetic (Wikipedia) (standard reference, not scraped)
- P-adic valuation (Wikipedia) (standard reference, not scraped)
- Neil Donaldson, Math 180A notes: Unique factorisation (standard reference, not scraped)