{"id":"dca56b8a-6aa0-4f0c-a0d6-db6c86deca7b","arxiv_id":"2506.08256","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The generalized Schatunowsky theorem is provable in the weak arithmetic PA^- plus six elementary number-theoretic axioms, and one of those axioms is shown not to be needed.","lead":"This paper proves that a recent generalization of Schatunowsky's 1893 theorem about numbers whose totatives are prime can be derived in a very weak arithmetic using a handful of extra axioms. It also shows which of those axioms are independent of the rest, a step toward identifying the minimal number theory needed for the result.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Displayed axiom A17 makes Σ unsatisfiable: A18 forces 2 to be prime, and A17 then demands a predecessor prime for 2, i.e. 1<q<2, which PA^- rules out; Theorems 4.1 and 4.2 are vacuous as stated.","rationale":"I read the paper as aiming to show that the Kaneko–Nakai generalization of Schatunowsky's theorem can be proved in PA^- plus a few elementary axioms. The intended model-theoretic strategy is clear and plausible: A18 supplies large enough primes, A19 gives a Bonse-type inequality, and the proof rules out nonstandard p-good numbers. However, the central theorem is only as strong as the axioms it uses. The reader's weakest assumption is exactly the load-bearing issue: the displayed A17 is unsatisfiable in the presence of A18. This is not a matter of disagreeing with an external consensus; it is an internal inconsistency. A18 with n=5 forces π2(2), and A17 then requires a prime strictly between 1 and 2, contradicting PA^- (A14 and A13). The paper's own prose indicates the intended axiom was for primes greater than 2, and the proof only invokes predecessor primes for primes far larger than 2. The flaw is therefore localized and repairable, but as displayed the main theorems are vacuously derived from an inconsistent theory. I found no independent second fatal defect; the remaining proof steps appear coherent once A17 is corrected. For this reason I keep the reader's conditional verdict rather than escalating to reject or downgrading to accept.","tokens_in":6943,"tokens_out":9857,"duration_ms":129602,"concrete_test":"Use a proof assistant or first-order model finder (e.g., Lean/Mathlib or Mace4) to formalize A1–A19 exactly as displayed. Derive π2(2) from A18 with n=5; instantiate A17 with p=2; combine with PA^- discreteness to derive 1<2, 1<q, q<2 and then q−1<1 with q−1>0, contradicting A14. If the contradiction closes, the displayed axiom must be corrected. A secondary check: rerun the corrected system with A17 replaced by (∀p)(2<p→(∃q)(∀u)(π2(q)∧q<p∧(π2(u)∧u<p→u≤q))) and verify Theorem 4.1's model-theoretic argument still goes through.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3 displays A17 as (∀p)(∃q)(∀u)(π2(p)→(q<p∧π2(q)∧π2(u)∧u<p→u≤q)). With A18 instantiated at n=5, PA^- proves π2(2), since 2 is the only prime with square <5. Applying the displayed A17 to p=2 forces ∃q(1<q<2). PA^- (A14 plus subtraction A13 and order axioms) proves no such q can exist: q>1 and q<2 gives 0<q−1<1, contradicting A14. Hence A1–A19 has no models. Theorem 4.1 begins 'Let M be a model of Σ', so the derivation of GSw is from an inconsistent theory, not from a satisfiable weak arithmetic. Theorem 4.2 inherits the problem since Σ′ contains A17. The prose at the start of Section 3 ('any prime > 2 has a predecessor prime') and the proof usage (only primes ≥17) show the intended axiom should carry the hypothesis 2<p; but as displayed the central claim is formally unsound.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves, in a weak arithmetic base PA^- (the ordered semiring axioms A1-A15 without induction), that a generalized Schatunowsky theorem holds: Theorem 4.1 derives a weak form GSw from the finite axiom set Sigma = PA^- + A16-A19, and Theorem 4.2 derives a strong form GSs from Sigma' = PA^- + A16-A21. The added axioms are explicit elementary number-theoretic statements about successor/predecessor primes, existence of largest primes below a square, a three-prime inequality, existence of prime divisors, and a divisibility inequality. The proof for nonstandard models uses A18 to produce large primes and A19 for the key inequality; the standard model case is handled by the Kaneko-Nakai classification. Section 5 gives independence results using polynomial ring models, and Section 6 shows A18 is not needed for GSs in the sense that C(Z[X]) satisfies all axioms except A18 while GSs holds there.","tokens_in":7315,"tokens_out":1738,"duration_ms":22249,"significance":"If correct, the paper is a valuable contribution to reverse mathematics of elementary number theory: it locates the generalized Schatunowsky theorem in a very weak fragment of arithmetic, complements the earlier work of Pambuccian on Schatunowsky's theorem, and provides concrete model-theoretic independence proofs. The paper is explicit about the axioms used and gives meaningful independence results (A16 and A17 not derivable from the others, A18 not needed for GSs). The use of PA^- with explicit nonstandard models and the appeal to the Kaneko-Nakai classification are appropriate external anchors. The main obstacle is a formal flaw in the displayed axiom A17 that makes the stated theories inconsistent; the intended content is clear from the prose and from usage, but as printed the central theorems are vacuously true and the claimed proof is not sound.","major_comments":[{"comment":"The displayed axiom A17 states (∀p)(∃q)(∀u)(π2(p)→(q<p∧π2(q)∧π2(u)∧u<p→u≤q)). With A18 instantiated at n=5, PA^- proves π2(2), since 2 is the only element whose square is <5. Applying A17 to p=2 forces existence of q with 1<q<2, but A14 (0<1 and x>0 implies x=1 or x>1) and A13 together rule out any such q in PA^-. Hence the theory Σ = A1-A19 is unsatisfiable, and Theorem 4.1's claim 'Σ⊢GSw' is vacuous. Theorem 4.2 inherits the problem because Σ' contains A17. The prose immediately after A17 says 'any prime > 2 has a predecessor prime', and the proof uses A17 only for primes ≥17, so the intended axiom should carry the hypothesis 2<p. This is a load-bearing error: as displayed, the paper does not prove the generalized Schatunowsky theorem from a satisfiable weak arithmetic. The fix is local (add 2<p to A17), and with that correction the nonstandard-model argument appears to go through, but the manuscript must be revised and the corrected axiom used consistently in Sections 4-6.","section":"Section 3, A17"},{"comment":"The proof that q^2 is a totative of m when q^2 and m are coprime uses the claim 'q^2 is co-prime with all the primes ≤ p' because q≥S(S(S(p))). This requires that all primes ≤p are below q, i.e., that the prime ordering is linear and that S is the true successor. In a nonstandard model of PA^- with A16 this is plausible, but the absence of induction means one must check that the finite set of primes ≤p is well-orderly; the manuscript does not spell out the argument. Since the proof otherwise depends on A19 for three consecutive primes, this is a minor gap in presentation rather than a fatal flaw, but it should be clarified.","section":"Theorem 4.1, paragraph after (4)"},{"comment":"The proof that C(Z[X]) satisfies GSs for nonstandard primes relies on the assertion that every axiom used in Theorem 4.2 holds in C(Z[X]), but earlier in Section 5 the paper shows only that A16, A17, A19, A20 hold in C(Z[X]) (and A21 is not discussed for this model). A21 is used in the definition of kp in Theorem 4.2, and the proof of Theorem 6.1 applies 'with kp defined as in that theorem'. The paper does not verify A21 in C(Z[X]) explicitly; while it may be derivable there, the missing verification is a gap in the independence claim 'PA^-, GSs ⊬ A18'.","section":"Section 6, Theorem 6.1"}],"minor_comments":[{"comment":"There are several typos and slips: 'costructive' for 'constructive' in the introduction; 'number-theroretical' for 'number-theoretical'; 'divsior' for 'divisor' in Theorem 4.2; 'Vi ete' for 'Viète'; 'succesor' for 'successor'; 'S(S(S(p)))' sometimes appears as 'S(S(S(p))' in the proof of Theorem 6.1. These should be corrected.","section":"Throughout"},{"comment":"The axiom A18 states that for every n>4 there is a largest prime p with p^2<n. In the standard model this is true, but the formula as written uses 'p<q ∧ π2(q)→n≤q^2', which only says p is largest among primes greater than p; it does not explicitly say that all primes below p have square <n (which is automatic for p being the largest such prime). This is a minor clarity issue; the intended meaning is clear from context.","section":"Section 3, A18"},{"comment":"The formulas for GSw and GSs are dense and hard to parse. The paper should explain in words that GSw asserts an upper bound beyond which every number has a composite totative not divisible by any prime ≤p, and GSs asserts existence of a largest p-good number. This would help the reader follow the proof.","section":"Section 4, GSw/GSs definitions"},{"comment":"The statement of Lemma 5.1 assumes f(X) has degree n with coefficients a_i and constant term ±p; the proof refers to 'the polynomial having constant term ±1' after factorization, which is correct only up to sign of factors in Z[X]; a sentence clarifying the allowed factorization in Z[X] would improve rigor.","section":"Section 5, Lemma 5.1"},{"comment":"The Kaneko-Nakai paper is cited as 'Amer. Math. Monthly 132 (2025), no. 5, 443-447'. The proof of Theorem 4.1 relies crucially on [2, Th. 4 & 7] and the table of p-good numbers; the manuscript would benefit from stating these classification results explicitly, or at least naming what the table contains, so the reader can verify the standard-model case without fetching the reference.","section":"Reference [2]"}],"recommendation":"major_revision","confidential_remarks":"The paper is clearly within the scope of mathematical logic and reverse mathematics, and the overall strategy is sound. The displayed A17 is a genuine formal inconsistency that must be fixed before the paper can be considered; with the 2<p hypothesis added, the central claims appear defensible. I would also ask the authors to verify A21 in C(Z[X]) for the independence claim, and to make the standard-model case self-contained. Once these are addressed, the paper would be suitable for publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Hi [Name], quick take on arXiv:2506.08256.\n\nThe paper proves that the Kaneko–Nakai generalization of Schatunowsky's theorem is derivable in PA^- plus a small set of explicit axioms (A16–A19 for the weak form, plus A20–A21 for the strong form), and it shows A18 is independent of PA^- + GSs via a polynomial-ring model. The derivations themselves are new, and the proof strategy—using the model-theoretic compactness-style analysis to pin down which elementary facts are needed—is familiar from Pambuccian's earlier work but rigorously applied here. The paper is well-written and the mathematical content, once you get past the formal axioms, is clearly reasoned.\n\nThe problem is the displayed A17. As written: (∀p)(∃q)(∀u) π2(p) → (q<p ∧ π2(q) ∧ π2(u) ∧ u<p → u≤q), i.e., every prime has a predecessor prime. But A18, instantiated at n=5, forces π2(2), so A17 applied to p=2 demands a prime q with 1<q<2. That's impossible in PA^-. So Σ and Σ' have no models, and Theorems 4.1 and 4.2 are vacuously true as stated. The prose at the beginning of Section 3 says 'any prime > 2,' and the proof only uses A17 for primes ≥17, so the intended axiom clearly needs the hypothesis 2<p. This is a one-character fix, but as displayed it's load-bearing: the main claims are formally unsound. The paper does not flag this.\n\nThe rest of the argument looks solid. The use of A19, the Kaneko–Nakai inequality, is legitimate; the case split for small p in Theorem 4.1 is a bit hand-wavy but fills in fine; the independence proof in Section 5 relies on a known irreducibility lemma and appears correct. There are also typos ('divsior', 'costructive', 'co-prime' vs 'coprime') that an editor will want cleaned up.\n\nMy verdict: the contribution is real but modest, and the formal bug is minor in intent yet major in effect. A serious referee should see this paper—it deserves peer review, not desk rejection, because the intended theorem is provable and the proof strategy is sound. But the authors need to fix A17 before publication.\n\nIf you're deciding whether to engage: it's a short note for people in weak arithmetic and proof theory. I wouldn't cite it myself in the next year, but I'd happily read the corrected version. Bring it to reading group if you want a concrete example of how one-character axiom errors can invalidate a model-theoretic proof.\n\nBest, [Name]","headline":"A fixable one-character error in A17 makes the stated theories inconsistent, but the intended theorem and proof strategy are sound.","tokens_in":7720,"tokens_out":3460,"would_cite":false,"duration_ms":38601,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03C62","03F30","11A41"],"pacs":[],"model":"deepseek-v4-flash","headline":"The generalized Schatunowsky theorem—that for each prime $p$ only finitely many $p$-good numbers exist—is provable from the weak base theory $\\mathrm{PA}^-$ together with a few explicit axioms about primes, and one axiom is shown…","keywords":["Schatunowsky theorem","p-good numbers","PA^-","weak arithmetic","totatives","prime spacing","model theory","independent axioms"],"falsifier":"In a nonstandard model of the corrected axioms, check whether any $p$-good number exceeds the bound $S(S(S(p)))^2+1$; the paper predicts none. One can also verify in the standard model whether any $m\\ge 290$ is $p$-good for $p\\in\\{2,3,5\\}$, which would falsify the small-prime case.","tokens_in":6746,"feed_emoji":"🔢","tokens_out":10358,"duration_ms":101866,"temperature":0.7,"pith_summary":"The paper aims to show that the generalized Schatunowsky theorem—the statement that for every fixed prime $p$, only finitely many numbers $n$ have the property that every totative of $n$ not divisible by any prime $\\le p$ is itself prime—can be proved in a very weak arithmetic, not in full Peano Arithmetic. The authors identify two forms of the theorem: a weak form asking for an upper bound on such $p$-good numbers, and a strong form asking for a largest one. They prove the weak form from the base theory $\\mathrm{PA}^-$ together with four explicit axioms (A16–A19), and the strong form from $\\mathrm{PA}^-$ together with six axioms (A16–A21), and they show that one of these axioms, A18, is not needed for the strong form. If correct, this shows that the finiteness phenomenon is a consequence of elementary prime-spacing facts rather than of the full induction schema, and that the proof can be carried out in every model of a finite subtheory of arithmetic.","feed_headline":"Finiteness of p-good numbers proved in weak arithmetic","feed_subtitle":"For each prime p, only finitely many p-good numbers exist, and the proof needs no induction schema.","key_machinery":"The argument is carried by the weak base theory $\\mathrm{PA}^-$, whose models are the positive cones of discretely ordered rings, together with the choice of 'prime' as $\\pi_2(x)$ (the divisibility property, not mere irreducibility). The additional axioms supply the needed number-theoretic content: A16 and A17 give successor and predecessor primes, A18 gives a largest prime below $\\sqrt{n}$, and A19, the inequality $S(q)^2 < 2qP(q)$ for consecutive primes with $q\\ge 19$, is the engine that forces any sufficiently large $m$ to have a composite totative. The model-theoretic proof takes a nonstandard prime $q$ with $q^2<m$, observes that $q^2$, $P(q)^2$, and $P(P(q))^2$ are totatives of $m$ unless $q$, $P(q)$, and $P(P(q))$ divide $m$, and derives a contradiction from A19. Independence results use polynomial rings $\\mathbb{Z}[X]$ and $\\mathbb{Q}\\mathbb{Z}[X]$ as models.","core_discovery":"The central discovery is that the cited generalization of Schatunowsky's theorem—that for each prime $p$ the set of $p$-good numbers is finite—is provable in the weak base theory $\\mathrm{PA}^-$ augmented by a small, explicit list of axioms about primes. The key bound is that in any model of the weak theory, for a nonstandard prime $p\\ge 7$, no number $m\\ge S(S(S(p)))^2+1$ can be $p$-good; the argument uses the axiom A19, which states that the square of a prime $\\ge 19$ is less than twice the product of the two preceding primes. For the strong form, two additional axioms (every number $>1$ has a prime divisor, and a bound on how far a prime can be from the square of the next prime) produce a largest $p$-good number. The paper also establishes an independence result: the axiom A18, asserting existence of a largest prime whose square is below $n$, is not needed for the strong form, since the positive cone of $\\mathbb{Z}[X]$ satisfies the remaining axioms and the strong form.","pith_inferences":["A natural correction to the displayed A17—requiring $2<p$—would make the axiom satisfiable, and since the proof only uses A17 for primes $\\ge 17$, the corrected version should still yield the weak form.","The proof strategy, bounding $p$-good numbers by iterating the successor-prime function and applying an inequality like A19, could serve as a template for proving other 'largest number with a given totative property' theorems inside weak arithmetic.","Because the paper chooses $\\pi_2$ (divisibility) rather than $\\pi_1$ (irreducibility) for 'prime', the theorem's status in weak arithmetic depends on this choice; in models where the two notions differ, the $p$-good property might behave differently.","The independence of A18 from the strong form suggests that an elementary proof of $\\mathrm{GS_s}$ avoiding the model-theoretic argument may exist, though the paper does not supply one."],"forward_implications":["In every model of $\\Sigma$, for each prime $p\\ge 7$ every $p$-good number is $< S(S(S(p)))^2+1$, and for $p\\in\\{2,3,5\\}$ every $p$-good number is $< 290$.","The strong form holds in every model of $\\Sigma'$, so in every such model each prime $p$ has a largest $p$-good number.","The axiom A18 is not needed for the strong form: the theory $\\mathrm{PA}^-$ together with A16, A17, A19, A20, and A21 proves $\\mathrm{GS_s}$, and there is a model satisfying these axioms in which A18 fails.","The two finitely axiomatized systems $\\Sigma$ and $\\Sigma'$ show that the generalized Schatunowsky theorem is a theorem of finite elementary number theory, not a consequence of the full induction schema.","The independence results clarify the axioms' roles: A16 and A17 are not consequences of $\\mathrm{PA}^-$ with A19 and A20, and A18 is not a consequence of the other axioms together with A21."],"supporting_citations":[{"why":"Supplies the generalized theorem being reproved, the standard-model inequality behind A19, and the table of p-good numbers for small primes.","marker":"[2]"},{"why":"Provides the axiom system PA^- and the model-theoretic facts about discretely ordered rings used throughout.","marker":"[3]"},{"why":"Earlier work on Schatunowsky's theorem in weak fragments, establishing the role of prime-spacing inequalities that A19 strengthens.","marker":"[4]"},{"why":"Provides the irreducibility lemma used to construct the polynomial model that shows A18 is independent.","marker":"[5]"}],"fun_headline_variants":["Generalized Schatunowsky proved in weak arithmetic","Finiteness of p-good numbers provable without induction","Schatunowsky's theorem, generalized, but with fewer axioms","p-good numbers are finite: proof in weak base theory"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the intended reading of A17 as 'every prime greater than 2 has a predecessor prime'; as written, A17 applies to all primes, including 2, which has no predecessor in the standard model, making the theory $\\Sigma$ inconsistent and the model-theoretic proof vacuous.","fun_headline_variants_meta":{"raw":{"variants":["Generalized Schatunowsky proved in weak arithmetic","Finiteness of p-good numbers provable without induction","Schatunowsky's theorem, generalized, but with fewer axioms","p-good numbers are finite: proof in weak base theory"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000217,"raw_usage":{"total_tokens":1395,"prompt_tokens":864,"completion_tokens":531,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":480,"completion_tokens_details":{"reasoning_tokens":461}},"tokens_in":480,"tokens_out":531,"duration_ms":6438,"temperature":1.0,"reasoning_tokens":461,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:18:33.984949+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"In a nonstandard model of the corrected axioms, check whether any $p$-good number exceeds the bound $S(S(S(p)))^2+1$; the paper predicts none. One can also verify in the standard model whether any $m\\ge 290$ is $p$-good for $p\\in\\{2,3,5\\}$, which would falsify the small-prime case.","supporting_citations":[{"cited_title":"Kaneko, H","cited_arxiv_id":null,"evidence_quote":"Supplies the generalized theorem being reproved, the standard-model inequality behind A19, and the table of p-good numbers for small primes."},{"cited_title":"Kaye, Models of Peano Arithmetic (Oxford University Press, 1991)","cited_arxiv_id":null,"evidence_quote":"Provides the axiom system PA^- and the model-theoretic facts about discretely ordered rings used throughout."},{"cited_title":"Pambuccian, Schatunowsky’s theorem, Bonse’s inequality, and Chebyshev’s theorem in weak fragments of Peano arithmetic","cited_arxiv_id":null,"evidence_quote":"Earlier work on Schatunowsky's theorem in weak fragments, establishing the role of prime-spacing inequalities that A19 strengthens."},{"cited_title":"Osada, The Galois groups of the polynomials X n + aX l + b, J","cited_arxiv_id":null,"evidence_quote":"Provides the irreducibility lemma used to construct the polynomial model that shows A18 is independent."}],"review_version":1}