Documentary state: EDITORIALLY_ADMITTED. The manuscript has a protected editorial admission, not a theorem certification.
OAI-26 family 029: Primitive roots for admissible integer bases
Editorial state: DRAFT_UNACCEPTED. Mathematical status: NO_CERTIFICATION. The two source manuscripts assert results about primitive roots; this document describes their stated theorems and does not certify their proofs.
The question in plain language
Modulo a prime \(p\), multiplying a nonzero number by itself repeatedly eventually gives one. The smallest positive exponent giving one is its multiplicative order. A number is a primitive root when this order is exactly \(p-1\): its powers visit every nonzero residue modulo \(p\).
Artin's primitive-root conjecture predicts that every integer other than \(-1\) or a perfect square is a primitive root modulo infinitely many primes. The pinned Family 029 main paper claims the infinitude statement for every such admissible integer base.
A small example
Modulo 7, the powers of 3 are 3, 2, 6, 4, 5 and 1, so 3 has order 6 and is a primitive root. By contrast, the powers of 2 return to 1 after three steps and do not cover every nonzero residue.
The conjecture concerns infinitely many different primes for a fixed base, not just one successful small prime. A square cannot generate the full multiplicative group modulo an odd prime, since its powers stay in the subgroup of squares; the number \(-1\) has order at most two.
What is known
One integer base. The October 4, 2026 manuscript Primitive roots for every admissible integer base (92 PDF pages), Theorem 1.1, claims that for each fixed admissible integer \(a\) there are constants \(c_a>0\) and \(x_a\) such that, for all sufficiently large \(x\), at least \(c_a x/(\log x)^2\) primes in \((x,2x)\) have \(a\) as a primitive root. The claimed lower bound implies infinitely many such primes; it is weaker than Artin's conjectured positive-density asymptotic.
Simultaneous prime bases. The second October 4 manuscript Simultaneous primitive roots: a conditional lower bound for prime bases (21 pages), Theorem 1.1, assumes Inputs 3.1, 4.1, 5.1 and 5.2: a Hecke zero-free assertion, a marked Type II estimate, a block sieve and a rough-number density estimate taken from the companion construction. Under those explicitly stated assumptions, every fixed finite set of distinct positive prime bases is claimed to be simultaneously primitive modulo at least \(c x/(\log x)^2\) primes in \((x,2x)\) for all sufficiently large \(x\). The second theorem is conditional as stated in its own manuscript; it must not be silently promoted to an independently unconditional result.
The simultaneous result is not the same as the main paper's assertion about a single arbitrary admissible integer. Its hypotheses, the fixed finite collection, and the constants depending on that collection matter.
GCL verification state
The catalogue source lock is openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. Both PDFs were downloaded and their abstracts, introductions and main theorem statements directly inspected:
- Primitive roots for every admissible integer base: Git blob
dc2342d776f280e81d73ffa5a8eaf7b8f51745df, 891,737 bytes, 92 pages. - Simultaneous primitive roots: a conditional lower bound for prime bases: Git blob
5ec52e9d5a8b6c50490d3c28baef2dbe2e609b02, 450,863 bytes, 21 pages.
This is an audit of source statements, not verification of 113 pages of proofs. The central analytic ingredients—including the claimed Hecke zero-free argument, the cubic theta normalization, the marked Type II estimates, splitting estimates and sieve bounds—have not been independently replayed or validated. No Lean-to-source equivalence, Comparator verdict or MATHCERT certificate is established.
What remains
A mathematical proof audit must examine the main manuscript's field-splitting and analytic estimates, establish exactly how the four inputs used by the simultaneous manuscript follow from the companion, and test the prime-selection and order-obstruction estimates. The conditional status of the second paper must remain explicit until these dependencies are verified.
Documentary admission requires source-bound editorial criticism, the mathematical Markdown gate, deterministic compendium tests, rendered HTML review and a protected record binding the article's exact SHA-256. None of those editorial checks constitutes proof certification.
Sources and claim boundaries
- Primitive roots for every admissible integer base — pinned PDF.
- Simultaneous primitive roots: a conditional lower bound for prime bases — pinned PDF.
- GCL editorial work item.
Boundary: NO_CERTIFICATION. Source-statement fidelity does not prove either manuscript's mathematical conclusions.
Indexed primary manuscript paths:
- Primitive roots for every admissible integer base —
preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/primitive-roots-all-integer-bases.pdf - Simultaneous primitive roots: a conditional lower bound for prime bases —
preprints/Simultaneous-primitive-roots-a-conditional-lower-bound-for-prime-bases-October-4-2026/simultaneous-primitive-roots-conditional-lower-bound-prime-bases.pdf