{"id":"a7791573-d231-44f5-83cc-f5b2c3643f41","arxiv_id":"2608.11975","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Every completely multiplicative coloring of the positive integers with values in a finite cyclic group has infinitely many monochromatic Pythagorean triples, and the unavoidable threshold is finite for every modulus.","lead":"Every finite cyclic coloring of the positive integers that respects multiplication is shown to contain infinitely many monochromatic right triangles with integer sides. The result settles an open problem in Ramsey theory and gives an exact smallest hypotenuse for one natural coloring.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"External Theorem 1.1 from [2] is the sole load-bearing dependency; internal proofs are sound conditional on it.","rationale":"Good-faith reading: the paper is a short note whose purpose is to bootstrap the cited FKM theorem to infinitude and to a finite threshold. I verified the main arguments in detail. The separation lemma is correct: for finitely many rationals different from 1, one can find a prime ell and a homomorphism to Z/ellZ nonzero on all of them; the counting argument works because each forbidden functional lies in a hyperplane and the number of functionals exceeds the union bound. The infinite-pairs contradiction is valid: if H had only finitely many Pythagorean pairs, applying Theorem 1.1 to the product of f-hat and lambda would produce a new pair in H cap ker(lambda), forcing one of the listed first coordinates into ker(lambda), contrary to the lemma. The scaling to identity-valued triples preserves distinctness. Theorem 2.1(1) follows from compactness of the product space; Theorem 2.1(2) is an explicit, self-contained computation that gives a falsifiable lower bound and matching construction; Theorem 2.1(3) is a straightforward injection argument. The only load-bearing assumption not proved in the manuscript is Theorem 1.1 from [2]. Since the reader already identified this as the weakest assumption and the paper cites a specific corrected version, I do not regard this as a disqualifying flaw. The verdict ACCEPT stands, with the residual risk noted. If a check of [2] revealed a hidden hypothesis, the verdict would need to change to CONDITIONAL or REJECT.","tokens_in":3635,"tokens_out":22963,"duration_ms":230945,"concrete_test":"Retrieve arXiv:2309.10636v5 (corrected version of [2]) and check Theorem 1.5 verbatim: (a) h ranges over all completely multiplicative finite-valued functions N->T with no aperiodicity or character restrictions; (b) the conclusion is distinct x,y,z with x^2+y^2=z^2 and h(x)=h(y)=h(z)=1, not merely a monochromatic triple in some unspecified color; (c) the theorem applies to h(n)=exp(2*pi*i*psi(n)/(m*ell)) for the product homomorphism psi=(f-hat,lambda) and an auxiliary prime ell. If all three hold, the proof of Theorem 1.3 is complete. If any fails, the paper must either supply a proof for the needed case or narrow its claims.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 1.3, hence Theorem 2.1(1)) rests entirely on Theorem 1.1 of [2], invoked in the first line of the proof to obtain an identity-valued Pythagorean triple, and invoked again after embedding the product homomorphism (f-hat, lambda) into T to obtain a pair in H cap ker(lambda). The manuscript neither proves Theorem 1.1 nor states its hypotheses beyond one sentence, so any extra condition in [2] (e.g., aperiodicity, or a non-Dirichlet-character restriction) would invalidate the bootstrap. I checked the internal steps: Lemma 1.2's counting argument is valid (finite union of hyperplanes, choice of prime ell not dividing any v_i); the contradiction that H has infinitely many Pythagorean pairs is sound; the scaling by c^(m-1) preserves distinctness because primitive cores are unique; the compactness argument in Theorem 2.1(1) and the explicit v_3 construction in Theorem 2.1(2) are correct. No internal inconsistency or circularity was found; the only correctness risk is the exact reach of the cited theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies standard morphisms f:N→Z/mZ (completely additive functions) and the existence of monochromatic Pythagorean triples. The main result, Theorem 1.3, asserts that for every m≥1 and every standard morphism f, there are infinitely many identity-valued Pythagorean triples (x,y,z) with xf=yf=zf=0, and infinitely many primitive Pythagorean triples with all three entries of the same color. From this the authors derive Theorem 2.1: the threshold T(m) is finite for all m; the valuation morphism n↦v3(n) mod m has least possible hypotenuse (9^m+1)/2; and T(d)≤T(m) for d|m. The proof uses, as a black box, a theorem of Frantzikinakis, Klurman and Moreira (Theorem 1.1) guaranteeing an identity-valued Pythagorean triple for every finite-valued completely multiplicative function h:N→T.","tokens_in":3842,"tokens_out":12802,"duration_ms":133801,"significance":"Granting the external Theorem 1.1, the arguments are correct and elegant. The separation lemma (Lemma 1.2) is self-contained and its counting argument is sound. The contradiction argument for infinitude is valid, and the scaling argument converting primitive monochromatic triples into identity-valued triples is correct. The compactness proof that T(m) is finite is standard and clean, and the explicit v3-morphism example gives a sharp lower bound that is genuinely informative. The paper resolves the qualitative part of Problem 4.3 of Eliahou et al. for every modulus m, which is a significant advance for a short note. The exposition is clear, the dependence on the external theorem is honestly stated, and I found no circularity or hidden fitting of parameters.","major_comments":[],"minor_comments":[{"comment":"The proof of Theorem 1.3 relies twice on Theorem 1.1 as a black box, and this is the sole external input; please cite the exact theorem number in the corrected arXiv version of [2] and reproduce the hypotheses verbatim. This is a request for precise attribution rather than an indication of a gap.","section":"Section 1, Theorem 1.1"},{"comment":"The notation 'nh=e^{2πi(nf)/m}' is slightly nonstandard; writing h(n)=e^{2πi nf/m} would avoid confusion with the left action of n on h.","section":"Section 1, proof of Theorem 1.3"},{"comment":"In the displayed line 'the standard morphism nf_m = v3(n) (mod m)', the definition would be clearer as 'the standard morphism f_m given by n f_m = v_3(n) mod m'.","section":"Section 2, Theorem 2.1(2)"},{"comment":"The title in the full text contains an extra space ('ST ANDARD MORPHISMS'); this should be corrected to 'Standard morphisms and Pythagorean triples' in the final version.","section":"Title"}],"recommendation":"minor_revision","confidential_remarks":"I support publication after minor revision. The only substantive risk is the exact scope of the cited theorem from [2]; the internal mathematics is sound conditional on that theorem, and I see no sign of circularity or overclaiming."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a genuinely useful note. It proves that for every m and every standard morphism f:N→Z/mZ there are infinitely many primitive monochromatic Pythagorean triples, not just one, and consequently the unavoidability threshold T(m) is finite. The proof is clean and honest: it takes the FKM theorem (identity-valued Pythagorean triple for finite-valued completely multiplicative functions) as a black box and uses a clever separation lemma to push one triple to infinitely many. The v3 example giving the exact minimum hypotenuse (9^m+1)/2 is neat and correct.\n\nWhat's new: Theorem 1.3(2) — infinitude of primitive monochromatic triples — and Theorem 2.1 on T(m). As the authors themselves acknowledge, existence of a single primitive triple already follows from FKM by dividing out gcd; the infinitude is the real new content. The compactness argument for T(m)<∞ is standard but effective in the right way.\n\nI checked the internals: Lemma 1.2 is a sound finite-field union-bound argument; the contradiction in Theorem 1.3 is valid; the scaling by c^(m-1) preserves distinctness because primitive cores are unique; the parametrization analysis for v3 is correct, including the attainment example; the monotonicity T(d)≤T(m) is immediate and fine.\n\nSoft spots, in proportion. The single load-bearing dependency is Theorem 1.1 from [2], quoted without proof. That's normal in a short note, but it does mean the paper's results are conditional on the precise hypotheses of that theorem. The authors state it cleanly; I have no reason to doubt their version, but a referee might want the exact statement from the published version verified, or an acknowledgment that if FKM has additional conditions (aperiodicity, etc.) the argument needs a check. The bound on T(m) from compactness is non-constructive and enormous; the authors are transparent that effective bounds remain open. That's not a flaw, just a limitation.\n\nThe citation pattern looks fine: [1] is the problem source, [2] is the external theorem. No self-citation issues, no fitting, no circularity.\n\nWho is this for: anyone working on monochromatic Pythagorean triples, divisibility sequences, or finite-valued multiplicative functions. It's a short, readable note, not a long paper. It deserves a serious referee — the proof is accessible and the result settles a stated question.\n\nMy recommendation: engage with it, send it to review. It's solid.","headline":"A clean short note that uses the FKM theorem as a black box and genuinely proves the infinitude of primitive monochromatic Pythagorean triples for every finite cyclic target; the only real risk is the precise reach of that external theorem.","tokens_in":4378,"tokens_out":2936,"would_cite":true,"duration_ms":28744,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D10","11D09","11N64"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every finite cyclic coloring of the integers admits infinitely many primitive monochromatic Pythagorean triples.","keywords":["Pythagorean triples","standard morphisms","completely multiplicative functions","unavoidability threshold","monochromatic colorings","finite cyclic groups","partition regularity","3-adic valuation"],"falsifier":"Exhibit a standard morphism f: N → Z/mZ such that the kernel of the induced homomorphism Q^×_{>0} → Z/mZ contains only finitely many Pythagorean pairs; the proof's infinite-bootstrap step would be directly contradicted. Equivalently, a finite search for a modulus m and a prime-coloring assignment whose primitive monochromatic triples do not grow without bound would refute Theorem 1.3.","tokens_in":1546,"feed_emoji":"📐","tokens_out":1606,"duration_ms":74495,"temperature":0.7,"pith_summary":"This paper proves that every completely multiplicative coloring of the positive integers by a finite cyclic group contains infinitely many Pythagorean triples whose three entries share the same color, and in fact infinitely many primitive ones. This settles the qualitative part of a problem from 2018 that had been verified only for moduli 2 and 3, by showing the answer is yes for every modulus m. The same result implies that the threshold T(m), the least hypotenuse size guaranteeing a primitive monochromatic triple for every such coloring, is finite for every m. A byproduct is an exact minimal hypotenuse for the 3-adic valuation coloring, (9^m+1)/2, and a monotonicity property T(d) ≤ T(m) whenever d divides m.","feed_headline":"Infinite monochromatic Pythagorean triples for standard morphisms","feed_subtitle":"For every modulus m, every completely multiplicative coloring has infinitely many monochromatic right triangles.","key_machinery":"The key object is the kernel H of the extended homomorphism Q^×_{>0} → Z/mZ, together with the seed theorem [2] that every completely multiplicative finite-valued map into the circle group admits an identity-valued Pythagorean triple. The separation lemma (Lemma 1.2) is the engine: for any finitely many ratios q_i ≠ 1 it constructs a prime ℓ ∤ m and a homomorphism λ to Z/ℓZ vanishing on none of them. Because Z/mZ × Z/ℓZ is cyclic, it embeds into the circle group, so the seed theorem can be reapplied inside H ∩ ker λ; this forces infinitely many Pythagorean pairs in H. The finiteness of T(m) is then obtained by covering the compact assignment space X_m = (Z/mZ)^P with clopen sets U_P indexed by primitive triples and taking a finite subcover.","core_discovery":"The central discovery is that one monochromatic Pythagorean pair forces infinitely many. Given a standard morphism f: N → Z/mZ, the paper extends it to a homomorphism f-hat: Q^×_{>0} → Z/mZ and studies the kernel H. An external theorem [2] guarantees that H contains at least one Pythagorean pair. The separation lemma then shows that if H contained only finitely many such pairs, one could choose a prime ℓ ∤ m and a homomorphism λ: Q^×_{>0} → Z/ℓZ nonzero on every ratio appearing in those pairs; because Z/mZ × Z/ℓZ is cyclic and embeds into the circle group, the external theorem applied again produces a Pythagorean pair in H ∩ ker λ, contradicting the choice of λ. Hence H contains infinitely many Pythagorean pairs, which scale to infinitely many primitive and identity-valued integral Pythagorean triples. A compactness argument over the product space (Z/mZ)^P then upgrades this to finiteness of the threshold T(m).","pith_inferences":["The compactness argument proving T(m) finite is non-constructive: it does not yield an explicit bound. Extracting an effective upper bound from the finite subcover is a concrete open direction the paper leaves untouched.","The proof uses cyclicity of Z/mZ in the step where Z/mZ × Z/ℓZ embeds into the circle group. Whether the analogous statement holds for finite non-cyclic abelian groups is a natural next question, since that embedding step would need replacement.","The valuation example suggests T(m) grows at least exponentially, roughly as (9^m + 1)/2; the paper leaves the true asymptotic growth of T(m) open."],"forward_implications":["For every m ≥ 1, every standard morphism f: N → Z/mZ has infinitely many primitive monochromatic Pythagorean triples.","The threshold T(m) is finite for every m, so every standard morphism has a primitive monochromatic triple with hypotenuse bounded by a number that depends only on m.","Corollary 1.4: if H is a subgroup of Q^×_{>0} with finite cyclic quotient, then every coset of H contains infinitely many Pythagorean triples entrywise.","For the morphism n ↦ v_3(n) mod m, the least possible hypotenuse of a primitive monochromatic triple is (9^m + 1)/2, giving the lower bound T(m) ≥ (9^m + 1)/2.","Thresholds are monotone under divisibility: T(d) ≤ T(m) whenever d divides m."],"supporting_citations":[{"why":"Poses Problem 4.3 and gives the threshold values T(2)=533 and T(3)=4633, the starting point this paper extends to all m.","marker":"[1]"},{"why":"Supplies Theorem 1.1, the initial identity-valued Pythagorean triple from which the paper bootstraps infinitude.","marker":"[2]"}],"fun_headline_variants":["One Pythagorean pair forces infinitely many","Standard morphisms have infinite monochromatic triples","Finite T(m) for all standard morphisms","Infinite primitive triples from any standard morphism","Every standard morphism yields infinite Pythagorean triples"],"cache_read_input_tokens":6528,"weakest_assumption_plain":"The load-bearing premise is the external result [2] that every completely multiplicative finite-valued coloring of the positive integers has at least one Pythagorean triple whose three entries all receive the same value; if that statement were false, incomplete, or inapplicable at the relevant moduli, Theorems 1.3 and 2.1 would not follow.","fun_headline_variants_meta":{"raw":{"variants":["One Pythagorean pair forces infinitely many","Standard morphisms have infinite monochromatic triples","Finite T(m) for all standard morphisms","Infinite primitive triples from any standard morphism","Every standard morphism yields infinite Pythagorean triples"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000196,"raw_usage":{"total_tokens":1331,"prompt_tokens":888,"completion_tokens":443,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":504,"completion_tokens_details":{"reasoning_tokens":373}},"tokens_in":504,"tokens_out":443,"duration_ms":4488,"temperature":1.0,"reasoning_tokens":373,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T00:22:31.802538+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhibit a standard morphism f: N → Z/mZ such that the kernel of the induced homomorphism Q^×_{>0} → Z/mZ contains only finitely many Pythagorean pairs; the proof's infinite-bootstrap step would be directly contradicted. Equivalently, a finite search for a modulus m and a prime-coloring assignment whose primitive monochromatic triples do not grow without bound would refute Theorem 1.3.","supporting_citations":[{"cited_title":"Eliahou, J","cited_arxiv_id":null,"evidence_quote":"Poses Problem 4.3 and gives the threshold values T(2)=533 and T(3)=4633, the starting point this paper extends to all m."}],"review_version":1}