What was already known
Artin’s conjecture predicts infinitely many primitive-root primes for every admissible fixed base, with a stronger positive-density asymptotic. The reported lower bound targets the infinitude part.
What changed and why it matters
Proves the infinitude assertion for each admissible base while retaining the distinction from Artin’s density prediction.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
Constants and the large-x threshold depend on the base. The bound has an extra logarithm compared with the predicted asymptotic and does not establish that density formula. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.
Accessible artifact / proof
The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.
Correction and publication history
Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.
Read this published revision