Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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 n1n \ge 1 and any injective list p:rZp : r \to \mathbb{Z} of primes containing every prime divisor of nn, one has n=i<rpivpi(n)n = \prod_{i<r} p_i^{\,v_{p_i}(n)}; the exponents are determined by nn, and vq(n)=0v_q(n) = 0 for every prime qq outside the list

Statement

Powers are the natural powers of Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e and finite products those of The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity, both taken in the commutative monoid (Z,,1)(\mathbb{Z},\cdot,1) of (Z,,1)(\mathbb{Z}, \cdot, 1) is a commutative monoid whose group of units is {1,1}\{1, -1\}; equivalently u1u \mid 1 holds exactly for u=1u = 1 and u=1u = -1. Call p:rZp : r \to \mathbb{Z} an injective list of primes when every pip_i is prime (Prime and composite integers: pp is prime when p>1p > 1 and its only positive divisors are 11 and pp) and pi=pjp_i = p_j forces i=ji = j (Injection, surjection, bijection).

Let nZn \in \mathbb{Z} with n1n \ge 1 and let p:rZp : r \to \mathbb{Z} be an injective list of primes such that every prime divisor of nn equals pip_i for some i<ri < r. Then, with vqv_q as in The pp-adic valuation vp(a)v_p(a) of a nonzero integer: the greatest kNk \in \mathbb{N} with pkap^{k} \mid a:

  1. n  =  i<rpivpi(n)\displaystyle n \;=\; \prod_{i<r} p_i^{\,v_{p_i}(n)};
  2. vq(n)=0v_q(n) = 0 for every prime qq that is not among p0,,pr1p_0,\dots,p_{r-1};
  3. the exponents are determined by nn: if e:rNe : r \to \mathbb{N} and n=i<rpiein = \prod_{i<r} p_i^{\,e_i}, then ej=vpj(n)e_j = v_{p_j}(n) for every j<rj < r.

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

Facts & Assumptions

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

[L1]

i<0gi=e\prod_{i<0} g_i = e and i<σ(t)gi=(i<tgi)gt\prod_{i<\sigma(t)} g_i = \bigl(\prod_{i<t} g_i\bigr) g_t; the value depends only on the entries named (The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity).

[L3]

For a prime pp and nonzero aa: pk1p^{k} \ge 1 for every kk, so pk>0p^{k} > 0 and pk0p^{k} \ne 0; a=pvp(a)aa = p^{v_p(a)} a' with a0a' \ne 0 and pap \nmid a'; pkap^{k} \mid a exactly for kvp(a)k \le v_p(a); vp(a)1v_p(a) \ge 1 exactly when pap \mid a; vp(1)=0v_p(1) = 0; and vp(p)=1v_p(p) = 1 (For a prime pp and a nonzero integer aa: pvp(a)ap^{v_p(a)} \mid a and pvp(a)+1ap^{v_p(a)+1} \nmid a; pkap^{k} \mid a holds exactly for kvp(a)k \le v_p(a); vp(a)1v_p(a) \ge 1 exactly when pap \mid a; vp(1)=vp(1)=0v_p(1) = v_p(-1) = 0; and vp(p)=1v_p(p) = 1, The pp-adic valuation vp(a)v_p(a) of a nonzero integer: the greatest kNk \in \mathbb{N} with pkap^{k} \mid a).

[L5]

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

[L7]

Induction on N\mathbb{N} (The principle of mathematical induction).

[L8]

On N\mathbb{N}: mnm \le n means m+c=nm + c = n for some cc (Order on the natural numbers); σ(k)=k+1\sigma(k) = k+1 and addition is commutative (Addition of natural numbers, Addition is commutative, The natural numbers N\mathbb{N} (von Neumann)); t<σ(t)t < \sigma(t) and i<σ(t)i < \sigma(t) exactly when iti \le t (On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n); m<nm < n exactly when σ(m)n\sigma(m) \le n (Discreteness: σ(n)\sigma(n) is the immediate successor).

[L9]

Z\mathbb{Z} is a commutative ring; its order is total, antisymmetric and transitive, is compatible with addition, and positives are closed under multiplication; ι:NZ\iota : \mathbb{N} \to \mathbb{Z} is injective and order preserving with image the nonnegative integers, ι(0)=0\iota(0) = 0, ι(1)=1\iota(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 qq and ww are primes with qwq \mid w, then qq is a positive divisor of ww (as q>1>0q > 1 > 0) other than 11, so q=wq = w. Consequently vq(w)=0v_q(w) = 0 whenever qwq \ne w are primes.

L3L5L9
1.2

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

baseL1L5L9
1.3

Let tNt \in \mathbb{N} and assume Q(t)Q(t).

ih
1.4

Let n1n \ge 1 and let p:σ(t)Zp : \sigma(t) \to \mathbb{Z} be an injective list of primes containing every prime divisor of nn. Write π:=pt\pi := p_t, v:=vπ(n)v := v_{\pi}(n), and fix nn' with n=πvnn = \pi^{v} n', n0n' \ne 0 and πn\pi \nmid n'.

L3choose
2.1

For a prime ww and kNk \in \mathbb{N}: vw(wk)=kv_w(w^{k}) = k, and vq(wk)=0v_q(w^{k}) = 0 for every prime qwq \ne w. Both sets of kk for which these hold contain 00, since w0=1w^{0} = 1 and vu(1)=0v_u(1) = 0 for every prime uu; and if they hold at kk then, wkw^{k} and ww being nonzero, additivity gives vw(wσ(k))=vw(wkw)=vw(wk)+vw(w)=k+1=σ(k)v_w(w^{\sigma(k)}) = v_w(w^{k} w) = v_w(w^{k}) + v_w(w) = k + 1 = \sigma(k) and vq(wσ(k))=vq(wk)+vq(w)=0+0=0v_q(w^{\sigma(k)}) = v_q(w^{k}) + v_q(w) = 0 + 0 = 0. Induction finishes both.

step 1.1L2L3L4L7L8
2.2

n1n' \ge 1: πv1>0\pi^{v} \ge 1 > 0 and n>0n > 0, so n0n' \le 0 would make πvn0<n\pi^{v} n' \le 0 < n; hence n>0n' > 0, and a positive integer is 1\ge 1 because n=ι(j)n' = \iota(j) with j0j \ne 0, so 1=σ(0)j1 = \sigma(0) \le j.

step 1.4L3L8L9
3.1

Clause 3. Let p:rZp : r \to \mathbb{Z} be an injective list of primes, e:rNe : r \to \mathbb{N}, and M:=i<rpieiM := \prod_{i<r} p_i^{\,e_i}; we claim M1M \ge 1, that vpj(M)=ejv_{p_j}(M) = e_j for every j<rj < r, and that vq(M)=0v_q(M) = 0 for every prime qq off the list. Let TT be the set of rNr \in \mathbb{N} for which this holds for all such pp and ee. Then 0T0 \in T: the empty product is 11, which is 1\ge 1, has vq(1)=0v_q(1) = 0 for every prime qq, and imposes no condition on indices. Suppose rTr \in T and let p:σ(r)Zp : \sigma(r) \to \mathbb{Z} be injective with primes and e:σ(r)Ne : \sigma(r) \to \mathbb{N}. Writing M:=i<rpieiM' := \prod_{i<r} p_i^{\,e_i} we have M=MprerM = M' \cdot p_r^{\,e_r}, with M1>0M' \ge 1 > 0 and prer1>0p_r^{\,e_r} \ge 1 > 0, so M1>0M \ge 1 > 0 and both factors are nonzero; additivity then gives vu(M)=vu(M)+vu(prer)v_u(M) = v_u(M') + v_u(p_r^{\,e_r}) for every prime uu. Taking u=pju = p_j with j<rj < r gives ej+0=eje_j + 0 = e_j, since pjprp_j \ne p_r by injectivity; taking u=pru = p_r gives 0+er=er0 + e_r = e_r, since prp_r is off the list p0,,pr1p_0,\dots,p_{r-1}; and taking a prime uu off the whole list gives 0+0=00 + 0 = 0. So σ(r)T\sigma(r) \in T, and T=NT = \mathbb{N} by induction.

step 2.1L1L3L4L7L8L9
3.2

The restriction ptp \restriction t is an injective list of primes containing every prime divisor of nn'. Indeed if qq is prime with qnq \mid n' then qnq \mid n, since n=πvnn = \pi^{v} n'; so q=piq = p_i for some i<σ(t)i < \sigma(t); and qπ=ptq \ne \pi = p_t, because πn\pi \nmid n'; hence iti \ne t, and i<σ(t)i < \sigma(t) gives iti \le t, so i<ti < t.

step 1.4step 2.2L5L6L8
3.3

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

step 2.1step 1.4step 2.2L3L4L8
4.1

By step 1.3 applied to nn' and ptp \restriction t: n=i<tpivpi(n)n' = \prod_{i<t} p_i^{\,v_{p_i}(n')}.

step 1.3step 2.2step 3.2
5.1

Therefore i<σ(t)pivpi(n)=(i<tpivpi(n))πvπ(n)=(i<tpivpi(n))πv=nπv=n\prod_{i<\sigma(t)} p_i^{\,v_{p_i}(n)} = \bigl(\prod_{i<t} p_i^{\,v_{p_i}(n)}\bigr) \cdot \pi^{\,v_{\pi}(n)} = \bigl(\prod_{i<t} p_i^{\,v_{p_i}(n')}\bigr) \cdot \pi^{v} = n' \pi^{v} = n, so Q(σ(t))Q(\sigma(t)) holds.

step 1.4step 4.1step 3.3L1L9
6.1

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

step 3.1step 1.2step 5.1L3L7discharge-induction

Remarks

Depends on

Used by

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